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 <stdio.h>
#include <string.h>
int main(void) {
int x, i, c, w;
char n[1001];
while (1) {
c = 0;
w = 0;
scanf("%s", n);
if (n[0] == '0')
break;
for (i = 1; i < strlen(n); i++) {
if (n[i] == 'A') {
c++;
} else {
w++;
}
}
if (c < w) {
... | #include <stdio.h>
#include <string.h>
int main(void) {
int i, c, w;
char n[1001];
while (1) {
c = 0;
w = 0;
scanf("%s", n);
if (n[0] == '0')
break;
for (i = 1; i < strlen(n); i++) {
if (n[i] == 'A') {
c++;
} else {
w++;
}
}
if (c < w) {
w+... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 133 | 3 |
#include <cstdio>
#include <iostream>
using namespace std;
int max(int, int);
int main(void) {
char str[200];
int a, b;
while (1) {
for (int i = 0; i < 200; i++) {
str[i] = '\0';
}
scanf("%[^\n]%*c", str);
a = 0;
b = 0;
if (str[0] == '0')
break;
for (int i = 1; str[i] !... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int max(int, int);
int main(void) {
char str[200];
int a, b;
while (1) {
for (int i = 0; i < 200; i++) {
str[i] = '\0';
}
scanf("%[^\n]%*c", str);
a = 0;
b = 0;
if (str[0] == '0')
break;
for (i... | [["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 8, 9, 0, 7, 15, 16, 12, 103, 0, 44], ["+", 8, 9, 0, 7, 15, 16, 12, 103, 0, 44]] | 1 | 213 | 4 |
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = (input.trim()).split("\n").map(Number);
for (var i = 0; i < Arr.length; i++) {
if (Arr[i] == -1)
break;
console.log(parseInt(Arr[i], 4));
} | var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = (input.trim()).split("\n").map(Number);
for (var i = 0; i < Arr.length; i++) {
if (Arr[i] == -1)
break;
console.log(Arr[i].toString(4));
} | [["-", 0, 1, 0, 2, 3, 3, 0, 2, 63, 22], ["-", 0, 2, 3, 3, 0, 2, 3, 3, 0, 24], ["-", 0, 2, 3, 3, 0, 2, 3, 3, 0, 21], ["+", 0, 2, 3, 3, 0, 2, 63, 558, 0, 131], ["+", 0, 2, 3, 3, 0, 2, 63, 558, 559, 560], ["+", 0, 2, 3, 3, 0, 2, 3, 3, 0, 24]] | 2 | 89 | 6 |
import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == -1)
break;
int order = 0;
for (; Math.pow(4, order) <= n; order++)
;
order--;
while (n > 3) {
... | import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == -1)
break;
int order = 1;
for (; Math.pow(4, order) <= n; order++)
;
order--;
while (order > 0... | [["-", 0, 52, 8, 196, 0, 503, 49, 200, 51, 499], ["+", 0, 52, 8, 196, 0, 503, 49, 200, 51, 499], ["-", 8, 196, 0, 52, 15, 15, 0, 16, 31, 22], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 31, 22], ["-", 8, 196, 0, 52, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 12, 499]] | 3 | 150 | 6 |
#include <stdio.h>
int main(void) {
char s[9][15] = {};
int a[2][9] = {};
int j, i = 0;
while (i++ < 9) {
j = 0;
scanf("%s ", s);
scanf("%d %d", &a[0][i], &a[1][i]);
printf("%s", s);
printf("%d %d\n", a[0][i] + a[1][i], a[0][i] * 200 + a[1][i] * 300);
}
return 0;
} | #include <stdio.h>
int main(void) {
char s[9][15] = {};
int a[2][9] = {};
int j, i = 0;
while (i++ < 9) {
j = 0;
scanf("%s", s);
scanf("%d %d", &a[0][i], &a[1][i]);
printf("%s", s);
printf(" %d %d\n", a[0][i] + a[1][i], a[0][i] * 200 + a[1][i] * 300);
}
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 143 | 4 |
#include <stdio.h>
int main() {
int i, N = 9, c[1000], a[1000], n[1000], s[100] = {0};
char S[100][100];
for (i = 0; i < N; i++) {
scanf("%s %d %d", S[i], &a[i], &n[i]);
s[i] = a[i] + n[i];
c[i] = a[i] * 200 + n[i] * 300;
}
for (i = 0; i < N; i++) {
printf("%s %d,%d\n", S[i], s[i], c[i]);
}
... | #include <stdio.h>
int main() {
int i, N = 9, c[1000], a[1000], n[1000], s[100] = {0};
char S[100][100];
for (i = 0; i < N; i++) {
scanf("%s %d %d", S[i], &a[i], &n[i]);
s[i] = a[i] + n[i];
c[i] = a[i] * 200 + n[i] * 300;
}
for (i = 0; i < N; i++) {
printf("%s %d %d\n", S[i], s[i], c[i]);
}
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 162 | 2 |
#include <stdio.h>
int main() {
char cl[20];
int i, am, pm, yen;
for (i = 0; i < 9; i++) {
scanf("%s%d%d", &cl, &am, &pm);
printf("%s%d%d\n", cl, am + pm, am * 200 + pm * 300);
}
return 0;
} | #include <stdio.h>
int main() {
char cl[20];
int i, am, pm, yen;
for (i = 0; i < 9; i++) {
scanf("%s%d%d", &cl, &am, &pm);
printf("%s %d %d\n", cl, am + pm, am * 200 + pm * 300);
}
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 79 | 2 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int a, b;
while (cin >> s >> a >> b) {
cout << a << " " << a + b << " " << a * 200 + b * 300 << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int a, b;
while (cin >> s >> a >> b) {
cout << s << " " << a + b << " " << a * 200 + b * 300 << endl;
}
return 0;
} | [["-", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22]] | 1 | 65 | 2 |
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <map>
//#include <utility>
#include <iostream>
#include <set>
//#include <memory>
#include <algorithm>
#include <string>
#include <vector>
//#include <functional>
#include <sstream>
//#include <deque>
#include <complex>
#include <cstdio>
... | #include <cfloat>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <map>
//#include <utility>
#include <iostream>
#include <set>
//#include <memory>
#include <algorithm>
#include <string>
#include <vector>
//#include <functional>
#include <sstream>
//#include <deque>
#include <complex>
#include <cstdio>
... | [["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 16, 31, 16, 12, 16, 12, 16, 17, 48]] | 1 | 381 | 2 |
#include <iostream>
#include <string>
using namespace std;
string S;
int a, b;
int main() {
while (cin >> S >> a >> b) {
cout << S << ' ' << a + b << ' ' << a * 200 + b * 300;
}
} | #include <iostream>
#include <string>
using namespace std;
string S;
int a, b;
int main() {
while (cin >> S >> a >> b) {
cout << S << ' ' << a + b << ' ' << a * 200 + b * 300 << endl;
}
} | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 58 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
string a;
int b, c;
cin >> a >> b >> c;
if (cin.fill())
break;
cout << a << " " << b + c << " " << b * 200 + c * 300 << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
string a;
int b, c;
cin >> a >> b >> c;
if (cin.fail())
break;
cout << a << " " << b + c << " " << b * 200 + c * 300 << endl;
}
} | [["-", 0, 57, 15, 339, 51, 2, 63, 118, 119, 120], ["+", 0, 57, 15, 339, 51, 2, 63, 118, 119, 120]] | 1 | 72 | 2 |
#include <cstdio>
int main() {
char n[32];
int m, a;
for (int i = 0; i < 9; i++) {
scanf("%s%d%d", n, &m, &a);
printf("%s %d %d\n", m + a, m * 200 + a * 300);
}
return 0;
} | #include <cstdio>
int main() {
char n[32];
int m, a;
for (int i = 0; i < 9; i++) {
scanf("%s%d%d", n, &m, &a);
printf("%s %d %d\n", n, m + a, m * 200 + a * 300);
}
return 0;
} | [["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21]] | 1 | 73 | 2 |
#include <stdio.h>
int main(void) {
int n, m, c, i;
int a[100000];
while (1) {
scanf("%d", &n);
if (n == -1)
break;
if (n == 0)
printf("0");
else {
c = 0;
while (n / 4) {
a[c++] = n % 4;
n /= 4;
}
a[c] = n % 4;
for (i = c; i >= 0; i--)
... | #include <stdio.h>
int main(void) {
int n, m, c, i;
int a[100000];
while (1) {
scanf("%d", &n);
if (n == -1)
break;
if (n == 0)
printf("0\n");
else {
c = 0;
while (n / 4) {
a[c++] = n % 4;
n /= 4;
}
a[c] = n % 4;
for (i = c; i >= 0; i--)
... | [["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 134 | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main(void) {
int a[100], n, i, j;
while (scanf("%d", &n), n != -1) {
if (n < 4)
printf("%d\n", n);
else {
for (i = 0; n != 0; i++) {
a[i] = n % 4;
n /= 4;
}
for (j = i - 1; j >= 0; j--)
printf("%d", a[i]);... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main(void) {
int a[100], n, i, j;
while (scanf("%d", &n), n != -1) {
if (n < 4)
printf("%d\n", n);
else {
for (i = 0; n != 0; i++) {
a[i] = n % 4;
n /= 4;
}
for (j = i - 1; j >= 0; j--)
printf("%d", a[j]);... | [["-", 8, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 8, 1, 0, 2, 3, 4, 0, 69, 71, 22]] | 0 | 125 | 2 |
#include <stdio.h>
int main(void) {
int num[10000];
int i;
int input;
while (1) {
scanf("%d", &input);
if (input == -1)
break;
i = 0;
while (input) {
num[i] = input % 4;
input /= 4;
i++;
if (i >= 10000)
return 1;
}
if (i == 0)
puts("0");
e... | #include <stdio.h>
int main(void) {
int num[10000];
int i;
int input;
while (1) {
scanf("%d", &input);
if (input == -1)
break;
i = 0;
while (input) {
num[i] = input % 4;
input /= 4;
i++;
if (i >= 10000)
return 1;
}
if (i == 0)
puts("0");
e... | [["+", 75, 76, 0, 9, 0, 7, 10, 27, 28, 22], ["+", 75, 76, 0, 9, 0, 7, 10, 27, 17, 68]] | 0 | 127 | 2 |
f(n) {
n > 3 && f(n / 4);
putchar(n % 4 + 65);
}
main(n) {
for (; scanf("%d", &n), ~n; puts(""))
f(n);
} | f(n) {
n > 3 && f(n / 4);
putchar(n % 4 + 48);
}
main(n) {
for (; scanf("%d", &n) + n; puts(""))
f(n);
} | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 34, 0, 21], ["-", 8, 9, 0, 7, 15, 34, 12, 91, 17, 92], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 72]] | 0 | 59 | 5 |
#include <stdio.h>
#include <string.h>
int main(void) {
int n;
int i;
int flag;
char temp[8];
while (1) {
scanf("%d", &n);
if (n == -1)
break;
if (n == 0) {
puts("0");
continue;
}
i = 0;
while (n) {
temp[i] = n % 4 + '0';
n /= 4;
i++;
}
... | #include <stdio.h>
#include <string.h>
int main(void) {
int n;
int i;
int flag;
char temp[8];
while (1) {
scanf("%d", &n);
if (n == -1)
break;
if (n == 0) {
puts("0");
continue;
}
i = 0;
while (n) {
temp[i] = n % 4 + '0';
n /= 4;
i++;
}
... | [["-", 0, 52, 8, 9, 0, 7, 10, 11, 31, 22], ["-", 0, 52, 8, 9, 0, 7, 10, 11, 17, 32], ["-", 8, 9, 0, 7, 10, 11, 12, 2, 63, 22], ["-", 0, 7, 10, 11, 12, 2, 3, 4, 0, 24], ["-", 0, 7, 10, 11, 12, 2, 3, 4, 0, 22], ["-", 0, 7, 10, 11, 12, 2, 3, 4, 0, 25]] | 0 | 135 | 6 |
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n;
while (scanf("%d", &n), n != -1) {
char adic[1000];
int i = 0;
if (n == 0)
printf("0\n");
else {
while (n > 0) {
adic[i] = n % 4 + '0';
n /= 4;
i++;
}
reverse(adic, adi... | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n;
while (scanf("%d", &n), n != -1) {
char adic[1000] = {0};
int i = 0;
if (n == 0)
printf("0\n");
else {
while (n > 0) {
adic[i] = n % 4 + '0';
n /= 4;
i++;
}
reverse(adi... | [["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 1 | 115 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#define mp(n, m) make_pair(n, m)
#def... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#define mp(n, m) make_pair(n, m)
#def... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19]] | 1 | 223 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int a, b[20], ok;
int main() {
while (true) {
ok = 0;
cin >> a;
if (a == -1) {
break;
}
for (int i = 0; i < 15; i++) {
b[i] = (a / (int)pow(4, i)) % 4;
}
for (int i = 14; i >= 0; i--) {
if (b[i] >= 1) {
ok ... | #include <cmath>
#include <iostream>
using namespace std;
int a, b[20], ok;
int main() {
while (true) {
ok = 0;
cin >> a;
if (a == -1) {
break;
}
for (int i = 0; i < 15; i++) {
b[i] = (a / (int)pow(4, i)) % 4;
}
for (int i = 14; i >= 0; i--) {
if (b[i] >= 1) {
ok ... | [["-", 0, 57, 64, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 57, 64, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 137 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
while (cin >> a, a >= 0) {
vector<int> ans;
if (a == 0)
ans.push_back(0);
while (a) {
ans.push_back(a % 4);
a /= 4;
}
reverse(ans.begin(), ans.end());
for (int i = 0; i < (int)ans.size(); i++)
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
while (cin >> a, a >= 0) {
vector<int> ans;
if (a == 0)
ans.push_back(0);
while (a) {
ans.push_back(a % 4);
a /= 4;
}
reverse(ans.begin(), ans.end());
for (int i = 0; i < (int)ans.size(); i++)
cout << ... | [["+", 0, 52, 8, 9, 0, 7, 8, 1, 0, 35], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22]] | 1 | 110 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b, cou;
while (1) {
cin >> a;
if (a == -1)
break;
b = 4;
for (b = 4; b < a; b = b * 4)
;
b = b / 4;
while (1) {
cout << a / b;
a %= b;
if (b == 1)
break;
b = b / 4;
}
cout << end... | #include <iostream>
using namespace std;
int main() {
int a, b, cou;
while (1) {
cin >> a;
if (a == -1)
break;
b = 4;
for (b = 4; b <= a; b = b * 4)
;
b = b / 4;
while (1) {
cout << a / b;
a %= b;
if (b == 1)
break;
b = b / 4;
}
cout << en... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 101 | 2 |
#include <iostream>
#include <vector>
#define MAX_N 1000000
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == -1)
break;
vector<int> vec;
int shift = 0;
for (long int i = 3; i <= MAX_N; i = i << 2) {
int tmp = n & i;
for (int j = 0; j < shift; j++) {
tmp... | #include <iostream>
#include <vector>
#define MAX_N 1000000
using namespace std;
int main() {
long int n;
while (cin >> n) {
if (n == -1)
break;
vector<int> vec;
int shift = 0;
for (long int i = 3; i <= MAX_N; i = i << 2) {
int tmp = n & i;
for (int j = 0; j < shift; j++) {
... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 188 | 5 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == -1)
break;
string s;
string temp;
for (int i = 0; n >> i; i += 2) {
temp += ((char)(n >> i) % 4) + '0';
}
if (temp.empty())
temp = "0";
for (int i = temp.size() - 1; i >= 0; --i)
... | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == -1)
break;
string s;
string temp;
for (int i = 0; n >> i; i += 2) {
temp += (char)((n >> i) % 4) + '0';
}
if (temp.empty())
temp = "0";
for (int i = temp.size() - 1; i >= 0; --i)
... | [["-", 12, 16, 31, 23, 0, 16, 31, 74, 0, 24], ["+", 0, 11, 12, 16, 31, 74, 51, 23, 0, 24]] | 1 | 125 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
vector<int> num;
while (cin >> n) {
if (n == 0) {
cout << 0 << endl;
continue;
}
for (int i = 0; n > 0; i++) {
num.push_back(n % 4);
n /= 4;
}
for (int i = num.siz... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
vector<int> num;
while (cin >> n, ~n) {
if (n == 0) {
cout << 0 << endl;
continue;
}
for (int i = 0; n > 0; i++) {
num.push_back(n % 4);
n /= 4;
}
for (int i = num... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 0, 52, 15, 339, 51, 34, 12, 91, 17, 92], ["+", 0, 52, 15, 339, 51, 34, 12, 91, 28, 22]] | 1 | 119 | 3 |
#include <stdio.h>
int main() {
long int a, b, c[1024] = {0}, i, j;
scanf("%ld\n", &a);
do {
i = 0;
if (a == 0) {
printf("%ld\n", a);
} else if (a != -1) {
b = a;
do {
a = b % 4;
b /= 4;
c[i++] = a;
// printf("%d",a);
} while (b > 3);
if ... | #include <stdio.h>
int main() {
long int a, b, c[1024] = {0}, i, j;
scanf("%ld\n", &a);
do {
i = 0;
if (a >= 0 && a <= 3) {
printf("%ld\n", a);
} else if (a != -1) {
b = a;
do {
a = b % 4;
b /= 4;
c[i++] = a;
// printf("%d",a);
} while (b > 3);
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 176 | 6 |
#include <stdio.h>
int main(void) {
int keta, n, i;
int kai[10000];
while (0 == 0) {
scanf("%d", &n);
keta = 0;
if (n == -1)
break;
while (n > 4) {
kai[keta] = n % 4;
n = n / 4;
keta++;
}
kai[keta] = n;
for (i = keta; i > 0; i--)
printf("%d", kai[i]);
... | #include <stdio.h>
int main(void) {
int keta, n, i;
int kai[100000];
while (0 == 0) {
scanf("%d", &n);
keta = 0;
if (n == -1)
break;
while (n > 3) {
kai[keta] = n % 4;
n = n / 4;
keta++;
}
kai[keta] = n;
for (i = keta; i > 0; i--)
printf("%d", kai[i]);
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 13]] | 1 | 126 | 4 |
while(n=gets.to_i)>-1
p n.to_s(4)end | while(n=gets.to_i)>-1
puts n.to_s(4)end | [["-", 0, 493, 0, 89, 8, 170, 0, 652, 735, 22], ["+", 0, 493, 0, 89, 8, 170, 0, 652, 735, 22]] | 4 | 19 | 2 |
<?php
$ref = array(
'black' => array(0, 0, 0),
'blue' => array(0, 0, 255),
'lime' => array(0, 255, 0),
'aqua' => array(0, 255, 255),
'red' => array(255, 0, 0),
'fuchsia' => array(255, 0, 255),
'yellow' => array(255, 0, 0),
'white' => array(255, 255, 255),
);
while ($line = trim(fgets(STDIN))) {
$r = hexdec(s... | <?php
$ref = array(
'black' => array(0, 0, 0),
'blue' => array(0, 0, 255),
'lime' => array(0, 255, 0),
'aqua' => array(0, 255, 255),
'red' => array(255, 0, 0),
'fuchsia' => array(255, 0, 255),
'yellow' => array(255, 255, 0),
'white' => array(255, 255, 255),
);
while ($line = trim(fgets(STDIN))) {
$r = hexdec... | [["-", 12, 227, 0, 618, 0, 227, 0, 618, 0, 612], ["+", 12, 227, 0, 618, 0, 227, 0, 618, 0, 612]] | 6 | 298 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
int[][] color = {{0, 0, 0}, {0, 0, 255}, {0, 255, 0},
{0, 255, 255}, {255, 0, 0}, {255, 0, 255},
{255, 255, 0}, {255, 255, 255}};
String[] name = {"black... | import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
int[][] color = {{0, 0, 0}, {0, 0, 255}, {0, 255, 0},
{0, 255, 255}, {255, 0, 0}, {255, 0, 255},
{255, 255, 0}, {255, 255, 255}};
String[] name = {"black... | [["+", 0, 1, 0, 11, 12, 504, 71, 16, 31, 499], ["+", 0, 1, 0, 11, 12, 504, 71, 16, 17, 33]] | 3 | 400 | 2 |
import java.lang.*;
import java.math.*;
import java.util.*;
public class Main {
Scanner sc = new Scanner(System.in);
class color {
int r, g, b;
String s;
color(int value, String s) {
r = value >> 16;
g = (value >> 8) & 255;
b = value & 255;
this.s = s;
}
int diff(col... | import java.lang.*;
import java.math.*;
import java.util.*;
public class Main {
Scanner sc = new Scanner(System.in);
class color {
int r, g, b;
String s;
color(int value, String s) {
r = value >> 16;
g = (value >> 8) & 255;
b = value & 255;
this.s = s;
}
int diff(colo... | [["-", 51, 518, 0, 230, 3, 4, 0, 5, 0, 491], ["+", 51, 518, 0, 230, 3, 4, 0, 5, 0, 491]] | 3 | 504 | 2 |
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.concurrent.LinkedBlockingDeque;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int colors[][] = {
{0, 0, 0}, {0, 0, 255}, {0, 255, 0}, {0, 255, 2... | import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.concurrent.LinkedBlockingDeque;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int colors[][] = {
{0, 0, 0}, {0, 0, 255}, {0, 255, 0}, {0, 255, 2... | [["-", 0, 503, 49, 200, 51, 518, 0, 518, 0, 499], ["-", 0, 503, 49, 200, 51, 518, 0, 518, 0, 21], ["+", 0, 503, 49, 200, 51, 518, 0, 518, 0, 21], ["+", 0, 503, 49, 200, 51, 518, 0, 518, 0, 499]] | 3 | 395 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 31, 13], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33]] | 1 | 770 | 4 |
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
int to_int(string s) {
int k = 1, res = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if ('0' <= s[i] && s[i] <= '9') {
res += k * (s[i] - '0');
} else {
res += k * (s[i] - 'a' + 10);
... | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
int to_int(string s) {
int k = 1, res = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if ('0' <= s[i] && s[i] <= '9') {
res += k * (s[i] - '0');
} else {
res += k * (s[i] - 'a' + 10);
... | [["-", 0, 57, 64, 1, 0, 11, 31, 69, 28, 22], ["+", 0, 57, 64, 1, 0, 11, 31, 69, 28, 22], ["-", 75, 76, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 75, 76, 0, 1, 0, 11, 31, 69, 28, 22]] | 1 | 393 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define pb push_back
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define dep(i, a, n) for (int i = (a); i >= (n); i--)
#define mod 1e9 + 7
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_wit... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define pb push_back
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define dep(i, a, n) for (int i = (a); i >= (n); i--)
#define mod 1e9 + 7
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_wit... | [["-", 64, 1, 0, 34, 12, 11, 12, 5, 0, 6], ["+", 64, 1, 0, 34, 12, 11, 12, 5, 0, 6]] | 1 | 756 | 6 |
import java.io.*;
import java.util.*;
public class Main {
static ArrayList<Integer> list = new ArrayList<Integer>();
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
makePrimeList();
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
int sum = ... | import java.io.*;
import java.util.*;
public class Main {
static ArrayList<Integer> list = new ArrayList<Integer>();
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
makePrimeList();
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
int sum = ... | [["-", 15, 15, 0, 16, 31, 492, 3, 4, 0, 22], ["+", 15, 15, 0, 16, 31, 492, 3, 4, 0, 22]] | 3 | 347 | 2 |
#define M 999999
P[M], N[M];
main(i, j, k, r, n, p, m) {
for (P[0] = P[1] = 1, i = 2; i < M; i++)
if (!P[i])
for (j = i * 2; j < M; j += i)
P[j] = 1;
for (i = 1; i < M; i++)
N[i] = N[i - 1] + !P[i];
for (; scanf("%d", &n), n; printf("%d\n", r))
for (r = -n, i = 0; i < n; i++) {
sca... | #define M 999999
P[M], N[M];
main(i, j, k, r, n, p, m) {
for (P[0] = P[1] = 1, i = 2; i < M; i++)
if (!P[i])
for (j = i * 2; j < M; j += i)
P[j] = 1;
for (i = 1; i < M; i++)
N[i] = N[i - 1] + !P[i];
for (; scanf("%d", &n), n; printf("%d\n", r))
for (r = -n, i = 0; i < n; i++) {
sca... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13]] | 0 | 225 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int n, m, p, prime[1000009], s[1000009];
int main() {
fill(prime + 2, prime + 1000000, 1);
for (int i = 2; i < 1000; i++) {
if (!prime[i])
continue;
for (int j = i * i; j < 1000000; j += i)
prime[j] = 0;
}
for (int i = 2; i < 1000... | #include <algorithm>
#include <iostream>
using namespace std;
int n, m, p, prime[1000009], s[1000009];
int main() {
fill(prime + 2, prime + 1000000, 1);
for (int i = 2; i < 1000; i++) {
if (!prime[i])
continue;
for (int j = i * i; j < 1000000; j += i)
prime[j] = 0;
}
for (int i = 2; i < 1000... | [["-", 341, 342, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 341, 342, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 341, 342, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 341, 342, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 198 | 4 |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.*;
import java.math.*;
import java.util.*;
// AC
public class Main {
Scanner sc = new Scanner(System.in);
int INF = 1 << 28;
double EPS = 1e-9;
void run() {
for (;;) {
double[] area = new double[2... | import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.*;
import java.math.*;
import java.util.*;
// AC
public class Main {
Scanner sc = new Scanner(System.in);
int INF = 1 << 28;
double EPS = 1e-9;
void run() {
for (;;) {
double[] area = new double[2... | [["-", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94], ["+", 8, 196, 0, 57, 64, 196, 0, 37, 0, 38]] | 3 | 348 | 2 |
// Aizu Vol-1 0166: Area of Polygon
// 2017.8.8
#include <math.h>
#include <stdio.h>
#define M 0.00872664625997164788461845384244
#define EPS 1e-8
int main() {
int i, n, v;
double s[2];
int a[2];
while (1) {
i = 2;
while (i-- > 0) {
s[i] = a[i] = 0;
scanf("%d", &n);
if (n == 0)
... | // Aizu Vol-1 0166: Area of Polygon
// 2017.8.8
#include <math.h>
#include <stdio.h>
#define M 0.00872664625997164788461845384244
#define EPS 1e-8
int main() {
int i, n, v;
double s[2];
int a[2];
while (1) {
i = 2;
while (i-- > 0) {
s[i] = a[i] = 0;
scanf("%d", &n);
if (n == 0)
... | [["-", 64, 1, 0, 2, 3, 4, 0, 103, 0, 125], ["+", 64, 1, 0, 2, 3, 4, 0, 103, 0, 125], ["-", 0, 1, 0, 2, 3, 4, 0, 103, 0, 125], ["+", 0, 1, 0, 2, 3, 4, 0, 103, 0, 125]] | 0 | 222 | 4 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int n, i;
double ang, deg, a[2];
int main() {
while (1) {
for (i = 0; i < 2; i++) {
scanf("%d", &n);
if (n == 0)
break;
a[i] = 0;
for (ang = 360; n > 1; n--) {
scanf("%lf", °);
ang -= deg;
deg = d... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int n, i;
double ang, deg, a[2];
int main() {
while (1) {
for (i = 0; i < 2; i++) {
scanf("%d", &n);
if (n == 0)
break;
a[i] = 0;
for (ang = 360; n > 1; n--) {
scanf("%lf", °);
ang -= deg;
deg = d... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 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, 6]] | 0 | 217 | 6 |
#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... | [["-", 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, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 232 | 6 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = 1e-9;
int main() {
int m;
while (cin >> m, m) {
vector<int> v0, v1;
int n;
int sum = 0;
for (int i = 0; i < m - 1; i++) {
int tmp;
cin >> tmp;
v0.push_back(tmp);
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = 1e-9;
int main() {
int m;
while (cin >> m, m) {
vector<int> v0, v1;
int n;
int sum = 0;
for (int i = 0; i < m - 1; i++) {
int tmp;
cin >> tmp;
v0.push_back(tmp);
... | [["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 265 | 4 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const int EPS = 1e-8;
int main() {
while (true) {
int N[2], V, V_;
double S[2] = {};
for (int i = 0; i < 2; i+... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const double EPS = 1e-6;
int main() {
while (true) {
int N[2], V, V_;
double S[2] = {};
for (int i = 0; i < 2;... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 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, 57, 75, 76, 0, 95]] | 1 | 208 | 5 |
#include <cmath>
#include <iostream>
using namespace std;
#define PI 3.1415926535
#define EPS 0.00000000001
int main() {
int n, a;
int a1, a2;
double h1, h2;
while (cin >> n, n) {
a1 = a2 = 0;
h1 = h2 = 0;
while (--n) {
cin >> a;
a1 += a;
h1 += sin(a * PI / 360.0);
}
cin... | #include <cmath>
#include <iostream>
using namespace std;
#define PI 3.1415926535
#define EPS 0.00000000001
int main() {
int n, a;
int a1, a2;
double h1, h2;
while (cin >> n, n) {
a1 = a2 = 0;
h1 = h2 = 0;
while (--n) {
cin >> a;
a1 += a;
h1 += sin(a * PI / 180.0);
}
cin ... | [["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 193 | 8 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13]] | 1 | 351 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define gsort(st, en) sort((st), (en), greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " ... | #include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define gsort(st, en) sort((st), (en), greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " ... | [["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 72], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 736 | 4 |
[*$<][0..-2].map{|s|
c=0;s=0;
s.split.map(&:to_i).map{|a|c+=1 if a==1;s+=[a,10].min if a>1;};
p [*0..c].map{|i|a=s+i+(c-i)*11;a=0 if a>21;a}.max
}
| [*$<][0..-2].map{|s|
c=0;t=0;
s.split.map(&:to_i).map{|a|c+=1 if a==1;t+=[a,10].min if a>1;};
p [*0..c].map{|i|a=t+i+(c-i)*11;a=0 if a>21;a}.max
}
| [["-", 0, 652, 196, 196, 8, 734, 0, 662, 31, 22], ["+", 0, 652, 196, 196, 8, 734, 0, 662, 31, 22], ["-", 196, 196, 8, 734, 0, 751, 8, 755, 31, 22], ["+", 196, 196, 8, 734, 0, 751, 8, 755, 31, 22], ["-", 8, 734, 0, 662, 12, 738, 31, 738, 31, 22], ["+", 8, 734, 0, 662, 12, 738, 31, 738, 31, 22]] | 4 | 103 | 6 |
from collections import Counter
def point(lst):
counter = Counter(lst)
acc = 0
for i in range(2, 10):
acc += i * counter[i]
for i in range(11, 14):
acc += 10 * counter[i]
one_num = counter[1]
for i in range(one_num + 1):
if i + (one_num - i) * 11 + acc <= 21:
acc += i + (one_num - i) * 11... | from collections import Counter
def point(lst):
counter = Counter(lst)
acc = 0
for i in range(2, 10):
acc += i * counter[i]
for i in range(10, 14):
acc += 10 * counter[i]
one_num = counter[1]
for i in range(one_num + 1):
if i + (one_num - i) * 11 + acc <= 21:
acc += i + (one_num - i) * 11... | [["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612]] | 5 | 152 | 2 |
while True:
L = list(map(int,input().split()))
if L == [0]:
break
a = L.count(0)
s = sum([min(10,x) for x in L])
for _ in range(a):
if s <= 11:
s += 10
print(s if s <= 21 else 0) | while True:
L = list(map(int,input().split()))
if L == [0]:
break
a = L.count(1)
s = sum([min(10,x) for x in L])
for _ in range(a):
if s <= 11:
s += 10
print(s if s <= 21 else 0) | [["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 612], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 612]] | 5 | 79 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
struct Food {
string f;
int w, s;
bool o... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
struct Food {
string f;
int w, s;
bool o... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 263 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
const int MAX = 10000100;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define all(a) (a).begin... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
const int MAX = 10000100;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define all(a) (a).begin... | [["-", 0, 57, 64, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 57, 64, 9, 0, 7, 8, 9, 0, 46]] | 1 | 476 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string f[11];
int n, s[11], w[11], p[11], q[11];
bool ok() {
for (int i = 0; i < n - 1; i++) {
int r = 0;
for (int j = i + 1; j < n; j++)
r += w[p[j]];
if (r > s[p[i]])
return false;
}
return true;
}
int main()... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string f[11];
int n, s[11], w[11], p[11], q[11];
bool ok() {
for (int i = 0; i < n - 1; i++) {
int r = 0;
for (int j = i + 1; j < n; j++)
r += w[p[j]];
if (r > s[p[i]])
return false;
}
return true;
}
int main()... | [["-", 8, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["+", 8, 1, 0, 16, 31, 16, 12, 69, 28, 22]] | 1 | 357 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
struct food {
string name;
int weight;
int ue;
int id;
};
struct com {
inline bool operato... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
struct food {
string name;
int weight;
int ue;
int id;
};
struct com {
inline bool operato... | [["-", 64, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 64, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18]] | 1 | 432 | 4 |
#include <iostream>
#include <string>
using namespace std;
string f[11];
int ans[11];
int n;
int w[11], s[11];
void solve() {
for (int i = 1; i <= n; i++)
ans[i] = i;
for (int k = 1; k <= n; k++) {
for (int i = n; i > k; i--) {
if (s[ans[i]] > s[ans[i - 1]]) {
int tmp = ans[i];
ans[i... | #include <iostream>
#include <string>
using namespace std;
string f[11];
int ans[11];
int n;
int w[11], s[11];
void solve() {
for (int i = 1; i <= n; i++)
ans[i] = i;
for (int k = 1; k <= n; k++) {
for (int i = n; i > k; i--) {
if (s[ans[i]] > s[ans[i - 1]]) {
int tmp = ans[i];
ans[i... | [["+", 0, 57, 15, 339, 51, 16, 12, 91, 17, 111]] | 1 | 384 | 1 |
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static String[] list =
new String[] {"012345", "024135", "031425", "043215", "103254", "120534",
"135024", "152304", "201453", "215043", "240513", "254103",
"304152", "310... | import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static String[] list =
new String[] {"012345", "024135", "031425", "043215", "103254", "120534",
"135024", "152304", "201453", "215043", "240513", "254103",
"304152", "310... | [["+", 8, 196, 0, 57, 64, 196, 0, 57, 0, 121], ["+", 0, 57, 64, 196, 0, 57, 15, 15, 0, 24], ["+", 0, 57, 64, 196, 0, 57, 15, 15, 0, 25], ["+", 0, 57, 64, 196, 0, 57, 64, 37, 0, 38], ["+", 0, 57, 64, 196, 0, 57, 64, 37, 0, 146]] | 3 | 1,364 | 5 |
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
final int INF = 1 << 28;
void run() {
Scanner sc = new Scanner(System.in);
while (true) {
Dice[][] ds = new Dice[8][24];
String str = sc.next();
if (str.equals("0"))
... | import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
final int INF = 1 << 28;
void run() {
Scanner sc = new Scanner(System.in);
while (true) {
Dice[][] ds = new Dice[8][24];
String str = sc.next();
if (str.equals("0"))
... | [["-", 0, 7, 8, 196, 0, 7, 15, 16, 12, 499], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 12, 499]] | 3 | 2,281 | 2 |
// AOJ 0171: Dice Puzzle
// 2017.8.17 bal4u@uu
// 2017.12.29
// ?????????????????¢??¨??????????????????????????°
#include <stdio.h>
int rot[24][7] = {
{0, 1, 2, 3, 4, 5, 6}, {0, 1, 3, 5, 2, 4, 6}, {0, 1, 4, 2, 5, 3, 6},
{0, 1, 5, 4, 3, 2, 6}, {0, 2, 6, 3, 4, 1, 5}, {0, 2, 3, 1, 6, 4, 5},
{0, 2, 1, 4, 3, 6... | // AOJ 0171: Dice Puzzle
// 2017.8.17 bal4u@uu
// 2017.12.29
// ?????????????????¢??¨??????????????????????????°
#include <stdio.h>
int rot[24][7] = {
{0, 1, 2, 3, 4, 5, 6}, {0, 1, 3, 5, 2, 4, 6}, {0, 1, 4, 2, 5, 3, 6},
{0, 1, 5, 4, 3, 2, 6}, {0, 2, 6, 3, 4, 1, 5}, {0, 2, 3, 1, 6, 4, 5},
{0, 2, 1, 4, 3, 6... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 0 | 1,255 | 2 |
TOP, FRONT, RIGHT, LEFT, BACK, BOTTOM = *0...6
Direction = [
[0, 1, 2, 3, 4, 5],
[0, 2, 4, 1, 3, 5],
[0, 4, 3, 2, 1, 5],
[0, 3, 1, 4, 2, 5],
[1, 5, 2, 3, 0, 4],
[1, 3, 5, 0, 2, 4],
[2, 5, 4, 1, 0, 3],
[3, 4, 5, 0, 1, 2],
[4, 0, 2, 3, 5, 1],
[4, 2, 5, 0, 3, 1],
[4, 5, 3, 2, 0, 1],
[4, 3, 0, 5, 2... | TOP, FRONT, RIGHT, LEFT, BACK, BOTTOM = *0...6
Direction = [
[0, 1, 2, 3, 4, 5],
[0, 2, 4, 1, 3, 5],
[0, 4, 3, 2, 1, 5],
[0, 3, 1, 4, 2, 5],
[1, 5, 2, 3, 0, 4],
[1, 3, 5, 0, 2, 4],
[2, 5, 4, 1, 0, 3],
[3, 4, 5, 0, 1, 2],
[4, 0, 2, 3, 5, 1],
[4, 2, 5, 0, 3, 1],
[4, 5, 3, 2, 0, 1],
[4, 3, 0, 5, 2... | [["-", 0, 735, 8, 736, 0, 652, 486, 742, 0, 70], ["-", 8, 736, 0, 652, 486, 742, 0, 475, 756, 612], ["-", 8, 736, 0, 652, 486, 742, 0, 475, 17, 389], ["-", 8, 736, 0, 652, 486, 742, 0, 475, 444, 612], ["-", 0, 735, 8, 736, 0, 652, 486, 742, 0, 73]] | 4 | 736 | 5 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <vector>
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
struct Pox {
int cost;
int p;
int bit;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <vector>
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
struct Pox {
int cost;
int p;
int bit;
... | [["-", 64, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 64, 9, 0, 1, 0, 2, 63, 118, 119, 120]] | 1 | 1,085 | 4 |
<?php
for ($i = 0; $i < 9; $i++) {
list($name, $morning, $afternoon) = explode(' ', trim(fgets(STDIN)));
$sold = 200 * $morning + 300 * $afternoon;
$total = $morning + $afternoon;
echo "$name, $total $sold\n";
} | <?php
for ($i = 0; $i < 9; $i++) {
list($name, $morning, $afternoon) = explode(' ', trim(fgets(STDIN)));
$sold = 200 * $morning + 300 * $afternoon;
$total = $morning + $afternoon;
echo "$name $total $sold\n";
} | [["-", 0, 7, 0, 9, 0, 608, 0, 609, 0, 610], ["+", 0, 7, 0, 9, 0, 608, 0, 609, 0, 610]] | 6 | 81 | 2 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String str;
int am, pm;
for (int i = 0; i < 9; i++) {
str = scan.next();
am = scan.nextInt();
pm = scan.nextInt();
System.out.println(str + " " + am + pm + ... | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String str;
int am, pm;
for (int i = 0; i < 9; i++) {
str = scan.next();
am = scan.nextInt();
pm = scan.nextInt();
System.out.println(str + " " + (am + pm) ... | [["+", 0, 16, 31, 16, 31, 16, 12, 23, 0, 24], ["+", 0, 16, 31, 16, 31, 16, 12, 23, 0, 25], ["+", 0, 492, 3, 4, 0, 16, 12, 23, 0, 24], ["+", 0, 492, 3, 4, 0, 16, 12, 23, 0, 25]] | 3 | 111 | 4 |
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (scanner.hasNext()) {
String c = scanner.nextLine();
int am = scanner.nextInt();
int pm = scanner.nextInt();
System.out.printf("%s %d %d\n", c, am + pm, (am * 2 + ... | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (scanner.hasNext()) {
String c = scanner.next();
int am = scanner.nextInt();
int pm = scanner.nextInt();
System.out.printf("%s %d %d\n", c, am + pm, (am * 2 + pm *... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 101 | 2 |
import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
for (int i = 0; i < 9; i++) {
String name = scan.next();
int mor, aft;
mor = scan.nextInt();
aft = scan.nextInt();
System.out.println(name + " " + mor + aft + " ... | import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
for (int i = 0; i < 9; i++) {
String name = scan.next();
int mor, aft;
mor = scan.nextInt();
aft = scan.nextInt();
System.out.println(name + " " + (mor + aft) + ... | [["+", 0, 16, 31, 16, 31, 16, 12, 23, 0, 24], ["+", 0, 16, 31, 16, 31, 16, 12, 23, 0, 25], ["+", 0, 492, 3, 4, 0, 16, 12, 23, 0, 24], ["+", 0, 492, 3, 4, 0, 16, 12, 23, 0, 25]] | 3 | 109 | 4 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
#define rep(i, n) fo... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
#define rep(i, n) fo... | [["+", 31, 16, 12, 23, 0, 41, 15, 16, 17, 79], ["+", 31, 16, 12, 23, 0, 41, 15, 16, 12, 13]] | 1 | 456 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (... | [["-", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 528 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
class S {
public:
string s;
int n;
S(string s, int n) : s(s... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
class S {
public:
string s;
int n;
S(string s, int n) : s(s... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 496 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int n, m;
vector<P> branch[128];
int prim();
int main() {
while (scanf("%d %d", &n, &m), n != 0) {
for (int i = 0; i < n; i++)
branch[i].clear();
for (int i = 0; i < m; i++) {
int a, b, c;
scanf("%d %d %d", &a, &b, ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int n, m;
vector<P> branch[128];
int prim();
int main() {
while (scanf("%d %d", &n, &m), n != 0) {
for (int i = 0; i < n; i++)
branch[i].clear();
for (int i = 0; i < m; i++) {
int a, b, c;
scanf("%d %d %d", &a, &b, ... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 147], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 1 | 315 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
typedef long long int ll;
#define FOR(i, a, n) for (int i = a; i < n; ++i)
#define TFOR(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end();
const int INF = 1LL << 30;
const ll LLINF = 1LL << 60;
int V; //???... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
typedef long long int ll;
#define FOR(i, a, n) for (int i = a; i < n; ++i)
#define TFOR(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end();
const int INF = 1LL << 30;
const ll LLINF = 1LL << 60;
int V; //???... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 83, 0, 45], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 497 | 5 |
#include <iostream>
#define TOSHI_MAX 100
#define COST_MAX 10
using namespace std;
int prim(int data[TOSHI_MAX][TOSHI_MAX], int toshiNum) {
bool visited[toshiNum];
int cost[toshiNum];
for (int i = 0; i < toshiNum; i++) {
visited[i] = false;
cost[i] = COST_MAX;
}
cost[0] = 0;
while (1) {
int min... | #include <iostream>
#define TOSHI_MAX 100
#define COST_MAX 100000
using namespace std;
int prim(int data[TOSHI_MAX][TOSHI_MAX], int toshiNum) {
bool visited[toshiNum];
int cost[toshiNum];
for (int i = 0; i < toshiNum; i++) {
visited[i] = false;
cost[i] = COST_MAX;
}
cost[0] = 0;
while (1) {
int... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 392 | 2 |
#include <cstdlib>
#include <iostream>
using namespace std;
struct Bridge {
int a, b, cost;
};
int n, m, ans, parent[10001];
Bridge bridge[10001];
int bridge_comp(const void *a, const void *b) {
return ((Bridge *)a)->cost - ((Bridge *)b)->cost;
}
int root(int a) {
if (parent[a] == a)
return a;
else
... | #include <cstdlib>
#include <iostream>
using namespace std;
struct Bridge {
int a, b, cost;
};
int n, m, ans, parent[10001];
Bridge bridge[10001];
int bridge_comp(const void *a, const void *b) {
return ((Bridge *)a)->cost - ((Bridge *)b)->cost;
}
int root(int a) {
if (parent[a] == a)
return a;
else
... | [["+", 0, 11, 31, 69, 341, 342, 0, 2, 63, 22], ["+", 31, 69, 341, 342, 0, 2, 3, 4, 0, 24], ["+", 31, 69, 341, 342, 0, 2, 3, 4, 0, 25]] | 1 | 283 | 3 |
// kruskal tree
#include <algorithm>
#include <iostream>
using namespace std;
#define M 101
int parent[M], a[M], b[M];
pair<int, int> node[M];
int root(int a) {
if (parent[a] == a)
return a;
return parent[a] = root(parent[a]);
}
int unite(int a, int b) {
if (root(a) != root(b))
return 0;
parent[root(a)]... | // kruskal tree
#include <algorithm>
#include <iostream>
using namespace std;
#define M 9999
int parent[M], a[M], b[M];
pair<int, int> node[M];
int root(int a) {
if (parent[a] == a)
return a;
return parent[a] = root(parent[a]);
}
int unite(int a, int b) {
if (root(a) == root(b))
return 0;
parent[root(a)... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 268 | 4 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
const int MAXN = 105;
using namespace std;
struct UnionFind {
vector<int> data;
Un... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
const int MAXN = 105;
using namespace std;
struct UnionFind {
vector<int> data;
Un... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 485 | 6 |
#include <stdio.h>
int main(void) {
int prime[1000001], i, j, n;
for (i = 0; i < 1000001; i++)
prime[i] = 0;
prime[0] = prime[1] = 1;
for (i = 2; i * i < 1000001; i++) {
if (prime[i] == 0) {
for (j = 2 * i; j < 1000001; j += i) {
prime[j] = 1;
}
}
}
while (scanf("%d", &n... | #include <stdio.h>
int main(void) {
int prime[1000001], i, j, n;
for (i = 0; i < 1000001; i++)
prime[i] = 0;
prime[0] = prime[1] = 1;
for (i = 2; i * i < 1000001; i++) {
if (prime[i] == 0) {
for (j = 2 * i; j < 1000001; j += i) {
prime[j] = 1;
}
}
}
while (scanf("%d", &n... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 176 | 2 |
#include <iostream>
using namespace std;
bool isp[1 << 20];
main() {
for (int i = 2; i < 1 << 20; i++)
isp[i] = 1;
for (int i = 2; i < 1 << 20; i++) {
if (!isp[i])
continue;
for (int j = i + i; j < 1 << 20; j += i)
isp[j] = 0;
}
int n;
while (cin >> n, n) {
int cnt = 0;
for (in... | #include <iostream>
using namespace std;
bool isp[1 << 20];
main() {
for (int i = 2; i < 1 << 20; i++)
isp[i] = 1;
for (int i = 2; i < 1 << 20; i++) {
if (!isp[i])
continue;
for (int j = i + i; j < 1 << 20; j += i)
isp[j] = 0;
}
int n;
while (cin >> n, n) {
int cnt = 0;
for (in... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 17, 48]] | 1 | 152 | 2 |
#include <iostream>
#include <vector>
using namespace std;
const int NMAX = 1000000;
int main() {
bool p[NMAX + 1];
vector<int> pv;
for (int i = 2; i < NMAX; i++) {
p[i] = true;
}
for (int i = 2; i * i <= NMAX; i++) {
if (!p[i])
continue;
for (int j = i + i; j <= NMAX; j += i) {
p[j]... | #include <iostream>
#include <vector>
using namespace std;
const int NMAX = 1000000;
int main() {
bool p[NMAX + 1];
vector<int> pv;
for (int i = 2; i <= NMAX; i++) {
p[i] = true;
}
for (int i = 2; i * i <= NMAX; i++) {
if (!p[i])
continue;
for (int j = i + i; j <= NMAX; j += i) {
p[j... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 227 | 4 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define MAX 1000000
#define sqrtMAX sqrt(MAX)
int main(void) {
int n;
vector<int> b(MAX + 1);
int i, j;
int count;
// ツエツδ可トツスツテツネツスツづ個づ督づゥツつ「
b[0] = 1;
b[1] = 1;
for (i = 4; i <= MAX; i += 2)
b[i] = 1;
for (i = 3; i <... |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define MAX 1000000
#define sqrtMAX sqrt(MAX)
int main(void) {
int n;
vector<int> b(MAX + 1);
int i, j;
int count;
// ツエツδ可トツスツテツネツスツづ個づ督づゥツつ「
b[0] = 1;
b[1] = 1;
for (i = 4; i <= MAX; i += 2)
b[i] = 1;
for (i = 3; i <... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 193 | 2 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void makePri... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void makePri... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 254 | 4 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
bool isPrim... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
bool isPrim... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 219 | 2 |
#define _USE_MATH_DEFINES
#define INF 10000000
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
typedef long long l... | #define _USE_MATH_DEFINES
#define INF 10000000
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
typedef long long l... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 147], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 235 | 6 |
#include <iostream>
using namespace std;
#define MAX 50100
int prime[MAX - 4];
void is_prime() {
for (int i = 0; i < MAX; i++)
prime[i] = 0;
prime[0] = prime[1] = 1;
for (int i = 4; i < MAX; i += 2)
prime[i] = 1;
for (int i = 3; i * i < MAX; i++) {
if (prime[i])
continue;
for (int j = i... | #include <iostream>
using namespace std;
#define MAX 1000100
int prime[MAX - 4];
void is_prime() {
for (int i = 0; i < MAX; i++)
prime[i] = 0;
prime[0] = prime[1] = 1;
for (int i = 4; i < MAX; i += 2)
prime[i] = 1;
for (int i = 3; i * i < MAX; i++) {
if (prime[i])
continue;
for (int j =... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 210 | 2 |
require'prime'
a=[]
Prime.each(1e6){|i|a[i]=1}
p (2..(n=$_.to_i)/2+1).count{|i|a[i]&&a[n-i]}while gets>?1 | require'prime'
a=[]
Prime.each(1e6){|i|a[i]=1}
p (2..(n=$_.to_i)/2).count{|i|a[i]&&a[n-i]}while gets>?1 | [["-", 0, 652, 486, 739, 0, 475, 444, 738, 17, 72], ["-", 0, 652, 486, 739, 0, 475, 444, 738, 12, 612]] | 4 | 63 | 2 |
#include <stdio.h>
int main(void) {
int q1, b, c1, c2, q2;
int aizu_c, normal_c = 0, leaveMoney;
while (1) {
scanf("%d", &q1);
if (q1 == 0)
break;
scanf("%d %d %d %d", &b, &c1, &c2, &q2);
aizu_c = 0;
normal_c = 0;
leaveMoney = b;
while (b - c1 >= 0 && aizu_c < q2) {
leaveMo... | #include <stdio.h>
int main(void) {
int q1, b, c1, c2, q2;
int aizu_c, normal_c, leaveMoney;
while (1) {
scanf("%d", &q1);
if (q1 == 0)
break;
scanf("%d %d %d %d", &b, &c1, &c2, &q2);
aizu_c = 0;
normal_c = 0;
leaveMoney = b;
while (leaveMoney - c1 >= 0 && aizu_c < q2) {
le... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 15, 23, 0, 16, 31, 16, 31, 16, 31, 22], ["+", 15, 23, 0, 16, 31, 16, 31, 16, 31, 22]] | 0 | 206 | 4 |
#include <stdio.h>
void getWeightOfAizuAndNormalChicken(int minWeight, int money, int aizuPrime,
int normalPrime, int maxAizuWeight,
int *weightOfAizu, int *weightOfNormal);
int main(void) {
char string[64];
int min; //最低限これ以上は... | #include <stdio.h>
void getWeightOfAizuAndNormalChicken(int minWeight, int money, int aizuPrime,
int normalPrime, int maxAizuWeight,
int *weightOfAizu, int *weightOfNormal);
int main(void) {
char string[64];
int min; //最低限これ以上は... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22]] | 0 | 390 | 2 |
#include <iostream>
using namespace std;
main() {
int max, min, mid;
int q1, q2, b, c1, c2;
int aizumoney, sosomoney, sosonum;
while (1) {
cin >> q1;
if (q1 == 0)
break;
cin >> b >> c1 >> c2 >> q2;
//会津地鶏二分探索
min = 0;
max = q2;
while (min <= max) {
mid = (max + min) / 2;
... | #include <iostream>
using namespace std;
main() {
int max, min, mid;
int q1, q2, b, c1, c2;
int aizumoney, sosomoney, sosonum;
while (1) {
cin >> q1;
if (q1 == 0)
break;
cin >> b >> c1 >> c2 >> q2;
//会津地鶏二分探索
min = 0;
max = q2;
while (min <= max) {
mid = (max + min) / 2;
... | [["+", 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, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 225 | 4 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF INT_MAX / 3
#define ALL(a) (a).begin(), (a).end()
#... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF INT_MAX / 3
#define ALL(a) (a).begin(), (a).end()
#... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 258 | 4 |
#include <bits/stdc++.h>
using namespace std;
int q, b, c1, c2, limit;
int check(int M) {
int B = b, cnt = M;
B -= c1 * M;
if (B < 0)
return 0;
cnt += (B / c2);
return (cnt >= q);
}
int main() {
while (cin >> q, q) {
;
cin >> b >> c1 >> c2 >> limit;
int L = 0, M, R = limit + 1;
while ... | #include <bits/stdc++.h>
using namespace std;
int q, b, c1, c2, limit;
int check(int M) {
int B = b, cnt = M;
B -= c1 * M;
if (B < 0)
return 0;
cnt += (B / c2);
return (cnt >= q);
}
int main() {
while (cin >> q, q) {
;
cin >> b >> c1 >> c2 >> limit;
int L = 0, M, R = limit + 1;
while ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 189 | 4 |
#include <algorithm>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int cnt[7];
int main() {
long les, m, a, c, w;
while (cin >> les, les) {
cin >> m >> a >> c >> w;
int ch = ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int cnt[7];
int main() {
long les, m, a, c, w;
while (cin >> les, les) {
cin >> m >> a >> c >> w;
int ch = ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 199 | 2 |
#include <stdio.h>
int main() {
int a, b, c, d, e;
while (scanf("%d", &a), a) {
scanf("%d%d%d%d", &b, &c, &d, &e);
bool ok = false;
int bestA = 0;
int bestB = 0;
for (int i = 0; i <= e; i++) {
int f = b - c * i;
int g = f / d;
if (f >= 0 && i + g >= a) {
bestA = i;
... | #include <stdio.h>
int main() {
int a, b, c, d, e;
while (scanf("%d", &a), a) {
scanf("%d%d%d%d", &b, &c, &d, &e);
bool ok = false;
int bestA = 0;
int bestB = 0;
for (int i = 1; i <= e; i++) {
int f = b - c * i;
int g = f / d;
if (f >= 0 && i + g >= a) {
bestA = i;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 153 | 2 |
# Aizu Problem 0186: Aizu Chicken
#
import sys, math, os, bisect
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
def aizu_chicken(q1, b, c1, c2, q2):
for i in range(q2, 0, -1):
cj = i * c1
normal = int((b - cj) / c2)
if i + no... | # Aizu Problem 0186: Aizu Chicken
#
import sys, math, os, bisect
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
def aizu_chicken(q1, b, c1, c2, q2):
for i in range(q2, 0, -1):
cj = i * c1
normal = int((b - cj) // c2)
if i + n... | [["-", 0, 662, 12, 652, 3, 4, 0, 657, 17, 85], ["+", 0, 662, 12, 652, 3, 4, 0, 657, 17, 676]] | 5 | 172 | 2 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int i, j, k, xa, ya, xb, yb;
double sp[3][2], vec[3][2], pot[3][2], area;
int crosspoint(int i, int j) {
double px = sp[i][0], py = sp[i][1];
double ax = vec[i][0], ay = vec[i][1];
double qx = sp[j][0], qy = sp[j][1];
double bx = vec[j][0], by = vec[j]... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int i, j, k, xa, ya, xb, yb;
double sp[3][2], vec[3][2], pot[3][2], area;
int crosspoint(int i, int j) {
double px = sp[i][0], py = sp[i][1];
double ax = vec[i][0], ay = vec[i][1];
double qx = sp[j][0], qy = sp[j][1];
double bx = vec[j][0], by = vec[j]... | [["-", 49, 50, 51, 16, 12, 69, 28, 69, 71, 13], ["+", 49, 50, 51, 16, 12, 69, 28, 69, 71, 13], ["-", 0, 43, 49, 50, 51, 16, 12, 69, 71, 13], ["+", 0, 43, 49, 50, 51, 16, 12, 69, 71, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 638 | 10 |
/*include*/
#include <algorithm>
#include <cmath>
#include <complex>
#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 rp(a) while (a--)
#define pb push_back... | /*include*/
#include <algorithm>
#include <cmath>
#include <complex>
#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 rp(a) while (a--)
#define pb push_back... | [["-", 51, 34, 12, 16, 31, 16, 31, 16, 17, 72], ["+", 51, 34, 12, 16, 31, 16, 31, 16, 17, 106], ["-", 15, 339, 51, 34, 12, 16, 31, 16, 17, 72], ["+", 15, 339, 51, 34, 12, 16, 31, 16, 17, 106], ["-", 0, 52, 15, 339, 51, 34, 12, 16, 17, 72], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 106]] | 1 | 3,063 | 6 |
#include <algorithm>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
typedef complex<double> P;
typedef pair<P, P> L;
const double EPS = 1e-10;
double dot(P a, P b) { return real(conj(a) * b); }
double cross(P a, P b) { return imag(conj(a) * b); }
int ccw(P a, P b, P c) {
c -= a;
b ... | #include <algorithm>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
typedef complex<double> P;
typedef pair<P, P> L;
const double EPS = 1e-8;
double dot(P a, P b) { return real(conj(a) * b); }
double cross(P a, P b) { return imag(conj(a) * b); }
int ccw(P a, P b, P c) {
c -= a;
b -... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 31, 16, 31, 2, 3, 4, 0, 118, 28, 22], ["+", 31, 16, 31, 2, 3, 4, 0, 118, 28, 22]] | 1 | 804 | 4 |
#include <iostream>
using namespace std;
int main() {
char field[3][3];
while (true) {
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> field[i][j];
if (field[i][j] == '0')
return 0;
}
}
bool flag = false;
for (int i = 0; i < 3; i++) {
i... | #include <iostream>
using namespace std;
int main() {
char field[3][3];
while (true) {
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> field[i][j];
if (field[i][j] == '0')
return 0;
}
}
bool flag = false;
for (int i = 0; i < 3; i++) {
i... | [["-", 12, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 12, 16, 31, 69, 28, 69, 341, 342, 0, 13], ["-", 51, 16, 12, 16, 31, 69, 341, 342, 0, 13], ["+", 51, 16, 12, 16, 31, 69, 341, 342, 0, 22]] | 1 | 356 | 4 |
#include <iostream>
using namespace std;
char field[3][4];
char solve() {
for (int i = 0; i < 3; i++) {
if (field[i][0] == field[i][1] && field[i][1] == field[i][2] &&
(field[i][0] == 'w' || field[i][0] == 'b'))
return field[i][0];
}
for (int k = 0; k < 3; k++) {
if (field[0][k] == field[1... | #include <iostream>
using namespace std;
char field[3][4];
char solve() {
for (int i = 0; i < 3; i++) {
if (field[i][0] == field[i][1] && field[i][1] == field[i][2] &&
(field[i][0] == 'w' || field[i][0] == 'b'))
return field[i][0];
}
for (int k = 0; k < 3; k++) {
if (field[0][k] == field[1... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 415 | 2 |
#include <iostream>
int main() {
std::string m[3];
while (std::cin >> m[0], m[0][0] != '0') {
for (int i = 1; i < 3; i++)
std::cin >> m[i];
std::string w = "NA";
for (int i = 0; i < 3; i++) {
if (!(m[i][0] + m[i][1] - m[i][2] * 2))
if (m[i][0] != '+')
w = m[i][0];
if ... | #include <iostream>
int main() {
std::string m[3];
while (std::cin >> m[0], m[0][0] != '0') {
for (int i = 1; i < 3; i++)
std::cin >> m[i];
std::string w = "NA";
for (int i = 0; i < 3; i++) {
if (!(m[i][0] + m[i][1] - m[i][2] * 2))
if (m[i][0] != '+')
w = m[i][0];
if ... | [["+", 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], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 0, 24]] | 1 | 313 | 6 |
#include <iostream>
#include <string>
using namespace std;
int main() {
for (string s1, s2, s3; cin >> s1, s1 != "0";) {
cin >> s2 >> s3;
string s = s1 + s2 + s3;
string bit[] = {"111000000", "000111000", "000000111", "100100100",
"010010010", "001001001", "100010001", "001010100"};
... | #include <iostream>
#include <string>
using namespace std;
int main() {
for (string s1, s2, s3; cin >> s1, s1 != "0";) {
cin >> s2 >> s3;
string s = s1 + s2 + s3;
string bit[] = {"111000000", "000111000", "000000111", "100100100",
"010010010", "001001001", "100010001", "001010100"};
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 264 | 2 |
#include <iostream>
using namespace std;
bool win_check(char c, char d, char e) {
if (c == 'b' && d == 'b' && e == 'b') {
cout << 'b' << endl;
return true;
} else if (c == 'w' && d == 'w' && e == 'w') {
cout << 'w' << endl;
return true;
}
return false;
}
int main() {
while (true) {
char ... | #include <iostream>
using namespace std;
bool win_check(char c, char d, char e) {
if (c == 'b' && d == 'b' && e == 'b') {
cout << 'b' << endl;
return true;
} else if (c == 'w' && d == 'w' && e == 'w') {
cout << 'w' << endl;
return true;
}
return false;
}
int main() {
while (true) {
char ... | [["-", 12, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 13]] | 1 | 367 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
char grid[3][3];
while (1) {
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> grid[i][j];
if (grid[i][j] == '0')
return 0;
}
}
for (int i = 0; i < 3; i+... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
char grid[3][3];
while (1) {
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> grid[i][j];
if (grid[i][j] == '0')
return 0;
}
}
for (int i = 0; i < 3; i+... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 561 | 2 |
#include <iostream>
#include <string>
using namespace std;
string s[9];
int dx[] = {0, 0, 1, -1, 1, 1 - 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, -1, 1};
int k;
bool solve(char c, int p, int y, int x) {
if (y < 0 || x < 0 || y == 3 || x == 3)
return false;
if (c != s[y][x] || c == '+')
return false;
if (p... | #include <iostream>
#include <string>
using namespace std;
string s[9];
int dx[] = {0, 0, 1, -1, 1, 1 - 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, -1, 1};
int k;
bool solve(char c, int p, int y, int x) {
if (y < 0 || x < 0 || y == 3 || x == 3)
return false;
if (c != s[y][x] || c == '+')
return false;
if (p... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 302 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.