Submission #991910


Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<set>
using namespace std;

int main(){
    int64_t N;
    cin>>N;
    int64_t lo,up;
    lo=0;up=10000;
    while(up-lo>1){
        int64_t mid=(lo+up)/2;
        int64_t z=mid*(mid+1)/2;
        if(z>=N){
            up=mid;
        }else{
            lo=mid;
        }
    }
    int i=up;
    while(N>0){
        if(N>=i){
            cout<<i<<endl;
            N=N-i;
        }
        i--;
    }
    //cout<<up<<endl;
    
    
    
    return 0;
}

Submission Info

Submission Time
Task B - Exactly N points
User cocococoa
Language C++14 (GCC 5.4.1)
Score 300
Code Size 602 Byte
Status AC
Exec Time 21 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 × 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 2 ms 256 KB
01-02.txt AC 2 ms 256 KB
01-03.txt AC 2 ms 256 KB
01-04.txt AC 3 ms 256 KB
01-05.txt AC 3 ms 256 KB
01-06.txt AC 3 ms 256 KB
01-07.txt AC 3 ms 256 KB
01-08.txt AC 3 ms 256 KB
01-09.txt AC 3 ms 256 KB
01-10.txt AC 3 ms 256 KB
02-01.txt AC 21 ms 256 KB
02-02.txt AC 21 ms 256 KB
02-03.txt AC 21 ms 256 KB
02-04.txt AC 21 ms 256 KB
02-05.txt AC 21 ms 256 KB
02-06.txt AC 12 ms 256 KB
02-07.txt AC 9 ms 256 KB
02-08.txt AC 20 ms 256 KB
sample-01.txt AC 2 ms 256 KB
sample-02.txt AC 2 ms 256 KB
sample-03.txt AC 2 ms 256 KB