Submission #991891


Source Code Expand

#include <cstdio>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>

using namespace std;

bool testcase_ends() {
    int N;
    if (scanf("%d", &N) == EOF)
        return 1;

    int i;
    for (i=0; i*(i+1)/2<N; ++i);

    for (int j=N; j>0; --i) {
        if (i > j) continue;

        j -= i;
        printf("%d\n", i);
    }

    return 0;
}

int main() {
    bool solved=false;
    while (!testcase_ends())
        solved |= 1;

    return !solved;
}

Submission Info

Submission Time
Task B - Exactly N points
User rsk0315
Language C++14 (GCC 5.4.1)
Score 300
Code Size 514 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
AC × 3
AC × 13
AC × 21
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 1 ms 128 KB
01-02.txt AC 1 ms 128 KB
01-03.txt AC 1 ms 128 KB
01-04.txt AC 1 ms 128 KB
01-05.txt AC 1 ms 128 KB
01-06.txt AC 1 ms 128 KB
01-07.txt AC 1 ms 128 KB
01-08.txt AC 1 ms 128 KB
01-09.txt AC 1 ms 128 KB
01-10.txt AC 1 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 1 ms 128 KB
02-08.txt AC 2 ms 128 KB
sample-01.txt AC 1 ms 128 KB
sample-02.txt AC 1 ms 128 KB
sample-03.txt AC 1 ms 128 KB