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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02691 | C++ | Runtime Error | #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(0); \
cout.... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(0); \
cout.... | replace | 14 | 15 | 14 | 15 | 0 | |
p02691 | C++ | Runtime Error | /**
* ///----- My Info -----///
* Code by: Ernesto Abreu
* Codeforces User: Ernest0_0Abreu
* Country: Cuba
* E-mail: ernestoabreup@gmail.com
* CopyRight
**/
#include <bits/stdc++.h>
#ifdef Ernest0_0Abreu
#include <debug/to_string.h>
#endif
using namespace std;
#pragma GCC optimize("... | /**
* ///----- My Info -----///
* Code by: Ernesto Abreu
* Codeforces User: Ernest0_0Abreu
* Country: Cuba
* E-mail: ernestoabreup@gmail.com
* CopyRight
**/
#include <bits/stdc++.h>
#ifdef Ernest0_0Abreu
#include <debug/to_string.h>
#endif
using namespace std;
#pragma GCC optimize("... | replace | 90 | 91 | 90 | 91 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(p, a, b) for (int p = a; p < b; p++)
#define INF 0x3f3f3f3f
#define N 100007
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("o2.txt... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(p, a, b) for (int p = a; p < b; p++)
#define INF 0x3f3f3f3f
#define N 100007
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("o2.txt... | replace | 23 | 24 | 23 | 24 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02691 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <map>
using namespace std;
#define ll long long
const int MAX = 1e5 + 111;
int n;
ll h[MAX];
ll ans = 0;
map<ll, ll> p;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
cin >> h[i];
ll m = i - h[i];
if (p.count(m) != 0)
ans += p[m];
... | #include <cstdio>
#include <iostream>
#include <map>
using namespace std;
#define ll long long
const int MAX = 2e5 + 111;
int n;
ll h[MAX];
ll ans = 0;
map<ll, ll> p;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
cin >> h[i];
ll m = i - h[i];
if (p.count(m) != 0)
ans += p[m];
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define repl(i, l, r) for (long long i = (l); i < (r); i++)
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define per(i, n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647; // int max
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using ... | #include <bits/stdc++.h>
#define repl(i, l, r) for (long long i = (l); i < (r); i++)
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define per(i, n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647; // int max
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using ... | replace | 27 | 37 | 27 | 34 | TLE | |
p02691 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
long long N;
cin >> N;
vector<long long> a(N);
vector<long long> score(N);
for (int i = 0; i < N; ++i) {
long long tmp;
cin >> tmp;
a[i] = tmp;
score[i] = i - ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
long long N;
cin >> N;
vector<long long> a(N);
vector<long long> score(N);
for (int i = 0; i < N; ++i) {
long long tmp;
cin >> tmp;
a[i] = tmp;
score[i] = i - ... | replace | 27 | 34 | 27 | 34 | TLE | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#ifndef LX_DEBUG
// #define LX_DEBUG
#endif
#if defined(__unix__) && !defined(LX_DEBUG) && !defined(LX_LOCAL)
#define USE_MMAP 1
#include <fcntl.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
#else
#define USE_MMAP 0
#e... | #include <algorithm>
#include <cmath>
#include <cstdio>
#ifndef LX_DEBUG
// #define LX_DEBUG
#endif
#if defined(__unix__) && !defined(LX_DEBUG) && !defined(LX_LOCAL)
#define USE_MMAP 1
#include <fcntl.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
#else
#define USE_MMAP 0
#e... | replace | 257 | 258 | 257 | 258 | -11 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> v;
vector<char> ans;
bool ok = 1;
ll n, t;
ll ind = 0;
void solve(string s) {
if (!v[s[0] - 'A'] && !v[s[1] - 'A']) {
ok = 0;
return;
}
if (!v[s[0] - 'A'])
v[s[0] - 'A']++, v[s[1] - 'A']--, ans[ind++] = s[0];
else if (!... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> v;
vector<char> ans;
bool ok = 1;
ll n, t;
ll ind = 0;
void solve(string s) {
if (!v[s[0] - 'A'] && !v[s[1] - 'A']) {
ok = 0;
return;
}
if (!v[s[0] - 'A'])
v[s[0] - 'A']++, v[s[1] - 'A']--, ans[ind++] = s[0];
else if (!... | replace | 45 | 46 | 45 | 46 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
#define all(x) (x).begin(), (x).end()
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
void solve() {
int N;
vector<int> D(3);
cin >> N >> ... | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
#define all(x) (x).begin(), (x).end()
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
void solve() {
int N;
vector<int> D(3);
cin >> N >> ... | replace | 30 | 40 | 30 | 39 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, b, e) for (int i = (b); i < (e); ++i)
#define RREP(i, b, e) for (int i = (b)-1; i >= e; --i)
#define rep(i, e) for (int i = 0; i < (e); ++i)
struct Initializer {
Initializer() {
cin.tie(0);
ios::sync_with_stdio(0);
}
} initializer;
template <typ... | #include <iostream>
#include <vector>
using namespace std;
#define REP(i, b, e) for (int i = (b); i < (e); ++i)
#define RREP(i, b, e) for (int i = (b)-1; i >= e; --i)
#define rep(i, e) for (int i = 0; i < (e); ++i)
struct Initializer {
Initializer() {
cin.tie(0);
ios::sync_with_stdio(0);
}
} initializer;
... | replace | 0 | 1 | 0 | 2 | -11 | |
p02692 | C++ | Runtime Error | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i < (ll)(n2); i++)
#de... | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i < (ll)(n2); i++)
#de... | replace | 106 | 111 | 106 | 118 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define ll long long
#define ld long double
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
map<char, int>... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define ll long long
#define ld long double
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
map<char, int>... | replace | 33 | 34 | 33 | 35 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a, h) memset(a, (h), sizeof(a))
#define mem(a, h) memset(a, (h), sizeof(a))
#define fi first
#def... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a, h) memset(a, (h), sizeof(a))
#define mem(a, h) memset(a, (h), sizeof(a))
#define fi first
#def... | replace | 66 | 68 | 66 | 70 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) begin(v), end(v)
#define fi first
#define se second
template <typename A, typename B> inline bool chmax(A &a, B b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) begin(v), end(v)
#define fi first
#define se second
template <typename A, typename B> inline bool chmax(A &a, B b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
... | replace | 57 | 58 | 57 | 62 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<string> s(n);
vector<char> ans(n);
rep(i, n) cin >> s.at(i);
bool ok = true;
auto next = [&](int i, int &x, int &y) {
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<string> s(n);
vector<char> ans(n);
rep(i, n) cin >> s.at(i);
bool ok = true;
auto next = [&](int i, int &x, int &y) {
if (... | replace | 28 | 29 | 28 | 29 | 0 | |
p02692 | C++ | Memory Limit Exceeded | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
template <typename T1, typename T2> inli... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
template <typename T1, typename T2> inli... | delete | 41 | 42 | 41 | 41 | MLE | |
p02692 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using nam... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using nam... | insert | 136 | 136 | 136 | 140 | 0 | |
p02692 | C++ | Runtime Error | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i, m, n) for (ll i = (m); i < (n); i++)
#define rrep(i, m, n) for (ll i = (m); i >= (n); i--)
#define printa(x, n) ... | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i, m, n) for (ll i = (m); i < (n); i++)
#define rrep(i, m, n) for (ll i = (m); i >= (n); i--)
#define printa(x, n) ... | replace | 125 | 126 | 125 | 239 | 0 | |
p02692 | C++ | Time Limit Exceeded | // R<3S
#include <bits/stdc++.h>
#define DECIMAL(n) \
std::cout << std::fixed; \
std::cout << std::setprecision(n);
#define FAST \
std::... | // R<3S
#include <bits/stdc++.h>
#define DECIMAL(n) \
std::cout << std::fixed; \
std::cout << std::setprecision(n);
#define FAST \
std::... | replace | 78 | 79 | 78 | 80 | TLE | |
p02692 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
const double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) ... | #include <bits/stdc++.h>
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
const double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) ... | insert | 139 | 139 | 139 | 141 | TLE | |
p02692 | C++ | Runtime Error | #undef NDEBUG
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<... | #undef NDEBUG
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<... | replace | 235 | 236 | 235 | 236 | 0 | |
p02692 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | replace | 82 | 83 | 82 | 83 | TLE | |
p02692 | C++ | Runtime Error | #include <algorithm>
#include <cinttypes>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using u8t = std::uint64_t;
using i8t = std::int64_t;
#define F(I, N) for (i8t I = 0, I##_N = N; I < I##_N; I++)
#define FR(I, N) f... | #include <algorithm>
#include <cinttypes>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using u8t = std::uint64_t;
using i8t = std::int64_t;
#define F(I, N) for (i8t I = 0, I##_N = N; I < I##_N; I++)
#define FR(I, N) f... | replace | 73 | 74 | 73 | 74 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
co... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
co... | insert | 52 | 52 | 52 | 55 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
usin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
usin... | replace | 111 | 117 | 111 | 115 | 0 | |
p02692 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | replace | 168 | 169 | 168 | 169 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<char> ans;
bool ok = true;
if (A + B + C >= 3) {
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (s == "AB") {
if (A > B) {
ans.push_back('B');
B++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<char> ans;
bool ok = true;
if (A + B + C >= 3) {
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (s == "AB") {
if (A > B) {
ans.push_back('B');
B++... | delete | 138 | 140 | 138 | 138 | 0 | |
p02692 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<string> S(N);
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
if (A + B + C >= 3) {
string seq;
bool ok = tr... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<string> S(N);
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
if (A + B + C >= 3) {
string seq;
bool ok = tr... | replace | 108 | 109 | 108 | 109 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#include "string"
// #define int long long
#define pi pair<int, int>
#define ff first
#define ss second
#define boost \
ios_base::sync_with_stdio(false); \
cin.ti... | #include <bits/stdc++.h>
using namespace std;
#include "string"
// #define int long long
#define pi pair<int, int>
#define ff first
#define ss second
#define boost \
ios_base::sync_with_stdio(false); \
cin.ti... | insert | 46 | 46 | 46 | 49 | 0 | |
p02692 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | replace | 259 | 260 | 259 | 260 | 0 | |
p02692 | C++ | Runtime Error | /*#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long // comment it out when MLE
// # define endl "\n"
#define gok ... | /*#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long // comment it out when MLE
// # define endl "\n"
#define gok ... | replace | 108 | 109 | 108 | 110 | 0 | |
p02692 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vint vector<int>
#define vll vecto... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vint vector<int>
#define vll vecto... | replace | 76 | 86 | 76 | 87 | 0 | |
p02692 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<string> S(N);
for (auto &e : S)
cin >> e;
string ans = "", tmp = "";
auto dfs = [&](auto &&dfs, int i, int a, int b, int c) -> bool {
if (a < 0 or b < 0 or c < 0)
return false;
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<string> S(N);
for (auto &e : S)
cin >> e;
string ans = "", tmp = "";
auto dfs = [&](auto &&dfs, int i, int a, int b, int c) -> bool {
if (!ans.empty())
return true;
if (a < 0 or b <... | insert | 12 | 12 | 12 | 14 | TLE | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_range(i, s, e) for (int i = (s); i < (int)(e); i++)
#define rep_rev(i, s, e) for (int i = (s)-1; i >= (int)(e); i--)
#define sort_vec(v) sort((v).begin(), (v).end())
typedef int64_t lint;
// lint mod = 9982443... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_range(i, s, e) for (int i = (s); i < (int)(e); i++)
#define rep_rev(i, s, e) for (int i = (s)-1; i >= (int)(e); i--)
#define sort_vec(v) sort((v).begin(), (v).end())
typedef int64_t lint;
// lint mod = 9982443... | replace | 36 | 37 | 36 | 37 | 0 | |
p02692 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pa;
#define fst first
#define snd second
#define pb push_back
const int maxn = 300005, maxm = 106;
const double pi = acos(-1.0);
const ll mod = 1000000007;
const double eps = 1e-6;
int n, x[3];
bool fl = 1;
char c[maxn] = {0}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pa;
#define fst first
#define snd second
#define pb push_back
const int maxn = 300005, maxm = 106;
const double pi = acos(-1.0);
const ll mod = 1000000007;
const double eps = 1e-6;
int n, x[3];
bool fl = 1;
char c[maxn] = {0}... | insert | 50 | 50 | 50 | 52 | TLE | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | replace | 54 | 55 | 54 | 55 | 0 | |
p02692 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int N = 2e5 + 5;
const int Mod = 1e9 + 7... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int N = 2e5 + 5;
const int Mod = 1e9 + 7... | replace | 38 | 39 | 38 | 40 | 0 | |
p02692 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main() {
int N, A[3], i, j, k, nj, nk;
char s[3];
int ans[10000];
scanf("%d%d%d%d", &N, A, A + 1, A + 2);
// if(A[0] + A[1] + A[2] == 0){
// printf("No");
// }
scanf("%s", s);
if (strcmp(s, "AB") == 0) {
j = 0;
k = 1;
}
if (strcmp(s, "AC") == 0... | #include <stdio.h>
#include <string.h>
int main() {
int N, A[3], i, j, k, nj, nk;
char s[3];
int ans[100000];
scanf("%d%d%d%d", &N, A, A + 1, A + 2);
// if(A[0] + A[1] + A[2] == 0){
// printf("No");
// }
scanf("%s", s);
if (strcmp(s, "AB") == 0) {
j = 0;
k = 1;
}
if (strcmp(s, "AC") == ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02692 | Python | Runtime Error | N, A, B, C = map(int, input().split())
opts = []
for _ in range(N):
opt = input()
opts.append((ord(opt[0]) - ord("A"), ord(opt[1]) - ord("A")))
choices = []
nums = [A, B, C]
for i, opt in enumerate(opts):
if nums[opt[0]] == 0 and nums[opt[1]] == 0:
print("No")
break
if nums[opt[0]] == 1... | N, A, B, C = map(int, input().split())
opts = []
for _ in range(N):
opt = input()
opts.append((ord(opt[0]) - ord("A"), ord(opt[1]) - ord("A")))
choices = []
nums = [A, B, C]
for i, opt in enumerate(opts):
if nums[opt[0]] == 0 and nums[opt[1]] == 0:
print("No")
break
if nums[opt[0]] == 1... | replace | 14 | 17 | 14 | 17 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
#define odd(x) ((x)&1)
#define even(x) (!odd(x))
#define ff it->first
#define ss it->... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
#define odd(x) ((x)&1)
#define even(x) (!odd(x))
#define ff it->first
#define ss it->... | replace | 96 | 97 | 96 | 97 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02692 | C++ | Runtime Error | #include "bits/stdc++.h"
#define FI first.first
#define SE first.second
#define TH second
#define fi first
#define se second
#define th second
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_... | #include "bits/stdc++.h"
#define FI first.first
#define SE first.second
#define TH second
#define fi first
#define se second
#define th second
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_... | replace | 60 | 61 | 60 | 61 | 0 | |
p02692 | Python | Runtime Error | #!/usr/bin/env python3
S, stack = [], []
N = 0
def main() -> None:
global N
N, A, B, C = rmi()
for n in range(N):
S.append(r())
enable = dfs(stack, 0, A, B, C)
w("Yes" if enable else "No")
if enable:
wm(*stack, delim="\n")
def dfs(stack, index, a, b, c) -> bool:
if N <=... | #!/usr/bin/env python3
S, stack = [], []
N = 0
def main() -> None:
global N
N, A, B, C = rmi()
for n in range(N):
S.append(r())
enable = dfs(stack, 0, A, B, C)
w("Yes" if enable else "No")
if enable:
wm(*stack, delim="\n")
def dfs(stack, index, a, b, c) -> bool:
if N <=... | replace | 99 | 100 | 99 | 100 | OverflowError: Python int too large to convert to C int | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02692/Python/s269080943.py", line 99, in <module>
sys.setrecursionlimit(10**10)
OverflowError: Python int too large to convert to C int
|
p02692 | Python | Runtime Error | n, a, b, c = (int(x) for x in input().split())
d = {"A": a, "B": b, "C": c}
S = [input() for _ in range(n)]
ANS = []
for i, s in enumerate(S):
if d[s[0]] == 0 and d[s[1]] == 0:
print("No")
exit()
else:
if d[s[0]] > d[s[1]] or (
d[s[0]] == d[s[1]] == 1 and i < n and s[1] in S... | n, a, b, c = (int(x) for x in input().split())
d = {"A": a, "B": b, "C": c}
S = [input() for _ in range(n)]
ANS = []
for i, s in enumerate(S):
if d[s[0]] == 0 and d[s[1]] == 0:
print("No")
exit()
else:
if d[s[0]] > d[s[1]] or (
d[s[0]] == d[s[1]] == 1 and i < n - 1 and s[1] ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define eps 1e-8
// #define eq(x,y) (fabs((x)-(y)) < eps)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const ll mod = 998244353... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define eps 1e-8
// #define eq(x,y) (fabs((x)-(y)) < eps)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const ll mod = 998244353... | replace | 115 | 116 | 115 | 117 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define M 1000000007
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long int
#define mem(x) memset(x, 0, sizeof(x))
#define setbits(x) __builtin_popcount(x)
#define ull un... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define M 1000000007
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long int
#define mem(x) memset(x, 0, sizeof(x))
#define setbits(x) __builtin_popcount(x)
#define ull un... | delete | 63 | 64 | 63 | 63 | 0 | |
p02692 | C++ | Runtime Error | #ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
#define pf push_front
#define FI first
#define SE second
#define eb emp... | #ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
#define pf push_front
#define FI first
#define SE second
#define eb emp... | replace | 550 | 581 | 550 | 579 | -6 | /usr/include/c++/12/debug/vector:442:
In function:
std::debug::vector<_Tp, _Allocator>::reference std::debug::vector<_Tp,
_Allocator>::operator[](size_type) [with _Tp = char; _Allocator =
std::allocator<char>; reference = char&; size_type = long unsigned int]
Error: attempt to subscript container with ou... |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll, ll> PLL;
#define chmax(x, y) \
do { \
x = max(x, y); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll, ll> PLL;
#define chmax(x, y) \
do { \
x = max(x, y); ... | insert | 69 | 69 | 69 | 70 | 0 | |
p02692 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<string> S(N);
for (auto &x : S)
cin >> x;
int t = 0;
if (!A || !B || !C) {
vector<map<vector<int>, pair<int, int>>> a(1);
a[0][{A, B, C}] = {-1, -1};
vector<int> c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<string> S(N);
for (auto &x : S)
cin >> x;
int t = 0;
if (!A || !B || !C) {
vector<map<vector<int>, pair<int, int>>> a(1);
a[0][{A, B, C}] = {-1, -1};
vector<int> c... | replace | 50 | 51 | 50 | 51 | 0 | |
p02693 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
// #include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout... | #include "bits/stdc++.h"
// #include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout... | insert | 41 | 41 | 41 | 42 | TLE | |
p02693 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int K, A, B;
bool flag = 0;
for (int i = A; i <= B; i++) {
if (i % K == 0)
flag = 1;
}
if (flag == 1)
cout << "OK" << endl;
else
cout << "NG" << endl;
} | #include <iostream>
using namespace std;
int main() {
int K, A, B;
cin >> K >> A >> B;
bool flag = 0;
for (int i = A; i <= B; i++) {
if (i % K == 0)
flag = 1;
}
if (flag == 1)
cout << "OK" << endl;
else
cout << "NG" << endl;
}
| insert | 6 | 6 | 6 | 7 | TLE | |
p02693 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define fast_io() \
; \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define int long long
#define fast_io() \
; \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | replace | 45 | 46 | 45 | 46 | 0 | |
p02693 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, A, B, flag = 0;
cin >> A >> B;
for (int i = A; i <= B; i++) {
if (i % K == 0) {
cout << "OK" << endl;
flag = 1;
break;
}
}
if (flag != 1) {
cout << "NG" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int K, A, B, flag = 0;
cin >> K >> A >> B;
for (int i = A; i <= B; i++) {
if (i % K == 0) {
cout << "OK" << endl;
flag = 1;
break;
}
}
if (flag != 1) {
cout << "NG" << endl;
}
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02693 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b;
int res = (b - b % k);
if (res < a) {
cout << "NG";
} else
cout << "OK";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> k >> a >> b;
int res = (b - b % k);
if (res < a) {
cout << "NG";
} else
cout << "OK";
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02693 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
vector<ll> V;
int pre[maxn];
int main() {
int k, a, b;
cin >> a >> b;
for (int i = a; i <= b; i++) {
if (i % k == 0) {
puts("OK");
return 0;
}
}
puts("NG");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
vector<ll> V;
int pre[maxn];
int main() {
int k, a, b;
cin >> k >> a >> b;
for (int i = a; i <= b; i++) {
if (i % k == 0) {
puts("OK");
return 0;
}
}
puts("NG");
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02693 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, a, b;
cin >> k >> a >> b;
bool f = 0;
for (int i = a; a <= b; i++)
if (i % k == 0)
f = 1;
cout << (f ? "OK" : "NG") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, a, b;
cin >> k >> a >> b;
bool f = 0;
for (int i = a; i <= b; i++)
if (i % k == 0)
f = 1;
cout << (f ? "OK" : "NG") << endl;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02693 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, A, B;
cin >> K >> A >> B;
while (true) {
bool add = false;
for (int i = 0; i < 100; i++) {
if (A <= K * i && B >= K * i) {
add = true;
}
}
if (add) {
cout << "OK" << endl;
} else {
cout << "NG" <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, a, b;
cin >> k >> a >> b;
if (a <= (b / k) * k) {
cout << "OK" << endl;
} else {
cout << "NG" << endl;
}
}
| replace | 4 | 18 | 4 | 10 | TLE | |
p02693 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
#define pb push_back
typedef pair<ll, ll> pp;
ll mod = 1e9 + 7;
ll INF = 1e15;
ll powm(ll a, ll b, ll mod) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
#define pb push_back
typedef pair<ll, ll> pp;
ll mod = 1e9 + 7;
ll INF = 1e15;
ll powm(ll a, ll b, ll mod) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
... | insert | 49 | 49 | 49 | 50 | TLE | |
p02693 | Python | Runtime Error | K = int(input())
A, B = map(int, input().slice())
print("OK" if B - A >= K else "NG")
| K = int(input())
A, B = map(int, input().split())
large = (B // K) * K
if A <= large:
print("OK")
else:
print("NG")
| replace | 1 | 3 | 1 | 7 | AttributeError: 'str' object has no attribute 'slice' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02693/Python/s877795440.py", line 2, in <module>
A, B = map(int, input().slice())
AttributeError: 'str' object has no attribute 'slice'
|
p02693 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define link(x) for (edge *j = h[x]; j; j = j->next)
#define inc(i, l, r) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define link(x) for (edge *j = h[x]; j; j = j->next)
#define inc(i, l, r) ... | replace | 51 | 52 | 51 | 52 | 3 | |
p02693 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
int a[1];
cin >> k;
for (int i = 0; i < 2; i++) {
cin >> a[i];
}
if (a[1] - a[0] >= k - 1) {
cout << "OK" << endl;
} else {
cout << "NG" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, a, b;
cin >> k >> a >> b;
int i = b / k;
if (k * i >= a) {
cout << "OK" << endl;
} else {
cout << "NG" << endl;
}
return 0;
} | replace | 4 | 11 | 4 | 8 | -6 | *** stack smashing detected ***: terminated
|
p02693 | C++ | Runtime Error | #include "bits/stdc++.h"
#define EPS 1e-9
using namespace std;
const int N = 1e5, OO = 0x3f3f3f3f;
typedef long long ll;
int main() {
int a, b, k;
for (int i = min(a, b); i <= max(a, b); i++)
if (i % k == 0)
return cout << "OK", 0;
cout << "NG";
} | #include "bits/stdc++.h"
#define EPS 1e-9
using namespace std;
const int N = 1e5, OO = 0x3f3f3f3f;
typedef long long ll;
int main() {
int a, b, k;
cin >> k >> a >> b;
for (int i = a; i <= b; i++)
if (i % k == 0)
return cout << "OK", 0;
cout << "NG";
} | replace | 7 | 8 | 7 | 9 | 0 | |
p02693 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int k, a, b;
cin >> k >> a >> b;
for (ll i = a; i = b; ++i) {
if (i % k == 0) {
cout << "OK" << endl;
return 0;
}
}
cout << "NG" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int k, a, b;
cin >> k >> a >> b;
for (ll i = a; i <= b; ++i) {
if (i % k == 0) {
cout << "OK" << endl;
return 0;
}
}
cout << "NG" << endl;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02693 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18, MOD = 1e9 + 7;
const int INT_INF = 1e9, INT_MOD = 1e9 + 7;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef pair<int, int> Pi;
typedef pair<double, double> P;
signed main() {
int k, a, b;
cin >> k >> a >> b;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18, MOD = 1e9 + 7;
const int INT_INF = 1e9, INT_MOD = 1e9 + 7;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef pair<int, int> Pi;
typedef pair<double, double> P;
signed main() {
int k, a, b;
cin >> k >> a >> b;
for (int i =... | replace | 12 | 13 | 12 | 13 | TLE | |
p02693 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define reps(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define in(i) std::cin >> i;
#define print(i) std::cout << i;
#define println(i) std::cout << i << std::endl;
using namespace std;
in... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define reps(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define in(i) std::cin >> i;
#define print(i) std::cout << i;
#define println(i) std::cout << i << std::endl;
using namespace std;
in... | insert | 25 | 25 | 25 | 26 | TLE | |
p02693 | C++ | Runtime Error | #include <iostream>
using namespace std;
int countDivisibles(int A, int B, int M) {
bool check = false;
for (int i = A; i <= B; i++) {
if (i % M == 0)
check = true;
}
if (check)
cout << "OK" << endl;
else {
cout << "NG" << endl;
}
}
int main() {
int A, B, M;
cin >> M;
cin >> A >> B... | #include <iostream>
using namespace std;
void countDivisibles(int A, int B, int M) {
bool check = false;
for (int i = A; i <= B; i++) {
if (i % M == 0)
check = true;
}
if (check)
cout << "OK" << endl;
else {
cout << "NG" << endl;
}
}
int main() {
int A, B, M;
cin >> M;
cin >> A >> ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02693 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep(i, a, b) for (typeof(i) i = (a); i < (b); ++i)
#define itrep(it, c) for (auto it = (c).begin(); it != (c).end(); ++it)
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep(i, a, b) for (typeof(i) i = (a); i < (b); ++i)
#define itrep(it, c) for (auto it = (c).begin(); it != (c).end(); ++it)
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll... | replace | 17 | 18 | 17 | 18 | 1 | |
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() {
int X;
int Y = 100;
int C = 0;
cin >> X;
while (Y < X) {
Y += Y / 100;
C++;
}
cout << (C) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long X;
long Y = 100;
long C = 0;
cin >> X;
while (Y < X) {
Y += Y / 100;
C++;
}
cout << (C) << endl;
} | replace | 5 | 8 | 5 | 8 | 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()
#define _GLIBCXX_DEBUG
int main() {
using vi = vector<int>;
int a = 100;
int count = 0;
int x;
cin >> x;
while (a < x) {
count++;
a *= 1.01;
}
cout << count << e... | #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()
#define _GLIBCXX_DEBUG
int main() {
using vi = vector<int>;
long long a = 100;
long long count = 0;
long long x;
cin >> x;
while (a < x) {
count++;
a *= 1.01;
}
... | replace | 9 | 12 | 9 | 12 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
// #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
typedef long long ll;
int main() {
ll x;
cin >> x;
ll deposit = 100;
ll year ... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
// #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
typedef long long ll;
int main() {
ll x;
cin >> x;
ll deposit = 100;
ll year ... | replace | 19 | 20 | 19 | 20 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
int sum = 0;
int mon = 100;
while (mon < X) {
mon += mon / 100;
sum++;
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
int sum = 0;
long long mon = 100;
while (mon < X) {
mon += mon / 100;
sum++;
}
cout << sum << endl;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int x, a = 100, i = 0;
cin >> x;
for (; a < x; i += 1) {
a *= 1.01;
}
cout << i << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long x, a = 100, i = 0;
cin >> x;
for (; a < x; i += 1) {
a *= 1.01;
}
cout << i << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 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;
using ll = long long;
int main() {
ll X;
cin >> X;
int r = 100;
ll ans = 0;
while (r < X) {
r = r * 1.01;
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll X;
cin >> X;
ll r = 100;
ll ans = 0;
while (r < X) {
r = r * 1.01;
ans++;
}
cout << ans << endl;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int x, y = 100, i = 0;
cin >> x;
for (; y < x; i++) {
y *= 1.01;
}
cout << i;
} | #include <iostream>
using namespace std;
int main() {
long long x, y = 100, i = 0;
cin >> x;
for (; y < x; i++) {
y *= 1.01;
}
cout << i;
} | replace | 3 | 4 | 3 | 4 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define SIZE_OF_ARRAY(array) sizeof(array) / sizeof(array[0])
int main() {
long long X;
cin >> X;
int year = 0;
for (int i = 100; i < X;) {
i *= 1.01;
year++;
}
cout << year;
} | #include <bits/stdc++.h>
using namespace std;
#define SIZE_OF_ARRAY(array) sizeof(array) / sizeof(array[0])
int main() {
long long X;
cin >> X;
long long year = 0;
for (long long i = 100; i < X;) {
i += i * 0.01;
year++;
}
cout << year;
} | replace | 8 | 11 | 8 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long X, deposit;
cin >> X;
long i = 0;
deposit = 1;
while (deposit < X) {
deposit *= 1.01;
i++;
}
cout << i << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long X, deposit;
cin >> X;
long i = 0;
deposit = 100;
while (deposit < X) {
deposit *= 1.01;
i++;
}
cout << i << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, i, sum;
i = 0;
sum = 100;
cin >> x;
while (sum < x) {
sum = sum * 1.01;
i++;
}
cout << i << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, i, sum;
i = 0;
sum = 100;
cin >> x;
while (sum < x) {
sum = sum * 1.01;
i++;
}
cout << i << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const int N = 3e5 + 6;
const int mod = 1e9 + 7;
const int inf = 1e8;
void solve() {
ll k;
cin >> k;
ll st = 100;
for (int i = 0; i <= 40000; i++) {
if (st >= k)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const int N = 3e5 + 6;
const int mod = 1e9 + 7;
const int inf = 1e8;
void solve() {
ll k;
cin >> k;
ll st = 100;
for (int i = 0; i <= 40000; i++) {
if (st >= k)... | replace | 17 | 18 | 17 | 18 | 255 | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
cin >> a;
int t = 0;
long long k = 100;
while (k != a) {
k = k * 1.01;
t++;
}
cout << t;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
cin >> a;
int t = 0;
long long k = 100;
while (k < a) {
k = k * 1.01;
t++;
}
cout << t;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int InVal = 100;
int x;
int years = 0;
cin >> x;
while (InVal < x) {
InVal = floor(InVal * 1.01);
++years;
}
cout << years << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
long long InVal = 100;
long long x;
long long years = 0;
cin >> x;
while (InVal < x) {
InVal = floor(InVal * 1.01);
++years;
}
cout << years << endl;
return 0;
} | replace | 5 | 8 | 5 | 8 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int money = 100;
int X;
cin >> X;
int year = 0;
while (money < X) {
money = money + money / 100;
year++;
}
cout << year << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long money = 100;
long long X;
cin >> X;
int year = 0;
while (money < X) {
money = money + money / 100;
year++;
}
cout << year << endl;
}
| replace | 4 | 6 | 4 | 6 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
double x;
int i, a = 100;
cin >> x;
for (i = 0; a < x; i++) {
a = a * 1.01;
}
cout << i << endl;
} | #include <iostream>
using namespace std;
int main() {
double x;
long i, a = 100;
cin >> x;
for (i = 0; a < x; i++) {
a = a * 1.01;
}
cout << i << endl;
} | replace | 5 | 6 | 5 | 6 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <string>
#define START 100
using namespace std;
int main() {
int year, money, value;
long x;
cin >> x;
money = START;
year = 0;
while (money < x) {
value = money / 100;
money += value;
year++;
}
cout << year;
}
| #include <cmath>
#include <iostream>
#include <string>
#define START 100
using namespace std;
int main() {
int year;
long x, money, value;
cin >> x;
money = START;
year = 0;
while (money < x) {
value = money / 100;
money += value;
year++;
}
cout << year;
}
| replace | 9 | 11 | 9 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <ctype.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define ll long long int
#define rea... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <ctype.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define ll long long int
#define rea... | replace | 81 | 83 | 81 | 82 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pp pop_back
#define in insert
#define ff ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pp pop_back
#define in insert
#define ff ... | replace | 19 | 23 | 19 | 21 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
// prepare variables
int init_value = 100;
long int target_value;
cin >> target_value;
// calculate answer
int ans = 0;
long int stock = init_value;
while (ans <= 1e18) {
stock = (int)(stock * 1.01);
ans++;
if (stock >=... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
// prepare variables
int init_value = 100;
long int target_value;
cin >> target_value;
// calculate answer
int ans = 0;
long int stock = init_value;
while (ans <= 1e18) {
stock = (long int)(stock * 1.01);
ans++;
if (sto... | replace | 14 | 15 | 14 | 15 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long X;
long long ans = 100;
int i = 0;
cin >> X;
while (ans < X) {
ans *= 101;
ans /= 100;
i++;
}
cout << i;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long X;
long long ans = 100;
int i = 0;
cin >> X;
while (ans < X) {
ans += ans / 100;
i++;
}
cout << i;
} | replace | 17 | 19 | 17 | 18 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y = 100, cnt = 0;
cin >> x;
while (true) {
if (x <= y) {
cout << cnt << endl;
return 0;
}
cnt++;
y = y * 20.1 / 20;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y = 100, cnt = 0;
cin >> x;
while (true) {
if (x <= y) {
cout << cnt << endl;
return 0;
}
cnt++;
y = y + y / 100;
}
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02694 | C++ | Time Limit Exceeded | // #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
// #pragma GCC optimize ("Ofast,no-stack-protector")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC optimize ("fast-math")
// #pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
using namespace std;
typedef long long int... | // #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
// #pragma GCC optimize ("Ofast,no-stack-protector")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC optimize ("fast-math")
// #pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
using namespace std;
typedef long long int... | replace | 131 | 132 | 131 | 132 | TLE | |
p02694 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long s = 100;
int res = 0;
while (s < x) {
s = s + s * 0.01;
res++;
}
cout << res;
return res;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long s = 100;
int res = 0;
while (s < x) {
s = s + s * 0.01;
res++;
}
cout << res;
return 0;
} | replace | 13 | 14 | 13 | 14 | 3 | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
using namespace std;
long long X;
int main() {
cin >> X;
long long res = 0;
long long money = 100;
while (money < X) {
money = money * 101 / 100;
res++;
}
cout << res << endl;
r... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
using namespace std;
long long X;
int main() {
cin >> X;
long long res = 0;
long long money = 100;
while (money < X) {
money = money * 1.01;
res++;
}
cout << res << endl;
return... | replace | 10 | 11 | 10 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 100;
long long x;
cin >> x;
int i = 0;
while (a < x) {
a += a / 100;
i++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a = 100;
long long x;
cin >> x;
int i = 0;
while (a < x) {
a += a / 100;
i++;
}
cout << i << endl;
} | replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, i;
b = 100;
i = 0;
cin >> a;
while (b < a) {
b = (b * 101) / 100;
i++;
}
cout << i;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, i;
b = 100;
i = 0;
cin >> a;
while (b < a) {
long long c = b / 100;
b = b + c;
i++;
}
cout << i;
} | replace | 8 | 9 | 8 | 10 | 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() {
ll x;
cin >> x;
ll ans = 0;
ll y = 100;
while (y < x) {
y = y * 101 / 100;
// cout << y << endl;
ans++;
}
cout << ans << endl;
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() {
ll x;
cin >> x;
ll ans = 0;
ll y = 100;
while (y < x) {
y += y / 100;
// cout << y << endl;
ans++;
}
cout << ans << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | 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>
using namespace std;
int main(void) {
long long X;
cin >> X;
long long ykn = 100;
int ans = 0;
while (ykn < X) {
ans++;
ykn = ykn * 101 / 100;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long X;
cin >> X;
long long ykn = 100;
int ans = 0;
while (ykn < X) {
ans++;
ykn += ykn / 100;
}
cout << ans << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, cnt = 100;
cin >> a;
for (int i = 0;; i++) {
cnt = cnt + cnt / 100;
if (cnt == a) {
cout << i + 1;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, cnt = 100;
cin >> a;
for (int i = 0;; i++) {
cnt = cnt + cnt / 100;
if (cnt >= a) {
cout << i + 1;
return 0;
}
}
return 0;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll x, m = 100, ans = 0;
cin >> x;
while (true) {
m = m * 101 / 100;
++ans;
if (m >= x)
break;
}
co... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll x, m = 100, ans = 0;
cin >> x;
while (true) {
m = m * 1.01;
++ans;
if (m >= x)
break;
}
cout <<... | replace | 11 | 12 | 11 | 12 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
#define big 998244353
#define ff first
#define se second
#define pb push_back
#define pii pair<int, int>
#define fast \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
#define big 998244353
#define ff first
#define se second
#define pb push_back
#define pii pair<int, int>
#define fast \
ios_base::sync_with_stdio(0); ... | replace | 53 | 54 | 53 | 54 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define FOR(i, l, r) for (i = l; i < r; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define P pair<ll, ll>
#define F first
#define S second
signed main() {
ll X, i = 100, ans = 0;
cin >> X;
while (i < X) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define FOR(i, l, r) for (i = l; i < r; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define P pair<ll, ll>
#define F first
#define S second
signed main() {
ll X, i = 100, ans = 0;
cin >> X;
while (i < X) {... | replace | 25 | 26 | 25 | 26 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.