buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_N 100000
long long q[MAX_N];
long long x[MAX_N];
long long n, z;
vector<long long> p;
int main() {
while (true) {
for (int i = 0; i < MAX_N; i++) {
q[i] = 0;
x[i] = 0;
}
cin >> n;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_N 100000
long long q[MAX_N];
long long x[MAX_N];
long long n, z;
vector<long long> p;
int main() {
while (true) {
for (int i = 0; i < MAX_N; i++) {
q[i] = 0;
x[i] = 0;
}
cin >> n;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 300 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int m = (n - 1) / 2;
bool sq[10001] = {false};
int a[5001] = {0};
for (int i = 1; i < n; i++)
sq[(i * i) % n] = true;
for (int i = 1; i < n; i++) {
if (!sq[i])
continue;
for (int j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int m = (n - 1) / 2;
bool sq[10001] = {false};
int a[5001] = {0};
for (int i = 1; i < n; i++)
sq[(i * i) % n] = true;
for (int i = 0; i < n; i++) {
if (!sq[i])
continue;
for (int j... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 237 | 4 |
#include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int cnt[5010];
int main() {
int n;
while (cin >> n && n) {
set<int> st;
vector<int> v;
for (int i = 1; i < n; i++) {
st.insert(i * i % n);
}
set<int>::iterator it = st.begin();
while (it != s... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int cnt[5010];
int main() {
int n;
while (cin >> n && n) {
set<int> st;
vector<int> v;
for (int i = 1; i < n; i++) {
st.insert(i * i % n);
}
set<int>::iterator it = st.begin();
while (it != s... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 245 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | [["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13]] | 1 | 394 | 2 |
#include <cstdio>
#include <set>
int i, n, v[9999];
main() {
for (; scanf("%d", &n), n;) {
std::set<int> t;
for (i = 0; i < n;)
v[++i] = 0, t.insert(i * i % n);
for (auto s = t.begin(), S = s, T = t.end(); s != T; S = ++s)
for (; ++S != T; v[i > n / 2 ? n - i : i] += 2)
i = *S - *s;
... | #include <cstdio>
#include <set>
int i, n, v[9999];
main() {
for (; scanf("%d", &n), n;) {
std::set<int> t;
for (i = 0; i < n - 1;)
v[++i] = 0, t.insert(i * i % n);
for (auto s = t.begin(), S = s, T = t.end(); s != T; S = ++s)
for (; ++S != T; v[i > n / 2 ? n - i : i] += 2)
i = *S - *s... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 167 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
int ans[100000000], n;
while (cin >> n, n) {
vector<int> vec;
rep(i, (int)((n - 1) / 2) + 1) ans[i] = 0;
REP(i, 1, n) vec.push_bac... | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
int ans[1000000], n;
while (cin >> n, n) {
vector<int> vec;
rep(i, (int)((n - 1) / 2) + 1) ans[i] = 0;
REP(i, 1, n) vec.push_back(... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 269 | 2 |
#include <algorithm>
#include <iostream>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int number[5000];
void solve() {
int n;
while (cin >> n, n) {
memset(number, 0, sizeof(number));
set<int> Set;
for (int i = 1; i < n; ++i) {
Set.insert((i * i) % n);
}
vecto... | #include <algorithm>
#include <iostream>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int number[5000];
void solve() {
int n;
while (cin >> n, n) {
memset(number, 0, sizeof(number));
set<int> Set;
for (int i = 1; i < n; ++i) {
Set.insert((i * i) % n);
}
vecto... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 242 | 2 |
#include <stdio.h>
int main() {
int x[5], y[5], n, ax, ay, bx, by, i, j;
scanf("%d", &n);
while (n--) {
for (i = 0; i < 5; i++)
scanf("%d %d", &x[i], &y[i]);
int f[2] = {0};
for (i = 0; i < 2; i++) {
for (j = 0; j < 3; j++) {
ax = x[(j + 1) % 3] - x[j];
ay = y[(j + 1) & 3] ... | #include <stdio.h>
int main() {
int x[5], y[5], n, ax, ay, bx, by, i, j;
scanf("%d", &n);
while (n--) {
for (i = 0; i < 5; i++)
scanf("%d %d", &x[i], &y[i]);
int f[2] = {0};
for (i = 0; i < 2; i++) {
for (j = 0; j < 3; j++) {
ax = x[(j + 1) % 3] - x[j];
ay = y[(j + 1) % 3] ... | [["-", 0, 11, 12, 16, 31, 69, 71, 16, 17, 67], ["+", 0, 11, 12, 16, 31, 69, 71, 16, 17, 109]] | 0 | 253 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long double ld;
typed... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long double ld;
typed... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 545 | 2 |
#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;
#define EPS 1e-8
#define INF 1000000
struc... | #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;
#define EPS 1e-8
#define INF 1000000
struc... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["-", 0, 57, 15, 339, 51, 16, 12, 91, 17, 111], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79]] | 1 | 1,680 | 3 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#inclu... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#inclu... | [["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 660 | 2 |
def isin(x,y):
if S(x1,y1,x2,y2,x,y)+S(x1,y1,x3,y3,x,y)+S(x3,y3,x2,y2,x,y)-S(x1,y1,x2,y2,x3,y3) != 0:
return False
else:
return True
def S(x1,y1,x2,y2,x3,y3):
return abs(x1*(y2-y3)+x2*(y3-y1)+x3*(y1-y2))
for roop in range(int(input())):
x1,y1,x2,y2,x3,y3,xk,yk,xs,ys = list(map(int,inpu... | def isin(x,y):
if S(x1,y1,x2,y2,x,y)+S(x1,y1,x3,y3,x,y)+S(x3,y3,x2,y2,x,y)-S(x1,y1,x2,y2,x3,y3) != 0:
return False
else:
return True
def S(x1,y1,x2,y2,x3,y3):
return abs(x1*(y2-y3)+x2*(y3-y1)+x3*(y1-y2))
for roop in range(int(input())):
x1,y1,x2,y2,x3,y3,xk,yk,xs,ys = list(map(int,inpu... | [["-", 0, 652, 3, 4, 0, 41, 0, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 41, 0, 557, 0, 6]] | 5 | 192 | 2 |
from operator import sub,mul
def cross(a,b):
return a[0]*b[1] - a[1]*b[0]
def func(a,b):#
return [list(map(sub,aa,bb)) for aa,bb in zip(a,b)]
def check(a):
return all([x<0 for x in a]) or all([x>0 for x in a])
for _ in range(eval(input())):
line = list(map(int,input().split()))
tmp = list(zip(lin... | from operator import sub,mul
def cross(a,b):
return a[0]*b[1] - a[1]*b[0]
def func(a,b):#
return [list(map(sub,aa,bb)) for aa,bb in zip(a,b)]
def check(a):
return all([x<0 for x in a]) or all([x>0 for x in a])
for _ in range(eval(input())):
line = list(map(int,input().split()))
tmp = list(zip(lin... | [["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6]] | 5 | 251 | 2 |
#include <stdio.h>
int n, m;
int t[101][101];
int que[2000];
int qa, qb;
int calc(int start, int goal) {
int i, pos;
int visited[101];
int cost[101];
for (i = 0; i < 101; i++) {
visited[i] = 0;
cost[i] = 0;
}
qa = 0;
qb = 1;
que[0] = start;
visited[start] = 1;
while (qa < qb) {
pos =... | #include <stdio.h>
int n, m;
int t[101][101];
int que[2000];
int qa, qb;
int calc(int start, int goal) {
int i, pos;
int visited[101];
int cost[101];
for (i = 0; i < 101; i++) {
visited[i] = 0;
cost[i] = 0;
}
qa = 0;
qb = 1;
que[0] = start;
visited[start] = 1;
while (qa < qb) {
pos =... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 106], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 98], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 79]] | 0 | 393 | 4 |
#include <stdio.h>
int r[100][100], d[100], f[100];
int dijkstra(int s, int g) {
int min, p, i, j;
for (i = 0; i < 100; i++) {
d[i] = 100000;
f[i] = 0;
}
d[s] = 0;
while (1) {
min = 100000;
for (i = 0; i < 100; i++) {
if (d[i] < min && f[i] == 0) {
min = d[i];
p = i;
... | #include <stdio.h>
int r[100][100], d[100], f[100];
int dijkstra(int s, int g) {
int min, p, i, j;
for (i = 0; i < 100; i++) {
d[i] = 100000;
f[i] = 0;
}
d[s] = 0;
while (1) {
min = 100000;
for (i = 0; i < 100; i++) {
if (d[i] < min && f[i] == 0) {
min = d[i];
p = i;
... | [["-", 0, 14, 8, 9, 0, 37, 0, 69, 71, 22], ["+", 8, 9, 0, 37, 0, 16, 31, 69, 71, 22], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 72], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 12, 13]] | 0 | 449 | 4 |
n, r, k, m[101][101], t[101], p;
i, j, s, d, v0, v, f;
main() {
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &r, &k);
for (; k--;) {
scanf("%d", &d);
m[r][d] = 1;
}
}
scanf("%d", &p);
for (; p--;) {
scanf("%d%d%d", &s, &d, &v0);
memset(t, 0, sizeof(t));
t[s] = v... | n, r, k, m[101][101], t[101], p;
i, j, s, d, v0, v, f;
main() {
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &r, &k);
for (; k--;) {
scanf("%d", &d);
m[r][d] = 1;
}
}
scanf("%d", &p);
for (; p--;) {
scanf("%d%d%d", &s, &d, &v0);
memset(t, 0, sizeof(t));
t[s] = v... | [["+", 0, 52, 15, 23, 0, 16, 12, 16, 17, 47], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 295 | 2 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define INF 100000000
typedef... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define INF 100000000
typedef... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 353 | 2 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
class Node {
public:
vector<int> e_to;
vector<int> e_cost;
bool def;
int min_cost;
Node() {
def = false;
min_cost = -1;
}
};
bool operator==(const Node &ot1, const Node &ot2) {
return ot1.min_cost =... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
class Node {
public:
vector<int> e_to;
vector<int> e_cost;
bool def;
int min_cost;
Node() {
def = false;
min_cost = -1;
}
};
bool operator==(const Node &ot1, const Node &ot2) {
return ot1.min_cost =... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 678 | 4 |
#include <stdio.h>
typedef struct {
int group;
int people_num;
int waiting_time;
} wqueue_t;
int main(void) {
int i, j, k, mode;
int tennai[17] = {0};
int wqueue_start = 0;
int wqueue_end = 0;
wqueue_t wqueue[100] = {0};
int waiting_time_list[100] = {0};
int zikan;
int query;
for (zikan = 0; z... | #include <stdio.h>
typedef struct {
int group;
int people_num;
int waiting_time;
} wqueue_t;
int main(void) {
int i, j, k, mode;
int tennai[17] = {0};
int wqueue_start = 0;
int wqueue_end = 0;
wqueue_t wqueue[100] = {0};
int waiting_time_list[100] = {0};
int zikan;
int query;
for (zikan = 0; z... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19], ["-", 64, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 64, 9, 0, 57, 15, 23, 0, 16, 17, 19]] | 0 | 414 | 4 |
#include <bits/stdc++.h>
using namespace std;
struct G {
int group, people, now, time;
};
int main() {
int minutes[100];
int chair[17]; //ใใผใใ
ใใชใชใใใใฃใ๏ผ๏ผ
fill_n(chair, 17, 0);
queue<G> mati;
for (int i = 0; i < 10000; i++) {
if (i % 5 == 0 && i / 5 < 100) { // group leave
int group = i / 5;
... | #include <bits/stdc++.h>
using namespace std;
struct G {
int group, people, now, time;
};
int main() {
int minutes[100];
int chair[17]; //ใใผใใ
ใใชใชใใใใฃใ๏ผ๏ผ
fill_n(chair, 17, 0);
queue<G> mati;
for (int i = 0; i < 10000; i++) {
if (i % 5 == 0 && i / 5 < 100) { // group leave
int group = i / 5;
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 336 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#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)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#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)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(i... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 14, 8, 9, 0, 9, 0, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 9, 0, 9, 0, 46]] | 1 | 383 | 6 |
#include <iostream>
#include <queue>
using namespace std;
const int MAX_SIZE = 100;
const int SEATS = 17;
int *calc() {
queue<int> q;
int *a = new int[MAX_SIZE]();
int g, n, s[SEATS] = {};
for (int t = 0;; ++t) {
for (int i = 0; i < SEATS; ++i) {
if (s[i])
s[i]--;
}
if (t % 5 == 0)
... | #include <iostream>
#include <queue>
using namespace std;
const int MAX_SIZE = 100;
const int SEATS = 17;
int *calc() {
queue<int> q;
int *a = new int[MAX_SIZE]();
int g, n, s[SEATS] = {};
for (int t = 0;; ++t) {
for (int i = 0; i < SEATS; ++i) {
if (s[i])
s[i]--;
}
if (t % 5 == 0)
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 419 | 2 |
#include <iostream>
using namespace std;
int x[16], y[100][2], z[100], p[100], s;
int main() {
for (int i = 0; i < 16; i++) {
x[i] = 10000;
}
for (int i = 0; i < 100; i++) {
z[i] = 10000;
}
for (int i = 0; i < 100; i++) {
y[i][0] = i * 5;
y[i][1] = 17 * (i % 2) + 3 * (i % 3) + 19;
}
for ... | #include <iostream>
using namespace std;
int x[17], y[100][2], z[100], p[100], s;
int main() {
for (int i = 0; i < 17; i++) {
x[i] = 10000;
}
for (int i = 0; i < 100; i++) {
z[i] = 10000;
}
for (int i = 0; i < 100; i++) {
y[i][0] = i * 5;
y[i][1] = 17 * (i % 2) + 3 * (i % 3) + 19;
}
for ... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13], ["-", 75, 76, 0, 9, 0, 7, 15, 16, 12, 13], ["+", 75, 76, 0,... | 1 | 545 | 10 |
#include <cstdio>
#include <iostream>
using namespace std;
struct cus {
int a, b, c, d;
};
int main() {
cus a[100];
for (int i = 0; i < 100; i++) {
a[i].a = 5 * i;
a[i].b = (i % 5 == 1 ? 5 : 2);
a[i].c = 17 * (i % 2) + 3 * (i % 3) + 19;
a[i].d = 0;
}
int t[20] = {};
for (int i = 0; i < 100;... | #include <cstdio>
#include <iostream>
using namespace std;
struct cus {
int a, b, c, d;
};
int main() {
cus a[100];
for (int i = 0; i < 100; i++) {
a[i].a = 5 * i;
a[i].b = (i % 5 == 1 ? 5 : 2);
a[i].c = 17 * (i % 2) + 3 * (i % 3) + 19;
a[i].d = 0;
}
int t[20] = {};
for (int i = 0; i < 100;... | [["+", 0, 7, 8, 7, 15, 16, 12, 16, 17, 72], ["+", 0, 7, 8, 7, 15, 16, 12, 16, 12, 13]] | 1 | 336 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
typedef pair<int, int> pii;
int main() {
int ans[100];
vector<pii> seats; // group_num count
seats.push_back(pii(-1, 16));
priority_queue<pii, vector<pii>, greater<pii>> pq; // ta... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
typedef pair<int, int> pii;
int main() {
int ans[100];
vector<pii> seats; // group_num count
seats.push_back(pii(-1, 17));
priority_queue<pii, vector<pii>, greater<pii>> pq; // ta... | [["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13]] | 1 | 479 | 2 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 444 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define f(a) (a % 5 == 1 ? 5 : 2)
using namespace std;
typedef pair<int, int> P; //?????????????????????,??????????????????
int c[17];
int cnt[100];
int main() {
memset(c, -1, sizeof(c));
priority_queue<P, vector<P>, greater<>> p;
queue<int> ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define f(a) (a % 5 == 1 ? 5 : 2)
using namespace std;
typedef pair<int, int> P;
int c[17];
int cnt[100];
int main() {
memset(c, -1, sizeof(c));
priority_queue<P, vector<P>, greater<>> p;
queue<int> que;
int time = 0;
while (1) {
if (... | [["-", 51, 16, 12, 16, 31, 16, 31, 23, 0, 24], ["-", 51, 16, 12, 16, 31, 16, 31, 23, 0, 25], ["-", 15, 339, 51, 16, 12, 16, 31, 16, 17, 48], ["-", 15, 339, 51, 16, 12, 16, 31, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 13]] | 1 | 409 | 6 |
#include <iostream>
using namespace std;
#define SHEETS 17
#define GROUPS 130
int main() {
int ans[GROUPS] = {
0,
};
int now;
int sheets[SHEETS];
int peoples[GROUPS] = {
0,
};
int arrive[GROUPS] = {
0,
};
int eating[GROUPS] = {
0,
};
for (int i = 0; i < SHEETS; ++i) {
... | #include <iostream>
using namespace std;
#define SHEETS 17
#define GROUPS 130
int main() {
int ans[GROUPS] = {
0,
};
int now;
int sheets[SHEETS];
int peoples[GROUPS] = {
0,
};
int arrive[GROUPS] = {
0,
};
int eating[GROUPS] = {
0,
};
for (int i = 0; i < SHEETS; ++i) {
... | [["+", 64, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 64, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 480 | 2 |
#include <iostream>
using namespace std;
main() {
int data[100][2], ans[101];
int seki[17], q = 0;
for (int i = 0; i < 100; i++) {
if (i % 5 == 1) {
data[i][0] = 5;
} else {
data[i][0] = 2;
}
data[i][1] = 17 * (i % 2) + 3 * (i % 3) + 19;
}
for (int i = 0; i < 17; i++) {
seki[i... | #include <iostream>
using namespace std;
main() {
int data[100][2], ans[101];
int seki[17], q = 0;
for (int i = 0; i < 100; i++) {
if (i % 5 == 1) {
data[i][0] = 5;
} else {
data[i][0] = 2;
}
data[i][1] = 17 * (i % 2) + 3 * (i % 3) + 19;
}
for (int i = 0; i < 17; i++) {
seki[i... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 456 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19], ["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 17, 19]] | 1 | 567 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["-", 0, 11, 31, 69, 28, 2, 3, 4, 0, 13], ["+", 0, 11, 31, 69, 28, 2, 3, 4, 0, 13]] | 1 | 531 | 4 |
// 52
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main() {
int a[100];
int cr[17] = {};
queue<int> que;
for (int t = 0; t < 600; t++) {
if (t % 5 == 0 && t / 5 < 100) {
que.push(t / 5);
}
for (int i = 0; i < 17; i++) {
cr[i]--;
}
int fc = ... | // 52
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main() {
int a[100];
int cr[17] = {};
queue<int> que;
for (int t = 0; t < 600; t++) {
if (t % 5 == 0 && t / 5 < 100) {
que.push(t / 5);
}
for (int i = 0; i < 17; i++) {
cr[i]--;
}
int fc = ... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13]] | 1 | 276 | 2 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#... | [["+", 0, 2, 3, 4, 0, 16, 31, 16, 17, 72], ["+", 0, 2, 3, 4, 0, 16, 31, 16, 12, 13]] | 1 | 408 | 2 |
import java.util.Scanner;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
while (cin.hasNext()) {
int n = cin.nextInt();
n = n % 39;
if (n == 0) {
System.out.println("3c" + 39);
} else {
i... | import java.util.Scanner;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
while (cin.hasNext()) {
int n = cin.nextInt();
n = n % 39;
if (n == 0) {
System.out.println("3C" + 39);
} else {
i... | [["-", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491]] | 3 | 120 | 6 |
#include <stdio.h>
int main(void) {
int n;
int id;
while (scanf("%d", &n) != EOF) {
if (n % 39 == 0) {
id = 39;
} else {
id = n % 39;
}
printf("3C%d\n", id);
}
return (0);
} | #include <stdio.h>
int main(void) {
int n;
int id;
while (scanf("%d", &n) != EOF) {
if (n % 39 == 0) {
id = 39;
} else {
id = n % 39;
}
printf("3C%02d\n", id);
}
return (0);
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 69 | 2 |
a = 39;
main(c) {
for (; ~scanf("%d", &c) * c; printf("3C%02d\n", c % a ? c % a : a))
;
} | a = 39;
main(c) {
for (; ~scanf("%d", &c) * a; printf("3C%02d\n", c % a ? c % a : a))
;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 45 | 2 |
#include <stdio.h>
int main(void) {
int n;
while (scanf(" %d", &n) != EOF) {
printf("3C");
if (n % 39 == 0)
printf("39\n");
else if (n % 39 < 10)
printf("0%d\n", n % 395);
else
printf("%d\n", n % 39);
}
return 0;
} | #include <stdio.h>
int main(void) {
int n;
while (scanf(" %d", &n) != EOF) {
printf("3C");
if (n % 39 == 0)
printf("39\n");
else if (n % 39 < 10)
printf("0%d\n", n % 39);
else
printf("%d\n", n % 39);
}
return 0;
} | [["-", 64, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 0 | 88 | 2 |
#include <stdio.h>
int main() {
int n;
int r;
while (scanf("%d", &n) != EOF) {
r = n % 39;
if (r == 0)
r = 39;
printf("3c%02d\n", r);
}
return 0;
} | #include <stdio.h>
int main() {
int n;
int r;
while (scanf("%d", &n) != EOF) {
r = n % 39;
if (r == 0)
r = 39;
printf("3C%02d\n", r);
}
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 59 | 2 |
#include <stdio.h>
int main(void) {
int candy;
int amari;
while (scanf("%d", &candy) != EOF) {
amari = candy % 39;
if (amari == 0) {
printf("3C39");
}
else if ((amari >= 1) && (amari <= 9)) {
printf("3C0%d", amari);
}
else {
printf("3C%d", amari);
}
}
retur... | #include <stdio.h>
int main(void) {
int candy;
int amari;
while (scanf("%d", &candy) != EOF) {
amari = candy % 39;
if (amari == 0) {
printf("3C39\n");
}
else if ((amari >= 1) && (amari <= 9)) {
printf("3C0%d\n", amari);
}
else {
printf("3C%d\n", amari);
}
}
... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 95 | 3 |
#include <stdio.h>
int main(void) {
int n;
int ans;
while (scanf("%d", &n) != EOF) {
ans = n % 39;
if (ans == 0) {
ans = 39;
}
printf("3C");
if (ans <= 9 && ans <= 1) {
printf("0");
}
printf("%d\n", ans);
}
return (0);
} | #include <stdio.h>
int main(void) {
int n;
int ans;
while (scanf(" %d", &n) != EOF) {
ans = n % 39;
if (ans == 0) {
ans = 39;
}
printf("3C");
if (ans <= 9 && ans >= 1) {
printf("0");
}
printf("%d\n", ans);
}
return (0);
} | [["-", 0, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 20]] | 0 | 90 | 4 |
#include <stdio.h>
int main(void) {
int n, a;
while (scanf("%d", &n) != EOF) {
a = n % 39;
if (a == 0)
a = 39;
printf("3C%d\n", a);
}
return 0;
} | #include <stdio.h>
int main(void) {
int n, a;
while (scanf("%d", &n) != EOF) {
a = n % 39;
if (a == 0)
a = 39;
printf("3C%02d\n", a);
}
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 59 | 2 |
#include <stdio.h>
int main() {
int a, b, c;
while (scanf("%d", &a) != EOF) {
a = a % 39;
if (a == 0) {
printf("3C39\n");
} else {
printf("3C%d\n", a);
}
}
return 0;
} | #include <stdio.h>
int main() {
int a;
while (scanf("%d", &a) != EOF) {
a = a % 39;
if (a == 0) {
printf("3C39\n");
} else {
printf("3C%02d\n", a);
}
}
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 69 | 6 |
#include <iostream>
using namespace std;
int n;
int main() {
while (cin >> n) {
int p = n % 39;
if (p == 0)
p = 39;
cout << "C3";
if (p < 10)
cout << "0";
cout << p << endl;
}
} | #include <iostream>
using namespace std;
int n;
int main() {
while (cin >> n) {
int p = n % 39;
if (p == 0)
p = 39;
cout << "3C";
if (p < 10)
cout << "0";
cout << p << endl;
}
} | [["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 64 | 2 |
#include <bits/stdc++.h> // only for GCC
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typed... | #include <bits/stdc++.h> // only for GCC
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typed... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 342 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, count;
while (cin >> n) {
count = n % 39;
if (count == 0)
count = 39;
cout << "3C";
(count / 10 == 0) ? cout << "0" << count : cout << count << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, count;
while (cin >> n) {
count = n % 39;
if (count == 0)
count = 39;
cout << "3C";
(count / 10 == 0) ? cout << "0" << count : cout << count;
cout << endl;
}
return 0;
} | [["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22]] | 1 | 72 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int c;
while (cin >> c) {
printf("3%%02d\n", ((c % 39) == 0 ? 39 : (c % 39)));
}
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int c;
while (cin >> c) {
printf("3C%02d\n", ((c % 39) == 0 ? 39 : (c % 39)));
}
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 54 | 2 |
#include <stdio.h>
int main() {
int x;
while (scanf("%d", &x) != EOF) {
x = x % 39;
if (x == 0)
x = 39;
else
x = x;
if (x <= 9)
printf("3C0%d\n", x);
printf("3C%d\n", x);
}
return 0;
} | #include <stdio.h>
int main() {
int x;
while (scanf("%d", &x) != EOF) {
x = x % 39;
if (x == 0)
x = 39;
else
x = x;
if (x <= 9)
printf("3C0%d\n", x);
else
printf("3C%d\n", x);
}
return 0;
} | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 77 | 1 |
#include <stdio.h>
int main(void) {
int a;
while (scanf("%d", &a) != EOF) {
a = a % 39;
if (a == 0) {
printf("3C39\n");
} else {
printf("3C%d\n", a);
}
}
return 0;
} | #include <stdio.h>
int main(void) {
int a;
while (scanf("%d", &a) != EOF) {
a = a % 39;
if (a == 0) {
printf("3C39\n");
} else {
printf("3C%02d\n", a);
}
}
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 66 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
printf("3C%02d", n % 39 == 0 ? 39 : n % 39);
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
printf("3C%02d\n", n % 39 == 0 ? 39 : n % 39);
}
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 45 | 1 |
#include <iostream>
using namespace std;
int main() {
while (1) {
int a;
cin >> a;
if (cin.fail())
break;
cout << "3C";
if (a % 39 == 0) {
cout << 39;
continue;
}
cout.width(2);
cout.fill('0');
cout << a % 39 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
while (1) {
int a;
cin >> a;
if (cin.fail())
break;
cout << "3C";
if (a % 39 == 0) {
cout << 39 << endl;
continue;
}
cout.width(2);
cout.fill('0');
cout << a % 39 << endl;
}
} | [["+", 0, 57, 64, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 57, 64, 9, 0, 1, 0, 16, 12, 22]] | 1 | 81 | 2 |
#include <stdio.h>
int main(void) {
int a;
while (scanf("%d", &a) != EOF) {
if (a % 39 == 0)
printf("3c39\n");
else
printf("3C%02d\n", a % 39);
}
return 0;
} | #include <stdio.h>
int main(void) {
int a;
while (scanf("%d", &a) != EOF) {
if (a % 39 == 0)
printf("3C39\n");
else
printf("3C%02d\n", a % 39);
}
return 0;
} | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 60 | 2 |
#include <cstdio>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int a, o;
while (cin >> a) {
o = a % 39;
if (o == 0) {
cout << "3c39" << endl;
} else {
cout << "3c";
printf("%02d", o);
cout << endl;
}
}
return... | #include <cstdio>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int a, o;
while (cin >> a) {
o = a % 39;
if (o == 0) {
cout << "3C39" << endl;
} else {
cout << "3C";
printf("%02d", o);
cout << endl;
}
}
return... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 80 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 39 == 0)
n = 39;
else
n %= 39;
if (n < 10)
cout << "3C0" << n << "\n";
else
cout << "3C" << n << "\n";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n % 39 == 0)
n = 39;
else
n %= 39;
if (n < 10)
cout << "3C0" << n << "\n";
else
cout << "3C" << n << "\n";
}
return 0;
}
| [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 70 | 6 |
#include <iostream>
using namespace std;
int main(void) {
int n;
while (cin >> n) {
cout << "3C";
printf("%2d\n", n % 39 ? n % 39 : 39);
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int n;
while (cin >> n) {
cout << "3C";
printf("%.2d\n", n % 39 ? n % 39 : 39);
}
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 51 | 2 |
#include <iostream>
using namespace std;
int main(void) {
int n, a;
cin >> n;
a = n % 39;
if (a > 0 && a < 10)
cout << "3C0" << a << endl;
else if (a >= 10)
cout << "3C" << a << endl;
else if (a == 0)
cout << "3C39" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int n, a;
while (cin >> n) {
a = n % 39;
if (a > 0 && a < 10)
cout << "3C0" << a << endl;
else if (a >= 10)
cout << "3C" << a << endl;
else if (a == 0)
cout << "3C39" << endl;
}
return 0;
} | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 83 | 6 |
while gets
tmp = ($_.to_i) % 39
puts "3c%02d" % (tmp == 0 ? 39 : tmp)
end | while gets
tmp = ($_.to_i) % 39
puts "3C%02d" % (tmp == 0 ? 39 : tmp)
end | [["-", 0, 652, 3, 4, 0, 738, 31, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 738, 31, 557, 0, 6]] | 4 | 26 | 2 |
while True:
try:
a = int(input())
except:
break
tmp = a - (a // 39) * 39
print("3C{:02d}".format(39 if tmp == 39 else tmp)) | while True:
try:
a = int(input())
except:
break
tmp = a - (a // 39) * 39
print("3C{:02d}".format(tmp if tmp % 39 else 39)) | [["-", 3, 4, 0, 652, 3, 4, 0, 41, 0, 612], ["+", 3, 4, 0, 652, 3, 4, 0, 41, 0, 22], ["-", 0, 652, 3, 4, 0, 41, 0, 666, 667, 60], ["+", 0, 652, 3, 4, 0, 41, 0, 657, 17, 109], ["-", 3, 4, 0, 652, 3, 4, 0, 41, 0, 22], ["+", 3, 4, 0, 652, 3, 4, 0, 41, 0, 612]] | 5 | 44 | 6 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[][] list = new int[2][4];
while (sc.hasNext()) {
String[] eye = sc.nextLine().split(" ");
for (int i = 0; i < 2; i++) {
if (Double.parseDouble(eye[i]) >= 1.1)
... | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[][] list = new int[2][4];
while (sc.hasNext()) {
String[] eye = sc.nextLine().split(" ");
for (int i = 0; i < 2; i++) {
if (Double.parseDouble(eye[i]) >= 1.1)
... | [["-", 0, 16, 31, 16, 31, 504, 516, 504, 71, 22], ["+", 0, 16, 31, 16, 31, 504, 516, 504, 71, 499], ["-", 3, 4, 0, 16, 31, 16, 31, 504, 71, 499], ["+", 3, 4, 0, 16, 31, 16, 31, 504, 71, 22], ["-", 3, 4, 0, 16, 12, 504, 516, 504, 71, 22], ["+", 3, 4, 0, 16, 12, 504, 516, 504, 71, 499], ["-", 0, 492, 3, 4, 0, 16, 12, 504... | 3 | 260 | 8 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
List<Integer> left = new ArrayList<Integer>();
List<In... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
List<Integer> left = new ArrayList<Integer>();
List<In... | [["-", 75, 57, 15, 15, 0, 16, 31, 16, 12, 22], ["+", 75, 57, 15, 15, 0, 16, 31, 16, 12, 22], ["-", 75, 57, 15, 15, 0, 16, 12, 16, 31, 22], ["+", 75, 57, 15, 15, 0, 16, 12, 16, 31, 22]] | 3 | 436 | 8 |
import java.util.*;
public class Main {
public int getIndex(int eye) {
if (eye < 0.2)
return 3;
else if (eye < 0.6)
return 2;
else if (eye < 1.1)
return 1;
else
return 0;
}
public static void main(String args[]) {
int[] left = new int[4], right = new int[4];
Main ... | import java.util.*;
public class Main {
public int getIndex(double eye) {
if (eye < 0.2)
return 3;
else if (eye < 0.6)
return 2;
else if (eye < 1.1)
return 1;
else
return 0;
}
public static void main(String args[]) {
int[] left = new int[4], right = new int[4];
Ma... | [["-", 0, 195, 54, 495, 0, 496, 39, 506, 0, 507], ["+", 0, 195, 54, 495, 0, 496, 39, 511, 0, 512], ["-", 0, 52, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 52, 8, 196, 0, 503, 39, 511, 0, 512], ["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 189 | 10 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[][] eye = new int[4][2];
while (sc.hasNext()) {
for (int i = 0; i < 2; i++) {
double p = sc.nextDouble();
if (p < 0.2)
eye[3][i]++;
else if (p <... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[][] eye = new int[4][2];
while (sc.hasNext()) {
for (int i = 0; i < 2; i++) {
double p = sc.nextDouble();
if (p < 0.2)
eye[3][i]++;
else if (p <... | [["-", 0, 57, 75, 57, 15, 15, 0, 16, 12, 515], ["+", 0, 57, 75, 57, 15, 15, 0, 16, 12, 515]] | 3 | 186 | 2 |
#include <stdio.h>
int main(void) {
double l, r;
int countla = 0;
int countra = 0;
int countlb = 0;
int countrb = 0;
int countlc = 0;
int countrc = 0;
int countld = 0;
int countrd = 0;
while (scanf("%lf %lf", &l, &r) != EOF) {
if (l >= 1.1) {
countla++;
} else if (l < 1.1 && l >= 0... | #include <stdio.h>
int main(void) {
double l, r;
int countla = 0;
int countra = 0;
int countlb = 0;
int countrb = 0;
int countlc = 0;
int countrc = 0;
int countld = 0;
int countrd = 0;
while (scanf("%lf %lf", &l, &r) != EOF) {
if (l >= 1.1) {
countla++;
} else if (l < 1.1 && l >= 0... | [["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 0 | 242 | 2 |
#include <stdio.h>
int main(void) {
double left, right;
int lefta = 0, righta = 0;
int leftb = 0, rightb = 0;
int leftc = 0, rightc = 0;
int leftd = 0, rightd = 0;
while (scanf("%lf %lf", &left, &right) != EOF) {
if (left >= 1.1) {
lefta++;
} else if (left < 1.1 && left >= 0.6) {
leftb++... | #include <stdio.h>
int main(void) {
double left, right;
int lefta = 0, righta = 0;
int leftb = 0, rightb = 0;
int leftc = 0, rightc = 0;
int leftd = 0, rightd = 0;
while (scanf("%lf %lf", &left, &right) != EOF) {
if (left >= 1.1) {
lefta++;
} else if (left < 1.1 && left >= 0.6) {
leftb++... | [["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 0 | 200 | 2 |
l[4], r[4], i;
main() {
float a, b;
for (; ~scanf("%f%f", &a, &b);) {
l[a < 0.2 ? 3 : a < 0.6 ? 2 : a < 1.1 ? 1 : 0]++;
r[b < 0.2 ? 3 : b < 0.6 ? 2 : b < 1.1 ? 1 : 0]++;
}
for (; i++ < 4;) {
printf("%d %d\n", l[i], r[i]);
}
exit(0);
} | l[4], r[4], i;
main() {
float a, b;
for (; ~scanf("%f%f", &a, &b);) {
l[a < 0.2 ? 3 : a < 0.6 ? 2 : a < 1.1 ? 1 : 0]++;
r[b < 0.2 ? 3 : b < 0.6 ? 2 : b < 1.1 ? 1 : 0]++;
}
for (; i < 4; i++) {
printf("%d %d\n", l[i], r[i]);
}
exit(0);
} | [["-", 0, 9, 0, 7, 15, 16, 31, 27, 17, 29], ["+", 0, 30, 0, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 30, 0, 9, 0, 7, 26, 27, 17, 29]] | 0 | 125 | 3 |
#include <stdio.h>
int main() {
int s[4][2] = {0, 0, 0, 0, 0, 0, 0, 0}, j;
double b[2];
while (scanf("%lf %lf", &b[0], &b[1]) != EOF) {
for (j = 0; j < 2; j++) {
if (b[j] >= 1.1)
s[0][j]++;
else if (b[j] >= 0.6)
s[1][j]++;
else if (b[j] >= 0.2)
s[2][j]++;
else
... | #include <stdio.h>
int main() {
int s[4][2] = {0, 0, 0, 0, 0, 0, 0, 0}, j;
double b[2];
while (scanf("%lf %lf", &b[0], &b[1]) != EOF) {
for (j = 0; j < 2; j++) {
if (b[j] >= 1.1)
s[0][j]++;
else if (b[j] >= 0.6)
s[1][j]++;
else if (b[j] >= 0.2)
s[2][j]++;
else
... | [["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 0 | 189 | 2 |
#include <stdio.h>
int main(void) {
int l[4] = {0};
int r[4] = {0};
double onel, oner;
while (scanf("%lf %lf", &onel, oner) == 2) {
if (onel < 0.2)
l[3]++;
else if (onel < 0.6)
l[2]++;
else if (onel < 1.1)
l[1]++;
else
l[0]++;
if (oner < 0.2)
r[3]++;
else i... | #include <stdio.h>
int main(void) {
int l[4] = {0};
int r[4] = {0};
double onel, oner;
while (scanf("%lf %lf", &onel, &oner) == 2) {
if (onel < 0.2)
l[3]++;
else if (onel < 0.6)
l[2]++;
else if (onel < 1.1)
l[1]++;
else
l[0]++;
if (oner < 0.2)
r[3]++;
else ... | [["+", 0, 16, 31, 2, 3, 4, 0, 66, 17, 67]] | 0 | 217 | 1 |
#include <stdio.h>
int main(void) {
double eye[40][2];
int num[4][2] = {0};
int i, j;
for (i = 0; scanf("%lf %lf", eye[i][0], eye[i][1]) != EOF; i++)
for (j = 0; j < 2; j++)
if (eye[i][j] >= 1.1)
num[0][j]++;
else if (eye[i][j] >= 0.6)
num[1][j]++;
else if (eye[i][j] >= 0... | #include <stdio.h>
int main(void) {
double eye[40][2];
int num[4][2] = {0};
int i, j;
for (i = 0; scanf("%lf %lf", &eye[i][0], &eye[i][1]) != EOF; i++)
for (j = 0; j < 2; j++)
if (eye[i][j] >= 1.1)
num[0][j]++;
else if (eye[i][j] >= 0.6)
num[1][j]++;
else if (eye[i][j] >=... | [["+", 15, 16, 31, 2, 3, 4, 0, 66, 17, 67]] | 0 | 198 | 2 |
#include <stdio.h>
int main() {
int x[8] = {0}, i, j;
double a, b;
while (scanf("%lf %lf", &a, &b) != EOF) {
if (a >= 1.1) {
x[0]++;
}
else if (0.6 <= a) {
x[2]++;
}
else if (0.2 <= a) {
x[4]++;
}
else if (a < 0.2) {
x[6]++;
}
if (b >= 1.1) {
... | #include <stdio.h>
int main() {
int x[8] = {0}, i, j;
double a, b;
while (scanf("%lf %lf", &a, &b) != EOF) {
if (a >= 1.1) {
x[0]++;
}
else if (0.6 <= a) {
x[2]++;
}
else if (0.2 <= a) {
x[4]++;
}
else if (a < 0.2) {
x[6]++;
}
if (b >= 1.1) {
... | [["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 205 | 2 |
#include <stdio.h>
int eyejudge(double eyesight);
int main(void) {
int right[4] = {0};
int left[4] = {0};
double rsig, lsig;
int i, j;
while (scanf("%lf %lf", &lsig, &rsig) != EOF) {
if (eyejudge(lsig) == 0 || eyejudge(rsig) == 0)
return (0);
left[eyejudge(lsig) - 1]++;
right[eyejudge(rsi... | #include <stdio.h>
int eyejudge(double eyesight);
int main(void) {
int right[4] = {0};
int left[4] = {0};
double rsig, lsig;
int i, j;
while (scanf("%lf %lf", &lsig, &rsig) != EOF) {
if (eyejudge(lsig) == 0 || eyejudge(rsig) == 0)
return (0);
left[eyejudge(lsig) - 1]++;
right[eyejudge(rsi... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 0 | 236 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 13]] | 1 | 309 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int stoi(string x) {
stringstream ss;
ss << x;
int tmp;
ss >> tmp;
retur... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int stoi(string x) {
stringstream ss;
ss << x;
int tmp;
ss >> tmp;
retur... | [["-", 64, 1, 0, 27, 28, 69, 341, 342, 0, 13], ["+", 64, 1, 0, 27, 28, 69, 341, 342, 0, 13]] | 1 | 270 | 2 |
#include <iostream>
using namespace std;
int l[4], r[4];
int main() {
double a, b;
while (cin >> a >> b) {
l[a < 0.2 ? 3 : a < 0.6 ? 2 : a < 1.1 ? 1 : 0]++;
r[b < 0.2 ? 3 : b < 0.6 ? 2 : b < 1.1 ? 1 : 0]++;
}
for (int i = 0; i < 4; i++) {
cout << l[i] << ' ' << r[i];
}
return 0;
} | #include <iostream>
using namespace std;
int l[4], r[4];
int main() {
double a, b;
while (cin >> a >> b) {
l[a < 0.2 ? 3 : a < 0.6 ? 2 : a < 1.1 ? 1 : 0]++;
r[b < 0.2 ? 3 : b < 0.6 ? 2 : b < 1.1 ? 1 : 0]++;
}
for (int i = 0; i < 4; i++) {
cout << l[i] << ' ' << r[i] << endl;
}
return 0;
} | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 121 | 2 |
#include <iostream>
using namespace std;
int main(void) {
double date[41][2];
int num = 0;
while (cin >> date[num][0] >> date[num][1]) {
num++;
}
double judge[5] = {0, 0.2, 0.6, 1.1, 100};
int out[4][2] = {0};
for (int i = 0; i < num; i++) {
for (int j = 0; j < 2; j++) {
for (int k = 0; k < ... | #include <iostream>
using namespace std;
int main(void) {
double date[41][2];
int num = 0;
while (cin >> date[num][0] >> date[num][1]) {
num++;
}
double judge[5] = {0, 0.2, 0.6, 1.1, 100};
int out[4][2] = {0};
for (int i = 0; i < num; i++) {
for (int j = 0; j < 2; j++) {
for (int k = 0; k < ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 217 | 2 |
#include <stdio.h>
int main() {
int i = 0, lt[4] = {0}, rt[4] = {0};
double left[41], right[41];
while (scanf("%lf", &left[i]) != EOF) {
scanf("%lf", &right[i]);
if (left[i] >= 1.1)
lt[0]++;
else if (left[i] >= 0.6)
lt[1]++;
else if (left[i] >= 0.2)
lt[2]++;
else
lt[3]... | #include <stdio.h>
int main() {
int i = 0, lt[4] = {0}, rt[4] = {0};
double left[41], right[41];
while (scanf("%lf", &left[i]) != EOF) {
scanf("%lf", &right[i]);
if (left[i] >= 1.1)
lt[0]++;
else if (left[i] >= 0.6)
lt[1]++;
else if (left[i] >= 0.2)
lt[2]++;
else
lt[3]... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 220 | 3 |
#include <iostream>
using namespace std;
#define A 0
#define B 1
#define C 2
#define D 3
int result[2][4];
int main() {
double buf[2];
while (cin >> buf[0] >> buf[1]) {
for (int i = 0; i < 2; i++) {
if (buf[i] >= 1.1)
result[i][A]++;
else if (buf[i] >= 0.6)
result[i][B]++;
... | #include <iostream>
using namespace std;
#define A 0
#define B 1
#define C 2
#define D 3
int result[2][4];
int main() {
double buf[2];
while (cin >> buf[0] >> buf[1]) {
for (int i = 0; i < 2; i++) {
if (buf[i] >= 1.1)
result[i][A]++;
else if (buf[i] >= 0.6)
result[i][B]++;
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 178 | 2 |
#include <stdio.h>
int main(void) {
double h, m;
int cMA, cHA;
int cMB, cHB;
int cMC, cHC;
int cMD, cHD;
cMA = 0;
cHA = 0;
cMB = 0;
cHB = 0;
cMC = 0;
cHC = 0;
cMD = 0;
cHD = 0;
while (scanf("%lf %lf", &h, &m) != EOF) {
if (h >= 1.1) {
cHA++;
} else if (0.6 <= h && h < 0.6) {
... | #include <stdio.h>
int main(void) {
double h, m;
int cMA, cHA;
int cMB, cHB;
int cMC, cHC;
int cMD, cHD;
cMA = 0;
cHA = 0;
cMB = 0;
cHB = 0;
cMC = 0;
cHC = 0;
cMD = 0;
cHD = 0;
while (scanf("%lf %lf", &h, &m) != EOF) {
if (h >= 1.1) {
cHA++;
} else if (0.6 <= h && h < 1.1) {
... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 222 | 2 |
#include <cstring>
#include <iostream>
using namespace std;
int getRank(double x) {
if (1.1 <= x)
return 0;
if (0.6 <= x)
return 1;
if (0.2 <= x)
return 2;
return 3;
}
int main() {
int resutls[4][2];
double a, b;
memset(resutls, 0, sizeof(resutls));
while (cin >> a >> b) {
resutls[getR... | #include <cstring>
#include <iostream>
using namespace std;
int getRank(double x) {
if (1.1 <= x)
return 0;
if (0.6 <= x)
return 1;
if (0.2 <= x)
return 2;
return 3;
}
int main() {
int resutls[4][2];
double a, b;
memset(resutls, 0, sizeof(resutls));
while (cin >> a >> b) {
resutls[getR... | [["-", 28, 69, 341, 342, 0, 2, 3, 4, 0, 22], ["+", 28, 69, 341, 342, 0, 2, 3, 4, 0, 22]] | 1 | 155 | 2 |
#include <iostream>
using namespace std;
int main() {
double r, l;
int va[2][4] = {0};
while (cin >> r >> l) {
if (r >= 1.1)
va[0][0]++;
else if (r >= 0.6)
va[0][1]++;
else if (r >= 0.2)
va[0][2]++;
else
va[0][3]++;
if (l >= 1.1)
va[1][0]++;
else if (l >= ... | #include <iostream>
using namespace std;
int main() {
double r, l;
int va[2][4] = {0};
while (cin >> l >> r) {
if (r >= 1.1)
va[0][0]++;
else if (r >= 0.6)
va[0][1]++;
else if (r >= 0.2)
va[0][2]++;
else
va[0][3]++;
if (l >= 1.1)
va[1][0]++;
else if (l >= ... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 152], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 152], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]] | 1 | 194 | 4 |
public class Main {
static int N = 10001;
public void run(java.io.InputStream in, java.io.PrintStream out) {
java.util.Scanner sc = new java.util.Scanner(in);
int[] p;
int pn, i, n, p1, q1;
p = new int[N / 6];
pn = getprime(p);
for (;;) {
n = sc.nextInt();
if (n == 0)
b... | public class Main {
static int N = 10001;
public void run(java.io.InputStream in, java.io.PrintStream out) {
java.util.Scanner sc = new java.util.Scanner(in);
int[] p;
int pn, i, n, p1, q1;
p = new int[N / 6];
pn = getprime(p);
for (;;) {
n = sc.nextInt();
if (n == 0)
b... | [["-", 8, 196, 0, 7, 15, 16, 31, 16, 17, 18], ["+", 8, 196, 0, 7, 15, 16, 31, 16, 17, 19]] | 3 | 320 | 2 |
import java.util.*;
class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
Boolean[] prime = new Boolean[10001];
prime[0] = prime[1] = true;
for (int i = 2; i < 10001; i++) {
if (prime[i] == false) {
int j = 2;
while (i * j < 10001) {
... | import java.util.*;
class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
boolean[] prime = new boolean[10001];
prime[0] = prime[1] = true;
for (int i = 2; i < 10001; i++) {
if (prime[i] == false) {
int j = 2;
while (i * j < 10001) {
... | [["-", 0, 195, 8, 196, 0, 503, 39, 224, 468, 78], ["+", 0, 195, 8, 196, 0, 503, 39, 224, 468, 523], ["-", 8, 196, 0, 503, 49, 200, 51, 227, 39, 78], ["+", 8, 196, 0, 503, 49, 200, 51, 227, 39, 523]] | 3 | 184 | 4 |
import java.util.*;
public class Main {
public static void main(String[] args) throws java.io.IOException {
Scanner scan = new Scanner(System.in);
while (scan.hasNext()) {
int n = scan.nextInt();
if (n == 0)
break;
boolean[] prime = new boolean[n + 1];
for (int i = 0; i <= n; i... | import java.util.*;
public class Main {
public static void main(String[] args) throws java.io.IOException {
Scanner scan = new Scanner(System.in);
while (scan.hasNext()) {
int n = scan.nextInt();
if (n == 0)
break;
boolean[] prime = new boolean[n + 1];
for (int i = 0; i <= n; i... | [["-", 0, 52, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 17, 19], ["-", 8, 196, 0, 7, 8, 7, 15, 16, 17, 18], ["+", 8, 196, 0, 7, 8, 7, 15, 16, 17, 19]] | 3 | 198 | 4 |
#include <math.h>
#include <stdio.h>
int isprime(int n) {
int i;
if (n <= 1) {
return 0;
}
for (i = 2; i * i <= n; i++) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
int main() {
int n, i;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = n; i >= 2; i... | #include <math.h>
#include <stdio.h>
int isprime(int n) {
int i;
if (n <= 1) {
return 0;
}
for (i = 2; i * i <= n; i++) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
int main() {
int n, i;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = n; i >= 2; i... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 145 | 1 |
#include <stdio.h>
#define M 10001
int main() {
char p[M] = {1, 1};
int i, j, n;
for (i = 2; i * i < M; i++) {
if (p[i])
continue;
for (j = i * i; j < M; j += i)
p[j] = 1;
}
while (scanf("%d", &n), n) {
while (n--) {
if (p[n] + p[n - 2] == 0)
break;
}
printf("%d %... | #include <stdio.h>
#define M 10001
int main() {
char p[M] = {1, 1};
int i, j, n;
for (i = 2; i * i < M; i++) {
if (p[i])
continue;
for (j = i * i; j < M; j += i)
p[j] = 1;
}
while (scanf("%d", &n), n++) {
while (n--) {
if (p[n] + p[n - 2] == 0)
break;
}
printf("%d... | [["+", 0, 52, 15, 23, 0, 34, 12, 27, 17, 29]] | 0 | 137 | 1 |
#include <stdio.h>
int main() {
int i, j, p, n;
int prime[10000] = {0};
while (scanf("%d", &n), n) {
for (i = 2; i < 10000; i++)
prime[i] = 1;
for (i = 2; i <= n; i++)
if (prime[i])
for (j = i + i; j <= n; j += i)
prime[j] = 0;
for (i = 3; i < n - 2; i += 2)
if... | #include <stdio.h>
int main() {
int i, j, p, n;
int prime[10001] = {0};
while (scanf("%d", &n), n) {
for (i = 2; i < 10000; i++)
prime[i] = 1;
for (i = 2; i <= n; i++)
if (prime[i])
for (j = i + i; j <= n; j += i)
prime[j] = 0;
for (i = 3; i <= n - 2; i += 2)
i... | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 159 | 4 |
#include <stdio.h>
int isprime(int n) {
int i;
for (i = 2; i * i < n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
int main(void) {
const int NUM = 10001;
int i, n, prime[NUM], p1, q1;
for (i = 2; i < NUM; i++) {
prime[i] = isprime(i);
}
while (1) {
scanf("%d", &n);
if (n == 0... | #include <stdio.h>
int isprime(int n) {
int i;
for (i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
int main(void) {
const int NUM = 10001;
int i, n, prime[NUM], p1, q1;
for (i = 2; i < NUM; i++) {
prime[i] = isprime(i);
}
while (1) {
scanf("%d", &n);
if (n == ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 182 | 2 |
#include <stdio.h>
#include <string.h>
int main() {
const int MAX_V = 1000;
int prime[MAX_V + 1];
int i, k, v, n, p1, q1;
for (i = 2; i <= MAX_V; i++) {
prime[i] = 1;
}
for (i = 2; i * i <= MAX_V; i++) {
if (prime[i]) {
for (k = 2 * i; k <= MAX_V; k += i) {
prime[k] = 0;
}
}... | #include <stdio.h>
#include <string.h>
int main() {
const int MAX_V = 1000000;
int prime[MAX_V + 1];
int i, k, v, n, p1, q1;
for (i = 2; i <= MAX_V; i++) {
prime[i] = 1;
}
for (i = 2; i * i <= MAX_V; i++) {
if (prime[i]) {
for (k = 2 * i; k <= MAX_V; k += i) {
prime[k] = 0;
}
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 251 | 2 |
#include <stdio.h>
int isprime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
int main() {
int n, p1, q1, i;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = n; i >= 5; i--) {
if (isprime(i) == 1) {
if (isprime(i - 2) == 1... | #include <stdio.h>
int isprime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
int main() {
int n, p1, q1, i;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = n; i >= 5; i--) {
if (isprime(i) == 1) {
if (isprime(i - 2) == 1... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22]] | 0 | 147 | 4 |
#include <stdio.h>
int isprime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
int main() {
int number[10000 + 2] = {0};
int n, i, fir, sec;
for (i = 2; i < 10000; i++) {
number[i] = isprime(i);
}
while (scanf("%d", &n)) {
if (n == 0)
break;
... | #include <stdio.h>
int isprime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
int main() {
int number[10000 + 2] = {0};
int n, i, fir, sec;
for (i = 2; i < 10000; i++) {
number[i] = isprime(i);
}
while (scanf("%d", &n)) {
if (n == 0)
break;
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 28, 22]] | 0 | 182 | 6 |
#include <math.h>
#include <stdio.h>
int sos(int);
int main() {
int i, j, p, q, n;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = n; i >= 2; i--) {
p = sos(i);
q = sos(i + 2);
if (p != 0 && q != 0) {
break;
}
}
printf("%d %d\n", p, q);
... | #include <math.h>
#include <stdio.h>
int sos(int);
int main() {
int i, j, p, q, n;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = n - 2; i >= 2; i--) {
p = sos(i);
q = sos(i + 2);
if (p != 0 && q != 0) {
break;
}
}
printf("%d %d\n", p, q)... | [["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 0 | 158 | 2 |
#include <stdio.h>
#define N 10000
int tbl[N + 1] = {0};
size_t tbln = 0;
/** Application main entry point. */
int main(int argc, char *argv[]) {
int i, j;
for (j = 2; j <= N; ++j) {
if (tbl[j])
continue;
for (i = j * 2; i <= N; i += j) {
tbl[i] = 1;
}
}
for (i = 2; i <= N - 2; ++i)... | #include <stdio.h>
#define N 10000
int tbl[N + 1] = {0};
size_t tbln = 0;
/** Application main entry point. */
int main(int argc, char *argv[]) {
int i, j;
for (j = 2; j <= N; ++j) {
if (tbl[j])
continue;
for (i = j * 2; i <= N; i += j) {
tbl[i] = 1;
}
}
for (i = 2; i <= N - 2; ++i)... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 18], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 19]] | 0 | 215 | 2 |
#include <iostream>
using namespace std;
bool isp[10000];
main() {
isp[0] = isp[1] = 1;
for (int i = 2; i <= 100; i++) {
if (isp[i])
continue;
for (int j = i * i; j <= 10000; j += i)
isp[j] = 1;
}
int n;
while (cin >> n, n) {
while (!isp[n] && !isp[n - 2])
n--;
cout << n - 2 ... | #include <iostream>
using namespace std;
bool isp[10000];
main() {
isp[0] = isp[1] = 1;
for (int i = 2; i <= 100; i++) {
if (isp[i])
continue;
for (int j = i * i; j <= 10000; j += i)
isp[j] = 1;
}
int n;
while (cin >> n, n) {
while (isp[n] || isp[n - 2])
n--;
cout << n - 2 <<... | [["-", 0, 52, 15, 339, 51, 16, 31, 91, 17, 111], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["-", 0, 52, 15, 339, 51, 16, 12, 91, 17, 111], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 106]] | 1 | 124 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
bool p[101000];
void prime() {
fill(p, p + 101000, true);
p[0] = false;
p[1] = false;
for (int i = 2; i < 101000; i++) {
if (p[i]) {
for (int j = 2; i * j < 101000; j++) {
p[i * j] = false;
}
}
}
}
int main() {
int ... | #include <algorithm>
#include <iostream>
using namespace std;
bool p[101000];
void prime() {
fill(p, p + 101000, true);
p[0] = false;
p[1] = false;
for (int i = 2; i < 101000; i++) {
if (p[i]) {
for (int j = 2; i * j < 101000; j++) {
p[i * j] = false;
}
}
}
}
int main() {
int ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 171 | 18 |
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 12000
int prime[MAX_N];
bool is_prime[MAX_N + 1];
void prime_generate() {
int p = 0;
for (int i = 0; i <= MAX_N; i++)
is_prime[i] = true;
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= MAX_N; i++) {
if (is_prime[i]) {
prime[... | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 12000
int prime[MAX_N];
bool is_prime[MAX_N + 1];
void prime_generate() {
int p = 0;
for (int i = 0; i <= MAX_N; i++)
is_prime[i] = true;
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= MAX_N; i++) {
if (is_prime[i]) {
prime[... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 258 | 2 |
#include <iostream>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
int main() {
int dt[10003];
dt[0] = dt[1] = 0;
loop(i, 2, 10003) dt[i] = 1;
dt[10001] = dt[10002] = 0;
for (int i = 2; i < 100; i++) {
if (dt[i] == 1) {
for (int j = 2; i * j <... | #include <iostream>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
int main() {
int dt[10003];
dt[0] = dt[1] = 0;
loop(i, 2, 10003) dt[i] = 1;
dt[10001] = dt[10002] = 0;
for (int i = 2; i < 100; i++) {
if (dt[i] == 1) {
for (int j = 2; i * j <... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 207 | 2 |
#include <iostream>
using namespace std;
string prime(int n) {
int i, j;
string p = "001";
while (p.size() < n)
p += "10";
i = 3;
while (i * i < n) {
for (j = 3 * i; j < n; j += 2 * i)
p[j] = '0';
do {
i += 2;
} while (p[i] - '1');
}
return p;
}
int main() {
int n;
strin... | #include <iostream>
using namespace std;
string prime(int n) {
int i, j;
string p = "001";
while (p.size() <= n)
p += "10";
i = 3;
while (i * i <= n) {
for (j = 3 * i; j <= n; j += 2 * i)
p[j] = '0';
do {
i += 2;
} while (p[i] - '1');
}
return p;
}
int main() {
int n;
st... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 190 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i+... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i+... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 64, 9, 0, 7, 15, 16, 12, 16, 31, 13], ["+", 64, 9, 0, 7, 15, 16, 12, 16, 31, 13]] | 1 | 281 | 6 |
#include <stdio.h>
int isprime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
int main() {
int n, i, min, max;
int number[10000 + 2] = {0};
for (i = 2; i < 10000; i++) {
number[i] = isprime(i);
}
while (scanf("%d", &n)) {
if (n == 0)
break;
... | #include <stdio.h>
int isprime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
int main() {
int n, i, min, max;
int number[10000 + 2] = {0};
for (i = 2; i < 10000; i++) {
number[i] = isprime(i);
}
while (scanf("%d", &n)) {
if (n == 0)
break;
... | [["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 184 | 34 |
#include <stdio.h>
const int MAX_V = 10000; // 100???????????????????f???????ยข\????ยฐ???ยฌ?????
int prime[MAX_V + 1];
int main() {
int k, i, max, min, n; // 1????????f???????C0????????f????????????????????ยข
for (i = 2; i <= MAX_V; i++) {
prime[i] = 1; // 2???????ยฃ????f????????????ยฐ??????ยจ
}
for (i = 2; i * i ... | #include <stdio.h>
const int MAX_V = 1000000; // 100???????????????????f???????ยข\????ยฐ???ยฌ?????
int prime[MAX_V + 1];
int main() {
int k, i, max, min, n; // 1????????f???????C0????????f????????????????????ยข
for (i = 2; i <= MAX_V; i++) {
prime[i] = 1; // 2???????ยฃ????f????????????ยฐ??????ยจ
}
for (i = 2; i * ... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 17, 68]] | 1 | 199 | 4 |
#include <stdio.h>
int main() {
const int MAX_V = 10000;
int prime[MAX_V + 1];
int i, k, v, ans, dif;
for (i = 2; i <= MAX_V; i++) {
prime[i] = 1;
}
for (i = 2; i * i <= MAX_V; i++) {
if (prime[i]) {
for (k = 2 * i; k <= MAX_V; k += i) {
prime[k] = 0;
}
}
}
while (scanf(... | #include <stdio.h>
int main() {
const int MAX_V = 10000;
int prime[MAX_V + 1];
int i, k, v, ans, dif;
for (i = 2; i <= MAX_V; i++) {
prime[i] = 1;
}
for (i = 2; i * i <= MAX_V; i++) {
if (prime[i]) {
for (k = 2 * i; k <= MAX_V; k += i) {
prime[k] = 0;
}
}
}
while (scanf(... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 196 | 4 |
#include <cmath>
#include <iostream>
using namespace std;
#define MAX_N 3000000
int prime[MAX_N], twin[MAX_N];
void isprime(int c) {
prime[2] = 1;
for (int i = 3; i < c; i += 2) {
for (int j = 3; j <= sqrt(i); j += 2) {
if (i % j == 0) {
goto E;
}
}
prime[i] = 1;
E:;
}
}
void... | #include <cmath>
#include <iostream>
using namespace std;
#define MAX_N 3700000
int prime[MAX_N], twin[MAX_N];
void isprime(int c) {
prime[2] = 1;
for (int i = 3; i < c; i += 2) {
for (int j = 3; j <= sqrt(i); j += 2) {
if (i % j == 0) {
goto E;
}
}
prime[i] = 1;
E:;
}
}
void... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 17, 151], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 104], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 125]] | 1 | 216 | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.