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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p01171 | C++ | Time Limit Exceeded | #include <cstdio>
using namespace std;
#define MAXNUM 1000001
bool prime[MAXNUM];
void eratosthenes() {
prime[0] = prime[1] = false;
for (int i = 2; i < MAXNUM; i++) {
prime[i] = true;
}
for (int i = 2; i * i < MAXNUM; i++) {
if (prime[i]) {
for (int j = i * i; j < MAXNUM; j += i) {
pr... | #include <cstdio>
using namespace std;
#define MAXNUM 1000001
bool prime[MAXNUM];
void eratosthenes() {
prime[0] = prime[1] = false;
for (int i = 2; i < MAXNUM; i++) {
prime[i] = true;
}
for (int i = 2; i * i < MAXNUM; i++) {
if (prime[i]) {
for (int j = i * i; j < MAXNUM; j += i) {
pr... | replace | 46 | 47 | 46 | 47 | TLE | |
p01171 | C++ | Runtime Error | #include <bitset>
#include <stdio.h>
#include <vector>
const int N = 100000;
int main() {
std::bitset<N> p;
std::vector<int> v, A, B;
int i, j, a, b;
for (i = 2; i < N; ++i)
if (!p[i])
for (v.push_back(i), j = i * 2; j < N; j += i)
p[j] = 1;
while (scanf("%d%d", &a, &b), a) {
A.clear(), ... | #include <bitset>
#include <stdio.h>
#include <vector>
const int N = 1000000;
int main() {
std::bitset<N> p;
std::vector<int> v, A, B;
int i, j, a, b;
for (i = 2; i < N; ++i)
if (!p[i])
for (v.push_back(i), j = i * 2; j < N; j += i)
p[j] = 1;
while (scanf("%d%d", &a, &b), a) {
A.clear(),... | replace | 3 | 4 | 3 | 4 | 0 | |
p01171 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (... | replace | 23 | 24 | 23 | 24 | 0 | |
p01171 | C++ | Runtime Error | //============================================================================
// Name : A.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <bits/st... | //============================================================================
// Name : A.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <bits/st... | replace | 38 | 39 | 38 | 39 | -8 | |
p01171 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | replace | 48 | 49 | 48 | 49 | 0 | |
p01171 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef vector<int> vi;
const int lim = 1000001;
vi prime_fact(int x, const vi &table) {
vi res;
while (x > 1) {
res.push_back(table[x]);
x /= table[x];
}
sort(all(res));
res.erase(unique(all(res)), res.end());
retu... | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef vector<int> vi;
const int lim = 1000001;
vi prime_fact(int x, const vi &table) {
vi res;
while (x > 1) {
res.push_back(table[x]);
x /= table[x];
}
sort(all(res));
res.erase(unique(all(res)), res.end());
retu... | replace | 19 | 20 | 19 | 20 | 0 | |
p01172 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
swap(a, b);
}
for (int r; (r = a % b) != 0;) {
a = b;
b = r;
}
return b;
}
int main() {
int x, y;
while (cin >> x >> y) {
const int g = gcd(x, y);
x /= g;
y /= g;
vector<int> seen(... | #include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
swap(a, b);
}
for (int r; (r = a % b) != 0;) {
a = b;
b = r;
}
return b;
}
int main() {
int x, y;
while (cin >> x >> y && x != 0) {
const int g = gcd(x, y);
x /= g;
y /= g;
vector<... | replace | 17 | 18 | 17 | 18 | -8 | |
p01172 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b, a) {
int s[1000000011] = {}, c = 0, g = __gcd(a, b);
a /= g, b /= g;
while (!s[a]) {
s[a] = (++c);
a = (a * 10) % b;
if (a < 0)
return 0;
}
if (a)
c++;
cout << s[a] - 1 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b, a) {
int s[1000000] = {};
int c = 0, g = __gcd(a, b);
a /= g, b /= g;
while (!s[a]) {
s[a] = (++c);
a = (a * 10) % b;
if (a < 0)
return 0;
}
if (a)
c++;
cout << s[a]... | replace | 5 | 6 | 5 | 7 | -11 | |
p01172 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 1000005
using namespace std;
int m[N];
int a, b, cnt, ans1, ans2;
int main() {
while (1) {
cin >> a >> b;
if (!a && !b)
break;
memset(m, -1, sizeof(m));
a %= b;
cnt = 0;
while (1) {
a *= 10;
if (m[a] != -1) {
ans1 = m[a], ans2 = cnt... | #include <bits/stdc++.h>
#define N 10000005
using namespace std;
int m[N];
int a, b, cnt, ans1, ans2;
int main() {
while (1) {
cin >> a >> b;
if (!a && !b)
break;
memset(m, -1, sizeof(m));
a %= b;
cnt = 0;
while (1) {
a *= 10;
if (m[a] != -1) {
ans1 = m[a], ans2 = cn... | replace | 1 | 2 | 1 | 2 | 0 | |
p01172 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = double;
const ld eps = 1e-9;
int adiv(int a) {
map<int, int> mp;
int num(a);
for (int i = 2; i <= a; ++i) {
while (num % i == 0) {
mp[i]++;
num /= i;
}
... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = double;
const ld eps = 1e-9;
int adiv(int a) {
map<int, int> mp;
int num(a);
for (int i = 2; i <= a; ++i) {
while (num % i == 0) {
mp[i]++;
num /= i;
}
... | replace | 49 | 51 | 49 | 51 | 0 | |
p01172 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
while (cin >> x >> y && (x || y)) {
map<int, int> mp;
int cnt = 0;
while (!mp.count(x % y)) {
if (x % y == 0)
break;
mp[x % y] = cnt++;
x %= y;
x *= 10;
}
if (x % y == 0) {
cout << cnt << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
while (cin >> x >> y && (x || y)) {
unordered_map<int, int> mp;
int cnt = 0;
while (!mp.count(x % y)) {
if (x % y == 0)
break;
mp[x % y] = cnt++;
x %= y;
x *= 10;
}
if (x % y == 0) {
cout ... | replace | 6 | 7 | 6 | 7 | TLE | |
p01183 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int N;
int a[20];
double opt;
int getNum[20];
int sel[20];
const double EPS = (1e-10);
bool EQ(double a, double b) { return abs(a - b) < EPS; }
bool check(int *tmparry) {
sort(tmpa... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int N;
int a[20];
double opt;
int getNum[20];
int sel[20];
const double EPS = (1e-10);
bool EQ(double a, double b) { return abs(a - b) < EPS; }
bool check(int *tmparry) {
sort(tmpa... | replace | 27 | 70 | 27 | 92 | TLE | |
p01183 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
// 三角形が作れるかどうか
bool tri(int a, int b, int c) {
int p[] = {a, b, c};
sort(p, p + 3);
return p[0] + p[1] > p[2];
}
double volume(double U, double V, double W, double u, double v, double w... | #include <algorithm>
#include <cmath>
#include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
// 三角形が作れるかどうか
bool tri(int a, int b, int c) {
int p[] = {a, b, c};
sort(p, p + 3);
return p[0] + p[1] > p[2];
}
double volume(double U, double V, double W, double u, double v, double w... | replace | 37 | 45 | 37 | 53 | TLE | |
p01186 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | insert | 50 | 50 | 50 | 52 | TLE | |
p01187 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
// #define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
// #define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof... | replace | 118 | 121 | 118 | 121 | 0 | |
p01187 | C++ | Runtime Error | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
struct Dinic {
const int INF = 1 << 28;
struct edge {
int to, cap, rev;
edge() {}
edge(int to, int cap, int rev) : to(to), cap(cap), rev(rev) {}
};
int n;
vector<vector<edge>> G;
vector<map<int, int>> M;
... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
struct Dinic {
const int INF = 1 << 28;
struct edge {
int to, cap, rev;
edge() {}
edge(int to, int cap, int rev) : to(to), cap(cap), rev(rev) {}
};
int n;
vector<vector<edge>> G;
vector<map<int, int>> M;
... | replace | 114 | 115 | 114 | 115 | 0 | |
p01187 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | replace | 137 | 140 | 137 | 138 | 0 | |
p01190 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered... | #include <algorithm>
#include <array>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered... | replace | 760 | 761 | 760 | 761 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p01192 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n;
int c[100];
int greedy(int x) {
int res = 0;
for (int i = n - 1; i >= 0; i--) {
res += x / c[i];
x %= c[i];
}
return res;
}
int dp[5000];
void solve() {
if (c[0] != 1) {
printf("Cannot pay some amount");
return;
}
fill(dp, dp + 5000,... | #include <bits/stdc++.h>
using namespace std;
int n;
int c[100];
int greedy(int x) {
int res = 0;
for (int i = n - 1; i >= 0; i--) {
res += x / c[i];
x %= c[i];
}
return res;
}
int dp[5000];
void solve() {
if (c[0] != 1) {
printf("Cannot pay some amount");
return;
}
fill(dp, dp + 5000,... | replace | 49 | 50 | 49 | 50 | 0 | |
p01199 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
#define min(a, b) (a > b ? b : a)
struct Edge {
int to, cap, rev;
Edge() {}
Edge(int t, int c, int r) : to(t), cap(c), rev(r) {}
};
typedef vector<Edge> Graph;
#define N 400
#define INF 1000000007
Graph g[N];
bool used[N];
void add_edge(int from, int... | #include <iostream>
#include <vector>
using namespace std;
#define min(a, b) (a > b ? b : a)
struct Edge {
int to, cap, rev;
Edge() {}
Edge(int t, int c, int r) : to(t), cap(c), rev(r) {}
};
typedef vector<Edge> Graph;
#define N 400
#define INF 1000000007
Graph g[N];
bool used[N];
void add_edge(int from, int... | insert | 71 | 71 | 71 | 73 | TLE | |
p01199 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define SOUR (N + N)
#define SINK (N + N + 1)
#define INF (1 << 29)
class Node {
public:
vector<int> to;
};
int flow[205][205], capa[205][205], N, M, L;
void Connect(vector<Node> &node, int u, int v... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define SOUR (N + N)
#define SINK (N + N + 1)
#define INF (1 << 29)
class Node {
public:
vector<int> to;
};
int flow[205][205], capa[205][205], N, M, L;
void Connect(vector<Node> &node, int u, int v... | replace | 96 | 97 | 96 | 97 | -11 | |
p01199 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define debug(x) cout << #x << " is " << x << endl;
using namespace std;
typedef pair<int, int> P;
const int INF = 1 << 29;
struct edge {
int to, cap, rev;
edge(int t, i... | #include <cstring>
#include <iostream>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define debug(x) cout << #x << " is " << x << endl;
using namespace std;
typedef pair<int, int> P;
const int INF = 1 << 29;
struct edge {
int to, cap, rev;
edge(int t, i... | replace | 22 | 23 | 22 | 23 | 0 | |
p01204 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define IINF (INT_MAX)
#define EPS (1e-7)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
// 作成中 VerifyしたものにはVerifyと書いてある
// Verify AOJ 0115
class Point3d {
public:
double x, y, z;
Point3d... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define IINF (INT_MAX)
#define EPS (1e-7)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
// 作成中 VerifyしたものにはVerifyと書いてある
// Verify AOJ 0115
class Point3d {
public:
double x, y, z;
Point3d... | replace | 248 | 249 | 248 | 249 | -6 | 1d612717-5c0d-4ded-b1cb-d9ae4fbfa129.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p01204/C++/s776448578.cpp:236: Segment3d nearest_segmentLL(Line3d, Line3d): Assertion `isParallel(l1,l2)' failed.
|
p01207 | C++ | Time Limit Exceeded | #include <cstdio>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
bool is_valid(const char *a, const char *b, int hit, int blow) {
rep(i, 4) rep(j, 4) if (a[i] == b[j]) {
if (i == j)
hit--;
else
blow--;
}
return hit == 0 && blow == 0;
}
int main() {
... | #include <cstdio>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
bool is_valid(const char *a, const char *b, int hit, int blow) {
rep(i, 4) rep(j, 4) if (a[i] == b[j]) {
if (i == j)
hit--;
else
blow--;
}
return hit == 0 && blow == 0;
}
int main() {
... | insert | 54 | 54 | 54 | 59 | TLE | |
p01208 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <valarray>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <valarray>
#include <... | replace | 66 | 67 | 66 | 67 | 0 | |
p01209 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | replace | 47 | 49 | 47 | 53 | 0 | |
p01213 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int n;
string S, dp[320][320];
int dp2[320][320];
inline string LCS(string &a1, string &a2) {
for (int i = 0; i <= a1.size(); i++) {
for (int j = 0; j <= a2.size(); j++)
dp2[i][j] = -1;
}
dp2[0][0] = 0;
for (int i = 0; i <= a1.size(); i++)
... | #include <iostream>
#include <string>
using namespace std;
int n;
string S, dp[320][320];
int dp2[320][320];
inline string LCS(string &a1, string &a2) {
for (int i = 0; i <= a1.size(); i++) {
for (int j = 0; j <= a2.size(); j++)
dp2[i][j] = -1;
}
dp2[0][0] = 0;
for (int i = 0; i <= a1.size(); i++)
... | replace | 30 | 31 | 30 | 31 | TLE | |
p01213 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
char str[310];
int dp[310][310];
int rev[310][310];
int main() {
while (1) {
scanf("%s", str);
if (str[0] == '#')
return 0;
int ret = 0;
string ans = "";
int len = strlen(str);
for (int i =... | #include <algorithm>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
char str[310];
int dp[310][310];
int rev[310][310];
int main() {
while (1) {
scanf("%s", str);
if (str[0] == '#')
return 0;
int ret = 0;
string ans = "";
int len = strlen(str);
for (int i =... | replace | 18 | 19 | 18 | 19 | -11 | |
p01213 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int sz1, sz2;
string s;
vector<int> c[128];
int off[128][322];
int dp[301][301];
pair<int, int> to[301][301];
int flag[301][301];
int dp_search(int sz1, int sz2) {
memset(dp, -1, sizeof(dp));
memset(flag, 0, sizeo... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int sz1, sz2;
string s;
vector<int> c[128];
int off[128][322];
int dp[301][301];
pair<int, int> to[301][301];
int flag[301][301];
int dp_search(int sz1, int sz2) {
memset(dp, -1, sizeof(dp));
memset(flag, 0, sizeo... | replace | 27 | 28 | 27 | 28 | TLE | |
p01214 | 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 | 76 | 77 | 76 | 78 | 0 | |
p01214 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#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 FOR(i, k, n) for (int i = (k); i < (i... | #include <algorithm>
#include <cassert>
#include <cmath>
#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 FOR(i, k, n) for (int i = (k); i < (i... | replace | 51 | 52 | 51 | 56 | TLE | |
p01218 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
bool LT(double a, double b) { return !equals(a, b) && a < b; }
bool LTE(double a, double b) { return equals(a, b) || a < b; }
... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
bool LT(double a, double b) { return !equals(a, b) && a < b; }
bool LTE(double a, double b) { return equals(a, b) || a < b; }
... | insert | 95 | 95 | 95 | 99 | MLE | |
p01219 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout << #x " = " << ((x)) << endl
template <class T, class U>
ostream &operator<<(ost... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout << #x " = " << ((x)) << endl
template <class T, class U>
ostream &operator<<(ost... | replace | 66 | 67 | 66 | 67 | TLE | |
p01220 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | replace | 28 | 29 | 28 | 29 | 0 | |
p01223 | C++ | Time Limit Exceeded | #include <stdio.h>
int max(int x, int y) { return x > y ? x : y; }
int min(int x, int y) { return x < y ? x : y; }
int main(void) {
int t, n, h[101], i, up = 0, down = 0;
scanf("%d", &t);
while (t--, scanf("%d", &n)) {
for (i = 0; i < n; i++)
scanf("%d", &h[i]);
for (i = up = down = 0; i < n - ... | #include <stdio.h>
int max(int x, int y) { return x > y ? x : y; }
int min(int x, int y) { return x < y ? x : y; }
int main(void) {
int t, n, h[101], i, up = 0, down = 0;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &h[i]);
for (i = up = down = 0; i < ... | replace | 11 | 12 | 11 | 13 | TLE | |
p01223 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
P solve(int n, int h[]) {
P answer(0, 0);
for (int i = 0; i < n - 1; ++i) {
if (h[i] < h[i + 1]) {
answer.first = max(answer.first, h[i + 1] - h[i]);
}
if (h[i] > h[i + 1]) {
answer.second = max(answer.secon... | #include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
P solve(int n, int h[]) {
P answer(0, 0);
for (int i = 0; i < n - 1; ++i) {
if (h[i] < h[i + 1]) {
answer.first = max(answer.first, h[i + 1] - h[i]);
}
if (h[i] > h[i + 1]) {
answer.second = max(answer.secon... | replace | 25 | 26 | 25 | 26 | TLE | |
p01224 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define r(i, n) for (int i = 1; i < n; i++)
using namespace std;
int main() {
long long n, p, a, b;
while (cin >> n, n) {
long long s = 1;
if (n == 1)
s--;
for (int i = 2; i < n / 2; i++)
if (n % i == 0)
s += i + n / i;
if (n < s)
cout << "abundant ... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 1; i < n; i++)
using namespace std;
int main() {
long long n, p, a, b;
while (cin >> n, n) {
long long s = 1;
if (n == 1)
s--;
for (int i = 2; i * i < n; i++)
if (n % i == 0)
s += i + n / i;
if (n < s)
cout << "abundant ... | replace | 9 | 10 | 9 | 10 | TLE | |
p01224 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
long long int N, i, j, yaku;
while (scanf("%d", &N), N) {
yaku = 0;
for (i = 1; i * i <= N; i++) {
if (N % i == 0) {
yaku += i + N / i;
}
if (N == i * i) {
yaku -= i;
}
if (yaku > 2 * N)
break;
}
// printf("%d\n",... | #include <stdio.h>
int main() {
long long int N, i, j, yaku;
while (scanf("%lld", &N)) {
if (N == 0)
break;
yaku = 0;
for (i = 1; i * i <= N; i++) {
if (N % i == 0) {
yaku += i + N / i;
}
if (N == i * i) {
yaku -= i;
}
if (yaku > 2 * N)
break;... | replace | 4 | 5 | 4 | 7 | TLE | |
p01224 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n != 0) {
int sum = 0;
for (int i = 1; i <= n / 2; i++) {
if (n % i == 0)
sum += i;
}
if (sum < n)
cout << "deficient number" << endl;
if (sum == n)
cout << "perfect number" << endl;
if ... | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n != 0) {
if (n == 1) {
cout << "deficient number" << endl;
continue;
}
int sum = 1;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
if (n / i != i) {
sum += (i + n / i);
... | replace | 7 | 11 | 7 | 20 | TLE | |
p01224 | C++ | Time Limit Exceeded | #include <stdio.h>
#pragma warning(disable : 4996)
int n;
int main() {
while (true) {
scanf("%d", &n);
if (n == 0)
break;
int ret = 0;
for (int i = 1; i < n; i++) {
if (n % i == 0)
ret += i;
}
if (n > ret) {
printf("deficient number\n");
} else if (n == ret) {
... | #include <stdio.h>
#pragma warning(disable : 4996)
int n;
int main() {
while (true) {
scanf("%d", &n);
if (n == 0)
break;
int ret = n > 1 ? 1 : 0;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
if (i * i != n) {
ret += i + n / i;
} else {
ret += i;... | replace | 8 | 12 | 8 | 17 | TLE | |
p01224 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long int n, sum;
while (cin >> n, n) {
int N = n;
sum = 1;
for (int i = 1; i <= n; i++) {
if (n % i == 0) {
int j = 1, temp = 1;
while (n % i == 0 && i != 1) {
n /= i;
temp += (int)pow(... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, sum;
while (cin >> n, n) {
int N = n;
sum = 1;
for (int i = 1; i <= n; i++) {
if (n % i == 0) {
int j = 1, temp = 1;
while (n % i == 0 && i != 1) {
n /= i;
temp += (int)pow(i, j++);
... | replace | 5 | 6 | 5 | 6 | TLE | |
p01224 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a = 6;
while (cin >> a && a != 0) {
long long sum = 1, a2 = a;
int i = 2;
while (a != 1) {
if (a % i == 0) {
int j = 1;
long long sum2 = 1;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a = 6;
while (cin >> a && a != 0) {
long long sum = 1, a2 = a;
int i = 2;
while (a != 1) {
if (a % i == 0) {
int j = 1;
long long sum2 = 1;
... | replace | 22 | 23 | 22 | 26 | TLE | |
p01224 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | replace | 38 | 41 | 38 | 45 | TLE | |
p01224 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
long long n;
while (cin >> n, n) {
if (n == 1) {
cout << "deficient number" << endl;
continue;
}
long long total = 1;
long long a = 0;
for (int i = 2; a != i && i < n; i++) {
if (n % i == 0) {
total += i;
... | #include <iostream>
using namespace std;
int main(void) {
long long n;
while (cin >> n, n) {
if (n == 1) {
cout << "deficient number" << endl;
continue;
}
long long total = 1;
long long a = 0;
for (int i = 2; a != i && i < n / 2; i++) {
if (n % i == 0) {
total +=... | replace | 18 | 19 | 18 | 19 | TLE | |
p01224 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (!n)
break;
int count = 0;
for (int i = 1; i <= n / 2; i++) {
if (n % i == 0)
count += i;
}
if (count == n)
cout << "perfect number" << endl;
else if (count > n)
cout << "abund... | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (!n)
break;
int count = 0;
for (int i = 1; i * i < n; i++) {
if (i == 1)
count++;
else if (n % i == 0) {
count += (i + n / i);
}
}
if (count == n)
cout << "perfect nu... | replace | 9 | 12 | 9 | 15 | TLE | |
p01226 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
for (; t--;) {
int h, w;
cin >> h >> w;
// cout<<h<<" "<<w<<endl;
char maps[h][w];
int x, y;
// char move; //^=0,>=1,v=2,<=3
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++) {
cin... | #include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
for (; t--;) {
int h, w;
cin >> h >> w;
// cout<<h<<" "<<w<<endl;
char maps[h][w];
int x, y;
// char move; //^=0,>=1,v=2,<=3
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++) {
cin... | replace | 72 | 73 | 72 | 74 | -11 | |
p01227 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define MP make_pair
#define PB push_back
#define ALL(a) (a).begin(), (a).end()
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
int main() {
int times;
cin >> times;
REP(i, times) {
int ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define MP make_pair
#define PB push_back
#define ALL(a) (a).begin(), (a).end()
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
int main() {
int times;
cin >> times;
REP(i, times) {
int ... | replace | 23 | 24 | 23 | 24 | 0 | |
p01227 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main(void) {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
vector<int> dist;
int pre;... | #include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main(void) {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
vector<int> dist;
int pre;... | replace | 26 | 27 | 26 | 27 | 0 | |
p01227 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int t;
cin >> t;
for (int a = 0; a < t; a++) {
int n, k, x[100000], sum;
vector<int> vec;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x[i];
if (i)
vec.push_back(x[i] - x[i - 1]... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int t;
cin >> t;
for (int a = 0; a < t; a++) {
int n, k, x[100000], sum;
vector<int> vec;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x[i];
if (i)
vec.push_back(x[i] - x[i - 1]... | replace | 19 | 20 | 19 | 20 | 0 | |
p01227 | C++ | Runtime Error | /* 2012-10-26T16:24:59 */
#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 <iterator... | /* 2012-10-26T16:24:59 */
#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 <iterator... | replace | 228 | 229 | 228 | 234 | 0 | |
p01227 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int set, i, j, p, q, n, k, input[10010], st, en, sa[10010], cont;
scanf("%d", &set);
for (q = 0; q < set; q++) {
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &input[i]);
}
st = ... | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int set, i, j, p, q, n, k, input[100100], st, en, sa[100100], cont;
scanf("%d", &set);
for (q = 0; q < set; q++) {
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &input[i]);
}
st ... | replace | 6 | 7 | 6 | 7 | 0 | |
p01227 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; t++) {
int n, k;
cin >> n >> k;
int x[n], gap[n - 1];
for (int j = 0; j < n; j++)
cin >> x[j];
for (int j = 0; j < n - 1; j++)
gap[j] = x[j + 1] - x[j];
sort(&gap... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int n, k;
cin >> n >> k;
int x[n], gap[n - 1];
for (int j = 0; j < n; j++)
cin >> x[j];
for (int j = 0; j < n - 1; j++)
gap[j] = x[j + 1] - x[j];
sort(&gap... | replace | 7 | 8 | 7 | 8 | TLE | |
p01227 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using name... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using name... | replace | 22 | 23 | 22 | 23 | 0 | |
p01227 | C++ | Runtime Error | #include <bits/stdc++.h>
#define loop(i, a, b) for (int i = (a); i < int(b); i++)
#define rep(i, b) loop(i, 0, b)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
using namespace std;
typedef vector<int> vi;
int main() {
int t;
cin >> t;
rep(_, t) {
int n, k;
cin >> n >> ... | #include <bits/stdc++.h>
#define loop(i, a, b) for (int i = (a); i < int(b); i++)
#define rep(i, b) loop(i, 0, b)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
using namespace std;
typedef vector<int> vi;
int main() {
int t;
cin >> t;
rep(_, t) {
int n, k;
cin >> n >> ... | replace | 28 | 29 | 28 | 31 | 0 | |
p01227 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int t;
std::cin >> t;
std::vector<int> space;
space.reserve(100000);
for (int i = 0; i < t; ++i) {
int n, k;
std::cin >> n >> k;
if (k >= n) {
// テゥツ?ゥテ・ツスツ禿」ツ?ォテ、ツクツ?・ツ崢榲・ツ?・テ・... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int t;
std::cin >> t;
std::vector<int> space;
space.reserve(100000);
for (int i = 0; i < t; ++i) {
int n, k;
std::cin >> n >> k;
if (k >= n) {
// テゥツ?ゥテ・ツスツ禿」ツ?ォテ、ツクツ?・ツ崢榲・ツ?・テ・... | replace | 17 | 18 | 17 | 19 | 0 | |
p01228 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef unsigned char uc;
struct R {
uc notes[1024];
int num;
void push(const uc ¬e) { notes[num++] = note; }
};
R rolls[8];
char hexmap[16] = {'0', '1', '2', '3', '4', '5', '6', '7',
'8', '9', 'A', 'B', 'C', 'D... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef unsigned char uc;
struct R {
uc notes[1024];
int num;
void push(const uc ¬e) { notes[num++] = note; }
};
R rolls[8];
char hexmap[16] = {'0', '1', '2', '3', '4', '5', '6', '7',
'8', '9', 'A', 'B', 'C', 'D... | insert | 69 | 69 | 69 | 71 | TLE | |
p01228 | C++ | Runtime Error | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | replace | 84 | 85 | 84 | 89 | 0 | |
p01229 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define... | replace | 29 | 30 | 29 | 30 | 0 | |
p01229 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int n, maxi;
int Ea[81], dp[81][321][321];
int rec(int idx, int prev, int now) {
if (idx == n - 1)
return now;
if (dp[idx][prev][now])
return dp[idx][prev][now];
int res = 0;
res = max(res, rec(idx + 1, now, Ea[idx + 1]))... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int n, maxi;
int Ea[81], dp[81][321][321];
int rec(int idx, int prev, int now) {
if (idx == n - 1)
return now;
if (dp[idx][prev][now])
return dp[idx][prev][now];
int res = 0;
res = max(res, rec(idx + 1, now, Ea[idx + 1]))... | replace | 15 | 19 | 15 | 17 | TLE | |
p01229 | C++ | Memory Limit Exceeded | // 15
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int p[400][400][81];
int dfs(vector<int> v) {
if (v.size() <= 2) {
return v.back();
} else {
if (p[v[0]][v[1]][v.size()]++) {
return 0;
} else {
int n = dfs(vector<int>(v.begin() + 1, v.end()));
if... | // 15
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool p[400][400][81];
int dfs(vector<int> v) {
if (v.size() <= 2) {
return v.back();
} else {
if (p[v[0]][v[1]][v.size()]++) {
return 0;
} else {
int n = dfs(vector<int>(v.begin() + 1, v.end()));
i... | replace | 7 | 8 | 7 | 8 | MLE | |
p01230 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef ... | insert | 148 | 148 | 148 | 149 | 0 | |
p01233 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long LL;
bool go(LL x, LL y, LL a, LL b) {
if (x == a)
return true;
if (y == b)
return true;
if (x + y == a + b)
return true;
if (x - y == a - b)
return true;
return false;
}
typed... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long LL;
bool go(LL x, LL y, LL a, LL b) {
if (x == a)
return true;
if (y == b)
return true;
if (x + y == a + b)
return true;
if (x - y == a - b)
return true;
return false;
}
typed... | replace | 41 | 42 | 41 | 42 | 0 | |
p01235 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define inf (1 << 29)
#define EPS (1e-11)
#define all(n) (n).begin(), (n).end()
#define C... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define inf (1 << 29)
#define EPS (1e-8)
#define all(n) (n).begin(), (n).end()
#define CO... | replace | 12 | 13 | 12 | 13 | 0 | |
p01236 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
int H, W;
vector<pair<int, int>> get_z(int now_x, int now_y) {
int rest = W + 1;
vector<pair<int, int>> z;
while (rest--) {
if (!now_x && !now_y)
break;
if (!now_x) {
... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
int H, W;
vector<pair<int, int>> get_z(int now_x, int now_y) {
int rest = W + 1;
vector<pair<int, int>> z;
while (rest--) {
if (!now_x && !now_y)
break;
if (!now_x) {
... | insert | 120 | 120 | 120 | 122 | TLE | |
p01240 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int field[21][21];
int dp[2][1 << 20];
int h, w;
//
// int dfs(int a,int s){
// if(a==h*w)return 0;
// if(dp[a][s]!=-1)return dp[a][s];
// int res=0;
// int curh=a/w;
// int curw=a%w;
// // ツ置ツつゥツづ按つ「
// {
// int ns=s;... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int field[21][21];
int dp[2][1 << 20];
int h, w;
//
// int dfs(int a,int s){
// if(a==h*w)return 0;
// if(dp[a][s]!=-1)return dp[a][s];
// int res=0;
// int curh=a/w;
// int curw=a%w;
// // ツ置ツつゥツづ按つ「
// {
// int ns=s;... | insert | 43 | 43 | 43 | 53 | TLE | |
p01240 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | replace | 113 | 115 | 113 | 115 | 0 | |
p01244 | 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;
vector<int> primes;
void hurui(const int amax) {
static bool flag = false;
if (flag)
return;
vector<int> sos;
sos = vector<int>(amax + 1, true);
sos[0] ... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
vector<int> primes;
void hurui(const int amax) {
static bool flag = false;
if (flag)
return;
vector<int> sos;
sos = vector<int>(amax + 1, true);
sos[0] ... | insert | 64 | 64 | 64 | 66 | TLE | |
p01248 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX - 1;
int memo[1111];
int func(int pos, const int &n, const int &width, const vector<int> &a) {
if (memo[pos] != -1)
return memo[pos];
if (pos >= n)
return 0;
int w = 0;
int res = INF;
int p;
int pp = -1;
for (p = pos; p < n; p... | #include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX - 1;
int memo[1111];
int func(int pos, const int &n, const int &width, const vector<int> &a) {
if (memo[pos] != -1)
return memo[pos];
if (pos >= n)
return 0;
int w = 0;
int res = INF;
int p;
int pp = -1;
for (p = pos; p < n; p... | replace | 23 | 25 | 23 | 27 | TLE | |
p01250 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define PI 3.14159265358979323846264
int main() {
while (true) {
long double p;
cin >> p;
for (long double i = 0; i < 20000000; i += 1) {
long double q1 = (PI - p) * i;
long double q2 = (PI + p) * i;
int r1 = q1, r2 = q2;
if (r1 < r2) {
... | #include <iostream>
using namespace std;
#define PI 3.14159265358979323846264
int main() {
while (true) {
long double p;
cin >> p;
if (p == 0)
break;
for (long double i = 0; i < 20000000; i += 1) {
long double q1 = (PI - p) * i;
long double q2 = (PI + p) * i;
int r1 = q1, r2 = ... | insert | 7 | 7 | 7 | 9 | TLE | |
p01250 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
const int MAX = pow(2, 30);
int main() {
while (true) {
double r;
cin >> r;
if (r == 0) {
break;
}
for (int i = 2; i < MAX; i++) {
for (int j = 1; j < MAX; j++) {
double diff = (double)i / j - M_PI;
if (-r <= d... | #include <cmath>
#include <iostream>
using namespace std;
const int MAX = pow(2, 30);
int main() {
while (true) {
double r;
cin >> r;
if (r == 0) {
break;
}
for (int i = 2; i < MAX; i++) {
int j = (int)floor(i / (M_PI + r));
for (; j < MAX; j++) {
double diff = (double)... | replace | 14 | 15 | 14 | 16 | TLE | |
p01251 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int dy[] = {0, -1, 0, 1};
const int dx[] = {1, 0, -1, 0};
int W, H, N;
bool field[1000][1000];
bool used[4][110][110];
int main() {
while (cin >> W >> H >> N && (W | H | N)) {
memset(field, 0, sizeof(fiel... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int dy[] = {0, -1, 0, 1};
const int dx[] = {1, 0, -1, 0};
int W, H, N;
bool field[1000][1000];
bool used[4][1000][1000];
int main() {
while (cin >> W >> H >> N && (W | H | N)) {
memset(field, 0, sizeof(fi... | replace | 12 | 13 | 12 | 13 | 0 | |
p01253 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, T;
while (cin >> N >> T, (N || T)) {
string s;
cin >> s;
double dp[1000][2] = {0};
dp[0][0] = 1.0;
for (int i = 1; i <= T; i++) {
for (int j = 0; j < N; j++)
dp[j][i % 2] = 0.0;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, T;
while (cin >> N >> T, (N || T)) {
string s;
cin >> s;
double dp[2005][2] = {0};
dp[0][0] = 1.0;
for (int i = 1; i <= T; i++) {
for (int j = 0; j < N; j++)
dp[j][i % 2] = 0.0;
... | replace | 11 | 12 | 11 | 12 | 0 | |
p01254 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF (1 << 21)
struct NODE {
int to, cost, flag;
NODE(int to, int cost, int flag) : to(to), cost(cost), flag(flag){};
};
bool operator<(const NODE &a, const NODE &b) {
if (a.cost != b.cost)
return a.cost >... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF (1 << 21)
struct NODE {
int to, cost, flag;
NODE(int to, int cost, int flag) : to(to), cost(cost), flag(flag){};
};
bool operator<(const NODE &a, const NODE &b) {
if (a.cost != b.cost)
return a.cost >... | replace | 38 | 39 | 38 | 39 | MLE | |
p01257 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int n, m, cost[100001], op[1023];
void dfs(int sum) {
rep(i, (1 << n) - 1) if (cost[sum + op[i]] > cost[sum] + 1)
cost[sum + op[i]] = cost[sum] + 1,
dfs(sum + op[i]);
}
int main() {
whi... | #include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int n, m, cost[100001], op[1023];
void dfs(int sum) {
rep(i,
(1 << n) - 1) if (sum + op[i] <= m && cost[sum + op[i]] > cost[sum] + 1)
cost[sum + op[i]] = cost[sum] + 1,
dfs(sum + op... | replace | 6 | 7 | 6 | 8 | 0 | |
p01257 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define INF 1000000000;
using namespace std;
int n, m, a[11];
vector<int> coin;
int used[11];
void mk_coin(int sum, int k) {
for (int i = k; i < n; i++) {
if (used[i] == 1)
continue;
used[i] = 1;
coin.push_back(sum + a[i]);
mk_coin(sum +... | #include <algorithm>
#include <iostream>
#include <vector>
#define INF 1000000000;
using namespace std;
int n, m, a[11];
vector<int> coin;
int used[11];
void mk_coin(int sum, int k) {
for (int i = k; i < n; i++) {
if (used[i] == 1)
continue;
used[i] = 1;
coin.push_back(sum + a[i]);
mk_coin(sum +... | replace | 33 | 34 | 33 | 34 | 0 | |
p01261 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll pascal[61][61] = {{0ll}};
int main() {
for (int i = 0; i <= 60; ++i) {
pascal[i][0] = 1;
for (int j = 1; j <= i; ++j) {
pascal[i][j] = pascal[i - 1][j - 1] + pascal[i - 1][j];
}
}
while (true) {
int n, ... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll pascal[61][61] = {{0ll}};
int main() {
for (int i = 0; i <= 60; ++i) {
pascal[i][0] = 1;
for (int j = 1; j <= i; ++j) {
pascal[i][j] = pascal[i - 1][j - 1] + pascal[i - 1][j];
}
}
while (true) {
int n, ... | replace | 37 | 39 | 37 | 39 | 0 | |
p01267 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using LL = long long;
constexpr long long MOD = 1000000000 + 7;
c... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using LL = long long;
constexpr long long MOD = 1000000000 + 7;
c... | delete | 41 | 42 | 41 | 41 | 0 | sh: 1: pause: not found
|
p01267 | C++ | Runtime Error | #include <iostream>
#define REP(i, a, n) for (int i = ((int)a); i < ((int)n); i++)
using namespace std;
int N, A, B, C, X, Y[200];
int main(void) {
while (cin >> N >> A >> B >> C >> X) {
REP(i, 0, N) cin >> Y[i];
int ans = 0, k = 0;
while (ans <= 10000) {
if (X == Y[k]) {
k++;
if ... | #include <iostream>
#define REP(i, a, n) for (int i = ((int)a); i < ((int)n); i++)
using namespace std;
int N, A, B, C, X, Y[200];
int main(void) {
while (cin >> N >> A >> B >> C >> X, N) {
REP(i, 0, N) cin >> Y[i];
int ans = 0, k = 0;
while (ans <= 10000) {
if (X == Y[k]) {
k++;
... | replace | 7 | 8 | 7 | 8 | -8 | |
p01267 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N, A, B, C, X;
while (cin >> N >> A >> B >> C >> X, N || A || B || C || X) {
int Y[100];
for (int i = 0; i < N; ++i) {
cin >> Y[i];
}
int need[10001] = {0};
int cnt = 0;
for (int i = 0; i < N; ++i) {
if (!need[Y[i]])
... | #include <iostream>
using namespace std;
int main() {
int N, A, B, C, X;
while (cin >> N >> A >> B >> C >> X, N || A || B || C || X) {
int Y[100];
for (int i = 0; i < N; ++i) {
cin >> Y[i];
}
int need[10001] = {0};
int cnt = 0;
for (int i = 0; i < N; ++i) {
if (!need[Y[i]])
... | replace | 21 | 22 | 21 | 22 | TLE | |
p01268 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(int n, int k = 2) {
if (n < k * k) {
return true;
}
if (n % k == 0) {
return false;
}
return is_prime(n, k + 1);
}
int main() {
vector<int> prime;
for (int i = 2; i < 150000; i++) {
if (is_prime... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(int n, int k = 2) {
if (n < k * k) {
return true;
}
if (n % k == 0) {
return false;
}
return is_prime(n, k + 1);
}
int main() {
vector<int> prime;
for (int i = 2; i < 150000; i++) {
if (is_prime... | replace | 32 | 33 | 32 | 33 | -11 | |
p01268 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> Prime(100000), Matsuzaki(1000);
int judge(int n) {
if (n < 2)
return 0;
if (n == 2)
return 1;
if (n % 2 == 0)
return 0;
for (int i = 3; i <= n / i; i += 2) {
if (n % i == 0)
return 0;
}
return... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> Prime(1000000), Matsuzaki(100000);
int judge(int n) {
if (n < 2)
return 0;
if (n == 2)
return 1;
if (n % 2 == 0)
return 0;
for (int i = 3; i <= n / i; i += 2) {
if (n % i == 0)
return 0;
}
ret... | replace | 5 | 6 | 5 | 6 | -6 | malloc(): corrupted top size
|
p01268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int hurui[200000] = {0};
int sosuu[100000];
int cnt = 0;
vector<int> retu;
int N, P;
for (int i = 2; i <= 200000; i++) {
if (hurui[i] == 0) {
sosuu[cnt] = i;
cnt++;
for (in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int hurui[200000] = {0};
int sosuu[100000];
int cnt = 0;
vector<int> retu;
int N, P;
for (int i = 2; i <= 200000; i++) {
if (hurui[i] == 0) {
sosuu[cnt] = i;
cnt++;
for (in... | replace | 27 | 28 | 27 | 28 | TLE | |
p01268 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
bool e[100010];
void erato() {
fill(e, e + 150010, true);
e[0] = e[1] = false;
for (int i = 0; i < 150010; i++) {
if (!e[i])
continue;
for (int j = i + i; j < 150010; j += i) {
e[j] = false;
}
}
}
int main() {
erato();
... | #include <algorithm>
#include <iostream>
using namespace std;
bool e[150010];
void erato() {
fill(e, e + 150010, true);
e[0] = e[1] = false;
for (int i = 0; i < 150010; i++) {
if (!e[i])
continue;
for (int j = i + i; j < 150010; j += i) {
e[j] = false;
}
}
}
int main() {
erato();
... | replace | 4 | 5 | 4 | 5 | -11 | |
p01268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define EQ(a, b) (abs((a... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define EQ(a, b) (abs((a... | replace | 58 | 60 | 58 | 60 | TLE | |
p01268 | C++ | Runtime Error | /*
Hokudai Practice Contest 2014
B - Matsuzaki Number
ティツァツ」テヲツウツ陛ッツシツ堙ァツエツ?ヲツ閉ーテ・ツ按療ヲツ個凖ッツシツ凝・ツ?ィテヲツ篠「テァツエツ「
テ・ツ可催・ツ?ヲテァツ青?」ツ?ィテ」ツ?療」ツ?ヲテ」ツ??・ツ債?・ツ按?」ツ?ェテ・ツ、ツァテ」ツ?催」ツ?陛」ツ?セテ」ツ?ァテァツエツ?ヲツ閉ーテ」ツつ津ゥツ?催・ツ按療」ツ?ォテ・ツ按療ヲツ個凖」ツ?療」ツ?ヲテ」ツ?甘」ツ?催」ツ??
テ・ツ?・テ・ツ環嬾テ」ツ?ォテ・ツッツセテ」ツ?療」ツ?ヲテ・ツ、ツァテ」ツ?催」ツ?貧テ」ツつ暗」ツつ甘・ツ、ツァテ」ツ?催」ツ??ァツエツ?ヲツ閉ーテ」ツつ津ゥ... | /*
Hokudai Practice Contest 2014
B - Matsuzaki Number
ティツァツ」テヲツウツ陛ッツシツ堙ァツエツ?ヲツ閉ーテ・ツ按療ヲツ個凖ッツシツ凝・ツ?ィテヲツ篠「テァツエツ「
テ・ツ可催・ツ?ヲテァツ青?」ツ?ィテ」ツ?療」ツ?ヲテ」ツ??・ツ債?・ツ按?」ツ?ェテ・ツ、ツァテ」ツ?催」ツ?陛」ツ?セテ」ツ?ァテァツエツ?ヲツ閉ーテ」ツつ津ゥツ?催・ツ按療」ツ?ォテ・ツ按療ヲツ個凖」ツ?療」ツ?ヲテ」ツ?甘」ツ?催」ツ??
テ・ツ?・テ・ツ環嬾テ」ツ?ォテ・ツッツセテ」ツ?療」ツ?ヲテ・ツ、ツァテ」ツ?催」ツ?貧テ」ツつ暗」ツつ甘・ツ、ツァテ」ツ?催」ツ??ァツエツ?ヲツ閉ーテ」ツつ津ゥ... | replace | 34 | 35 | 34 | 35 | -6 | double free or corruption (!prev)
|
p01268 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i... | replace | 41 | 42 | 41 | 42 | -11 | |
p01268 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
bool f[1000002];
int main() {
for (int i = 3; i < 1000001; i += 2) {
f[i] = true;
for (int j = 3; j * j <= i; j += 2)
if (i % j == 0)
f[i] = false;
}
f[2]... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
bool f[1000002];
int main() {
for (int i = 3; i < 1000001; i += 2) {
f[i] = true;
for (int j = 3; j * j <= i; j += 2)
if (i % j == 0)
f[i] = false;
}
f[2]... | replace | 28 | 29 | 28 | 29 | -11 | |
p01268 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <stdint.h>
typedef uint32_t u32;
typedef uint64_t u64;
class Solver {
public:
Solver();
void solve(int N, int P);
private:
bool isprime[200000];
};
Solver::Solver() {
for (int i = 0; i < 200000; ++i) {
isprime[i] = true;
}
isprime[0] = isprime[1] = false;
for (int... | #include <bits/stdc++.h>
#include <stdint.h>
typedef uint32_t u32;
typedef uint64_t u64;
class Solver {
public:
Solver();
void solve(int N, int P);
private:
bool isprime[200000];
};
Solver::Solver() {
for (int i = 0; i < 200000; ++i) {
isprime[i] = true;
}
isprime[0] = isprime[1] = false;
for (int... | replace | 51 | 52 | 51 | 52 | TLE | |
p01268 | C++ | Time Limit Exceeded | // Name: Matsuzaki Number
// Level: 2
// Category: 素数
// Note:
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MAX_PRIME = 200000;
vector<int> primes;
bool is_prime[MAX_PRIME + 1];
void init() {
fill_n(is_prime, MAX_PRIME + 1, true);
is_prime[0] = is_prime[1] = false;
... | // Name: Matsuzaki Number
// Level: 2
// Category: 素数
// Note:
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MAX_PRIME = 200000;
vector<int> primes;
bool is_prime[MAX_PRIME + 1];
void init() {
fill_n(is_prime, MAX_PRIME + 1, true);
is_prime[0] = is_prime[1] = false;
... | replace | 31 | 32 | 31 | 32 | TLE | |
p01268 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
const int MAXN = 2 * 1e5;
vector<int> pri(2 * (int)1e5, true);
void prim() {
pri[1] = false;
for (int i = 2; i * i < MAXN; i++) {
if (pri[i])
for (int j = 2 * i; j < MAXN; j += i)
if (pri[j])
p... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
const int MAXN = 2 * 1e5;
vector<int> pri(2 * (int)1e5, true);
void prim() {
pri[1] = false;
for (int i = 2; i * i < MAXN; i++) {
if (pri[i])
for (int j = 2 * i; j < MAXN; j += i)
if (pri[j])
p... | replace | 20 | 21 | 20 | 21 | 0 | |
p01268 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(int n, int k = 3) {
if (n < k * k) {
return true;
}
if (n % k == 0) {
return false;
}
return is_prime(n, k + 2);
}
int main() {
vector<int> prime = {2};
for (int i = 3; i < 101300; i += 2) {
if ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(int n, int k = 3) {
if (n < k * k) {
return true;
}
if (n % k == 0) {
return false;
}
return is_prime(n, k + 2);
}
int main() {
vector<int> prime = {2};
for (int i = 3; i < 101300; i += 2) {
if ... | replace | 41 | 42 | 41 | 42 | -11 | |
p01268 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXNUM 200274
int main(void) {
int n, p, i, j, count1, count2, flag[MAXNUM + 1], tmp[MAXNUM + 1];
for (i = 0; i <= MAXNUM; i++)
flag[i] = 1;
flag[0] = flag[1] = 0;
for (i = 2; i <= sqrt((double)MAXNUM); i++) {
for (j =... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXNUM 300000
int main(void) {
int n, p, i, j, count1, count2, flag[MAXNUM + 1], tmp[MAXNUM + 1];
for (i = 0; i <= MAXNUM; i++)
flag[i] = 1;
flag[0] = flag[1] = 0;
for (i = 2; i <= sqrt((double)MAXNUM); i++) {
for (j =... | replace | 4 | 5 | 4 | 5 | -11 | |
p01268 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(int n, int k = 3) {
if (n < k * k) {
return true;
}
if (n % k == 0) {
return false;
}
return is_prime(n, k + 2);
}
int main() {
vector<int> prime = {2};
for (int i = 3; i < 101300; i += 2) {
if ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool is_prime(int n, int k = 3) {
if (n < k * k) {
return true;
}
if (n % k == 0) {
return false;
}
return is_prime(n, k + 2);
}
int main() {
vector<int> prime = {2};
for (int i = 3; i < 101300; i += 2) {
if ... | replace | 42 | 44 | 42 | 44 | -11 | |
p01268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 2000000;
bitset<MAX_N> sieve;
vector<int> primes;
void eratosthenes() {
sieve[0] = sieve[1] = true;
for (int i = 2; i < MAX_N; ++i) {
if (sieve[i]) {
continue;
}
primes.push_back(... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 2000000;
bitset<MAX_N> sieve;
vector<int> primes;
void eratosthenes() {
sieve[0] = sieve[1] = true;
for (int i = 2; i < MAX_N; ++i) {
if (sieve[i]) {
continue;
}
primes.push_back(... | replace | 29 | 30 | 29 | 30 | TLE | |
p01268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define pb push_back
#define all(v) v.begin(), v.end()
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define MAXBOOL 1000000
using namespace std;
int main() {
int n, p;
vector<int> prime;
bool check[MA... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define pb push_back
#define all(v) v.begin(), v.end()
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define MAXBOOL 500000
using namespace std;
int main() {
int n, p;
vector<int> prime;
bool check[MAX... | replace | 8 | 9 | 8 | 9 | TLE | |
p01269 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#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 LO... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#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 LO... | replace | 65 | 66 | 65 | 66 | -11 | |
p01269 | C++ | Runtime Error | // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2151
#include <algorithm>
#include <iostream>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
typedef pair<int, int> state; // 頂点、残金
typedef pair<state, int> pass; // 状態、悪党
typedef tuple<int, int, int> cand; // -1 * cost, po... | // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2151
#include <algorithm>
#include <iostream>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
typedef pair<int, int> state; // 頂点、残金
typedef pair<state, int> pass; // 状態、悪党
typedef tuple<int, int, int> cand; // -1 * cost, po... | replace | 26 | 27 | 26 | 27 | 0 | |
p01269 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define ITR(i, c) for (auto i = begin(c); i != end(c); ++i)
#define FORE(x, c) for (auto &x : c)
#define REP... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define ITR(i, c) for (auto i = begin(c); i != end(c); ++i)
#define FORE(x, c) for (auto &x : c)
#define ... | replace | 2 | 3 | 2 | 3 | MLE | |
p01269 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N, M, L;
int a, b;
int now;
cin >> N >> M >> L;
for (; N != 0;) {
vector<vector<bool>> graph(N, vector<bool>(N, false));
vector<vector<int>> distance(N, vector<int>(N)), evect(N, vector<... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N, M, L;
int a, b;
int now;
cin >> N >> M >> L;
for (; N != 0;) {
vector<vector<bool>> graph(N, vector<bool>(N, false));
vector<vector<int>> distance(N, vector<int>(N)), evect(N, vector<... | replace | 32 | 33 | 32 | 33 | TLE | |
p01269 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | replace | 116 | 120 | 116 | 122 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.