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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p00128 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int i, j = 0, n[5];
string s;
char x[5], l[2] = {' ', '*'};
while (cin >> i) {
if (j)
cout << endl;
sprintf(x, "%05d", i);
for (j = 5; j-- > 0;)
n[j] = x[j] - '0';
s = "";
while (j++ < 1) {
... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int i, j = 0, n[5];
string s, l[2] = {" ", "*"};
char x[6];
while (cin >> i) {
if (j)
cout << endl;
sprintf(x, "%05d", i);
for (j = 5; j-- > 0;)
n[j] = x[j] - '0';
s = "";
while (j++ < 1) {
... | replace | 6 | 8 | 6 | 8 | 0 | |
p00129 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, j) FOR(i, 0, j)
#define mp std::make_pair
typedef long long ll;
typedef u... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, j) FOR(i, 0, j)
#define mp std::make_pair
typedef long long ll;
typedef u... | replace | 100 | 102 | 100 | 102 | 0 | |
p00129 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
struct Wall {
int x, y, r;
};
bool inside(Wall w, double x, double y) {
return w.r * w.r >= (w.x - x) * (w.x - x) + (w.y - y) * (w.y - y);
}
int main() {
int n, wx, wy, r, m, tx, ty, sx, sy;
while (cin >> n, n) {
vector<Wall> w;... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
struct Wall {
int x, y, r;
};
bool inside(Wall w, double x, double y) {
return w.r * w.r >= (w.x - x) * (w.x - x) + (w.y - y) * (w.y - y);
}
int main() {
int n, wx, wy, r, m, tx, ty, sx, sy;
while (cin >> n, n) {
vector<Wall> w;... | replace | 29 | 31 | 29 | 31 | TLE | |
p00130 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUNT(i, n) for ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUNT(i, n) for ... | replace | 42 | 44 | 42 | 43 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::substr: __pos (which is 3) > this->size() (which is 1)
|
p00132 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define inf (1 << 28)
#define MAX 31
using namespace std;
typedef pair<int, int> ii;
typedef vector<string> ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define inf (1 << 28)
#define MAX 31
using namespace std;
typedef pair<int, int> ii;
typedef vector<string> ... | insert | 137 | 137 | 137 | 170 | TLE | |
p00134 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, s[1000], i, j, b;
long long int av = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> s[i];
av = s[i] + av;
}
cout << av / n << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, i, b, s[100010];
long long int av = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> s[i];
av = s[i] + av;
}
cout << av / n << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p00135 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int a, b, n;
double d, e, f;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d:%d", a, b);
d = b * 6;
e = 1.0 * (a * 30 + b) / 2.0;
f = abs(d - e);
if (f > 180) {
f = 360 - f;
}
if (f < 30) {
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int a, b, n;
double d, e, f;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d:%d", &a, &b);
f = abs(a * 30 - b * 11.0 / 2.0);
if (f > 180) {
f = 360 - f;
}
if (f < 30) {
cout << "alert" << endl;... | replace | 9 | 13 | 9 | 11 | -11 | |
p00137 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
long n, m, i, j;
string s, t;
stringstream ss;
string::size_type k;
char mm[9];
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
cout << "Case " << i + 1 << ":" << endl;
for (j = 0; j < 10... | #include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
long n, m, i, j;
string s, t;
stringstream ss;
string::size_type k;
char mm[9];
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
cout << "Case " << i + 1 << ":" << endl;
for (j = 0; j < 10... | replace | 20 | 21 | 20 | 24 | 0 | |
p00138 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
const doubl... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
const doubl... | replace | 32 | 34 | 32 | 34 | 0 | |
p00140 | 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 PB push_back
#define p(a, b) g.PB(pii(a, b))
#define INF (1 << 29)
typedef pair<int, int> pii;
typedef vector<pii> vp;
int main() {
vp g; // pos to
REP(i, 9) p(i, i + 1);
p... | #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 PB push_back
#define p(a, b) g.PB(pii(a, b))
#define INF (1 << 29)
typedef pair<int, int> pii;
typedef vector<pii> vp;
int main() {
vp g; // pos to
REP(i, 9) p(i, i + 1);
p... | replace | 23 | 24 | 23 | 24 | 0 | |
p00140 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <ut... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <ut... | replace | 33 | 35 | 33 | 35 | 0 | |
p00140 | C++ | Runtime Error | #include <climits>
#include <iostream>
#include <memory>
#include <vector>
class Bus_stop {
public:
Bus_stop(const int &i) : id{i}, mins(10, INT_MAX - 1), prevs(10, nullptr) {
mins.at(i) = 0;
};
//?¬?????????????????¨????
void set_next(Bus_stop &other) {
// this ?????? other ????????????????????????
... | #include <climits>
#include <iostream>
#include <memory>
#include <vector>
class Bus_stop {
public:
Bus_stop(const int &i) : id{i}, mins(10, INT_MAX - 1), prevs(10, nullptr) {
mins.at(i) = 0;
};
//?¬?????????????????¨????
void set_next(Bus_stop &other) {
// this ?????? other ????????????????????????
... | replace | 125 | 127 | 125 | 127 | 0 | |
p00140 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a, b;
cin >> n;
for (int loop = 0; loop < n; loop++) {
cin >> a >> b;
if (a == b) {
printf("%d\n", b);
} else if (a < b) {
for (int i = a; i < b; i++) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a, b;
cin >> n;
for (int loop = 0; loop < n; loop++) {
cin >> a >> b;
if (a == b) {
printf("%d\n", b);
} else if (a < b) {
for (int i = a; i < b; i++) {
... | replace | 33 | 34 | 33 | 34 | TLE | |
p00141 | C++ | Runtime Error | #include <iostream>
using namespace std;
bool vis[30][30], na[30][30];
int dx[] = {0, 1, 0, -1}, dy[] = {-1, 0, 1, 0};
int ex[] = {-1, 1, 0, 0}, ey[] = {0, 0, -1, 1};
int n;
void DFS(int y, int x, int k) {
vis[y][x] = true;
na[y][x] = true;
int xx, yy;
bool done = false;
for (int i = 0; i < 4; i++) {
xx =... | #include <iostream>
using namespace std;
bool vis[110][110], na[110][110];
int dx[] = {0, 1, 0, -1}, dy[] = {-1, 0, 1, 0};
int ex[] = {-1, 1, 0, 0}, ey[] = {0, 0, -1, 1};
int n;
void DFS(int y, int x, int k) {
vis[y][x] = true;
na[y][x] = true;
int xx, yy;
bool done = false;
for (int i = 0; i < 4; i++) {
... | replace | 2 | 3 | 2 | 3 | 0 | |
p00141 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
// #define int long long
#define DBG 0
#define dump(o) \
if (DBG) { \
cerr << #o << " " << (o) << " "; ... | #include "bits/stdc++.h"
using namespace std;
// #define int long long
#define DBG 0
#define dump(o) \
if (DBG) { \
cerr << #o << " " << (o) << " "; ... | insert | 54 | 54 | 54 | 64 | TLE | |
p00142 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int ok(int n) {
if (n < 2)
return 0;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
int main() {
int n;
while (cin >> n, n) {
set<int> r;
for (int ... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int ok(int n) {
if (n < 2)
return 0;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
int main() {
int n;
while (cin >> n, n) {
set<int> r;
for (int ... | replace | 25 | 26 | 25 | 26 | TLE | |
p00142 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int ans[5001], m[10001], f[10001], n, i, j, k, c;
while (cin >> n) {
if (n == 0)
break;
c = 0;
for (i = 0; i < 10001; i++)
ans[i] = f[i] = 0;
for (i = 1; i <= (n - 1) / 2; i++) {
k = (i * i) % n;
if (f... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int ans[10001], m[10001], f[10001], n, i, j, k, c;
while (cin >> n) {
if (n == 0)
break;
c = 0;
for (i = 0; i < 10001; i++)
ans[i] = f[i] = 0;
for (i = 1; i <= (n - 1) / 2; i++) {
k = (i * i) % n;
if (... | replace | 6 | 7 | 6 | 7 | 0 | |
p00142 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
int ans[100000000], n;
while (cin >> n, n) {
vector<int> vec;
rep(i, (int)((n - 1) / 2) + 1) ans[i] = 0;
REP(i, 1, n) vec.push_bac... | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
int ans[1000000], n;
while (cin >> n, n) {
vector<int> vec;
rep(i, (int)((n - 1) / 2) + 1) ans[i] = 0;
REP(i, 1, n) vec.push_back(... | replace | 8 | 9 | 8 | 9 | -11 | |
p00142 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
bool isAppeared[10001];
int data[10001];
fill(isAppeared, isAppeared + 10001, false);
fill(data, data + 10001, 0);
// memset(isApp... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
bool isAppeared[10001];
int data[10001];
fill(isAppeared, isAppeared + 10001, false);
fill(data, data + 10001, 0);
// memset(isApp... | replace | 22 | 24 | 22 | 24 | TLE | |
p00142 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | insert | 16 | 16 | 16 | 18 | TLE | |
p00142 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, arr[5000];
std::vector<int> v;
while (std::cin >> n, n) {
std::fill(arr, arr + 5000, 0);
v.clear();
for (int i = 1; i <= (n - 1) / 2; i++) {
if (std::find(v.begin(), v.end(), i * i % n) == v.end()) { // まだない
... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, arr[5000];
std::vector<int> v;
while (std::cin >> n, n) {
std::fill(arr, arr + 5000, 0);
v.clear();
for (int i = 1; i <= (n - 1) / 2; i++) {
if (std::find(v.begin(), v.end(), i * i % n) == v.end()) { // まだない
... | replace | 17 | 18 | 17 | 18 | TLE | |
p00143 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
using namespace std;
double square_calc(double x1, double y1, double x2, double y2, double x3,
double y3) {
double square = 0;
double a = sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
double b = sqrt((x3 - x1) * (x3 - x1) + (y3 - y1) * (y3 - y1));
... | #include <iostream>
#include <math.h>
using namespace std;
double square_calc(double x1, double y1, double x2, double y2, double x3,
double y3) {
double square = 0;
double a = sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
double b = sqrt((x3 - x1) * (x3 - x1) + (y3 - y1) * (y3 - y1));
... | replace | 17 | 34 | 17 | 33 | TLE | |
p00143 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#inclu... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#inclu... | replace | 107 | 108 | 107 | 108 | -6 | double free or corruption (out)
|
p00144 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, j) for (int i = 0; i < j; i++)
#d... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, j) for (int i = 0; i < j; i++)
#d... | replace | 19 | 20 | 19 | 20 | 0 | |
p00146 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
const doubl... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
const doubl... | replace | 49 | 50 | 49 | 50 | TLE | |
p00146 | C++ | Runtime Error | #include <stdio.h>
#include <vector>
using namespace std;
#define PB push_back
const int N = 1e2 + 10;
const int MAXN = 1 << 16;
const double INF = 1 << 30;
int abs(int a) { return a > 0 ? a : -a; }
int main() {
int n, s[N], d[N], v[N], from[MAXN][N], val[MAXN], all, now = 0, top;
vector<int> ans;
double dp[MAXN]... | #include <stdio.h>
#include <vector>
using namespace std;
#define PB push_back
const int N = 1e1 + 10;
const int MAXN = 1 << 16;
const double INF = 1 << 30;
int abs(int a) { return a > 0 ? a : -a; }
int main() {
int n, s[N], d[N], v[N], from[MAXN][N], val[MAXN], all, now = 0, top;
vector<int> ans;
double dp[MAXN]... | replace | 4 | 5 | 4 | 5 | -11 | |
p00146 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | replace | 55 | 57 | 55 | 60 | MLE | |
p00147 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int seat[17] = {0};
int X = 0;
int stop[100] = {0};
int time = 0;
queue<int> Q;
while (X < 100) {
int x;
if (time % 5 == 0... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int seat[17] = {0};
int X = 0;
int stop[100] = {0};
int time = 0;
queue<int> Q;
while (X < 100) {
int x;
if (time % 5 == 0... | replace | 52 | 53 | 52 | 53 | TLE | |
p00147 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int seat[17] = {0};
int X = 0;
int stop[100] = {0};
int time = 0;
queue<int> Q;
while (X < 100) {
int x;
if (time % 5 == 0... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int seat[17] = {0};
int X = 0;
int stop[100] = {0};
int time = 0;
queue<int> Q;
while (X < 100) {
int x;
if (time % 5 == 0... | replace | 54 | 55 | 54 | 55 | TLE | |
p00148 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int num = (n - 1) % 39 + 1;
if (num < 10)
cout << "3C0" << num << endl;
else
cout << "3C" << num << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int num = (n - 1) % 39 + 1;
if (num < 10)
cout << "3C0" << num << endl;
else
cout << "3C" << num << endl;
}
return 0;
} | replace | 4 | 10 | 4 | 6 | TLE | |
p00148 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
for (;;) {
cin >> n;
if (n == 0)
break;
int ans = n % 39;
if (n % 39 == 0)
ans = 39;
printf("3C%02d\n", ans);
}
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
for (; cin >> n;) {
int ans = n % 39;
if (n % 39 == 0)
ans = 39;
printf("3C%02d\n", ans);
}
} | replace | 8 | 12 | 8 | 9 | TLE | |
p00148 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
int a, b;
while (scanf("%d", &a) != EOF) {
while (1) {
b = a - 39;
if (a <= 39)
break;
}
printf("3C%02d\n", a);
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b;
while (scanf("%d", &a) != EOF) {
b = a % 39;
if (b == 0)
b = 39;
printf("3C%02d\n", b);
}
return 0;
} | replace | 4 | 10 | 4 | 8 | TLE | |
p00148 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
int n;
while (cin >> n, n) {
printf("3C%02d\n", n % 39 == 0 ? 39 : n % 39);
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int n;
while (scanf("%d", &n) != EOF) {
printf("3C%02d\n", n % 39 == 0 ? 39 : n % 39);
}
return 0;
} | replace | 5 | 6 | 5 | 6 | TLE | |
p00148 | C++ | Time Limit Exceeded | #include <cstdio>
using namespace std;
#define rep2(x, from, to) for (int x = (from); x < (to); ++(x))
#define rep(x, to) rep2(x, 0, to)
int main() {
int n;
while (scanf("%d", &n)) {
printf("3C%02d\n", n % 39 == 0 ? 39 : n % 39);
}
return 0;
} | #include <cstdio>
using namespace std;
#define rep2(x, from, to) for (int x = (from); x < (to); ++(x))
#define rep(x, to) rep2(x, 0, to)
int main() {
int n;
while (scanf("%d", &n) != EOF) {
printf("3C%02d\n", n % 39 == 0 ? 39 : n % 39);
}
return 0;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p00149 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
double lhs, rhs;
int al = 0;
int ar = 0;
int bl = 0;
int br = 0;
int cl = 0;
int cr = 0;
int dl = 0;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
double lhs, rhs;
int al = 0;
int ar = 0;
int bl = 0;
int br = 0;
int cl = 0;
int cr = 0;
int dl = 0;
... | replace | 21 | 22 | 21 | 22 | TLE | |
p00149 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int LA, LB, LC, LD, RA, RB, RC, RD;
LA = LB = LC = LD = RA = RB = RC = RD = 0;
while (1) {
double a, b;
cin >> a >> b;
if (cin.fail())
;
if (a < 0.2)
LD++;
else if (a < 0.6)
LC++;
else if (a < 1.1)
LB++;
els... | #include <iostream>
using namespace std;
int main() {
int LA, LB, LC, LD, RA, RB, RC, RD;
LA = LB = LC = LD = RA = RB = RC = RD = 0;
while (1) {
double a, b;
cin >> a >> b;
if (cin.fail())
break;
if (a < 0.2)
LD++;
else if (a < 0.6)
LC++;
else if (a < 1.1)
LB++;
... | replace | 10 | 11 | 10 | 11 | TLE | |
p00150 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <vector>
constexpr bool divisible(const std::size_t n, const std::size_t m) {
return (0 == n % m);
}
std::vector<std::size_t> prime_table = {2};
bool prime(const std::size_t n) {
const std::size_t found_last_prime = prime_table.ba... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <vector>
constexpr bool divisible(const std::size_t n, const std::size_t m) {
return (0 == n % m);
}
std::vector<std::size_t> prime_table = {2};
bool prime(const std::size_t n) {
const std::size_t found_last_prime = prime_table.ba... | replace | 17 | 18 | 17 | 18 | 0 | |
p00150 | C++ | Runtime Error | #include <stdio.h>
const int MAX_V = 10000; // 100???????????????????f???????¢\????°???¬?????
int prime[MAX_V + 1];
int main() {
int k, i, max, min, n; // 1????????f???????C0????????f????????????????????¢
for (i = 2; i <= MAX_V; i++) {
prime[i] = 1; // 2???????£????f????????????°??????¨
}
for (i = 2; i * i ... | #include <stdio.h>
const int MAX_V = 10000; // 100???????????????????f???????¢\????°???¬?????
int prime[MAX_V + 1];
int main() {
int k, i, max, min, n; // 1????????f???????C0????????f????????????????????¢
for (i = 2; i <= MAX_V; i++) {
prime[i] = 1; // 2???????£????f????????????°??????¨
}
for (i = 2; i * i ... | replace | 21 | 22 | 21 | 22 | 0 | |
p00150 | C++ | Time Limit Exceeded | #include "stdio.h"
const int MAX_V = 10000; // 1????????§????´???°??¨?????????
int prime[MAX_V + 1]; // 1????´???°,0????´???°??§?????????
int main() {
int i, k, n;
for (i = 2; i <= MAX_V; i++) {
prime[i] = 1; // 2??\???????´???°??¨??????
}
for (i = 2; i * i <= MAX_V; i++) {
if (prime[i]) {
for ... | #include "stdio.h"
const int MAX_V = 10000; // 1????????§????´???°??¨?????????
int prime[MAX_V + 1]; // 1????´???°,0????´???°??§?????????
int main() {
int i, k, n;
for (i = 2; i <= MAX_V; i++) {
prime[i] = 1; // 2??\???????´???°??¨??????
}
for (i = 2; i * i <= MAX_V; i++) {
if (prime[i]) {
for ... | replace | 15 | 16 | 15 | 20 | TLE | |
p00150 | C++ | Time Limit Exceeded | #include "stdio.h"
// #include "time.h"
//?????§??????????´???°?????????????????????
// 5<= n <= 10000
// p1=?°????????´???°p2=??§???????´???°
int isprime(int n) {
int i;
for (i = 2; i < n;
i++) { //??????????§????????????¨??§??¶??°??§??????????´???°??¨??????
if (n % i == 0)
return 0; //?????????... | #include "stdio.h"
// #include "time.h"
//?????§??????????´???°?????????????????????
// 5<= n <= 10000
// p1=?°????????´???°p2=??§???????´???°
int isprime(int n) {
int i;
for (i = 2; i * i <= n;
i++) { //??????????§????????????¨??§??¶??°??§??????????´???°??¨??????
if (n % i == 0)
return 0; //????... | replace | 8 | 9 | 8 | 9 | TLE | |
p00150 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
bool isPrime(int n) {
for (int i = 2; i < n; i++) {
if (n % i == 0)
return false;
}
return true;
}
int main(void) {
int n;
while (scanf("%d", &n), n) {
for (int i = n; 5 <= i; i--) {
// cout... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
bool isPrime(int n) {
if (n % 2 == 0)
return false;
for (int i = 3; i < n; i += 2) {
if (n % i == 0)
return false;
}
return true;
}
int main(void) {
int n;
while (scanf("%d", &n), n) {
for (... | replace | 7 | 8 | 7 | 10 | TLE | |
p00150 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int lis[10001];
int main() {
for (int i = 2; i <= 10000; i++) {
int flg = 1;
for (int j = 2; j <= 10000; j++) {
if (i % j == 0 && i != j)
flg = 0;
}
lis[i] = flg;
}
while (1) {
int a;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int lis[10001];
int main() {
for (int i = 2; i <= 10000; i++) {
int flg = 1;
for (int j = 2; j <= 10000; j++) {
if (i % j == 0 && i != j)
flg = 0;
}
lis[i] = flg;
}
while (1) {
int a;... | insert | 18 | 18 | 18 | 20 | TLE | |
p00150 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <time.h>
int isprime(int n) {
for (int i = 2; i < n; i++) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
int main() {
int i, p, q, n;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = n; i >= 2; i--) {
if (isprime(i) && isprime(i ... | #include <stdio.h>
#include <time.h>
int isprime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
int main() {
int i, p, q, n;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = n; i >= 2; i--) {
if (isprime(i) && ispri... | replace | 3 | 4 | 3 | 4 | TLE | |
p00151 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1}, dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int ans;
int n;
char ma[100][100];
void cheak(int px, int dx, int py, int dy) {
int cnt = 1;
while (1) {
px += dx;
py += dy;
if (!(0 <= px && px < n && 0 <= py && p... | #include <algorithm>
#include <iostream>
using namespace std;
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1}, dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int ans;
int n;
char ma[300][300];
void cheak(int px, int dx, int py, int dy) {
int cnt = 1;
while (1) {
px += dx;
py += dy;
if (!(0 <= px && px < n && 0 <= py && p... | replace | 6 | 7 | 6 | 7 | TLE | |
p00151 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | replace | 68 | 69 | 68 | 69 | 0 | |
p00151 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
string field[256];
void rotate(int n) {
string tmp[256];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
tmp[i][j] = field[n - j - 1][i];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
field[i][j] = t... | #include <iostream>
#include <string>
using namespace std;
string field[256];
void rotate(int n) {
string tmp[256];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
tmp[i] += field[n - j - 1][i];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
field[i][j] = tmp... | replace | 10 | 11 | 10 | 11 | 0 | |
p00151 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
int main() {
int n;
while (scanf("%d", &n), n) {
int m = 0, v[4][2] = {{0, -1}, {-1, 0}, {1, -1}, {-1, -1}},
map[257][257] = {{0}};
for (int y = 1; y <= n; y++)
for (int x = 1; x <= n; x++)
scanf("%1d", &map[x][y]);
for (int i = 0; i < 4; i--... | #include <algorithm>
#include <cstdio>
int main() {
int n;
while (scanf("%d", &n), n) {
int m = 0, v[4][2] = {{0, -1}, {-1, 0}, {1, -1}, {-1, -1}},
map[257][257] = {{0}};
for (int y = 1; y <= n; y++)
for (int x = 1; x <= n; x++)
scanf("%1d", &map[x][y]);
for (int i = 0; i < 4; i++... | replace | 11 | 12 | 11 | 12 | TLE | |
p00151 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int i, j, k, n, max, cnt, x, y, dx[] = {1, 1, 0, -1}, dy[] = {0, 1, 1, 1};
char xy[225][226];
while (1) {
max = 0;
cin >> n;
if (n == 0)
break;
for (i = 0; i < n; i++)
cin >> xy[i];
for (i = 0; i < n; i++) ... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int i, j, k, n, max, cnt, x, y, dx[] = {1, 1, 0, -1}, dy[] = {0, 1, 1, 1};
char xy[255][256];
while (1) {
max = 0;
cin >> n;
if (n == 0)
break;
for (i = 0; i < n; i++)
cin >> xy[i];
for (i = 0; i < n; i++) ... | replace | 5 | 6 | 5 | 6 | 0 | |
p00154 | C++ | Memory Limit Exceeded | #include <cstring>
#include <iostream>
using namespace std;
#define MAX_N 150000
#define MAX_CARD 120
long long dp[MAX_CARD][MAX_N];
long long card[MAX_CARD][2];
int n, m, a, b, cnt, sum;
int main() {
while (true) {
memset(dp, 0, sizeof(dp));
memset(card, 0, sizeof(card));
// cin.
cin >> n;
if ... | #include <cstring>
#include <iostream>
using namespace std;
#define MAX_N 82000
#define MAX_CARD 100
long long dp[MAX_CARD][MAX_N];
long long card[MAX_CARD][2];
int n, m, a, b, cnt, sum;
int main() {
while (true) {
memset(dp, 0, sizeof(dp));
memset(card, 0, sizeof(card));
// cin.
cin >> n;
if (... | replace | 4 | 6 | 4 | 6 | MLE | |
p00154 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[8][1000];
int main() {
int b;
while (cin >> b, b) {
memset(a, 0, sizeof(a));
for (int c = 0; c < b; c++) {
a[c][0] = 1;
int d, e;
cin >> d >> e;
for (int f = 0; f <= e; f++) {
for (int g = max(f * d, 1); g <= 1000; g++) {
... | #include <bits/stdc++.h>
using namespace std;
int a[8][1001];
int main() {
int b;
while (cin >> b, b) {
memset(a, 0, sizeof(a));
for (int c = 0; c < b; c++) {
a[c][0] = 1;
int d, e;
cin >> d >> e;
for (int f = 0; f <= e; f++) {
for (int g = max(f * d, 1); g <= 1000; g++) {
... | replace | 3 | 4 | 3 | 4 | 0 | |
p00154 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | replace | 48 | 49 | 48 | 49 | -6 | corrupted size vs. prev_size
|
p00155 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
double g[n][n];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
g[i][j] = 100000000;
int b[n], x[n], y[n];
for (int i = 0; i < n; i++) {
int b, _x, _y;
cin >> b >> _x >> _y;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
double g[n][n];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
g[i][j] = 100000000;
int b[n], x[n], y[n];
for (int i = 0; i < n; i++) {
int b, _x, _y;
cin >> b >> _x >> _y;
... | replace | 14 | 15 | 14 | 15 | TLE | |
p00155 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const double EPS = 1e-6;
struct Building {
int x, y;
Building() {
x = -1;
y = -1;
}
};
struct Edge {
int to;
double cost;
Edge() {}
Edge(const int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const double EPS = 1e-6;
struct Building {
int x, y;
Building() {
x = -1;
y = -1;
}
};
struct Edge {
int to;
double cost;
Edge() {}
Edge(const int... | replace | 107 | 108 | 107 | 108 | TLE | |
p00155 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
const int MAX = 1000;
struct int2 {
int x;
int y;
};
class Node {
public:
int id;
double cost;
int parent;
bool visited;
vector<int> edge_to;
vector<double> edge_cost;
Node() {}
Node(int id) : id(id), ... | #include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
const int MAX = 1000;
struct int2 {
int x;
int y;
};
class Node {
public:
int id;
double cost;
int parent;
bool visited;
vector<int> edge_to;
vector<double> edge_cost;
Node() {}
Node(int id) : id(id), ... | insert | 97 | 97 | 97 | 99 | TLE | |
p00155 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#def... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#def... | replace | 135 | 136 | 135 | 136 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p00156 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
#define MAX_N 1000
int X[MAX_N][MAX_N], dist[MAX_N][MAX_N], W, H, gx, gy;
char c;
int main() {
while (true) {
for (int i = 0; i < MAX_N; i++) {
for (int j = 0; j < MAX_N; j++) {
X[i][j] = 1000000000;
dist[i][j] = ... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
#define MAX_N 1000
int X[MAX_N][MAX_N], dist[MAX_N][MAX_N], W, H, gx, gy;
char c;
int main() {
while (true) {
for (int i = 0; i < MAX_N; i++) {
for (int j = 0; j < MAX_N; j++) {
X[i][j] = 1000000000;
dist[i][j] = ... | insert | 17 | 17 | 17 | 20 | TLE | |
p00157 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> MAT;
#define h first
#define r second
#define rep(i, n) for (int i = 0; i < n; i++)
int dp[1000][1000];
MAT info[200];
int n, m;
int dfs(int a, int b) {
if (~dp[a][b])
return dp[a][b];
int hoge = 0;
rep(i,... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> MAT;
#define h first
#define r second
#define rep(i, n) for (int i = 0; i < n; i++)
int dp[1000][1000];
MAT info[200];
int n, m;
int dfs(int a, int b) {
if (~dp[a][b])
return dp[a][b];
int hoge = 0;
rep(i,... | replace | 22 | 23 | 22 | 23 | TLE | |
p00157 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair... | replace | 41 | 42 | 41 | 42 | 0 | |
p00157 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n[2], c[2];
while (cin >> n[0], n[0]) {
int h[2][110], r[2][110], mx[2][110];
rep(q, 2) {
rep(i, n[q]) mx[q][i] = 0, cin >> h[q][i] >> r[q][i];
if (!q)
cin >> n[1... | #include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n[2], c[2];
while (cin >> n[0], n[0]) {
int h[2][110], r[2][110], mx[2][110];
rep(q, 2) {
rep(i, n[q]) mx[q][i] = 0, cin >> h[q][i] >> r[q][i];
if (!q)
cin >> n[1... | insert | 20 | 20 | 20 | 24 | 0 | |
p00157 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m, h, r;
while (cin >> n, n) {
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
cin >> h >> r;
v.push_back(make_pair(h, r));
}
cin >> m;
for (int i = 0; i < m... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m, h, r;
while (cin >> n, n) {
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
cin >> h >> r;
v.push_back(make_pair(h, r));
}
cin >> m;
for (int i = 0; i < m... | replace | 20 | 21 | 20 | 21 | 0 | |
p00157 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespac... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespac... | replace | 36 | 37 | 36 | 37 | 0 | |
p00157 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MAX = 101;
typedef pair<int, int> P;
int main() {
int n, m, h, r;
while (cin >> n, n) {
vector<P> v;
int dp[MAX] = {0};
for (int i = 0; i < n; i++) {
cin >> h >> r;
v.push_back(P(h, r));
}
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MAX = 1001;
typedef pair<int, int> P;
int main() {
int n, m, h, r;
while (cin >> n, n) {
vector<P> v;
int dp[MAX] = {0};
for (int i = 0; i < n; i++) {
cin >> h >> r;
v.push_back(P(h, r));
}
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00158 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int cnt = 0;
while (n != 0) {
if (n % 2 == 0)
n /= 2;
else
n = n * 3 + 1;
cnt++;
}
cout << cnt << endl;
}
return (0);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int cnt = 0;
while (n != 1) {
if (n % 2 == 0)
n /= 2;
else
n = n * 3 + 1;
cnt++;
}
cout << cnt << endl;
}
return (0);
} | replace | 7 | 8 | 7 | 8 | TLE | |
p00158 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <limits>
#include <vector>
using namespace std;
int main(void) {
for (;;) {
int cnt = 0, buf;
cin >> buf;
if (!buf)
return 0;
for (; buf != 1;) {
buf = buf % 2 ? buf / 2 : buf * 3 + 1;
cnt++;
}
cout << cnt << endl;
}
} | #include <algorithm>
#include <iostream>
#include <limits>
#include <vector>
using namespace std;
int main(void) {
for (;;) {
int cnt = 0, buf;
cin >> buf;
if (!buf)
return 0;
for (; buf != 1;) {
buf = buf % 2 ? buf * 3 + 1 : buf / 2;
cnt++;
}
cout << cnt << endl;
}
} | replace | 12 | 13 | 12 | 13 | TLE | |
p00158 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// template {{{
/* vim: set foldmethod=marker: */
// constant
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
const double PI = acos(-1);
#define EPS 1e-14
// typedef
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, ... | #include <bits/stdc++.h>
using namespace std;
// template {{{
/* vim: set foldmethod=marker: */
// constant
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
const double PI = acos(-1);
#define EPS 1e-14
// typedef
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, ... | replace | 72 | 73 | 72 | 73 | TLE | |
p00158 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, l, n) for (int i = l; i < n; i++)
#define rer(i, l, n) for (int i = l; i <= n; i++)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pii;... | #include <bits/stdc++.h>
#define rep(i, l, n) for (int i = l; i < n; i++)
#define rer(i, l, n) for (int i = l; i <= n; i++)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pii;... | replace | 14 | 15 | 14 | 18 | TLE | |
p00159 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | replace | 44 | 45 | 44 | 45 | 0 | |
p00159 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
#define ABS(X) ((X) < 0 ? -(X) : (X))
typedef pair<double, int> Subj;
int main(void) {
int n;
while (cin >> n) {
vector<Subj> v;
for (int i = 0; i < n; i++) {
int id;
double h, w, bmi;
cin... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
#define ABS(X) ((X) < 0 ? -(X) : (X))
typedef pair<double, int> Subj;
int main(void) {
int n;
while (cin >> n) {
if (n == 0)
break;
vector<Subj> v;
for (int i = 0; i < n; i++) {
int id;
... | insert | 13 | 13 | 13 | 15 | -11 | |
p00160 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
int x, y, z, w, n, i;
int sum, l;
while (scanf("%d", &n) != 0) {
sum = 0;
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &x, &y, &z, &w);
l = x + y + z;
if (l <= 60 && w <= 2)
sum += 600;
else if (l <= 80 && w <= 5)
sum += 800;
... | #include <stdio.h>
int main(void) {
int x, y, z, w, n, i;
int sum, l;
while (0 == 0) {
scanf("%d", &n);
if (n == 0)
break;
sum = 0;
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &x, &y, &z, &w);
l = x + y + z;
if (l <= 60 && w <= 2)
sum += 600;
else if (l <... | replace | 6 | 7 | 6 | 10 | TLE | |
p00161 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
class Score {
public:
int num;
int time;
Score() {
this->num = 0;
this->time = 0;
}
Score(int num, int time) {
this->num = num;
this->time = time;
}
};
int main(int argc, const char *argv[]) {
while (true) {
int n;
cin >> n;
Score ... | #include <iostream>
using namespace std;
class Score {
public:
int num;
int time;
Score() {
this->num = 0;
this->time = 0;
}
Score(int num, int time) {
this->num = num;
this->time = time;
}
};
int main(int argc, const char *argv[]) {
while (true) {
int n;
cin >> n;
if (n ... | insert | 24 | 24 | 24 | 28 | TLE | |
p00161 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
struct hoge {
int num, timem, times;
};
int main() {
int n, c, m1, s1, m2, s2, m3, s3, m4, s4;
hoge set[100];
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> c >> m1 >> s1 >> m2 >> s2 >> m3 >> s... | #include <algorithm>
#include <iostream>
using namespace std;
struct hoge {
int num, timem, times;
};
int main() {
int n, c, m1, s1, m2, s2, m3, s3, m4, s4;
hoge set[1000000];
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> c >> m1 >> s1 >> m2 >> s2 >> m3 ... | replace | 10 | 11 | 10 | 11 | 0 | |
p00162 | C++ | Runtime Error | #include <cmath>
#include <iostream>
using namespace std;
const int MAX_NUM = 1000;
int main() {
bool list[MAX_NUM + 1] = {0};
for (int two = 0; two <= 20; two++) {
for (int three = 0; three <= 13; three++) {
for (int five = 0; five <= 9; five++) {
int num = pow(2, two) * pow(3, three) * pow(5,... | #include <cmath>
#include <iostream>
using namespace std;
const int MAX_NUM = 1000000;
int main() {
bool list[MAX_NUM + 1] = {0};
for (int two = 0; two <= 20; two++) {
for (int three = 0; three <= 13; three++) {
for (int five = 0; five <= 9; five++) {
int num = pow(2, two) * pow(3, three) * pow... | replace | 4 | 5 | 4 | 5 | 0 | |
p00162 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
const int HAMMING_MAX = 100001;
int main() {
bool hamming[HAMMING_MAX];
memset(hamming, 0, sizeof(hamming));
for (int x = 1; x < HAMMING_MAX; x *= 2) {
for (int y = 1; x * y < HAMMING_MAX; y *= 3) {
for (int z = 1; x * y * z < HAMMING_MAX; z... | #include <cstring>
#include <iostream>
using namespace std;
const int HAMMING_MAX = 1000001;
int main() {
bool hamming[HAMMING_MAX];
memset(hamming, 0, sizeof(hamming));
for (int x = 1; x < HAMMING_MAX; x *= 2) {
for (int y = 1; x * y < HAMMING_MAX; y *= 3) {
for (int z = 1; x * y * z < HAMMING_MAX; ... | replace | 4 | 5 | 4 | 5 | 0 | |
p00162 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
while (cin >> m >> n, m || n) {
int count = 0;
for (int i = m; i <= n; ++i) {
int result = i;
while (1) {
if (result % 2 == 0)
result = result / 2;
else if (result % 3 == 0)
result =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
while (1) {
cin >> m;
if (m == 0)
break;
cin >> n;
int count = 0;
for (int i = m; i <= n; ++i) {
int result = i;
while (1) {
if (result % 2 == 0)
result = result / 2;
else... | replace | 8 | 9 | 8 | 16 | TLE | |
p00162 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int m;
vector<int> count;
for (int i = 0; i < 6; i++)
count.push_back(i);
for (int i = 6; i < 10000001; i++) {
if ((i % 2 == 0 && count[i / 2] - count[(i / 2) - 1] != 0) ||
(i % 3 == 0 && count[i / 3] ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int m;
vector<unsigned short> count;
for (int i = 0; i < 6; i++)
count.push_back(i);
for (int i = 6; i < 10000001; i++) {
if ((i % 2 == 0 && count[i / 2] - count[(i / 2) - 1] != 0) ||
(i % 3 == 0 && co... | replace | 8 | 9 | 8 | 9 | MLE | |
p00162 | C++ | Runtime Error | #include <cmath>
#include <iostream>
using namespace std;
int x[2000000];
long long p;
int a, b, sum;
int main() {
for (int i = 0; i < 20; i++) {
for (int j = 0; j < 13; j++) {
for (int k = 0; k < 9; k++) {
p = (int)pow(2, i) * (int)pow(3, j) * (int)pow(5, k);
if (p < 2000000) {
... | #include <cmath>
#include <iostream>
using namespace std;
int x[2000000];
long long p;
int a, b, sum;
int main() {
for (int i = 0; i < 20; i++) {
for (int j = 0; j < 13; j++) {
for (int k = 0; k < 9; k++) {
p = (long long)pow(2, i) * (long long)pow(3, j) * (long long)pow(5, k);
if (p < 200... | replace | 12 | 13 | 12 | 13 | -11 | |
p00162 | C++ | Runtime Error | #include <iostream>
#define D 100
using namespace std;
bool flg[D];
int ans[D];
int main() {
int m, n;
flg[1] = true;
for (int i = 0; i <= D; i++) {
if (flg[i]) {
if (2 * i <= D)
flg[2 * i] = true;
if (3 * i <= D)
flg[3 * i] = true;
if (5 * i <= D)
flg[5 * i] = true;... | #include <iostream>
#define D 1000000
using namespace std;
bool flg[D];
int ans[D];
int main() {
int m, n;
flg[1] = true;
for (int i = 0; i <= D; i++) {
if (flg[i]) {
if (2 * i <= D)
flg[2 * i] = true;
if (3 * i <= D)
flg[3 * i] = true;
if (5 * i <= D)
flg[5 * i] = t... | replace | 1 | 2 | 1 | 2 | 0 | |
p00162 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(n) rep(i, n)
#define all(n) n.begin(), n.end()
const int MAXN = 100 * 1000 + 10;
bool ham[MAXN];
int main() {
ham[1] = 1;
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(n) rep(i, n)
#define all(n) n.begin(), n.end()
const int MAXN = 1000000 + 10;
bool ham[MAXN];
int main() {
ham[1] = 1;
REP... | replace | 12 | 13 | 12 | 13 | 0 | |
p00162 | C++ | Runtime Error | #include <iostream>
using namespace std;
int dp[1000001] = {0};
int main() {
int k, m, n;
dp[1] = 1;
for (int i = 1; i <= 500000; i++) {
dp[i * 2] |= 1;
dp[i * 3] |= 1;
dp[i * 5] |= 1;
}
for (int i = 1; i <= 1000000; i++) {
dp[i] += dp[i - 1];
}
while (cin >> m && m) {
cin >> n;
c... | #include <iostream>
using namespace std;
int dp[1000001] = {0};
int main() {
int a = 1, n, m;
for (int i = 0; a <= 1000000; i++) {
int b = 1;
for (int j = 0; a * b <= 1000000; j++) {
int c = 1;
for (int k = 0; a * b * c <= 1000000; k++) {
dp[a * b * c] = true;
c *= 5;
}
... | replace | 5 | 11 | 5 | 17 | -11 | |
p00162 | C++ | Runtime Error | #include <iostream>
using namespace std;
/*
bool sw[1000001];
int i;
void sws(int k){
if(k==1){
sw[i]=true;
return;
}
if(k%2==0) sws(k/2);
else if(k%3==0) sws(k/3);
else if(k%5==0) sws(k/5);
return;
}
*/
// korenisuru
int dp[1000001];
int ... | #include <iostream>
using namespace std;
/*
bool sw[1000001];
int i;
void sws(int k){
if(k==1){
sw[i]=true;
return;
}
if(k%2==0) sws(k/2);
else if(k%3==0) sws(k/3);
else if(k%5==0) sws(k/5);
return;
}
*/
// korenisuru
int dp[1000001];
int ... | replace | 37 | 38 | 37 | 38 | -11 | |
p00163 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
vector<vector<int>> money{
{0, 300, 500, 600, 700, 1350, 1650},
{0, 0, 350, 450, 600, 1150, 1500},
{0, 0, 0, 250, 400, 1000, 1350},
... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
vector<vector<int>> money{
{0, 300, 500, 600, 700, 1350, 1650},
{0, 0, 350, 450, 600, 1150, 1500},
{0, 0, 0, 250, 400, 1000, 1350},
... | insert | 24 | 24 | 24 | 26 | -11 | |
p00164 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, a[4], s, t, p;
while (1) {
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
s = 32;
p = 0;
while (s > 0) {
t = (s - 1) % 5;
s -= t;
cout << s << endl;
s -... | #include <iostream>
using namespace std;
int main() {
int n, a[26], s, t, p;
while (1) {
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
s = 32;
p = 0;
while (s > 0) {
t = (s - 1) % 5;
s -= t;
cout << s << endl;
s ... | replace | 5 | 6 | 5 | 6 | TLE | |
p00164 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
int m, n[100];
while (true) {
cin >> m;
if (m == 0)
break;
for (int i = 0; i < m; i++)
cin >> n[i];
int ans = 31;
int count = 0;
cout << "31" << endl;
while (true) {
if (ans < n[count]) {
co... | #include <iostream>
#include <string>
using namespace std;
int main() {
int m, n[100];
while (true) {
cin >> m;
if (m == 0)
break;
for (int i = 0; i < m; i++)
cin >> n[i];
int ans = 31;
int count = 0;
cout << "31" << endl;
while (true) {
if (ans <= n[count]) {
c... | replace | 15 | 16 | 15 | 16 | TLE | |
p00164 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
void loop(int remain, int *jiro_rule, int rule_size, int cur) {
remain -= (remain - 1) % 5;
cout << remain << endl;
if (remain == 0)
return;
if (remain < *(jiro_rule + cur)) {
cout << 0 << endl;
return;
}
remain -= *(jiro_rule + cur);
cout << remain <... | #include <iostream>
using namespace std;
void loop(int remain, int *jiro_rule, int rule_size, int cur) {
remain -= (remain - 1) % 5;
cout << remain << endl;
if (remain == 0)
return;
if (remain <= *(jiro_rule + cur)) {
cout << 0 << endl;
return;
}
remain -= *(jiro_rule + cur);
cout << remain ... | replace | 9 | 10 | 9 | 10 | TLE | |
p00164 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int k;
while (cin >> k) {
int n = 32, a[30];
for (int i = 0; i < k; i++)
cin >> a[i];
for (int i = 0; n; i++) {
int p;
p = (n - 1) % 5;
n -= p;
cout << n << endl;
p = a[i % k];
n -= p;
if (n < 0)
... | #include <iostream>
using namespace std;
int main() {
int k;
while (cin >> k, k) {
int n = 32, a[30];
for (int i = 0; i < k; i++)
cin >> a[i];
for (int i = 0; n; i++) {
int p;
p = (n - 1) % 5;
n -= p;
cout << n << endl;
p = a[i % k];
n -= p;
if (n < 0)
... | replace | 4 | 5 | 4 | 5 | -8 | |
p00164 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
int n[5] = {};
int N;
int r = 0;
while (1) {
scanf("%d", &N);
if (N == 0)
break;
for (int i = 0; i < N; i++)
scanf("%d", &n[i]);
int P = 32;
int j = 0;
while (1) {
if (P <= 0)
break;
P -= (P - 1) % 5;
printf("%d\n"... | #include <stdio.h>
int main() {
int n[30] = {};
int N;
int r = 0;
while (1) {
scanf("%d", &N);
if (N == 0)
break;
for (int i = 0; i < N; i++)
scanf("%d", &n[i]);
int P = 32;
int j = 0;
while (1) {
if (P <= 0)
break;
P -= (P - 1) % 5;
printf("%d\n... | replace | 4 | 5 | 4 | 5 | TLE | |
p00164 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, v[26];
int w[7] = {31, 26, 21, 16, 11, 6, 1};
while (cin >> n) {
for (int i = 0; i < n; i++) {
cin >> v[i];
}
cout << 31 << endl;
for (int i = 0; i < 6; i++) {
cout << w[i] - v[i % n] << endl;
cout << w[i + 1] << en... | #include <iostream>
using namespace std;
int main() {
int n, v[26];
int w[7] = {31, 26, 21, 16, 11, 6, 1};
while (cin >> n) {
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
cout << 31 << endl;
for (int i = 0; i < 6; i++) {
cout << w[i] - v[i % n] << endl;... | insert | 9 | 9 | 9 | 11 | -8 | |
p00164 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int len;
while (scanf("%d", &len), len) {
int a[4];
for (int i = 0; i < len; i++) {
scanf("%d", &a[i]);
}
int n = 32;
for (int i = 0, j = 0;; i++) {
if (i % 2 == 0) {
n -= (n - 1) % 5;
} else {
... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int len;
while (scanf("%d", &len), len) {
int a[25];
for (int i = 0; i < len; i++) {
scanf("%d", &a[i]);
}
int n = 32;
for (int i = 0, j = 0;; i++) {
if (i % 2 == 0) {
n -= (n - 1) % 5;
} else {
... | replace | 8 | 9 | 8 | 9 | TLE | |
p00165 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
const int MAX = 999984;
bool isPrime[MAX];
void createIsPrime() {
fill_n(isPrime, MAX, true);
isPrime[0] = false;
isPrime[1] = false;
for (int i = 4; i < MAX; i += 2) {
isPrime[i] = false;
}
for (int i = 3; i * i <= MAX; i += 2) {
if (i... | #include <algorithm>
#include <iostream>
using namespace std;
const int MAX = 999984;
bool isPrime[MAX];
void createIsPrime() {
fill_n(isPrime, MAX, true);
isPrime[0] = false;
isPrime[1] = false;
for (int i = 4; i < MAX; i += 2) {
isPrime[i] = false;
}
for (int i = 3; i * i <= MAX; i += 2) {
if (i... | replace | 35 | 37 | 35 | 43 | TLE | |
p00166 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP((i), 0, (n))
#define RREP(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define rrep(i, n) RREP(i, n, 0)
#define each(it, X) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP((i), 0, (n))
#define RREP(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define rrep(i, n) RREP(i, n, 0)
#define each(it, X) ... | replace | 41 | 42 | 41 | 42 | TLE | |
p00167 | C++ | Time Limit Exceeded | #include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int N = 100;
int bit[N + 10];
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= N) {
bit[i] += x;
i += i & -i;
}
}
vec... | #include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int N = 100;
int bit[N + 10];
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= N) {
bit[i] += x;
i += i & -i;
}
}
vec... | replace | 28 | 29 | 28 | 29 | TLE | |
p00167 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define MAX 10000010
int main() {
int n;
int list[MAX];
while (cin >> n, n) {
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> list[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i - 1; j++) ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define MAX 110
int main() {
int n;
int list[MAX];
while (cin >> n, n) {
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> list[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i - 1; j++) {
... | replace | 4 | 5 | 4 | 5 | -11 | |
p00167 | C++ | Time Limit Exceeded | #include <stdio.h>
int n[1000001] = {};
int main() {
int N;
int c = 0;
while (1) {
scanf("%d", &N);
int c = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &n[i]);
}
for (int i = 0; i < N; i++)
for (int j = N - 1; j > i; j--) {
if (n[j] < n[j - 1]) {
int T = n[j... | #include <stdio.h>
int n[1000001] = {};
int main() {
int N;
int c = 0;
while (1) {
scanf("%d", &N);
if (N == 0)
break;
int c = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &n[i]);
}
for (int i = 0; i < N; i++)
for (int j = N - 1; j > i; j--) {
if (n[j] < n[j -... | replace | 9 | 10 | 9 | 11 | TLE | |
p00168 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
while (1) {
int dp[31] = {1, 1, 2, 4};
int n;
cin >> n;
for (int i = 4; i <= n; ++i) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
cout << ((dp[n] - 1) / 3650) + 1 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
while (1) {
int dp[31] = {1, 1, 2, 4};
int n;
cin >> n;
if (!n)
return 0;
for (int i = 4; i <= n; ++i) {
dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
}
cout << ((dp[n] - 1) / 3650) + 1 << endl;
}
} | insert | 7 | 7 | 7 | 9 | TLE | |
p00168 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int n;
int memo[31];
int dfs(int num) {
int sum = 0;
if (memo[num] != -1) {
return memo[num];
}
if (num == n) {
return 1;
}
if (num < n)
sum += dfs(num + 1);
if (num < n)
sum += dfs(num + 2);
if (num < n)
sum += dfs(num + 3);
memo[... | #include <iostream>
using namespace std;
int n;
int memo[366];
int dfs(int num) {
int sum = 0;
if (memo[num] != -1) {
return memo[num];
}
if (num == n) {
return 1;
}
if (num < n)
sum += dfs(num + 1);
if (num < n)
sum += dfs(num + 2);
if (num < n)
sum += dfs(num + 3);
memo... | replace | 5 | 6 | 5 | 6 | TLE | |
p00169 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
while (getline(cin, s), s != "0") {
stringstream ss(s);
int x = 0, i, ans, k;
int si = 0;
vector<int> v;
v.clear();
v.push_back(0);
while (ss >> x) {
si = v.size();
vector<int> n;
for (i = 0; i < si; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
while (getline(cin, s), s != "0") {
stringstream ss(s);
int x = 0, i, ans, k;
int si = 0;
vector<int> v;
v.clear();
v.push_back(0);
while (ss >> x) {
si = v.size();
vector<int> n;
for (i = 0; i < si; ... | insert | 30 | 30 | 30 | 34 | 0 | |
p00169 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int rec(int sum, int one) {
if (one == 0 && sum > 21)
return -1;
else if (one == 0 && sum <= 21)
return sum;
int res = rec(sum + 1, one - 1);
res = max(res, rec(sum + 11, one - 1));
return res;
}
bool solve(string &s) {
int sum = 0, one = 0;
int index ... | #include <iostream>
using namespace std;
int rec(int sum, int one) {
if (sum > 21)
return -1;
else if (one == 0 && sum > 21)
return -1;
else if (one == 0 && sum <= 21)
return sum;
int res = rec(sum + 1, one - 1);
res = max(res, rec(sum + 11, one - 1));
return res;
}
bool solve(string &s) {
... | replace | 5 | 6 | 5 | 8 | TLE | |
p00169 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int rec(int sum, const vector<int> &v, int k) {
if (k == v.size())
return sum <= 21 ? sum : 0;
if (v[k] == 1)
return max(rec(sum + 1, v, k + 1), rec(sum + 11, v, k + 1));
else
return rec(sum + v[k], v, k + 1);
}
int main() {
string s;
while (getline(... | #include <bits/stdc++.h>
using namespace std;
int rec(int sum, const vector<int> &v, int k) {
if (v.size() > 21)
return 0;
if (k == v.size())
return sum <= 21 ? sum : 0;
if (v[k] == 1)
return max(rec(sum + 1, v, k + 1), rec(sum + 11, v, k + 1));
else
return rec(sum + v[k], v, k + 1);
}
int mai... | insert | 4 | 4 | 4 | 6 | TLE | |
p00169 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
while (getline(cin,... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
while (getline(cin,... | insert | 30 | 30 | 30 | 32 | MLE | |
p00169 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int power(int n) {
int num = 1;
for (int i = 0; i < n; i++)
num *= 10;
return num;
}
int serch(int sum, int n) {
if (sum > 21)
return 0;
else if (n == 0)
return sum;
else
return max(serch(sum + 11, n - 1), serch(sum + 1, n - 1));
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
int power(int n) {
int num = 1;
for (int i = 0; i < n; i++)
num *= 10;
return num;
}
int serch(int sum, int n) {
if (sum > 21)
return 0;
else if (n == 0)
return sum;
else
return max(serch(sum + 11, n - 1), serch(sum + 1, n - 1));
}
int main() {
... | replace | 21 | 22 | 21 | 22 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.