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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p00728 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
void remove_minmax(vector<int> &data) {
int max = 0;
int min = 1000000;
int min_i = 0;
int max_i = 0;
int count = 0;
vector<int>::iterator it = data.begin();
while (it != data.end()) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
void remove_minmax(vector<int> &data) {
int max = 0;
int min = 1000000;
int min_i = 0;
int max_i = 0;
int count = 0;
vector<int>::iterator it = data.begin();
while (it != data.end()) {
... | replace | 35 | 36 | 35 | 36 | 255 | |
p00728 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int in, a, maxer = 0, miner = 1000;
int sum = 0;
int i = 0;
double ave = 0.0;
while (scanf("%d", &in) != 0) {
for (i = 0; i < in; i++) {
cin >> a;
maxer = max(a, maxer);
miner =... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int in, a, maxer = 0, miner = 1000;
int sum = 0;
int i = 0;
double ave = 0.0;
while (cin >> in, in) {
for (i = 0; i < in; i++) {
cin >> a;
maxer = max(a, maxer);
miner = min(a, ... | replace | 11 | 12 | 11 | 12 | TLE | |
p00728 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
#define S 20
int main(void) {
int a[S];
int i;
int n, max, min, sum = 0;
for (;;) {
max = 0, min = 1000, sum = 0;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
if ... | #include <cstdio>
#include <iostream>
#define S 100
int main(void) {
int a[S];
int i;
int n, max, min, sum = 0;
for (;;) {
max = 0, min = 1000, sum = 0;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
if... | replace | 2 | 3 | 2 | 3 | TLE | |
p00728 | C++ | Runtime Error |
#include <algorithm>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ALL(g) (g).begin(), (g).end()
#d... |
#include <algorithm>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ALL(g) (g).begin(), (g).end()
#d... | replace | 33 | 34 | 33 | 34 | -11 | |
p00728 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, s[120], count;
;
while (true) {
cin >> n;
count = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
count += s[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; j > i; j--) {
if (s[j]... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, s[120], count;
;
while (true) {
cin >> n;
if (n == 0)
break;
count = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
count += s[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = n - 1; j... | insert | 8 | 8 | 8 | 10 | TLE | |
p00728 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
while (1) {
int judge;
int maxscore = 0;
int minscore = 0;
cin >> judge;
if (judge != 0) {
int score[judge];
for (int i = 0; i < judge; i++) {
cin >> score[i];
if (score[i] > maxscore) {
maxscore = score[i]... | #include <iostream>
using namespace std;
int main() {
while (1) {
int judge;
int maxscore = 0;
int minscore = 0;
cin >> judge;
if (judge != 0) {
int score[judge];
for (int i = 0; i < judge; i++) {
cin >> score[i];
if (score[i] > maxscore) {
maxscore = score[i]... | replace | 28 | 29 | 28 | 30 | TLE | |
p00728 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, a[21], b[21];
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int max = 0, min = 10001;
for (int i = 0; i < n; i++) {
if (max < a[i]) {
max = a[i];
}
if... | #include <iostream>
using namespace std;
int main() {
int n, a[101], b[101];
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int max = 0, min = 10001;
for (int i = 0; i < n; i++) {
if (max < a[i]) {
max = a[i];
}
... | replace | 4 | 5 | 4 | 5 | TLE | |
p00728 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n[100];
int max[2] = {0, -1}, min[2] = {1000, -1}, sum = 0;
int m;
while (true) {
cin >> m;
max[0] = 0;
max[1] = -1;
min[0] = 1000;
min[1] = -1;
sum = 0;
for (int i = 0; i < m; i++) {
cin >> n[i];
if (n[i] > max[0... | #include <iostream>
using namespace std;
int main() {
int n[100];
int max[2] = {0, -1}, min[2] = {1000, -1}, sum = 0;
int m;
while (true) {
cin >> m;
if (m == 0) {
break;
}
max[0] = 0;
max[1] = -1;
min[0] = 1000;
min[1] = -1;
sum = 0;
for (int i = 0; i < m; i++) {
... | insert | 9 | 9 | 9 | 12 | TLE | |
p00728 | C++ | Runtime Error | #include <cstdio>
int main() {
int n, s[20], i;
int max, min, ava, sum;
while (1) {
max = 0;
min = 1000;
sum = 0;
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
if (max < s[i]) {
max = s[i];
}
if (min > s[i]) ... | #include <cstdio>
int main() {
int n, s[100], i;
int max, min, ava, sum;
while (1) {
max = 0;
min = 1000;
sum = 0;
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
if (max < s[i]) {
max = s[i];
}
if (min > s[i])... | replace | 2 | 3 | 2 | 3 | 0 | |
p00728 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[21], t;
while (cin >> n && n) {
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
t = 0;
for (int i = 1; i < n - 1; i++) {
t += a[i];
}
cout << (t / (n - 2)) << endl;
}
ret... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[101], t;
while (cin >> n && n) {
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
t = 0;
for (int i = 1; i < n - 1; i++) {
t += a[i];
}
cout << (t / (n - 2)) << endl;
}
re... | replace | 6 | 7 | 6 | 7 | 0 | |
p00728 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
int point[20], average;
while (1) {
average = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> point[i];
}
sort(point, point + n);
for (int i = 1; i < n - 1; i++) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
int point[100], average;
while (1) {
average = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> point[i];
}
sort(point, point + n);
for (int i = 1; i < n - 1; i++) {
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00728 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i =... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i =... | replace | 26 | 27 | 26 | 30 | TLE | |
p00728 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (true) {
int n;
cin >> n;
vector<int> v;
int a;
rep(i, n) {
cin >> a;
v.push_back... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (true) {
int n;
cin >> n;
if (n == 0)
break;
vector<int> v;
int a;
rep(i, n) {
... | insert | 13 | 13 | 13 | 15 | TLE | |
p00728 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long i64;
int main() {
while (true) {
int n;
vector<int> a;
cin >> n;
rep(i, n) {
int b;
cin >> b;
a.push_back(b);
}
sort... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long i64;
int main() {
while (true) {
int n;
vector<int> a;
cin >> n;
if (n == 0)
break;
rep(i, n) {
int b;
cin >> b;
a... | insert | 10 | 10 | 10 | 12 | TLE | |
p00729 | C++ | Runtime Error | #include <functional>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define MAX 1010
#include <queue>
using namespace std;
typedef pair<int, int> P;
int main() {
int e, q, t, n, m, s, p;
while (cin >> e >> q, e || q) {
vector<P> tab[MAX];
cin >> p;
for (int i = 0; i < p; i++) {
... | #include <functional>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define MAX 10010
#include <queue>
using namespace std;
typedef pair<int, int> P;
int main() {
int e, q, t, n, m, s, p;
while (cin >> e >> q, e || q) {
vector<P> tab[MAX];
cin >> p;
for (int i = 0; i < p; i++) {
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00729 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespa... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespa... | replace | 53 | 55 | 53 | 55 | MLE | |
p00729 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define int long long
typedef pair<int, int> P;
//-----------------------------------------------------------------------
int N, M, R, Q;
int A[1005][1005]; // 生徒番号,時間
signed main() {
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define int long long
typedef pair<int, int> P;
//-----------------------------------------------------------------------
int N, M, R, Q;
int A[10000][1005]; // 生徒番号,時間
signed main() {... | replace | 11 | 12 | 11 | 12 | 0 | |
p00729 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
#define FOR(k, m, n) for (int(k) = (m); (k) < (n); (k)++)
#define REP(i, n) FOR((i), 0, (n))
#defi... | #include <algorithm>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
#define FOR(k, m, n) for (int(k) = (m); (k) < (n); (k)++)
#define REP(i, n) FOR((i), 0, (n))
#defi... | replace | 54 | 55 | 54 | 55 | 0 | ========================================================================================== |
p00729 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) { // start
int N, M, r;
// N；PC数 M；学生数
cin >> N >> M;
if (N == 0 and M == 0)
break;
cin >> r;
// 学生数、 時間
int data[1004][721];
for (int j = 0; j < 1004; j++) {
for (int k = 0; k < 721; k++)
data[... | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) { // start
int N, M, r;
// N；PC数 M；学生数
cin >> N >> M;
if (N == 0 and M == 0)
break;
cin >> r;
// 学生数、 時間
int data[10004][721];
for (int j = 0; j < 10004; j++) {
for (int k = 0; k < 721; k++)
dat... | replace | 14 | 16 | 14 | 16 | 0 | |
p00729 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define int long long
#define MOD7 1000000007
#define... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD7 1000000007
#define MOD9 1000000009
#def... | delete | 16 | 17 | 16 | 16 | MLE | |
p00729 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | replace | 44 | 45 | 44 | 45 | MLE | |
p00729 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
int n[1001][723] = {};
int main() {
int N, M;
while (1) {
cin >> N >> M;
if (N == 0 && M == 0)
break;
int r;
cin >> r;
for (int i = 0; i <= M; i++)
for (int j = 0; j < 722; j++)
n[i][j] = 0;
for (int i = 0; i... | #include <iostream>
#include <stdio.h>
using namespace std;
int n[10001][723] = {};
int main() {
int N, M;
while (1) {
cin >> N >> M;
if (N == 0 && M == 0)
break;
int r;
cin >> r;
for (int i = 0; i <= M; i++)
for (int j = 0; j < 722; j++)
n[i][j] = 0;
for (int i = 0; ... | replace | 4 | 5 | 4 | 5 | 0 | |
p00729 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main(void) {
int N, M, r, t, n, m, s, log[17][721], q, ts, tg, i, j, k, flag[17], count;
;
while (1) {
scanf("%d%d", &N, &M);
if (N == 0 && M == 0)
break;
memset(log, 0, sizeof(log));
scanf("%d", &r);
for (i = 0; i < r; i++) {
scanf("%d%d... | #include <stdio.h>
#include <string.h>
int main(void) {
int N, M, r, t, n, m, s, log[1000][721], q, ts, tg, i, j, k, flag[1000],
count;
;
while (1) {
scanf("%d%d", &N, &M);
if (N == 0 && M == 0)
break;
memset(log, 0, sizeof(log));
scanf("%d", &r);
for (i = 0; i < r; i++) {
s... | replace | 4 | 5 | 4 | 6 | 0 | |
p00729 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, m, r, q;
static int cnt[1000][1261];
while (cin >> n >> m, n) {
for (int i = 0; i < m; i++) {
for (int j = 0; j <= 1260; j++)
cnt[i][j] = 0;
}
cin >> r;
for (int i = 0; i < r; i++) {
int t, a, b, s;
cin >> t >>... | #include <iostream>
using namespace std;
int main() {
int n, m, r, q;
static int cnt[10000][1261];
while (cin >> n >> m, n) {
for (int i = 0; i < m; i++) {
for (int j = 0; j <= 1260; j++)
cnt[i][j] = 0;
}
cin >> r;
for (int i = 0; i < r; i++) {
int t, a, b, s;
cin >> t >... | replace | 5 | 6 | 5 | 6 | 0 | |
p00729 | C++ | Memory Limit Exceeded | #include <cstring>
#include <iostream>
using namespace std;
int students[10001][800] = {};
int numlogin[10001] = {};
int sum[10001][800] = {};
int main() {
while (1) {
int N, M, r;
cin >> N >> M;
if (!N and !M)
break;
cin >> r;
memset(students, 0, sizeof(students));
memset(numlogin, ... | #include <cstring>
#include <iostream>
using namespace std;
int students[10001][750] = {};
int numlogin[10001] = {};
int sum[10001][800] = {};
int main() {
while (1) {
int N, M, r;
cin >> N >> M;
if (!N and !M)
break;
cin >> r;
memset(students, 0, sizeof(students));
memset(numlogin, ... | replace | 4 | 5 | 4 | 5 | MLE | |
p00729 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#def... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#def... | replace | 29 | 30 | 29 | 30 | 0 | |
p00729 | C++ | Runtime Error | /* 2012-08-20T10:52:03 */
#define DEBUG_ON_
#define CONDITION true
using namespace std; /*{{{*/
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterato... | /* 2012-08-20T10:52:03 */
#define DEBUG_ON_
#define CONDITION true
using namespace std; /*{{{*/
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterato... | replace | 194 | 195 | 194 | 195 | 0 | |
p00729 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <complex>
#include <cassert>
#include <funct... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <complex>
#include <cassert>
#include <funct... | replace | 29 | 30 | 29 | 30 | 0 | |
p00730 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#in... | replace | 69 | 70 | 69 | 70 | 0 | |
p00730 | C++ | Runtime Error | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(uniqu... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(uniqu... | replace | 66 | 67 | 66 | 67 | 0 | |
p00730 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using n... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using n... | delete | 56 | 57 | 56 | 56 | 0 | |
p00730 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (a)-1; i >= b; i--)
#define chmi... | #include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (a)-1; i >= b; i--)
#define chmi... | delete | 104 | 105 | 104 | 104 | 0 | hey!
hey!
hey!
|
p00730 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX 100
typedef struct {
int width;
int height;
} CAKE;
bool operator<(const CAKE &left, const CAKE &right) {
return left.width * left.height < right.width * right.height;
}
int main() {
int n, w, d;
while (cin >> n >> w >> d, n || w || d) {
vecto... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100
typedef struct {
int width;
int height;
} CAKE;
bool operator<(const CAKE &left, const CAKE &right) {
return left.width * left.height < right.width * right.height;
}
int main() {
int n, w, d;
while (cin >> n >> w >> d, n || w || d) {
vecto... | replace | 57 | 58 | 57 | 58 | -6 | 0b346c96-21e9-4801-8339-f356e78c4449.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p00730/C++/s358081830.cpp:29: int main(): Assertion `s!=cake[p].width' failed.
|
p00730 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
bool larger(pair<int, int> &a, pair<int, int> &b) {
return a.first * a.second < b.first * b.second;
}
int main() {
while (1) {
int n, w, d;
cin >> n >> w >> d;
if (w == 0)
break;
vector<pair<i... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
bool larger(pair<int, int> &a, pair<int, int> &b) {
return a.first * a.second < b.first * b.second;
}
int main() {
while (1) {
int n, w, d;
cin >> n >> w >> d;
if (w == 0)
break;
vector<pair<i... | replace | 32 | 33 | 32 | 33 | 0 | |
p00730 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(n) for (int i = 0; i < n; i++)
#define repp(j, n) for (int j = 0; j < n; j... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(n) for (int i = 0; i < n; i++)
#define repp(j, n) for (int j = 0; j < n; j... | replace | 108 | 109 | 108 | 109 | -11 | |
p00730 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for (int i = 0; i < (n); i++)
#define Rrep(i, a, n) for (int i = (a); i < (n); i++)
#define All(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef p... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for (int i = 0; i < (n); i++)
#define Rrep(i, a, n) for (int i = (a); i < (n); i++)
#define All(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef p... | replace | 33 | 35 | 33 | 34 | 0 | |
p00731 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <queue>
#include <tuple>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
char s[100][100];
int d[100][100][2];
int dx[2][9] = {{1, 1, 1, 1, 1, 2, 2, 2, 3},
{-1, -1, -1, -1, -1, -2, -2, -2, -... | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <queue>
#include <tuple>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
char s[100][100];
int d[100][100][2];
int dx[2][9] = {{1, 1, 1, 1, 1, 2, 2, 2, 3},
{-1, -1, -1, -1, -1, -2, -2, -2, -... | replace | 61 | 62 | 61 | 62 | 0 | |
p00731 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define inf 1 << 30
using namespace std;
class State {
public:
int h, w, leg, cost;
State(int a, int b, int c, int d) : h(a), w(b), leg(c), cost(d) {}
bool operator<(State s) const { return cost < s.cost; }
};
int w, h;
char s[100][100];
int dp[100][100][2] = {};
// a ... | #include <bits/stdc++.h>
#define inf 1 << 30
using namespace std;
class State {
public:
int h, w, leg, cost;
State(int a, int b, int c, int d) : h(a), w(b), leg(c), cost(d) {}
bool operator<(State s) const { return s.cost < cost; }
};
int w, h;
char s[100][100];
int dp[100][100][2] = {};
// a ... | replace | 8 | 9 | 8 | 9 | TLE | |
p00731 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#de... | replace | 40 | 42 | 40 | 42 | 0 | |
p00731 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const int INF = 1 << 29;
const double EPS = 1e-8;
typedef vector<int> vec;
typedef pair<int, int> P;
typedef long long ll;
struct State {
int y, x, lr, c;
State(int y, int x, int lr, int c) : y(y), x(x), lr(lr), c(c) {}
bool operato... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const int INF = 1 << 29;
const double EPS = 1e-8;
typedef vector<int> vec;
typedef pair<int, int> P;
typedef long long ll;
struct State {
int y, x, lr, c;
State(int y, int x, int lr, int c) : y(y), x(x), lr(lr), c(c) {}
bool operato... | replace | 23 | 25 | 23 | 25 | 0 | |
p00731 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define MOD 1000000007
#define ADD(X, Y) ((X) = ((X) + (Y) % MOD) % MOD)
typedef long long i64;
typedef vector<int> ivec;
typedef vector<string> svec;
typedef pair<int, int> pi;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define MOD 1000000007
#define ADD(X, Y) ((X) = ((X) + (Y) % MOD) % MOD)
typedef long long i64;
typedef vector<int> ivec;
typedef vector<string> svec;
typedef pair<int, int> pi;
... | replace | 74 | 75 | 74 | 75 | TLE | |
p00731 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> p;
typedef pair<p, p> P;
char mp[30][60];
int w, h;
int cal() {
bool used[2][60][30] = {};
int dx[9] = {1, 1, 1, 1, 1, 2, 2, 2, 3},
dy[9] = {2, 1, 0, -1, -2, 1, 0, -1, 0};
priority_queue<P, vector<P>, greater<P>> q;
for (int i = 0; i < w... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> p;
typedef pair<p, p> P;
char mp[60][30];
int w, h;
int cal() {
bool used[2][60][30] = {};
int dx[9] = {1, 1, 1, 1, 1, 2, 2, 2, 3},
dy[9] = {2, 1, 0, -1, -2, 1, 0, -1, 0};
priority_queue<P, vector<P>, greater<P>> q;
for (int i = 0; i < ... | replace | 4 | 5 | 4 | 6 | 0 | |
p00731 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
char s[60][60], buf[2];
int d[60][60][60][60][2];
struct st {
int lx, ly, rx,... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
char s[60][30], buf[2];
int d[60][30][60][30][2];
struct st {
int lx, ly, rx,... | replace | 10 | 12 | 10 | 12 | MLE | |
p00731 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <... | replace | 55 | 56 | 55 | 56 | TLE | |
p00734 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n = 0, m = 1;
int a[n], b[m], x = 0, y = 0;
int p, q;
while (1) {
cin >> n >> m;
x = 0;
y = 0;
p = -1;
q = -1;
if (0 == n + m)
break;
for (int i = 0; i < n; i++) {
cin >> a[i];
x += a[i... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n = 0, m = 1;
int a[101], b[101], x = 0, y = 0;
int p, q;
while (1) {
cin >> n >> m;
x = 0;
y = 0;
p = -1;
q = -1;
if (0 == n + m)
break;
for (int i = 0; i < n; i++) {
cin >> a[i];
x +=... | replace | 6 | 7 | 6 | 7 | 0 | |
p00734 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v), end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v), end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typ... | replace | 24 | 25 | 24 | 25 | 0 | |
p00734 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, m, sumN = 0, sumM = 0, ii = -1, jj = -1, flag = 0;
int N[100], M[100];
while (1) {
cin >> n;
cin >> m;
for (int i = 0; i < n; ++i) {
cin >> N[i];
sumN += N[i];
}
for (int i = 0; i < m; ++i) {
cin >> M[i];
su... | #include <iostream>
using namespace std;
int main() {
int n, m, sumN = 0, sumM = 0, ii = -1, jj = -1, flag = 0;
int N[100], M[100];
while (1) {
cin >> n;
cin >> m;
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; ++i) {
cin >> N[i];
sumN += N[i];
}
for (int i = 0; i ... | insert | 10 | 10 | 10 | 12 | TLE | |
p00734 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#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;
typedef long long ll;
typedef pair<int, int> ... | #include <algorithm>
#include <bitset>
#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;
typedef long long ll;
typedef pair<int, int> ... | replace | 32 | 33 | 32 | 33 | 0 | |
p00734 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (m == 0)
break;
int t[n], h[n];
for (int i = 0; i < n; i++)
cin >> t[i];
for (int i = 0; i < m; i++)
cin >> h[i];
int sumt = 0, sumh = 0;
for (int i = 0; i < n; i++)
... | #include <iostream>
using namespace std;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (m == 0)
break;
int t[n], h[m];
for (int i = 0; i < n; i++)
cin >> t[i];
for (int i = 0; i < m; i++)
cin >> h[i];
int sumt = 0, sumh = 0;
for (int i = 0; i < n; i++)
... | replace | 10 | 11 | 10 | 11 | 0 | |
p00734 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define All(X) X.begin(), X.end()
#define FOR... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define All(X) X.begin(), X.end()
#define FOR... | insert | 26 | 26 | 26 | 28 | TLE | |
p00734 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <ve... | replace | 37 | 38 | 37 | 38 | 0 | |
p00734 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
while (true) {
cin >> n >> m;
vector<int> a(n);
vector<int> b(n);
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
while (true) {
cin >> n >> m;
vector<int> a(n);
vector<int> b(m);
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin ... | replace | 12 | 13 | 12 | 13 | 0 | |
p00734 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
typedef pair<int, int> P;
int main() {
int n, m;
while (cin >> n >> m && n) {
int sum = 0;
vector<int> p(n), q(n);... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
typedef pair<int, int> P;
int main() {
int n, m;
while (cin >> n >> m && n) {
int sum = 0;
vector<int> p(n), q(m);... | replace | 11 | 12 | 11 | 12 | 0 | |
p00734 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ... | delete | 64 | 65 | 64 | 64 | 0 | > "#" = #
> "#" = #
> "#" = #
> "#" = #
> "#" = #
|
p00734 | C++ | Runtime Error | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main() {
int n, m, mi, mih, mit;
while (cin >> n >> m && n && m) {
vector<int> taro(n);
vector<int> hanako(n);
int t = 0, h = 0;
for (int i = 0; i < n; i++) {
cin >> taro[i];
t += taro[i];
}
for (... | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main() {
int n, m, mi, mih, mit;
while (cin >> n >> m && n && m) {
vector<int> taro(n);
vector<int> hanako(m);
int t = 0, h = 0;
for (int i = 0; i < n; i++) {
cin >> taro[i];
t += taro[i];
}
for (... | replace | 9 | 10 | 9 | 10 | 0 | |
p00734 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int d, m, n, t[51], h[51];
while (1) {
int st = 0, sh = 0, mint = 101;
cin >> n >> m;
if (n == 0 && m == 0)
return 0;
for (int i = 0; i < n; i++)
cin >> t[i]... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int d, m, n, t[101], h[101];
while (1) {
int st = 0, sh = 0, mint = 101;
cin >> n >> m;
if (n == 0 && m == 0)
return 0;
for (int i = 0; i < n; i++)
cin >> t[... | replace | 9 | 10 | 9 | 10 | 0 | |
p00734 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | replace | 74 | 75 | 74 | 75 | 0 | |
p00734 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
while (1) {
cin >> n >> m;
if (n == 0 && m == 0)
break;
int i, j, temp = 0, k, count = 0;
int t[n], h[m], sum1 = 0, sum2 = 0;
int d... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
while (1) {
cin >> n >> m;
if (n == 0 && m == 0)
break;
int i, j, temp = 0, k, count = 0;
int t[n], h[m], sum1 = 0, sum2 = 0;
int d... | replace | 16 | 17 | 16 | 17 | 0 | |
p00734 | C++ | Time Limit Exceeded | #include "algorithm"
#include "cmath"
#include "iomanip"
#include "iostream"
#include "map"
#include "set"
#include "string"
using namespace std;
#define TEST 1
#if TEST
FILE *in = freopen("./Q/question.txt", "r", stdin);
FILE *out = freopen("./A/answer.txt", "w", stdout);
#endif
int main() {
int n, m;
while (tru... | #include "algorithm"
#include "cmath"
#include "iomanip"
#include "iostream"
#include "map"
#include "set"
#include "string"
using namespace std;
#define TEST 0
#if TEST
FILE *in = freopen("./Q/question.txt", "r", stdin);
FILE *out = freopen("./A/answer.txt", "w", stdout);
#endif
int main() {
int n, m;
while (tru... | replace | 9 | 10 | 9 | 10 | TLE | |
p00734 | C++ | Time Limit Exceeded |
#include "iostream"
using namespace std;
int main() {
while (1) {
int n, m, t[100], h[100], sumt = 0, sumh = 0, mint = 101, minh = 101;
cin >> n >> m;
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; i++) {
cin >> t[i];
sumt += t[i];
}
for (int i = 0; i < m; i++) {
... |
#include "iostream"
using namespace std;
int main() {
while (1) {
int n, m, t[100], h[100], sumt = 0, sumh = 0, mint = 101, minh = 101;
cin >> n >> m;
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; i++) {
cin >> t[i];
sumt += t[i];
}
for (int i = 0; i < m; i++) {
... | replace | 18 | 19 | 18 | 19 | TLE | |
p00734 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n && m) {
int sum1 = 0, sum2 = 0;
int s1[50], s2[50];
int a = 1e8, b = 1e8;
for (int i = 0; i < n; i++)
cin >> s1[i], sum1 += s1[i];
for (int i = 0; i < m; i++)
cin >> s2[i], sum2 += s2[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n && m) {
int sum1 = 0, sum2 = 0;
int s1[100], s2[100];
int a = 1e8, b = 1e8;
for (int i = 0; i < n; i++)
cin >> s1[i], sum1 += s1[i];
for (int i = 0; i < m; i++)
cin >> s2[i], sum2 += s2[i];... | replace | 7 | 8 | 7 | 8 | 0 | |
p00735 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
#define TEST 0
#if TEST
FILE *in = freopen("./Q.txt", "r", stdin);
FILE *out = freopen("./A.txt", "w", stdout);
#endif
#define MAXN 300000
vector<int> MSPrimes;
bool isNotMSPrime[MAXN];
void calMSPrime(int n) {
for (int i ... | #include <cstdio>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
#define TEST 0
#if TEST
FILE *in = freopen("./Q.txt", "r", stdin);
FILE *out = freopen("./A.txt", "w", stdout);
#endif
#define MAXN 300000
vector<int> MSPrimes;
bool isNotMSPrime[MAXN];
void calMSPrime(int n) {
for (int i ... | replace | 18 | 19 | 18 | 19 | 0 | |
p00735 | C++ | Runtime Error | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
#define FOR(i, init, n) for (int i = init; i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define MON 1
#define SAT 6
int isPrime(int cand) {
// int i, limit;
int limit = sqrt(cand);
// limit = (int)sqrt((double)cand);
int i = limit... | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
#define FOR(i, init, n) for (int i = init; i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define MON 1
#define SAT 6
int isPrime(int cand) {
// int i, limit;
int limit = sqrt(cand);
// limit = (int)sqrt((double)cand);
int i = limit... | replace | 101 | 102 | 101 | 102 | -8 | |
p00735 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
bool a[300001];
int main() {
vector<int> p;
p.push_back(6);
for (int i = 1; i <= 50000; i++) {
a[6 * i] = 1;
}
for (int i = 1; 7 * i + 1 <= 300000; i++) {
if (a[7 * i + 1] == 0) {
p.push_back(7 * i + 1);
for (int j = 7 * i + 1; ... | #include <iostream>
#include <vector>
using namespace std;
bool a[500001];
int main() {
vector<int> p;
p.push_back(6);
for (int i = 1; i <= 50000; i++) {
a[6 * i] = 1;
}
for (int i = 1; 7 * i + 1 <= 300000; i++) {
if (a[7 * i + 1] == 0) {
p.push_back(7 * i + 1);
for (int j = 7 * i + 1; ... | replace | 5 | 6 | 5 | 6 | 0 | |
p00735 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG_MODE
#define DBG(n) n;
#else
#define DBG(n) ;
#endif
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define rep(i, s, g) for (ll(i) = (s); (i) < (g); ++i)
#define rrep(i, s, g) for (ll(i) = (s); i >= (g); --(i))
#define PB push_back
#define MP make_pair
... | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG_MODE
#define DBG(n) n;
#else
#define DBG(n) ;
#endif
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define rep(i, s, g) for (ll(i) = (s); (i) < (g); ++i)
#define rrep(i, s, g) for (ll(i) = (s); i >= (g); --(i))
#define PB push_back
#define MP make_pair
... | replace | 60 | 61 | 60 | 61 | TLE | |
p00735 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (i... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (i... | replace | 41 | 42 | 41 | 42 | TLE | |
p00735 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
const int size = 300000;
bool a[size] = {false};
std::vector<int> MS;
void eratos() {
for (int i = 6; i < size; i++)
a[i] = true;
for (int i = 6; i < size; i++) {
if (a[i] && (i % 7 == 1 || i % 7 == 6)) {
MS.push_back(i);
for (int j = i + i; j < size;... | #include <iostream>
#include <vector>
const int size = 300000;
bool a[size] = {false};
std::vector<int> MS;
void eratos() {
for (int i = 6; i < size; i++)
a[i] = true;
for (int i = 6; i < size; i++) {
if (a[i] && (i % 7 == 1 || i % 7 == 6)) {
MS.push_back(i);
for (int j = i + i; j < size;... | replace | 47 | 48 | 47 | 48 | TLE | |
p00735 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define r(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int a[200000], c = 0, n;
r(i, 3, 300000) if (i % 7 == 1 || i % 7 == 6) {
int p = 1;
if (i > 10 && (i % 6 == 0 || i % 8 == 0))
continue;
r(k, 0, c) if (i % a[k] == 0) p = 0;
if (p)
a[... | #include <bits/stdc++.h>
#define r(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int a[200000], c = 0, n;
r(i, 3, 300000) if (i % 7 == 1 || i % 7 == 6) {
int p = 1;
if (i > 10 && (i % 6 == 0 || i % 8 == 0))
continue;
r(k, 0, c) if (i % a[k] == 0) p = 0;
if (p)
a[... | delete | 13 | 14 | 13 | 13 | TLE | |
p00736 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
#define FOR(k, m, n) for (int(k) = (m); (k) < (n); (k)++)
#define REP(i, n) FOR((i), 0, (n))
#defi... | #include <algorithm>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
#define FOR(k, m, n) for (int(k) = (m); (k) < (n); (k)++)
#define REP(i, n) FOR((i), 0, (n))
#defi... | replace | 103 | 104 | 103 | 104 | 0 | |
p00736 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
string repr(string s, int p, int q, int r) {
int tmp;
string s_tmp = s;
while ((tmp = s_tmp.find("P")) >= 0) {
s_tmp.replace(s_tmp.find("P"), 1, to_string(p));
}
while ((tmp = s_tmp.find("Q")) >= 0) {
s_tmp.replace(s_tmp.find("Q"), 1, to_str... | #include <iostream>
#include <string>
using namespace std;
string repr(string s, int p, int q, int r) {
int tmp;
string s_tmp = s;
while ((tmp = s_tmp.find("P")) >= 0) {
s_tmp.replace(s_tmp.find("P"), 1, to_string(p));
}
while ((tmp = s_tmp.find("Q")) >= 0) {
s_tmp.replace(s_tmp.find("Q"), 1, to_str... | replace | 89 | 92 | 89 | 91 | 0 | |
p00736 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define State string::const_iterator
class ParseError {};
int expression(State &begin);
// int term(State &begin);
int number(State &begin);
int factor(State &begin);
int denial(State &begin);
void consume(State &begin, char expected);
int p, q, r;
string input;
// 四則演算の... | #include <bits/stdc++.h>
using namespace std;
#define State string::const_iterator
class ParseError {};
int expression(State &begin);
// int term(State &begin);
int number(State &begin);
int factor(State &begin);
int denial(State &begin);
void consume(State &begin, char expected);
int p, q, r;
string input;
// 四則演算の... | replace | 61 | 62 | 61 | 62 | 0 | |
p00736 | C++ | Time Limit Exceeded | // #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#def... | // #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#def... | replace | 74 | 75 | 74 | 76 | TLE | |
p00736 | C++ | Runtime Error | // Header {{{
// includes {{{
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | // Header {{{
// includes {{{
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | replace | 383 | 385 | 383 | 385 | -6 | e22d4083-1a69-458d-8061-fc50ae1ad9a6.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p00736/C++/s372000287.cpp:254: int Parser::formula(): Assertion `false' failed.
|
p00736 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
// #define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
// #define int long long
#define DBG 0
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | replace | 5 | 6 | 5 | 6 | 0 | s.substr(k) (0*0)
k 0
s.substr(k) 0*0)
k 1
a 0
op *
s.substr(k) 0)
k 3
b 0
s.substr(k) (0*0)
k 0
s.substr(k) 0*0)
k 1
a 0
op *
s.substr(k) 0)
k 3
b 0
s.substr(k) (0*0)
k 0
s.substr(k) 0*0)
k 1
a 0
op *
s.substr(k) 0)
k 3
b 0
s.substr(k) (0*1)
k 0
s.substr(k) 0*1)
k 1
a 0
op *
s.substr(k) 1)
k 3
b 1
s.substr(k) (0*1)
k ... |
p00737 | C++ | Runtime Error | #include <iostream>
#include <queue>
using namespace std;
int W, H;
int inf = 1e9;
int dx[4] = {0, -1, 0, 1}, dy[4] = {1, 0, -1, 0};
int dp[21][21][4] = {};
int S[21][21] = {};
int C[4] = {};
struct state {
int x, y, direction, dist;
bool operator<(const state &right) const { return dist > right.dist; }
void go... | #include <iostream>
#include <queue>
using namespace std;
int W, H;
int inf = 1e9;
int dx[4] = {0, -1, 0, 1}, dy[4] = {1, 0, -1, 0};
int dp[31][31][4] = {};
int S[31][31] = {};
int C[4] = {};
struct state {
int x, y, direction, dist;
bool operator<(const state &right) const { return dist > right.dist; }
void go... | replace | 7 | 9 | 7 | 9 | 0 | |
p00737 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LOG(...) printf(__VA_... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LOG(...) printf(__VA_... | replace | 94 | 95 | 94 | 95 | 0 | |
p00737 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> v... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> v... | replace | 54 | 55 | 54 | 55 | TLE | |
p00737 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#define N_MAX 30
#define INF (1e9)
using namespace std;
void dijkstra();
int w, h, data[N_MAX][N_MAX], d[N_MAX][N_MAX][4], c[4];
int dy[4] = {-1, 0, 1, 0};
int dx[4] = {0, 1, 0, -1};
typedef struct stu {
int mincost, y, x, dir;
bool operator<(const stu &righ... | #include <algorithm>
#include <iostream>
#include <queue>
#define N_MAX 30
#define INF (1e9)
using namespace std;
void dijkstra();
int w, h, data[N_MAX][N_MAX], d[N_MAX][N_MAX][4], c[4];
int dy[4] = {-1, 0, 1, 0};
int dx[4] = {0, 1, 0, -1};
typedef struct stu {
int mincost, y, x, dir;
bool operator<(const stu &righ... | replace | 12 | 13 | 12 | 13 | TLE | |
p00737 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
#define REP(i, N) for (ll i = 0; i < N; ++i)
#define ... | #include <algorithm>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
#define REP(i, N) for (ll i = 0; i < N; ++i)
#define ... | replace | 41 | 42 | 41 | 45 | TLE | |
p00737 | C++ | Time Limit Exceeded | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define INF 1e8
int dx[4] = {0, 1, 0, -1};
int dy[4] = {-1, 0, 1, 0};
struct state {
int cost;
int x, y;
int dir;
state(int _x, int _y, int _dir, int _cost)
: x(_x), y(_y), dir(_dir), cost(_cost) {}
bool operator<(const state &... | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define INF 1e8
int dx[4] = {0, 1, 0, -1};
int dy[4] = {-1, 0, 1, 0};
struct state {
int cost;
int x, y;
int dir;
state(int _x, int _y, int _dir, int _cost)
: x(_x), y(_y), dir(_dir), cost(_cost) {}
bool operator<(const state &... | replace | 13 | 14 | 13 | 14 | TLE | |
p00738 | C++ | Time Limit Exceeded | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defi... | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defi... | replace | 43 | 44 | 43 | 44 | TLE | |
p00738 | C++ | Time Limit Exceeded | #include <algorithm>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
typedef double Num;
typedef complex<Num> Pt2;
typedef vector<Pt2> Polygon2;
struct Line2 : public vector<Pt2> {
Line2(Pt2 a, Pt2 b) {
push_back(a);
push_back(b);
}
};
const double eps = 1e-10;
Num dot(Pt2 a... | #include <algorithm>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
typedef double Num;
typedef complex<Num> Pt2;
typedef vector<Pt2> Polygon2;
struct Line2 : public vector<Pt2> {
Line2(Pt2 a, Pt2 b) {
push_back(a);
push_back(b);
}
};
const double eps = 1e-10;
Num dot(Pt2 a... | delete | 105 | 108 | 105 | 105 | TLE | |
p00738 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double R;
typedef complex<R> P;
const R EPS = 1e-10;
const R PI = acos((R)(-1)... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double R;
typedef complex<R> P;
const R EPS = 1e-10;
const R PI = acos((R)(-1)... | replace | 246 | 247 | 246 | 247 | TLE | |
p00739 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include ... | replace | 55 | 56 | 55 | 56 | 0 | #1: 8.1e-05
#2: 0.000219
#3: 0.000314
#4: 0.000207
#5: 0.000679
#6: 0.009577
#7: 0.015904
#8: 0.000747
Total: 0.02779
Ave: 0.00347375
|
p00740 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
while (true) {
int n, pmax;
int stone[50] = {};
cin >> n >> pmax;
int i;
int p = pmax;
for (i = 0; 1; i++) {
if (p) {
p--;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
while (true) {
int n, pmax;
int stone[50] = {};
cin >> n >> pmax;
if (!n && !pmax)
break;
int i;
int p = pmax;
for (i = 0; 1; i++) {
... | insert | 15 | 15 | 15 | 17 | -8 | |
p00740 | C++ | Runtime Error | #include <iostream>
using namespace std;
bool search(int p[], int N) {
int count = 0;
for (int i = 0; i < N; ++i) {
if (p[i] != 0) {
count++;
}
}
if (count == 1) {
return true;
} else {
return false;
}
}
int main(void) {
int n, p;
while (cin >> n >> p) {
int *people = new in... | #include <iostream>
using namespace std;
bool search(int p[], int N) {
int count = 0;
for (int i = 0; i < N; ++i) {
if (p[i] != 0) {
count++;
}
}
if (count == 1) {
return true;
} else {
return false;
}
}
int main(void) {
int n, p;
while (cin >> n >> p) {
if ((n == 0) && (p =... | insert | 21 | 21 | 21 | 24 | -11 | |
p00740 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define RFOR(i, a, b) for (int i = a; i >= b; --i)
#define ll long long
#define all(a) a.begin(), a.end()
#define ull unsigned long long
#define pb(x) push_back(x)
#define dbg(x) cout << #x << " : " <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define RFOR(i, a, b) for (int i = a; i >= b; --i)
#define ll long long
#define all(a) a.begin(), a.end()
#define ull unsigned long long
#define pb(x) push_back(x)
#define dbg(x) cout << #x << " : " <... | replace | 18 | 19 | 18 | 19 | TLE | |
p00740 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
static const int MAXV = 1000;
int main() {
while (1) {
int n, m, p, M[MAXV] = {}, i = 0;
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
p = m;
while (1) {
printf("%d %d %d\n", M[0], M[1], M[2]);
if (p == 0) {
... | #include <cstdio>
#include <iostream>
using namespace std;
static const int MAXV = 1000;
int main() {
while (1) {
int n, m, p, M[MAXV] = {}, i = 0;
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
p = m;
while (1) {
// printf("%d %d %d\n", M[0], M[1], M[2]);
if (p == 0)... | replace | 14 | 15 | 14 | 15 | TLE | |
p00740 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#incl... | #define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#incl... | replace | 32 | 33 | 32 | 33 | TLE | |
p00740 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, r;
while (cin >> n >> r, n) {
int p[n];
fill(p, p + n, 0);
int s = n;
for (int i = 0;; i++, i %= n) {
if (p[i] == r) {
cout << i << endl;
break;
} else {
if (s == 0) {
s ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, r;
while (cin >> n >> r, n) {
int p[n];
fill(p, p + n, 0);
int s = r;
for (int i = 0;; i++, i %= n) {
if (p[i] == r) {
cout << i << endl;
break;
} else {
if (s == 0) {
s ... | replace | 10 | 11 | 10 | 11 | TLE | |
p00740 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
int t[50], n, s, storn, i, j;
while (1) {
scanf("%d %d", &n, &storn);
// printf("%d %d",n,storn);///
if (n == 0 && storn == 0)
break;
for (i = 0; i < n; i++)
t[i] = 0;
j = 0;
s = storn;
while (1) {
printf("%d %d %d %d\n", j, s, t[j], stor... | #include <stdio.h>
int main() {
int t[50], n, s, storn, i, j;
while (1) {
scanf("%d %d", &n, &storn);
// printf("%d %d",n,storn);///
if (n == 0 && storn == 0)
break;
for (i = 0; i < n; i++)
t[i] = 0;
j = 0;
s = storn;
while (1) {
// printf("%d %d %d %d\n",j,s,t[j],storn... | replace | 13 | 14 | 13 | 14 | TLE | |
p00741 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define REP(i, a, b) for (i = a; i < b; ++i)
#define rep(i, n) REP(i, 0, n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define ALL(a) (a).begin(), (a).end()
#define ifnot(a) if (not a)
#define dump(x) cerr << #... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define REP(i, a, b) for (i = a; i < b; ++i)
#define rep(i, n) REP(i, 0, n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define ALL(a) (a).begin(), (a).end()
#define ifnot(a) if (not a)
#define dump(x) cerr << #... | replace | 128 | 129 | 128 | 129 | TLE | |
p00741 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int needx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
int needy[] = {0, 1, 0, -1, 1, -1, 1, -1};
//??¶?????¨???false????????????true???????????¢??°//
bool land(int x, int y, vector<vector<bool>> &cango) {
if (cango[x][y]) {
cango[x][y] = false;
for (int i = 0; i... | #include <iostream>
#include <vector>
using namespace std;
int needx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
int needy[] = {0, 1, 0, -1, 1, -1, 1, -1};
//??¶?????¨???false????????????true???????????¢??°//
bool land(int x, int y, vector<vector<bool>> &cango) {
if (cango[x][y]) {
cango[x][y] = false;
for (int i = 0; i... | replace | 38 | 40 | 38 | 40 | 0 | |
p00741 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, 1, -1};
bool dfs(int sx, int sy, vector<vector<bool>> &c) {
if (c[sx][sy] == false)
return false;
c[sx][sy] = false;
for (int i = 0; i < 8; i++) {
int nx = sx + dx[i];
... | #include <iostream>
#include <vector>
using namespace std;
int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, 1, -1};
bool dfs(int sx, int sy, vector<vector<bool>> &c) {
if (c[sx][sy] == false)
return false;
c[sx][sy] = false;
for (int i = 0; i < 8; i++) {
int nx = sx + dx[i];
... | replace | 24 | 25 | 24 | 25 | -11 | |
p00741 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define pb(in, tmp) in.push_back(tmp)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) loop(i, 0, b)
#define all(in) in.begin(), in.end()
using namespace std;
void isl(int in[50][50], int ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define pb(in, tmp) in.push_back(tmp)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) loop(i, 0, b)
#define all(in) in.begin(), in.end()
using namespace std;
void isl(int in[50][50], int ... | replace | 15 | 16 | 15 | 17 | 0 | |
p00741 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
const int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
void dfs(int x, int y, vector<vector<bool>> &canGo) {
canGo[x][y] = false;
for (int i = 0; i < 9; i++)
if (canGo[x + dx[i]][y + dy[i]])
dfs(x + dx[i], y ... | #include <iostream>
#include <vector>
using namespace std;
const int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
void dfs(int x, int y, vector<vector<bool>> &canGo) {
canGo[x][y] = false;
for (int i = 0; i < 8; i++)
if (canGo[x + dx[i]][y + dy[i]])
dfs(x + dx[i], y ... | replace | 9 | 10 | 9 | 10 | -11 | |
p00741 | C++ | Memory Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
using namespace std;
// 呪文
#define DUMPOUT cerr
#define dump(...) \
DUMPOUT << " "; \
DUMPOUT << #__VA_ARGS__ << " :[... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
using namespace std;
// 呪文
#define DUMPOUT cerr
#define dump(...) \
DUMPOUT << " "; \
DUMPOUT << #__VA_ARGS__ << " :[... | insert | 179 | 179 | 179 | 181 | MLE | |
p00741 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
#ifdef _DEBUG
#define debug_io \
fstream cin("input.txt"); \
ofstream cout("output.txt");
#else
#define debug... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
#ifdef _DEBUG
#define debug_io \
fstream cin("input.txt"); \
ofstream cout("output.txt");
#else
#define debug... | insert | 36 | 36 | 36 | 39 | TLE | |
p00741 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPS(a, i, n) for (int(i) = (a); (i) < (n); ++(i))
#define REVERSE(i, n) for (int(i) = n - 1; (i) >= 0; --i)
#define ALL(c) (c).begin(), (c).end()
#define LL long long
#define int LL
#define inf (1LL << 60)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPS(a, i, n) for (int(i) = (a); (i) < (n); ++(i))
#define REVERSE(i, n) for (int(i) = n - 1; (i) >= 0; --i)
#define ALL(c) (c).begin(), (c).end()
#define LL long long
#define int LL
#define inf (1LL << 60)
#defin... | insert | 80 | 80 | 80 | 83 | MLE | |
p00741 | C++ | Runtime Error | #include <iostream>
#include <stdlib.h>
using namespace std;
int d[8][2] = {{-1, -1}, {0, -1}, {1, -1}, {-1, 0},
{1, 0}, {-1, 1}, {0, 1}, {1, 1}};
void func(int **a, int s, int t, int i, int j) {
if (a[i][j] == 0) {
return;
}
a[i][j] = 0;
for (int k = 0; k < 8; k++) {
if ((i + d[k]... | #include <iostream>
#include <stdlib.h>
using namespace std;
int d[8][2] = {{-1, -1}, {0, -1}, {1, -1}, {-1, 0},
{1, 0}, {-1, 1}, {0, 1}, {1, 1}};
void func(int **a, int s, int t, int i, int j) {
if (a[i][j] == 0) {
return;
}
a[i][j] = 0;
for (int k = 0; k < 8; k++) {
if ((i + d[k]... | replace | 58 | 59 | 58 | 59 | -11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.