my python competitve programming template

my_python_template.py

#Problem Name
import datetime as dt
from operator import itemgetter
import itertools as iter
from collections import Counter
from collections import deque
from heapq import nlargest, nsmallest
import queue as Q
import math as m
import copy as c
# from cp_utils import swap, findFreq, isPalindrome, findAllNOOccurences, findAllOOccurences

#input

# n = int(input())
# n = int(file.readline().rstrip())
# int_arr = list(map(int, input().rstrip().split()))
# int_arr = list(map(int, file.readline().rstrip().split()))
# char_arr = input().split()
# char_arr = file.readline().rstrip().split()
# st = input()
# st = file.readline().rstrip()

def solution():
    # Write your code here
    
    pass



#input/output

file = open('input.txt', 'r')
initial_time = dt.datetime.now()
T = 1
T = int(file.readline().rstrip())
for t in range(T):
    ans = solution()
    print("Case #{}: {}".format(t+1, ans))
final_time = dt.datetime.now()
file.close()
#######################################################
# try:
#     T = 1
#     T = int(input())
#     for t in range(T):
#         solution()
# except EOFError:
#     pass
#######################################################
print("--Executed in {} seconds".format((final_time-initial_time).total_seconds()))


#input/output for kickstart
# T = int(input())
# for t in range(T):
#     ans = solution()
#     print("Case #{}: {}".format(t+1, ans))