Submission #23581958


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;


#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<int>>;


int main(){
  ll n;
  cin >> n;

  ll i = 1;

  ll sum = 0;
  while(true){
    sum += i;

    if(sum>=n){
      cout << i <<endl;
      return 0;
    }

    i++;
  }

}

Submission Info

Submission Time
Task B - Savings
User takkey
Language C++ (GCC 9.2.1)
Score 200
Code Size 687 Byte
Status AC
Exec Time 7 ms
Memory 3600 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 3572 KiB
sample_02.txt AC 2 ms 3556 KiB
test_01.txt AC 2 ms 3568 KiB
test_02.txt AC 2 ms 3528 KiB
test_03.txt AC 4 ms 3408 KiB
test_04.txt AC 2 ms 3412 KiB
test_05.txt AC 3 ms 3572 KiB
test_06.txt AC 2 ms 3524 KiB
test_07.txt AC 2 ms 3528 KiB
test_08.txt AC 2 ms 3600 KiB