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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p00070 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int dp[10 + 1][330 + 1];
for (int i = 0; i < 10 + 1; ++i) {
for (int j = 0; j < 330 + 1; ++j)
dp[i][j] = 0;
}
int fac[10 + 1];
fac[0] = fac[1] = 1;
for (int i = 2; i < 10 + 1; ++i)
fac[i] = i * fac[i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int dp[10 + 1][330 + 1];
for (int i = 0; i < 10 + 1; ++i) {
for (int j = 0; j < 330 + 1; ++j)
dp[i][j] = 0;
}
int fac[10 + 1];
fac[0] = fac[1] = 1;
for (int i = 2; i < 10 + 1; ++i)
fac[i] = i * fac[i... | replace | 30 | 31 | 30 | 34 | 0 | |
p00070 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
const Iterator last) {
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr... | #include <bits/stdc++.h>
using namespace std;
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
const Iterator last) {
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr... | insert | 54 | 54 | 54 | 58 | TLE | |
p00070 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pai... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pai... | insert | 70 | 70 | 70 | 77 | TLE | |
p00070 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iostream>
using namespace std;
int dp[11][1024][341];
int main() {
dp[0][0][0] = 1;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 1024; j++) {
for (int k = 0; k < 331; k++) {
if (dp[i][j][k] == 0)
continue;
for (int l = 0; l <... | #include <algorithm>
#include <bitset>
#include <iostream>
using namespace std;
int dp[11][1024][341];
int main() {
dp[0][0][0] = 1;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 1024; j++) {
for (int k = 0; k < 331; k++) {
if (dp[i][j][k] == 0)
continue;
for (int l = 0; l <... | insert | 23 | 23 | 23 | 27 | 0 | |
p00070 | C++ | Runtime Error | // AOJ 0070 Combination of Number Sequences
#include <iostream>
using namespace std;
void set_count(int n, int sum, int used);
const int MAX_N = 10;
const int MAX_SUM = 330;
int count_s[MAX_N + 1][MAX_SUM + 1];
int main() {
int n, s;
set_count(1, 0, 0);
while (cin) {
cin >> n >> s;
if (cin.eof())
... | // AOJ 0070 Combination of Number Sequences
#include <iostream>
using namespace std;
void set_count(int n, int sum, int used);
const int MAX_N = 10;
const int MAX_SUM = 330;
int count_s[MAX_N + 1][MAX_SUM + 1];
int main() {
int n, s;
set_count(1, 0, 0);
while (cin) {
cin >> n >> s;
if (cin.eof())
... | replace | 23 | 24 | 23 | 27 | 0 | |
p00070 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int a[10][331];
bool e[10];
void m(int d, int s) {
for (int i = 0; i < 10; i++) {
if (e[i])
continue;
a[d][s + d * i]++;
if (d < 10) {
e[i] = true;
m(d + 1, s + d * i);
e[i] = false;
}
}
}
int main(void) {
memset(a, 0, sizeof(a));
me... | #include <stdio.h>
#include <string.h>
int a[11][331];
bool e[10];
void m(int d, int s) {
for (int i = 0; i < 10; i++) {
if (e[i])
continue;
a[d][s + d * i]++;
if (d < 10) {
e[i] = true;
m(d + 1, s + d * i);
e[i] = false;
}
}
}
int main(void) {
memset(a, 0, sizeof(a));
me... | replace | 2 | 3 | 2 | 3 | 0 | |
p00070 | C++ | Runtime Error | #include <iostream>
using namespace std;
int dp[1024][500];
int main() {
int n, s;
dp[0][0] = 1;
for (int i = 0; i < 350; i++) {
for (int j = 0; j < 1024; j++) {
int cnt = 1;
for (int k = 0; k < 10; k++)
if (j & (1 << k))
cnt++;
for (int k = 0; k < 10; k++) {
if ... | #include <iostream>
using namespace std;
int dp[1024][500];
int main() {
int n, s;
dp[0][0] = 1;
for (int i = 0; i < 350; i++) {
for (int j = 0; j < 1024; j++) {
int cnt = 1;
for (int k = 0; k < 10; k++)
if (j & (1 << k))
cnt++;
for (int k = 0; k < 10; k++) {
if ... | insert | 25 | 25 | 25 | 27 | 0 | |
p00070 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define loop for (;;)
#define trace(var) cerr << ">>> " << #var << " = " << var << endl;
#define all(v) begin(v), end(v)
#define pb push_back
#define inf (1e9)
#define eps (1e-9)
typedef long long Integer;
typedef long doubl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define loop for (;;)
#define trace(var) cerr << ">>> " << #var << " = " << var << endl;
#define all(v) begin(v), end(v)
#define pb push_back
#define inf (1e9)
#define eps (1e-9)
typedef long long Integer;
typedef long doubl... | replace | 90 | 94 | 90 | 91 | 0 | >>> i+1 = 1
>>> i+1 = 2
>>> i+1 = 3
>>> i+1 = 4
>>> i+1 = 5
>>> i+1 = 6
>>> i+1 = 7
>>> i+1 = 8
>>> i+1 = 9
>>> i+1 = 10
|
p00070 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int table[10 + 1][330 + 1];
int memo[10];
void numnum(int size, int depth, int sum) {
if (size + 1 == depth) {
table[size][sum]++;
} else {
for (int i = 0; i <= 9; ++i) {
if (memo[i] == 0) {
memo[i] = 1;
numnum(size, depth ... | #include <cstring>
#include <iostream>
using namespace std;
int table[10 + 1][10000];
int memo[10];
void numnum(int size, int depth, int sum) {
if (size + 1 == depth) {
table[size][sum]++;
} else {
for (int i = 0; i <= 9; ++i) {
if (memo[i] == 0) {
memo[i] = 1;
numnum(size, depth + ... | replace | 5 | 6 | 5 | 6 | 0 | |
p00070 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int table[10 + 1][330 + 2];
int memo[10];
void numnum(int size, int depth, int sum) {
if (size + 1 == depth) {
table[size][sum]++;
} else {
for (int i = 0; i <= 9; ++i) {
if (memo[i] == 0) {
memo[i] = 1;
numnum(size, depth ... | #include <cstring>
#include <iostream>
using namespace std;
// http://d.hatena.ne.jp/Nekonyan/20110508
// Nekonyanツつウツづアツづ個コツーツドツづーツ参ツ考ツづ可つオツづ慊つオツつスツ。
int table[10 + 1][10000];
int memo[10];
void numnum(int size, int depth, int sum) {
if (size + 1 == depth) {
table[size][sum]++;
} else {
for (int i = 0;... | replace | 5 | 6 | 5 | 9 | 0 | |
p00070 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
int main() {
int m[10][331] = {0};
int n, s, i, a[10], f[11] = {1};
for (i = 0; i < 10; ++i)
a[i] = i;
for (i = 1; i < 10; ++i)
f[i] = f[i - 1] * i;
do {
for (s = i = 0; i < 10; ++i) {
s += (i + 1) * a[i];
++m[i][s];
}
} while (std::next_pe... | #include <algorithm>
#include <stdio.h>
int main() {
int m[10][331] = {0};
int n, s, i, a[10], f[11] = {1};
for (i = 0; i < 10; ++i)
a[i] = i;
for (i = 1; i < 10; ++i)
f[i] = f[i - 1] * i;
do {
for (s = i = 0; i < 10; ++i) {
s += (i + 1) * a[i];
++m[i][s];
}
} while (std::next_pe... | replace | 16 | 17 | 16 | 20 | 0 | |
p00070 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
#define SIZE (750)
int dp[11][1 << 10][SIZE];
int main(void) {
int n;
char buf[256];
int s;
memset(dp, 0, sizeof(dp));
dp[0][0][0] = 1;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < (1 << 10); j++) {
for (int k = 0; k < SIZE; k++) {
for (int ... | #include <stdio.h>
#include <string.h>
#define SIZE (750)
int dp[11][1 << 10][SIZE];
int main(void) {
int n;
char buf[256];
int s;
memset(dp, 0, sizeof(dp));
dp[0][0][0] = 1;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < (1 << 10); j++) {
for (int k = 0; k < SIZE; k++) {
for (int ... | replace | 28 | 30 | 28 | 34 | 0 | |
p00070 | 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 | 63 | 64 | 63 | 65 | 0 | |
p00071 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
cin.ignore();
for (int k = 0; k < n; ++k) {
int grid[8][8];
int x, y;
for (int i ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
cin.ignore();
for (int k = 0; k < n; ++k) {
int grid[8][8];
int x, y;
for (int i ... | insert | 35 | 35 | 35 | 36 | MLE | |
p00072 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
#define MAX_V 111
#define INF (1 << 21)
int cost[MAX_V][MAX_V] = {{0}};
int mincost[MAX_V] = {};
bool used[MAX_V] = {};
int V;
int prim(void);
int min(int a, int b);
int main() {
int m;
scanf("%d", &V);
while (1) {
if (V == 0)
break;
s... | #include <cstdio>
#include <iostream>
using namespace std;
#define MAX_V 111
#define INF (1 << 21)
int cost[MAX_V][MAX_V] = {{0}};
int mincost[MAX_V] = {};
bool used[MAX_V] = {};
int V;
int prim(void);
int min(int a, int b);
int main() {
int m;
scanf("%d", &V);
while (1) {
if (V == 0)
break;
s... | replace | 25 | 27 | 25 | 27 | 0 | |
p00072 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
const int INF = 1000000000;
const int MAX_V = 101;
int cost[MAX_V][MAX_V];
int mincost[MAX_V];
bool used[MAX_V];
int V;
int prim() {
for (int i = 0; i < V; ++i) {
mincost[i] = INF;
used[i] = false;
}
mincost[0] = 0;
int res = 0;
while... | #include <algorithm>
#include <iostream>
using namespace std;
const int INF = 1000000000;
const int MAX_V = 10000;
int cost[MAX_V][MAX_V];
int mincost[MAX_V];
bool used[MAX_V];
int V;
int prim() {
for (int i = 0; i < V; ++i) {
mincost[i] = INF;
used[i] = false;
}
mincost[0] = 0;
int res = 0;
whi... | replace | 5 | 6 | 5 | 6 | 0 | |
p00072 | C++ | Runtime Error | // kruskal tree
#include <algorithm>
#include <cstdio>
using namespace std;
#define M 999
int parent[M], a[M], b[M];
pair<int, int> node[M];
int root(int a) { return parent[a] == a ? a : parent[a] = root(parent[a]); }
int unite(int a, int b) {
int x = root(a), y = root(b);
if (x == y)
return 0;
parent[x] = y;... | // kruskal tree
#include <algorithm>
#include <cstdio>
using namespace std;
#define M 99999
int parent[M], a[M], b[M];
pair<int, int> node[M];
int root(int a) { return parent[a] == a ? a : parent[a] = root(parent[a]); }
int unite(int a, int b) {
int x = root(a), y = root(b);
if (x == y)
return 0;
parent[x] = ... | replace | 4 | 5 | 4 | 5 | 0 | |
p00072 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <functional>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> Pair;
struct Edge {
int len;
int to;
};
int n;
int m;
bool used[10000];
vector<Edge> es[10000];
priority_queue<Pair, vector<Pair>, greater<Pair>> q;
int CalcMSTCost() {
i... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> Pair;
struct Edge {
int len;
int to;
};
int n;
int m;
bool used[10000];
vector<Edge> es[10000];
priority_queue<Pair, vector<Pair>, greater<Pair>> q;
int CalcMSTCost() {
i... | delete | 58 | 60 | 58 | 58 | 0 | |
p00072 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
struct edge {
int u, v, cost;
};
bool comp(const edge &e1, const edge &e2) { return e1.cost < e2.cost; }
const int MAX_N = 101;
const int MAX_E = 150;
int par[MAX_N];
int r[MAX_N];
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
... | #include <algorithm>
#include <iostream>
using namespace std;
struct edge {
int u, v, cost;
};
bool comp(const edge &e1, const edge &e2) { return e1.cost < e2.cost; }
const int MAX_N = 101;
const int MAX_E = 10000;
int par[MAX_N];
int r[MAX_N];
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
... | replace | 11 | 12 | 11 | 12 | 0 | |
p00072 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
constexpr int MAX_N = 100;
struct edge {
int from_, to_, cost_;
edge() = default;
edge(int from, int to, int cost) : from_(from), to_(to), cost_(cost) {}
bool operator<(const edge &rhs) const {
return (cost_ == rhs.cost_) ? to_ < rhs.to_ : cost_ <... | #include <algorithm>
#include <iostream>
#include <vector>
constexpr int MAX_N = 100;
struct edge {
int from_, to_, cost_;
edge() = default;
edge(int from, int to, int cost) : from_(from), to_(to), cost_(cost) {}
bool operator<(const edge &rhs) const {
return (cost_ == rhs.cost_) ? to_ < rhs.to_ : cost_ <... | replace | 31 | 32 | 31 | 32 | 0 | |
p00072 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#de... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#de... | replace | 62 | 63 | 62 | 63 | 0 | |
p00075 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
double kg, m;
while (scanf("%d, %lf,%lf", &n, &kg, &m)) {
if (kg / (m * m) >= 25) {
cout << n << endl;
}
}
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
double kg, m;
while (scanf("%d, %lf,%lf", &n, &kg, &m) != EOF) {
if (kg / (m * m) >= 25) {
cout << n << endl;
}
}
} | replace | 12 | 13 | 12 | 13 | TLE | |
p00075 | 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;
double b, c;
while (scanf("%d,%lf,%lf", &a, &b, &c)) {
if (25 <= (b / (c * c)))
cout << a << endl;
}
} | #include <bits/stdc++.h>
#define r(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int a;
double b, c;
while (scanf("%d,%lf,%lf", &a, &b, &c) != EOF) {
if (25 <= (b / (c * c)))
cout << a << endl;
}
} | replace | 6 | 7 | 6 | 7 | TLE | |
p00075 | C++ | Time Limit Exceeded | // #define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, x, n) for (int i = x; i < (int)n; ++i)
#define re... | // #define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, x, n) for (int i = x; i < (int)n; ++i)
#define re... | replace | 73 | 74 | 73 | 74 | TLE | |
p00075 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int a;
double b, c;
while (scanf("%d,%lf,%lf", &a, &b, &c)) {
int d = 0;
d = b / (c * c);
if (d >= 25.00) {
cout << a << endl;
}
}
return (0);
} | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int a;
double b, c;
while (scanf("%d,%lf,%lf", &a, &b, &c) != EOF) {
int d = 0;
d = b / (c * c);
if (d >= 25.00) {
cout << a << endl;
}
}
return (0);
} | replace | 9 | 10 | 9 | 10 | TLE | |
p00075 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
int ban;
double tai, sin, BMI;
while (scanf("%d %lf %lf", &ban, &tai, &sin) != EOF) {
BMI = tai / (sin * sin);
if (BMI >= 25.0) {
printf("%d\n", ban);
}
}
return 0;
} | #include <stdio.h>
int main(void) {
int ban;
double tai, sin, BMI;
while (scanf("%d,%lf,%lf", &ban, &tai, &sin) != EOF) {
BMI = tai / (sin * sin);
if (BMI >= 25.0) {
printf("%d\n", ban);
}
}
return 0;
} | replace | 4 | 5 | 4 | 5 | TLE | |
p00075 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a = 0;
double b, c;
while (scanf("%d,%lf,%lf", &a, &b, &c)) {
if (b / (c * c) >= 25)
cout << a << endl;
}
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a = 0;
double b, c;
while (~scanf("%d,%lf,%lf", &a, &b, &c)) {
if (b / (c * c) >= 25)
cout << a << endl;
}
} | replace | 6 | 7 | 6 | 7 | TLE | |
p00075 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
using namespace std;
double BMI(double Kg, double m) {
double bmi;
bmi = Kg / (m * m);
return bmi;
}
int main() {
double Kg, m;
int student;
while (scanf("%d,%lf,%lf", &student, &Kg, &m)) {
if (BMI(Kg, m) >= 25) {
cout << student << endl;
}
}
} | #include <iostream>
#include <stdio.h>
using namespace std;
double BMI(double Kg, double m) {
double bmi;
bmi = Kg / (m * m);
return bmi;
}
int main() {
double Kg, m;
int student;
while (scanf("%d,%lf,%lf", &student, &Kg, &m) != EOF) {
if (BMI(Kg, m) >= 25) {
cout << student << endl;
}
}
} | replace | 12 | 13 | 12 | 13 | TLE | |
p00075 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
int l, i = 0;
double m, n;
while (scanf("%d,%lf,%lf", &l, &m, &n) != NULL) {
if (25.0 <= m / (n * n)) {
printf("%d\n", l);
i++;
}
}
if (i == 0)
printf("????????????\n");
return 0;
} | #include <stdio.h>
int main() {
int l, i = 0;
double m, n;
while (scanf("%d,%lf,%lf", &l, &m, &n) != EOF) {
if (25.0 <= m / (n * n)) {
printf("%d\n", l);
i++;
}
}
if (i == 0)
printf("????????????\n");
return 0;
} | replace | 5 | 6 | 5 | 6 | TLE | |
p00075 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
struct data {
int number;
double weight;
double tall;
};
int main() {
data dt;
while (1) {
scanf("%d,%lf,%lf", &dt.number, &dt.weight, &dt.tall);
if (!dt.number)
break;
if (dt.weight / pow(dt.tall... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
struct data {
int number;
double weight;
double tall;
};
int main() {
data dt;
while (scanf("%d,%lf,%lf", &dt.number, &dt.weight, &dt.tall) != EOF) {
if (dt.weight / pow(dt.tall, 2) >= 25)
cout << dt.numb... | replace | 14 | 18 | 14 | 15 | TLE | |
p00075 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int id;
double h, w;
while (scanf("%d,%lf,%lf", &id, &w, &h)) {
double b = (double)w / (h * h);
if (b >= 25.0)
cout << id << endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int id;
double h, w;
while (scanf("%d,%lf,%lf", &id, &w, &h) != EOF) {
double b = (double)w / (h * h);
if (b >= 25.0)
cout << id << endl;
}
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p00075 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int id;
double w, h;
while (scanf("%d,%lf,%lf", &id, &w, &h), id) {
double bmi = w / (h * h);
if (bmi >= 25.0) {
cout << id << endl;
}
}
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int id;
double w, h;
while (scanf("%d,%lf,%lf", &id, &w, &h) != EOF) {
double bmi = w / (h * h);
if (bmi >= 25.0) {
cout << id << endl;
}
}
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p00075 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int num;
double tai, sint;
char d;
while (scanf("%d,%lf,%lf", &num, &tai, &sint) != '\0') {
// cout<<tai/sint*sint<<endl;
if (tai / (sint * sint) >= 25)
cout << num << endl;
}
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int num;
double tai, sint;
char d;
while (scanf("%d,%lf,%lf", &num, &tai, &sint) != EOF) {
// cout<<tai/sint*sint<<endl;
if (tai / (sint * sint) >= 25)
cout << num << endl;
}
} | replace | 7 | 8 | 7 | 8 | TLE | |
p00076 | C++ | Time Limit Exceeded | #include <cmath>
#include <iomanip>
#include <iostream>
int main() {
int n;
while (std::cin >> n) {
double x = 1.0, y = 0.0;
for (int i = 0; i != n - 1; ++i) {
double t = sqrt(x * x + y * y);
double vx = -y / t, vy = x / t;
x += vx;
y += vy;
}
std::cout << std::fixed << st... | #include <cmath>
#include <iomanip>
#include <iostream>
int main() {
int n;
while (std::cin >> n, n != -1) {
double x = 1.0, y = 0.0;
for (int i = 0; i != n - 1; ++i) {
double t = sqrt(x * x + y * y);
double vx = -y / t, vy = x / t;
x += vx;
y += vy;
}
std::cout << std::fi... | replace | 6 | 7 | 6 | 7 | TLE | |
p00076 | 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;
/* ??????????????¬ */
#include <complex>
typedef complex<ld> Point;
#define rep(i, n) for (i... | #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;
/* ??????????????¬ */
#include <complex>
typedef complex<ld> Point;
#define rep(i, n) for (i... | insert | 601 | 601 | 601 | 603 | TLE | |
p00077 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
char a;
while (scanf("%c", &a)) {
if (a == '@') {
int s;
cin >> a;
s = a - '0';
cin >> a;
for (int i = 0; i < s; i++) {
cout << a;
}
} else if (a == '\n')
cout << endl;
else
c... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
char a;
while (scanf("%c", &a) != EOF) {
if (a == '@') {
int s;
cin >> a;
s = a - '0';
cin >> a;
for (int i = 0; i < s; i++) {
cout << a;
}
} else if (a == '\n')
cout << endl;
else
... | replace | 6 | 7 | 6 | 7 | TLE | |
p00077 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
string inp, mozi;
int kai;
while (1) {
cin >> inp;
for (int i = 0; i < inp.length(); i++) {
if (inp[i] == '@') {
kai = inp[i + 1] - '0';
mozi = inp[i... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
string inp, mozi;
int kai;
while (cin >> inp) {
for (int i = 0; i < inp.length(); i++) {
if (inp[i] == '@') {
kai = inp[i + 1] - '0';
mozi = inp[i + 2];
... | replace | 12 | 14 | 12 | 13 | TLE | |
p00077 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define pu push
#define pb push_back
... | #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;
typedef pair<int, int> P;
#define pu push
#define pb push_back
... | replace | 22 | 24 | 22 | 23 | TLE | |
p00077 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
while (cin >> s) {
while (s.find("@") != 0) {
int x = s.find("@");
string buf;
for (int i = 0; i < s[x + 1] - '0'; i++)
buf += s[x + 2];
s.replace(x, 3, buf);
}
cout << s << endl;
}
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
while (cin >> s) {
while (s.find("@") != -1) {
int x = s.find("@");
string buf;
for (int i = 0; i < s[x + 1] - '0'; i++)
buf += s[x + 2];
s.replace(x, 3, buf);
}
cout << s << endl;
}
}
| replace | 6 | 7 | 6 | 7 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::replace: __pos (which is 18446744073709551615) > this->size() (which is 18)
|
p00079 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
#pragma warning(disable : 4996)
struct Point {
long double px, py;
};
struct Segment {
Point p1, p2;
};
Point X[200000];
Point Minus(Point a, Point b) {
Point G;
G.px = a.px - b.px;
G.py = a.py - b.py;
return G;
}... | #include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
#pragma warning(disable : 4996)
struct Point {
long double px, py;
};
struct Segment {
Point p1, p2;
};
Point X[200000];
Point Minus(Point a, Point b) {
Point G;
G.px = a.px - b.px;
G.py = a.py - b.py;
return G;
}... | replace | 31 | 32 | 31 | 32 | TLE | |
p00079 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair... | #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;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair... | replace | 25 | 26 | 25 | 26 | TLE | |
p00079 | C++ | Runtime Error | #include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
using namespace std;
typedef complex<double> xy_t;
int main() {
xy_t P[110];
int N = 0;
double x, y;
while (scanf("%lf,%lf", &x, &y)) {
P[N++] = xy_t(x, y);
}
double sum = 0.0;
for (int i = 0; i + 2 < N; ++i) {
xy_t a = P[0]... | #include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
using namespace std;
typedef complex<double> xy_t;
int main() {
xy_t P[110];
int N = 0;
double x, y;
while (~scanf("%lf,%lf", &x, &y)) {
P[N++] = xy_t(x, y);
}
double sum = 0.0;
for (int i = 0; i + 2 < N; ++i) {
xy_t a = P[0... | replace | 10 | 11 | 10 | 11 | -11 | |
p00079 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
#define X real... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
#define X real... | replace | 26 | 27 | 26 | 27 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p00079 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
//-------------------------------------------------------------------------
// geometric library
namespace geometry {
#define EPS 1E-10 ///< 0とみなすサイズ。適当
struct point {
double x;
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
//-------------------------------------------------------------------------
// geometric library
namespace geometry {
#define EPS 1E-10 ///< 0とみなすサイズ。適当
struct point {
double x;
... | delete | 92 | 94 | 92 | 92 | 0 | |
p00080 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
#define EPS 1e-5
int main() {
double q;
while (cin >> q, q >= 0) {
double x = q / 2;
while (fabs(x * x * x) > EPS * q) {
x = x - (x * x * x - q) / (3 * x * x);
}
printf("%f\n", x);
}
return 0;
} | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
#define EPS 1e-5
int main() {
double q;
while (cin >> q, q >= 0) {
double x = q / 2;
while (fabs(x * x * x - q) >= EPS * q) {
x = x - (x * x * x - q) / (3 * x * x);
}
printf("%f\n", x);
}
return 0;
} | replace | 12 | 13 | 12 | 13 | TLE | |
p00080 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int in;
double q, x;
while (cin >> in && in) {
q = in;
x = q / 2;
while (fabs(x * x * x - q) >= q * 1e-5) {
x = x - (x * x * x - q) / (3 * x * x);
}
printf("%.5f\n", x);
}
return 0;
} | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int in;
double q, x;
while (cin >> in && in != -1) {
q = in;
x = q / 2;
while (fabs(x * x * x - q) >= q * 1e-5) {
x = x - (x * x * x - q) / (3 * x * x);
}
printf("%.5f\n", x);
}
return 0;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p00080 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define REPR(i, n) for (ll i = 1; i < n; ++i)
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define DEBUG(x) cout << #x << ": "... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define REPR(i, n) for (ll i = 1; i < n; ++i)
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define DEBUG(x) cout << #x << ": "... | replace | 39 | 42 | 39 | 42 | TLE | |
p00080 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int q;
while (cin >> q) {
if (q == -1)
break;
double x = q / 2;
while (1) {
if (abs(x * x * x - q) < 0.00001 * q)
break;
x = x - (x * x * x - q) / (3 * x * x);
}
printf("%.6... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int q;
while (cin >> q) {
if (q == -1)
break;
if (q == 1) {
printf("1.000000");
cout << endl;
continue;
}
double x = q / 2;
while (1) {
if (abs(x * x * x - q) < 0.00001 *... | replace | 12 | 13 | 12 | 17 | TLE | |
p00080 | C++ | Time Limit Exceeded | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
double q;
while (cin >> q && q != -1) {
double x = q / 2;
while (true) {
if (fabs(x * x * x * q) < 0.00001 * q)
break;
x -= (x * x * x - q) / (x * x * 3);
}
cout << fixed << setprecision(7) ... | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
double q;
while (cin >> q && q != -1) {
double x = q / 2;
while (true) {
if (fabs(x * x * x - q) < 0.00001 * q)
break;
x -= (x * x * x - q) / (x * x * 3);
}
cout << fixed << setprecision(7) ... | replace | 9 | 10 | 9 | 10 | TLE | |
p00080 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
int main() {
int q;
float x;
for (; scanf("%d", &q), ~q; printf("%f\n", x))
for (x = q / 2.; fabs(x * x * x - q) > 1e-5 * q; x -= x / 3 - q / 3 / x / x)
;
} | #include <cmath>
#include <cstdio>
int main() {
int q;
float x;
for (; scanf("%d", &q), ~q; printf("%f\n", x))
for (x = q / 2.; fabs(x * x * x - q) > 1e-5 * q;
x -= (x * x * x - q) / (3 * x * x))
;
} | replace | 6 | 7 | 6 | 8 | TLE | |
p00080 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <list>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
double tmp[20][2];
int cnt = 0;
int n;
for (;;) {
scanf("%d", &n);
if (n == -1)
break;
double ans = 1.0 * n / 2.0;
while (abs(ans * ans * ans... | #include <algorithm>
#include <bits/stdc++.h>
#include <list>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
double tmp[20][2];
int cnt = 0;
int n;
for (;;) {
scanf("%d", &n);
if (n == -1)
break;
double ans = 1.0 * n / 2.0;
while (abs(ans * ans * ans... | replace | 17 | 18 | 17 | 18 | TLE | |
p00081 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
#define EPS 1e-10
#define equals(a, b) (fabs((a) - (b)) < EPS)
class Point {
public:
long double x, y;
Point(long double x = 0, long double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y... | #include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
#define EPS 1e-10
#define equals(a, b) (fabs((a) - (b)) < EPS)
class Point {
public:
long double x, y;
Point(long double x = 0, long double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y... | replace | 42 | 44 | 42 | 44 | -11 | |
p00081 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define range(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define rep(i, n) range(i, 0, n)
using namespace std;
typedef long double D;
typedef complex<D> P;
typedef struct {
P s, t;
} L;
const D eps = 1.0e-10;
const D pi = acos(-1.0);
template <class T> bool operator==(T a, T b) { return ... | #include <bits/stdc++.h>
#define range(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define rep(i, n) range(i, 0, n)
using namespace std;
typedef long double D;
typedef complex<D> P;
typedef struct {
P s, t;
} L;
const D eps = 1.0e-10;
const D pi = acos(-1.0);
template <class T> bool operator==(T a, T b) { return ... | insert | 45 | 45 | 45 | 47 | TLE | |
p00081 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
using namespace std;
#define rep(i, j) for (int i = 0; i < j; i++)
// note: theta[rad]
void rotate(double &x, double &y, const double &theta) {
double nx, ny;
nx = x * cos(theta) - y * sin(theta);
ny = x * sin(theta) + y * cos(theta);
x = nx;
y = ny;
}
int main() {
doub... | #include <cmath>
#include <cstdio>
using namespace std;
#define rep(i, j) for (int i = 0; i < j; i++)
// note: theta[rad]
void rotate(double &x, double &y, const double &theta) {
double nx, ny;
nx = x * cos(theta) - y * sin(theta);
ny = x * sin(theta) + y * cos(theta);
x = nx;
y = ny;
}
int main() {
doub... | replace | 18 | 19 | 18 | 19 | TLE | |
p00081 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
const ld EPS = 1e-9;
const ld INF = 1e10;
const ld PI = M_PI;
struct Point {
ld x, y;
Point(ld x, ld y) : x(x), y(y) {}
Point() {}
};
Point operator+(const Point &a, const Point &b) {
return Point(a.x + b.x, a.y + b.y);
}
Point operator-(... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
const ld EPS = 1e-9;
const ld INF = 1e10;
const ld PI = M_PI;
struct Point {
ld x, y;
Point(ld x, ld y) : x(x), y(y) {}
Point() {}
};
Point operator+(const Point &a, const Point &b) {
return Point(a.x + b.x, a.y + b.y);
}
Point operator-(... | replace | 50 | 51 | 50 | 52 | TLE | |
p00082 | C++ | Runtime Error | #include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath> // require fabs
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit atof atoi
#include <cstring> // requir... | #include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath> // require fabs
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit atof atoi
#include <cstring> // requir... | replace | 44 | 50 | 44 | 52 | 0 | 1 2 1 2 1 4 1 4
1 2 1 4 1 4 1 2
1 4 1 2 1 2 1 4
1 4 1 4 1 2 1 2
2 1 2 1 4 1 4 1
2 1 4 1 4 1 2 1
4 1 2 1 2 1 4 1
4 1 4 1 2 1 2 1
|
p00082 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | replace | 44 | 45 | 44 | 45 | TLE | |
p00083 | C++ | Time Limit Exceeded | #include <stdbool.h>
#include <stdio.h>
int main(void) {
int x, y, z, sum;
while (true) {
scanf("%d%d%d", &x, &y, &z);
sum = 10000 * x + 100 * y + z;
if (sum < 18680908) {
printf("pre-meiji\n");
} else if (sum < 19120730) {
printf("meiji %d %d %d\n", x - 1867, y, z);
} else if (sum ... | #include <stdbool.h>
#include <stdio.h>
int main(void) {
int x, y, z, sum;
while (scanf("%d%d%d", &x, &y, &z) != EOF) {
sum = 10000 * x + 100 * y + z;
if (sum < 18680908) {
printf("pre-meiji\n");
} else if (sum < 19120730) {
printf("meiji %d %d %d\n", x - 1867, y, z);
} else if (sum < 1... | replace | 5 | 7 | 5 | 6 | TLE | |
p00083 | C++ | Time Limit Exceeded | #include <stdbool.h>
#include <stdio.h>
bool Fmeiji, Ftaisho, Fshowa, Fheisei = false;
void meiji(int year, int month, int day);
void taisho(int year, int month, int day);
void showa(int year, int month, int day);
void heisei(int year, int month, int day);
int year, month, day;
int main(void) {
int wagou;
while (1)... | #include <stdbool.h>
#include <stdio.h>
bool Fmeiji, Ftaisho, Fshowa, Fheisei = false;
void meiji(int year, int month, int day);
void taisho(int year, int month, int day);
void showa(int year, int month, int day);
void heisei(int year, int month, int day);
int year, month, day;
int main(void) {
int wagou;
while ((s... | replace | 10 | 12 | 10 | 11 | TLE | |
p00085 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int total, step;
vector<int> person;
vector<int>::iterator it;
int i, m;
while (1) {
// get input
cin >> total >> step;
// finish condition
if (total == 0 && step == 0)
break;
// init
for (i = 1; i <= tot... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int total, step;
vector<int> person;
vector<int>::iterator it;
int i, m;
while (1) {
// get input
cin >> total >> step;
// finish condition
if (total == 0 && step == 0)
break;
// init
for (i = 1; i <= tot... | replace | 46 | 49 | 46 | 49 | TLE | |
p00085 | C++ | Runtime Error | #include <iostream>
#include <queue>
using namespace std;
int main() {
int n, m;
queue<int> qu;
while (1) {
cin >> n >> m;
if (!n && !m)
break;
for (int i = 1; i <= n; i++)
qu.push(i);
int cnt = 0;
while (qu.front() != qu.back()) {
int buf = qu.front();
qu.pop();
... | #include <iostream>
#include <queue>
using namespace std;
int main() {
int n, m;
queue<int> qu;
while (1) {
cin >> n >> m;
if (!n && !m)
break;
for (int i = 1; i <= n; i++)
qu.push(i);
int cnt = 0;
while (qu.front() != qu.back()) {
int buf = qu.front();
qu.pop();
... | replace | 17 | 22 | 17 | 19 | 0 | |
p00085 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, m, pc, count;
while (cin >> n >> m) {
if (n == 0 && m == 0)
break;
int p[n + 1];
p[0] = 0;
pc = n;
count = 0;
for (int i = 1; i <= n; i++)
p[i] = 1;
while (pc != 1) {
for (int i = 1; i <= n; i++) {
if ... | #include <iostream>
using namespace std;
int main() {
int n, m, pc, count;
while (cin >> n >> m) {
if (n == 0 && m == 0)
break;
int p[n + 1];
p[0] = 0;
pc = n;
count = 0;
for (int i = 1; i <= n; i++)
p[i] = 1;
while (pc != 1) {
for (int i = 1; i <= n; i++) {
if ... | replace | 20 | 21 | 20 | 21 | TLE | |
p00085 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int hito[1000];
int m, n;
int a;
int counter = 0;
int counter2 = 0;
int k = 0;
while (1) {
cin >> n >> m;
if (n == 0 && m == 0) {
break;
}
for (int i = 0; i < n; i++) {
hito[i] = 1;
}
while ... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int hito[1000];
int m, n;
int a;
int counter = 0;
int counter2 = 0;
int k = 0;
while (1) {
cin >> n >> m;
if (n == 0 && m == 0) {
break;
}
for (int i = 0; i < n; i++) {
hito[i] = 1;
}
while ... | replace | 37 | 38 | 37 | 42 | TLE | |
p00086 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstring>
using namespace std;
int list[100];
int main(void) {
int a, b;
bool flag = false;
while (scanf("%d %d", &a, &b)) {
memset(list, 0, 100);
list[a - 1]++;
list[b - 1]++;
while (true) {
scanf("%d %d", &a, &b);
if (!a && !b)
break;
list[a... | #include <cstdio>
#include <cstring>
using namespace std;
int list[100];
int main(void) {
int a, b;
bool flag = false;
while (scanf("%d %d", &a, &b) != EOF) {
memset(list, 0, 100);
list[a - 1]++;
list[b - 1]++;
while (true) {
scanf("%d %d", &a, &b);
if (!a && !b)
break;
... | replace | 9 | 10 | 9 | 10 | TLE | |
p00086 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
while (1) {
vector<int> G[100];
int a, b;
while (1) {
if (!cin >> a >> b) {
return 0;
}
if (a == 0 && b == 0) {
break;
}
a--;
b--;
G[a].push_back(b)... | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
while (1) {
vector<int> G[100];
int a, b;
while (1) {
if (!(cin >> a >> b)) {
return 0;
}
if (a == 0 && b == 0) {
break;
}
a--;
b--;
G[a].push_back(... | replace | 8 | 9 | 8 | 9 | -11 | |
p00086 | C++ | Runtime Error | // coding on smartphone
#include <iostream>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
int deg[51] = {};
deg[a]++, deg[b]++;
while (cin >> a >> b, a + b)
deg[a]++, deg[b]++;
bool judge = deg[1] % 2 == 1 && deg[2] % 2 == 1;
for (int i = 3; i < 51; i++)
if (de... | // coding on smartphone
#include <iostream>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
int deg[101] = {};
deg[a]++, deg[b]++;
while (cin >> a >> b, a + b)
deg[a]++, deg[b]++;
bool judge = deg[1] % 2 == 1 && deg[2] % 2 == 1;
for (int i = 3; i < 51; i++)
if (d... | replace | 7 | 8 | 7 | 8 | 0 | |
p00086 | 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>
#include... | // 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>
#include... | delete | 61 | 63 | 61 | 61 | 0 | i = 3 (L51) /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p00086/C++/s032715447.cpp
intersection[i].size() = 3 (L52) /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p00086/C++/s032715447.cpp
|
p00087 | C++ | Runtime Error | #include <cstdlib>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
double calc(char op, double a, double b) {
switch (op) {
case '+':
return a + b;
case '-':
return a - b;
case '*':
return a * b;
case '/':
return a / b;
}
}
int main() {
std::s... | #include <cstdlib>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
double calc(char op, double a, double b) {
switch (op) {
case '+':
return a + b;
case '-':
return a - b;
case '*':
return a * b;
case '/':
return a / b;
}
}
int main() {
std::s... | replace | 28 | 30 | 28 | 29 | -11 | |
p00087 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <... | replace | 66 | 67 | 66 | 67 | 0 | |
p00087 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define ... | replace | 32 | 33 | 32 | 48 | -11 | |
p00087 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | replace | 49 | 50 | 49 | 50 | -11 | |
p00087 | C++ | Runtime Error | #include <iomanip>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
string S, U[1000];
stack<double> T;
int cnt;
double a, b;
int main() {
while (getline(cin, S)) {
cnt = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == ' ') {
cnt++;
} else {
U[cnt] +=... | #include <iomanip>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
string S, U[1000];
stack<double> T;
int cnt;
double a, b;
int main() {
while (getline(cin, S)) {
for (int i = 0; i < 1000; i++) {
U[i] = "";
}
cnt = 0;
for (int i = 0; i < S.size(); i++) {
if (S[... | insert | 11 | 11 | 11 | 14 | -6 | terminate called after throwing an instance of 'std::invalid_argument'
what(): stoi
|
p00087 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
int main() {
string s;
while (getline(cin, s)) {
stringstream ss(s);
stack<double> stk;
while (ss >> s) {
if (isdigit(s[0])) {... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
int main() {
string s;
while (getline(cin, s)) {
stringstream ss(s);
stack<double> stk;
while (ss >> s) {
if (isdigit(*s.rbegi... | replace | 16 | 17 | 16 | 17 | -11 | |
p00087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
#define BINARY(x) static_cast<bitset<16>>(x)
#define rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
#define BINARY(x) static_cast<bitset<16>>(x)
#define rep(i, n) for... | replace | 33 | 34 | 33 | 34 | -11 | |
p00087 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
while (true) {
stack<do... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
while (true) {
stack<do... | replace | 34 | 35 | 34 | 35 | 0 | |
p00087 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
double x, y;
string s;
while (getline(cin, s)) {
stack<double> box;
s = s + '\0';
for (int i = 0; i < (int)s.size() - 1; i++) {
if (s[i] == '-') {
if (!isdigit(s[... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
double x, y;
string s;
while (getline(cin, s)) {
stack<double> box;
s = s + ' ';
for (int i = 0; i < (int)s.size() - 1; i++) {
if (s[i] == '-') {
if (!isdigit(s[i... | replace | 11 | 12 | 11 | 12 | 0 | |
p00087 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
int main() {
string str;
while (getline(cin, str)) {
stack<double> st;
stringstream ss;
ss << str;
string item;
while (ss >> item) {
char c = item.at(0);
... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
int main() {
string str;
while (getline(cin, str)) {
stack<double> st;
stringstream ss;
ss << str;
string item;
while (ss >> item) {
char c = item.at(0);
... | replace | 20 | 21 | 20 | 22 | -11 | |
p00087 | C++ | Runtime Error | #include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
int main() {
string str;
while (getline(cin, str)) {
stack<double> S;
stringstream sin(str);
string temp;
while (sin >> temp) {
switch (temp[0]) {
double a, b;
case '+':
a = S... | #include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
int main() {
string str;
while (getline(cin, str)) {
stack<double> S;
stringstream sin(str);
string temp;
while (sin >> temp) {
bool flag = false;
if (temp.length() == 1) {
flag = tru... | replace | 14 | 45 | 14 | 52 | -11 | |
p00087 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
int main() {
... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
int main() {
... | replace | 27 | 28 | 27 | 28 | -11 | |
p00087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
#define TT template <typename T>
#define ET(T) typename T::value_type
TT inline T sq(T x) { return x * x; }
TT inline T In() {
T x;
cin >> x;
return x;
}
TT inline int ubnd(T &v, ET(T) x) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
#define TT template <typename T>
#define ET(T) typename T::value_type
TT inline T sq(T x) { return x * x; }
TT inline T In() {
T x;
cin >> x;
return x;
}
TT inline int ubnd(T &v, ET(T) x) {
... | replace | 68 | 70 | 68 | 70 | -11 | |
p00087 | C++ | Runtime Error | // Name: Strange Mathematical Expression
// Level: 1
// Category: 逆ポーランド記法,やるだけ
// Note:
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
string line;
while ... | // Name: Strange Mathematical Expression
// Level: 1
// Category: 逆ポーランド記法,やるだけ
// Note:
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
string line;
while ... | replace | 25 | 26 | 25 | 26 | -11 | |
p00087 | C++ | Runtime Error | #include <algorithm>
#include <math.h>
#include <stack>
#include <stdio.h>
using namespace std;
int main() {
char buf[200];
stack<double> S;
double tmp, op1, op2;
bool numFLG, negFLG;
while (fgets(buf, 200, stdin) != 0) {
numFLG = false;
negFLG = false;
tmp = 0;
for (int i = 0; buf[i] != '\... | #include <algorithm>
#include <math.h>
#include <stack>
#include <stdio.h>
using namespace std;
int main() {
char buf[200];
stack<double> S;
double tmp, op1, op2;
bool numFLG, negFLG;
while (fgets(buf, 200, stdin) != 0) {
numFLG = false;
negFLG = false;
tmp = 0;
for (int i = 0; buf[i] != '\... | replace | 50 | 52 | 50 | 51 | -11 | |
p00087 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
#define rep2(x, from, to) for (int x = (from); x < (to); ++(x))
#define rep(x, to) rep2(x, 0, to)
int main() {
string str;
while (getline(cin, str)) {
stack<doub... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
#define rep2(x, from, to) for (int x = (from); x < (to); ++(x))
#define rep(x, to) rep2(x, 0, to)
int main() {
string str;
while (getline(cin, str)) {
stack<doub... | replace | 17 | 18 | 17 | 18 | -11 | |
p00087 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
#define rep2(x, from, to) for (int x = (from); x < (to); ++(x))
#define rep(x, to) rep2(x, 0, to)
int main() {
string str;
while (getline(cin, str)) {
stack<dou... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
#define rep2(x, from, to) for (int x = (from); x < (to); ++(x))
#define rep(x, to) rep2(x, 0, to)
int main() {
string str;
while (getline(cin, str)) {
stack<dou... | replace | 18 | 19 | 18 | 19 | -11 | |
p00087 | C++ | Runtime Error |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>
#include <algorithm>
#include <bitset>
#include <complex>
#include <list>
#in... |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>
#include <algorithm>
#include <bitset>
#include <complex>
#include <list>
#in... | replace | 87 | 88 | 87 | 88 | -11 | |
p00087 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {... | replace | 30 | 31 | 30 | 31 | -11 | |
p00087 | C++ | Runtime Error | #include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
int main() {
string str;
double a, b;
while (getline(cin, str)) {
stack<double> st;
stringstream ss(str);
string s;... | #include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
int main() {
string str;
double a, b;
while (getline(cin, str)) {
stack<double> st;
stringstream ss(str);
string s;... | replace | 23 | 24 | 23 | 24 | -11 | |
p00087 | C++ | Runtime Error | #include <cstdio>
#include <stack>
using namespace std;
bool isope(char c) { return c == '+' || c == '-' || c == '*' || c == '/'; }
double calc(double a, char c, double b) {
switch (c) {
case '+':
return a + b;
case '-':
return a - b;
case '*':
return a * b;
case '/':
return a / b;
}
}
i... | #include <cstdio>
#include <stack>
using namespace std;
bool isope(char c) { return c == '+' || c == '-' || c == '*' || c == '/'; }
double calc(double a, char c, double b) {
switch (c) {
case '+':
return a + b;
case '-':
return a - b;
case '*':
return a * b;
case '/':
return a / b;
}
}
i... | replace | 30 | 31 | 30 | 31 | -11 | |
p00087 | C++ | Runtime Error | #include <cctype>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
int main() {
string str;
while (getline(cin, str)) {
stack<double> S;
stringstream ss;
ss << str;
while (ss >> str) {
if (isdigit(str[0])) {
double d = (d... | #include <cctype>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
int main() {
string str;
while (getline(cin, str)) {
stack<double> S;
stringstream ss;
ss << str;
while (ss >> str) {
if (str[0] >= '0' && str[0] <= '9' || str.si... | replace | 14 | 17 | 14 | 16 | -11 | |
p00087 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
char str[128];
while (fgets(str, sizeof(str), stdin) != NULL) {
stack<double> s;
for (int i = 0; str[i] && str[i] != '\n';) {
if (str[i] == ' ')
i++;
else if (... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
char str[128];
while (fgets(str, sizeof(str), stdin) != NULL) {
stack<double> s;
for (int i = 0; str[i] && str[i] != '\n';) {
if (str[i] == ' ')
i++;
else if (... | insert | 23 | 23 | 23 | 33 | -11 | |
p00087 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
#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 <cctype>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | replace | 26 | 27 | 26 | 27 | -11 | |
p00088 | C++ | Memory Limit Exceeded | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
char tmp;
int sum;
string inp;
string before(""), num(""), after("");
while (tmp = getchar()) {
if (tmp == '\n') {
before += inp;
after = ("");
num = ("");
for (int i = 0; i < before.l... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
char tmp;
int sum;
string inp;
string before(""), num(""), after("");
while (scanf("%c", &tmp) != EOF) {
if (tmp == '\n') {
before += inp;
after = ("");
num = ("");
for (int i = 0; i <... | replace | 13 | 14 | 13 | 14 | MLE | |
p00088 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
#define rrep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define erep(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) <... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
#define rrep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define erep(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) <... | insert | 110 | 110 | 110 | 112 | TLE | |
p00088 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
string e = "ABCDEFGHIJKLMNOPQRSTUVWXYZ .,-'?";
vector<string> s1 = {"100101", "10011010", "0101", "0001", "110",
"01001", "10011011", "010000", "0111", "10011000",
"0110", "00100... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
string e = "ABCDEFGHIJKLMNOPQRSTUVWXYZ .,-'?";
vector<string> s1 = {"100101", "10011010", "0101", "0001", "110",
"01001", "10011011", "010000", "0111", "10011000",
"0110", "00100... | replace | 19 | 23 | 19 | 20 | TLE | |
p00089 | C++ | Runtime Error | #include <math.h>
#include <stack>
#include <stdio.h>
using namespace std;
int main() {
int dp[100][1000], row = 0, tmp, index, width[100], max_width = 0,
max_width_row;
char buf[55];
while (scanf("%s", buf) != EOF) {
index = tmp = 0;
for (int i = 0; buf[i] != '\0'; i++) {
i... | #include <math.h>
#include <stack>
#include <stdio.h>
using namespace std;
int main() {
int dp[100][200], row = 0, tmp, index, width[100], max_width = 0,
max_width_row;
char buf[200];
while (scanf("%s", buf) != EOF) {
index = tmp = 0;
for (int i = 0; buf[i] != '\0'; i++) {
if... | replace | 8 | 11 | 8 | 11 | 0 | |
p00089 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using name... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using name... | replace | 64 | 66 | 64 | 67 | 0 | > a[0][0] = 7
|
p00089 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
using namespace std;
int n[99][50], m[99][50];
string s[99];
int main() {
int l = 0;
while (getline(cin, s[l]))
l++;
for (int i = 0; i < l; i++)... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
using namespace std;
int n[99][50], m[99][50];
string s[100];
int main() {
int l = 0;
while (getline(cin, s[l]))
l++;
for (int i = 0; i < l; i++... | replace | 12 | 13 | 12 | 13 | 0 | |
p00090 | C++ | Time Limit Exceeded | /* template.cpp [[[ */
#include <bits/stdc++.h>
using namespace std;
#define get_macro(a, b, c, d, name, ...) name
#define rep(...) get_macro(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) \
get_macro(__VA_ARGS__, rrep4, rrep3, rrep2, r... | /* template.cpp [[[ */
#include <bits/stdc++.h>
using namespace std;
#define get_macro(a, b, c, d, name, ...) name
#define rep(...) get_macro(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) \
get_macro(__VA_ARGS__, rrep4, rrep3, rrep2, r... | replace | 47 | 49 | 47 | 49 | TLE | |
p00090 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int dy[] = {-1, 0, 1, 0, 1, 1, -1, -1};
const int INF = 1 << 30;
const double EPS = 1e-15;
#define PB push_back
#define mk make_pair
#define fi first
#define se second
#define ll long long
#define reps(i, j, k) for (int i ... | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int dy[] = {-1, 0, 1, 0, 1, 1, -1, -1};
const int INF = 1 << 30;
const double EPS = 1e-15;
#define PB push_back
#define mk make_pair
#define fi first
#define se second
#define ll long long
#define reps(i, j, k) for (int i ... | replace | 186 | 187 | 186 | 187 | TLE | |
p00090 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
ty... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
ty... | replace | 172 | 173 | 172 | 174 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.