Submission #5429538


Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <numeric>
    
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;

int main(){

    ll N;
    cin >> N;

    ll sum = 0;
    ll n_max = 0;
    for(int i = 1; i <= N; i++){
        sum += i;
        if(sum >= N){
            n_max = i;
            break;
        }
    }

    for(int i = n_max; i >= 1; i--){
        if(N >= i){
            N -= i;
            cout << i << endl;
        }
        if(N == 0) break;
    }


}

Submission Info

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

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 13
AC × 24
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, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
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 8 ms 256 KB
02-02.txt AC 8 ms 256 KB
02-03.txt AC 8 ms 256 KB
02-04.txt AC 8 ms 256 KB
02-05.txt AC 8 ms 256 KB
02-06.txt AC 5 ms 256 KB
02-07.txt AC 4 ms 256 KB
02-08.txt AC 8 ms 256 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB