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 |
|---|---|---|---|---|---|
/*
AOJ 0281
Title:Formation
@kankichi573
*/
#include <stdio.h>
#define min(x, y) ((x) > (y) ? (y) : (x))
int Q;
int solve(int c, int a, int n) {
int ret, w;
// printf("CAN=%d %d %d\n",c,a,n);
if (c + a + n < 3 || c == 0)
ret = 0;
else if (a == 0 && n == 0)
ret = c / 3;
else if (n == 0) {
... | /*
AOJ 0281
Title:Formation
@kankichi573
*/
#include <stdio.h>
#define min(x, y) ((x) > (y) ? (y) : (x))
int Q;
int solve(int c, int a, int n) {
int ret, w;
// printf("CAN=%d %d %d\n",c,a,n);
if (c + a + n < 3 || c == 0)
ret = 0;
else if (a == 0)
ret = c / 3;
else if (n == 0) {
if (2 * a... | [["-", 75, 76, 0, 57, 15, 23, 0, 16, 17, 98], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 60], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 236 | 4 |
#include <stdio.h>
int main(void) {
int q, c, a, n, i, j, count;
scanf("%d", &q);
for (i = 0; i < q; i++) {
count = 0;
scanf("%d%d%d", &c, &a, &n);
if (c <= a && c <= n) {
count += c;
a -= c, n -= c, c = 0;
} else if (a <= c && a <= n) {
count += a;
c -= a, n -= a, a = 0;
... | #include <stdio.h>
int main(void) {
int q, c, a, n, i, j, count;
scanf("%d", &q);
for (i = 0; i < q; i++) {
count = 0;
scanf("%d%d%d", &c, &a, &n);
if (c <= a && c <= n) {
count += c;
a -= c, n -= c, c = 0;
} else if (a <= c && a <= n) {
count += a;
c -= a, n -= a, a = 0;
... | [["-", 0, 9, 0, 1, 0, 34, 12, 11, 17, 110], ["+", 0, 9, 0, 1, 0, 34, 12, 11, 17, 32]] | 0 | 207 | 2 |
#include <stdio.h>
int main() {
int nen = 0, c = 0, a = 0, n = 0, ans = 0;
scanf("%d", &nen);
for (int i = 0; i < nen; i++) {
scanf("%d%d%d", &c, &a, &n);
while (1) {
if (a == 0 || c == 0 || n == 0) {
break;
}
c--;
a--;
n--;
ans++;
}
while (1) {
... |
#include <stdio.h>
int main() {
int nen = 0, c = 0, a = 0, n = 0, ans = 0;
scanf("%d", &nen);
for (int i = 0; i < nen; i++) {
scanf("%d%d%d", &c, &a, &n);
while (1) {
if (a == 0 || c == 0 || n == 0) {
break;
}
c--;
a--;
n--;
ans++;
}
while (1) {
... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 168 | 5 |
#include <iostream>
using namespace std;
int main() {
int Q = 0;
int C[101];
int A[101];
int N[101];
int cun[101];
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> C[i] >> A[i] >> N[i];
cun[i] = 0;
}
for (int i = 0; i < Q; i++) {
while ((A[i] >= 1) && (C[i] >= 1) && (N[i] >= 1)) {
N[... | #include <iostream>
using namespace std;
int main() {
int Q = 0;
int C[101];
int A[101];
int N[101];
int cun[101];
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> C[i] >> A[i] >> N[i];
cun[i] = 0;
}
for (int i = 0; i < Q; i++) {
while ((A[i] >= 1) && (C[i] >= 1) && (N[i] >= 1)) {
N[... | [["-", 15, 339, 51, 16, 12, 23, 0, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 12, 13]] | 1 | 265 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
scanf("%d", &q);
while (q--) {
int c, a, n;
scanf("%d %d %d", &c, &a, &n);
int res = 0;
while (c & a & n) {
c--;
a--;
n--;
res++;
}
while (c >= 2 && a) {
c -= 2;
a--;
res++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int q;
scanf("%d", &q);
while (q--) {
int c, a, n;
scanf("%d %d %d", &c, &a, &n);
int res = 0;
while (c && a && n) {
c--;
a--;
n--;
res++;
}
while (c >= 2 && a) {
c -= 2;
a--;
res++;
}... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 67], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 98], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 67], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98]] | 1 | 127 | 4 |
#define _CRT_SECUREj_NO_WARNINGS 1
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <... | #define _CRT_SECUREj_NO_WARNINGS 1
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <... | [["-", 12, 2, 3, 4, 0, 83, 0, 16, 17, 48], ["+", 12, 2, 3, 4, 0, 83, 0, 16, 17, 85]] | 1 | 346 | 2 |
#include <algorithm>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef pair<int, int> P;
const int INF = 1000000000;
int c, a, n;
int main() {
int q;
scanf("%d", &q)... | #include <algorithm>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef pair<int, int> P;
const int INF = 1000000000;
int c, a, n;
int main() {
int q;
scanf("%d", &q)... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 166 | 2 |
#include <iostream>
using namespace std;
int n, a, b, c, sum;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
while (c > 0 && a > 0 && b > 0) {
a--;
b--;
c--;
sum++;
}
while (a > 1 && b > 0) {
a -= 2;
b--;
sum++;
}
while (a >... | #include <iostream>
using namespace std;
int n, a, b, c, sum;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
sum = 0;
while (c > 0 && a > 0 && b > 0) {
a--;
b--;
c--;
sum++;
}
while (a > 1 && b > 0) {
a -= 2;
b--;
sum++;
}
... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 122 | 4 |
#include <stdio.h>
#define MAX 100
int main() {
int Q, tc, ta, tn;
int c[MAX], a[MAX], n[MAX], team;
scanf("%d", &Q);
for (int i = 0; i < Q; i++) {
scanf("%d %d %d", &c[i], &a[i], &n[i]);
}
for (int i = 0; i < Q; i++) {
tc = c[i];
ta = a[i];
tn = n[i];
team = 0;
while (tc > 0... | #include <stdio.h>
#define MAX 100
int main() {
int Q, tc, ta, tn;
int c[MAX], a[MAX], n[MAX], team;
scanf("%d", &Q);
for (int i = 0; i < Q; i++) {
scanf("%d %d %d", &c[i], &a[i], &n[i]);
}
for (int i = 0; i < Q; i++) {
tc = c[i];
ta = a[i];
tn = n[i];
team = 0;
while (tc > 0... | [["-", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 209 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b, c, n, m, j;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
m = 0;
while (1) {
if (c > 0 && b > 0 && a > 0) {
c--;
b--;
a--;
m++;
} else
j++;
if (j > ... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b, c, n, m, j;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
j = 0;
m = 0;
while (1) {
if (c > 0 && b > 0 && a > 0) {
c--;
b--;
a--;
m++;
} else
j++;
... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 159 | 4 |
#include <iostream>
using namespace std;
#include <algorithm>
int main() {
int q;
cin >> q;
for (int i = 0; i < q; ++i) {
int c, a, n;
cin >> c >> a >> n;
int cnt = min(c, min(a, n));
c -= cnt;
a -= cnt;
n -= cnt;
if (a > 0) {
if (c > 2) {
if (c >= a * 2) {
cn... | #include <iostream>
using namespace std;
#include <algorithm>
int main() {
int q;
cin >> q;
for (int i = 0; i < q; ++i) {
int c, a, n;
cin >> c >> a >> n;
int cnt = min(c, min(a, n));
c -= cnt;
a -= cnt;
n -= cnt;
if (a >= 1) {
if (c >= 2) {
if (c >= a * 2) {
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 161 | 6 |
#include <iostream>
using namespace std;
int main() {
int n, c, a, m;
int i;
int cnt;
cin >> n;
for (i = 0; i < n; i++) {
cnt = 0;
cin >> c >> a >> m;
if (c == 0)
;
else if (a > 0) {
while (c > 0 && a > 0 && m > 0) {
c--;
a--;
m--;
cnt++;
}
... | #include <iostream>
using namespace std;
int main() {
int n, c, a, m;
int i;
int cnt;
cin >> n;
for (i = 0; i < n; i++) {
cnt = 0;
cin >> c >> a >> m;
if (c == 0)
;
else if (a > 0) {
while (c > 0 && a > 0 && m > 0) {
c--;
a--;
m--;
cnt++;
}
... | [["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 46], ["-", 0, 57, 75, 76, 0, 57, 64, 9, 0, 46]] | 1 | 139 | 2 |
#include <iostream>
using namespace std;
void solve() {
int Q;
cin >> Q;
for (int i = 0; i < Q; ++i) {
int c, a, n;
cin >> c >> a >> n;
int team = min(c, min(a, n));
c -= team;
a -= team;
n -= team;
if (c * 2 >= a) {
team += a;
c -= a * 2;
a = 0;
} else {
... | #include <iostream>
using namespace std;
void solve() {
int Q;
cin >> Q;
for (int i = 0; i < Q; ++i) {
int c, a, n;
cin >> c >> a >> n;
int team = min(c, min(a, n));
c -= team;
a -= team;
n -= team;
if (c >= 2 * a) {
team += a;
c -= a * 2;
a = 0;
} else {
... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 48]] | 1 | 147 | 4 |
#include <iostream>
using namespace std;
int main(void) {
for (;;) {
int a;
cin >> a;
if (a == 0)
break;
int b[a], goukei = 0, m = 0;
for (int A = 0; A < a; A++)
cin >> b[A];
for (int B = 0; B < a; B++) {
if (b[B] >= 1) {
goukei += 1;
b[B] -= 1;
}
}
... | #include <iostream>
using namespace std;
int main(void) {
for (;;) {
int a;
cin >> a;
if (a == 0)
break;
int b[a], goukei = 0, m = 0;
for (int A = 0; A < a; A++)
cin >> b[A];
for (int B = 0; B < a; B++) {
if (b[B] >= 1) {
goukei += 1;
b[B] -= 1;
}
}
... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 170 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, n, i, m, k;
cin >> n;
m = n;
while (n != 0) {
k = 0;
for (i = 1; i <= n; i++) {
cin >> a;
if (a <= 0) {
m--;
}
if (a >= 1) {
k++;
}
}
if (m <= 0) {
cout << "NA" << endl;
} e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, n, i, m, k;
cin >> n;
m = n;
while (n != 0) {
k = 0;
for (i = 1; i <= n; i++) {
cin >> a;
if (a <= 1) {
m--;
}
if (a >= 1) {
k++;
}
}
if (m <= 0) {
cout << "NA" << endl;
} e... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 119 | 2 |
#include <iostream>
using namespace std;
int N, a, b, c;
int main() {
for (;;) {
cin >> N;
if (N == 0) {
a = 1;
b = 0;
for (int i = 0; i < N; i++) {
cin >> c;
if (c != 0) {
a++;
}
if (c > 1) {
b++;
}
}
if (b == 0) {
... | #include <iostream>
using namespace std;
int N, a, b, c;
int main() {
for (;;) {
cin >> N;
if (N != 0) {
a = 1;
b = 0;
for (int i = 0; i < N; i++) {
cin >> c;
if (c != 0) {
a++;
}
if (c > 1) {
b++;
}
}
if (b == 0) {
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79]] | 1 | 120 | 2 |
#include <iostream>
using namespace std;
int f(int x, int y, int a, int b) {
if (x >= 5 && y >= 2)
return (a * x + b * y) * 8 / 10;
return (a * x + b * y);
}
int main() {
int N;
while (cin >> N) {
int sum = 0, mx = 0;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (x) {
... | #include <iostream>
using namespace std;
int f(int x, int y, int a, int b) {
if (x >= 5 && y >= 2)
return (a * x + b * y) * 8 / 10;
return (a * x + b * y);
}
int main() {
int N;
while (cin >> N && N) {
int sum = 0, mx = 0;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (x) {
... | [["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]] | 1 | 153 | 2 |
#include <stdio.h>
int main(void) {
int i, s, k, max, kai;
while (0 == 0) {
scanf("%d", &k);
if (k == 0)
break;
kai = k;
scanf("%d", &s);
max = s;
if (s == 0)
kai--;
for (i = 1; i < k; i++) {
scanf(" %d", &s);
if (max < s)
max = s;
if (s == 0)
... | #include <stdio.h>
int main(void) {
int i, s, k, max, kai;
while (0 == 0) {
scanf("%d", &k);
if (k == 0)
break;
kai = k;
scanf("%d", &s);
max = s;
if (s == 0)
kai--;
for (i = 1; i < k; i++) {
scanf(" %d", &s);
if (max < s)
max = s;
if (s == 0)
... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22]] | 1 | 147 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
#define MAX 11000
int main() {
long long int n;
long long int input[MAX];
while (cin >> n && n != 0) {
long long int _min = 99999999;
long long int all = 0;
long long int _max = 0;
long long int zero = 0;
for (long long int i ... | #include <algorithm>
#include <iostream>
using namespace std;
#define MAX 11000
int main() {
long long int n;
long long int input[MAX];
while (cin >> n && n != 0) {
long long int _min = 99999999;
long long int all = 0;
long long int _max = 0;
long long int zero = 0;
for (long long int i =... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 179 | 2 |
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n, k[10000];
while (cin >> n) {
if (n == 0)
break;
int maxim = 0, sum = 0;
for (int i = 0; i < n; i++) {
cin >> k[i];
sum += (1 & k[i]);
maxim = max(maxim, k[i]);
}
if (maxim <= 1)
c... | #include <iostream>
using namespace std;
int main() {
// your code goes here
int n, k[10000];
while (cin >> n) {
if (n == 0)
break;
int maxim = 0, sum = 0;
for (int i = 0; i < n; i++) {
cin >> k[i];
sum += (int)(bool)(k[i]);
maxim = max(maxim, k[i]);
}
if (maxim <= 1)
... | [["-", 0, 1, 0, 11, 12, 23, 0, 16, 31, 13], ["-", 0, 1, 0, 11, 12, 23, 0, 16, 17, 67], ["+", 0, 1, 0, 11, 12, 74, 39, 77, 39, 40], ["+", 8, 9, 0, 1, 0, 11, 12, 74, 0, 25], ["+", 0, 1, 0, 11, 12, 74, 51, 74, 0, 24], ["+", 0, 11, 12, 74, 51, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 11, 12, 74, 51, 74, 0, 25], ["+", 0, 11, 12,... | 1 | 118 | 8 |
import java.io.*;
import java.math.*;
import java.util.*;
class Main {
public static void main(String[] args) throws IOException {
// BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
Scanner r = new Scanner(System.in);
char[] c;
String s;
int[] huda = new int[10];
int ... | import java.io.*;
import java.math.*;
import java.util.*;
class Main {
public static void main(String[] args) throws IOException {
// BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
Scanner r = new Scanner(System.in);
char[] c;
String s;
int[] huda = new int[10];
int ... | [["-", 0, 1, 0, 492, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 492, 3, 4, 0, 16, 12, 499]] | 3 | 304 | 2 |
import java.util.*;
class Main {
Scanner sc = new Scanner(System.in);
void main() {
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
int[] pr = new int[n];
int fld = 0;
String cd = sc.next();
for (int i = 0; i < 100; i++) {
char ch = cd.charAt(i);
... | import java.util.*;
class Main {
Scanner sc = new Scanner(System.in);
void main() {
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
int[] pr = new int[n];
int fld = 0;
String cd = sc.next();
for (int i = 0; i < 100; i++) {
char ch = cd.charAt(i);
... | [["-", 8, 196, 0, 7, 8, 1, 0, 492, 141, 22], ["+", 8, 196, 0, 7, 8, 1, 0, 492, 141, 22]] | 3 | 322 | 2 |
#include <stdio.h>
int main(void) {
int n;
char card[101], field;
int i, j, par[10];
int tmp;
while (scanf("%d", &n) * n != 0) {
field = 0;
for (i = 0; i < 10; i++) {
par[i] = 0;
}
scanf("%s", card);
for (i = 0; card[i] != 0; i++) {
switch (card[i]) {
case 'M':
... | #include <stdio.h>
int main(void) {
int n;
char card[101], field;
int i, j, par[10];
int tmp;
while (scanf("%d", &n) * n != 0) {
field = 0;
for (i = 0; i < 10; i++) {
par[i] = 0;
}
scanf("%s", card);
for (i = 0; card[i] != 0; i++) {
switch (card[i]) {
case 'M':
... | [["+", 0, 100, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 100, 0, 1, 0, 11, 12, 16, 12, 13]] | 0 | 295 | 2 |
#include <stdio.h>
int main() {
int N;
int p[20] = {0};
int i, j, temp, s;
int ba = 0;
char c[200];
while (1) {
scanf("%d", &N);
if (N == 0) {
break;
}
ba = 0;
for (i = 0; i < 10; i++) {
p[i] = 0;
}
scanf("%s", c);
for (j = 0; j < 100; j++) {
s = j % N;
... | #include <stdio.h>
int main() {
int N;
int p[20] = {0};
int i, j, temp, s;
int ba = 0;
char c[200];
while (1) {
scanf("%d", &N);
if (N == 0) {
break;
}
ba = 0;
for (i = 0; i < 10; i++) {
p[i] = 0;
}
scanf("%s", c);
for (j = 0; j < 100; j++) {
s = j % N;
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 320 | 5 |
a[11], j;
main(N, i) {
for (; scanf("%d", &N), j = N; memset(a, 0, sizeof(a))) {
for (getchar(), i = 0; (j = getchar()) != '\n'; i++)
if (j == 'M')
a[i % N]++;
else if (j - 'L')
a[N] += a[i % N] + 1, a[i % N] = 0;
else
a[i % N] += a[N] + 1, a[N] = 0;
for (i = 0; i < N... | a[11], j;
main(N, i) {
for (; scanf("%d", &N), j = N; memset(a, 0, sizeof(a))) {
for (getchar(), i = 0; (j = getchar()) != '\n'; i++)
if (j == 'M')
a[i % N]++;
else if (j - 'L')
a[N] += a[i % N] + 1, a[i % N] = 0;
else
a[i % N] += a[N] + 1, a[N] = 0;
for (i = 0; i < N... | [["-", 8, 7, 10, 11, 12, 16, 31, 16, 12, 22], ["-", 0, 7, 8, 7, 10, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 17, 47], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 12, 22]] | 0 | 256 | 39 |
a[11], j;
main(N, i) {
for (; scanf("%d", &N), j = N; memset(a, 0, sizeof(a))) {
for (getchar(), i = 0; (j = getchar()) != '\n'; i++)
if (j == 'M')
a[i % N]++;
else if (j - 'L')
a[N] += a[i % N] + 1, a[i % N] = 0;
else
a[i % N] += a[N] + 1, a[N] = 0;
for (i = 0; i <= ... | a[11], j;
main(N, i) {
for (; scanf("%d", &N), j = N; memset(a, 0, sizeof(a))) {
for (getchar(), i = 0; (j = getchar()) != '\n'; i++)
if (j == 'M')
a[i % N]++;
else if (j - 'L')
a[N] += a[i % N] + 1, a[i % N] = 0;
else
a[i % N] += a[N] + 1, a[N] = 0;
for (i = 0; i <= ... | [["-", 26, 2, 3, 4, 0, 69, 71, 27, 17, 29], ["+", 0, 7, 8, 9, 0, 7, 26, 34, 0, 21], ["+", 8, 9, 0, 7, 26, 34, 12, 27, 28, 22], ["+", 8, 9, 0, 7, 26, 34, 12, 27, 17, 29]] | 0 | 239 | 24 |
#include <algorithm>
#include <iostream>
using namespace std;
string Card;
int pk[10] = {0};
int N;
int field;
int main() {
while (1) {
int cnt = 0;
cin >> N;
if (N == 0)
break;
cin >> Card;
while (cnt < 100) {
for (int j = 0; j < N; j++, cnt++) {
if (cnt > 100)
br... | #include <algorithm>
#include <iostream>
using namespace std;
string Card;
int pk[10] = {0};
int N;
int field;
int main() {
while (1) {
int cnt = 0;
cin >> N;
if (N == 0)
break;
cin >> Card;
while (cnt < 100) {
for (int j = 0; j < N; j++, cnt++) {
if (cnt >= 100)
b... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 224 | 2 |
#include <bits/stdc++.h>
using namespace std;
int n;
string str;
int p[10], f;
int main() {
while (cin >> n, n) {
cin >> str;
memset(p, 0, sizeof(p));
for (int i = 0; i < 100; i++) {
int cur = i % n;
if (str[i] == 'M')
p[cur]++;
else if (str[i] == 'S') {
f += p[cur] +... | #include <bits/stdc++.h>
using namespace std;
int n;
string str;
int p[10], f;
int main() {
while (cin >> n, n) {
cin >> str;
memset(p, 0, sizeof(p));
f = 0;
for (int i = 0; i < 100; i++) {
int cur = i % n;
if (str[i] == 'M')
p[cur]++;
else if (str[i] == 'S') {
f ... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 186 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
while (1) {
char C[101];
int N = 0;
int P[11];
int B = 0;
int A = 0;
cin >> N;
if (N == 0) {
break;
}
for (int i = 0; i < 10; i++) {
P[i] = 0;
}
for (int i = 0; i < 100; i++) {
cin ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
while (1) {
char C[101];
int N = 0;
int P[11];
int B = 0;
int A = 0;
cin >> N;
if (N == 0) {
break;
}
for (int i = 0; i < 10; i++) {
P[i] = 0;
}
for (int i = 0; i < 100; i++) {
cin ... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 274 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, f = 0, i;
char c;
while (cin >> n, n != 0) {
int a[n];
for (i = 0; i < n; i++) {
a[i] = 0;
}
for (i = 0; i < 100; i++) {
cin >> c;
switch (c) {
case 'M':
a[i % n]++;
break;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, f, i;
char c;
while (cin >> n, n != 0) {
f = 0;
int a[n];
for (i = 0; i < n; i++) {
a[i] = 0;
}
for (i = 0; i < 100; i++) {
cin >> c;
switch (c) {
case 'M':
a[i % n]++;
br... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 199 | 6 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
string card;
cin >> card;
int p[10] = {0}, f = 0, t = 0;
int c = 0;
while (c < 100) {
string s =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
string card;
cin >> card;
int p[10] = {0}, f = 0, t = 0;
int c = 0;
while (c < 100) {
string s =... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107]] | 1 | 220 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
int N;
vector<int> P;
int R;
while (true) {
cin >> N;
if (N == 0) {
break;
}
P = vector<int>(N, 0);
R = 0;
cin >> S;
for (int i = 0; i < S.size(); ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
int N;
vector<int> P;
int R;
while (true) {
cin >> N;
if (N == 0) {
break;
}
P = vector<int>(N, 0);
R = 0;
cin >> S;
for (int i = 0; i < S.size(); ... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107]] | 1 | 217 | 2 |
#include <iostream>
using namespace std;
#include <algorithm>
#include <cstring>
int main() {
int n;
int hand[100];
while (cin >> n && n != 0) {
memset(hand, 0, sizeof(hand));
int field = 0;
int num = 0;
for (int i = 0; i < 100; i++) {
char c;
cin >> c;
if (c == 'M')
... | #include <iostream>
using namespace std;
#include <algorithm>
#include <cstring>
int main() {
int n;
int hand[100];
while (cin >> n && n != 0) {
memset(hand, 0, sizeof(hand));
int field = 0;
int num = 0;
for (int i = 0; i < 100; i++) {
char c;
cin >> c;
if (c == 'M')
... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 193 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
while (1) {
int ba = 0;
int a;
string x;
cin >> a;
if (a == 0)
break;
cin >> x;
vector<int> s(a);
for (int b = 0; b < 100; b++) {
s[b % a]++;
switch (x[b]) ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
while (1) {
int ba = 0;
int a;
string x;
cin >> a;
if (a == 0)
break;
cin >> x;
vector<int> s(a);
for (int b = 0; b < 100; b++) {
s[b % a]++;
switch (x[b]) ... | [["-", 8, 9, 0, 99, 8, 9, 0, 100, 0, 162], ["+", 8, 9, 0, 99, 8, 9, 0, 100, 0, 173], ["+", 0, 99, 8, 9, 0, 100, 51, 103, 0, 104], ["+", 0, 99, 8, 9, 0, 100, 51, 103, 0, 125]] | 1 | 173 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
/*void sort(int* array, int index){
bool finish = true;
while(finish){
finish = false;
for(int i = 1; i < index; i++){
if(array[i - 1] > array[i]){
int temp = array[i - 1];
array[i - 1] = a... | #include <algorithm>
#include <iostream>
using namespace std;
/*void sort(int* array, int index){
bool finish = true;
while(finish){
finish = false;
for(int i = 1; i < index; i++){
if(array[i - 1] > array[i]){
int temp = array[i - 1];
array[i - 1] = a... | [["-", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 80, 81, 22]] | 1 | 231 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
while (1) {
int N;
cin >> N;
if (N == 0)
break;
int player[N + 1];
for (int i = 0; i < N + 1; i++) {
player[i] = 0;
}
int all = 0;
int num = 1;
for (int i = 1; i < 101; i++) {
char x;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
while (1) {
int N;
cin >> N;
if (N == 0)
break;
int player[N + 1];
for (int i = 0; i < N + 1; i++) {
player[i] = 0;
}
int all = 0;
int num = 1;
for (int i = 1; i < 101; i++) {
char x;
... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 267 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, m[15], st;
int b;
char f[150];
int i, j;
int tmp;
while (cin >> n, n) {
for (i = 0; i < 15; i++)
m[i] = 0;
b = 0;
st = 0;
cin >> f;
for (i = 0; i < 100; i++) {
if (st == n)
st = 0;
if (f[i] == '... | #include <iostream>
using namespace std;
int main() {
int n, m[15], st;
int b;
char f[150];
int i, j;
int tmp;
while (cin >> n, n) {
for (i = 0; i < 15; i++)
m[i] = 0;
b = 0;
st = 0;
cin >> f; // scanf("%s",f);
for (i = 0; i < 100; i++) {
if (st == n)
st = 0;
... | [["+", 0, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 277 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) { new Main().run(); }
private void run() {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
while (n-- > 0) {
int num = Integer.MAX_VALUE / 2;
int num2 = (1 << 8) - 1;
long s = ... |
import java.util.Scanner;
public class Main {
public static void main(String[] args) { new Main().run(); }
private void run() {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
while (n-- > 0) {
int num = Integer.MAX_VALUE;
int num2 = (1 << 8) - 1;
long s = Long... | [["-", 8, 196, 0, 503, 49, 200, 51, 16, 17, 85], ["-", 8, 196, 0, 503, 49, 200, 51, 16, 12, 499]] | 3 | 185 | 2 |
#include <math.h>
#include <stdio.h>
int main(void) {
int n, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
unsigned intp, decp;
double dec;
int hex, max;
scanf("%x", &hex);
intp = (hex >> 7) & 0xFFFFFF;
decp = hex & 0x7F;
dec = max = 0;
for (j = 0; j < 7; j++) {
if (de... | #include <math.h>
#include <stdio.h>
int main(void) {
int n, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
unsigned intp, decp;
double dec;
int hex, max;
scanf("%x", &hex);
intp = (hex >> 7) & 0xFFFFFF;
decp = hex & 0x7F;
dec = max = 0;
for (j = 0; j < 7; j++) {
if (de... | [["+", 0, 16, 12, 23, 0, 16, 12, 23, 0, 24], ["+", 12, 23, 0, 16, 12, 23, 0, 16, 31, 13], ["+", 12, 23, 0, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 16, 12, 23, 0, 16, 12, 23, 0, 25]] | 0 | 164 | 4 |
/*
AOJ 0268
Title:
@kankichi573
*/
#include <float.h>
#include <stdio.h>
#include <string.h>
main() {
float xx;
int x, i, j, Q, sign;
char buf[100];
scanf("%d", &Q);
// printf("Q=%d\n",Q);
for (i = 0; i < Q; i++) {
scanf("%x", &x);
if (x & 1 << 31) {
sign = -1;
x &= 0x7fffffff;
... | /*
AOJ 0268
Title:Kongo Type
@kankichi573
*/
#include <float.h>
#include <stdio.h>
#include <string.h>
main() {
double xx;
int x, i, j, Q, sign;
char buf[100];
scanf("%d", &Q);
// printf("Q=%d\n",Q);
for (i = 0; i < Q; i++) {
scanf("%x", &x);
if (x & 1 << 31) {
sign = -1;
x &= 0x... | [["-", 36, 36, 0, 30, 0, 9, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 9, 0, 43, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 177 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define rep1(i, x) for (int i = 1; i <= x; i++)
int main() {
double a[40];
int k[40];
int t = 1;
for (int i = 24; i > 0; i--) {
a[i] = t;
k[i] = 1;
t *= ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define rep1(i, x) for (int i = 1; i <= x; i++)
int main() {
double a[40];
int k[40];
int t = 1;
for (int i = 24; i > 0; i--) {
a[i] = t;
k[i] = 1;
t *= ... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 451 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pint;
typedef vector<int> vint;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T, class U> void chmin(T &t, U f) {
if (t > f)
t = f;
}
template <class T, class U> void chmax(T &t, U f) {... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pint;
typedef vector<int> vint;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T, class U> void chmin(T &t, U f) {
if (t > f)
t = f;
}
template <class T, class U> void chmax(T &t, U f) {... | [["+", 0, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 12, 13]] | 1 | 309 | 2 |
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
string S;
char T[17] = "0123456789abcdef";
int Q;
int U[32];
int power[4] = {1, 2, 4, 8};
void Bit(string W) {
int c[8], v[32];
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 16; j++) {
if (W[i] == T[j]) {
... | #include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
string S;
char T[17] = "0123456789abcdef";
int Q;
int U[32];
int power[4] = {1, 2, 4, 8};
void Bit(string W) {
int c[8], v[32];
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 16; j++) {
if (W[i] == T[j]) {
... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 146], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 591 | 4 |
#include <cctype>
#include <iomanip>
#include <iostream>
using namespace std;
string getBit(char ch) {
int x = isdigit(ch) ? ch - '0' : ch - 'a' + 10;
string res = "";
for (int i = 8; i >= 1; i /= 2) {
if (x & i)
res += "1";
else
res += "0";
}
return res;
}
int main() {
int Q;
cin >>... | #include <cctype>
#include <iomanip>
#include <iostream>
using namespace std;
string getBit(char ch) {
int x = isdigit(ch) ? ch - '0' : ch - 'a' + 10;
string res = "";
for (int i = 8; i >= 1; i /= 2) {
if (x & i)
res += "1";
else
res += "0";
}
return res;
}
int main() {
int Q;
cin >>... | [["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13]] | 1 | 290 | 2 |
#include <cctype>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
unsigned int num = 0;
for (int j = 0; j < 8; j++) {
num <<= 4;
if (isdigit(s[j]))
num += s[j] - '0';
else
n... | #include <cctype>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
unsigned int num = 0;
for (int j = 0; j < 8; j++) {
num <<= 4;
if (isdigit(s[j]))
num += s[j] - '0';
else
n... | [["+", 0, 52, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98]] | 1 | 243 | 4 |
#include <cmath>
#include <cstdio>
using namespace std;
typedef unsigned int ui;
int main() {
int q;
scanf("%d", &q);
while (q--) {
ui bit;
scanf("%x", &bit);
if (bit >> 31 & 1)
putchar('-');
int Seisu = (bit & 0x7FFFFFFF) >> 7;
int Syosu = (bit & 0x0000007F) * 78125;
double ans = 0.... | #include <cmath>
#include <cstdio>
using namespace std;
typedef unsigned int ui;
int main() {
int q;
scanf("%d", &q);
while (q--) {
ui bit;
scanf("%x", &bit);
if (bit >> 31 & 1)
putchar('-');
int Seisu = (bit & 0x7FFFFFFF) >> 7;
int Syosu = (bit & 0x0000007F);
double ans = 0.0;
i... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 48], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 160 | 4 |
gets
$<.map{|l|n=0.0;b=l.hex;30.times{|i|n+=(i<7?0.5**(7-i):2**(i-7))*b[i]};p n*(-1)**b[31]} | gets
$<.map{|l|n=0.0;b=l.hex;31.times{|i|n+=(i<7?0.5**(7-i):2**(i-7))*b[i]};p n*(-1)**b[31]} | [["-", 0, 652, 196, 196, 8, 734, 0, 652, 486, 612], ["+", 0, 652, 196, 196, 8, 734, 0, 652, 486, 612]] | 4 | 68 | 2 |
gets
$<.map{|l|n=0.0;b=l.hex;31.times{|i|n+=(2**(24-i))*b[i]};p n*(-1)**b[31]} | gets
$<.map{|l|n=0.0;b=l.hex;31.times{|i|n+=(2**(i-7))*b[i]};p n*(-1)**b[31]} | [["-", 31, 739, 0, 738, 12, 739, 0, 738, 31, 612], ["-", 31, 739, 0, 738, 12, 739, 0, 738, 17, 33], ["+", 31, 739, 0, 738, 12, 739, 0, 738, 17, 33], ["+", 31, 739, 0, 738, 12, 739, 0, 738, 12, 612]] | 4 | 56 | 4 |
for i in range(eval(input())):
b=format(int(input(),16),"b").zfill(32)
a1=0
a2=0.0
for i in range(1,25):
a1+=int(b[i])*2**(24-i)
for i in range(25,32):
a2+=int(b[i])*2**(24-i)
print("-1"*int(b[0])+str(a1)+str(a2)[1:]) | for i in range(eval(input())):
b=format(int(input(),16),"b").zfill(32)
a1=0
a2=0.0
for i in range(1,25):
a1+=int(b[i])*2**(24-i)
for i in range(25,32):
a2+=int(b[i])*2**(24-i)
print("-"*int(b[0])+str(a1)+str(a2)[1:]) | [["-", 0, 657, 31, 657, 31, 657, 31, 557, 0, 6], ["+", 0, 657, 31, 657, 31, 657, 31, 557, 0, 6]] | 5 | 123 | 2 |
#include <complex>
#include <iostream>
#include <math.h>
#include <vector>
#define EPS 1e-4
#define PI 3.141592
#define EQ(a, b) (abs((a) - (b)) < EPS)
using namespace std;
typedef complex<double> P;
vector<P> house;
vector<P> ume, sak, mo;
double cross(P v1, P v2) {
return v1.real() * v2.imag() - v1.imag() * v2... | #include <complex>
#include <iostream>
#include <math.h>
#include <vector>
#define EPS 1e-4
#define PI 3.141592
#define EQ(a, b) (abs((a) - (b)) < EPS)
using namespace std;
typedef complex<double> P;
vector<P> house;
vector<P> ume, sak, mo;
double cross(P v1, P v2) {
return v1.real() * v2.imag() - v1.imag() * v2... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 817 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double R;
typedef complex<R> P;
namespace std {
bool operator<(P a, P b) {
r... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double R;
typedef complex<R> P;
namespace std {
bool operator<(P a, P b) {
r... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 1,346 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define reps(i, f, n) for (int i = f; i < int(n); ++i)
#define rep(i, n) reps(i, 0, n)
const double PI = acos(-1);
bool ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define reps(i, f, n) for (int i = f; i < int(n); ++i)
#define rep(i, n) reps(i, 0, n)
const double PI = acos(-1);
bool ... | [["+", 64, 9, 0, 1, 0, 16, 12, 16, 17, 72], ["+", 64, 9, 0, 1, 0, 16, 12, 16, 12, 13]] | 1 | 540 | 2 |
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int N = Integer.parseInt(s.next());
int Q = Integer.parseInt(s.next());
TreeSet<Integer> set = new TreeSet<Integer>();
for (int i = 0; i < N; i++) {
int c = Integer.parseInt(s.next(... | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int N = Integer.parseInt(s.next());
int Q = Integer.parseInt(s.next());
TreeSet<Integer> set = new TreeSet<Integer>();
for (int i = 0; i < N; i++) {
int c = Integer.parseInt(s.next(... | [["-", 0, 7, 8, 196, 0, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 31, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 17, 109], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 12, 22]] | 3 | 213 | 4 |
#include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
set<int, greater<int>> values;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
values.insert(v);
}
int max_value = *values.begin();
for (int i = 0; i < Q; i++) {
int q;
ci... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
set<int, greater<int>> values;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
values.insert(v);
}
int max_value = *values.begin();
for (int i = 0; i < Q; i++) {
int q;
ci... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 178 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
#define TT template <typename T>
#define ET(T) typename T::value_type
TT inline T sq(T x) { return x * x; }
TT inline T In() {
T x;
cin >> x;
return x;
}
TT inline int ubnd(T &v, ET(T) x) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
#define TT template <typename T>
#define ET(T) typename T::value_type
TT inline T sq(T x) { return x * x; }
TT inline T In() {
T x;
cin >> x;
return x;
}
TT inline int ubnd(T &v, ET(T) x) {
... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 710 | 2 |
#include <algorithm>
#include <cstdio>
#define M 50
using namespace std;
int n, q;
int c[300100], x;
int main() {
scanf("%d%d", &n, &q);
int lim = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &c[i]);
lim = max(lim, c[i]);
}
sort(c, c + n);
int m[M] = {0};
for (int i = 1; i <= M; i++) {
for (... | #include <algorithm>
#include <cstdio>
#define M 50
using namespace std;
int n, q;
int c[300100], x;
int main() {
scanf("%d%d", &n, &q);
int lim = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &c[i]);
lim = max(lim, c[i]);
}
sort(c, c + n);
int m[M + 1] = {0};
for (int i = 1; i <= M; i++) {
f... | [["+", 0, 43, 49, 50, 49, 80, 81, 16, 17, 72], ["+", 0, 43, 49, 50, 49, 80, 81, 16, 12, 13]] | 1 | 277 | 2 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int arr[300002];
int mo[300001];
int main() {
int n, q;
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++)
scanf("%d", &arr[i + 1]);
arr[0] = 0;
sort(arr, arr + n + 1);
arr[n + 1] = 300001;
for (int i = 0; i < n + 1; i++) {
... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int arr[300002];
int mo[300001];
int main() {
int n, q;
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++)
scanf("%d", &arr[i + 1]);
arr[0] = 0;
sort(arr, arr + n + 1);
arr[n + 1] = 300001;
for (int i = 0; i < n + 1; i++) {
... | [["+", 0, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 219 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000007
using namespace std;
typedef long long int ll;
int main() {
int n, q;
cin >> n... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000007
using namespace std;
typedef long long int ll;
int main() {
int n, q;
cin >> n... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 271 | 6 |
#include <cstdio>
#define MAX_N 300000
#define MAX_C 300000
int main() {
int N, Q;
scanf("%d %d\n", &N, &Q);
int card[MAX_N];
bool has_card[MAX_C + 1];
for (int i = 0; i < N; i++) {
scanf("%d", &card[i]);
// printf("card %d ", card[i]);
}
for (int i = 0; i <= MAX_C; i++) {
has_card[i] = fals... | #include <cstdio>
#define MAX_N 300000
#define MAX_C 300000
int main() {
int N, Q;
scanf("%d %d\n", &N, &Q);
int card[MAX_N];
bool has_card[MAX_C + 1];
for (int i = 0; i < N; i++) {
scanf("%d", &card[i]);
// printf("card %d ", card[i]);
}
for (int i = 0; i <= MAX_C; i++) {
has_card[i] = fals... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20]] | 1 | 233 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, q, last[300001];
cin >> n >> q;
for (int i = 0; i <= 300000; i++)
last[i] = -1;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
last[c] = c;
}
last[0] = 0;
for (int i = 1; i <= 300000; i++) {
if (last[i] == -1)
last[i] ... | #include <iostream>
using namespace std;
int main() {
int n, q, last[300001];
cin >> n >> q;
for (int i = 0; i <= 300000; i++)
last[i] = -1;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
last[c] = c;
}
last[0] = 0;
for (int i = 1; i <= 300000; i++) {
if (last[i] == -1)
last[i] ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 188 | 4 |
// Modular Query
// c[i] = i 以下のカードのうち最大のカード
// wrong answer
// 1/5
#include <iostream>
using namespace std;
int main() {
int N, Q, q;
int c[300001] = {0};
cin >> N >> Q;
while (N-- > 0) {
int i;
cin >> i;
c[i] = i;
}
for (int i = 1; i < 300001; i++) {
if (!c[i])
c[i] = c[i - 1];
... | // Modular Query
// c[i] = i 以下のカードのうち最大のカード
// wrong answer
// 1/5
#include <iostream>
using namespace std;
int main() {
int N, Q, q;
int c[300001] = {0};
cin >> N >> Q;
while (N-- > 0) {
int i;
cin >> i;
c[i] = i;
}
for (int i = 1; i < 300001; i++) {
if (!c[i])
c[i] = c[i - 1];
... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 153 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); ... | [["-", 49, 50, 51, 69, 341, 342, 0, 16, 31, 22], ["+", 341, 342, 0, 16, 31, 2, 63, 118, 28, 22], ["+", 341, 342, 0, 16, 31, 2, 63, 118, 17, 131], ["+", 341, 342, 0, 16, 31, 2, 63, 118, 119, 120], ["+", 341, 342, 0, 16, 31, 2, 3, 4, 0, 24], ["+", 341, 342, 0, 16, 31, 2, 3, 4, 0, 25], ["-", 31, 66, 28, 23, 0, 16, 31, 2, ... | 1 | 232 | 8 |
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main() {
int n, q;
cin >> n >> q;
int c[300001];
fill(c, c + 300001, 0);
rep(i, n) {
int cc;
cin >> cc;
c[cc] = cc;
}
rep(i, 300000) c[i + 1] = max(c[i], c[i + 1]);
rep(i, q) {
int a;
c... | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main() {
int n, q;
cin >> n >> q;
int c[300001];
fill(c, c + 300001, 0);
rep(i, n) {
int cc;
cin >> cc;
c[cc] = cc;
}
rep(i, 300000) c[i + 1] = max(c[i], c[i + 1]);
rep(i, q) {
int a;
c... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 167 | 4 |
#include <stdio.h>
typedef long long ll;
const ll MOD = 1000000007;
ll fact[112345] = {1};
ll bit[112345];
int str[112345];
int main() {
for (int i = 1; i < 112345; ++i)
fact[i] = fact[i - 1] * i % MOD;
for (;;) {
int n;
scanf("%d", &n);
if (!n)
return 0;
for (int i = 0; i < n; ++i)
... | #include <stdio.h>
typedef long long ll;
const ll MOD = 1000000007;
ll fact[112345] = {1};
ll bit[112345];
int str[112345];
int main() {
for (int i = 1; i < 112345; ++i)
fact[i] = fact[i - 1] * i % MOD;
for (;;) {
int n;
scanf("%d", &n);
if (!n)
return 0;
for (int i = 0; i < n; ++i)
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 337 | 4 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int p;
int ppow(int a) {
int b = p - 2, res = 1;
while (b) {
if (b & 1)
res = (res * a) % p;
a = (a * a) % p;
b >>= 1;
}
return res;
}
int o2(string &s, int &i);
int o3(string &s, int &i);
int num(st... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int p;
int ppow(int a) {
int b = p - 2, res = 1;
while (b) {
if (b & 1)
res = (res * a) % p;
a = (a * a) % p;
b >>= 1;
}
return res;
}
int o2(string &s, int &i);
int o3(string &s, int &i);
int num(st... | [["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["+", 31, 23, 0, 16, 12, 2, 3, 4, 0, 25], ["+", 75, 76, 0, 1, 0, 11, 12, 16, 17, 109], ["+", 75, 76, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 586 | 4 |
#include <stdio.h>
#include <string.h>
int main() {
int m[2][6] = {{1, -1, 1, 4, 5, 2}, {2, 3, -1, 5, 2, 1}};
char s[101];
int n, i, a;
while (1) {
scanf("%s", s);
if (s[0] == '#')
break;
n = 0;
a = 1;
for (i = 0; i < strlen(s); i++) {
n = m[s[i] - '0'][n];
if (n == -1) {
... | #include <stdio.h>
#include <string.h>
int main() {
int m[2][6] = {{1, -1, 1, 4, 5, 2}, {2, 3, -1, 5, 2, 1}};
char s[101];
int n, i, a;
while (1) {
scanf("%s", s);
if (s[0] == '#')
break;
n = 0;
a = 1;
for (i = 0; i < strlen(s); i++) {
n = m[s[i] - '0'][n];
if (n == -1) {
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 175 | 2 |
#include <stdio.h>
int main() {
char s[110];
int i, d, m[7][2] = {{1, 2}, {6, 3}, {1, 6}, {4, 5}, {5, 2}, {2, 5}, {6, 6}};
while (scanf("%s", s), s[0] - '#') {
for (i = d = 0; s[i]; i++)
d = m[d][s[i] - '0'];
if (d - 5)
printf("No\n");
else
printf("Yes\n");
}
return 0;
} | #include <stdio.h>
int main() {
char s[110];
int i, d, m[7][2] = {{1, 2}, {6, 3}, {1, 6}, {4, 5}, {5, 2}, {2, 1}, {6, 6}};
while (scanf("%s", s), s[0] - '#') {
for (i = d = 0; s[i]; i++)
d = m[d][s[i] - '0'];
if (d - 5)
printf("No\n");
else
printf("Yes\n");
}
return 0;
} | [["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]] | 0 | 152 | 2 |
#include <stdio.h>
#include <string.h>
int main(void) {
char road[150];
int str;
int i;
char aka;
while (scanf("%s", road)) {
if (road[0] == '#') {
break;
}
str = strlen(road);
aka = 'A';
for (i = 0; i < str; i++) {
switch (aka) {
case 'A':
if (road[i] == '0') ... | #include <stdio.h>
#include <string.h>
int main(void) {
char road[150];
int str;
int i;
char aka;
while (scanf("%s", road)) {
if (road[0] == '#') {
break;
}
str = strlen(road);
aka = 'A';
for (i = 0; i < str; i++) {
switch (aka) {
case 'A':
if (road[i] == '0') ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 336 | 2 |
#include <cstring>
#include <iostream>
using namespace std;
string removedFirst(string str) {
string ans;
if (str.length() == 1) {
return ans;
}
else {
for (int i = 1; i < str.length(); i++) {
ans += str[i];
}
return ans;
}
}
int main() {
string str;
getline(cin, str);
while (... | #include <cstring>
#include <iostream>
using namespace std;
string removedFirst(string str) {
string ans;
if (str.length() == 1) {
return ans;
}
else {
for (int i = 1; i < str.length(); i++) {
ans += str[i];
}
return ans;
}
}
int main() {
string str;
getline(cin, str);
while (... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 377 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
char getNext(char now, int way) {
switch (now) {
case 'a':
return way ? 'y' : 'x';
case 'x':
return way ? 'z' : 'o';
case 'z':
return way ? 'b' : 'w';
case 'b':
return way ? 'x' : 'y';
case 'w':... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
char getNext(char now, int way) {
switch (now) {
case 'a':
return way ? 'y' : 'x';
case 'x':
return way ? 'z' : 'o';
case 'z':
return way ? 'b' : 'w';
case 'b':
return way ? 'x' : 'y';
case 'w':... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 242 | 4 |
#include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
const int to[7][2] = {{1, 3}, {6, 2}, {4, 5}, {1, 6}, {5, 3}, {3, 1}};
while (1) {
char s[128];
scanf("%s", s);
if (s[0] == '#')
break;
int u = 0;
for (int i = 0; s[i]; i++)
u = t... | #include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
const int to[7][2] = {{1, 3}, {6, 2}, {4, 5}, {1, 6}, {5, 3}, {3, 1}, {6, 6}};
while (1) {
char s[128];
scanf("%s", s);
if (s[0] == '#')
break;
int u = 0;
for (int i = 0; s[i]; i++)
... | [["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 21], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 45], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 21], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 46]] | 1 | 157 | 6 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#define reep(i, n, m) for (int i = (n); i < (m); i++)
#define rep(i, n) reep(i, 0, n)
using namespace std;
char road[100][2] = {0};
int main() {
string str;
road['A'][0] = 'X';
road['A'][1] = 'Y';
road['X'][1] = 'Z';
road['Z'][... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#define reep(i, n, m) for (int i = (n); i < (m); i++)
#define rep(i, n) reep(i, 0, n)
using namespace std;
char road[100][2] = {0};
int main() {
string str;
road['A'][0] = 'X';
road['A'][1] = 'Y';
road['X'][1] = 'Z';
road['Z'][... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 307 | 4 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int g[6][2] = {{1, 2}, {10, 3}, {1, 10}, {4, 5}, {5, 2}, {2, 1}};
char str[128];
while (scanf("%s", str), str[0] != '#') {
int pos = 0;
bool flag = false;
for (int i = 0; str[i]; i++) {
pos = g[pos][str[i]... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int g[6][2] = {{1, 2}, {10, 3}, {1, 10}, {4, 5}, {5, 2}, {2, 1}};
char str[128];
while (scanf("%s", str), str[0] != '#') {
int pos = 0;
bool flag = false;
for (int i = 0; str[i]; i++) {
pos = g[pos][str[i]... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 179 | 2 |
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int b[6][2] = {{1, 2}, {-1, 3}, {1, -1}, {4, 5}, {5, 2}, {1, 0}};
int main() {
int i, j, a[1000], f = 0;
char s[10000];
while (1) {
scanf("%s\0", s);
f = 0;
if (s[0] == '#')
break;
int ans = 0;
for (i = 0; i ... | #include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int b[6][2] = {{1, 2}, {-1, 3}, {1, -1}, {4, 5}, {5, 2}, {2, 1}};
int main() {
int i, j, a[1000], f = 0;
char s[10000];
while (1) {
scanf("%s\0", s);
f = 0;
if (s[0] == '#')
break;
int ans = 0;
for (i = 0; i ... | [["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]] | 1 | 237 | 4 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vecto... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vecto... | [["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]] | 1 | 176 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [["-", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 334 | 4 |
#include <iostream>
using namespace std;
int d[10][10];
void init() {
for (int i = 0; i < 6; i++)
for (int j = 0; j < 6; j++)
d[i][j] = -1;
d[0][0] = d[5][1] = d[2][0] = 1;
d[0][1] = d[4][1] = d[5][0] = 2;
d[1][1] = 3;
d[3][0] = 4;
d[3][1] = d[4][0] = 5;
}
string s;
void solve() {
int p = 0;
f... | #include <iostream>
using namespace std;
int d[10][10];
void init() {
for (int i = 0; i < 6; i++)
for (int j = 0; j < 6; j++)
d[i][j] = -1;
d[0][0] = d[5][1] = d[2][0] = 1;
d[0][1] = d[4][1] = d[5][0] = 2;
d[1][1] = 3;
d[3][0] = 4;
d[3][1] = d[4][0] = 5;
}
string s;
void solve() {
int p = 0;
f... | [["-", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 262 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int n;
int v[11][2];
int main(void) {
v[0][0] = 2;
v[0][1] = 3;
v[1][0] = 5;
v[1][1] = 3;
v[2][0] = -1;
v[2][1] = 4;
v[3][0] = 2;
v[3][1] = -1;
v[4][0] = 1;
v[4][1] = 5;
v[5][0] = 3;
v[5][1] = 2;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int n;
int v[11][2];
int main(void) {
v[0][0] = 2;
v[0][1] = 3;
v[1][0] = 5;
v[1][1] = 3;
v[2][0] = -1;
v[2][1] = 4;
v[3][0] = 2;
v[3][1] = -1;
v[4][0] = 1;
v[4][1] = 5;
v[5][0] = 3;
v[5][1] = 2;
... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 243 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int root[6][2] = {{1, 2}, {-1, 3}, {1, -1}, {4, 5}, {5, 2}, {2, 1}};
int now;
string p;
while (cin >> p) {
if (p == "#")
break;
now = 0;
for (int i = 0; i < p.size(); i++) {
now = root[now][p[i] - '0'];
if (n... | #include <iostream>
#include <string>
using namespace std;
int main() {
int root[6][2] = {{1, 2}, {-1, 3}, {1, -1}, {4, 5}, {5, 2}, {2, 1}};
int now;
string p;
while (cin >> p) {
if (p == "#")
break;
now = 0;
for (int i = 0; i < p.size(); i++) {
now = root[now][p[i] - '0'];
if (n... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 157 | 2 |
#include <iostream>
main() {
int i, n, m[7][2] = {4, 3, 3, 4, 0, 4, 6, 5, 3, 6, 2};
for (std::string p; std::cin >> p, n = p != "#";
std::cout << (n ? "No\n" : "Yes\n"))
for (i = 0; i < p.size();)
n = m[n][p[i++] - 48];
} | #include <iostream>
main() {
int i, n, m[7][2] = {4, 3, 3, 4, 0, 4, 6, 5, 3, 6, 2, 0, 6, 6};
for (std::string p; std::cin >> p, n = p != "#";
std::cout << (n ? "No\n" : "Yes\n"))
for (i = 0; i < p.size();)
n = m[n][p[i++] - 48];
} | [["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 21], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13]] | 1 | 114 | 6 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
string str;
while (1) {
int flg = 0;
char NOW = 'A';
cin >> str;
if (str == "#")
break;
for (int i = 0; i < str.size() && flg == 0; i++) {
if (str[i] == '0') {
... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
string str;
while (1) {
int flg = 0;
char NOW = 'A';
cin >> str;
if (str == "#")
break;
for (int i = 0; i < str.size() && flg == 0; i++) {
if (str[i] == '0') {
... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 282 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define F(i, n) for (int i = 0; i < (int)(n); i++)
#define BW(x, a, b) (a <= x && x < b)
#define SV(v, w) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define F(i, n) for (int i = 0; i < (int)(n); i++)
#define BW(x, a, b) (a <= x && x < b)
#define SV(v, w) ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 470 | 4 |
$tb = {
a: {0 => :x, 1 => :y},
x: {1 => :z},
y: {0 => :x},
z: {0 => :w, 1 => :b},
w: {0 => :b, 1 => :y},
b: {0 => :y, 1 => :x},
}
def solve(routes)
city = :a
routes.each { |route|
city = $tb[city][route]
return false if city.nil?
}
city == :b
end
while (routes = gets.strip) != "#"
puts sol... | $tb = {
a: {0 => :x, 1 => :y},
x: {1 => :z},
y: {0 => :x},
z: {0 => :w, 1 => :b},
w: {0 => :b, 1 => :y},
b: {0 => :y, 1 => :x},
}
def solve(routes)
city = :a
routes.each { |route|
city = $tb[city][route]
return false if city.nil?
}
city == :b
end
while (routes = gets.strip) != "#"
puts sol... | [["-", 0, 652, 3, 4, 0, 754, 64, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 754, 64, 557, 0, 6], ["-", 0, 652, 3, 4, 0, 754, 75, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 754, 75, 557, 0, 6]] | 4 | 137 | 4 |
dic={"A":{"0":"X","1":"Y"},
"X":{"0":"E","1":"Z"},
"Y":{"0":"X","1":"E"},
"Z":{"0":"W","1":"B"},
"W":{"0":"B","1":"Y"},
"B":{"0":"Y","1":"X"},
"E":{"0":"E","1":"E"}}
while True:
route=input()
if route=="#":break
state="A"
for r in route:
state=dic[state][r]
... | dic={"A":{"0":"X","1":"Y"},
"X":{"0":"E","1":"Z"},
"Y":{"0":"X","1":"E"},
"Z":{"0":"W","1":"B"},
"W":{"0":"B","1":"Y"},
"B":{"0":"Y","1":"X"},
"E":{"0":"E","1":"E"}}
while True:
route=input()
if route=="#":break
state="A"
for r in route:
state=dic[state][r]
pri... | [["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25], ["-", 0, 52, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 652, 3, 4, 0, 41, 0, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 41, 0, 557, 0, 6]] | 5 | 212 | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int num[2000] = {}, co = n;
for (int i = 0; i < n; i++)
cin >> num[i];
for (int i = 0;; i++) {
bool kawa = 1;
if (i == 10000) {
cout << -1 << endl;
break;
}
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int num[2000] = {}, co = n;
for (int i = 0; i < n; i++)
cin >> num[i];
for (int i = 0;; i++) {
bool kawa = 1;
if (i == 10000) {
cout << -1 << endl;
break;
}
for (int j = ... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 47], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 17, 20]] | 1 | 263 | 25 |
#include <algorithm>
#include <cstdio>
#include <vector>
#define LIMIT 10000
using namespace std;
bool ck(vector<int> &v) {
for (int i = 0; i < v.size(); i++)
if (v[i] != i + 1)
return false;
return true;
}
main() {
int n, i, j, s, x, l;
vector<int> tri;
for (i = 1; i < 99; i++)
tri.push_back(i ... | #include <algorithm>
#include <cstdio>
#include <vector>
#define LIMIT 10000
using namespace std;
bool ck(vector<int> &v) {
for (int i = 0; i < v.size(); i++)
if (v[i] != i + 1)
return false;
return true;
}
main() {
int n, i, j, s, x, l;
vector<int> tri;
for (i = 1; i < 199; i++)
tri.push_back(i... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 316 | 2 |
#include <algorithm>
#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 <vector>
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, ... | #include <algorithm>
#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 <vector>
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, ... | [["+", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111], ["+", 0, 57, 15, 339, 51, 91, 28, 23, 0, 24], ["+", 0, 57, 15, 339, 51, 91, 28, 23, 0, 25]] | 1 | 477 | 3 |
#include <stdio.h>
int main() {
int x, y;
scanf("%d%d", &x, &y);
printf("%d\n", x + y);
} | #include <stdio.h>
int main() {
int x, y;
scanf("%d%d", &x, &y);
printf("%d\n", x * y);
} | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 48]] | 1 | 38 | 2 |
d,c = map(int,input(),split())
print(d * c) | d,c = map(int,input().split())
print(d * c) | [["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 21], ["+", 12, 652, 3, 4, 0, 652, 63, 319, 0, 131]] | 5 | 22 | 2 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
int e = sc.nextInt();
int f = sc.nextInt();
if ((a * 1 + b * 5 + c * 10 + d * 5... | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
int e = sc.nextInt();
int f = sc.nextInt();
if ((a * 1 + b * 5 + c * 10 + d * 5... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499]] | 3 | 139 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
String str = reader.readLine();
int c1 = Inte... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
String str = reader.readLine();
int c1 = Inte... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 20]] | 3 | 252 | 2 |
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
int a[] = new int[6];
a[1] = 1;
a[2] = 5;
a[3] = 10;
a[4] = 50;
a[5] = 100;
a[6] = 500;
int ans = 0;
for (int i = 0; i < a.length; i++) {
int t... | import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
int a[] = new int[6];
a[0] = 1;
a[1] = 5;
a[2] = 10;
a[3] = 50;
a[4] = 100;
a[5] = 500;
int ans = 0;
for (int i = 0; i < a.length; i++) {
int t... | [["-", 8, 196, 0, 1, 0, 11, 31, 504, 71, 499], ["+", 8, 196, 0, 1, 0, 11, 31, 504, 71, 499]] | 3 | 155 | 12 |
import java.util.*;
class Main {
int c1;
int c5;
int c10;
int c50;
int c100;
int c500;
int sum;
Main() {
Scanner sc = new Scanner(System.in);
c1 = sc.nextInt();
c5 = sc.nextInt();
c10 = sc.nextInt();
c50 = sc.nextInt();
c100 = sc.nextInt();
c500 = sc.nextInt();
c1 = 1 * ... | import java.util.*;
class Main {
int c1;
int c5;
int c10;
int c50;
int c100;
int c500;
int sum;
Main() {
Scanner sc = new Scanner(System.in);
c1 = sc.nextInt();
c5 = sc.nextInt();
c10 = sc.nextInt();
c50 = sc.nextInt();
c100 = sc.nextInt();
c500 = sc.nextInt();
c1 = 1 * ... | [["-", 8, 519, 0, 57, 15, 15, 0, 16, 17, 47], ["+", 8, 519, 0, 57, 15, 15, 0, 16, 17, 20]] | 3 | 196 | 2 |
import java.util.*;
class Main {
Main() {
Scanner sc = new Scanner(System.in);
int[] c = {1, 5, 10, 50, 100, 500};
int x = 0;
for (int i = 0; i < 6; i++) {
int a = sc.nextInt();
x = x + (c[i] * a);
}
int y = 0;
if (x > 1000)
y = 1;
System.out.println(y);
}
public ... | import java.util.*;
class Main {
Main() {
Scanner sc = new Scanner(System.in);
int[] c = {1, 5, 10, 50, 100, 500};
int x = 0;
for (int i = 0; i < 6; i++) {
int a = sc.nextInt();
x = x + (c[i] * a);
}
int y = 0;
if (x >= 1000)
y = 1;
System.out.println(y);
}
public... | [["-", 8, 519, 0, 57, 15, 15, 0, 16, 17, 47], ["+", 8, 519, 0, 57, 15, 15, 0, 16, 17, 20]] | 3 | 130 | 2 |
#include <stdio.h>
int main() {
int c1, c5, c10, c50, c100, c500, d, e, f, g, h, i, j;
c1 = 1;
c5 = 5;
c10 = 10;
c50 = 50;
c100 = 100;
c500 = 500;
scanf("%d%d%d%d%d%d", &e, &f, &g, &h, &i, &j);
d = (c1 * e) + (c5 * f) + (c10 * g) + (c50 * h) + (c100 * i) + (c500 * j);
if (d >= 1000) {
printf("1\... | #include <stdio.h>
int main() {
int c1, c5, c10, c50, c100, c500, d, e, f, g, h, i, j;
c1 = 1;
c5 = 5;
c10 = 10;
c50 = 50;
c100 = 100;
c500 = 500;
scanf("%d%d%d%d%d%d", &e, &f, &g, &h, &i, &j);
d = (c1 * e) + (c5 * f) + (c10 * g) + (c50 * h) + (c100 * i) + (c500 * j);
if (d >= 1000) {
printf("1\... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 157 | 2 |
#include <stdio.h>
int main(void) {
int a, b, c, d, e, f, x;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &f);
x = a * 1 + b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (x > 1000) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c, d, e, f, x;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &f);
x = a * 1 + b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (x >= 1000) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20]] | 0 | 105 | 2 |
#include <stdio.h>
int main() {
int c1, c5, c10, c50, c100, c500, a, b, c, d, e, f;
scanf("%d %d %d %d %d", &c1, &c5, &c10, &c50, &c100, &c500);
a = c1;
b = c5 * 5;
c = c10 * 10;
d = c50 * 50;
e = c100 * 100;
f = c500 * 500;
if (a + b + c + d + e >= 1000) {
printf("%d\n", 1);
} else {
prin... | #include <stdio.h>
int main() {
int c1, c5, c10, c50, c100, c500, a, b, c, d, e, f;
scanf("%d %d %d %d %d %d", &c1, &c5, &c10, &c50, &c100, &c500);
a = c1;
b = c5 * 5;
c = c10 * 10;
d = c50 * 50;
e = c100 * 100;
f = c500 * 500;
if (a + b + c + d + e + f >= 1000) {
printf("%d\n", 1);
} else {
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 12, 22]] | 0 | 134 | 4 |
#include <stdio.h>
int main(void) {
int a, b, c, d, e, f;
scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f);
if (1000 < a * 1 + b * 5 + c * 10 + d * 50 + e * 100 + f * 500) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c, d, e, f;
scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f);
if (1000 <= a * 1 + b * 5 + c * 10 + d * 50 + e * 100 + f * 500) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19]] | 0 | 99 | 2 |
#include <stdio.h>
int main(void) {
int c1, c5, c10, c50, c100, c500, a;
scanf("%d %d %d %d %d %d", &c1, &c5, &c10, &c50, &c100, &c500);
a = c1 + 5 * c5 * 10 * c10 + 50 * c50 + 100 * c100 + 500 * c500;
if (a >= 1000)
printf("1\n");
else
printf("0\n");
return 0;
} | #include <stdio.h>
int main(void) {
int c1, c5, c10, c50, c100, c500, a;
scanf("%d %d %d %d %d %d", &c1, &c5, &c10, &c50, &c100, &c500);
a = c1 + 5 * c5 + 10 * c10 + 50 * c50 + 100 * c100 + 500 * c500;
if (a >= 1000)
printf("1\n");
else
printf("0\n");
return 0;
} | [["-", 31, 16, 31, 16, 12, 16, 31, 16, 17, 48], ["+", 12, 16, 31, 16, 31, 16, 31, 16, 17, 72]] | 0 | 99 | 2 |
#include <stdio.h>
int main(void) {
int i;
int n, sum = 0;
int money[6] = {1, 5, 10, 50, 100, 500};
for (i = 0; i < 6; i++) {
scanf("%d", &n);
money[i] *= n;
sum += money[i];
}
printf("%d\n", (sum > 1000));
return 0;
} | #include <stdio.h>
int main(void) {
int i;
int n, sum = 0;
int money[6] = {1, 5, 10, 50, 100, 500};
for (i = 0; i < 6; i++) {
scanf("%d", &n);
money[i] *= n;
sum += money[i];
}
printf("%d\n", (sum >= 1000));
return 0;
} | [["-", 0, 2, 3, 4, 0, 23, 0, 16, 17, 47], ["+", 0, 2, 3, 4, 0, 23, 0, 16, 17, 20]] | 0 | 95 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.