Submission #991788
Source Code Expand
import java.io.IOException; import java.io.InputStream; import java.io.PrintStream; import java.util.NoSuchElementException; public class Main { static FastScanner sc = new FastScanner(); static PrintStream out = System.out; public static void main(String args[]) { int N = ni(); int min = (int) Math.ceil((Math.sqrt(1 + 8 * N) / 2 - 0.5)); for (int i=min;i>=1;i--) { if (N >= i) { System.out.println(i); N -= i; } } } private static String next() { return sc.next(); } private static int ni() { return sc.nextInt(); } private static long nl() { return sc.nextLong(); } private static int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++) a[i] = ni(); return a; } private static long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++) a[i] = ni(); return a; } private static double nd() { return Double.parseDouble( next() ); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } }
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | yamatchan |
Language | Java8 (OpenJDK 1.8.0) |
Score | 300 |
Code Size | 3638 Byte |
Status | AC |
Exec Time | 200 ms |
Memory | 10428 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 100 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt, sample-03.txt |
dataset1 | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt |
dataset2 | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 100 ms | 8020 KB |
01-02.txt | AC | 98 ms | 8148 KB |
01-03.txt | AC | 96 ms | 8144 KB |
01-04.txt | AC | 99 ms | 8148 KB |
01-05.txt | AC | 99 ms | 8148 KB |
01-06.txt | AC | 102 ms | 8148 KB |
01-07.txt | AC | 100 ms | 8020 KB |
01-08.txt | AC | 100 ms | 8016 KB |
01-09.txt | AC | 100 ms | 8016 KB |
01-10.txt | AC | 102 ms | 8020 KB |
02-01.txt | AC | 195 ms | 10300 KB |
02-02.txt | AC | 196 ms | 10196 KB |
02-03.txt | AC | 195 ms | 10068 KB |
02-04.txt | AC | 196 ms | 10428 KB |
02-05.txt | AC | 200 ms | 10324 KB |
02-06.txt | AC | 149 ms | 9428 KB |
02-07.txt | AC | 138 ms | 9292 KB |
02-08.txt | AC | 192 ms | 10064 KB |
sample-01.txt | AC | 99 ms | 8020 KB |
sample-02.txt | AC | 100 ms | 8020 KB |
sample-03.txt | AC | 98 ms | 8020 KB |