CODE FESTIVAL 2016 Final

Submission #5421699

Source codeソースコード

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll 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<ll> ans;
    for (ll i = n + 1; i >= 0; i--) {
        if (sum[i] < n) {
            ans.insert(i + 1);
            n -= (i + 1);
        }
        if (n == 0) break;
    }

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

Submission

Task問題 B - Exactly N points
User nameユーザ名 uemt1
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 WA
Score得点 200
Source lengthソースコード長 612 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
sample - 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 0 / 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 1 ms 256 KB
01-06.txt AC 1 ms 256 KB
01-07.txt AC 1 ms 256 KB
01-08.txt AC 1 ms 256 KB
01-09.txt AC 1 ms 256 KB
01-10.txt AC 1 ms 256 KB
02-01.txt AC 60 ms 78592 KB
02-02.txt WA
02-03.txt AC 60 ms 78592 KB
02-04.txt AC 61 ms 78592 KB
02-05.txt WA
02-06.txt AC 20 ms 22144 KB
02-07.txt AC 11 ms 10368 KB
02-08.txt AC 56 ms 72832 KB
sample-01.txt AC 2 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB