Submission #5421720


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 2e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122

int main() {
    ll n;
    cin >> n;
    ll sum[n + 1] = {};
    rep(i, 1, n + 1) sum[i] = sum[i - 1] + i;
    set<int> ans;
    rep(i, 0, n + 1) {
        if (n <= sum[i]) {
            rep(j, 1, i + 1) {
                if (sum[i] - j != n) ans.insert(j);
            }
            break;
        }
    }

    for (auto i : ans) cout << i << endl;
    return 0;
}

Submission Info

Submission Time
Task B - Exactly N points
User uemt1
Language C++14 (GCC 5.4.1)
Score 300
Code Size 633 Byte
Status
Exec Time 50 ms
Memory 78592 KB

Judge Result

Set Name Score / Max Score Test Cases
sample 0 / 0 sample-01.txt, sample-02.txt, sample-03.txt
dataset1 200 / 200 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 100 / 100 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, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt 1 ms 256 KB
01-02.txt 1 ms 256 KB
01-03.txt 1 ms 256 KB
01-04.txt 1 ms 256 KB
01-05.txt 1 ms 256 KB
01-06.txt 1 ms 256 KB
01-07.txt 1 ms 256 KB
01-08.txt 1 ms 256 KB
01-09.txt 1 ms 256 KB
01-10.txt 1 ms 256 KB
02-01.txt 50 ms 78592 KB
02-02.txt 50 ms 78592 KB
02-03.txt 50 ms 78592 KB
02-04.txt 50 ms 78592 KB
02-05.txt 50 ms 78592 KB
02-06.txt 17 ms 22144 KB
02-07.txt 9 ms 10496 KB
02-08.txt 47 ms 72832 KB
sample-01.txt 1 ms 256 KB
sample-02.txt 1 ms 256 KB
sample-03.txt 1 ms 256 KB