Submission #993937
Source Code Expand
#include <stdio.h> int main(void){ int N; scanf("%d", &N); int i = 1; int max_total = 0; // i未満の数値の合計値の最大 while (max_total + i < N){ max_total += i; i++; } printf("%d\n", i); int rest = N - i; while (rest != 0) { i--; if (rest >= i) { printf("%d\n", i); rest -= i; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | shiita0903 |
Language | C (Clang 3.8.0) |
Score | 300 |
Code Size | 360 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 128 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 | 2 ms | 128 KB |
01-02.txt | AC | 2 ms | 128 KB |
01-03.txt | AC | 2 ms | 128 KB |
01-04.txt | AC | 2 ms | 128 KB |
01-05.txt | AC | 2 ms | 128 KB |
01-06.txt | AC | 2 ms | 128 KB |
01-07.txt | AC | 2 ms | 128 KB |
01-08.txt | AC | 2 ms | 128 KB |
01-09.txt | AC | 2 ms | 128 KB |
01-10.txt | AC | 2 ms | 128 KB |
02-01.txt | AC | 2 ms | 128 KB |
02-02.txt | AC | 2 ms | 128 KB |
02-03.txt | AC | 2 ms | 128 KB |
02-04.txt | AC | 2 ms | 128 KB |
02-05.txt | AC | 2 ms | 128 KB |
02-06.txt | AC | 2 ms | 128 KB |
02-07.txt | AC | 2 ms | 128 KB |
02-08.txt | AC | 2 ms | 128 KB |
sample-01.txt | AC | 1 ms | 128 KB |
sample-02.txt | AC | 2 ms | 128 KB |
sample-03.txt | AC | 1 ms | 128 KB |