solution of problem A, codeforces round 734, Div 3

Author: NirmalSilwal

Codeforces/livecontest/Round734Div3/A.java

@@ -0,0 +1,88 @@
+package livecontest.Round734Div3;
+
+import java.io.PrintWriter;
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.io.IOException;
+import java.util.StringTokenizer;
+
+public class A {
+
+	public static void main(String[] args) {
+		FastReader sc = new FastReader();
+		PrintWriter out = new PrintWriter(System.out);
+
+		int t = sc.nextInt();
+		for (int tt = 0; tt < t; tt++) {
+			int n = sc.nextInt();
+			solveTask(n, out);
+		}
+
+		out.close();
+	}
+
+	private static void solveTask(int n, PrintWriter out) {
+
+		int c1 = (n / 3);
+		int c2 = (n - c1) / 2;
+
+		int left = n - (c1 + 2 * c2);
+		c1 += left;
+
+		out.println(c1 + " " + c2);
+	}
+
+	/*
+	 * private static long gcd(long a, long b) { if (b == 0) return a; return
+	 * gcd(b, a % b); }
+	 */
+	static class FastReader {
+		BufferedReader br;
+		StringTokenizer st;
+
+		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;
+		}
+
+		int[] readArray(int n) {
+			int[] temparr = new int[n];
+			for (int i = 0; i < n; i++) {
+				temparr[i] = nextInt();
+			}
+			return temparr;
+		}
+	}
+}