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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p00424 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, m, co[100] = {0}, i, j;
char a[100] = {0}, b[100] = {0}, c[100] = {0};
while (1) {
cin >> n;
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
co[i] = 1;
}
cin >> m;
for (j = 0; j < m; j+... | #include <iostream>
using namespace std;
int main(void) {
int n, m, co[1000] = {0}, i, j;
char a[1000] = {0}, b[1000] = {0}, c[100011] = {0};
while (1) {
cin >> n;
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
co[i] = 1;
}
cin >> m;
for (j = 0;... | replace | 2 | 5 | 2 | 5 | 0 | |
p00424 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
////////////////*My library*////////////////////////
#define rep_to(a, i, n) for (int i = a; i < n; i++)
#define rep(i, n) for (int i =... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
////////////////*My library*////////////////////////
#define rep_to(a, i, n) for (int i = a; i < n; i++)
#define rep(i, n) for (int i =... | replace | 33 | 34 | 33 | 34 | 0 | |
p00424 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int i, j, n, x, l;
char a[10000], b[10000], c[10000], m;
while (true) {
cin >> n;
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
cin >> x;
for (j = 0; j < x; j++) {
cin >> c[j];
}
f... | #include <iostream>
using namespace std;
int main() {
int i, j, n, x, l;
char a[100001], b[100001], c[100001], m;
while (true) {
cin >> n;
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
cin >> x;
for (j = 0; j < x; j++) {
cin >> c[j];
}
... | replace | 4 | 5 | 4 | 5 | 0 | |
p00424 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
for (;;) {
char henkan[1000][2];
char str[1000];
int n, m;
char temp;
bool flg = 0;
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> henkan[i][0] >> henkan[i][1];
}
/*
for(int i =... | #include <iostream>
using namespace std;
int main() {
for (;;) {
char henkan[100000][2];
char str[100000];
int n, m;
char temp;
bool flg = 0;
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> henkan[i][0] >> henkan[i][1];
}
/*
for(int... | replace | 6 | 8 | 6 | 8 | 0 | |
p00424 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
while (cin >> n) {
vector<vector<char>> c(n, vector<char>(2));
const int first = 0;
const int second = 1;
while (n--) {
cin >> c[n][first] >> c[n][second];
}
cin >> n;
char in;
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
while (cin >> n, n) {
vector<vector<char>> c(n, vector<char>(2));
const int first = 0;
const int second = 1;
while (n--) {
cin >> c[n][first] >> c[n][second];
}
cin >> n;
char in;
... | replace | 7 | 8 | 7 | 8 | TLE | |
p00424 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
using namespace std;
int main() {
int n;
char a, b;
map<char, char> list;
map<char, char>::iterator it;
while (1) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
list.insert(pair<char, char>(a, b));
}
cin >> n;
for (int i = 0; i < n;... | #include <iostream>
#include <map>
using namespace std;
int main() {
int n;
char a, b;
map<char, char> list;
map<char, char>::iterator it;
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> a >> b;
list.insert(pair<char, char>(a, b));
}
cin >> ... | insert | 11 | 11 | 11 | 13 | TLE | |
p00424 | C++ | Runtime Error | #include <stdio.h>
char hantei(char);
int n;
char chana[1000000000], chanb[1000000000];
int main() {
int i, j, m;
char w;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf(" %c %c", &chana[i], &chanb[i]);
}
scanf("%d", &m);
for (j = 0; j < m; ... | #include <stdio.h>
char hantei(char);
int n;
char chana[1000], chanb[1000];
int main() {
int i, j, m;
char w;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf(" %c %c", &chana[i], &chanb[i]);
}
scanf("%d", &m);
for (j = 0; j < m; j++) {
... | replace | 4 | 5 | 4 | 5 | -11 | |
p00424 | C++ | Runtime Error | #include <stdio.h>
int main() {
int n, i, j, m, f;
char a[256], b[256], x;
while (1) {
scanf("%d ", &n);
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
scanf("%c %c ", &a[i], &b[i]);
}
scanf("%d ", &m);
for (i = 0; i < m; i++) {
scanf("%s", &x);
f = 0;
... | #include <stdio.h>
int main() {
int n, i, j, m, f;
char a[256], b[256], x;
while (1) {
scanf("%d ", &n);
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
scanf("%c %c ", &a[i], &b[i]);
}
scanf("%d ", &m);
for (i = 0; i < m; i++) {
scanf("%s", &x);
f = 0;
... | replace | 26 | 27 | 26 | 27 | -11 | |
p00424 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
int m, n;
char cha[10000], con[10000], a[10000];
cin >> m;
if (m == 0)
break;
for (int i = 0; i < m; i++) {
cin >> cha[i] >> con[i];
}
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[... | #include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
int m, n;
char cha[100000], con[100000], a[100000];
cin >> m;
if (m == 0)
break;
for (int i = 0; i < m; i++) {
cin >> cha[i] >> con[i];
}
cin >> n;
for (int i = 0; i < n; i++) {
cin >>... | replace | 6 | 7 | 6 | 7 | 0 | |
p00424 | C++ | Memory Limit Exceeded | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
struct T {
unsigned char a, b;
};
T array[100000000];
int main() {
int n, m, i, j;
unsigned char a, b;
string ca, cb;
bool flag;
while (cin >> n && n) {
flag = true;
string out;
memset(array, 0, sizeof(array));
for... | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
struct T {
unsigned char a, b;
};
T array[1000000];
int main() {
int n, m, i, j;
unsigned char a, b;
string ca, cb;
bool flag;
while (cin >> n && n) {
flag = true;
string out;
memset(array, 0, sizeof(array));
for (... | replace | 7 | 8 | 7 | 8 | MLE | |
p00424 | C++ | Runtime Error | #include <stdio.h>
int main() {
int n, m;
int i, j;
char c[10000000][2];
char t[10000000];
int f;
while (scanf("%d", &n), n) {
for (i = 0; i < n; i++) {
scanf("%s", &c[i][0]);
scanf("%s", &c[i][1]);
}
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf(" %s", &t[i]);
}
... | #include <stdio.h>
int main() {
int n, m;
int i, j;
char c[1000000][2];
char t[1000000];
int f;
while (scanf("%d", &n), n) {
for (i = 0; i < n; i++) {
scanf("%s", &c[i][0]);
scanf("%s", &c[i][1]);
}
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf(" %s", &t[i]);
}
... | replace | 5 | 7 | 5 | 7 | -11 | |
p00424 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
char v[256];
int n, m;
int main() {
while (true) {
cin >> n;
for (int i = 32; i < 127; i++) {
v[i] = i;
}
for (int i = 0; i < n; i++) {
char p, q;
cin >> p >> q;
v[p] = q;
}
cin >> m;
for (int i = 0; i < m; i++) {
char ... | #include <iostream>
using namespace std;
char v[256];
int n, m;
int main() {
while (true) {
cin >> n;
for (int i = 32; i < 127; i++) {
v[i] = i;
}
if (n == 0)
break;
for (int i = 0; i < n; i++) {
char p, q;
cin >> p >> q;
v[p] = q;
}
cin >> m;
for (int i =... | insert | 10 | 10 | 10 | 12 | TLE | |
p00424 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
map<char, char> mp;
char a, b, c;
string x;
int n;
cin >> n;
do {
mp.clear();
n = 0;
x.clear();
do {
cin >> a >> b;
mp[a] = b;
} while (--n);
cin >> n;
do {
cin >> c;
... | #include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
map<char, char> mp;
char a, b, c;
string x;
int n;
cin >> n;
do {
mp.clear();
x.clear();
do {
cin >> a >> b;
mp[a] = b;
} while (--n);
cin >> n;
do {
cin >> c;
if (mp[c] !... | delete | 13 | 14 | 13 | 13 | TLE | |
p00424 | C++ | Runtime Error | #include <iostream>
#include <map>
using namespace std;
int main() {
int n, m;
string dic[100];
string words[100];
map<string, string> mp;
while (true) {
cin >> n;
if (n == 0) {
return 0;
}
string result = "";
for (int i = 0; i < n; i++) {
cin >> dic[i];
cin >> mp[dic[i]... | #include <iostream>
#include <map>
using namespace std;
int main() {
int n, m;
string dic[100000];
string words[100000];
map<string, string> mp;
while (true) {
cin >> n;
if (n == 0) {
return 0;
}
string result = "";
for (int i = 0; i < n; i++) {
cin >> dic[i];
cin >> mp[... | replace | 6 | 8 | 6 | 8 | 0 | |
p00424 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
while (1) {
char d;
char ans[101];
char f[101], g[101];
int n;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> d;
f[i] = d;
cin >> d;
g[i] = d;
}
int s;
cin >> s;
for (int ... | #include <iostream>
using namespace std;
int main() {
while (1) {
char d;
char ans[101000];
char f[1010000], g[101000];
int n;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> d;
f[i] = d;
cin >> d;
g[i] = d;
}
int s;
cin >> s;
... | replace | 5 | 7 | 5 | 7 | 0 | |
p00424 | C++ | Memory Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
std::string r1[100], r2[100], s[10000000];
int main() {
int n;
int m;
while (true) {
std::cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++)
std::cin >> r1[i] >> r2[i];
std::cin >> m;
for (int i = 0; i < m; i++)
st... | #include <iostream>
#include <string>
#include <vector>
std::string r1[100], r2[100], s[1000000];
int main() {
int n;
int m;
while (true) {
std::cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++)
std::cin >> r1[i] >> r2[i];
std::cin >> m;
for (int i = 0; i < m; i++)
std... | replace | 3 | 4 | 3 | 4 | MLE | |
p00424 | C++ | Runtime Error | #include <stdio.h>
int main() {
int n, m, i, j;
char nn[99999999], nm[99999999], mm[99999999];
while (1) {
scanf("%d", &n);
if (!n)
break;
for (i = 0; i < n; i++) {
scanf(" %c %c", &nn[i], &nm[i]);
}
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf(" %c", &mm[i]);
... | #include <stdio.h>
int main() {
int n, m, i, j;
char nn[1000000], nm[1000000], mm[1000000];
while (1) {
scanf("%d", &n);
if (!n)
break;
for (i = 0; i < n; i++) {
scanf(" %c %c", &nn[i], &nm[i]);
}
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf(" %c", &mm[i]);
for... | replace | 4 | 5 | 4 | 5 | -11 | |
p00424 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
string op;
while (cin >> n && n) {
char c1[40], c2[40];
op = "";
for (int i = 0; i < n; ++i)
cin >> c1[i] >> c2[i];
cin >> m;
for (int i = 0; i < m; ++i) {
char c;
cin >> c;
... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
string op;
while (cin >> n && n) {
char c1[100], c2[100];
op = "";
for (int i = 0; i < n; ++i)
cin >> c1[i] >> c2[i];
cin >> m;
for (int i = 0; i < m; ++i) {
char c;
cin >> c;... | replace | 9 | 10 | 9 | 10 | 0 | |
p00425 | C++ | Time Limit Exceeded | #import <cstdio>
int main() {
for (int n, a, t, c, r; c = r = scanf("%d", &n), n; printf("%d\n", r))
for (char d[] = "123456"; n--; r += *d - 48)
scanf("%s", &t), t %= 256,
t % 6 - 4 ? a = t % 5 + t % 2 * 2 + c & 3, t = *d,
*d = d[a += a / 2 ? 2 - a % 2 * 2 : 1], d[a] = d[5],... | #import <cstdio>
int main() {
for (int n, a, c, r, t; c = r = scanf("%d", &n), n; printf("%d\n", r))
for (char d[] = "123546", s[9]; n--; r += *d - 48)
scanf("%s", s), *s % 6 - 4 ? a = *s % 5 + *s % 2 * 2 + c & 3, t = *d,
*d = d[++a], d[++a - 1] = d[5],
... | replace | 2 | 8 | 2 | 8 | TLE | |
p00425 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <string.h>
int n;
char S[11234][6];
int dice[6] = {1, 2, 3, 5, 4, 6}, tmp = 0, ans = 0;
int main(void) {
while (true) {
ans = 0;
dice[0] = 1;
dice[1] = 2;
dice[2] = 3;
dice[3] = 5;
dice[4] = 4;
dice[5] = 6;
scanf("%d", &n);
// if (n == 0) { break; }
... | #include <stdio.h>
#include <string.h>
int n;
char S[11234][6];
int dice[6] = {1, 2, 3, 5, 4, 6}, tmp = 0, ans = 0;
int main(void) {
while (true) {
ans = 0;
dice[0] = 1;
dice[1] = 2;
dice[2] = 3;
dice[3] = 5;
dice[4] = 4;
dice[5] = 6;
scanf("%d", &n);
if (n == 0) {
break;
... | replace | 17 | 18 | 17 | 20 | TLE | |
p00425 | C++ | Time Limit Exceeded | #include <stdio.h>
typedef struct {
int U, W, E, S, N, D;
} dice_t;
int t;
void shoki(dice_t *dice) { // ダイスの初期位置
dice->U = 1;
dice->W = 4;
dice->E = 3;
dice->S = 2;
dice->N = 5;
dice->D = 6;
}
void N(dice_t *dice) {
t = dice->U;
dice->U = dice->S;
dice->S = dice->D;
dice->D = dice->N;
dice-... | #include <stdio.h>
typedef struct {
int U, W, E, S, N, D;
} dice_t;
int t;
void shoki(dice_t *dice) { // ダイスの初期位置
dice->U = 1;
dice->W = 4;
dice->E = 3;
dice->S = 2;
dice->N = 5;
dice->D = 6;
}
void N(dice_t *dice) {
t = dice->U;
dice->U = dice->S;
dice->S = dice->D;
dice->D = dice->N;
dice-... | replace | 76 | 77 | 76 | 77 | TLE | |
p00425 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <utility>
using namespace std;
#define DUMP(x) cerr << #x << " = " << (x) << endl;
void rotate(int *a, int *b, int *c, int *d) {
int temp;
temp = *d;
*d = *c;
*c = *b;
*b = *a;
*a = temp;
}
int main(int argc, char const *argv[]) {
int i, n, total;
strin... | #include <iostream>
#include <string>
#include <utility>
using namespace std;
#define DUMP(x) cerr << #x << " = " << (x) << endl;
void rotate(int *a, int *b, int *c, int *d) {
int temp;
temp = *d;
*d = *c;
*c = *b;
*b = *a;
*a = temp;
}
int main(int argc, char const *argv[]) {
int i, n, total;
strin... | delete | 55 | 57 | 55 | 55 | 0 | up = 2
total = 3
up = 6
total = 9
up = 4
total = 13
up = 2
total = 15
up = 6
total = 21
up = 3
total = 4
up = 2
total = 6
up = 2
total = 8
up = 6
total = 14
up = 6
total = 20
up = 4
total = 24
up = 4
total = 28
up = 6
total = 34
|
p00426 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int mp[5000000];
int Hash(string s) {
int cnt = 0, t = 1;
rep(i, s.size()) {
cnt += (int)(s[i] - '0') * t;
t *= 3;
}
return cnt;
}
int main() {
int n, m;
while (scanf("%d%d", &n, &m), n) {
memset(mp, 0, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int mp[15000000];
int Hash(string s) {
int cnt = 0, t = 1;
rep(i, s.size()) {
cnt += (int)(s[i] - '0') * t;
t *= 3;
}
return cnt;
}
int main() {
int n, m;
while (scanf("%d%d", &n, &m), n) {
memset(mp, 0,... | replace | 4 | 5 | 4 | 5 | 0 | |
p00427 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define Z 100001
using namespace std;
int d[Z + 1];
int main() {
int n, m, k, r, l;
while (true) {
cin >> n >> k >> m >> r;
if (!(n + m + k + r))
break;
rep(i, 0, Z) d[i] = 0;
k = 1, l = n;
rep(i, 0, ... | #include <algorithm>
#include <iostream>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define Z 10005
using namespace std;
int d[Z + 1];
int main() {
int n, m, k, r, l;
while (true) {
cin >> n >> k >> m >> r;
if (!(n + m + k + r))
break;
rep(i, 0, Z) d[i] = 0;
k = 1, l = n;
rep(i, 0, Z... | replace | 3 | 4 | 3 | 4 | TLE | |
p00427 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | replace | 19 | 20 | 19 | 20 | 0 | |
p00427 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int answer[10500];
void add_gyakusu(int x) {
int t = 1;
for (int i = 0; i < 10200; i++) {
answer[i] += t / x;
t %= x;
t *= 10;
}
}
void kuriagari() {
for (int i = 10199; i >= 0; i--) {
answer[i - 1] += answer[i] / 10;
answer[i]... | #include <algorithm>
#include <iostream>
using namespace std;
int answer[10500];
void add_gyakusu(int x) {
int t = 1;
for (int i = 0; i < 10200; i++) {
answer[i] += t / x;
t %= x;
t *= 10;
}
}
void kuriagari() {
for (int i = 10199; i >= 0; i--) {
answer[i - 1] += answer[i] / 10;
answer[i]... | replace | 31 | 32 | 31 | 32 | TLE | |
p00429 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
// sツづ個静ヲツ督ェツつゥツづァツづ個連ツ堕アツ青板づーツ陛板つキ
// sst ツづ按づァツ return 2
int f(string s) {
unsigned int count;
for (count = 1; count < s.size(); count++) {
if (s.at(count - 1) != s.at(count))
break;
}
return count;
}
int main() {
int n;
string str;
... | #include <iostream>
#include <string>
using namespace std;
// sツづ個静ヲツ督ェツつゥツづァツづ個連ツ堕アツ青板づーツ陛板つキ
// sst ツづ按づァツ return 2
int f(string s) {
unsigned int count;
for (count = 1; count < s.size(); count++) {
if (s.at(count - 1) != s.at(count))
break;
}
return count;
}
int main() {
int n;
string str;
... | replace | 28 | 29 | 28 | 29 | TLE | |
p00429 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int str[21][250];
int main() {
int n;
while (cin >> n, n) {
int a, r, cntlen;
char input[101];
cin >> input;
for (int i = 0;; i++) {
if (input[i] == '\0') {
str[0][i] = -1;
break;
}
str[0][i] = input[i] - ... | #include <cstdio>
#include <iostream>
using namespace std;
int str[21][100000];
int main() {
int n;
while (cin >> n, n) {
int a, r, cntlen;
char input[101];
cin >> input;
for (int i = 0;; i++) {
if (input[i] == '\0') {
str[0][i] = -1;
break;
}
str[0][i] = input[i]... | replace | 4 | 5 | 4 | 5 | 0 | |
p00429 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#define REP(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int n;
char str[21][10000];
int main(void) {
while (cin >> n, n != 0) {
cin >> str[0];
REP(i, 0, n) {
int j = 0;
int k = 0;
int len = strlen(str[i]);
while (k < len) {
... | #include <cstring>
#include <iostream>
#define REP(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int n;
char str[21][100000];
int main(void) {
while (cin >> n, n != 0) {
cin >> str[0];
REP(i, 0, n) {
int j = 0;
int k = 0;
int len = strlen(str[i]);
while (k < len) {
... | replace | 6 | 7 | 6 | 7 | 0 | |
p00429 | C++ | Runtime Error | #include <cstdlib>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
void reset_stringstream(stringstream &ss) {
ss.str("");
ss.clear(stringstream::goodbit);
}
int main() {
int n, count = 1, p = 0;
string str;
int r, a, x[10000];
int size;
stringstream ss;
string newstr;
... | #include <cstdlib>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
void reset_stringstream(stringstream &ss) {
ss.str("");
ss.clear(stringstream::goodbit);
}
int main() {
int n, count = 1, p = 0;
string str;
int r, a, x[100000];
int size;
stringstream ss;
string newstr;
... | replace | 14 | 15 | 14 | 15 | 0 | |
p00429 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main() {
int n;
char str[10000];
char tmp[10000];
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
scanf("%s", str);
while (n > 0) {
int i, j, len;
len = strlen(str);
memset(tmp, '\0', sizeof(tmp));
char c = '\0'... | #include <stdio.h>
#include <string.h>
int main() {
int n;
char str[100000];
char tmp[100000];
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
scanf("%s", str);
while (n > 0) {
int i, j, len;
len = strlen(str);
memset(tmp, '\0', sizeof(tmp));
char c = '\... | replace | 5 | 7 | 5 | 7 | 0 | |
p00429 | C++ | Time Limit Exceeded | #include <iostream>
#include <sstream>
#include <string>
using namespace std;
string itos(int t) {
ostringstream oss;
oss << t;
return oss.str();
}
string opr(string str) {
string res = "";
for (int i = 0; i < str.size();) {
int idx = i + 1;
while (idx < str.size() && str[i] == str[idx])
idx+... | #include <iostream>
#include <sstream>
#include <string>
using namespace std;
string itos(int t) {
ostringstream oss;
oss << t;
return oss.str();
}
string opr(string str) {
string res = "";
for (int i = 0; i < str.size();) {
int idx = i + 1;
while (idx < str.size() && str[i] == str[idx])
idx+... | insert | 19 | 19 | 19 | 20 | TLE | |
p00429 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int N;
string S;
string::iterator CountSeqStr(string::iterator start, string *s, int *n) {
*s = *start;
*n = 0;
string tmp;
for (; tmp = *start, tmp == *s && start != S.end(); ++start) {
(*n)++;
}
return --... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int N;
string S;
string::iterator CountSeqStr(string::iterator start, string *s, int *n) {
*s = *start;
*n = 0;
string tmp;
for (; tmp = *start, tmp == *s && start != S.end(); ++start) {
(*n)++;
}
return --... | replace | 26 | 27 | 26 | 27 | -11 | |
p00429 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, i;
char data[101];
char out[101];
char r;
int k, m;
char num[11] = "0123456789";
while (cin >> n) {
if (n == 0) {
break;
}
cin >> data;
for (int j = 0; j < n; j++) {
k = 0;
m = 1;
r = data[0];
for (i... | #include <iostream>
using namespace std;
int main() {
int n, i;
char data[2000001];
char out[2000001];
char r;
int k, m;
char num[11] = "0123456789";
while (cin >> n) {
if (n == 0) {
break;
}
cin >> data;
for (int j = 0; j < n; j++) {
k = 0;
m = 1;
r = data[0];
... | replace | 4 | 6 | 4 | 6 | 0 | |
p00429 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <string.h>
#define MAXLEN 1024
int main(void) {
int n;
char src[MAXLEN], *p, *q;
int ch, cnt;
while (scanf("%d", &n), n) {
scanf("%s", src);
for (int i = 0; i < n; i++) {
char buf[MAXLEN] = {0};
ch = *src;
cnt = 1;
q = buf;
for (p = src + 1; 1... | #include <stdio.h>
#include <string.h>
#define MAXLEN 65536
int main(void) {
int n;
char src[MAXLEN], *p, *q;
int ch, cnt;
while (scanf("%d", &n), n) {
scanf("%s", src);
for (int i = 0; i < n; i++) {
char buf[MAXLEN] = {0};
ch = *src;
cnt = 1;
q = buf;
for (p = src + 1; ... | replace | 3 | 4 | 3 | 4 | TLE | |
p00429 | C++ | Runtime Error | #include <stack>
#include <stdio.h>
using namespace std;
int main() {
char buf1[1000], buf2[1000], pre;
int n, p, count, tmp;
stack<int> S;
while (true) {
scanf("%d", &n);
if (n == 0)
break;
scanf("%s", buf1);
for (int i = 0; i < n; i++) {
p = count = 0;
if (i % 2 == 0) {
... | #include <stack>
#include <stdio.h>
using namespace std;
int main() {
char buf1[100000], buf2[100000], pre;
int n, p, count, tmp;
stack<int> S;
while (true) {
scanf("%d", &n);
if (n == 0)
break;
scanf("%s", buf1);
for (int i = 0; i < n; i++) {
p = count = 0;
if (i % 2 == 0)... | replace | 6 | 7 | 6 | 7 | 0 | |
p00429 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
char in[2][10001], key, temp[10001];
int n, now, cnt, wrt;
bool turn;
while (cin >> n && n) {
cin >> in[0];
turn = 1;
for (int i = 0; i < n; i++) {
turn = !turn;
now = 0;
wrt = 0;
w... | #include <cstdio>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
char in[2][100001], key, temp[100001];
int n, now, cnt, wrt;
bool turn;
while (cin >> n && n) {
cin >> in[0];
turn = 1;
for (int i = 0; i < n; i++) {
turn = !turn;
now = 0;
wrt = 0;
... | replace | 7 | 8 | 7 | 8 | 0 | |
p00429 | C++ | Runtime Error | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char ss[10000],
sst[10000]; // üÍpÆroßp̶ñzñ
int n, i, j, ki, a, b;
while (0 <= scanf("%d", &n)) {
if (n == 0)
break;
scanf(" %s ", ss);
while (n > 0) {
--n;
j = 0; // üͳ꽶ñ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char ss[100000],
sst[100000]; // üÍpÆroßp̶ñzñ
int n, i, j, ki, a, b;
while (0 <= scanf("%d", &n)) {
if (n == 0)
break;
scanf(" %s ", ss);
while (n > 0) {
--n;
j = 0; // üͳ꽶... | replace | 5 | 7 | 5 | 7 | 0 | |
p00429 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using... | #define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using... | replace | 43 | 44 | 43 | 45 | TLE | |
p00429 | C++ | Memory Limit Exceeded | #include <cstdio>
#include <cstring>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int n, num, cont, v;
string a, nex;
stringstream ss;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
cin >> a;
for (int i = 0; i < n; i++) {
co... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int n, num, cont, v;
string a, nex;
stringstream ss;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
cin >> a;
for (int i = 0; i < n; i++) {
co... | replace | 38 | 40 | 38 | 39 | MLE | |
p00430 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#de... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#de... | replace | 66 | 67 | 66 | 67 | -11 | |
p00430 | C++ | Time Limit Exceeded | #include <stdio.h>
int n, number[30];
void rec(int sum, int mins, int cnt) {
if (sum == n) {
for (int i = 0; i < cnt; i++) {
if (i) {
printf(" ");
}
printf("%d", number[i]);
}
printf("\n");
return;
}
for (int i = mins; i > 0; i++) {
if (sum + i > n)
continu... | #include <stdio.h>
int n, number[30];
void rec(int sum, int mins, int cnt) {
if (sum == n) {
for (int i = 0; i < cnt; i++) {
if (i) {
printf(" ");
}
printf("%d", number[i]);
}
printf("\n");
return;
}
for (int i = mins; i > 0; i--) {
if (sum + i > n)
continu... | replace | 18 | 19 | 18 | 19 | TLE | |
p00430 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | replace | 45 | 46 | 45 | 46 | 0 | |
p00431 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int n, g[101][101], g_size[101];
bool used[101];
int rec(int idx) {
int ret = 1;
for (int i = 0; i < g_size[idx]; i++) {
if (!used[g[idx][i]]) {
used[g[idx][i]] = true;
ret = max(ret, rec(g[idx][i]) + 1);
used[g[idx][i]] = false;
... | #include <algorithm>
#include <iostream>
using namespace std;
int n, g[101][101], g_size[101];
bool used[101];
int rec(int idx) {
int ret = 1;
for (int i = 0; i < g_size[idx]; i++) {
if (!used[g[idx][i]]) {
used[g[idx][i]] = true;
ret = max(ret, rec(g[idx][i]) + 1);
used[g[idx][i]] = false;
... | insert | 21 | 21 | 21 | 22 | TLE | |
p00431 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
bool d[101], dd[101]; // true = 使った。
int ans = 0;
int n;
vector<int> G[101];
int dfs(int from, int now) {
for (int i = 0; i < G[from].size(); i++) {
if (!d[G[from][i]]) {
d[G[from][i]] = true;
if (G[... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
bool d[101], dd[101]; // true = 使った。
int ans = 0;
int n;
vector<int> G[101];
int dfs(int from, int now) {
for (int i = 0; i < G[from].size(); i++) {
if (!d[G[from][i]]) {
d[G[from][i]] = true;
if (G[... | replace | 17 | 18 | 17 | 18 | TLE | |
p00431 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <time.h>
#define N 101
int find_length(int a, int cur_length);
int conn[N][N];
int used[N];
int main() {
int i, j;
int a, b;
int n;
int max_length, length;
time_t start_time, t;
while (1) {
start_time = time(NULL);
for (j = 0; j < N; j++) {
for (i = 0; i < N; i... | #include <stdio.h>
#include <time.h>
#define N 101
int find_length(int a, int cur_length);
int conn[N][N];
int used[N];
int main() {
int i, j;
int a, b;
int n;
int max_length, length;
time_t start_time, t;
while (1) {
start_time = time(NULL);
for (j = 0; j < N; j++) {
for (i = 0; i < N; i... | replace | 45 | 46 | 45 | 46 | TLE | |
p00431 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, t1, t2, i = 0;
int a[10] = {11, 19, 24, 10, 65, 9, 35, 51, 25, 20};
cin >> n;
while (n != 0) {
cin >> t1 >> t2;
cout << a[i] << endl;
i++;
cin >> n;
}
}
| #include <iostream>
using namespace std;
int main() {
int n, t1, t2, i = 0;
int a[10] = {11, 19, 24, 10, 65, 9, 35, 51, 25, 20};
cin >> n;
while (n != 0) {
for (int I = 0; I < n; I++)
cin >> t1 >> t2;
cout << a[i] << endl;
i++;
cin >> n;
}
}
| replace | 7 | 8 | 7 | 9 | -11 | |
p00432 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
int n, r;
vector<P> x[10002];
vector<P> xx[10002];
int main(void) {
while (cin >> n >> r && n) {
for (int i = 0; i < 10002; i++) {
x[i].... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
int n, r;
vector<P> x[10002];
vector<P> xx[10002];
int main(void) {
while (cin >> n >> r && n) {
for (int i = 0; i < 10002; i++) {
x[i].... | replace | 27 | 28 | 27 | 28 | 0 | |
p00432 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
struct Tag {
int a;
int b1, b2;
bool start;
Tag() : a(0), b1(0), b2(0), start(false) {}
Tag(int aa, int bb1, int bb2, bool s) : a(aa), b1(bb1), b2(bb2), start(s) {}
};
bool cmp(const Tag &t1, const Tag &t2) {... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
struct Tag {
int a;
int b1, b2;
bool start;
Tag() : a(0), b1(0), b2(0), start(false) {}
Tag(int aa, int bb1, int bb2, bool s) : a(aa), b1(bb1), b2(bb2), start(s) {}
};
bool cmp(const Tag &t1, const Tag &t2) {... | replace | 39 | 40 | 39 | 40 | 0 | |
p00432 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int dp[4001], p[4001];
typedef pair<int, pair<int, int>> Event;
int main() {
for (;;) {
int n, r;
cin >> n >> r;
if (!(n || r))
return 0;
map<int, vector<Event>> events;
int mx = 0, c = 0, area = 0, circumference =... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int dp[10001], p[10001];
typedef pair<int, pair<int, int>> Event;
int main() {
for (;;) {
int n, r;
cin >> n >> r;
if (!(n || r))
return 0;
map<int, vector<Event>> events;
int mx = 0, c = 0, area = 0, circumference... | replace | 6 | 7 | 6 | 7 | 0 | |
p00433 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
while (true) {
int a, b, c = 0, d = 0;
for (int i = 0; i < 4; i++) {
cin >> a;
c = c + a;
}
for (int i = 0; i < 4; i++) {
cin >> b;
d = d + b;
}
if (c < d)
cout << d << endl;
else {
cout << c << endl;... | #include <iostream>
using namespace std;
int main() {
int a, b, c = 0, d = 0;
for (int i = 0; i < 4; i++) {
cin >> a;
c = c + a;
}
for (int i = 0; i < 4; i++) {
cin >> b;
d = d + b;
}
if (c < d)
cout << d << endl;
else {
cout << c << endl;
}
return 0;
} | replace | 3 | 18 | 3 | 16 | TLE | |
p00433 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | replace | 19 | 20 | 19 | 20 | -6 | *** stack smashing detected ***: terminated
|
p00434 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int temp, a;
int t[31];
t[temp] = 0;
a = 0;
for (int i = 0; i < 31; i++) {
t[i] = 0;
}
for (int i = 0; i < 29; i++) {
cin >> temp;
t[temp] = 1;
}
for (temp = 1; temp <= 30; temp++) {
if (t[temp] == 0) {
cout << temp << end... | #include <iostream>
using namespace std;
int main(void) {
int temp, a;
int t[30];
a = 0;
for (int i = 0; i < 31; i++) {
t[i] = 0;
}
for (int i = 0; i < 29; i++) {
cin >> temp;
t[temp] = 1;
}
for (temp = 1; temp <= 30; temp++) {
if (t[temp] == 0) {
cout << temp << endl;
}
}
}
| replace | 4 | 6 | 4 | 5 | -11 | |
p00434 | C++ | Runtime Error | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
// #include <windows.h>
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
using namespace std;
typedef unsigned int uint;
typedef long long int llint;
typedef... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
// #include <windows.h>
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
using namespace std;
typedef unsigned int uint;
typedef long long int llint;
typedef... | replace | 346 | 347 | 346 | 347 | 0 | |
p00434 | C++ | Runtime Error | #include <stdio.h>
#define N 10
int main(void) {
int flg[N + 1];
int id;
for (int i = 1; i <= N; i++)
flg[i] = 0;
while (scanf("%d", &id) != EOF) {
flg[id] = 1;
}
for (int i = 1; i <= N; i++) {
if (flg[i] == 0)
printf("%d\n", i);
}
return 0;
} | #include <stdio.h>
#define N 30
int main(void) {
int flg[N + 1];
int id;
for (int i = 1; i <= N; i++)
flg[i] = 0;
while (scanf("%d", &id) != EOF) {
flg[id] = 1;
}
for (int i = 1; i <= N; i++) {
if (flg[i] == 0)
printf("%d\n", i);
}
return 0;
} | replace | 1 | 2 | 1 | 2 | -6 | *** stack smashing detected ***: terminated
|
p00434 | C++ | Runtime Error | #include <iostream>
#include <queue>
using namespace std;
int main(void) {
// Your code here!
int a, tf;
queue<int> h;
for (int i = 1; i <= 28; i++) {
cin >> a;
h.push(a);
}
for (int i = 1; i <= 30; i++) {
tf = 0;
for (int i2 = 1; i2 <= 28; i2++) {
a = h.front();
h.pop();
i... | #include <iostream>
#include <queue>
using namespace std;
int main(void) {
// Your code here!
int a, tf;
queue<int> h;
for (int i = 1; i <= 28; i++) {
cin >> a;
h.push(a);
}
for (int i = 1; i <= 30; i++) {
tf = 0;
for (int i2 = 1; i2 <= 28; i2++) {
if (h.empty())
break;
a... | insert | 14 | 14 | 14 | 16 | 0 | |
p00435 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int num;
char a[100], b[100];
int i, j;
for (i = 0;; i++) {
scanf("%c", &a[i]);
if (a[i] == '\n') {
break;
}
if (a[i] >= 'A' && a[i] <= 'C') {
b[i] = a[i] + 23;
} else {
b[i] = a[i] - 3;
}
prin... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int num;
char a[1000], b[1000];
int i, j;
for (i = 0;; i++) {
scanf("%c", &a[i]);
if (a[i] == '\n') {
break;
}
if (a[i] >= 'A' && a[i] <= 'C') {
b[i] = a[i] + 23;
} else {
b[i] = a[i] - 3;
}
pr... | replace | 5 | 6 | 5 | 6 | 0 | |
p00435 | C++ | Runtime Error | #include <stdio.h>
char *f(char *s) {
char *a = s;
for (; *s; s++)
*s = (*s - 42) % 26 + 65;
return a;
}
int main() {
char *s;
scanf("%s", s);
printf("%s\n", f(s));
} | #include <stdio.h>
char *f(char *s) {
char *a = s;
for (; *s; s++)
*s = (*s - 42) % 26 + 65;
return a;
}
int main() {
char s[1001];
scanf("%s", s);
printf("%s\n", f(s));
} | replace | 10 | 11 | 10 | 11 | 0 | |
p00435 | C++ | Time Limit Exceeded | #include <cstdio>
using namespace std;
int main() {
while (true) {
char a;
scanf("%c", &a);
if ('A' <= a && a <= 'Z') {
a = (a + 23 - 'A') % 26 + 'A';
printf("%c", a);
} else {
printf("%c", a);
}
}
return 0;
} | #include <cstdio>
using namespace std;
int main() {
while (true) {
char a;
scanf("%c", &a);
if ('A' <= a && a <= 'Z') {
a = (a + 23 - 'A') % 26 + 'A';
printf("%c", a);
} else {
printf("%c", a);
break;
}
}
return 0;
} | insert | 12 | 12 | 12 | 13 | TLE | |
p00435 | C++ | Runtime Error | #include <cstdio>
int main() {
char a[1000];
scanf("%s", &a);
for (int i = 0; a[i] != EOF; i++)
a[i] = 'A' + ((a[i] - 'A' + 3) % 26);
printf("%s", a);
return 0;
} | #include <cstdio>
int main() {
char c;
while (1) {
scanf("%c", &c);
if (c == '\n')
break;
if (c < 'D')
c = c + 26;
printf("%c", c - 3);
}
printf("\n");
return 0;
} | replace | 3 | 8 | 3 | 13 | 0 | |
p00435 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int i;
for (i = 0; i < str.size(); i++) {
if (str[i] < 'D')
str[i] = str[i] + 23;
else
str[i] = str[i] - 3;
}
for (i = 0; str.size(); i++)
cout << str[i];
cout << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int i;
for (i = 0; i < str.size(); i++) {
if (str[i] < 'D')
str[i] = str[i] + 23;
else
str[i] = str[i] - 3;
}
cout << str << endl;
return 0;
} | replace | 13 | 16 | 13 | 14 | -11 | |
p00436 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace ... | replace | 23 | 24 | 23 | 24 | 0 | |
p00436 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, m, n;
int i, j, k;
int arr[100];
int arr2[100];
cin >> a;
for (i = 0; i < 2 * a; i++)
arr[i] = i + 1;
cin >> m;
for (i = 0; i < m; i++) {
cin >> n;
if (n == 0) {
for (j = 0; j < a; j++) {
arr2[j * 2] = arr[j... | #include <iostream>
using namespace std;
int main() {
int a, m, n;
int i, j, k;
int arr[300];
int arr2[300];
cin >> a;
for (i = 0; i < 2 * a; i++)
arr[i] = i + 1;
cin >> m;
for (i = 0; i < m; i++) {
cin >> n;
if (n == 0) {
for (j = 0; j < a; j++) {
arr2[j * 2] = arr[j... | replace | 8 | 10 | 8 | 10 | 0 | |
p00436 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | replace | 76 | 77 | 76 | 77 | -6 | double free or corruption (!prev)
|
p00436 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
while (true) {
cin;
if (cin.fail())
break;
}
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> s(a * 2);
for (int x = 0; x < a * 2; x++) {
s[x] = x + 1;
}
int b;
cin >> b;
for (int c = 0; c < b; c++) {
int d;
cin >> d;
vector<int> e(a * 2);
for (int f = 0; f ... | replace | 6 | 10 | 6 | 40 | TLE | |
p00436 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int n;
vector<int> card, t, m;
void cut(int k) {
for (int i = 1, j = 0; i <= k; i++, j++)
t[j] = card[i];
for (int i = k + 1, j = 0; i <= 2 * n; i++, j++)
m[j] = card[i];
for (int i = 1, j = 0; i <= 2 * n - k + 1; i++, j++)
card[i] = m[j];
... | #include <iostream>
#include <vector>
using namespace std;
int n;
vector<int> card, t, m;
void cut(int k) {
for (int i = 1, j = 0; i <= k; i++, j++)
t[j] = card[i];
for (int i = k + 1, j = 0; i <= 2 * n; i++, j++)
m[j] = card[i];
for (int i = 1, j = 0; i <= 2 * n - k + 1; i++, j++)
card[i] = m[j];
... | replace | 33 | 36 | 33 | 36 | 0 | |
p00437 | C++ | Runtime Error | #include <cstdio>
using namespace std;
int main() {
int a, b, c, n, total, kind;
int rist[1000][3], ristsize;
int isacheced[101];
scanf("%d %d %d", &a, &b, &c);
while (a != 0 && b != 0 && c != 0) {
scanf("%d", &n);
total = a + b + c;
ristsize = 0;
for (int i = 0; i <= total; i++) {
... | #include <cstdio>
using namespace std;
int main() {
int a, b, c, n, total, kind;
int rist[1000][3], ristsize;
int isacheced[301];
scanf("%d %d %d", &a, &b, &c);
while (a != 0 && b != 0 && c != 0) {
scanf("%d", &n);
total = a + b + c;
ristsize = 0;
for (int i = 0; i <= total; i++) {
... | replace | 7 | 8 | 7 | 8 | 0 | |
p00437 | C++ | Runtime Error | #include <cstring>
#include <iostream>
int main() {
int a, b, c;
int N;
while (std::cin >> a >> b >> c, a | b | c) {
std::cin >> N;
int data[1024][4];
int check[128];
for (int i = 0; i < 101; i++)
check[i] = 2;
for (int i = 0; i < N; i++) {
scanf("%d%d%d%d", &data[i][0], &data[i][1... | #include <cstring>
#include <iostream>
int main() {
int a, b, c;
int N;
while (std::cin >> a >> b >> c, a | b | c) {
std::cin >> N;
int data[1024][4];
int check[301];
for (int i = 0; i < 301; i++)
check[i] = 2;
for (int i = 0; i < N; i++) {
scanf("%d%d%d%d", &data[i][0], &data[i][1... | replace | 8 | 10 | 8 | 10 | 0 | |
p00437 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define each(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define each(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define... | replace | 24 | 25 | 24 | 25 | 0 | |
p00437 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int a, b, c, n;
while (cin >> a >> b >> c >> n, a + b + c + n) {
vector<int> in(a + b + c + 1, 2);
vector<vector<int>> jud(n, vector<int>(4, 0));
for (int l = 0; l < n; l++) {
int i, j, k, r;
cin >> i >> j >> k >> ... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int a, b, c, n;
while (cin >> a >> b >> c, a + b + c) {
cin >> n;
vector<int> in(a + b + c + 1, 2);
vector<vector<int>> jud(n, vector<int>(4, 0));
for (int l = 0; l < n; l++) {
int i, j, k, r;
cin >> i >> j >> ... | replace | 7 | 8 | 7 | 9 | TLE | |
p00437 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for (int i = 1; i <= n; i++)
struct test {
int i, j, k;
};
vector<test> t;
int p[302];
int main() {
int a, b, c, n, i, j, k, r;
while (cin >> a >> b >> c) {
cin >> n;
t.clear();
loop(i, a + b + c) p[i] = 2;
loop(h, n) {
cin ... | #include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for (int i = 1; i <= n; i++)
struct test {
int i, j, k;
};
vector<test> t;
int p[302];
int main() {
int a, b, c, n, i, j, k, r;
while (cin >> a >> b >> c) {
cin >> n;
t.clear();
loop(i, a + b + c) p[i] = 2;
loop(h, n) {
cin ... | replace | 20 | 21 | 20 | 21 | 0 | |
p00437 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(a, b, c) for (int a = b; a < c; a++)
using namespace std;
int con[1001 * 2];
int an[1001];
int ans[1001];
int main() {
while (1) {
rep(i, 0, 1001) ans[i] = 2;
int a, b, c;
cin >> a >> b >> c;
if (a == 0 && b == 0 && c == 0)
break;
int n;
cin >> n;
... | #include <bits/stdc++.h>
#define rep(a, b, c) for (int a = b; a < c; a++)
using namespace std;
int con[3003];
int an[1001];
int ans[1001];
int main() {
while (1) {
rep(i, 0, 1001) ans[i] = 2;
int a, b, c;
cin >> a >> b >> c;
if (a == 0 && b == 0 && c == 0)
break;
int n;
cin >> n;
rep... | replace | 3 | 4 | 3 | 4 | 0 | |
p00437 | C++ | Runtime Error | #include <iostream>
using namespace std;
int ans[500];
int a, b, c, N;
int r[1000], x[1000], y[1000], z[1000];
void init() {
for (int i = 0; i < 2000; i++)
ans[i] = 2;
}
int main() {
while (cin >> a >> b >> c && a && b && c) {
init();
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i]... | #include <iostream>
using namespace std;
int ans[500];
int a, b, c, N;
int r[1000], x[1000], y[1000], z[1000];
void init() {
for (int i = 0; i < 500; i++)
ans[i] = 2;
}
int main() {
while (cin >> a >> b >> c && a && b && c) {
init();
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i] ... | replace | 6 | 7 | 6 | 7 | 0 | |
p00437 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
while (true) {
int parts[301], d[301][3], g[1000];
int a, b, c, N;
cin >> a >> b >> c;
if (a == 0 && b == 0 && c == 0)
break;
cin >> N;
for (int i = 1; i <= a + b + c; i++) {
parts[i] = 2;
}
for (int i = 0; i < N; i++) {... | #include <iostream>
using namespace std;
int main() {
while (true) {
int parts[301], d[1000][3], g[1000];
int a, b, c, N;
cin >> a >> b >> c;
if (a == 0 && b == 0 && c == 0)
break;
cin >> N;
for (int i = 1; i <= a + b + c; i++) {
parts[i] = 2;
}
for (int i = 0; i < N; i++) ... | replace | 4 | 5 | 4 | 5 | TLE | |
p00437 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
vector<int> ans;
bool check(vector<int> v) {
int count = 0, no;
for (int i = 0; i < 3; ++i)
if (ans[v[i]] != 1) {
no = v[i];
++count;
}
if (count > 1)
return false;
else if (count == 0) {
cout << "ERROR" << endl;
ret... | #include <iostream>
#include <vector>
using namespace std;
vector<int> ans;
bool check(vector<int> v) {
int count = 0, no;
for (int i = 0; i < 3; ++i)
if (ans[v[i]] != 1) {
no = v[i];
++count;
}
if (count > 1)
return false;
else if (count == 0) {
cout << "ERROR" << endl;
ret... | replace | 62 | 71 | 62 | 66 | TLE | |
p00437 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define INF 100000005
#define MAX 100001
#define mp make_pair
#define pb push_back
#define fi first
#define se second
using namespac... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define INF 100000005
#define MAX 100001
#define mp make_pair
#define pb push_back
#define fi first
#define se second
using namespac... | insert | 20 | 20 | 20 | 22 | TLE | |
p00437 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, b, c;
while (cin >> a >> b >> c, a, b, c) {
int q[350];
for (int i = 0; i < a + b + c; i++)
q[i] = 2;
int n;
cin >> n;
int z = 0;
int ls[350][3];
for (int i = 0; i < n; i++) {
int d, e, f, g;
cin >> d >> e ... | #include <iostream>
using namespace std;
int main() {
int a, b, c;
while (cin >> a >> b >> c, a, b, c) {
int q[350];
for (int i = 0; i < a + b + c; i++)
q[i] = 2;
int n;
cin >> n;
int z = 0;
int ls[1200][5];
for (int i = 0; i < n; i++) {
int d, e, f, g;
cin >> d >> e... | replace | 13 | 14 | 13 | 14 | 0 | |
p00437 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
constexpr int MOD = 1000000007;
constexpr int INF = 2000000000;
using namespace std;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
constexpr int MOD = 1000000007;
constexpr int INF = 2000000000;
using namespace std;
... | replace | 19 | 21 | 19 | 21 | 0 | |
p00438 | C++ | Runtime Error | #include <iostream>
using namespace std;
int a, b, n;
struct cross {
bool isbuilding;
int access;
};
cross map[16][16];
void read() {
cin >> n;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
map[i][j].isbuilding = false;
map[i][j].access = 0;
}
}
for (int i = 0; i < n; i+... | #include <iostream>
using namespace std;
int a, b, n;
struct cross {
bool isbuilding;
int access;
};
cross map[100][100];
void read() {
cin >> n;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
map[i][j].isbuilding = false;
map[i][j].access = 0;
}
}
for (int i = 0; i < n; ... | replace | 8 | 9 | 8 | 9 | 0 | |
p00438 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int a, b, x, y;
while (std::cin >> a >> b) {
if (a == 0 && b == 0) {
break;
}
std::vector<std::vector<int>> road(a, std::vector<int>(b, 1));
int num = 0;
std::cin >> num;
for (int i = 0; i < num; ++i) {
... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int a, b, x, y;
while (std::cin >> a >> b) {
if (a == 0 && b == 0) {
break;
}
std::vector<std::vector<int>> road(a, std::vector<int>(b, 1));
int num = 0;
std::cin >> num;
for (int i = 0; i < num; ++i) {
... | replace | 20 | 21 | 20 | 21 | 0 | |
p00438 | C++ | Runtime Error | #include <iostream>
#include <vector>
int main() {
while (1) {
int a, b;
std::cin >> a >> b;
if (a == 0 && b == 0)
break;
int n;
std::cin >> n;
std::vector<std::vector<int>> dp(a, std::vector<int>(b, 0));
for (int i = 0; i != n; ++i) {
int c, d;
std::cin >> c >> d;
... | #include <iostream>
#include <vector>
int main() {
while (1) {
int a, b;
std::cin >> a >> b;
if (a == 0 && b == 0)
break;
int n;
std::cin >> n;
std::vector<std::vector<int>> dp(a, std::vector<int>(b, 0));
for (int i = 0; i != n; ++i) {
int c, d;
std::cin >> c >> d;
... | replace | 25 | 35 | 25 | 31 | 0 | |
p00438 | C++ | Runtime Error |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#includ... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#includ... | replace | 90 | 98 | 90 | 126 | 0 | d = 0
|
p00438 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
const double PI = 3.14159265358979323846;
int map[1001][1001];
int w, h;
int f(int x, int y) {
if ((map[x][y] == -1) || (x < 0) || (y < 0) || (w <= x) || (h <= y)) {
return 0;
}
if ((x == 0) && (y == 0)) {
return 1;
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
const double PI = 3.14159265358979323846;
int map[16][16];
int w, h;
int f(int x, int y) {
if ((map[x][y] == -1) || (x < 0) || (y < 0) || (w <= x) || (h <= y)) {
return 0;
}
if ((x == 0) && (y == 0)) {
return 1;
}
if (... | replace | 8 | 9 | 8 | 9 | 0 | |
p00438 | C++ | Runtime Error | #include <iostream>
#include <vector>
int main() {
int a, b;
while (std::cin >> a >> b) {
if (a == 0 && b == 0)
break;
int n;
std::cin >> n;
std::vector<std::vector<int>> map(a, std::vector<int>(b, 1)); // 地図
for (int i = 0; i < n; ++i) {
int x, y;
std::cin >> x >> y;
... | #include <iostream>
#include <vector>
int main() {
int a, b;
while (std::cin >> a >> b) {
if (a == 0 && b == 0)
break;
int n;
std::cin >> n;
std::vector<std::vector<int>> map(a, std::vector<int>(b, 1)); // 地図
for (int i = 0; i < n; ++i) {
int x, y;
std::cin >> x >> y;
... | replace | 26 | 27 | 26 | 27 | 0 | |
p00439 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
int num[100005];
while (cin >> n >> k && n && k) {
for (int i = 0; i < n; i++)
cin >> num[i];
int ans = 0;
for (int i = 0; i < n - k + 1; i++) {
int sum = 0;
for (int j = 0; j < k; j++) {
su... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
int num[100005];
while (cin >> n >> k && n && k) {
for (int i = 0; i < n; i++)
cin >> num[i];
int ans = 0;
for (int i = 0; i < k; i++)
ans += num[i];
int sum = ans;
for (int i = 1; i < n - k + 1; ... | replace | 11 | 16 | 11 | 17 | TLE | |
p00439 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, k;
int a[100000];
while (cin >> n >> k) {
if (n == 0 && k == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int max = a[0];
for (int i = 0; i <= n - k; i++) {
int t = 0;
int l = 0;
fo... | #include <iostream>
using namespace std;
int main() {
int n, k;
int a[100000];
while (cin >> n >> k) {
if (n == 0 && k == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int max = a[0];
int t = 0;
for (int i = 0; i < k; i++) {
t += a[i];
}
if (t... | replace | 17 | 29 | 17 | 29 | TLE | |
p00439 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, k, input[5000];
while (cin >> n >> k, n | k) {
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> input[i];
if (i < k)
sum += input[i];
}
int i, j, ans = sum;
i = 0;
j = k - 1;
whil... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, k, input[100000];
while (cin >> n >> k, n | k) {
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> input[i];
if (i < k)
sum += input[i];
}
int i, j, ans = sum;
i = 0;
j = k - 1;
wh... | replace | 6 | 7 | 6 | 7 | 0 | |
p00439 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int a[100010], n, k;
while (cin >> n >> k, n || k) {
for (int i = 0; i < n; i++)
cin >> a[i];
int mx = -1;
for (int i = 0; i <= n - k; i++) {
int sum = 0;
for (int j = i; j < i + k; j++)
sum += a[j];
mx = max(mx, sum);... | #include <iostream>
using namespace std;
int main() {
int a[100010], n, k;
while (cin >> n >> k, n || k) {
for (int i = 0; i < n; i++)
cin >> a[i];
int mx = -1;
int sum = 0;
for (int i = 0; i < k; i++)
sum += a[i];
mx = sum;
for (int i = k; i < n; i++) {
sum -= a[i - k];
... | replace | 8 | 12 | 8 | 15 | TLE | |
p00439 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N, K;
int a[10001];
void solve() {
for (int i = 0; i < N; i++) {
scanf("%d", &a[i + 1]);
a[i + 1] += a[i];
}
int ma = 0;
for (int i = K; i <= N; i++)
ma = max(ma, a[i] - a[i - K]);
printf("%d\n", ma);
}
int main() {
while (scanf("%d%d", &N, &K)... | #include <bits/stdc++.h>
using namespace std;
int N, K;
int a[100001];
void solve() {
for (int i = 0; i < N; i++) {
scanf("%d", &a[i + 1]);
a[i + 1] += a[i];
}
int ma = 0;
for (int i = K; i <= N; i++)
ma = max(ma, a[i] - a[i - K]);
printf("%d\n", ma);
}
int main() {
while (scanf("%d%d", &N, &K... | replace | 4 | 5 | 4 | 5 | 0 | |
p00439 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int n, k;
cin >> n >> k;
if (n == 0 && k == 0) {
break;
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int s = 0;
int m = 0;
while (s + 2 < n) {
int cm = 0;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int n, k;
cin >> n >> k;
if (n == 0 && k == 0) {
break;
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int s = 0;
int m = 0;
while (s + k - 1 < n) {
int cm =... | replace | 17 | 18 | 17 | 18 | 0 | |
p00439 | 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;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
const int mod = 100000;
struct Mod {
public:
int num;
Mod() : Mod(0) { ; }
Mod(long long... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
const int mod = 100000;
struct Mod {
public:
int num;
Mod() : Mod(0) { ; }
Mod(long long... | insert | 87 | 87 | 87 | 89 | TLE | |
p00439 | C++ | Runtime Error | // Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
type... | // Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
type... | replace | 43 | 44 | 43 | 44 | 0 | |
p00439 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int in, k;
while (cin >> in >> k) {
if (in == 0 && k == 0)
break;
int data[in];
int sum;
for (int i = 0; i < in; i++) {
cin >> data[i];
}
for (int i = 0; i <= in - k; i++) {
int tmp = 0;
for (int j = i; j < i... | #include <iostream>
using namespace std;
int main() {
int in, k;
while (cin >> in >> k) {
if (in == 0 && k == 0)
break;
int data[in];
int sum;
for (int i = 0; i < in; i++) {
cin >> data[i];
}
int tmp = 0;
for (int i = 0; i < k; i++) {
tmp += data[i];
}
su... | replace | 18 | 23 | 18 | 30 | TLE | |
p00439 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> sum;
int n, m, x, max;
while (cin >> n >> m, n || m) {
cin >> x;
sum.push_back(0);
sum.push_back(x);
max = -1000000;
for (int i = 2; i <= n; i++) {
cin >> x;
sum.push_back(sum[i - 1] + x);
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> sum;
int n, m, x, max;
while (cin >> n >> m, n || m) {
cin >> x;
sum.push_back(0);
sum.push_back(x);
max = -1000000;
for (int i = 2; i <= n; i++) {
cin >> x;
sum.push_back(sum[i - 1] + x);
}
... | replace | 15 | 16 | 15 | 16 | 0 | |
p00439 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
int n, k;
int sum = 0, mx = 0;
int ans[10000] = {0};
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++)
cin >> ans[i];
for (int i = 0;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
int n, k;
int sum = 0, mx = 0;
int ans[100000] = {0};
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++)
cin >> ans[i];
for (int i = 0... | replace | 9 | 10 | 9 | 10 | 0 | |
p00439 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
int N, M;
int lis[20000];
cin >> N >> M;
if (N == 0 && M == 0)
break;
for (int i = 0; i < N; i++)
cin >> lis[i];
int now = 0, ans = 0;
for (int i = 0; i < M... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
int N, M;
int lis[100002];
cin >> N >> M;
if (N == 0 && M == 0)
break;
for (int i = 0; i < N; i++)
cin >> lis[i];
int now = 0, ans = 0;
for (int i = 0; i < ... | replace | 8 | 9 | 8 | 9 | 0 | |
p00439 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
int main(void) {
int n, k;
while (cin >> n >> k, n + k) {
vector<int> a(n);
rep(i, n) cin >> a[i];
int ret = -100000;
rep(i, n - k + 1) {
int sum = 0;
rep(j, k) { sum += a[i + j];... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
int main(void) {
int n, k;
while (cin >> n >> k, n + k) {
vector<int> a(n);
rep(i, n) cin >> a[i];
int ret = -100000;
int sum = 0;
rep(i, k) sum += a[i];
for (int i = k; i < n; i++) {... | replace | 14 | 17 | 14 | 18 | TLE | |
p00439 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int ans = 0, n, k, box[10000] = {0}, sum = 0;
;
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 0; i < k; i++) {
cin >> box[i];
sum += box[i];
}
ans = sum;
for (int i = k; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int ans = 0, n, k, box[100005] = {0}, sum = 0;
;
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 0; i < k; i++) {
cin >> box[i];
sum += box[i];
}
ans = sum;
for (int i = k; i < n; i++) {
... | replace | 4 | 5 | 4 | 5 | 0 | |
p00439 | C++ | Runtime Error | #include <iostream>
const int MAX_N = 1 << 17, INF = 1 << 24;
class SegmentTree {
public:
SegmentTree(int _n) {
n = 1;
while (n < _n)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++) {
data[i] = 0;
}
}
void add(int k, int a) {
k += n - 1;
data[k] = a;
while (k > 0) {
k ... | #include <iostream>
const int MAX_N = 1 << 18, INF = 1 << 24;
class SegmentTree {
public:
SegmentTree(int _n) {
n = 1;
while (n < _n)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++) {
data[i] = 0;
}
}
void add(int k, int a) {
k += n - 1;
data[k] = a;
while (k > 0) {
k ... | replace | 2 | 3 | 2 | 3 | 0 | |
p00439 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
int a[10000];
int main() {
int n, k;
while (cin >> n >> k && n && k) {
for (i... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
int a[1000000];
int main() {
int n, k;
while (cin >> n >> k && n && k) {
for ... | replace | 14 | 15 | 14 | 15 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.