Maths Adhoc, Fast IO

Author: ivorynoise

.gitignore

@@ -1,2 +1,5 @@
 *.out
-*.exe
+*.exe
+in
+*.class
+test.*

11723-d.cpp

@@ -0,0 +1,27 @@
+#include <iostream>
+#include <cmath>
+#include <cstdio>
+using namespace std;
+int main(){
+	int nstreets, nNumbers;
+		// Scanner s = new Scanner(System.in);
+
+		// nstreets = s.nextInt();
+		// nNumbers = s.nextInt();
+		cin >> nstreets >> nNumbers;
+		int c = 0;
+		while (nstreets != 0 && nNumbers != 0) {
+			nstreets -= nNumbers;
+			// int nAlpha = (int)Math.ceil((double)nstreets / nNumbers);
+			int nAlpha = ceil(1.0 * nstreets / nNumbers);
+
+			printf("Case %d: ", ++c);
+
+			if (nAlpha > 26) puts("impossible");
+			else cout << nAlpha << "\n";
+
+			// nstreets = s.nextInt();
+			// nNumbers = s.nextInt();
+			cin >> nstreets >> nNumbers;
+		}
+}

11723-d.java

@@ -0,0 +1,25 @@
+import java.util.*;
+import java.io.*;
+public class uva11723_deepak {
+	public static void main(String[] args) {
+		//TODO TLE : Slow Input and Output
+		int nstreets, nNumbers;
+		// Scanner s = new Scanner(System.in);
+		FastReader s = new FastReader();
+		nstreets = s.nextInt();
+		nNumbers = s.nextInt();
+		int c = 0;
+		while (nstreets != 0 && nNumbers != 0) {
+			nstreets -= nNumbers;
+			int nAlpha = (int)Math.ceil((double)nstreets / nNumbers);
+
+			System.out.printf("Case %d: ", ++c);
+
+			if (nAlpha > 26) System.out.println("impossible");
+			else System.out.println(nAlpha);
+
+			nstreets = s.nextInt();
+			nNumbers = s.nextInt();
+		}
+	}
+}

11875-d.java

@@ -0,0 +1,65 @@
+
+import java.util.*;
+import java.io.*;
+class Main {
+	// public static void main(){
+	public static void main(String args[]){
+		FastReader s = new FastReader();
+		int n = s.nextInt();
+		int c = 0;
+		while(n-- > 0){
+			int x = s.nextInt();
+			int i = x / 2 + 1;
+			int cur, ans = 0;
+			for(int j = 0; j < x; ++j){
+				cur = s.nextInt();
+				--i;
+				if (i == 0) ans = cur;
+			}
+			System.out.printf("Case %d: %d\n", ++c, ans);
+		}
+	}
+	
+	static class FastReader {
+		BufferedReader br;
+		StringTokenizer st;
+
+		public FastReader() {
+			br = new BufferedReader(new
+			                        InputStreamReader(System.in));
+		}
+
+		String next() {
+			while (st == null || !st.hasMoreElements()) {
+				try {
+					st = new StringTokenizer(br.readLine());
+				} catch (IOException  e) {
+					e.printStackTrace();
+				}
+			}
+			return st.nextToken();
+		}
+
+		int nextInt() {
+			return Integer.parseInt(next());
+		}
+
+		long nextLong() {
+			return Long.parseLong(next());
+		}
+
+		double nextDouble() {
+			return Double.parseDouble(next());
+		}
+
+		String nextLine() {
+			String str = "";
+			try {
+				str = br.readLine();
+			} catch (IOException e) {
+				e.printStackTrace();
+			}
+			return str;
+		}
+	}
+}

INTEST-d.cpp

@@ -0,0 +1,13 @@
+#include <iostream>
+#include <cstdio>
+using namespace std;
+int main(){
+	int n, k, x, c = 0;
+	cin >> n >> k;
+	while(n--){
+		//use scanf for high input
+		scanf("%d", &x);
+		if (x % k == 0) ++c;
+	}
+	cout << c;
+}

INTEST-d.java

@@ -0,0 +1,75 @@
+import java.util.*;
+import java.io.*;
+class INTEST_deepak{
+	static class FastReader
+    {
+        BufferedReader br;
+        StringTokenizer st;
+ 
+        public FastReader()
+        {
+            br = new BufferedReader(new
+                     InputStreamReader(System.in));
+        }
+ 
+        String next()
+        {
+            while (st == null || !st.hasMoreElements())
+            {
+                try
+                {
+                    st = new StringTokenizer(br.readLine());
+                }
+                catch (IOException  e)
+                {
+                    e.printStackTrace();
+                }
+            }
+            return st.nextToken();
+        }
+ 
+        int nextInt()
+        {
+            return Integer.parseInt(next());
+        }
+ 
+        long nextLong()
+        {
+            return Long.parseLong(next());
+        }
+ 
+        double nextDouble()
+        {
+            return Double.parseDouble(next());
+        }
+ 
+        String nextLine()
+        {
+            String str = "";
+            try
+            {
+                str = br.readLine();
+            }
+            catch (IOException e)
+            {
+                e.printStackTrace();
+            }
+            return str;
+        }
+    }
+
+	public static void main(String args[]){
+		FastReader s = new FastReader();
+		// Scanner s = new Scanner(System.in);
+		int n = s.nextInt();
+		int t = s.nextInt();
+		int x;
+		int c = 0;
+		while(n-- > 0){
+			x  = s.nextInt();
+			if (x % t == 0) ++c;
+		}
+
+		System.out.printf("%d", c);
+	}
+}

in

@@ -1,4 +1,3 @@
-3 4
-1
-0
-4
+2
+5 19 17 16 14 12
+5 12 14 16 17 18