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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p00042 | C++ | Memory Limit Exceeded | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int dk[10001][1001];
int main() {
int i, j, takara[1001][2], w, n, c, maxv;
c = 0;
while (0 <= scanf("%d", &w)) {
if (w == 0)
break;
scanf("%d", &n);
++c;
for (i = 1; i <= n; i++) {
scanf("%d,%d", &takara[i... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
short dk[10001][1001];
int main() {
int i, j, takara[1001][2], w, n, c, maxv;
c = 0;
while (0 <= scanf("%d", &w)) {
if (w == 0)
break;
scanf("%d", &n);
++c;
for (i = 1; i <= n; i++) {
scanf("%d,%d", &takara... | replace | 5 | 6 | 5 | 6 | MLE | |
p00042 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int MOD = 1000000007;
int main() {
int w, n;
int ct = 1;
while (cin >> w >> n, w) {
int va[n], we[n];
for (int i = 0; i < n; i++)
scanf("%d, %d", &va[i], &we[i]);
int dp[1010][1010];
for (int i = 0; i < 1010; i++)
for (int j = 0; j < 1010; ... | #include <bits/stdc++.h>
using namespace std;
int MOD = 1000000007;
int main() {
int w, n;
int ct = 1;
while (cin >> w >> n, w) {
int va[n], we[n];
for (int i = 0; i < n; i++)
scanf("%d, %d", &va[i], &we[i]);
int dp[1010][1010];
for (int i = 0; i < 1010; i++)
for (int j = 0; j < 1010; ... | replace | 14 | 15 | 14 | 15 | 0 | |
p00042 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(co) co.begin(), co.end()
#defi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(co) co.begin(), co.end()
#defi... | replace | 82 | 83 | 82 | 83 | TLE | |
p00042 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(5)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(5)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<short, short> P;... | replace | 9 | 10 | 9 | 10 | MLE | |
p00042 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string.h>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define max_n 1000
#define max_w 1000
using namespace std;
int N, W;
long long dp[max_n][max_w];
long long dw[max_n][max_w];
int w[max_n], v[max_n];
long long rec(int i, int j) {... | #include <cstdio>
#include <iostream>
#include <string.h>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define max_n 1000
#define max_w 1000
using namespace std;
int N, W;
long long dp[max_n + 1][max_w + 1];
long long dw[max_n + 1][max_w + 1];
int w[max_n], v[max_n];
long long rec... | replace | 10 | 12 | 10 | 12 | 0 | |
p00042 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); ... | replace | 32 | 33 | 32 | 33 | TLE | |
p00042 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#define int long long
using namespace std;
int dp[1001], N, v[100], w[100], W;
signed main() {
for (int l = 1;; l++) {
fill(dp, dp + 1001, 0);
/*fill(v,v+100,0);
fill(w,w+100,0);*/
cin >> W;
if (W == 0)
break;
cin >> N;
for (... | #include <algorithm>
#include <cstdio>
#include <iostream>
#define int long long
using namespace std;
int dp[1001], N, v[1001], w[1001], W;
signed main() {
for (int l = 1;; l++) {
fill(dp, dp + 1001, 0);
/*fill(v,v+100,0);
fill(w,w+100,0);*/
cin >> W;
if (W == 0)
break;
cin >> N;
for... | replace | 5 | 6 | 5 | 6 | TLE | |
p00042 | C++ | Memory Limit Exceeded | #include <array>
#include <cstdio>
#include <iostream>
using namespace std;
array<pair<int, int>, 1001> pairs;
array<array<pair<int, int>, 10001>, 1001> m;
int main() {
for (int caseNo = 0;; caseNo++) {
int w;
scanf("%d", &w);
if (w == 0)
break;
int n;
scanf("%d", &n);
for (int i = 1; i ... | #include <array>
#include <cstdio>
#include <iostream>
using namespace std;
array<pair<int, int>, 1001> pairs;
array<array<pair<int, int>, 1001>, 1001> m;
int main() {
for (int caseNo = 0;; caseNo++) {
int w;
scanf("%d", &w);
if (w == 0)
break;
int n;
scanf("%d", &n);
for (int i = 1; i <... | replace | 5 | 6 | 5 | 6 | MLE | |
p00042 | C++ | Memory Limit Exceeded | #include <cstring>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
const int MAX_N = 1000, MAX_M = 10000;
int n;
typedef pair<int, int> P;
P ilist[MAX_N];
P memo[MAX_N + 1][MAX_M + 1];
P comp(const P &a, const P &b) {
if (a.first < b.first)
return b;
return a;
}
P dp(int now, int... | #include <cstring>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
const int MAX_N = 1000, MAX_M = 1000;
int n;
typedef pair<int, int> P;
P ilist[MAX_N];
P memo[MAX_N + 1][MAX_M + 1];
P comp(const P &a, const P &b) {
if (a.first < b.first)
return b;
return a;
}
P dp(int now, int ... | replace | 5 | 6 | 5 | 6 | MLE | |
p00042 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define req(i, r, k) for (int i = k; i < r; i++)
#define rep(i, r) req(i, r, 0)
const long long int INF = 100000000000000;
long long int dp[1001][1001];
int main() {
for (int a = 1; 1; a++) {
int w, n;
scanf(" %d", &w);
if (w == 0)
break;
scanf(... | #include <bits/stdc++.h>
using namespace std;
#define req(i, r, k) for (int i = k; i < r; i++)
#define rep(i, r) req(i, r, 0)
const long long int INF = 100000000000000;
long long int dp[1002][1002];
int main() {
for (int a = 1; 1; a++) {
int w, n;
scanf(" %d", &w);
if (w == 0)
break;
scanf(... | replace | 8 | 9 | 8 | 9 | 0 | |
p00042 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int W, n, v[1000], w[1000], dp[10000][10000], t = 1;
while (cin >> W, W) {
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d,%d", &v[i], &w[i]);
for (int i = 0; i < 1000; i++)
for (int j = 0; j < 1000; j++)
... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int W, n, v[1000], w[1000], dp[1001][1001], t = 1;
while (cin >> W, W) {
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d,%d", &v[i], &w[i]);
for (int i = 0; i < 1000; i++)
for (int j = 0; j < 1000; j++)
... | replace | 6 | 7 | 6 | 7 | -11 | |
p00042 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string.h>
#include <vector>
#define loop(lp) for (int lp2 = 0; lp2 < lp; lp2++)
#define ascent(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
using namespace std;
int dp[2000][20000];
in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string.h>
#include <vector>
#define loop(lp) for (int lp2 = 0; lp2 < lp; lp2++)
#define ascent(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
using namespace std;
int dp[1010][10010];
in... | replace | 16 | 17 | 16 | 17 | MLE | |
p00042 | C++ | Memory Limit Exceeded | #include <cstring>
#include <iostream>
using namespace std;
const int MAX_w = 1000;
const int MAX_v = 10000;
int dp[MAX_w + 1][MAX_v + 1];
int n, wet;
int w[MAX_w], v[MAX_v];
// i番目以降の品物から重さの和がj以下なるように選んだときの、
// 取りうる価値の総和の最大値を返す関数
int rec(int i, int j) {
int res;
if (dp[i][j] != -1) {
return dp[i][j];
}... | #include <cstring>
#include <iostream>
using namespace std;
const int MAX_w = 1000;
const int MAX_v = 1000;
int dp[MAX_w + 1][MAX_v + 1];
int n, wet;
int w[MAX_w], v[MAX_v];
// i番目以降の品物から重さの和がj以下なるように選んだときの、
// 取りうる価値の総和の最大値を返す関数
int rec(int i, int j) {
int res;
if (dp[i][j] != -1) {
return dp[i][j];
}
... | replace | 6 | 7 | 6 | 7 | MLE | |
p00042 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define INF 100000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
typedef long long ll;
int dp[2000][20000]; //... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define INF 100000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
typedef long long ll;
int dp[1001][10001]; //... | replace | 16 | 18 | 16 | 18 | MLE | |
p00042 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#define mp(n, m) make_pair(n, m)
#def... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#define mp(n, m) make_pair(n, m)
#def... | replace | 78 | 79 | 78 | 79 | TLE | |
p00042 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int dp[10000][10000];
int main() {
int W, N, v[1024], w[1024], c = 0, res = 0;
while (scanf("%d", &W) && W) {
c++;
scanf("%d", &N);
for (int i = 0; i < N; ++i)
scanf("%d,%d", v + i, w + i);
res = 0;
memset(dp... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int dp[1001][1001];
int main() {
int W, N, v[1024], w[1024], c = 0, res = 0;
while (scanf("%d", &W) && W) {
c++;
scanf("%d", &N);
for (int i = 0; i < N; ++i)
scanf("%d,%d", v + i, w + i);
res = 0;
memset(dp, ... | replace | 6 | 7 | 6 | 7 | MLE | |
p00042 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int w, n;
int count = 0;
while (cin >> w, w) {
vector<pair<int, int>> v;
long long dp[1000][1000];
memset(dp, 0, sizeof(dp));
cin >> n;
for (int i = 0; i < n; i++)... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int w, n;
int count = 0;
while (cin >> w, w) {
vector<pair<int, int>> v;
long long dp[1010][1010];
memset(dp, 0, sizeof(dp));
cin >> n;
for (int i = 0; i < n; i++)... | replace | 12 | 13 | 12 | 13 | 0 | |
p00042 | C++ | Time Limit Exceeded | #include <algorithm>
#include <stdio.h>
using namespace std;
int W, N, v[1000], w[1000], dp[1001][1001], c, r;
int main() {
while (~scanf("%d", &W)) {
if (!W)
break;
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d%d", &w[i], &v[i]);
for (int i = 1; i <= N; i++) {
for (int j = ... | #include <algorithm>
#include <stdio.h>
using namespace std;
int W, N, v[1000], w[1000], dp[1001][1001], c, r;
int main() {
while (~scanf("%d", &W)) {
if (!W)
break;
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d,%d", &v[i], &w[i]);
for (int i = 1; i <= N; i++) {
for (int j =... | replace | 10 | 11 | 10 | 11 | TLE | |
p00042 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
if (a.first != b.first)
return a.first < b.first;
else
return a.second > b.second;
}
int main() {
int n, W;
int t = 1;
while (cin >> W >> n && W) {
vector<pair<int, int>> cur;
cur.push_b... | #include <bits/stdc++.h>
using namespace std;
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
if (a.first != b.first)
return a.first < b.first;
else
return a.second > b.second;
}
int main() {
int n, W;
int t = 1;
while (cin >> W >> n && W) {
vector<pair<int, int>> cur;
cur.push_b... | replace | 26 | 27 | 26 | 29 | TLE | |
p00042 | C++ | Runtime Error | // バグ有
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int W, N;
char d;
int counter = 1;
int takara[1000][2];
while (1) {
cin >> W;
if (W == 0) {
break;
}
cin >> N;
for (int i = 0; i < N; i++) {
cin >> takara[i][0] >> d >> takara[i][... | // バグ有
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int W, N;
char d;
int counter = 1;
int takara[1000][2];
while (1) {
cin >> W;
if (W == 0) {
break;
}
cin >> N;
for (int i = 0; i < N; i++) {
cin >> takara[i][0] >> d >> takara[i][... | replace | 22 | 23 | 22 | 23 | -11 | |
p00042 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <deque>
using namespace std;
typedef pair<int, int> P;
int W, N, v[1000], w[1000];
int I;
P dp[1000][1000];
bool done[1000][1000];
P solve(int i, int r) {
if (done[i][r])
return dp[i][r];
P result;
if (i == N)
result = P(0, r);
else {
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <deque>
using namespace std;
typedef pair<int, int> P;
int W, N, v[1000], w[1000];
int I;
P dp[1001][1001];
bool done[1001][1001];
P solve(int i, int r) {
if (done[i][r])
return dp[i][r];
P result;
if (i == N)
result = P(0, r);
else {
... | replace | 10 | 12 | 10 | 12 | 0 | |
p00042 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
int dp[1001][1001];
int main() {
int W, N, v[1000], w[1000];
int n = 1;
int lastj = 0;
char jyama;
while (cin >> W && W) {
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d,%d", &v[i], &w[i]);
}
for (int i = 0; i <= N; i++) {
... | #include <iostream>
#include <stdio.h>
using namespace std;
int dp[1005][1005];
int main() {
int W, N, v[1000], w[1000];
int n = 1;
int lastj = 0;
char jyama;
while (cin >> W && W) {
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d,%d", &v[i], &w[i]);
}
for (int i = 0; i <= N; i++) {
... | replace | 3 | 4 | 3 | 4 | 0 | |
p00043 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 100000000
#define pb push_back
#define fi first
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 100000000
#define pb push_back
#define fi first
#define... | insert | 65 | 65 | 65 | 67 | 0 | |
p00043 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
#define loop(i, a, b) for (int i = (a); i < ull(b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(a) (a).begin(), (a).end()
bool ok(int i, int j) { return i == j && i < 9; }
int main() {
string s;
vec... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
#define loop(i, a, b) for (int i = (a); i < ull(b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(a) (a).begin(), (a).end()
bool ok(int i, int j) { return i == j && i < 9; }
int main() {
string s;
vec... | replace | 69 | 70 | 69 | 73 | TLE | |
p00043 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#define NO 100000
#define NO2 1000000000
using namespace std;
int puz[14];
bool solve(int Spuz[]) {
int Bpuz[14];
int tmp[3];
bool f = true;
for (int i = 0; i < 14; i++) {
Bpuz[i] = Spuz[i];
if (Bpuz[i] != NO && Bpuz[i] != NO2)
f = fals... | #include <algorithm>
#include <iostream>
#include <string>
#define NO 100000
#define NO2 1000000000
using namespace std;
int puz[14];
bool solve(int Spuz[]) {
int Bpuz[14];
int tmp[3];
bool f = true;
for (int i = 0; i < 14; i++) {
Bpuz[i] = Spuz[i];
if (Bpuz[i] != NO && Bpuz[i] != NO2)
f = fals... | replace | 77 | 79 | 77 | 78 | TLE | |
p00044 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for (int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define PRIM 50021
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for (int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define PRIM 50021
... | replace | 30 | 31 | 30 | 31 | TLE | |
p00044 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> arr(80000);
for (int i = 0; i < 80000; ++i)
arr[i] = 1;
for (int i = 2; i < sqrt(80000); ++i) {
if (arr[i]) {
for (int j = 0; i * (j + 2) < 80000; j++)
arr[i * (j + 2)] = 0;
}
}
while (1) {
int n;
ci... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> arr(80000);
for (int i = 0; i < 80000; ++i)
arr[i] = 1;
for (int i = 2; i < sqrt(80000); ++i) {
if (arr[i]) {
for (int j = 0; i * (j + 2) < 80000; j++)
arr[i * (j + 2)] = 0;
}
}
int n;
while (cin >> n) {
... | replace | 18 | 21 | 18 | 21 | TLE | |
p00044 | C++ | Time Limit Exceeded | #include <iostream>
#include <string.h>
using namespace std;
int isprime[50101];
int main() {
memset(isprime, 0, sizeof(isprime));
for (int i = 4; i < 50101; i += 2)
isprime[i] = 1;
isprime[1] = 1;
for (int i = 3; i * i < 50101; i += 2)
if (isprime[i] == 0)
for (int j = 2; i * j < 50101; ++j)
... | #include <iostream>
#include <string.h>
using namespace std;
int isprime[50101];
int main() {
memset(isprime, 0, sizeof(isprime));
for (int i = 4; i < 50101; i += 2)
isprime[i] = 1;
isprime[1] = 1;
for (int i = 3; i * i < 50101; i += 2)
if (isprime[i] == 0)
for (int j = 2; i * j < 50101; ++j)
... | replace | 17 | 18 | 17 | 18 | TLE | |
p00044 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#define N 50001
void Eratos(void);
int prime[N];
int main(void) {
int n;
int lessmax, bigmin;
Eratos();
while (scanf("%d", &n) != EOF) {
for (int i = n - 1;; i--) {
if (prime[i] == 1) {
lessmax = i;
break;
}
}
for (int i = n + 1;;... | #include <math.h>
#include <stdio.h>
#define N 50060
void Eratos(void);
int prime[N];
int main(void) {
int n;
int lessmax, bigmin;
Eratos();
while (scanf("%d", &n) != EOF) {
for (int i = n - 1;; i--) {
if (prime[i] == 1) {
lessmax = i;
break;
}
}
for (int i = n + 1;;... | replace | 2 | 3 | 2 | 3 | 0 | |
p00044 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int i, no, input;
int prime[500];
int ptr = 0, c = 0;
int flag = 0;
int last;
while (cin >> input) {
flag = ptr = c = 0;
prime[ptr++] = 2;
prime[ptr++] = 3;
for (no = 5;; no += 2) {
if (flag == 2) {
br... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int i, no, input;
int prime[10000];
int ptr = 0, c = 0;
int flag = 0;
int last;
while (cin >> input) {
flag = ptr = c = 0;
prime[ptr++] = 2;
prime[ptr++] = 3;
for (no = 5;; no += 2) {
if (flag == 2) {
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00044 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int p[50100];
int main() {
int i, j;
for (i = 2; i * i < 50100; i++) {
if (p[i] == 0) {
for (j = i * 2; j < 50100; j += i) {
p[j] = 1;
}
}
}
while (cin >> i, i) {
for (j = i - 1; p[j]; j--) {
}
cout << j << ' ';
for (j = i + 1;... | #include <iostream>
using namespace std;
int p[50100];
int main() {
int i, j;
for (i = 2; i * i < 50100; i++) {
if (p[i] == 0) {
for (j = i * 2; j < 50100; j += i) {
p[j] = 1;
}
}
}
while (cin >> i) {
for (j = i - 1; p[j]; j--) {
}
cout << j << ' ';
for (j = i + 1; p[... | replace | 12 | 13 | 12 | 13 | TLE | |
p00044 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N (50000)
bool prime[N + 1];
int main() {
memset(prime, true, sizeof(prime));
prime[0] = prime[1] = false;
for (int i = 2; i * i <= N; i++) {
for (int j = i * i; j <= N; j += i) {
prime[j] = false;
}
}
int n;
while (~scanf("%d", &n)) {
... | #include <bits/stdc++.h>
using namespace std;
#define N (50500)
bool prime[N + 1];
int main() {
memset(prime, true, sizeof(prime));
prime[0] = prime[1] = false;
for (int i = 2; i * i <= N; i++) {
for (int j = i * i; j <= N; j += i) {
prime[j] = false;
}
}
int n;
while (~scanf("%d", &n)) {
... | replace | 2 | 3 | 2 | 3 | 0 | |
p00045 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
map<double, double> m;
double a, b, ave, sum;
while (scanf("%lf,%lf", &a, &b)) {
if (!a)
break;
m[a] ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
map<double, double> m;
double a, b, ave = 0, sum = 0;
while (scanf("%lf,%lf", &a, &b) != EOF) {
m[a] = b;
}
... | replace | 12 | 16 | 12 | 14 | TLE | |
p00045 | C++ | Time Limit Exceeded | #include <bits //stdc++.h>
using namespace std;
int main() {
int a, b;
int ca = 0;
double cb = 0;
int i = 0;
while (scanf("%d,%d", &a, &b)) {
ca += a * b;
cb += b;
i++;
}
double cc = cb / i;
double cd = round(cc);
cout << ca << endl << cd << endl;
return 0;
} | #include <bits //stdc++.h>
using namespace std;
int main() {
int a, b;
int ca = 0;
double cb = 0;
int i = 0;
while (scanf("%d,%d", &a, &b) != EOF) {
ca += a * b;
cb += b;
i++;
}
double cc = cb / i;
double cd = round(cc);
cout << ca << endl << cd << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p00045 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
int main() {
int a, b, c ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
int main() {
int a, b, c ... | replace | 17 | 18 | 17 | 18 | TLE | |
p00045 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int value, num, i = 0, total = 0, ave = 0;
while (scanf("%d %d", &value, &num) != EOF) {
total += value * num;
ave += num;
i++;
}
cout << total << endl << (int)(ave / (double)i + 0.5) << endl;
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int value, num, i = 0, total = 0, ave = 0;
while (scanf("%d, %d", &value, &num) != EOF) {
total += value * num;
ave += num;
i++;
}
cout << total << endl << (int)(ave / (double)i + 0.5) << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p00045 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int price, amount;
int sum = 0, ave = 0, i = 0;
while (scanf("%d,%d", &price, &amount)) {
sum += price * amount;
ave += amount;
i++;
}
printf("%d\n%d\n", sum, (int)(ave / (double)i + 0.5));
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int price, amount;
int sum = 0, ave = 0, i = 0;
while (scanf("%d,%d", &price, &amount) != EOF) {
sum += price * amount;
ave += amount;
i++;
}
printf("%d\n%d\n", sum, (int)(ave / (double)i + 0.5));
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p00045 | C++ | Time Limit Exceeded | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int m = 0, n = 0, c = 0, i, j;
char a;
while (cin >> i >> a >> j, i) {
m += (i * j);
n += j;
c++;
}
double am = 1.0 * n / c;
if (am * 10 - int(am / 10) > 4)
am = am + 1;
cout << m << endl << int(am) << endl;
} | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int m = 0, n = 0, c = 0, i, j;
char a;
while (cin >> i >> a >> j) {
m += (i * j);
n += j;
c++;
}
double am = 1.0 * n / c;
if (am * 10 - int(am / 10) > 4)
am = am + 1;
cout << m << endl << int(am) << endl;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p00045 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
int main() {
double a = 0.0, b = 0.0, sum = 0.0, sumw = 0.0;
double cnt = 0.0;
while (scanf("%lf,%lf", &a, &b) != '\n') {
sum = sum + a * b;
sumw = sumw + b;
cnt = cnt + 1.0;
}
cout << sum << endl;
cout << (int)floor((sumw / cnt) + 0.5) << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
double a = 0.0, b = 0.0, sum = 0.0, sumw = 0.0;
double cnt = 0.0;
while (scanf("%lf,%lf", &a, &b) != EOF) {
sum = sum + a * b;
sumw = sumw + b;
cnt = cnt + 1.0;
}
cout << sum << endl;
cout << (int)floor((sumw / cnt) + 0.5) << endl;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p00046 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
void Solution() {
int n = 0;
double a[n];
while (cin >> a[n]) {
n++;
}
// for (int i = 0; i < n - 1; i++)
// {
// for (int j = i + 1; j < n; j++)
// {
// if (a[i] < a... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
void Solution() {
int n = 0;
double a[100]; // notice the definition.
while (cin >> a[n]) {
n++;
}
// for (int i = 0; i < n - 1; i++)
// {
// for (int j = i + 1; j < n; j++)
// {
... | replace | 9 | 10 | 9 | 10 | -11 | |
p00046 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
double n, h = 0.0, l = 999999.0;
while (scanf("%lf", &n)) {
h = max(h, n);
l = min(l, n);
}
printf("%.1lf\n", h - l);
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
double n, h = 0.0, l = 999999.0;
while (cin >> n) {
h = max(h, n);
l = min(l, n);
}
printf("%.1lf\n", h - l);
} | replace | 8 | 9 | 8 | 9 | TLE | |
p00046 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
double a, mx, mn;
cin >> a;
mx = mn = a;
while (1) {
if (cin.eof() == -1) {
break;
}
cin >> a;
mx = max(mx, a);
mn = min(mn, a);
}
cout << mx - mn << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
double a, mx, mn;
cin >> a;
mx = mn = a;
while (1) {
if (cin.eof()) {
break;
}
cin >> a;
mx = max(mx, a);
mn = min(mn, a);
}
cout << mx - mn << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p00046 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<double> v;
vector<double>::iterator pv = v.begin();
double d;
while (cin >> d) {
v.push_back(d);
}
sort(v.begin(), v.end());
double a = *pv;
pv = v.end();
double b = *pv;
cout << b - a << endl;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<double> v;
vector<double>::iterator pv = v.begin();
double d;
while (cin >> d) {
v.push_back(d);
}
sort(v.begin(), v.end());
int z = v.size();
double a = v[z - 1];
double b = v[0];
double c = a -... | replace | 13 | 17 | 13 | 18 | -11 | |
p00047 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
int A = 1;
int B = 0;
int C = 0;
while (true) {
string s;
cin >> s;
if (s[0] == 'A') {
if (s[2] == 'B') {
int tmp;
tmp = B;
B = A;
A = tmp;
} else if (s[2] == 'C') {
int tmp;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int A = 1;
int B = 0;
int C = 0;
string s;
while (cin >> s) {
if (s[0] == 'A') {
if (s[2] == 'B') {
int tmp;
tmp = B;
B = A;
A = tmp;
} else if (s[2] == 'C') {
int tmp;
tmp ... | replace | 8 | 11 | 8 | 10 | TLE | |
p00047 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int cup[3] = {1};
int x, y;
while (scanf(" %d,%d", &x, &y) != EOF) {
swap(cup[x - 'A'], cup[y - 'A']);
}
for (int i = 0; i < 3; i++) {
if (cup[i] > 0) {
printf("%c\n", 'A' + i);
break;
}
}
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int cup[3] = {1};
char x, y;
while (scanf(" %c", &x) != EOF) {
scanf(",%c", &y);
swap(cup[x - 'A'], cup[y - 'A']);
}
for (int i = 0; i < 3; i++) {
if (cup[i] > 0) {
printf("%c\n", 'A' + i);
bre... | replace | 6 | 8 | 6 | 9 | TLE | |
p00047 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int main() {
char X, Y, P = 'A';
while (scanf("%c,%c", &X, &Y)) {
if (X == P) {
P = Y;
} else if (Y == P) {
P = X;
}
}
printf("%c\n", P);
return 0;
} | #define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int main() {
char X, Y, P = 'A';
while (scanf("%c,%c", &X, &Y) != EOF) {
if (X == P) {
P = Y;
} else if (Y == P) {
P = X;
}
}
printf("%c\n", P);
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p00047 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
char f, t;
int data[3] = {1, 0, 0};
while (1) {
int tmp;
if (scanf("%c,%c") == EOF)
break;
tmp = data[t - 'A'];
data[t - 'A'] = data[f - 'A'];
data[f - 'A'] = tmp;
}
if (data[0] == 1)
cout << 'A' << end... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
char f, t;
int data[3] = {1, 0, 0};
while (1) {
int tmp;
if (scanf("%c,%c", &f, &t) == EOF)
break;
tmp = data[t - 'A'];
data[t - 'A'] = data[f - 'A'];
data[f - 'A'] = tmp;
}
if (data[0] == 1)
cout << 'A... | replace | 10 | 11 | 10 | 11 | TLE | |
p00047 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int cup[3] = {1, 0, 0}, temp = 0, count = 0;
char cup_str[5] = "ABC,";
char cup1, cup2, cup3;
while (1) {
cin >> cup1 >> cup2 >> cup3;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (cup1 == cup_str[j] && cup3 == cup... | #include <iostream>
using namespace std;
int main() {
int cup[3] = {1, 0, 0}, temp = 0, count = 0;
char cup_str[5] = "ABC,";
char cup1, cup2, cup3;
while (1) {
cin >> cup1 >> cup2 >> cup3;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (cup1 == cup_str[j] && cup3 == cup... | replace | 22 | 26 | 22 | 30 | TLE | |
p00048 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
const string cls[] = {"",
"light fly",
"fly",
"bantam",
"feather",
"light",
"light welter",
"welter",
... | #include <iostream>
#include <string>
using namespace std;
const string cls[] = {"",
"light fly",
"fly",
"bantam",
"feather",
"light",
"light welter",
"welter",
... | replace | 17 | 18 | 17 | 18 | 0 | |
p00048 | C++ | Time Limit Exceeded | #include <cstdio>
int main() {
float n;
int m;
const char *rank[] = {"light fly", "fly", "bantam", "feather",
"light", "light welter", "welter", "light middle",
"middle", "light heavy", "heavy"};
while (scanf("%f\n", &n)) {
if (n <= 48.0)
... | #include <cstdio>
int main() {
float n;
int m;
const char *rank[] = {"light fly", "fly", "bantam", "feather",
"light", "light welter", "welter", "light middle",
"middle", "light heavy", "heavy"};
while (~scanf("%f\n", &n)) {
if (n <= 48.0)
... | replace | 8 | 9 | 8 | 9 | TLE | |
p00048 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s[11] = {"light fly", "fly", "bantam", "feather",
"light", "light welter", "welter", "light middle",
"middle", "light heavy", "heavy"};
double g[] = {48.0, 51.0, 54.0, 57.0, 60.0, 64.... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s[11] = {"light fly", "fly", "bantam", "feather",
"light", "light welter", "welter", "light middle",
"middle", "light heavy", "heavy"};
double g[] = {48.0, 51.0, 54.0, 57.0, 60.0, 64.... | replace | 14 | 15 | 14 | 15 | 0 | |
p00049 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main(void) {
int a, b, ab, o;
int temp;
char blood[2];
a = b = ab = o = 0;
while (scanf("%d,%s", &temp, blood) != EOF) {
if (strcmp(blood, "AB") == 0)
ab++;
else if (strcmp(blood, "A") == 0)
a++;
else if (strcmp(blood, "B") == 0)
b++;... | #include <stdio.h>
#include <string.h>
int main(void) {
int a, b, ab, o;
int temp;
char blood[3];
a = b = ab = o = 0;
while (scanf("%d,%s", &temp, blood) != EOF) {
if (strcmp(blood, "AB") == 0)
ab++;
else if (strcmp(blood, "A") == 0)
a++;
else if (strcmp(blood, "B") == 0)
b++;... | replace | 6 | 7 | 6 | 7 | 0 | |
p00049 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
void solve() {
int count[4] = {0};
int num;
string blood;
while (scanf("%d,", &num)) {
cin >> blood;
if (blood == "A") {
++count[0];
} else if (blood == "B") {
++count[1];
} else if (blood == "AB") {
... | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
void solve() {
int count[4] = {0};
int num;
string blood;
while (scanf("%d,", &num) != EOF) {
cin >> blood;
if (blood == "A") {
++count[0];
} else if (blood == "B") {
++count[1];
} else if (blood == "AB")... | replace | 10 | 11 | 10 | 11 | TLE | |
p00049 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int num;
string blood;
char row[1000];
map<string, int> type;
type.insert(make_pair("A", 0));
type.insert(make_pair("B", 0));
type.insert(make_pair("O", 0));
type.insert(make_pair("AB", 0));
whil... | #include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int num;
char blood[100];
char row[1000];
map<string, int> type;
type.insert(make_pair("A", 0));
type.insert(make_pair("B", 0));
type.insert(make_pair("O", 0));
type.insert(make_pair("AB", 0));
w... | replace | 9 | 10 | 9 | 10 | -6 | free(): invalid pointer
|
p00049 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string str;
int blood[4] = {0};
while (scanf("%d,%s", &n, &str) != EOF) {
if (str == "A")
blood[0]++;
else if (str == "B")
blood[1]++;
else if (str == "AB")
blood[2]++;
else if (str... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string str;
int blood[4] = {0};
while (scanf("%d,", &n) != EOF) {
cin >> str;
if (str == "A")
blood[0]++;
else if (str == "B")
blood[1]++;
else if (str == "AB")
blood[2]++;
else... | replace | 8 | 9 | 8 | 10 | -11 | |
p00049 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, a = 0, b = 0, c = 0, o = 0, x, y, z, w;
char s[2];
while (scanf("%d,%s", &n, s) != EOF) {
if (s[1] == 'B')
c++;
else if (s[0] == 'A')
a++;
else if (s[0] == 'B')
b++;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, a = 0, b = 0, c = 0, o = 0, x, y, z, w;
char s[3];
while (scanf("%d,%s", &n, s) != EOF) {
if (s[1] == 'B')
c++;
else if (s[0] == 'A')
a++;
else if (s[0] == 'B')
b++;... | replace | 8 | 9 | 8 | 9 | 0 | |
p00050 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#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 rp(a) while (a--)
#define pb pus... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#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 rp(a) while (a--)
#define pb pus... | replace | 27 | 35 | 27 | 38 | TLE | |
p00050 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
char input[2000];
cin.getline(input, 1000);
for (int i = 0; input[i] != '\n'; i++) {
if (!strncmp(&input[i], "apple", 5)) {
strncpy(&input[i], "peach", 5);
} else if (!s... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
char input[2000];
cin.getline(input, 1000);
for (int i = 0; input[i] != '\0'; i++) {
if (!strncmp(&input[i], "apple", 5)) {
strncpy(&input[i], "peach", 5);
} else if (!s... | replace | 10 | 11 | 10 | 11 | 0 | |
p00051 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define all(c) c.begin(), c.end()
int main() {
int n;
cin >> n;
while (n--) {
string s;
cin >> s;
sort(all(s));
int n = stoi(s);
reverse(all(s));
int m = stoi(s);
cerr << m << " " << n << endl;
cout << ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define all(c) c.begin(), c.end()
int main() {
int n;
cin >> n;
while (n--) {
string s;
cin >> s;
sort(all(s));
int n = stoi(s);
reverse(all(s));
int m = stoi(s);
cout << m - n << endl;
}
} | delete | 15 | 16 | 15 | 15 | 0 | 96553100 135569
96553100 135569
|
p00051 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, max, min, kkk;
cin >> n;
for (int i = 0; i < n; i++) {
string input = "", mmm, mai = "", mii = "";
int a[8] = {};
cin >> input;
for (int j = 0; j < 8; j++) {
mmm = input[j];
a[j] = stoi... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, max, min, kkk;
cin >> n;
for (int i = 0; i < n; i++) {
string input = "", mmm, mai = "", mii = "";
int a[8] = {};
cin >> input;
for (int j = 0; j < 8; j++) {
mmm = input[j];
a[j] = stoi... | insert | 19 | 19 | 19 | 24 | 0 | |
p00051 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int ret[8];
cin >> n;
while (n-- > 0) {
string s;
cin >> s;
for (int i = 0; i < 8; i++)
ret[i] = s[i - '0'];
int Min = 0, Max = 0;
sort(ret, ret + 8);
for (int i = ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int ret[8];
cin >> n;
while (n-- > 0) {
string s;
cin >> s;
for (int i = 0; i < 8; i++)
ret[i] = s[i] - '0';
int Min = 0, Max = 0;
sort(ret, ret + 8);
for (int i = ... | replace | 14 | 15 | 14 | 15 | 0 | |
p00051 | C++ | Runtime Error | // 0051
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int n, a[8], i, max, min;
cin >> n;
while (n--) {
max = 0;
min = 0;
cin >> str;
for (i = 0; i < 9; i++) {
a[i] = str[i] - '0';
}
sort(a, a + 8, greater<int>());
for (i = 0; i < 8; i++) {
max ... | // 0051
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int n, a[8], i, max, min;
cin >> n;
while (n--) {
max = 0;
min = 0;
cin >> str;
for (i = 0; i < 8; i++) {
a[i] = str[i] - '0';
}
sort(a, a + 8, greater<int>());
for (i = 0; i < 8; i++) {
max ... | replace | 12 | 13 | 12 | 13 | 0 | |
p00052 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
while (1) {
int ct = 0;
cin >> n;
if (!n)
break;
while (n / 5)
ct += n;
cout << ct << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
while (1) {
int ct = 0;
cin >> n;
if (!n)
break;
while (n /= 5)
ct += n;
cout << ct << endl;
}
return 0;
} | replace | 11 | 12 | 11 | 12 | TLE | |
p00052 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
while (cin >> n, n) {
a = 0;
while (n != 1) {
a += n / 5;
n /= 5;
}
cout << a << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
while (cin >> n, n) {
a = 0;
while (n > 1) {
a += n / 5;
n /= 5;
}
cout << a << endl;
}
} | replace | 6 | 7 | 6 | 7 | TLE | |
p00052 | C++ | Time Limit Exceeded | #include <iostream>
inline void DPri(int n) { std::cout << n << std::endl; }
int recsion(int n, int a, int c) {
if (n == 1)
return c;
int d = n;
while (!(d % a)) {
if (!(d % a))
d /= a, c++;
}
recsion(n - 1, a, c);
}
int main() {
int n;
while (std::cin >> n) {
if (std::cin.eof())
... | #include <iostream>
inline void DPri(int n) { std::cout << n << std::endl; }
int recsion(int n, int a, int c) {
if (n == 1)
return c;
int d = n;
while (!(d % a)) {
if (!(d % a))
d /= a, c++;
}
recsion(n - 1, a, c);
}
int main() {
int n;
while (std::cin >> n) {
if (!n)
break;
i... | replace | 16 | 17 | 16 | 17 | TLE | |
p00052 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
vector<int> zeronum;
zeronum.push_back(0);
int count = 0;
for (int i = 1; i <= 20000000; i++) {... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
vector<int> zeronum;
zeronum.push_back(0);
int count = 0;
for (int i = 1; i <= 5000000; i++) {
... | replace | 18 | 19 | 18 | 19 | MLE | |
p00052 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int s(int x) {
int ans, y = x;
y %= 5;
x = (x - y) / 5;
ans = s(x) + x;
return ans;
}
int main() {
int n, ans;
while (cin >> n) {
if (n == 0) {
break;
}
ans = s(n);
cout << ans << endl;
}
} | #include <iostream>
using namespace std;
int s(int x) {
int ans, y = x;
y %= 5;
x = (x - y) / 5;
if (x < 5)
ans = x;
if (x >= 5)
ans = s(x) + x;
return ans;
}
int main() {
int n, ans;
while (cin >> n) {
if (n == 0) {
break;
}
ans = s(n);
cout << ans << endl;
}
} | replace | 7 | 8 | 7 | 11 | TLE | |
p00052 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
int res = 0;
while (N > 0) {
res += N / 5;
}
cout << res << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
int res = 0;
while (N > 0) {
res += N /= 5;
}
cout << res << endl;
}
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p00053 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
int isprime(int x) {
int i;
if (x == 2) {
return 1;
}
if (x < 2 || x % 2 == 0) {
return 0;
}
i = 3;
while (i <= sqrt(x)) {
if (x % i == 0) {
return 0;
}
i = i + 2;
}
return 1;
}
int main() {
int n, c = 0, l[10001] = {0}, j = 0;
for (in... | #include <math.h>
#include <stdio.h>
int isprime(int x) {
int i;
if (x == 2) {
return 1;
}
if (x < 2 || x % 2 == 0) {
return 0;
}
i = 3;
while (i <= sqrt(x)) {
if (x % i == 0) {
return 0;
}
i = i + 2;
}
return 1;
}
int main() {
int n, c = 0, l[10001] = {0}, j = 0;
for (in... | replace | 21 | 22 | 21 | 22 | -11 | |
p00053 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
bool f[105000];
int n;
long long int sum[105000];
memset(f, false, sizeof(f));
sum[0] = 0;
for (int i = 2; i <= 105000; i++) {
if (f[i])
continue;
for (int j = i * i; j < 105000; j += i)
f[j] = ... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
bool f[105000];
int n;
long long int sum[105000];
memset(f, false, sizeof(f));
sum[0] = 0;
for (int i = 2; i * i <= 105000; i++) {
if (f[i])
continue;
for (int j = i * i; j < 105000; j += i)
f[j... | replace | 10 | 11 | 10 | 11 | -11 | |
p00053 | C++ | Runtime Error |
#include <cmath>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MAX 105000
using namespace std;
int main() {
/*for(int k = 1; k<MAX;k++)
{
if(PrimeCheck(v[k+1]))
{
//cout << v[k+1] << " ";
v2[d] = v[k+1];
... |
#include <cmath>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MAX 105000
using namespace std;
int main() {
/*for(int k = 1; k<MAX;k++)
{
if(PrimeCheck(v[k+1]))
{
//cout << v[k+1] << " ";
v2[d] = v[k+1];
... | replace | 25 | 26 | 25 | 26 | -6 | malloc(): corrupted top size
|
p00053 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
bool isPrime(int n) {
if (n == 2)
return true;
if (n % 2 == 0)
return false;
for (int i = 3; i < n / 2; i += 2) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
int input;
while (cin >> input, input) {
int cou... | #include <cmath>
#include <iostream>
using namespace std;
bool isPrime(int n) {
if (n == 2)
return true;
if (n % 2 == 0)
return false;
double sqrtNum = sqrt(n);
for (int i = 3; i <= sqrtNum; i += 2) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
int input;
while (cin... | replace | 10 | 11 | 10 | 12 | TLE | |
p00053 | C++ | Runtime Error | #include <iostream>
unsigned long long a[10001], b[200000], c, n;
using namespace std;
int main() {
for (int i = 2; i < 200000; i++)
for (int j = i * 2; j < 200000; j += i)
b[j]++;
for (int i = 2; i < 200000; i++)
if (!b[i]) {
a[c + 1] += i + a[c];
c++;
}
while (cin >> n, n)
cout... | #include <iostream>
unsigned long long a[100000], b[200000], c, n;
using namespace std;
int main() {
for (int i = 2; i < 200000; i++)
for (int j = i * 2; j < 200000; j += i)
b[j]++;
for (int i = 2; i < 200000; i++)
if (!b[i]) {
a[c + 1] += i + a[c];
c++;
}
while (cin >> n, n)
cou... | replace | 1 | 2 | 1 | 2 | 0 | |
p00053 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using name... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using name... | replace | 49 | 50 | 49 | 50 | 0 | > ps.size() = 17984
|
p00053 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int prime[10001], p = 3, psum[10001], n;
prime[1] = 2, prime[2] = 3;
for (int i = 5; p < 10001; i++) {
int f = 0;
for (int j = 1; prime[j] * prime[j] <= i; j++)
if (i % prime[j] == 0) {
f = 1;
break;
}
if (!f)
pr... | #include <iostream>
using namespace std;
int main() {
int prime[10001], p = 3, psum[10001], n;
prime[1] = 2, prime[2] = 3;
for (int i = 5; p < 10001; i++) {
int f = 0;
for (int j = 1; prime[j] * prime[j] <= i; j++)
if (i % prime[j] == 0) {
f = 1;
break;
}
if (!f)
pr... | replace | 18 | 19 | 18 | 19 | -11 | |
p00053 | C++ | Memory Limit Exceeded | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | replace | 53 | 54 | 53 | 54 | MLE | |
p00053 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
const int NUM = 10000;
bool prime[NUM];
for (int i = 2; i < NUM; i++)
prime[i] = true;
for (int i = 2; i * i < NUM; i++)
for (int k = 2; i * k < NUM; k++)
prime[i * k] = false;
int n, c;
while (cin >> n) {
if (!n)
break;
c = ... | #include <iostream>
using namespace std;
int main() {
const int NUM = 1e6;
bool prime[NUM];
for (int i = 2; i < NUM; i++)
prime[i] = true;
for (int i = 2; i * i < NUM; i++)
for (int k = 2; i * k < NUM; k++)
prime[i * k] = false;
int n, c;
while (cin >> n) {
if (!n)
break;
c = 0;... | replace | 4 | 5 | 4 | 5 | 0 | |
p00054 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int func(int a, int b, int n) {
if (n == 0) {
return 0;
}
int u = 10 * a;
return (u / b + func(u % b, b, n - 1));
}
int main() {
int n, a, b;
while (cin >> a >> b >> n) {
while (a >= b) {
a /= b;
}
cout << func(a, b, n) << endl;
}
retu... | #include <iostream>
using namespace std;
int func(int a, int b, int n) {
if (n == 0) {
return 0;
}
int u = 10 * a;
return (u / b + func(u % b, b, n - 1));
}
int main() {
int n, a, b;
while (cin >> a >> b >> n) {
a %= b;
cout << func(a, b, n) << endl;
}
return 0;
} | replace | 17 | 20 | 17 | 18 | TLE | |
p00055 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
double a;
while (cin >> a) {
double ans = 0;
ans += a;
for (int i = 2; i <= 10; i++) {
if (i % 2 == 0)
a *= 2;
else
a /= 3;
ans += a;
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
double a;
while (cin >> a) {
double ans = 0;
ans += a;
for (int i = 2; i <= 10; i++) {
if (i % 2 == 0)
a *= 2;
else
a /= 3;
ans += a;
... | replace | 20 | 21 | 20 | 21 | 0 | |
p00055 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(), vec.end()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
const ll INF = 1000000010;
const ll LINF = 4000000000000000010LL;
const int MAX = 310;
const double EPS = 1e-9;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, ... | #include <bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(), vec.end()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
const ll INF = 1000000010;
const ll LINF = 4000000000000000010LL;
const int MAX = 310;
const double EPS = 1e-9;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, ... | replace | 14 | 15 | 14 | 15 | TLE | |
p00055 | C++ | Time Limit Exceeded | #include <cstdio>
using namespace std;
int main() {
double a, S = 0.0;
while (scanf("%lf", &a)) {
S += a;
for (int i = 2; i <= 10; i++) {
if (i % 2)
a /= 3.0;
else
a *= 2.0;
S += a;
}
printf("%.8f\n", S);
}
return 0;
} | #include <cstdio>
using namespace std;
int main() {
double a;
while (scanf("%lf", &a) == 1) {
double S = a;
for (int i = 2; i <= 10; i++) {
if (i % 2)
a /= 3.0;
else
a *= 2.0;
S += a;
}
printf("%.8f\n", S);
}
return 0;
} | replace | 4 | 7 | 4 | 7 | TLE | |
p00055 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
... | replace | 20 | 22 | 20 | 21 | TLE | |
p00055 | C++ | Time Limit Exceeded | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double d[10];
double a;
while (cin >> a) {
d[0] = a;
d[1] = d[0] * 2;
for (int i = 2; i < 10; i + 2) {
d[i] = d[i - 1] / 3;
d[i + 1] = d[i] * 2;
}
int ca = 0;
for (int i = 0; i < 10; i++) {
ca += d[... | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double d[10];
double a;
while (cin >> a) {
d[0] = a;
d[1] = d[0] * 2;
d[2] = d[1] / 3;
d[3] = d[2] * 2;
d[4] = d[3] / 3;
d[5] = d[4] * 2;
d[6] = d[5] / 3;
d[7] = d[6] * 2;
d[8] = d[7] / 3;
d[9] = d[8]... | replace | 10 | 15 | 10 | 19 | TLE | |
p00055 | C++ | Time Limit Exceeded | #include <iomanip>
#include <iostream>
int main() {
while (true) {
double a;
std::cin >> a;
std::cout << std::fixed << std::setprecision(10) << a * 211 / 27
<< std::endl;
}
return 0;
}
| #include <iomanip>
#include <iostream>
int main() {
while (true) {
double a;
std::cin >> a;
if (std::cin.eof()) {
break;
}
std::cout << std::fixed << std::setprecision(10) << a * 211 / 27
<< std::endl;
}
return 0;
}
| insert | 6 | 6 | 6 | 9 | TLE | |
p00055 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
double a;
while (1) {
cin >> a;
printf("%.8f\n", 211.0 / 27.0 * a);
}
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
double a;
while (1) {
cin >> a;
if (cin.eof())
break;
printf("%.8f\n", 211.0 / 27.0 * a);
}
return 0;
} | insert | 8 | 8 | 8 | 10 | TLE | |
p00056 | C++ | Runtime Error |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, x, m;
x = 0;
m = 0;
vector<int> v;
scanf("%d", &n);
while (n) {
v.push_back(n);
if (n > x) {
x = n;
}
scanf("%d", &n);
m++;
}
vector<int> res;
vector<int> ... |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, x, m;
x = 0;
m = 0;
vector<int> v;
scanf("%d", &n);
while (n) {
v.push_back(n);
if (n > x) {
x = n;
}
scanf("%d", &n);
m++;
}
vector<int> res;
vector<int> ... | replace | 40 | 42 | 40 | 44 | 0 | |
p00056 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
bool is_prime[100000];
is_prime[0] = is_prime[1] = false;
for (int i = 2; i < 100000; i++) {
is_prime[i] = true;
}
for (int i = 2; i * i < 100000; i++) {
if (is_prime[i]) {
for (int j = i * i; j < 100000; j += i) {
is_prime[j] = fal... | #include <iostream>
using namespace std;
int main() {
bool is_prime[100000];
is_prime[0] = is_prime[1] = false;
for (int i = 2; i < 100000; i++) {
is_prime[i] = true;
}
for (int i = 2; i * i < 100000; i++) {
if (is_prime[i]) {
for (int j = i * i; j < 100000; j += i) {
is_prime[j] = fal... | replace | 27 | 36 | 27 | 31 | TLE | |
p00056 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
bool p[50000];
p[1] = false;
for (int i = 2; i < 50000; i++) {
p[i] = true;
}
for (int j = 2; j < 50000; j++) {
if (p[j]) {
for (int k = j * 2; k < 50000; k += j) {
p[k] = false;
}
}
}
int n;
while (cin >> n) {
if ... | #include <iostream>
using namespace std;
int main() {
bool p[50000];
p[1] = false;
for (int i = 2; i < 50000; i++) {
p[i] = true;
}
for (int j = 2; j < 50000; j++) {
if (p[j]) {
for (int k = j * 2; k < 50000; k += j) {
p[k] = false;
}
}
}
int n;
while (cin >> n) {
if ... | replace | 23 | 29 | 23 | 25 | TLE | |
p00056 | C++ | Time Limit Exceeded | #include <iostream>
#include <numeric>
using namespace std;
#define SIZE 50001
int main() {
bool prime[SIZE];
fill(prime, prime + SIZE, true);
prime[0] = prime[1] = false;
for (int i = 2; i * i < SIZE; i++) {
for (int j = 2; j * i < SIZE; j++) {
if (!prime[i * j])
continue;
prime[i * j... | #include <iostream>
#include <numeric>
using namespace std;
#define SIZE 50001
int main() {
bool prime[SIZE];
fill(prime, prime + SIZE, true);
prime[0] = prime[1] = false;
for (int i = 2; i * i < SIZE; i++) {
for (int j = 2; j * i < SIZE; j++) {
if (!prime[i * j])
continue;
prime[i * j... | replace | 24 | 35 | 24 | 27 | TLE | |
p00056 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int x[100000], y[100000], n, sum;
int main() {
for (int i = 2; i < 100000; i++) {
for (int j = 2; j <= sqrt(i); j++) {
if (i % j == 0) {
goto E;
}
}
x[i] = 1;
E:;
}
while (true) {
cin >> n;
sum = 0;
for (int i ... | #include <cmath>
#include <iostream>
using namespace std;
int x[100000], y[100000], n, sum;
int main() {
for (int i = 2; i < 100000; i++) {
for (int j = 2; j <= sqrt(i); j++) {
if (i % j == 0) {
goto E;
}
}
x[i] = 1;
E:;
}
while (true) {
cin >> n;
sum = 0;
if (!n) {
... | replace | 17 | 18 | 17 | 21 | TLE | |
p00056 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | replace | 55 | 57 | 55 | 57 | TLE | |
p00056 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <string.h>
using namespace std;
bool prime_check(int n) {
if (n == 1) {
return false;
}
if (n % 2 == 0) {
if (n == 2) {
return true;
}
else {
return false;
}
}
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
... | #include <cmath>
#include <iostream>
#include <string.h>
using namespace std;
bool prime_check(int n) {
if (n == 1) {
return false;
}
if (n % 2 == 0) {
if (n == 2) {
return true;
}
else {
return false;
}
}
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
... | replace | 32 | 33 | 32 | 33 | 0 | |
p00056 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | replace | 61 | 72 | 61 | 64 | TLE | |
p00056 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS 1
#include <algorithm>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define M_PI 3.141592
#define toRad 2.0 * M_P... | #define _CRT_SECURE_NO_WARNINGS 1
#include <algorithm>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define M_PI 3.141592
#define toRad 2.0 * M_P... | insert | 43 | 43 | 43 | 45 | TLE | |
p00056 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void sieve(int n, vector<char> &v) {
v.resize(n + 1);
fill(v.begin(), v.end(), true);
v[0] = v[1] = false;
for (int i = 2; i * i <= n; i++) {
if (v[i]) {
for (int j = i + i; j <= n; j += i) {
v[j] = false;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void sieve(int n, vector<char> &v) {
v.resize(n + 1);
fill(v.begin(), v.end(), true);
v[0] = v[1] = false;
for (int i = 2; i * i <= n; i++) {
if (v[i]) {
for (int j = i + i; j <= n; j += i) {
v[j] = false;
... | replace | 40 | 42 | 40 | 42 | TLE | |
p00056 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool a[60000]{};
int main() {
for (int b = 2; b < 60000; b++) {
if (!(a[b])) {
for (int c = b * 2; c <= 150000; c += b)
a[c] = true;
}
}
int e;
while (cin >> e, e) {
int... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool a[60000]{};
int main() {
for (int b = 2; b < 60000; b++) {
if (!(a[b])) {
for (int c = b * 2; c < 60000; c += b)
a[c] = true;
}
}
int e;
while (cin >> e, e) {
int s... | replace | 11 | 12 | 11 | 12 | -11 | |
p00056 | C++ | Time Limit Exceeded | // Goldbach's Conjecture
#include <bits/stdc++.h>
using namespace std;
vector<int> p;
int ans[50001];
void solve() {
int ret = 0;
for (int i = 0; i < p.size(); i++)
for (int j = i; j < p.size(); j++) {
if (p[i] + p[j] > 50000)
break;
ans[p[i] + p[j]]++;
}
}
int main() {
p.push_back(... | // Goldbach's Conjecture
#include <bits/stdc++.h>
using namespace std;
vector<int> p;
int ans[50001];
void solve() {
int ret = 0;
for (int i = 0; i < p.size(); i++)
for (int j = i; j < p.size(); j++) {
if (p[i] + p[j] > 50000)
break;
ans[p[i] + p[j]]++;
}
}
int main() {
p.push_back(... | insert | 35 | 35 | 35 | 37 | TLE | |
p00056 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
/** Problem0056 : Goldbach's Conjecture **/
#define MAX 50000
int main() {
bool prime[MAX];
int input, count;
for (int i = 0; i < MAX; i++)
prime[i] = true;
prime[0] = false;
prime[1] = false;
for (int i = 2; i < MAX; i++) {
if (prime[i]) {
for (int... | #include <iostream>
using namespace std;
/** Problem0056 : Goldbach's Conjecture **/
#define MAX 50000
int main() {
bool prime[MAX];
int input, count;
for (int i = 0; i < MAX; i++)
prime[i] = true;
prime[0] = false;
prime[1] = false;
for (int i = 2; i < MAX; i++) {
if (prime[i]) {
for (int... | replace | 29 | 38 | 29 | 32 | TLE | |
p00056 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int *data;
data = new int[50001];
data[0] = 0;
data[1] = 0;
data[2] = 1;
data[3] = 1;
for (int i = 3; i <= 50000; i++) {
int flag = 0;
for (int j = 3; j * j <= i; j += 2) {
if (i % j == 0) {
flag = 1;
break;
}
... | #include <iostream>
using namespace std;
int main() {
int *data;
data = new int[50001];
data[0] = 0;
data[1] = 0;
data[2] = 1;
data[3] = 1;
for (int i = 3; i <= 50000; i++) {
int flag = 0;
for (int j = 3; j * j <= i; j += 2) {
if (i % j == 0) {
flag = 1;
break;
}
... | replace | 50 | 51 | 50 | 51 | TLE | |
p00056 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (i... | replace | 49 | 56 | 49 | 52 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.