Submission #2472335


Source Code Expand

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static int modP = 1000000007;

	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };

	static class TaskX {
		public void solve(int testNumber, InputReader in, PrintWriter out) {

			String[] s = in.nextString().split("/");
			long x = Long.parseLong(s[0]);
			long y = Long.parseLong(s[1]);

			long g = gcd(x, y);
			x /= g;
			y /= g;

			boolean isFound = false;

			for (long i = (2*x-y)/y/y; i <= (2*x+y)/y/y+1; i++) {
				long n = i*y;
				long sum = n*(n+1)/2;
				long m = sum - i*x;

				if (1 <= m && m <= n) {
					out.println(n +" "+ m);
					isFound = true;
				}
			}

			if (!isFound) {
				out.println("Impossible");
			}

		}
	}

	public static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}

	}

}

Submission Info

Submission Time
Task C - 平均値太郎の憂鬱 ( The melancholy of Taro Heikinchi )
User tutuz
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 2482 Byte
Status AC
Exec Time 73 ms
Memory 22868 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 60
Set Name Test Cases
All 00_killer.txt, 00_max.txt, 00_min.txt, 00_min2.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_rnd2_00.txt, 02_rnd2_01.txt, 02_rnd2_02.txt, 02_rnd2_03.txt, 02_rnd2_04.txt, 02_rnd2_05.txt, 02_rnd2_06.txt, 02_rnd2_07.txt, 02_rnd2_08.txt, 02_rnd2_09.txt, 02_rnd2_10.txt, 02_rnd2_11.txt, 02_rnd2_12.txt, 02_rnd2_13.txt, 02_rnd2_14.txt, 02_rnd2_15.txt, 02_rnd2_16.txt, 02_rnd2_17.txt, 02_rnd2_18.txt, 02_rnd2_19.txt, 03_smallrnd_00.txt, 03_smallrnd_01.txt, 03_smallrnd_02.txt, 03_smallrnd_03.txt, 03_smallrnd_04.txt, 03_smallrnd_05.txt, 03_smallrnd_06.txt, 03_smallrnd_07.txt, 03_smallrnd_08.txt, 03_smallrnd_09.txt, 04_primes_01.txt, 04_primes_02.txt
Case Name Status Exec Time Memory
00_killer.txt AC 71 ms 19028 KB
00_max.txt AC 71 ms 21204 KB
00_min.txt AC 69 ms 17876 KB
00_min2.txt AC 70 ms 21332 KB
00_sample_01.txt AC 70 ms 20820 KB
00_sample_02.txt AC 71 ms 19156 KB
00_sample_03.txt AC 69 ms 16468 KB
00_sample_04.txt AC 72 ms 21076 KB
01_rnd_00.txt AC 70 ms 19412 KB
01_rnd_01.txt AC 70 ms 19796 KB
01_rnd_02.txt AC 70 ms 18388 KB
01_rnd_03.txt AC 72 ms 19028 KB
01_rnd_04.txt AC 71 ms 16596 KB
01_rnd_05.txt AC 71 ms 18516 KB
01_rnd_06.txt AC 73 ms 19028 KB
01_rnd_07.txt AC 69 ms 18900 KB
01_rnd_08.txt AC 71 ms 20052 KB
01_rnd_09.txt AC 70 ms 21332 KB
01_rnd_10.txt AC 72 ms 20564 KB
01_rnd_11.txt AC 70 ms 19412 KB
01_rnd_12.txt AC 72 ms 21204 KB
01_rnd_13.txt AC 70 ms 15956 KB
01_rnd_14.txt AC 69 ms 19540 KB
01_rnd_15.txt AC 71 ms 18516 KB
01_rnd_16.txt AC 70 ms 21460 KB
01_rnd_17.txt AC 71 ms 19668 KB
01_rnd_18.txt AC 69 ms 18260 KB
01_rnd_19.txt AC 72 ms 18900 KB
02_rnd2_00.txt AC 69 ms 18516 KB
02_rnd2_01.txt AC 72 ms 19284 KB
02_rnd2_02.txt AC 70 ms 19412 KB
02_rnd2_03.txt AC 71 ms 18900 KB
02_rnd2_04.txt AC 70 ms 21460 KB
02_rnd2_05.txt AC 71 ms 20820 KB
02_rnd2_06.txt AC 71 ms 19028 KB
02_rnd2_07.txt AC 69 ms 18644 KB
02_rnd2_08.txt AC 70 ms 17876 KB
02_rnd2_09.txt AC 69 ms 20180 KB
02_rnd2_10.txt AC 71 ms 18644 KB
02_rnd2_11.txt AC 71 ms 19924 KB
02_rnd2_12.txt AC 68 ms 17620 KB
02_rnd2_13.txt AC 71 ms 20948 KB
02_rnd2_14.txt AC 71 ms 18388 KB
02_rnd2_15.txt AC 69 ms 18900 KB
02_rnd2_16.txt AC 70 ms 21204 KB
02_rnd2_17.txt AC 71 ms 19668 KB
02_rnd2_18.txt AC 71 ms 21588 KB
02_rnd2_19.txt AC 70 ms 18260 KB
03_smallrnd_00.txt AC 71 ms 17748 KB
03_smallrnd_01.txt AC 71 ms 21460 KB
03_smallrnd_02.txt AC 72 ms 18388 KB
03_smallrnd_03.txt AC 71 ms 18516 KB
03_smallrnd_04.txt AC 72 ms 19924 KB
03_smallrnd_05.txt AC 71 ms 18900 KB
03_smallrnd_06.txt AC 72 ms 19412 KB
03_smallrnd_07.txt AC 70 ms 21460 KB
03_smallrnd_08.txt AC 69 ms 17876 KB
03_smallrnd_09.txt AC 69 ms 19412 KB
04_primes_01.txt AC 73 ms 19668 KB
04_primes_02.txt AC 71 ms 22868 KB