Submission #23584307

Source Code Expand

#include<iostream>
#include<vector>
#include<cmath>
#include<string>
#include<algorithm>
#include<map>
#include<utility>
#include<cstdio>
#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const long long INF = 1LL<<60;

typedef pair<ll,ll> Pair;
int main(){

    ll N;

    cin >> N;

    ll ans = 0;
    ll sum = 0;

    for (ll i = 1; i <= N;++i)
    {
        sum += i;
        if(N <=sum){
            ans = i;
            break;
        }
    }

    cout << ans << endl;

    return 0;

}

Submission Info

Submission Time
Task B - Savings
User MurATa25
Language C++ (GCC 9.2.1)
Score 200
Code Size 550 Byte
Status AC
Exec Time 7 ms
Memory 3604 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt
Case Name Status Exec Time Memory
sample_01.txt AC 7 ms 3536 KiB
sample_02.txt AC 2 ms 3532 KiB
test_01.txt AC 3 ms 3568 KiB
test_02.txt AC 2 ms 3408 KiB
test_03.txt AC 2 ms 3536 KiB
test_04.txt AC 2 ms 3600 KiB
test_05.txt AC 2 ms 3604 KiB
test_06.txt AC 2 ms 3568 KiB
test_07.txt AC 2 ms 3532 KiB
test_08.txt AC 2 ms 3420 KiB