Submission #23575906

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <unordered_set>
#include <map>
#include <algorithm>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for(int i=0;i<(int)n;i++)

struct Edge {
  int to; // 隣接頂点番号
  long long w; // 重み
  Edge(int to, long long w) : to(to), w(w) {}
};
// using Graph = vector<vector<Edge> >;
// using Graph = vector<vector<int> >;

struct UnionFind {
  vector<int> par, siz;

  UnionFind(int n) : par(n, -1), siz(n, 1) {}

  int root(int x) {
    if(par[x] == -1) return x;
    else return par[x] = root(par[x]);
  }

  bool issame(int x, int y) {
    return root(x) == root(y);
  }

  bool unite(int x, int y) {
    x = root(x); y = root(y);
    if(x == y) return false;

    if(siz[x] < siz[y]) swap(x, y);

    par[x] = y;
    siz[x] += siz[y];
    return true;
  }

  int size(int x) {
    return siz[root(x)];
  }
};

int main() {
  int N;
  cin >> N;
  
  ll sum = 0;
  ll day = 0;

  for(ll i=1;;i++) {
    sum += i;
    day++;
    if(sum >= N) break;
  }

  cout << day << endl;
}

Submission Info

Judge Result