Submission #11608986


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    ll N;
    cin >> N;
    vector<ll> A(11, 1);
    vector<ll> B(0);
    for (ll i = 0; i < 10; i++)
    {   
        B.push_back(i + 1);
        if (A.at(i) == N) {
             break;
        }
        else if (A.at(i) > N){
            B.erase(B.begin() + A.at(i)-N -1 );
            break;
        }
        A.at(i + 1) = A.at(i) + (i + 2);
     
        
    }
    for (ll i: B)
    {
        cout << i << endl;
    }
    
    
}

Submission Info

Submission Time
Task B - Exactly N points
User Kaiyama
Language C++14 (GCC 5.4.1)
Score 0
Code Size 545 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 0 / 200 0 / 100
Status
AC × 3
AC × 6
WA × 7
AC × 9
WA × 15
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 WA 1 ms 256 KB
01-05.txt WA 1 ms 256 KB
01-06.txt WA 1 ms 256 KB
01-07.txt WA 1 ms 256 KB
01-08.txt WA 1 ms 256 KB
01-09.txt WA 1 ms 256 KB
01-10.txt WA 1 ms 256 KB
02-01.txt WA 1 ms 256 KB
02-02.txt WA 1 ms 256 KB
02-03.txt WA 1 ms 256 KB
02-04.txt WA 1 ms 256 KB
02-05.txt WA 1 ms 256 KB
02-06.txt WA 1 ms 256 KB
02-07.txt WA 1 ms 256 KB
02-08.txt WA 1 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