Added new templates

Author: likecs

README.md

@@ -32,3 +32,9 @@ Below is a brief description of the files:
 
 * timer.cpp
 > It contains a small code snippet to print the time taken by the program to execute the given test case data.
+
+* java_template.java
+> It conatins the code template for java solutions.
+
+* python_template.py
+> It conatins the code template for python solutions.

java_template.java

@@ -0,0 +1,50 @@
+import java.io.*;
+import java.util.*;
+import java.math.*;
+ 
+public class Main {
+    public static void main(String[] args) throws Exception  {
+        InputStream inputStream = System.in;
+        OutputStream outputStream = System.out;
+        InputReader in = new InputReader(inputStream);
+        PrintWriter out = new PrintWriter(outputStream);
+        Task solver = new Task();
+        int tesCases = in.nextInt();
+        for(int test = 1; test <= tesCases; test += 1) {
+            solver.solve(test, in, out);
+        }
+        out.close();
+    }
+    
+    static class Task {
+        static final int MOD = (int) (1e9 + 7);
+
+        public void solve(int testNumber, InputReader in, PrintWriter out) {
+            //Your code goes below
+
+        }
+    }
+
+    static class InputReader {
+        public BufferedReader take;
+        public StringTokenizer split;
+        public InputReader(InputStream stream) {
+            take = new BufferedReader(new InputStreamReader(stream), 10000000);
+            split = null;
+        }
+        public String next() {
+            while (split == null || !split.hasMoreTokens()) {
+                try {
+                    split = new StringTokenizer(take.readLine());
+                } 
+                catch (IOException e) {
+                    throw new RuntimeException(e);
+                }
+            }
+            return split.nextToken();
+        }
+        public int nextInt() {
+            return Integer.parseInt(next());
+        }
+    }
+}

python_template.py

@@ -0,0 +1,48 @@
+#AUTHOR 		: 	BHUVNESH JAIN
+#INSTITUTION	: 	BITS, PILANI
+
+MAX = 100005
+MOD = 1000000007
+def add(a,b,c):
+	res=a+b
+	if(res>=c):
+		return res-c
+	else:
+		return res
+
+def mod(a,b,c):
+	res=a*b
+	if(res>=c):
+		return res%c
+	else:
+		return res
+
+def gcd(a,b):
+	while b:
+		a,b=b,a%b
+	return a
+
+def lcm(a,b):
+	w=a//gcd(a,b)
+	return w*b
+
+def expo(a,b):
+	x,y=1,a
+	while(b>0):
+		if(b&1):
+			x=x*y
+		y=y*y
+		b>>=1
+	return x
+
+def power(a,b,m):
+	x,y=1,
+	while(b>0):
+		if(b&1):
+			x=mod(x,y,m)
+		y=mod(y,y,m)
+		b>>=1
+	return x	
+
+if __name__ == "__main__":
+	#code goes below79