Submission #991819


Source Code Expand

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

int main(void) {
    int i, n;
    scanf("%d",&n);
    int l = 0, r = 1e7;
    while (l + 1 < r) {
        int m = (l + r) / 2;
        int rest = n;
        RREP (i,m,1) if (rest >= i) {
            rest -= i;
        }
        if (rest == 0)
            r = m;
        else
            l = m;
    }
    int rest = n;
    RREP (i,r,1) if (rest >= i) {
        rest -= i;
        printf("%d\n",i);
    }
    return 0;
}

Submission Info

Submission Time
Task B - Exactly N points
User h_noson
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1007 Byte
Status AC
Exec Time 13 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:22:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^

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 13 ms 256 KB
01-02.txt AC 13 ms 256 KB
01-03.txt AC 13 ms 256 KB
01-04.txt AC 13 ms 256 KB
01-05.txt AC 13 ms 256 KB
01-06.txt AC 13 ms 256 KB
01-07.txt AC 13 ms 256 KB
01-08.txt AC 13 ms 256 KB
01-09.txt AC 13 ms 256 KB
01-10.txt AC 13 ms 256 KB
02-01.txt AC 13 ms 256 KB
02-02.txt AC 13 ms 256 KB
02-03.txt AC 13 ms 256 KB
02-04.txt AC 13 ms 256 KB
02-05.txt AC 13 ms 256 KB
02-06.txt AC 13 ms 256 KB
02-07.txt AC 13 ms 256 KB
02-08.txt AC 13 ms 256 KB
sample-01.txt AC 13 ms 256 KB
sample-02.txt AC 13 ms 256 KB
sample-03.txt AC 13 ms 256 KB