problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define console
using namespace std;
#ifndef console
ifstream fin("data.in");
ofstream fout("data.out");
#else
#define fin cin
#define fout cout
#endif
#define usain_bolt() \
(ios_base::sync_with_stdio(false), fin.tie(NULL), fout.tie(NULL))
typedef long long ll;
int main() {
usain_bolt();
ll x;
fin >> x;
int p = 100, rez = 0;
while (p < x) {
p += p / 100;
++rez;
}
fout << rez;
#ifndef console
fin.close(), fout.close();
#endif
return 0;
}
| #include <bits/stdc++.h>
#define console
using namespace std;
#ifndef console
ifstream fin("data.in");
ofstream fout("data.out");
#else
#define fin cin
#define fout cout
#endif
#define usain_bolt() \
(ios_base::sync_with_stdio(false), fin.tie(NULL), fout.tie(NULL))
typedef long long ll;
int main() {
usain_bolt();
ll x;
fin >> x;
ll p = 100, rez = 0;
while (p < x) {
p += p / 100;
++rez;
}
fout << rez;
#ifndef console
fin.close(), fout.close();
#endif
return 0;
}
| replace | 17 | 18 | 17 | 18 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, sum = 100, i = 0;
cin >> X;
while (sum < X) {
sum += sum / 100;
i++;
}
cout << i;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long X, sum = 100, i = 0;
cin >> X;
while (sum < X) {
sum += sum / 100;
i++;
}
cout << i;
}
| replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int X, num = 100, cou = 0;
cin >> X;
while (true) {
num += num * 0.01;
cou++;
if (num >= X)
break;
}
cout << cou << endl;
} | #include <iostream>
using namespace std;
int main() {
unsigned long int X, num = 100;
int cou = 0;
cin >> X;
while (true) {
num += num * 0.01;
cou++;
if (num >= X)
break;
}
cout << cou << endl;
} | replace | 3 | 4 | 3 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, count = 0;
cin >> x;
long long a = 100;
while (a < x) {
a += (1 / 100) * a;
count++;
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, count = 0;
cin >> x;
long long a = 100;
while (a < x) {
a += a / 100;
count++;
}
cout << count << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 100, x;
int year = 0;
cin >> x;
while (a < x) {
a = a * 1.01;
year = year + 1;
}
cout << year << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, x;
a = 100;
int year = 0;
cin >> x;
while (a < x) {
a = a * 1.01;
year = year + 1;
}
cout << year << endl;
}
| replace | 4 | 5 | 4 | 6 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iso646.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#ifndef M_PI
#define M_PI 3.14159265358979
#endif
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
int main() {
ll i, j, k;
ll X;
cin >> X;
ll ans = 1;
ll now = 100;
while (1) {
now = now * 101 / 100;
if (now >= X) {
cout << ans << endl;
return 0;
}
ans++;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iso646.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#ifndef M_PI
#define M_PI 3.14159265358979
#endif
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
int main() {
ll i, j, k;
ll X;
cin >> X;
ll ans = 1;
ll now = 100;
while (1) {
now += now / 100;
if (now >= X) {
cout << ans << endl;
return 0;
}
ans++;
}
return 0;
} | replace | 40 | 41 | 40 | 41 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
int year = 0;
long long s = 100;
while (s < X) {
s = s * 101 / 100;
year++;
}
cout << year << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
int year = 0;
long long s = 100;
while (s < X) {
s = s + s / 100;
year++;
}
cout << year << endl;
}
| replace | 11 | 12 | 11 | 12 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
int main() {
int64_t x;
std::cin >> x;
int count = 0, money = 100;
while (money < x) {
money *= 1.01;
count++;
}
std::cout << count << std::endl;
} | #include <iostream>
int main() {
int64_t x;
std::cin >> x;
int64_t count = 0, money = 100;
while (money < x) {
money *= 1.01;
count++;
}
std::cout << count << std::endl;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, a = 100, b = 0;
cin >> x;
while (a < x) {
b++;
a += a / 100;
}
cout << b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long x, a = 100, b = 0;
cin >> x;
while (a < x) {
b++;
a += a / 100;
}
cout << b << endl;
}
| replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, price = 100, count = 0;
cin >> x;
while (price < x) {
price *= 1.01;
count += 1;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t x, price = 100, count = 0;
cin >> x;
while (price < x) {
price *= 1.01;
count += 1;
}
cout << count << endl;
}
| replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x, i = 0, a = 100;
cin >> x;
while (1) {
i++;
a *= 1.01;
if (a >= x) {
cout << i << endl;
break;
}
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll x, i = 0, a = 100;
cin >> x;
while (1) {
i++;
a *= 1.01;
if (a >= x) {
cout << i << endl;
break;
}
}
cout << endl;
return 0;
}
| replace | 14 | 15 | 14 | 15 | TLE | |
p02694 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FIXED_FLOAT(x) std::fixed << std::setprecision(7) << (x)
#define MAX 100
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define INF 1e9
#define ll long long
#define vi vector<int>
#define all(a) a.begin(), a.end()
#define pb push_back
#define ull unsigned long long
using namespace std;
const int N = 1e3 + 5;
void solve() {
ll n;
cin >> n;
int p = 100, nas = 0;
while (p < n) {
p *= 1.01;
nas++;
}
cout << nas << '\n';
}
int main() {
fast;
solve();
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FIXED_FLOAT(x) std::fixed << std::setprecision(7) << (x)
#define MAX 100
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define INF 1e9
#define ll long long
#define vi vector<int>
#define all(a) a.begin(), a.end()
#define pb push_back
#define ull unsigned long long
using namespace std;
const int N = 1e3 + 5;
void solve() {
ll n;
cin >> n;
ll p = 100, nas = 0;
while (p < n) {
p *= 1.01;
nas++;
}
cout << nas << '\n';
}
int main() {
fast;
solve();
}
| replace | 27 | 28 | 27 | 28 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long num, solve;
while (cin >> num) {
int count = 0;
solve = 100;
while (num != solve) {
int percentage = solve / 100;
solve += percentage;
count++;
}
cout << count << endl;
break;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long num, solve;
while (cin >> num) {
int count = 0;
solve = 100;
while (num > solve) {
solve = solve + (solve / 100);
count++;
}
cout << count << endl;
break;
}
} | replace | 7 | 10 | 7 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
long long money = 100;
for (int i = 1;; i++) {
money *= 101;
money /= 100;
if (money >= X) {
cout << i << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
long long money = 100;
for (int i = 1;; i++) {
money += money / 100;
if (money >= X) {
cout << i << endl;
break;
}
}
} | replace | 9 | 11 | 9 | 10 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long int x, count = 0;
cin >> x;
unsigned long long int n = 100;
while (n < x) {
n = n * 101 / 100;
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long int x, count = 0;
cin >> x;
unsigned long long int n = 100;
while (n < x) {
n = n + n / 100;
count++;
}
cout << count << endl;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long m = 100;
long long ans = 1;
while (1) {
m *= 101;
m /= 100;
if (x <= m)
break;
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long m = 100;
long long ans = 0;
long long task = 0;
while (x > m) {
task = m / 100;
m += task;
ans++;
}
cout << ans << endl;
} | replace | 7 | 13 | 7 | 12 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, m, ans;
inline ll read() {
ll s = 0, w = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
w *= ch == '-' ? -1 : 1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
s = s * 10 + ch - '0';
return s * w;
}
inline void work() {
n = read();
m = 101;
for (ans = 1; m < n; ++ans, m += int(m * 0.01))
;
printf("%lld\n", ans);
}
int main() {
work();
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, m, ans;
inline ll read() {
ll s = 0, w = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
w *= ch == '-' ? -1 : 1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
s = s * 10 + ch - '0';
return s * w;
}
inline void work() {
n = read(), m = 101;
for (ans = 1; m < n; ++ans, m += m * 0.01 * 1ll)
;
printf("%lld\n", ans);
}
int main() {
work();
return 0;
} | replace | 17 | 20 | 17 | 19 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Array.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define out(ans) cout << ans << endl;
const int MOD = 1000000007;
const int INF = 2147483647;
const ld PI = 3.14159265358979323846;
//------------↓------------- M -------------- E ---------------- M
//--------------- O ---------------↓--------------//
// コンパイル
// g++ -std=c++1z
//
// -------型変換--------
// int を string に変換
// string s = to_string(n);
// string を int に変換
// int n = stoi(s);
//
// -------二分探索---------
// k以上の値が最初に現れる時のイテレータ
// lower_bound(data.begin(), data.end(), k)
// kより大きい値が最初の現れる時のイテレータ O(logN)
// upper_bound(data.begin(), data.end(), k)
// kがdataに存在するかをtrue or falseで返す O(logN)
// binary_search(data.begin(), data.end(), k)
//
//
//
//
//
//
//
//------------↑------------- M -------------- E ---------------- M
//--------------- O ---------------↑--------------//
int main(void) {
ll g = 100;
int ans = 0;
ll X;
cin >> X;
while (X > g) {
g = g * 101 / 100;
++ans;
}
out(ans);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Array.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define out(ans) cout << ans << endl;
const int MOD = 1000000007;
const int INF = 2147483647;
const ld PI = 3.14159265358979323846;
//------------↓------------- M -------------- E ---------------- M
//--------------- O ---------------↓--------------//
// コンパイル
// g++ -std=c++1z
//
// -------型変換--------
// int を string に変換
// string s = to_string(n);
// string を int に変換
// int n = stoi(s);
//
// -------二分探索---------
// k以上の値が最初に現れる時のイテレータ
// lower_bound(data.begin(), data.end(), k)
// kより大きい値が最初の現れる時のイテレータ O(logN)
// upper_bound(data.begin(), data.end(), k)
// kがdataに存在するかをtrue or falseで返す O(logN)
// binary_search(data.begin(), data.end(), k)
//
//
//
//
//
//
//
//------------↑------------- M -------------- E ---------------- M
//--------------- O ---------------↑--------------//
int main(void) {
ll g = 100;
int ans = 0;
ll X;
cin >> X;
while (X > g) {
g = g + g / 100;
++ans;
}
out(ans);
return 0;
}
| replace | 55 | 56 | 55 | 56 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
long long X;
int a = 100;
cin >> X;
int cnt = 0;
while (a < X) {
a += a / 100;
cnt++;
}
cout << cnt;
return 0;
}
| #include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
long long X;
long long a = 100;
cin >> X;
int cnt = 0;
while (a < X) {
a += a / 100;
cnt++;
}
cout << cnt;
return 0;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int x, yokin, i;
cin >> x;
yokin = 100;
for (i = 0; yokin < x; i++) {
yokin = yokin * 1.01;
}
cout << i << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long x, yokin;
int i;
cin >> x;
yokin = 100;
for (i = 0; yokin < x; i++) {
yokin = yokin * 1.01;
}
cout << i << "\n";
return 0;
} | replace | 6 | 7 | 6 | 8 | TLE | |
p02694 | C++ | Time Limit Exceeded | // codeforces
//
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
// #define inf 1e9+7
#define int64 long long
#define VI vector<int>
#define all(v) v.begin(), v.end()
#define inpv(v) \
for (auto &x : v) \
cin >> x
#define pii pair<int, int>
#define CASES \
int tt; \
cin >> tt; \
while (tt--)
#define for0(i, n) for (int i = 0; i < n; i++)
const int64 inf = 1e9 + 7;
const char nwl = '\n';
int main() {
// ur code
int64 n;
cin >> n;
int64 s;
int t = 0;
while (s < n) {
s = s + s / 100;
t++;
}
cout << t;
return 0;
}
| // codeforces
//
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
// #define inf 1e9+7
#define int64 long long
#define VI vector<int>
#define all(v) v.begin(), v.end()
#define inpv(v) \
for (auto &x : v) \
cin >> x
#define pii pair<int, int>
#define CASES \
int tt; \
cin >> tt; \
while (tt--)
#define for0(i, n) for (int i = 0; i < n; i++)
const int64 inf = 1e9 + 7;
const char nwl = '\n';
int main() {
// ur code
int64 n;
cin >> n;
int64 s = 100;
int t = 0;
while (s < n) {
s = s + s / 100;
t++;
}
cout << t;
return 0;
}
| replace | 27 | 28 | 27 | 28 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long int x;
cin >> x;
int c = 0;
int a = 100;
while (1) {
c++;
a = a + a / 100;
if (a >= x)
break;
}
cout << c << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long int x;
cin >> x;
int c = 0;
long long int a = 100;
while (1) {
c++;
a = a + a / 100;
if (a >= x)
break;
}
cout << c << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int X;
int money = 100;
int main() {
cin >> X;
int cnt = 0;
while (X > money) {
money = money * 1.01;
cnt++;
}
cout << cnt;
} | #include <iostream>
using namespace std;
long long X;
long long money = 100;
int main() {
cin >> X;
int cnt = 0;
while (X > money) {
money = money * 1.01;
cnt++;
}
cout << cnt;
} | replace | 3 | 5 | 3 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#define LEN 100005
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (ll i = 0; i < n; i++)
#define For(i, m, n) for (int i = m; i < n; i++)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
using namespace std;
using ll = long long;
double pi() { return 3.14; }
int sum(int a, int b) { return a + b; }
int mul(int a, int b) { return a * b; }
ll LGCD(ll x, ll y) {
if (x % y == 0)
return y;
else
return LGCD(y, x % y);
}
ll LLCM(ll x, ll y) { return x * y / LGCD(x, y); }
int GCD(int x, int y) {
if (x % y == 0)
return y;
else
return GCD(y, x % y);
}
int LCM(int x, int y) { return x * y / GCD(x, y); }
ll dpc[10000][10000];
// void nCr(ll n, ll r) {
// ll ans = 1;
// for (int i = n; i > n - r; --i) {
// ans = ans * i;
// }
// for (int i = 1; i < r + 1; ++i) {
// ans = ans / i;
// }
// printf("%d",ans);
// }
ll combination(ll n, ll r) {
if (n == r) {
return dpc[n][n] = 1;
} else if (r == 0) {
return dpc[n][0] = 1;
} else if (r == 1) {
return dpc[n][1] = n;
} else if (dpc[n][r]) {
return dpc[n][r];
} else {
return dpc[n][r] = combination(n - 1, r - 1) + combination(n - 1, r);
}
}
// cout << fixed << setprecision(10);
ll checkman(vector<int> s, int i) {
int mozila = 1;
int n = s.size();
int tmp = 0;
ll ans = 0;
for (int k = i; k < n; k++) {
tmp = tmp + s[k];
if (tmp % 2019 == 0)
ans++;
tmp = (tmp * 10) % 2019;
}
return ans;
}
int main() {
ll x;
cin >> x;
ll i = 0;
ll a = 100;
while (1) {
i++;
a = a * 101 / 100;
if (a >= x)
break;
}
cout << i << endl;
return 0;
}
| #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#define LEN 100005
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (ll i = 0; i < n; i++)
#define For(i, m, n) for (int i = m; i < n; i++)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
using namespace std;
using ll = long long;
double pi() { return 3.14; }
int sum(int a, int b) { return a + b; }
int mul(int a, int b) { return a * b; }
ll LGCD(ll x, ll y) {
if (x % y == 0)
return y;
else
return LGCD(y, x % y);
}
ll LLCM(ll x, ll y) { return x * y / LGCD(x, y); }
int GCD(int x, int y) {
if (x % y == 0)
return y;
else
return GCD(y, x % y);
}
int LCM(int x, int y) { return x * y / GCD(x, y); }
ll dpc[10000][10000];
// void nCr(ll n, ll r) {
// ll ans = 1;
// for (int i = n; i > n - r; --i) {
// ans = ans * i;
// }
// for (int i = 1; i < r + 1; ++i) {
// ans = ans / i;
// }
// printf("%d",ans);
// }
ll combination(ll n, ll r) {
if (n == r) {
return dpc[n][n] = 1;
} else if (r == 0) {
return dpc[n][0] = 1;
} else if (r == 1) {
return dpc[n][1] = n;
} else if (dpc[n][r]) {
return dpc[n][r];
} else {
return dpc[n][r] = combination(n - 1, r - 1) + combination(n - 1, r);
}
}
// cout << fixed << setprecision(10);
ll checkman(vector<int> s, int i) {
int mozila = 1;
int n = s.size();
int tmp = 0;
ll ans = 0;
for (int k = i; k < n; k++) {
tmp = tmp + s[k];
if (tmp % 2019 == 0)
ans++;
tmp = (tmp * 10) % 2019;
}
return ans;
}
int main() {
ll x;
cin >> x;
ll i = 0;
ll a = 100;
while (1) {
i++;
a = a * 1.01;
if (a >= x)
break;
}
cout << i << endl;
return 0;
}
| replace | 97 | 98 | 97 | 98 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int year = 0;
ll money = 100;
ll X;
cin >> X;
while (money < X) {
money = (101 * money) / 100;
year++;
}
cout << year << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int year = 0;
ll money = 100;
ll X;
cin >> X;
while (money < X) {
money = money + money / 100;
year++;
}
cout << year << endl;
}
| replace | 10 | 11 | 10 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) { cout << (expr ? "Yes" : "No") << "\n"; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
lint X;
cin >> X;
lint now = 100;
int idx = 1;
while (true) {
now = now * 101 / 100;
if (now >= X) {
cout << idx << endl;
return 0;
}
idx++;
}
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) { cout << (expr ? "Yes" : "No") << "\n"; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
lint X;
cin >> X;
lint now = 100;
int idx = 1;
while (true) {
now = now * 1.01;
if (now >= X) {
cout << idx << endl;
return 0;
}
idx++;
}
} | replace | 21 | 22 | 21 | 22 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool chmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool chmin(T &m, const T q) {
if (q < m) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define dbg(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
int main() {
ll x;
cin >> x;
ll base = 100;
int n = 0;
for (; base < x; n++) {
base = base * 101 / 100;
}
cout << n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool chmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool chmin(T &m, const T q) {
if (q < m) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define dbg(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
int main() {
ll x;
cin >> x;
ll base = 100;
int n = 0;
for (; base < x; n++) {
base += base / 100;
}
cout << n << endl;
}
| replace | 127 | 128 | 127 | 128 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll x;
cin >> x;
ll ans = 0;
ll yokin = 100;
for (ll i = 1;; i++) {
yokin = yokin * 101 / 100;
if (yokin >= x) {
ans = i;
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll x;
cin >> x;
ll ans = 0;
ll yokin = 100;
for (ll i = 1;; i++) {
yokin = yokin * 1.01;
if (yokin >= x) {
ans = i;
break;
}
}
cout << ans << endl;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int num = 100;
int X;
int year = 0;
cin >> X;
while (num < X) {
num = num * 1.01;
year++;
}
cout << year << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long num = 100;
long X;
int year = 0;
cin >> X;
while (num < X) {
num = num * 1.01;
year++;
}
cout << year << endl;
}
| replace | 4 | 6 | 4 | 6 | TLE | |
p02694 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x = 0;
cin >> x;
int count = 0;
int num = 100;
while (num < x) {
num += num / 100;
count++;
}
cout << count << endl;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x = 0;
cin >> x;
int count = 0;
long long num = 100;
while (num < x) {
num += num / 100;
count++;
}
cout << count << endl;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int X;
int a = 0;
int b = 100;
cin >> X;
while (true) {
b *= 1.01;
a++;
if (b >= X) {
break;
}
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
long long a = 0;
long long b = 100;
cin >> X;
while (true) {
b *= 1.01;
a++;
if (b >= X) {
break;
}
}
cout << a << endl;
}
| replace | 4 | 7 | 4 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert
#include <cmath> // abs など
#include <functional> // greater など
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric> // accumulate, gcd など
#include <queue>
#include <set>
#include <stdexcept>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
// typedef int128_t ll;
// typedef cpp_int ll;
// GCC, 配列のアクセスなど
#define _GLIBCXX_DEBUG
// Clang, 配列のアクセスなど
#define _LIBCPP_DEBUG 0
// #define NDEBUG 1
// debug用出力 https://trap.jp/post/998/
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << H << " ";
debug_out(T...);
}
#ifdef NDEBUG
#define debug(...)
#else
#define debug(...) debug_out(__VA_ARGS__)
#endif
//////////////// //////////////// //////////////// ////////////////
///////////////////
//////////////// //////////////// //////////////// ////////////////
///////////////////
// constexpr inline ll mod = 1'000'000'007;
// constexpr int max_n = 200'000 + 5;
int main() {
// 高速な入出力
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(15); // 浮動小数の表示の精度
ll x;
cin >> x;
int y = 0;
ll a = 100;
while (a < x) {
y++;
a = a * 101 / 100;
}
cout << y << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert
#include <cmath> // abs など
#include <functional> // greater など
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric> // accumulate, gcd など
#include <queue>
#include <set>
#include <stdexcept>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
// typedef int128_t ll;
// typedef cpp_int ll;
// GCC, 配列のアクセスなど
#define _GLIBCXX_DEBUG
// Clang, 配列のアクセスなど
#define _LIBCPP_DEBUG 0
// #define NDEBUG 1
// debug用出力 https://trap.jp/post/998/
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << H << " ";
debug_out(T...);
}
#ifdef NDEBUG
#define debug(...)
#else
#define debug(...) debug_out(__VA_ARGS__)
#endif
//////////////// //////////////// //////////////// ////////////////
///////////////////
//////////////// //////////////// //////////////// ////////////////
///////////////////
// constexpr inline ll mod = 1'000'000'007;
// constexpr int max_n = 200'000 + 5;
int main() {
// 高速な入出力
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(15); // 浮動小数の表示の精度
ll x;
cin >> x;
int y = 0;
ll a = 100;
while (a < x) {
y++;
a += a / 100;
}
cout << y << endl;
return 0;
}
| replace | 64 | 65 | 64 | 65 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, sta, end) for (ll i = sta; i < end; i++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007
#define vvl vector<vector<ll>>
#define vl vector<ll>
#define acc_io \
cin.tie(0); \
ios::sync_with_stdio(false)
// name[i] -> vl name(i)
// name[i][j]-> vvl name(i,vl(j))
// or-> ||
#include <math.h>
signed main() {
acc_io;
ll x;
cin >> x;
ll y = 1, tmp = 100;
while (1) {
tmp /= 100;
tmp *= 101;
if (x <= tmp)
break;
y++;
}
cout << y << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, sta, end) for (ll i = sta; i < end; i++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007
#define vvl vector<vector<ll>>
#define vl vector<ll>
#define acc_io \
cin.tie(0); \
ios::sync_with_stdio(false)
// name[i] -> vl name(i)
// name[i][j]-> vvl name(i,vl(j))
// or-> ||
#include <math.h>
signed main() {
acc_io;
ll x;
cin >> x;
ll y = 1, tmp = 100;
while (1) {
// tmp/=100;
tmp *= 1.01;
if (x <= tmp)
break;
y++;
}
cout << y << endl;
return 0;
}
| replace | 22 | 24 | 22 | 24 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define PI 3.14159265358979323846
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/// https://ideone.com/Fd5s8n
ll x;
cin >> x;
int a[4000];
a[0] = 100;
for (int i = 1; i <= 4000; i++) {
a[i] = a[i - 1] + a[i - 1] / 100;
if (a[i] >= x) {
cout << i << endl;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define PI 3.14159265358979323846
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/// https://ideone.com/Fd5s8n
ll x;
cin >> x;
ll a[4000];
a[0] = 100;
for (int i = 1; i <= 4000; i++) {
a[i] = a[i - 1] + a[i - 1] / 100;
if (a[i] >= x) {
cout << i << endl;
return 0;
}
}
return 0;
}
| replace | 12 | 13 | 12 | 13 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int64_t kane = 100;
int64_t x;
cin >> x;
int year = 0;
while (kane < x) {
year++;
kane *= 1.01;
kane = (int)kane;
}
cout << year << endl;
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int64_t kane = 100;
int64_t x;
cin >> x;
int year = 0;
while (kane < x) {
year++;
kane += kane / 100;
}
cout << year << endl;
}
| replace | 11 | 13 | 11 | 12 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, M, Y;
cin >> X;
M = 100;
Y = 0;
while (M < X) {
M *= 1.01;
Y++;
}
cout << Y << endl;
// ここにプログラムを追記
// (ここで"試合結果の表"の2次元配列を宣言)
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X, M, Y;
cin >> X;
M = 100;
Y = 0;
while (M < X) {
M *= 1.01;
Y++;
}
cout << Y << endl;
// ここにプログラムを追記
// (ここで"試合結果の表"の2次元配列を宣言)
}
| replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
int64_t x;
cin >> x;
int64_t t = 100;
int ans = 0;
while (t < x) {
t = (t * 101) / 100;
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
int64_t x;
cin >> x;
int64_t t = 100;
int ans = 0;
while (t < x) {
t = t + t / 100;
ans++;
}
cout << ans << endl;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int x;
int n = 100;
cin >> x;
int i = 0;
while (true) {
if (n >= x) {
cout << i;
return 0;
}
n *= 1.01;
i++;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long x;
long long n = 100;
cin >> x;
int i = 0;
while (true) {
if (n >= x) {
cout << i;
return 0;
}
n *= 1.01;
i++;
}
} | replace | 4 | 6 | 4 | 6 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long x;
cin >> x;
long long money = 100;
int i;
for (i = 0; money < x; i++) {
money = money * 101 / 100;
}
cout << i << endl;
} | #include <iostream>
using namespace std;
int main() {
long long x;
cin >> x;
long long money = 100;
int i;
for (i = 0; money < x; i++) {
money = money + money / 100;
}
cout << i << endl;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n, ans, now;
int main() {
cin >> n;
now = 100;
while (now < n) {
now += now * 0.01;
ans++;
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, ans, now;
int main() {
cin >> n;
now = 100;
while (now < n) {
now += now * 0.01;
ans++;
}
cout << ans << "\n";
return 0;
} | replace | 3 | 4 | 3 | 4 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ll a = 100, x, n = 2;
cin >> x;
while (true) {
a = a * 101 / 100;
if (a >= x) {
cout << n - 1 << endl;
break;
}
n++;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ll a = 100, x, n = 2;
cin >> x;
while (true) {
a += a / 100;
if (a >= x) {
cout << n - 1 << endl;
break;
}
n++;
}
} | replace | 16 | 17 | 16 | 17 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
unsigned long x;
cin >> x;
unsigned long sum = 100;
unsigned long i = 0;
while (true) {
sum += int(sum * 0.01);
i++;
if (sum >= x) {
cout << i << endl;
break;
}
}
} | #include <iostream>
using namespace std;
int main() {
unsigned long x;
cin >> x;
unsigned long sum = 100;
unsigned long i = 0;
while (true) {
sum += long(sum * 0.01);
i++;
if (sum >= x) {
cout << i << endl;
break;
}
}
} | replace | 11 | 12 | 11 | 12 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int x, d = 100, y = 0;
cin >> x;
while (d < x) {
d = d * 1.01;
y++;
}
cout << y << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long x, d = 100, y = 0;
cin >> x;
while (d < x) {
d = d * 1.01;
y++;
}
cout << y << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX;
#define INFL LLONG_MAX;
typedef long long ll;
using namespace std;
int main() {
ll x;
cin >> x;
int money = 100;
int ans = 0;
while (true) {
money *= 1.01;
ans++;
if (money >= x)
break;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX;
#define INFL LLONG_MAX;
typedef long long ll;
using namespace std;
int main() {
ll x;
cin >> x;
ll money = 100;
ll ans = 0;
while (true) {
money *= 1.01;
ans++;
if (money >= x)
break;
}
cout << ans << endl;
} | replace | 14 | 16 | 14 | 16 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y = 100, i = 0;
cin >> x;
while (y < x) {
y += y / 100;
i++;
}
cout << i;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y = 100, i = 0;
cin >> x;
while (y < x) {
y += y / 100;
i++;
}
cout << i;
}
| replace | 3 | 4 | 3 | 4 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long x;
cin >> x;
int sum = 100;
for (int i = 1; i < 1000000000; i++) {
sum *= 1.01;
if (sum >= x) {
cout << i << endl;
break;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long x;
cin >> x;
long sum = 100;
for (int i = 1;; i++) {
sum *= 1.01;
if (sum >= x) {
cout << i << endl;
break;
}
}
}
| replace | 6 | 8 | 6 | 8 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define mod 1000000007
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
ll x;
cin >> x;
ll ans = 0;
ll now = 100;
while (now < x) {
now = now * 101 / 100;
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define mod 1000000007
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
ll x;
cin >> x;
ll ans = 0;
ll now = 100;
while (now < x) {
now = now * 1.01;
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int main() {
cout << fixed << setprecision(10);
ll x;
cin >> x;
ll now = 100;
int cnt = 0;
while (now < x) {
cnt++;
now *= 101;
now /= 100;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int main() {
cout << fixed << setprecision(10);
ll x;
cin >> x;
ll now = 100;
int cnt = 0;
while (now < x) {
cnt++;
ll sa = now / 100;
now += sa;
}
cout << cnt << endl;
return 0;
} | replace | 19 | 21 | 19 | 21 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
int money = 100;
int ans = 0;
while (money < x) {
money *= 1.01;
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long money = 100;
int ans = 0;
while (money < x) {
money *= 1.01;
ans++;
}
cout << ans << endl;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, y = 0, n = 100;
cin >> a;
while (n < a) {
n *= 1.01;
y++;
}
cout << y << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, y = 0, n = 100;
cin >> a;
while (n < a) {
n *= 1.01;
y++;
}
cout << y << endl;
} | replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long int x, tmp = 100, cnt = 0;
cin >> x;
while (tmp < x) {
tmp = tmp * 101 / 100;
cnt++;
if (tmp >= x)
break;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int x, tmp = 100, cnt = 0;
cin >> x;
while (tmp < x) {
tmp = tmp * 1.01;
cnt++;
if (tmp >= x)
break;
}
cout << cnt << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
TEST(freopen("input.txt", "r", stdin));
TEST(freopen("output.txt", "w", stdout));
TEST(freopen("debug.txt", "w", stderr));
long long X, c = 100;
cin >> X;
for (int i = 1;; i++) {
c = c * 101 / 100;
if (c >= X) {
cout << i << '\n';
break;
}
}
return 0;
} | #include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
TEST(freopen("input.txt", "r", stdin));
TEST(freopen("output.txt", "w", stdout));
TEST(freopen("debug.txt", "w", stderr));
long long X;
__int128 c = 100;
cin >> X;
for (int i = 1;; i++) {
c = c * 101 / 100;
if (c >= X) {
cout << i << '\n';
break;
}
}
return 0;
} | replace | 19 | 20 | 19 | 21 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, x = 100;
int count = 0;
cin >> a;
while (x < a) {
x *= 1.01;
count++;
}
cout << count << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a;
long long x = 100;
int count = 0;
cin >> a;
while (x < a) {
x *= 1.01;
count++;
}
cout << count << endl;
return 0;
}
| replace | 9 | 10 | 9 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X;
cin >> X;
int64_t A = 100;
int ans = 0;
while (true) {
A = (A * 101) / 100;
ans++;
if (A >= X) {
break;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X;
cin >> X;
int64_t A = 100;
int ans = 0;
while (true) {
A += A / 100;
ans++;
if (A >= X) {
break;
}
}
cout << ans << endl;
}
| replace | 10 | 11 | 10 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define M 1000000007
// #define M 998244353
const int inf = 4e18;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int x;
cin >> x;
int c = 100, o = 0;
while (c < x) {
c = (101 * c) / 100;
o++;
}
cout << o << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define M 1000000007
// #define M 998244353
const int inf = 4e18;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int x;
cin >> x;
int c = 100, o = 0;
while (c < x) {
c = ((double)101 / 100) * c;
o++;
}
cout << o << endl;
} | replace | 14 | 15 | 14 | 15 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, c = 0, val = 100;
cin >> x;
while (x > val) {
val += val / 100;
c++;
}
cout << c;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, c = 0, val = 100;
cin >> x;
while (x > val) {
val += val / 100;
c++;
}
cout << c;
return 0;
}
| replace | 3 | 4 | 3 | 4 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
#define _GLIBCXX_DEBUG
using ll = long long;
using ull = unsigned long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const ll mod = 1e9 + 7;
void chmod(ll &M) {
if (M >= mod)
M %= mod;
else if (M < 0) {
M += (abs(M) / mod + 1) * mod;
M %= mod;
}
}
ll modpow(ll x, ll n) {
if (n == 0)
return 1;
ll res = modpow(x, n / 2);
if (n % 2 == 0)
return res * res % mod;
else
return res * res % mod * x % mod;
}
int getl(int i, int N) { return i == 0 ? N - 1 : i - 1; };
int getr(int i, int N) { return i == N - 1 ? 0 : i + 1; };
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
using namespace std;
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
int main() {
ull X;
cin >> X;
ull sum = 100;
ull year = 0;
while (sum < X) {
sum *= 101 / 100;
year++;
}
cout << year << "\n";
}
| #include <bits/stdc++.h>
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
#define _GLIBCXX_DEBUG
using ll = long long;
using ull = unsigned long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const ll mod = 1e9 + 7;
void chmod(ll &M) {
if (M >= mod)
M %= mod;
else if (M < 0) {
M += (abs(M) / mod + 1) * mod;
M %= mod;
}
}
ll modpow(ll x, ll n) {
if (n == 0)
return 1;
ll res = modpow(x, n / 2);
if (n % 2 == 0)
return res * res % mod;
else
return res * res % mod * x % mod;
}
int getl(int i, int N) { return i == 0 ? N - 1 : i - 1; };
int getr(int i, int N) { return i == N - 1 ? 0 : i + 1; };
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
using namespace std;
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
int main() {
ull X;
cin >> X;
ull sum = 100;
ull year = 0;
while (sum < X) {
sum += sum / 100;
// sum *= 1.01;
year++;
}
cout << year << "\n";
}
| replace | 65 | 66 | 65 | 67 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output1.txt","w",stdout);
// #endif
long long int x;
cin >> x;
long long int ans = 100;
long long int count = 0;
while (ans != x) {
ans += (ans / 100);
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output1.txt","w",stdout);
// #endif
long long int x;
cin >> x;
long long int ans = 100;
long long int count = 0;
while (ans < x) {
ans += (ans / 100);
count++;
}
cout << count << endl;
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long a;
cin >> a;
long long p = 100;
int c = 0;
while (p != a) {
p = p + int(p / 100);
c += 1;
}
cout << c;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long a;
cin >> a;
long long p = 100;
int c = 0;
while (p < a) {
p = p + p / 100;
c += 1;
}
cout << c;
return 0;
}
| replace | 9 | 11 | 9 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
using namespace std;
int main() {
int X;
int M = 100;
cin >> X;
for (int year = 1; M <= X; year++) {
M *= 1.01;
// cout << year << " " << M << " " << X << endl;
if (M >= X) {
cout << year << endl;
break;
}
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
using namespace std;
int main() {
long X;
long M = 100;
cin >> X;
for (int year = 1; M <= X; year++) {
M *= 1.01;
// cout << year << " " << M << " " << X << endl;
if (M >= X) {
cout << year << endl;
break;
}
}
return 0;
}
| replace | 9 | 11 | 9 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 100, x, m = 0;
cin >> x;
while (n < x) {
n += n / 100;
m++;
}
cout << m;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n = 100, x, m = 0;
cin >> x;
while (n < x) {
n += n / 100;
m++;
}
cout << m;
return 0;
} | replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 100, x, cnt = 0;
cin >> x;
while (a < x) {
a += a * 0.01;
cnt++;
}
cout << cnt;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a = 100, x, cnt = 0;
cin >> x;
while (a < x) {
a += a * 0.01;
cnt++;
}
cout << cnt;
}
| replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n, m;
int main() {
int a = 100;
cin >> n;
if (n >= 1335850880) {
a = 1335850880;
int i = 0;
while (a < n) {
a = a + a * 0.01;
i++;
}
cout << i + 1706;
return 0;
}
int i = 0;
while (a < n) {
a = a + a * 0.01;
i++;
}
cout << i;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, m;
int main() {
long long a = 100;
cin >> n;
if (n >= 1335850880) {
a = 1335850880;
int i = 0;
while (a < n) {
a = a + a * 0.01;
i++;
}
cout << i + 1706;
return 0;
}
int i = 0;
while (a < n) {
a = a + a * 0.01;
i++;
}
cout << i;
return 0;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int nowmoney = 100, x, year = 0;
cin >> x;
while (x > nowmoney) {
nowmoney = nowmoney * 1.01;
year++;
}
cout << year << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
unsigned long long int nowmoney = 100, x;
int year = 0;
cin >> x;
while (x > nowmoney) {
nowmoney = nowmoney * 1.01;
year++;
}
cout << year << endl;
return 0;
} | replace | 4 | 5 | 4 | 6 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int target;
int b = 100;
int cnt = 0;
cin >> target;
while (target > b) {
b += b / 100;
cnt++;
}
cout << cnt;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
ll target;
ll b = 100;
int cnt = 0;
cin >> target;
while (target > b) {
b += b / 100;
cnt++;
}
cout << cnt;
return 0;
} | replace | 7 | 9 | 7 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, now = 100, ans = 0;
cin >> x;
while (now < x) {
now += now / 100;
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, now = 100, ans = 0;
cin >> x;
while (now < x) {
now += now / 100;
ans++;
}
cout << ans << endl;
}
| replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
unsigned long long x;
cin >> x;
unsigned long long c = 100;
int i = 0;
while (1) {
i++;
c *= 0.01;
if (c >= x) {
cout << i << endl;
return 0;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
unsigned long long x;
cin >> x;
unsigned long long c = 100;
int i = 0;
while (1) {
i++;
c *= 1.01;
if (c >= x) {
cout << i << endl;
return 0;
}
}
return 0;
}
| replace | 9 | 10 | 9 | 10 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int x, yokin = 100, cnt = 0;
cin >> x;
while (x > yokin) {
cnt++;
yokin = (double)yokin * 1.01;
}
cout << cnt;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long x, yokin = 100, cnt = 0;
cin >> x;
while (x > yokin) {
cnt++;
yokin = (double)yokin * 1.01;
}
cout << cnt;
return 0;
}
| replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
long x;
int a = 100, cnt = 0;
cin >> x;
while (1) {
if (a >= x)
break;
a = a + (a * 0.01);
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long x, a = 100;
int cnt = 0;
cin >> x;
while (1) {
if (a >= x)
break;
a = a + (a * 0.01);
cnt++;
}
cout << cnt << endl;
return 0;
} | replace | 4 | 6 | 4 | 6 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
// 解説ac
int main() {
ll x;
cin >> x;
int y = 100;
int i = 0;
while (y < x) {
y += y / 100;
i++;
}
cout << i;
} | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
// 解説ac
int main() {
ll x;
cin >> x;
ll y = 100;
ll i = 0;
while (y < x) {
y += y / 100;
i++;
}
cout << i;
}
| replace | 20 | 22 | 20 | 22 | TLE | |
p02694 | C++ | Time Limit Exceeded | // #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>;
using pii = pair<int, int>;
template <typename T> using prior = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using Prior = priority_queue<T>;
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
#define fastIO() \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define RANDOM() \
random_device __rd; \
mt19937 __gen = mt19937(__rd()); \
uniform_int_distribution<int> __dis(0, 1); \
auto rnd = bind(__dis, __gen);
const int INF = 1E18;
const int mod = 1E9 + 7;
int32_t main() {
fastIO();
int x, m = 100, ans = 0;
cin >> x;
while (m < x and ++ans)
m += m / 100;
cout << ans << "\n";
return 0;
} | // #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>;
using pii = pair<int, int>;
template <typename T> using prior = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using Prior = priority_queue<T>;
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
#define fastIO() \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define RANDOM() \
random_device __rd; \
mt19937 __gen = mt19937(__rd()); \
uniform_int_distribution<int> __dis(0, 1); \
auto rnd = bind(__dis, __gen);
const int INF = 1E18;
const int mod = 1E9 + 7;
int32_t main() {
fastIO();
int x, m = 100, ans = 0;
cin >> x;
while (m < x and ++ans)
m += m / 100;
cout << ans << "\n";
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
int count = 0;
long long int sum = 100;
while (sum < n) {
sum *= sum * 0.01;
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
int count = 0;
long long int sum = 100;
while (sum < n) {
sum += sum / 100;
count++;
}
cout << count << endl;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, N, temp = 100;
cin >> X;
for (N = 0; temp < X; N++) {
temp += temp * 0.01;
}
cout << N << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int X, N, temp = 100;
cin >> X;
for (N = 0; temp < X; N++) {
temp += temp * 0.01;
}
cout << N << endl;
}
| replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll X, yen;
cin >> X;
ll year = 0;
yen = 100;
while (yen < X) {
yen = ll(101 * yen);
yen /= 100;
year++;
}
cout << year << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll X, yen;
cin >> X;
ll year = 0;
yen = 100;
while (yen / X < 1) {
yen += yen / 100;
year++;
}
cout << year << endl;
return 0;
} | replace | 15 | 18 | 15 | 17 | TLE | |
p02694 | C++ | Time Limit Exceeded | #if __has_include("D:/dhiraj/Programming/debug.h")
#include "D:/dhiraj/Programming/debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 11
#endif
// Loops --------------------------------------------------------------------
#define loop(i, s, e) for (ll i = (s); i < (e); i++)
#define rloop(i, s, e) for (ll i = (s); i >= (e); i--)
#define iter(it, var) for (auto it = var.begin(); it != var.end(); it++)
#define riter(it, var) for (auto it = var.rbegin(); it != var.rend(); it++)
// Extra --------------------------------------------------------------------
#define ull unsigned long long int
#define ll long long int
#define ld long double
#define endl '\n'
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
// Template -----------------------------------------------------------------
template <typename T> inline bool inrange(T a, T l, T r) {
if (l > r)
swap(l, r);
return (a >= l and a <= r);
}
template <typename T, typename U> inline bool exist(T val, U &any) {
return (any.find(val) != any.end());
}
// multiple input
template <typename T> inline void inp(T &any) { cin >> any; }
template <typename T, typename... U> inline void inp(T &a, U &...b) {
cin >> a;
inp(b...);
}
// scan vector
template <typename T> inline istream &operator>>(istream &in, vector<T> &a) {
for (auto &x : a)
in >> x;
return in;
}
// scan pair
template <typename T, typename U>
inline istream &operator>>(istream &in, pair<T, U> &a) {
in >> a.first >> a.second;
return in;
}
// Solve --------------------------------------------------------------------
void solve(ll &T) {
ll n;
std::cin >> n;
double x = 100;
ll year = 0;
while (x < n) {
d(x);
x += (int)(x / 100);
year++;
}
std::cout << year << endl;
}
// Main ---------------------------------------------------------------------
int main() {
#ifdef Dhiraj
freopen("D:/dhiraj/Programming/i1.txt", "r", stdin);
freopen("D:/dhiraj/Programming/o1.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int t = 1;
loop(i, 1, t + 1) {
cerr << "Case #" << i << "\n";
solve(i);
}
return 0;
} | #if __has_include("D:/dhiraj/Programming/debug.h")
#include "D:/dhiraj/Programming/debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 11
#endif
// Loops --------------------------------------------------------------------
#define loop(i, s, e) for (ll i = (s); i < (e); i++)
#define rloop(i, s, e) for (ll i = (s); i >= (e); i--)
#define iter(it, var) for (auto it = var.begin(); it != var.end(); it++)
#define riter(it, var) for (auto it = var.rbegin(); it != var.rend(); it++)
// Extra --------------------------------------------------------------------
#define ull unsigned long long int
#define ll long long int
#define ld long double
#define endl '\n'
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
// Template -----------------------------------------------------------------
template <typename T> inline bool inrange(T a, T l, T r) {
if (l > r)
swap(l, r);
return (a >= l and a <= r);
}
template <typename T, typename U> inline bool exist(T val, U &any) {
return (any.find(val) != any.end());
}
// multiple input
template <typename T> inline void inp(T &any) { cin >> any; }
template <typename T, typename... U> inline void inp(T &a, U &...b) {
cin >> a;
inp(b...);
}
// scan vector
template <typename T> inline istream &operator>>(istream &in, vector<T> &a) {
for (auto &x : a)
in >> x;
return in;
}
// scan pair
template <typename T, typename U>
inline istream &operator>>(istream &in, pair<T, U> &a) {
in >> a.first >> a.second;
return in;
}
// Solve --------------------------------------------------------------------
void solve(ll &T) {
ll n;
std::cin >> n;
double x = 100;
ll year = 0;
while (x < n) {
// d(x);
x += (ll)(x / 100);
year++;
}
std::cout << year << endl;
}
// Main ---------------------------------------------------------------------
int main() {
#ifdef Dhiraj
freopen("D:/dhiraj/Programming/i1.txt", "r", stdin);
freopen("D:/dhiraj/Programming/o1.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int t = 1;
loop(i, 1, t + 1) {
cerr << "Case #" << i << "\n";
solve(i);
}
return 0;
}
| replace | 62 | 64 | 62 | 64 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1 << 29);
int main() {
ll x;
cin >> x;
ll a = 100;
ll i = 0;
while (a < x) {
i++;
a = a * 101 / 100;
}
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1 << 29);
int main() {
ll x;
cin >> x;
ll a = 100;
ll i = 0;
while (a < x) {
i++;
a += a / 100;
}
cout << i << endl;
return 0;
} | replace | 37 | 38 | 37 | 38 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
unsigned long long now = 100, ctr = 0;
while (now < X) {
now = now * 101 / 100;
ctr++;
}
cout << ctr << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
unsigned long long now = 100, ctr = 0;
while (now < X) {
now += now / 100;
ctr++;
}
cout << ctr << endl;
return 0;
}
| replace | 9 | 10 | 9 | 10 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, year = 0;
int money = 100;
cin >> X;
for (int i = 0; money < X; i++) {
money += money / 100;
year++;
}
cout << year << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int year = 0;
long long money = 100;
long long X;
cin >> X;
for (int i = 0; money < X; i++) {
money += money / 100;
year++;
}
cout << year << endl;
}
| replace | 4 | 7 | 4 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
int money = 100;
int year = 0;
while (money < X) {
money = money + (money / 100);
year++;
}
cout << year << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
long long money = 100;
long long year = 0;
while (money < X) {
money = money + (money / 100);
year++;
}
cout << year << endl;
return 0;
}
| replace | 7 | 9 | 7 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
int Y = 100;
int cou = 0;
while (Y < X) {
Y += Y / 100;
cou++;
}
cout << cou << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
long long Y = 100;
int cou = 0;
while (Y < X) {
Y += Y / 100;
cou++;
}
cout << cou << endl;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i = 0;
int X;
int N = 100;
cin >> X;
while (N < X) {
N = N * 1.01;
i++;
}
cout << i << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long i = 0;
long long X;
long long N = 100;
cin >> X;
while (N < X) {
N = N * 1.01;
i++;
}
cout << i << endl;
}
| replace | 8 | 11 | 8 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | /*Priyansh Agarwal*/
#include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define fastio() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define MOD 1000000007
#define MOD1 998244353
#define nline "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define debug(x) cout << #x << " " << x << endl;
typedef long long ll;
typedef unsigned long long ull;
typedef priority_queue<int, vector<int>, function<bool(int, int)>> pq_func;
/*---------------------------------------------------------------------------------------------------------------------------*/
int gcd(int a, int b) {
if (b > a) {
return gcd(b, a);
}
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
ll expo(ll a, ll b, ll mod) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b = b >> 1;
}
return res;
}
vector<int> sieve(int n) {
int *arr = new int[n + 1]();
vector<int> vect;
for (int i = 2; i <= n; i++)
if (arr[i] == 0) {
vect.push_back(i);
for (int j = 2 * i; j <= n; j += i)
arr[j] = 1;
}
return vect;
}
void extendgcd(ll a, ll b, ll *v) {
if (b == 0) {
v[0] = 1;
v[1] = 0;
v[2] = a;
return;
}
extendgcd(b, a % b, v);
ll x = v[1];
v[1] = v[0] - v[1] * (a / b);
v[0] = x;
return;
} // pass an arry of size 3
ll mminv(ll a, ll b) {
ll arr[3];
extendgcd(a, b, arr);
return arr[0];
} // for non prime b
ll mminvprime(ll a, ll b) { return expo(a, b - 2, b); }
bool revsort(ll a, ll b) { return a > b; }
void swap(int &x, int &y) {
int temp = x;
x = y;
y = temp;
}
void google(int t) { cout << "Case #" << t << ": "; }
/*--------------------------------------------------------------------------------------------------------------------------*/
int main() {
fastio();
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
freopen("Error.txt", "w", stderr);
#endif
ll x;
cin >> x;
int count = 0;
ll val = 100;
while (val < x) {
val = (val * 101) / 100;
// cout << val << endl;
count++;
}
cout << count << endl;
return 0;
} | /*Priyansh Agarwal*/
#include <algorithm>
#include <bits/stdc++.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define fastio() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define MOD 1000000007
#define MOD1 998244353
#define nline "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define debug(x) cout << #x << " " << x << endl;
typedef long long ll;
typedef unsigned long long ull;
typedef priority_queue<int, vector<int>, function<bool(int, int)>> pq_func;
/*---------------------------------------------------------------------------------------------------------------------------*/
int gcd(int a, int b) {
if (b > a) {
return gcd(b, a);
}
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
ll expo(ll a, ll b, ll mod) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b = b >> 1;
}
return res;
}
vector<int> sieve(int n) {
int *arr = new int[n + 1]();
vector<int> vect;
for (int i = 2; i <= n; i++)
if (arr[i] == 0) {
vect.push_back(i);
for (int j = 2 * i; j <= n; j += i)
arr[j] = 1;
}
return vect;
}
void extendgcd(ll a, ll b, ll *v) {
if (b == 0) {
v[0] = 1;
v[1] = 0;
v[2] = a;
return;
}
extendgcd(b, a % b, v);
ll x = v[1];
v[1] = v[0] - v[1] * (a / b);
v[0] = x;
return;
} // pass an arry of size 3
ll mminv(ll a, ll b) {
ll arr[3];
extendgcd(a, b, arr);
return arr[0];
} // for non prime b
ll mminvprime(ll a, ll b) { return expo(a, b - 2, b); }
bool revsort(ll a, ll b) { return a > b; }
void swap(int &x, int &y) {
int temp = x;
x = y;
y = temp;
}
void google(int t) { cout << "Case #" << t << ": "; }
/*--------------------------------------------------------------------------------------------------------------------------*/
int main() {
fastio();
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
freopen("Error.txt", "w", stderr);
#endif
ll x;
cin >> x;
int count = 0;
ll val = 100;
while (val < x) {
val += val / 100;
count++;
}
cout << count << endl;
return 0;
} | replace | 96 | 98 | 96 | 97 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll x;
cin >> x;
int cnt = 0;
int amt = 100;
while (1) {
amt = amt + amt / 100;
cnt++;
if (amt >= x)
break;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll x;
cin >> x;
int cnt = 0;
ll amt = 100;
while (1) {
amt = amt + amt / 100;
cnt++;
if (amt >= x)
break;
}
cout << cnt << endl;
}
| replace | 9 | 10 | 9 | 10 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long c = 100;
long long x;
cin >> x;
long long count = 0;
for (long long i = 0; i < 1000000000000000000; i++) {
count++;
c /= c / 100;
if (c >= x)
break;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long c = 100;
long long x;
cin >> x;
long long count = 0;
for (long long i = 0; i < 1000000000000000000; i++) {
count++;
c += c / 100;
if (c >= x)
break;
}
cout << count << endl;
}
| replace | 12 | 13 | 12 | 13 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <vector>3
using namespace std;
void init() {
cin.tie(0);
cin.sync_with_stdio(0);
}
int main() {
init();
unsigned long long k, a = 100, b = 0;
cin >> k;
while (true) {
a = a * .01 + a;
b++;
if (a == k) {
break;
}
}
cout << b;
}
| #include <bits/stdc++.h>
#include <vector>3
using namespace std;
void init() {
cin.tie(0);
cin.sync_with_stdio(0);
}
int main() {
init();
unsigned long long k, a = 100, b = 0;
cin >> k;
while (a < k) {
a = a * .01 + a;
b++;
if (a == k) {
break;
}
}
cout << b;
}
| replace | 12 | 13 | 12 | 13 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
auto y = 100LL;
auto year = 0;
while (y < x) {
y = (y * 101) / 100;
++year;
}
cout << year << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
auto y = 100LL;
auto year = 0;
while (y < x) {
y += (y / 100);
++year;
}
cout << year << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define mod 1000000007
#define eps 1e-6
#define ll long long
#define INF 0x3f3f3f3f
#define MEM(x, y) memset(x, y, sizeof(x))
#define pb push_back
#define mk make_pair
#define pi pair<int, int>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = a; i >= (b); --i)
using namespace std;
int dt[][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {0, 0}};
// typedef pair<int, int> P;
// priority_queue<int, vector<int>, greater<int> > q;
int main() {
IOS;
ll x;
cin >> x;
ll now = 100;
ll ans = 0;
while (now < x) {
now += (int)(now * 0.01);
++ans;
}
cout << ans;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define mod 1000000007
#define eps 1e-6
#define ll long long
#define INF 0x3f3f3f3f
#define MEM(x, y) memset(x, y, sizeof(x))
#define pb push_back
#define mk make_pair
#define pi pair<int, int>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = a; i >= (b); --i)
using namespace std;
int dt[][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {0, 0}};
// typedef pair<int, int> P;
// priority_queue<int, vector<int>, greater<int> > q;
int main() {
IOS;
ll x;
cin >> x;
ll now = 100;
ll ans = 0;
while (now < x) {
now += now * 0.01;
++ans;
}
cout << ans;
}
| replace | 39 | 40 | 39 | 40 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k;
cin >> k;
int ans = 0;
int d = 100;
while (d < k) {
d = floor(1.01 * d);
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k;
cin >> k;
int ans = 0;
long long d = 100.0;
while (d < k) {
d = floor(1.01 * d);
ans++;
}
cout << ans << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD_NUMBER 1000000007
template <class T> void vector_print(vector<T> vec) {
for (unsigned int i = 0; i < vec.size(); i++) {
cout << vec.at(i);
if (i < vec.size() - 1) {
cout << " ";
} else if (i == vec.size() - 1) {
cout << endl;
}
}
}
int main() {
ll x, ans = 0, table = 100;
cin >> x;
while (table < x) {
table = table * 101 / 100;
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD_NUMBER 1000000007
template <class T> void vector_print(vector<T> vec) {
for (unsigned int i = 0; i < vec.size(); i++) {
cout << vec.at(i);
if (i < vec.size() - 1) {
cout << " ";
} else if (i == vec.size() - 1) {
cout << endl;
}
}
}
int main() {
ll x, ans = 0, table = 100;
cin >> x;
while (table < x) {
table = (ll)(table * 1.01);
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 23 | 24 | 23 | 24 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1;
int main() {
ll x;
cin >> x;
ll now = 100;
int res = 0;
while (1) {
res++;
res += res / 100;
if (now >= x)
break;
}
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1;
int main() {
ll x;
cin >> x;
ll now = 100;
int res = 0;
while (1) {
res++;
now += now / 100;
if (now >= x)
break;
}
cout << res << endl;
}
| replace | 32 | 33 | 32 | 33 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long X, A = 100;
int Y = 0;
cin >> X;
while (A < X) {
A = A * 101 / 100;
Y++;
}
cout << Y << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long X, A = 100;
int Y = 0;
cin >> X;
while (A < X) {
A = A + A / 100;
Y++;
}
cout << Y << endl;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
int main() {
ll x;
cin >> x;
ll start = 100;
for (ll i = 1;; i++) {
start *= 101;
start /= 100;
if (start >= x) {
cout << i << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
int main() {
ll x;
cin >> x;
ll start = 100;
for (ll i = 1;; i++) {
start = start + start / 100;
if (start >= x) {
cout << i << endl;
return 0;
}
}
} | replace | 11 | 13 | 11 | 12 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, yokin = 100, year = 0;
cin >> x;
while (x > yokin) {
yokin = yokin * 1.01;
year++;
}
cout << year << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, yokin = 100, year = 0;
cin >> x;
while (x > yokin) {
yokin = yokin * 1.01;
year++;
}
cout << year << endl;
}
| replace | 5 | 6 | 5 | 6 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
int main() {
int tc, i, j;
;
long long n;
cin >> n;
long long ans = 0;
int awal = 100, bunga = 0;
while (awal < n) {
awal = awal * 1.01;
ans++;
}
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
int main() {
int tc, i, j;
;
long long n;
cin >> n;
long long ans = 0;
long long awal = 100;
while (awal < n) {
awal = awal * 1.01;
ans++;
}
cout << ans << "\n";
return 0;
} | replace | 14 | 15 | 14 | 15 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
long long X;
cin >> X;
int my = 100;
int ans = 0;
while (my < X) {
my += my / 100;
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
long long X;
cin >> X;
long long my = 100;
int ans = 0;
while (my < X) {
my += my / 100;
ans++;
}
cout << ans << endl;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MOD 1000000007
#define mp make_pair
#define ll long long
#define pb push_back
#define faster \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define debug cout << "Debugging.." << endl
using namespace std;
int main() {
faster;
ll int x;
cin >> x;
ll int p = 0, c = 0;
while (p < x) {
p += p / 100;
c++;
}
cout << c;
}
| #include <bits/stdc++.h>
#define MOD 1000000007
#define mp make_pair
#define ll long long
#define pb push_back
#define faster \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define debug cout << "Debugging.." << endl
using namespace std;
int main() {
faster;
ll int x;
cin >> x;
ll int p = 100, c = 0;
while (p < x) {
p += p / 100;
c++;
}
cout << c;
}
| replace | 16 | 17 | 16 | 17 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define FAST_IO \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
// #define int long long
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<pair<int, int>> vii;
const int N = 1e5 + 2;
const int INF = 1e9 + 5;
const int MOD = 1e9 + 7;
int32_t main() {
FAST_IO;
int x;
cin >> x;
int si = 0, p = 100;
int amount = p;
int ans = 0;
while (amount < x) {
si = amount / 100;
amount += si;
ans++;
}
cout << ans;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define FAST_IO \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
#define int long long
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<pair<int, int>> vii;
const int N = 1e5 + 2;
const int INF = 1e9 + 5;
const int MOD = 1e9 + 7;
int32_t main() {
FAST_IO;
int x;
cin >> x;
int si = 0, p = 100;
int amount = p;
int ans = 0;
while (amount < x) {
si = amount / 100;
amount += si;
ans++;
}
cout << ans;
return 0;
} | replace | 14 | 15 | 14 | 15 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define PI 3.1415
int main() {
ll x;
cin >> x;
ll v = 100;
ll co = 0;
while (x > v) {
v *= 101;
v /= 100;
co++;
}
cout << co << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define PI 3.1415
int main() {
ll x;
cin >> x;
ll v = 100;
ll co = 0;
while (x > v) {
v = v + (v / 100);
co++;
}
cout << co << endl;
}
| replace | 14 | 16 | 14 | 15 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int bal = 100, val, count = 0;
cin >> val;
while (bal < val) {
bal += int(bal * 0.01);
count++;
}
cout << count;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int bal = 100, val, count = 0;
cin >> val;
while (bal < val) {
bal += (long long int)(bal * 0.01);
count++;
}
cout << count;
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02694 | C++ | Time Limit Exceeded | #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
int a = 100;
long long X;
cin >> X;
while (X > a) {
a += a / 100;
a /= 1;
ans++;
}
cout << ans << endl;
return 0;
}
| #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0;
long long a = 100;
long long X;
cin >> X;
while (X > a) {
a += a / 100;
a /= 1;
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 5 | 7 | 5 | 7 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.