Submission #1167315

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cstdint>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<math.h>

using namespace std;

typedef long long ll;

double abs(double d){
    if(d>=0)return d;
    return -1.0*d;
}

int main() {
    int n;
    ll x;
    cin>>x;
    ll s=0;
    for(int i=1;;i++){
        s+=i;
        if(s>=x){
            cout<<i<<endl;
            return 0;
        }
    }
    
    return 0;
}

Submission Info

Judge Result