Submission #2851422


Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;
	static boolean debug = false;

	static void solve() {
		int n = ir.nextInt();
		if (n == 3) {
			out.println("2 5 63");
			return;
		}
		ArrayList<Integer> m = new ArrayList<>();
		m.add(2);
		m.add(3);
		m.add(4);
		for (int i = 6; i <= 30000; i++)
			if (i % 2 == 0 || i % 3 == 0)
				m.add(i);
		if (n % 4 == 0) {
			for (int i = 0; i < n - 1; i++) {
				out.print(m.get(i) + " ");
			}
			out.println(m.get(n + 1));
		} else if (n % 4 == 1) {
			{
				for (int i = 0; i < n - 1; i++) {
					out.print(m.get(i) + " ");
				}
				out.println(m.get(n));
			}
		} else if (n % 4 == 2) {
			for (int i = 0; i < n; i++) {
				if (i == n - 2)
					continue;
				out.print(m.get(i) + " ");
			}
			out.println(m.get(n + 1));
		} else {
			for (int i = 0; i < n; i++) {
				out.print(m.get(i) + (i == n - 1 ? "\n" : " "));
			}
		}
	}

	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

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

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

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

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}

	static void tr(Object... o) {
		if (debug)
			out.println(Arrays.deepToString(o));
	}
}

Submission Info

Submission Time
Task B - GCD Sequence
User holeguma
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 4077 Byte
Status RE
Exec Time 114 ms
Memory 26708 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 2
AC × 20
WA × 19
RE × 1
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt RE 111 ms 26708 KB
02.txt AC 74 ms 20180 KB
03.txt AC 72 ms 17492 KB
04.txt AC 74 ms 18772 KB
05.txt WA 74 ms 20692 KB
06.txt WA 71 ms 18900 KB
07.txt WA 71 ms 21332 KB
08.txt WA 72 ms 19028 KB
09.txt AC 72 ms 19284 KB
10.txt AC 75 ms 20692 KB
11.txt AC 74 ms 20564 KB
12.txt AC 73 ms 18772 KB
13.txt WA 73 ms 21332 KB
14.txt WA 73 ms 19156 KB
15.txt WA 75 ms 20052 KB
16.txt WA 106 ms 25172 KB
17.txt WA 111 ms 26324 KB
18.txt WA 113 ms 24020 KB
19.txt WA 114 ms 24532 KB
20.txt AC 107 ms 26580 KB
21.txt AC 114 ms 26068 KB
22.txt AC 102 ms 26452 KB
23.txt AC 113 ms 26196 KB
24.txt WA 102 ms 24788 KB
25.txt WA 105 ms 22996 KB
26.txt WA 102 ms 23764 KB
27.txt WA 110 ms 24788 KB
28.txt AC 110 ms 25428 KB
29.txt AC 114 ms 24404 KB
30.txt AC 101 ms 24532 KB
31.txt AC 106 ms 26324 KB
32.txt WA 80 ms 21332 KB
33.txt AC 73 ms 19284 KB
34.txt AC 107 ms 23252 KB
35.txt WA 91 ms 20436 KB
36.txt WA 97 ms 21588 KB
37.txt WA 112 ms 23764 KB
38.txt AC 87 ms 21204 KB
s1.txt AC 69 ms 18644 KB
s2.txt AC 73 ms 19028 KB