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>
#define MAX 1000
int main(void) {
int value[6] = {1, 5, 10, 50, 100, 500};
int c1 = 0;
int c5 = 0;
int c10 = 0;
int c50 = 0;
int c100 = 0;
int c500 = 0;
int c1000 = 0;
int sum = 0;
// printf("1??????5??????10??????50??????100??????500???????????????????????????????????\??????... | #include <stdio.h>
#define MAX 1000
int main(void) {
int value[6] = {1, 5, 10, 50, 100, 500};
int c1 = 0;
int c5 = 0;
int c10 = 0;
int c50 = 0;
int c100 = 0;
int c500 = 0;
int c1000 = 0;
int sum = 0;
// printf("1??????5??????10??????50??????100??????500???????????????????????????????????\??????... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 182 | 3 |
#include <stdio.h>
int main() {
int c1, c5, c10, c50, c100, c500, all;
scanf("%d %d %d %d %d %d", &c1, &c5, &c10, &c50, &c100, &c500);
all = c1 + c5 * 5 + c10 * 10 + c50 * 50 + c100 * 100 + c500 * 500;
if (all >= 1000) {
printf(1);
} else {
printf(0);
}
return 0;
} | #include <stdio.h>
int main() {
int c1, c5, c10, c50, c100, c500, all;
scanf("%d %d %d %d %d %d", &c1, &c5, &c10, &c50, &c100, &c500);
all = c1 + c5 * 5 + c10 * 10 + c50 * 50 + c100 * 100 + c500 * 500;
if (all >= 1000) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 96 | 6 |
#include <stdio.h>
int main(void) {
int c1, c5, c10, c50, c100, c500, i, a, b, c, d, e, f;
i = 0;
scanf("%d %d %d %d %d %d", &c1, &c5, &c10, &c50, &c100, &c500);
a = c1 * 1;
b = c5 * 5;
c = c10 * 10;
d = c50 * 50;
e = c100 * 100;
f = c500 * 500;
i = a + b + c + d + e + f;
if (i > 1000) {
print... | #include <stdio.h>
int main(void) {
int c1, c5, c10, c50, c100, c500, i, a, b, c, d, e, f;
i = 0;
scanf("%d %d %d %d %d %d", &c1, &c5, &c10, &c50, &c100, &c500);
a = c1 * 1;
b = c5 * 5;
c = c10 * 10;
d = c50 * 50;
e = c100 * 100;
f = c500 * 500;
i = a + b + c + d + e + f;
if (i >= 1000) {
prin... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 145 | 2 |
#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);
a += b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (a > 1000)
printf("1\n");
else
printf("0\n");
} | #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);
a += b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (a >= 1000)
printf("1\n");
else
printf("0\n");
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 92 | 2 |
#include <stdio.h>
int main(void) {
int a, b, c, d, e, f, s;
scanf("%d %d %d %d %d", &a, &b, &c, &d, &e, &f);
s = a * 1 + b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (1000 <= s) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c, d, e, f, s;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &f);
s = a * 1 + b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (1000 <= s) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 105 | 2 |
#include <iostream>
int main() {
int a, b, c, d, e, f;
std::cin >> a >> b >> c >> d >> e >> f;
if (a + b * 5 + c * 10 + d * 50 + e * 100 + f * 500 > 1000)
std::cout << 1 << std::endl;
else
std::cout << 0 << std::endl;
return 0;
} | #include <iostream>
int main() {
int a, b, c, d, e, f;
std::cin >> a >> b >> c >> d >> e >> f;
if (a + b * 5 + c * 10 + d * 50 + e * 100 + f * 500 >= 1000)
std::cout << 1 << std::endl;
else
std::cout << 0 << std::endl;
return 0;
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 87 | 2 |
#include <iostream>
int main() {
int a, b, c, d, e, f, g;
std::cin >> a >> b >> c >> d >> e >> f;
g = a * 1 + b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (g < 1000) {
std::cout << 0 << std::endl;
}
if (g > 1000) {
std::cout << 1 << std::endl;
} else if (g = 1000) {
std::cout << 1 << std::... | #include <iostream>
int main() {
int a, b, c, d, e, f, g;
std::cin >> a >> b >> c >> d >> e >> f;
g = a * 1 + b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (g < 1000) {
std::cout << 0 << std::endl;
} else if (g > 1000) {
std::cout << 1 << std::endl;
} else if (g = 1000) {
std::cout << 1 << st... | [["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 120 | 1 |
#include <iostream>
int main() {
int a, b, c, d, e, f;
std::cin >> a >> b >> c >> d >> e >> f;
if (a + 5 * b + 10 * c + 50 * d + 100 * e + 500 * f > +1000) {
std::cout << 1 << std::endl;
} else {
std::cout << 0 << std::endl;
}
return 0;
} | #include <iostream>
int main() {
int a, b, c, d, e, f;
std::cin >> a >> b >> c >> d >> e >> f;
if (a + 5 * b + 10 * c + 50 * d + 100 * e + 500 * f >= 1000) {
std::cout << 1 << std::endl;
} else {
std::cout << 0 << std::endl;
}
return 0;
} | [["-", 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]] | 1 | 91 | 4 |
#include <stdio.h>
int main(void) {
int m, n;
m = 0;
scanf("%d", &n);
m += n * 1;
scanf("%d", &n);
m += n * 5;
scanf("%d", &n);
m += n * 10;
scanf("%d", &n);
m += n * 50;
scanf("%d", &n);
m += n * 100;
scanf("%d", &n);
m += n * 500;
printf("%d\n", m > 1000 ? 1 : 0);
} | #include <stdio.h>
int main(void) {
int m, n;
m = 0;
scanf("%d", &n);
m += n * 1;
scanf("%d", &n);
m += n * 5;
scanf("%d", &n);
m += n * 10;
scanf("%d", &n);
m += n * 50;
scanf("%d", &n);
m += n * 100;
scanf("%d", &n);
m += n * 500;
printf("%d\n", m >= 1000 ? 1 : 0);
} | [["-", 0, 2, 3, 4, 0, 41, 15, 16, 17, 47], ["+", 0, 2, 3, 4, 0, 41, 15, 16, 17, 20]] | 1 | 130 | 2 |
#include <stdio.h>
int main(void) {
int a, b, c, d, e, f;
int g, h, i, j, k, n;
int ans;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &f);
g = a * 1;
h = b * 5;
i = c * 10;
j = d * 50;
k = e * 100;
n = f * 500;
ans = g + h + i + j + k + n;
if (ans > 1000) {
ans = 1;
} else {
... | #include <stdio.h>
int main(void) {
int a, b, c, d, e, f;
int g, h, i, j, k, n;
int ans;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &f);
g = a * 1;
h = b * 5;
i = c * 10;
j = d * 50;
k = e * 100;
n = f * 500;
ans = g + h + i + j + k + n;
if (ans >= 1000) {
ans = 1;
} else {
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 145 | 2 |
#include <cstdio>
int main() {
int a[5];
scanf("%d %d %d %d %d %d", &a[0], &a[1], &a[2], &a[3], &a[4], &a[5]);
int sum =
a[0] * 1 + a[1] * 5 + a[2] * 10 + a[3] * 50 + a[4] * 100 + a[5] * 500;
if (sum % 1000 > 0)
printf("1\n");
else
printf("0\n");
return 0;
} | #include <cstdio>
int main() {
int a[5];
scanf("%d %d %d %d %d %d", &a[0], &a[1], &a[2], &a[3], &a[4], &a[5]);
int sum =
a[0] * 1 + a[1] * 5 + a[2] * 10 + a[3] * 50 + a[4] * 100 + a[5] * 500;
if (sum >= 1000)
printf("1\n");
else
printf("0\n");
return 0;
} | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 109], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 130 | 4 |
#include <cstdio>
using namespace std;
int main(void) {
int a, b, c, d, e, f;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &f);
int sum = 0;
sum += a + b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (sum >= 5000) {
puts("1");
} else {
puts("0");
}
} | #include <cstdio>
using namespace std;
int main(void) {
int a, b, c, d, e, f;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &f);
int sum = 0;
sum += a + b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (sum >= 1000) {
puts("1");
} else {
puts("0");
}
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 105 | 2 |
#include <iostream>
using namespace std;
int a, b, c, d, e, f, g;
int main() {
cin >> a >> b >> c >> d >> e >> f;
g = a + b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (g >= 1000) {
cout << '1' << endl;
} else {
cout << ' ' << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int a, b, c, d, e, f, g;
int main() {
cin >> a >> b >> c >> d >> e >> f;
g = a + b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (g >= 1000) {
cout << '1' << endl;
} else {
cout << '0' << endl;
}
return 0;
} | [["-", 0, 1, 0, 16, 31, 16, 12, 103, 0, 125], ["+", 0, 1, 0, 16, 31, 16, 12, 103, 0, 125]] | 1 | 95 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, c5, c10, c50, c100, c500;
cin >> c >> c5 >> c10 >> c50 >> c100 >> c500;
if (c + c5 * 5 + c10 * 10 + c50 * 50 + c100 * 100 + c500 * 500 <= 1000) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int c, c5, c10, c50, c100, c500;
cin >> c >> c5 >> c10 >> c50 >> c100 >> c500;
if (c + c5 * 5 + c10 * 10 + c50 * 50 + c100 * 100 + c500 * 500 < 1000) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 82 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, f, y;
cin >> a >> b >> c >> d >> e >> f;
y = (a * 1) + (b * 5) + (c * 10) + (d * 50) + (e * 100) + (d * 500);
if (y >= 1000) {
cout << 1 << endl;
} else
cout << 0 << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, f, y;
cin >> a >> b >> c >> d >> e >> f;
y = (a * 1) + (b * 5) + (c * 10) + (d * 50) + (e * 100) + (f * 500);
if (y >= 1000) {
cout << 1 << endl;
} else
cout << 0 << endl;
} | [["-", 0, 11, 12, 16, 12, 23, 0, 16, 31, 22], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 31, 22]] | 1 | 100 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, f, g, h, i, j, k, l;
cin >> a >> b >> c >> d >> e >> f;
g = a;
h = 5 * g;
i = 10 * c;
j = 50 * d;
k = 100 * e;
l = 500 * f;
if (1000 <= g + h + i + j + k + l)
cout << "1" << endl;
else
cout << "0" << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, f, g, h, i, j, k, l;
cin >> a >> b >> c >> d >> e >> f;
g = a;
h = 5 * b;
i = 10 * c;
j = 50 * d;
k = 100 * e;
l = 500 * f;
if (1000 <= g + h + i + j + k + l)
cout << "1" << endl;
else
cout << "0" << endl;
} | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 118 | 2 |
#include <iostream>
using namespace std;
int main() {
unsigned c, c1, c5, c10, c50, c100, c500;
cin >> c1 >> c5 >> c10 >> c50 >> c100 >> c500;
c = c1 * 1 + c5 * 5 + c10 * 10 + c50 * 50 + c100 * 100 + c500 * 500;
cout << (c > 1000) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
unsigned c, c1, c5, c10, c50, c100, c500;
cin >> c1 >> c5 >> c10 >> c50 >> c100 >> c500;
c = c1 * 1 + c5 * 5 + c10 * 10 + c50 * 50 + c100 * 100 + c500 * 500;
cout << (c >= 1000) << endl;
return 0;
} | [["-", 0, 16, 31, 16, 12, 23, 0, 16, 17, 47], ["+", 0, 16, 31, 16, 12, 23, 0, 16, 17, 20]] | 1 | 80 | 2 |
#include <iostream>
using namespace std;
int main() {
int c1, c5, c10, c50, c100, c500;
cin >> c1 >> c10 >> c50 >> c100 >> c500;
if ((((c1 * 1) + (c5 * 5) + (c10 * 10) + (c50 * 50) + (c100 * 100) +
(c500 * 500)) /
1000) >= 1) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return ... | #include <iostream>
using namespace std;
int main() {
int c1, c5, c10, c50, c100, c500;
cin >> c1 >> c5 >> c10 >> c50 >> c100 >> c500;
if ((((c1 * 1) + (c5 * 5) + (c10 * 10) + (c50 * 50) + (c100 * 100) +
(c500 * 500)) /
1000) >= 1) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
r... | [["+", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 17, 152]] | 1 | 103 | 2 |
#include <iostream>
using namespace std;
int main() {
int c1, c5, c10, c50, c100, c500;
cin >> c1 >> c5 >> c10 >> c50 >> c100 >> c500;
int g;
g = c1 + 5 * c5 + 10 * c10 + 50 * c50 + 100 * c100 + 500 * c500;
if (g > 1000)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int c1, c5, c10, c50, c100, c500;
cin >> c1 >> c5 >> c10 >> c50 >> c100 >> c500;
int g;
g = c1 + 5 * c5 + 10 * c10 + 50 * c50 + 100 * c100 + 500 * c500;
if (g >= 1000)
cout << 1 << endl;
else
cout << 0 << endl;
return 0;
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 88 | 2 |
#include <iostream>
using namespace std;
int main() {
int c[] = {1, 5, 10, 50, 100, 500};
int n = 0, m;
for (int i = 0; i < 6; i++) {
cin >> m;
n = m * c[i];
}
if (n >= 1000) {
cout << 1 << endl;
return 0;
}
cout << 0 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int c[] = {1, 5, 10, 50, 100, 500};
int n = 0, m;
for (int i = 0; i < 6; ++i) {
cin >> m;
n += m * c[i];
if (n >= 1000) {
cout << 1 << endl;
return 0;
}
}
cout << 0 << endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 93 | 6 |
#include <iostream>
using namespace std;
int main() {
int c1, c5, c10, c50, c100, c500, kanesum;
cin >> c1 >> c5 >> c10 >> c50 >> c100 >> c500;
kanesum = 1 * c1 + 5 * c5 + 10 * c10 + c50 * 50 * c100 * 100 + c500 * 500;
if (kanesum >= 1000) {
cout << 1 << endl;
} else if (kanesum < 1000) {
cout << 0 <<... | #include <iostream>
using namespace std;
int main() {
int c1, c5, c10, c50, c100, c500, kanesum;
cin >> c1 >> c5 >> c10 >> c50 >> c100 >> c500;
kanesum = 1 * c1 + 5 * c5 + 10 * c10 + c50 * 50 + c100 * 100 + c500 * 500;
if (kanesum >= 1000) {
cout << 1 << endl;
} else if (kanesum < 1000) {
cout << 0 <<... | [["-", 12, 16, 31, 16, 12, 16, 31, 16, 17, 48], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 72], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]] | 1 | 96 | 5 |
#include <stdio.h>
int main(void) {
int a, s, d, f, g, h, j;
h = 0;
scanf("%d %d %d %d %d %d", &a, &s, &d, &f, &g, &j);
h = (a * 1) + (s * 5) + (d * 10) + (f * 50) + (g * 100) + (j * 500);
if (1000 >= h) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, s, d, f, g, h, j;
h = 0;
scanf("%d %d %d %d %d %d", &a, &s, &d, &f, &g, &j);
h = (a * 1) + (s * 5) + (d * 10) + (f * 50) + (g * 100) + (j * 500);
if (1000 <= h) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 121 | 2 |
#include <stdio.h>
int main(void) {
int c1, c5, c10, c50, c100, c500, sum;
scanf("%d %d %d %d %d %d", &c1, &c5, &c10, &c50, &c100, &c500);
sum = c1 * 1 + c5 * 5 + c10 * 10 + c50 * 50 + c100 * 100 + c500 * 500;
if (1000 < sum) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int c1, c5, c10, c50, c100, c500, sum;
scanf("%d %d %d %d %d %d", &c1, &c5, &c10, &c50, &c100, &c500);
sum = c1 * 1 + c5 * 5 + c10 * 10 + c50 * 50 + c100 * 100 + c500 * 500;
if (sum >= 1000) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 105 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f, total = 0;
cin >> a >> b >> c >> d >> e >> f;
total += a * 1 + b * 5 + c * 10 + d * 50 + e * 100 + d * 500;
if (total >= 1000)
cout << 1 << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f, total = 0;
cin >> a >> b >> c >> d >> e >> f;
total += a * 1 + b * 5 + c * 10 + d * 50 + e * 100 + f * 500;
if (total >= 1000)
cout << 1 << endl;
else
cout << 0 << endl;
} | [["-", 0, 1, 0, 11, 12, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 31, 22]] | 1 | 88 | 2 |
#include <stdio.h>
int main(void) {
int c, d[6] = {1, 5, 10, 50, 100, 500}, i, ans = 0;
for (i = 0; i < 6; ++i) {
scanf("%d", &c);
ans += c * d[i];
}
if (ans >= 1000)
printf("0\n");
else
printf("1\n");
return 0;
}
| #include <stdio.h>
int main(void) {
int c, d[6] = {1, 5, 10, 50, 100, 500}, i, ans = 0;
for (i = 0; i < 6; ++i) {
scanf("%d", &c);
ans += c * d[i];
}
if (ans >= 1000)
printf("1\n");
else
printf("0\n");
return 0;
}
| [["-", 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]] | 1 | 97 | 4 |
#include <iostream>
using namespace std;
int main(void) {
int c[5];
int ans, sum;
for (int i = 0; i < 6; i++) {
cin >> c[i];
}
sum = c[0] * 1;
sum = (c[1] * 5) + sum;
sum = (c[2] * 10) + sum;
sum = (c[3] * 50) + sum;
sum = (c[4] * 100) + sum;
sum = (c[5] * 500) + sum;
if (sum > 1000)
... | #include <iostream>
using namespace std;
int main(void) {
int c[5];
int ans, sum;
for (int i = 0; i < 6; i++) {
cin >> c[i];
}
sum = c[0] * 1;
sum = (c[1] * 5) + sum;
sum = (c[2] * 10) + sum;
sum = (c[3] * 50) + sum;
sum = (c[4] * 100) + sum;
sum = (c[5] * 500) + sum;
if (sum >= 1000)
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 142 | 2 |
import java.util.*;
class Main {
public static void main(String[] args) {
Solve s = new Solve();
s.solve();
}
}
class Solve {
Solve() {}
Scanner in = new Scanner(System.in);
void solve() {
int n = in.nextInt();
for (int i = 0; i < n; i++) {
int a = in.nextInt(), b = in.nextInt();
... | import java.util.*;
class Main {
public static void main(String[] args) {
Solve s = new Solve();
s.solve();
}
}
class Solve {
Solve() {}
Scanner in = new Scanner(System.in);
void solve() {
int n = in.nextInt();
for (int i = 0; i < n; i++) {
int a = in.nextInt(), b = in.nextInt();
... | [["-", 0, 1, 0, 492, 3, 4, 0, 16, 31, 22], ["-", 0, 1, 0, 492, 3, 4, 0, 16, 17, 109], ["-", 0, 1, 0, 492, 3, 4, 0, 16, 12, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 137 | 4 |
#include <stdio.h>
int main() {
int Nx, K[1000] = {0}, P[1000] = {0}, i, j;
scanf("%d", &Nx);
for (i = 0; i < Nx; i++) {
scanf("%d %d", &K[i], &P[i]);
}
for (j = 0; j < Nx; j++) {
if (K[j] % P[j] != 0) {
printf("%d\n", K[j] % P[j]);
} else {
printf("%d\n", &P[j]);
}
}
return 0;... | #include <stdio.h>
int main() {
int Nx, K[1000] = {0}, P[1000] = {0}, i, j;
scanf("%d", &Nx);
for (i = 0; i < Nx; i++) {
scanf("%d %d", &K[i], &P[i]);
}
for (j = 0; j < Nx; j++) {
if (K[j] % P[j] != 0) {
printf("%d\n", K[j] % P[j]);
} else {
printf("%d\n", P[j]);
}
}
return 0;
... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 146 | 1 |
#include <stdio.h>
int main() {
int N, i, P, K;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d %d", &P, &K);
if (P % K == 0) {
printf("%d\n", P);
} else {
printf("%d\n", P % K);
}
}
return 0;
} | #include <stdio.h>
int main() {
int N, i, P, K;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d %d", &P, &K);
if (P % K == 0) {
printf("%d\n", K);
} else {
printf("%d\n", P % K);
}
}
return 0;
} | [["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 93 | 2 |
#include <stdio.h>
int main(void) {
int K, P, N;
scanf("%d", &N);
while (N > 1) {
scanf("%d", &K);
scanf("%d", &P);
if (K % P == 0)
printf("%d\n", P);
else
printf("%d\n", K % P);
N--;
}
return 0;
} | #include <stdio.h>
int main(void) {
int K, P, N;
scanf("%d", &N);
while (N > 0) {
scanf("%d", &K);
scanf("%d", &P);
if (K % P == 0)
printf("%d\n", P);
else
printf("%d\n", K % P);
N--;
}
return 0;
} | [["-", 8, 9, 0, 52, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 12, 13]] | 0 | 91 | 2 |
#include <stdio.h>
int main(void) {
int n, k[100], p[100], a[100], i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &k[i], &p[i]);
if (k[i] / p[i] == 0)
a[i] = p[i];
else
a[i] = k[i] % p[i];
}
for (i = 0; i < n; i++)
printf("%d\n", a[i]);
return 0;
} | #include <stdio.h>
int main(void) {
int n, k[100], p[100], a[100], i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &k[i], &p[i]);
if (k[i] % p[i] == 0)
a[i] = p[i];
else
a[i] = k[i] % p[i];
}
for (i = 0; i < n; i++)
printf("%d\n", a[i]);
return 0;
} | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 17, 85], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 109]] | 0 | 142 | 2 |
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using... | #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 1 | 175 | 4 |
#include <iostream>
using namespace std;
int main() {
int K, P, n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> K >> P;
int a;
if (K % P < P && K % P != 0) {
cout << K % P << endl;
}
if (K % P == 0) {
cout << P << endl;
}
if (K < P) {
cout << K << endl;
}
}
... | #include <iostream>
using namespace std;
int main() {
int K, P, n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> K >> P;
int a;
if (K % P < P && K % P != 0) {
cout << K % P << endl;
} else if (K % P == 0) {
cout << P << endl;
} else if (K < P) {
cout << K << endl;
}
}... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95]] | 1 | 102 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int s = 0;
vector<int> a(n);
vector<int> b(n);
while (s <= n - 1) {
cin >> a[s] >> b[s];
s++;
}
s = 0;
while (s <= n - 1) {
if (a[s] % b[s] == 0) {
cout << n << endl;
s++;
} else {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int s = 0;
vector<int> a(n);
vector<int> b(n);
while (s <= n - 1) {
cin >> a[s] >> b[s];
s++;
}
s = 0;
while (s <= n - 1) {
if (a[s] % b[s] == 0) {
cout << b[s] << endl;
s++;
} else {
... | [["-", 64, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["+", 0, 16, 31, 16, 12, 69, 341, 342, 0, 70], ["+", 0, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 16, 31, 16, 12, 69, 341, 342, 0, 73]] | 1 | 131 | 5 |
#include <iostream>
using std::cin;
using std::cout;
int main(int argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
int stone725_is_pro;
int a, b;
cin >> stone725_is_pro;
for (int i = 0; i < stone725_is_pro; ++i) {
cin >> a >> b;
cout << a % b << "\n";
}
return 0;
} | #include <iostream>
using std::cin;
using std::cout;
int main(int argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
int stone725_is_pro;
int a, b;
cin >> stone725_is_pro;
for (int i = 0; i < stone725_is_pro; ++i) {
cin >> a >> b;
cout << (a - 1) % b + 1 << "\n";
}
return 0;
} | [["+", 31, 16, 12, 16, 31, 16, 31, 23, 0, 24], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 31, 16, 12, 16, 31, 16, 31, 23, 0, 25], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 83 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, p;
for (; n--;) {
cin >> k >> p;
if (k % p)
cout << k % p << endl;
else
cout << p << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, p;
for (cin >> n; n--;) {
cin >> k >> p;
if (k % p)
cout << (k % p) << endl;
else
cout << p << endl;
}
} | [["+", 0, 14, 8, 9, 0, 7, 10, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 10, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 7, 10, 16, 12, 22], ["+", 64, 1, 0, 16, 31, 16, 12, 23, 0, 24], ["+", 64, 1, 0, 16, 31, 16, 12, 23, 0, 25]] | 1 | 55 | 5 |
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
cout << (a + 2) % b + 1 << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
cout << (a + b - 1) % b + 1 << endl;
}
return 0;
} | [["-", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13]] | 1 | 62 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int k, p;
scanf("%d%d", &k, &p);
printf("%d\n", (k % p == 0) ? (k / p) : (p));
}
return (0);
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int k, p;
scanf("%d%d", &k, &p);
printf("%d\n", (k % p == 0) ? (p) : (k % p));
}
return (0);
} | [["-", 3, 4, 0, 41, 64, 23, 0, 16, 31, 22], ["-", 3, 4, 0, 41, 64, 23, 0, 16, 17, 85], ["+", 3, 4, 0, 41, 75, 23, 0, 16, 31, 22], ["+", 3, 4, 0, 41, 75, 23, 0, 16, 17, 109]] | 1 | 92 | 4 |
#include <stdio.h>
int main(void) {
int a, b, N, p, i = 0, f;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d %d", &a, &b);
a = a % b;
if (a == 0)
a = N;
printf("%d\n", a);
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, N, p, i = 0, f;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d %d", &a, &b);
a = a % b;
if (a == 0)
a = b;
printf("%d\n", a);
}
return 0;
} | [["-", 8, 9, 0, 57, 64, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 22]] | 1 | 91 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int k, p, u = 0;
cin >> k >> p;
while (k) {
k--;
u++;
if (u == p)
u = 0;
}
cout << u + 1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int k, p, u = -1;
cin >> k >> p;
while (k) {
k--;
u++;
if (u == p)
u = 0;
}
cout << u + 1 << endl;
}
return 0;
} | [["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 83 | 2 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt"
int m... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt"
int m... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 105 | 4 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, count;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b >> c;
if (b > c && b % c != 0)
cout << b % c << endl;
else if (b > c && b % c == 0)
cout << c << endl;
else
cout << b;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, count;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b >> c;
if (b > c && b % c != 0)
cout << b % c << endl;
else if (b > c && b % c == 0)
cout << c << endl;
else
cout << b << endl;
}
return 0;
} | [["+", 0, 57, 75, 76, 0, 1, 0, 16, 17, 151], ["+", 0, 57, 75, 76, 0, 1, 0, 16, 12, 22]] | 1 | 94 | 2 |
#include <iostream>
using namespace std;
int main() {
int N, K, P, A;
for (int i = 0; i < N; i++) {
cin >> K >> P;
A = K % P;
if (K % P == 0) {
cout << P << endl;
} else {
cout << A << endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K, P, A;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> K >> P;
A = K % P;
if (K % P == 0) {
cout << P << endl;
} else {
cout << A << endl;
}
}
return 0;
} | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 77 | 4 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int k[N], p[N];
for (int a = 0; a < N; ++a) {
cin >> k[a] >> p[a];
}
for (int i = 0; i < N; ++i) {
if (k[i] % p[i] == 0) {
cout << k[i] << endl;
} else {
cout << k[i] % p[i] << endl;
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int k[N], p[N];
for (int a = 0; a < N; ++a) {
cin >> k[a] >> p[a];
}
for (int i = 0; i < N; ++i) {
if (k[i] % p[i] == 0) {
cout << p[i] << endl;
} else {
cout << k[i] % p[i] << endl;
... | [["-", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22]] | 1 | 121 | 2 |
#include <iostream>
using namespace std;
int main() {
int N = 0;
int K[10000], P[10000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> K[i];
P[i];
}
for (int i = 0; i < N; i++) {
int ans = K[i] % P[i];
if (ans == 0) {
cout << P[i] << endl;
} else {
cout << ans << endl;
... |
#include <iostream>
using namespace std;
int main() {
int N = 0;
int K[10000], P[10000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> K[i];
cin >> P[i];
}
for (int i = 0; i < N; i++) {
int ans = K[i] % P[i];
if (ans == 0) {
cout << P[i] << endl;
} else {
cout << ans << en... | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 152]] | 1 | 118 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, k, p;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> k >> p;
int a = k % p;
if (a == 0)
cout << p;
else
cout << a;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k, p;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> k >> p;
int a = k % p;
if (a == 0)
cout << p;
else
cout << a;
cout << endl;
}
return 0;
} | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 70 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
for (int i = 0; i < N; i++) {
int K, P;
cin >> K >> P;
int ans = K % P;
cout << (ans == 0 ? P : ans) << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int K, P;
cin >> K >> P;
int ans = K % P;
cout << (ans == 0 ? P : ans) << endl;
}
} | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 67 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, s, h;
int i, ans;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s >> h;
ans = s / h;
if (ans == 0)
cout << h << endl;
else
cout << ans << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, s, h;
int i, ans;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s >> h;
ans = s % h;
if (ans == 0)
cout << h << endl;
else
cout << ans << endl;
}
return 0;
} | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 85], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 109]] | 1 | 77 | 2 |
gets.to_i.times do
k, p = gets.split.map(&:to_i)
put((k - 1) % p + 1)
end | gets.to_i.times do
k, p = gets.split.map(&:to_i)
puts((k - 1) % p + 1)
end | [["-", 0, 652, 196, 737, 8, 736, 0, 652, 735, 22], ["+", 0, 652, 196, 737, 8, 736, 0, 652, 735, 22]] | 4 | 32 | 2 |
n = eval(input())
for i in range(n):
a, b = list(map(int, input().split()))
if a / b == 0: print(b)
else: print(a % b) | n = eval(input())
for i in range(n):
a, b = list(map(int, input().split()))
if a % b == 0: print(b)
else: print(a % b) | [["-", 8, 196, 0, 57, 15, 666, 0, 657, 17, 85], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 17, 109]] | 5 | 54 | 2 |
for _ in range(int(input())):
k, p= map(int, input().split())
print(p if k%p else k%p) | for _ in range(int(input())):
k, p= map(int, input().split())
print(p if k%p==0 else k%p) | [["+", 0, 652, 3, 4, 0, 41, 0, 666, 667, 60], ["+", 0, 652, 3, 4, 0, 41, 0, 666, 0, 612]] | 5 | 41 | 2 |
for _ in range(int(input())):
a,b = map(int,input().split())
print(a%b+1)
| for _ in range(int(input())):
a,b = map(int,input().split())
print((a-1)%b+1)
| [["+", 3, 4, 0, 657, 31, 657, 31, 23, 0, 24], ["+", 0, 657, 31, 657, 31, 23, 0, 657, 17, 33], ["+", 0, 657, 31, 657, 31, 23, 0, 657, 12, 612], ["+", 3, 4, 0, 657, 31, 657, 31, 23, 0, 25]] | 5 | 37 | 4 |
import java.util.*;
class Main {
int a, b;
int n, m;
int[][] flg = new int[24][60];
Main() {
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
for (int i = 0; i < n; i++) {
a = sc.nextInt();
b = sc.nextInt();
flg[a][b] = 1;
}
m = sc.nextInt();
for (int i = 0; i <... | import java.util.*;
class Main {
int a, b;
int n, m;
int[][] flg = new int[24][60];
Main() {
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
for (int i = 0; i < n; i++) {
a = sc.nextInt();
b = sc.nextInt();
flg[a][b] = 1;
}
m = sc.nextInt();
for (int i = 0; i <... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 491], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 491]] | 3 | 270 | 2 |
#include <stdio.h>
int main(void) {
int n;
int h, m;
int i, j;
int bus[24][60] = {0};
int c;
for (i = 0; i < 2; i++) {
scanf("%d", &n);
for (j = 0; j < n; j++) {
scanf("%d %d", &h, &m);
bus[h][m] = 1;
}
}
c = 0;
for (h = 0; h < 24; h++) {
for (m = 0; m < 60; m++) {
... | #include <stdio.h>
int main(void) {
int n;
int h, m;
int i, j;
int bus[24][60] = {0};
int c;
for (i = 0; i < 2; i++) {
scanf("%d", &n);
for (j = 0; j < n; j++) {
scanf("%d %d", &h, &m);
bus[h][m] = 1;
}
}
c = 0;
for (h = 0; h < 24; h++) {
for (m = 0; m < 60; m++) {
... | [["-", 64, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 23, 0, 16, 12, 13]] | 0 | 189 | 2 |
#include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 17, 131], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0,... | 1 | 607 | 8 |
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
int main() {
int n, m;
int ho, mi;
P p[202];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ho >> mi;
p[i].first = ho;
p[i].second = mi;
}
cin >> m;
for (int i = n; i < n + m; i++) {
c... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
int main() {
int n, m;
int ho, mi;
P p[202];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ho >> mi;
p[i].first = ho;
p[i].second = mi;
}
cin >> m;
for (int i = n; i < n + m; i++) {
c... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 400 | 6 |
#include <iostream>
using namespace std;
int main() {
int N = 0;
int h[201];
int m[201];
int M = 0;
int k[201];
int g[201];
int L = 0;
cin >> N;
int tem = 0;
int i = 0;
int AH[201];
int AM[201];
int DH = 100;
int DM = 100;
for (int i = 0; i < N; i++) {
cin >> h[i] >> m[i];
}
cin ... | #include <iostream>
using namespace std;
int main() {
int N = 0;
int h[201];
int m[201];
int M = 0;
int k[201];
int g[201];
int L = 0;
cin >> N;
int tem = 0;
int i = 0;
int AH[201];
int AM[201];
int DH = 100;
int DM = 100;
for (int i = 0; i < N; i++) {
cin >> h[i] >> m[i];
}
cin ... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+"... | 1 | 565 | 8 |
def f(a, b)
result = 0
unless a == b
result += 1 unless a % 2 == 0
result += 1 unless b % 2 == 0
a = (a + 1) / 2
b = b / 2
end
result
end
n = gets.to_i
n.times do
s, d = gets.split.map!(&:to_i)
puts f(s, d)
end | def f(a, b)
result = 0
until a == b
result += 1 unless a % 2 == 0
result += 1 unless b % 2 == 0
a = (a + 1) / 2
b = b / 2
end
result
end
n = gets.to_i
n.times do
s, d = gets.split.map!(&:to_i)
puts f(s, d)
end | [["-", 0, 493, 0, 735, 8, 736, 0, 747, 0, 747], ["+", 0, 493, 0, 735, 8, 736, 0, 750, 0, 750]] | 4 | 79 | 2 |
#include <stdio.h>
int main(void) {
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", a + b);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", a * b);
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 48]] | 0 | 42 | 2 |
#include <stdio.h>
int main() {
int d, c;
scanf("%d %d", &d, &c);
c = 2 * d;
printf("%d\n", c);
return 0;
} | #include <stdio.h>
int main() {
int d, c, b;
scanf("%d %d", &d, &c);
b = c * d;
printf("%d\n", b);
return 0;
} | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 31, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0,... | 0 | 45 | 8 |
#include <stdio.h>
int main(void) {
int d, c;
scanf("%d %d", d, c);
printf("%d\n", d * c);
return 0;
} | #include <stdio.h>
int main(void) {
int d, c;
scanf("%d %d", &d, &c);
printf("%d\n", d * c);
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 40 | 2 |
#include <iostream>
int main() {
int a, b;
std::cin >> a, b;
std::cout << a * b << std::endl;
return 0;
} | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
std::cout << a * b << std::endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 1, 0, 34, 0, 21], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152]] | 1 | 36 | 2 |
#include <stdio.h>
int main() {
int x, y, z = 0;
while (scanf("%d %d", &x, &y) != EOF) {
z = x * y;
printf("%d\n", &z);
z = 0;
}
return 0;
} | #include <stdio.h>
int main() {
int x, y, z = 0;
while (scanf("%d %d", &x, &y) != EOF) {
z = x * y;
printf("%d\n", z);
z = 0;
}
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 60 | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
int main() {
int d, c;
scanf("%d%d", &d, &c);
printf("%d %d", d, c);
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
int main() {
int d, c;
scanf("%d%d", &d, &c);
printf("%d\n", d * c);
return 0;
} | [["-", 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], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 48]] | 1 | 44 | 5 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int N;
int R;
int S, T;
int pos[114514];
int bit[(1 << 18) + 2];
ll kai[114514];
ll mod = 1000000007;
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i) {
while (i <= (1 << 18)) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int N;
int R;
int S, T;
int pos[114514];
int bit[(1 << 18) + 2];
ll kai[114514];
ll mod = 1000000007;
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i) {
while (i <= (1 << 18)) {
... | [["+", 31, 69, 341, 342, 0, 16, 31, 16, 31, 22], ["+", 31, 69, 341, 342, 0, 16, 31, 16, 17, 33], ["-", 0, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 17, 33]] | 1 | 380 | 4 |
import java.util.Arrays;
import java.util.Collections;
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);
while (true) {
int n = scanner.nextInt();
if (n == 0)
break... |
import java.util.Arrays;
import java.util.Collections;
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);
loop:
while (true) {
int n = scanner.nextInt();
if (n == 0)
... | [["+", 8, 498, 0, 195, 8, 196, 0, 97, 0, 22], ["+", 8, 498, 0, 195, 8, 196, 0, 97, 0, 102], ["-", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94], ["+", 8, 196, 0, 57, 64, 196, 0, 116, 0, 117], ["+", 8, 196, 0, 57, 64, 196, 0, 116, 0, 22]] | 3 | 250 | 5 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int n;
int A[40001], B[40001];
int check(int k, set<P> S) {
int win = 0;
for (int i = n - k - 1; i < n; i++) {
set<P>::iterator it = S.upper_bound(P(B[i], -1));
if (it == S.end())
it--;
if (it->second < k)
continue;
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int n;
int A[40001], B[40001];
int check(int k, set<P> S) {
int win = 0;
for (int i = n - k - 1; i < n; i++) {
set<P>::iterator it = S.upper_bound(P(B[i], -1));
if (it == S.end())
it--;
if (it->second < k)
continue;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 325 | 2 |
#include <bits/stdc++.h>
#define N 40005
using namespace std;
int n, a[N], b[N], A[N];
int main() {
while (1) {
cin >> n;
if (!n)
break;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
sort(a, a + n, greater<int>());
sort(b, b + n, greater<i... | #include <bits/stdc++.h>
#define N 40005
using namespace std;
int n, a[N], b[N], A[N];
int main() {
while (1) {
cin >> n;
if (!n)
break;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
sort(a, a + n, greater<int>());
sort(b, b + n, greater<i... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 291 | 2 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define IINF (INT_MAX)
#define MAX_N 40001
using namespace std;
int N, a[MAX_N], b[MAX_N];
int main() {
while (scanf("%d", &N), N) {
rep(i, N) scanf("%d", a + i);
rep(i, N) scanf("%d", b + i);
sort... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define IINF (INT_MAX)
#define MAX_N 40001
using namespace std;
int N, a[MAX_N], b[MAX_N];
int main() {
while (scanf("%d", &N), N) {
rep(i, N) scanf("%d", a + i);
rep(i, N) scanf("%d", b + i);
sort... | [["+", 0, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 222 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <iostream>
#include <vector>
#define TIMES(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef complex<double> P;
typedef bitset<300> Spec;
const double EPS = 1e-9;
const double PI = acos(-1);
double normalize(double an... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <iostream>
#include <vector>
#define TIMES(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef complex<double> P;
typedef bitset<300> Spec;
const double EPS = 1e-9;
const double PI = acos(-1);
double normalize(double an... | [["-", 51, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["-", 51, 2, 3, 4, 0, 2, 3, 4, 0, 21], ["+", 51, 2, 3, 4, 0, 2, 3, 4, 0, 21], ["+", 51, 2, 3, 4, 0, 2, 3, 4, 0, 22]] | 1 | 1,128 | 4 |
### subroutines
def make_area(an, w)
w[3] = an
area = [w]
start = w[0]
while w[1] != start
c1 = w[1]
w1 = w[4]
links1 = $links[c1]
nl1 = links1.length
wi = links1.index(w1)
w = links1[(wi + nl1 - 1) % nl1]
w[3] = an
area << w
end
area
end
### main
while true
$cn, $w... | ### subroutines
def make_area(an, w)
w[3] = an
area = [w]
start = w[0]
while w[1] != start
c1 = w[1]
w1 = w[4]
links1 = $links[c1]
nl1 = links1.length
wi = links1.index(w1)
w = links1[(wi + nl1 - 1) % nl1]
w[3] = an
area << w
end
area
end
### main
while true
$cn, $w... | [["-", 0, 88, 51, 267, 0, 652, 486, 742, 0, 22], ["+", 0, 88, 51, 267, 0, 652, 486, 742, 0, 22]] | 4 | 532 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int max, min;
Scanner sc = new Scanner(System.in);
for (int i = 0; i <= 6; i++) {
max = sc.nextInt();
min = sc.nextInt();
System.out.print(max - min);
}
}
} | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int max, min;
Scanner sc = new Scanner(System.in);
for (int i = 0; i <= 6; i++) {
max = sc.nextInt();
min = sc.nextInt();
System.out.println(max - min);
}
}
} | [["-", 0, 7, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 492, 141, 22]] | 3 | 83 | 2 |
import java.util.Scanner;
public class Main {
int high;
int low;
int sa;
public void solve() {
Scanner sc = new Scanner(System.in);
for (int i = 0; i < 7; i++) {
high = sc.nextInt();
low = sc.nextInt();
sa = high - low;
System.out.print(sa);
}
}
public static void ma... | import java.util.Scanner;
public class Main {
int high;
int low;
int sa;
public void solve() {
Scanner sc = new Scanner(System.in);
for (int i = 0; i < 7; i++) {
high = sc.nextInt();
low = sc.nextInt();
sa = high - low;
System.out.println(sa);
}
}
public static void ... | [["-", 0, 7, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 492, 141, 22]] | 3 | 112 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNextInt()) {
for (int i = 0; i <= 6; i++) {
int fir = sc.nextInt();
int sec = sc.nextInt();
System.out.println(fir = sec);
}
}
}
} | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNextInt()) {
for (int i = 0; i <= 6; i++) {
int fir = sc.nextInt();
int sec = sc.nextInt();
System.out.println(fir - sec);
}
}
}
} | [["-", 0, 1, 0, 492, 3, 4, 0, 11, 17, 32], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, 33]] | 3 | 90 | 2 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int a, b;
int ans[] = new int[7];
for (int i = 1; i < 7; i++) {
a = scan.nextInt();
b = scan.nextInt();
ans[i] = a - b;
}
for (int i = 1; i < 7; i++) {
... | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int a, b;
int ans[] = new int[7];
for (int i = 0; i < 7; i++) {
a = scan.nextInt();
b = scan.nextInt();
ans[i] = a - b;
}
for (int i = 0; i < 7; i++) {
... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499]] | 3 | 119 | 4 |
#include <stdio.h>
int main(void) {
int a, b;
int i;
for (i = 0; i < 7; i++) {
scanf("%d %d", &a, &b);
printf("%d", a - b);
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b;
int i;
for (i = 0; i < 7; i++) {
scanf("%d %d", &a, &b);
printf("%d\n", a - b);
}
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 59 | 1 |
#include <stdio.h>
int main() {
int a1, b1, a2, b2, a3, b3, a4, b4, a5, b5, a6, b6, a7, b7, A, B, C, D, E, F,
G;
scanf("%d %d", &a1, &b1);
scanf("%d %d\n", &a2, &b2);
scanf("%d %d\n", &a3, &b3);
scanf("%d %d\n", &a4, &b4);
scanf("%d %d\n", &a5, &b5);
scanf("%d %d\n", &a6, &b6);
scanf("%d %d\n", &a... | #include <stdio.h>
int main() {
int a1, b1, a2, b2, a3, b3, a4, b4, a5, b5, a6, b6, a7, b7, A, B, C, D, E, F,
G;
scanf("%d %d", &a1, &b1);
scanf("%d %d\n", &a2, &b2);
scanf("%d %d\n", &a3, &b3);
scanf("%d %d\n", &a4, &b4);
scanf("%d %d\n", &a5, &b5);
scanf("%d %d\n", &a6, &b6);
scanf("%d %d", &a7,... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 262 | 2 |
#include <stdio.h>
int main(void) {
int i, a, b;
for (i = 0; i < 7; i++) {
scanf("%d %d", &a, &b);
printf("%d", a - b);
}
return (0);
} | #include <stdio.h>
int main(void) {
int i, a, b;
for (i = 0; i < 7; i++) {
scanf("%d %d", &a, &b);
printf("%d\n", a - b);
}
return (0);
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 60 | 1 |
#include <stdio.h>
int main(void) {
int a, b, i, w;
for (i = 0; i < 7; i++) {
scanf("%d %d", &a, &b);
w = a - b;
printf("\n", w);
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, i, w;
for (i = 0; i < 7; i++) {
scanf("%d %d", &a, &b);
w = a - b;
printf("%d\n", w);
}
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 64 | 1 |
#include <stdio.h>
int main(void) {
int i, j, k;
int data[7] = {0};
int dife[7] = {0};
for (i = 0; i < 8; i++) {
scanf("%d %d", &data[i], &dife[i]);
printf("%d\n", data[i] - dife[i]);
}
return 0;
} | #include <stdio.h>
int main(void) {
int i, j, k;
int data[7] = {0};
int dife[7] = {0};
for (i = 0; i < 7; i++) {
scanf("%d %d", &data[i], &dife[i]);
printf("%d\n", data[i] - dife[i]);
}
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 0 | 91 | 2 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main(void) {
int a, b, c, i;
for (i = 0; i < 7; i++)
scanf("%d %d", &a, &b);
c = a + -1 * b;
printf("%d\n", c);
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main(void) {
int a, b, c, i;
for (i = 0; i < 7; i++) {
scanf("%d %d", &a, &b);
c = a + -1 * b;
printf("%d\n", c);
}
return 0;
} | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 67 | 2 |
#include <stdio.h>
int main(void) {
int i, a, b, c[6];
for (i = 0; i <= 5; i++) {
scanf("%d", &a);
scanf("%d", &b);
c[i] = a - b;
}
for (i = 0; i <= 5; i++) {
printf("%d\n", c[i]);
}
return 0;
} | #include <stdio.h>
int main(void) {
int i, a, b, c[7];
for (i = 0; i <= 6; i++) {
scanf("%d", &a);
scanf("%d", &b);
c[i] = a - b;
}
for (i = 0; i <= 6; i++) {
printf("%d\n", c[i]);
}
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 0 | 96 | 6 |
/* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||_... | /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||_... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19]] | 1 | 412 | 2 |
#include <iostream>
#include <string>
using namespace std;
int j, y;
void check(int xt, int yt, string p) {
if (xt == j && yt == y) {
cout << p << endl;
return;
}
if (xt == 5 && yt <= 3 || yt == 5 && xt <= 3)
return;
if (xt > j || xt > y)
return;
check(xt + 1, yt, p + "A");
check(xt, yt +... | #include <iostream>
#include <string>
using namespace std;
int j, y;
void check(int xt, int yt, string p) {
if (xt == j && yt == y) {
cout << p << endl;
return;
}
if (xt == 5 && yt <= 3 || yt == 5 && xt <= 3)
return;
if (xt > j || yt > y)
return;
check(xt + 1, yt, p + "A");
check(xt, yt +... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62]] | 1 | 136 | 8 |
#include <iostream>
using namespace std;
long long s[2000000], t[2000000], e[2000000], f[20000], g[20000];
int main() {
int c = 0;
long long n, m;
cin >> n >> m;
while (true) {
cin >> s[c] >> t[c] >> e[c];
if (s[c] == 0 && t[c] == 0 && e[c] == 0) {
break;
}
c++;
}
int l;
cin >> l;
... | #include <iostream>
using namespace std;
long long s[2000000], t[2000000], e[2000000], f[20000], g[20000];
int main() {
int c = 0;
long long n, m;
cin >> n >> m;
while (true) {
cin >> s[c] >> t[c] >> e[c];
if (s[c] == 0 && t[c] == 0 && e[c] == 0) {
break;
}
c++;
}
int l;
cin >> l;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 251 | 6 |
#include <iostream>
using namespace std;
int N, M, L, R, s[50003], t[50003], e[50003], c[10003];
long long d[10003];
int main() {
cin >> N >> M;
while (true) {
cin >> s[R] >> t[R] >> e[R];
s[R]--, t[R]--;
if (!e[R])
break;
R++;
}
cin >> L;
for (int i = 0; i < L; i++) {
for (int j = 0... | #include <iostream>
using namespace std;
int N, M, L, R, s[50003], t[50003], e[50003], c[10003];
long long d[10003];
int main() {
cin >> N >> M;
while (true) {
cin >> s[R] >> t[R] >> e[R];
s[R]--, t[R]--;
if (!e[R])
break;
R++;
}
cin >> L;
for (int i = 0; i < L; i++) {
for (int j = 0... | [["+", 0, 7, 8, 9, 0, 7, 8, 1, 0, 35], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22]] | 1 | 233 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, m, l, s, t, e, cnt = 0, a[1000000][3], b[1000000];
cin >> n >> m;
while (1) {
scanf("%d %d %d", &s, &t, &e);
if (s + t + e == 0)
break;
a[cnt][0] = s;
a[cnt][1] = t;
a[cnt][2] = e;
cnt++;
}
cin >> l;
... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, m, l, s, t, e, cnt = 0, a[100000][3], b[100000];
cin >> n >> m;
while (1) {
scanf("%d %d %d", &s, &t, &e);
if (s + t + e == 0)
break;
a[cnt][0] = s;
a[cnt][1] = t;
a[cnt][2] = e;
cnt++;
}
cin >> l;
f... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13]] | 1 | 272 | 6 |
#include <bits/stdc++.h>
using namespace std;
// int nm[10001][10001] = {0};
map<pair<int, int>, int> nm;
long long c[10001];
int b[10000];
int main() {
int n, m;
cin >> n >> m;
while (1) {
int s, t, e;
scanf(" %d %d %d", &s, &t, &e);
if ((s + t + e) == 0)
break;
// nm[s][t] = e;
... | #include <bits/stdc++.h>
using namespace std;
// int nm[10001][10001] = {0};
map<pair<int, int>, int> nm;
long long c[10001];
int b[10000];
int main() {
int n, m;
cin >> n >> m;
while (1) {
int s, t, e;
scanf(" %d %d %d", &s, &t, &e);
if ((s + t + e) == 0)
break;
// nm[s][t] = e;
... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["-", 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], ["+", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], [... | 1 | 298 | 35 |
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
string str[17] = {"Man", "Oku", "Cho", "kei", "Gai", "Jo",
"Jou", "Ko", "Kan", "Sei", "Sai", "Gok",
"Ggs", "Asg", "Nyt", "Fks", "Mts"};
while (1) {
ll num[18] = {};
int m, ... | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
string str[17] = {"Man", "Oku", "Cho", "Kei", "Gai", "Jo",
"Jou", "Ko", "Kan", "Sei", "Sai", "Gok",
"Ggs", "Asg", "Nyt", "Fks", "Mts"};
while (1) {
ll num[18] = {};
int m,... | [["-", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6], ["+", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, ... | 1 | 332 | 8 |
unit = ['', 'Man', 'Oku', 'Cho', 'Kei', 'Gai', 'Jo', 'Jou', 'Ko', 'Kan', 'Sei', 'Sai', 'Gok', 'Ggs', 'Asg', 'Nyt', 'Fks', 'Mts']
while true
a,b = gets.split()
if a==0 then break end
p = a.to_i**b.to_i
s = ''
for i in 0..17 do
rem = p%10000
if rem!=0 then s = rem.to_s + unit[i] + s end
p /= 10000
... | unit = ['', 'Man', 'Oku', 'Cho', 'Kei', 'Gai', 'Jo', 'Jou', 'Ko', 'Kan', 'Sei', 'Sai', 'Gok', 'Ggs', 'Asg', 'Nyt', 'Fks', 'Mts']
while true
a,b = gets.split()
if a=='0' then break end
p = a.to_i**b.to_i
s = ''
for i in 0..17 do
rem = p%10000
if rem!=0 then s = rem.to_s + unit[i] + s end
p /= 10000... | [["+", 8, 170, 0, 121, 15, 738, 12, 557, 0, 62]] | 4 | 142 | 12 |
unit = ['', 'Man', 'Oku', 'Cho', 'Kei', 'Gai', 'Jo', 'Jou', 'Ko', 'Kan', 'Sei', 'Sai', 'Gok', 'Ggs', 'Asg', 'Nyt', 'Fks', 'Mts']
while 1
a,b = gets.split()
if a=='0' then break end
p = a.to_i**b.to_i
s = ''
for i in 0..17
rem = p%10000
if rem then s = rem.to_s + unit[i] + s end
p /= 10000
end
... | unit = ['', 'Man', 'Oku', 'Cho', 'Kei', 'Gai', 'Jo', 'Jou', 'Ko', 'Kan', 'Sei', 'Sai', 'Gok', 'Ggs', 'Asg', 'Nyt', 'Fks', 'Mts']
while 1
a,b = gets.split()
if a=='0' then break end
p = a.to_i**b.to_i
s = ''
for i in 0..17
rem = p%10000
if rem!=0 then s = rem.to_s + unit[i] + s end
p /= 10000
end... | [["+", 0, 88, 8, 170, 0, 121, 15, 738, 17, 79], ["+", 0, 88, 8, 170, 0, 121, 15, 738, 12, 612]] | 4 | 141 | 2 |
s = ("","Man","Oku","Cho","Kei","Gai","Jo",
"Jou","Ko","Kan","Sei","Sai","Gok","Ggs",
"Asg","Nyt","Fks","Mts")
while True:
m,n = map(int,input().split())
if m == 0 and n == 0:
break
ans = ""
for i in range(0,len(str(m**n)),4):
x = m**n//(10**i)%10000#m^n / 10^i
ans = str(x) + s[i//4] + ans
print(ans) | s = ("","Man","Oku","Cho","Kei","Gai","Jo",
"Jou","Ko","Kan","Sei","Sai","Gok","Ggs",
"Asg","Nyt","Fks","Mts")
while True:
m,n = map(int,input().split())
if m == 0 and n == 0:
break
ans = ""
for i in range(0,len(str(m**n)),4):
x = m**n//(10**i)%10000#m^n / 10^i
if x > 0:
ans = str(x) + s[i//4] + ans
pr... | [["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 102]] | 5 | 160 | 5 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MAX_V = 10000;
struct edge {};
vector<edge> G[MAX_V];
// ??§????????°INF
#define INF (1 <... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MAX_V = 10000;
struct edge {};
vector<edge> G[MAX_V];
// ??§????????°INF
#define INF (1 <... | [["-", 49, 50, 51, 4, 0, 2, 3, 4, 0, 22], ["+", 49, 50, 51, 4, 0, 2, 3, 4, 0, 22]] | 1 | 397 | 2 |
#include <algorithm>
#include <iostream>
#define N1 101
#define N2 101
#define INF 2000000000
using namespace std;
void DP();
int D, N, a[N1], e[N1], r[N1];
int dp[N1 + N1 + N1 + N1][N2], minv;
int main() {
while (1) {
cin >> D >> N;
if (D == 0 && N == 0)
break;
for (int i = 0; i < N; i++)
cin... | #include <algorithm>
#include <iostream>
#define N1 102
#define N2 102
#define INF 2000000000
using namespace std;
void DP();
int D, N, a[N1], e[N1], r[N1];
int dp[N1 + N1 + N1 + N1][N2], minv;
int main() {
while (1) {
cin >> D >> N;
if (D == 0 && N == 0)
break;
for (int i = 0; i < N; i++)
cin... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 527 | 8 |
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(I, N) for (int I = 0; I < (int)(N... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(I, N) for (int I = 0; I < (int)(N... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 251 | 4 |
#include <iostream>
using namespace std;
int n, s, d, r;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &s, &d);
r = 0;
while (s != d) {
for (int j = 30; j >= 0; j--) {
if (abs(s) % (1 << j) == 0 && s + (1 << j) <= d)
s += (1 << j), r++;
}
}
... | #include <iostream>
using namespace std;
int n, s, d, r;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &s, &d);
r = 0;
while (s != d) {
for (int j = 30; j >= 0; j--) {
if (abs(s) % (1 << j) == 0 && s + (1 << j) <= d) {
s += (1 << j), r++;
bre... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 137 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
int cur, ret = 0;
while (1) {
cur = abs(a);
for (int i = 8; i >= 0; i--) {
if (cur % (1 << i) == 0 && a + (1 << i) <= b) {
a += (1 << i);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
int cur, ret = 0;
while (1) {
cur = abs(a);
for (int i = 30; i >= 0; i--) {
if (cur % (1 << i) == 0 && a + (1 << i) <= b) {
a += (1 << i)... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 135 | 2 |
#include <iostream>
using namespace std;
int main() {
int p, m, c;
cin >> p, m, c;
cout << p + m + c << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int p, m, c;
cin >> p >> m >> c;
cout << p + m + c << endl;
return 0;
}
| [["-", 0, 14, 8, 9, 0, 1, 0, 34, 0, 21], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 34, 12, 34, 0, 21], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152]] | 1 | 40 | 4 |
while True:
try:
a,b,c=map(int,input().split)
print(a+b+c)
except:break
| while True:
try:
a,b,c=map(int,input().split())
print(a+b+c)
except:break
| [["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 32 | 2 |
for i in range(int(input())):
res = 0
c,a,n = list(map(int,input().split()))
res = min(n,a,c)
c -= res
a -= res
if c >= 2 and a >= 1:
cca += min(c//2,a)
c -= cca*2
if c >=3:
res += c//3
print(res) | for i in range(int(input())):
res = 0
c,a,n = list(map(int,input().split()))
res = min(n,a,c)
c -= res
a -= res
if c >= 2 and a >= 1:
cca = min(c//2,a)
c -= cca*2
res += cca
if c >=3:
res += c//3
print(res) | [["-", 0, 57, 64, 196, 0, 1, 0, 677, 17, 107], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 17, 107], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 12, 22]] | 5 | 91 | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.