Submission #991860

Source Code Expand

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

int N;
ll imos[10000];

int main(){
    cin >> N;
    for(int i=1; i<10000; i++)
        imos[i] = imos[i-1] + i;
    
    cout << lower_bound(imos, imos+10000, N) - imos << endl;;
    return 0;
}

Submission Info

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

Judge Result

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