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 <cstring>
#include <iostream>
using namespace std;
int main() {
int n, c;
const int num[10][7] = {{0, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 0},
{1, 0, 1, 1, 0, 1, 1}, {1, 0, 0, 1, 1, 1, 1},
{1, 1, 0, 0, 1, 1, 0}, {1, 1, 0, 1, 1, 0, 1},
... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, c;
const int num[10][7] = {{0, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 0},
{1, 0, 1, 1, 0, 1, 1}, {1, 0, 0, 1, 1, 1, 1},
{1, 1, 0, 0, 1, 1, 0}, {1, 1, 0, 1, 1, 0, 1},
... | [["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 21], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 21], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]] | 1 | 318 | 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 << ": " ... | [["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13]] | 1 | 589 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
const int V[10][7] = {{0, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 0},
{1, 0, 1, 1, 0, 1, 1}, {1, 0, 0, 1, 1, 1, 1},
{1, 1, 0, 0, 1, 1, 0}, {1, 1, 0, 1, 1, 0, 1},
{1, 1, 1, 1, 1, 0, 1}, {0, 1, 0, 0... | #include <algorithm>
#include <iostream>
#include <string>
const int V[10][7] = {{0, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 0},
{1, 0, 1, 1, 0, 1, 1}, {1, 0, 0, 1, 1, 1, 1},
{1, 1, 0, 0, 1, 1, 0}, {1, 1, 0, 1, 1, 0, 1},
{1, 1, 1, 1, 1, 0, 1}, {0, 1, 0, 0... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 379 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, i;
string n, d[10] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "0100111", "1111111", "1101111"};
while (cin >> a) {
if (a == -1)
break;
n = "1111111";
for (... | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, i;
string n, d[10] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "0100111", "1111111", "1101111"};
while (cin >> a) {
if (a == -1)
break;
n = "0000000";
for (... | [["-", 8, 9, 0, 1, 0, 11, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 11, 12, 5, 0, 6], ["-", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["-", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 171 | 6 |
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
using namespace std;
int dis[10] = {63, 6, 91, 79, 102, 109, 115, 39, 127, 111};
int main() {
int a;
while (cin >> a, a != -1) {
int now = 0;
for (int b = 0; b < a; b++) {
int c;
cin >> c;
int ... | #include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
using namespace std;
int dis[10] = {63, 6, 91, 79, 102, 109, 125, 39, 127, 111};
int main() {
int a;
while (cin >> a, a != -1) {
int now = 0;
for (int b = 0; b < a; b++) {
int c;
cin >> c;
int ... | [["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13]] | 1 | 144 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s[10] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "0100111", "1111111", "1101111"};
int n, a;
while (cin >> n, n < 0) {
string b = "00000000";
... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s[10] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "0100111", "1111111", "1101111"};
int n, a;
while (cin >> n, n > -1) {
string b = "00000000";
... | [["-", 0, 52, 15, 339, 51, 34, 12, 16, 17, 18], ["-", 0, 52, 15, 339, 51, 34, 12, 16, 12, 13], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 47], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 12, 13]] | 1 | 155 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin... | [["-", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6], ["+", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6]] | 1 | 259 | 4 |
// 0228.cpp : ??????????????? ??¢????????±????????§????????¨?????????
// ?????????????????????????????????
//
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#incl... | // 0228.cpp : ??????????????? ??¢????????±????????§????????¨?????????
// ?????????????????????????????????
//
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#inc... | [["-", 8, 9, 0, 1, 0, 11, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 11, 12, 5, 0, 6]] | 1 | 279 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string table[] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "1111111", "1101111"};
int n;
while (cin >> n, ~n) {
st... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string table[] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "0100111", "1111111", "1101111"};
int n;
while (cin >> n, ~... | [["+", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6], ["+", 0, 43, 49, 50, 51, 83, 0, 5, 0, 62], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 21]] | 1 | 137 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 283 | 4 |
#include <iostream>
using namespace std;
const string numbers[10] = {"0111111", "0000110", "1011011", "1001111",
"1100110", "1101101", "1111101", "0100111",
"1111111", "1101111"};
string convert(int k, string prev) {
string answer;
for (int i = 0; i < 7; i++... | #include <iostream>
using namespace std;
const string numbers[10] = {"0111111", "0000110", "1011011", "1001111",
"1100110", "1101101", "1111101", "0100111",
"1111111", "1101111"};
string convert(int k, string prev) {
string answer;
for (int i = 0; i < 7; i++... | [["-", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6], ["+", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6]] | 1 | 193 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j;
int a[10][7] = {{0, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 0},
{1, 0, 1, 1, 0, 1, 1}, {1,... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j;
int a[10][7] = {{0, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 0},
{1, 0, 1, 1, 0, 1, 1}, {1,... | [["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 21]] | 1 | 348 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string state[10];
int n;
state[0] = "0111111";
state[1] = "0000110";
state[2] = "1011011";
state[3] = "1001111";
state[4] = "1100110";
state[5] = "1101101";
state[6] = "1111101";
state[7] = "0000111";
state[8] = "111111... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string state[10];
int n;
state[0] = "0111111";
state[1] = "0000110";
state[2] = "1011011";
state[3] = "1001111";
state[4] = "1100110";
state[5] = "1101101";
state[6] = "1111101";
state[7] = "0100111";
state[8] = "111111... | [["-", 8, 9, 0, 1, 0, 11, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 11, 12, 5, 0, 6]] | 1 | 223 | 2 |
#include <cstdio>
int main() {
while (true) {
int n, a[100];
int mask[10];
mask[0] = 1 + 2 + 4 + 8 + 16 + 32;
mask[1] = 2 + 4;
mask[2] = 1 + 2 + 8 + 16 + 64;
mask[3] = 1 + 2 + 8 + 16 + 64;
mask[4] = 2 + 4 + 32 + 64;
mask[5] = 1 + 4 + 8 + 32 + 64;
mask[6] = 1 + 4 + 8 + 16 + 32 + 6... | #include <cstdio>
int main() {
while (true) {
int n, a[100];
int mask[10];
mask[0] = 1 + 2 + 4 + 8 + 16 + 32;
mask[1] = 2 + 4;
mask[2] = 1 + 2 + 8 + 16 + 64;
mask[3] = 1 + 2 + 4 + 8 + 64;
mask[4] = 2 + 4 + 32 + 64;
mask[5] = 1 + 4 + 8 + 32 + 64;
mask[6] = 1 + 4 + 8 + 16 + 32 + 64... | [["-", 0, 11, 12, 16, 31, 16, 31, 16, 12, 13], ["+", 0, 11, 12, 16, 31, 16, 31, 16, 12, 13], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 13], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 12, 13]] | 1 | 314 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int ss[10][7] = {{0, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 0},
{1, 0, 1, 1, 0, 1, 1}, {1, 0, 0, 1, 1, 1, 1},
{1, 1, 0, 0, 1, 1, 0}, {1, 1, 0, 1, 1, 0, 1},
{1, 1, 1, 1, 1, 0, 1}, {0, 1, 0, 0, 1, 1, 1},
... | #include <algorithm>
#include <iostream>
using namespace std;
// g, f, e, d, c, b, a
int ss[10][7] = {{0, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 1, 1, 0},
{1, 0, 1, 1, 0, 1, 1}, {1, 0, 0, 1, 1, 1, 1},
{1, 1, 0, 0, 1, 1, 0}, {1, 1, 0, 1, 1, 0, 1},
{1, 1, 1, 1, 1, 0, 1}, {0,... | [["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 21], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 21], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]] | 1 | 298 | 4 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(n) rep(i, n)
#define all(n) n.begin(), n.end()
const int A = 1, B = 2, C = 4, D = 8, E = 16, F = 32, G = 64;
int sig[10];
int ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(n) rep(i, n)
#define all(n) n.begin(), n.end()
const int A = 1, B = 2, C = 4, D = 8, E = 16, F = 32, G = 64;
int sig[10];
int ... | [["-", 0, 1, 0, 11, 12, 16, 12, 16, 12, 13], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 12, 13]] | 1 | 475 | 2 |
#include <iostream>
using namespace std;
const char *bits[] = {
"0111111", "0000110", "1011011", "1001111", "1100110", "1101101",
"1111101", "1001111", "0100111", "1111111", "1101111",
};
int main() {
int n;
while (cin >> n, n != -1) {
char current[] = "0000000";
for (int i = 0; i < n; i++) {
... | #include <iostream>
using namespace std;
const char *bits[] = {
"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "0100111", "1111111", "1101111",
};
int main() {
int n;
while (cin >> n, n != -1) {
char current[] = "0000000";
for (int i = 0; i < n; i++) {
int x;
... | [["-", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6], ["-", 0, 43, 49, 50, 51, 83, 0, 5, 0, 62], ["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 21]] | 1 | 181 | 4 |
#include <bitset>
#include <iostream>
#include <string>
using namespace std;
int nikara(const string &sig);
void tenkara(int);
int main() {
string sig[10] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "1111111", "1101111"};
string before, hoge;
int n, num;
... | #include <bitset>
#include <iostream>
#include <string>
using namespace std;
int nikara(const string &sig);
void tenkara(int);
int main() {
string sig[10] = {"0111111", "0000110", "1011011", "1001111", "1100110",
"1101101", "1111101", "0100111", "1111111", "1101111"};
string before, hoge;
in... | [["+", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6], ["+", 0, 43, 49, 50, 51, 83, 0, 5, 0, 62], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 21]] | 1 | 297 | 4 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int n, m;
vector<int> vege;
const int INF = 1 << 29;
int main(void) {
// 0111111 0000110 ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int n, m;
vector<int> vege;
const int INF = 1 << 29;
int main(void) {
// 0111111 0000110 ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 241 | 2 |
#include <stdio.h>
int main(void) {
int b, r, g, c, s, t;
int gain;
int use;
for (;;) {
scanf("%d %d %d %d %d %d", &b, &r, &g, &c, &s, &t);
if (b == 0 && r == 0 && g == 0 && c == 0 && s == 0 && t == 0)
break;
gain = b * 15 + r * 15 + g * 7 + c * 2 + (b * 5 + r * 3) * 15;
use = (t - s) ... | #include <stdio.h>
int main(void) {
int b, r, g, c, s, t;
int gain;
int use;
for (;;) {
scanf("%d %d %d %d %d %d", &b, &r, &g, &c, &s, &t);
if (b == 0 && r == 0 && g == 0 && c == 0 && s == 0 && t == 0)
break;
gain = b * 15 + r * 15 + g * 7 + c * 2 + (b * 5 + r * 3) * 15;
use = (t - s) ... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 154 | 1 |
main(b, r, g, c, s, t) {
for (; scanf("%d%d%d%d%d%d", &b, &r, &g, &c, &s, &t), t;
printf("%d\n", 100 + b * 77 + r * 51 + g * 4 - c - 3 * t + 18 * b +
3 * r + 3 * g + 3 * c + 3 * s))
;
exit(0);
} | main(b, r, g, c, s, t) {
for (; scanf("%d%d%d%d%d%d", &b, &r, &g, &c, &s, &t), t;
printf("%d\n", 100 + b * 77 + r * 51 + g * 4 - c - 3 * t + 18 * b +
12 * r + 3 * g + 3 * c + 3 * s))
;
exit(0);
} | [["-", 31, 16, 31, 16, 31, 16, 12, 16, 31, 13], ["+", 31, 16, 31, 16, 31, 16, 12, 16, 31, 13]] | 0 | 101 | 2 |
b, r, g, c, s;
main(t) {
while (t)
scanf("%d%d%d%d%d%d", &b, &r, &g, &c, &s, &t);
if (t)
printf("%d\n", 100 - (t - s) * 3 + c * 2 + g * 7 + 95 * b + 63 * r);
} | b, r, g, c, s;
main(t) {
while (t && scanf("%d%d%d%d%d%d", &b, &r, &g, &c, &s, &t))
if (t)
printf("%d\n", 100 - (t - s) * 3 + c * 2 + g * 7 + 95 * b + 63 * r);
} | [["-", 0, 14, 8, 9, 0, 52, 15, 23, 0, 25], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 98], ["+", 15, 23, 0, 16, 12, 2, 3, 4, 0, 25], ["-", 0, 14, 8, 9, 0, 52, 8, 1, 0, 35]] | 0 | 83 | 4 |
s, i;
main(x) {
for (; scanf("%d", &x),
i - 5 ? s += x * ("}]% !"[i++] - 30)
: x
? i = !printf("%d\n", s - 3 * x),
s = 100 : 0;)
;
} | s = 100, i;
main(x) {
for (; scanf("%d", &x),
i - 5 ? s += x * ("}]% !"[i++] - 30)
: x
? i = !printf("%d\n", s - 3 * x),
s = 100 : 0;)
;
} | [["+", 36, 36, 0, 30, 0, 1, 0, 11, 17, 32], ["+", 36, 36, 0, 30, 0, 1, 0, 11, 12, 13]] | 0 | 70 | 10 |
b, r, g, c, s;
main(t) {
for (; scanf("%d%d%d%d%d%d", &b, &r, &g, &c, &s, &t), ~b && t;)
// printf("%d\n",100-(t-s)*3+c*2+g*7+95*b+63*r);
printf("%d\n", 100 - (t - s) * 3 + c * 2 + 95 * b + (9 * r + g));
} | b, r, g, c, s;
main(t) {
for (; scanf("%d%d%d%d%d%d", &b, &r, &g, &c, &s, &t), ~b && t;)
// printf("%d\n",100-(t-s)*3+c*2+g*7+95*b+63*r);
printf("%d\n", 100 - (t - s) * 3 + c * 2 + 95 * b + 7 * (9 * r + g));
} | [["+", 0, 2, 3, 4, 0, 16, 12, 16, 31, 13], ["+", 0, 2, 3, 4, 0, 16, 12, 16, 17, 48]] | 0 | 85 | 2 |
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int m, n;
while (cin >> m >> n && m != 0 && n != 0) {
list<int> a;
for (int i = 1; i <= m; i++)
a.push_back(i);
list<int>::iterator it = a.begin(), it2;
... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int m, n;
while (cin >> m >> n && m != 0 && n != 0) {
list<int> a;
for (int i = 1; i <= m; i++)
a.push_back(i);
list<int>::iterator it = a.begin(), it2;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 308 | 2 |
#include <bits/stdc++.h>
using namespace std;
string fb[10001];
int main() {
for (int i = 1; i < 10001; i++) {
if (i % 15 == 0) {
fb[i] = "FizzBuzz";
} else if (i % 3 == 0) {
fb[i] = "Fizz";
} else if (i % 5 == 0) {
fb[i] = "Buzz";
} else {
stringstream ss;
ss << i;
... | #include <bits/stdc++.h>
using namespace std;
string fb[10001];
int main() {
for (int i = 1; i < 10001; i++) {
if (i % 15 == 0) {
fb[i] = "FizzBuzz";
} else if (i % 3 == 0) {
fb[i] = "Fizz";
} else if (i % 5 == 0) {
fb[i] = "Buzz";
} else {
stringstream ss;
ss << i;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 345 | 2 |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
string table[10001];
string itos(int n) {
stringstream ss;
ss << n;
return ss.str();
}
int main() {
for (int i = 1; i <= 10000; i++) {
if (i % 15 == 0) {
table[i] = "FizzBuzz";
} else if (i % 3 ==... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
string table[10001];
string itos(int n) {
stringstream ss;
ss << n;
return ss.str();
}
int main() {
for (int i = 1; i <= 10000; i++) {
if (i % 15 == 0) {
table[i] = "FizzBuzz";
} else if (i % 3 ==... | [["+", 3, 4, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 73]] | 1 | 321 | 3 |
#include <cstring>
#include <iostream>
#include <sstream>
struct person {
int num;
struct person *prev;
struct person *next;
};
struct person *head, *p, *now;
int m, n;
char s[128];
void set() {
for (int i = 0; i < m; i++) {
p[i].num = i + 1;
p[i].prev = p + i - 1;
p[i].next = p + i + 1;
}
p[... | #include <cstring>
#include <iostream>
#include <sstream>
struct person {
int num;
struct person *prev;
struct person *next;
};
struct person *head, *p, *now;
int m, n;
char s[128];
void set() {
for (int i = 0; i < m; i++) {
p[i].num = i + 1;
p[i].prev = p + i - 1;
p[i].next = p + i + 1;
}
p[... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117]] | 1 | 473 | 4 |
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
// ply.erase(find(ply.begin(),ply.end(),3));
int m, n;
while (cin >> n >> m && !(n == 0 && m == 0)) {
vector<int> ply;
for (int i = 0; i < n; i++)
p... | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
// ply.erase(find(ply.begin(),ply.end(),3));
int m, n;
while (cin >> n >> m && !(n == 0 && m == 0)) {
vector<int> ply;
for (int i = 0; i < n; i++)
p... | [["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 147], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["-", 0, 7, 8, 9, 0, 57, 64, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 116, 0, 117]] | 1 | 482 | 7 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#inclu... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 146], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 31, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 79], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["-", 64, 9, 0, 1, 0, 16, 31, 16, 17, 60], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32]] | 1 | 451 | 6 |
while(True):
m,n = map(int,input().split())
if not m: break
a = [True]*m
j = -1
for i in range(1,n+1):
if not sum(a): input(); continue
j = (j+1+((a+a)[j+1:]).index(True))%m
s = input()
if not i%15:
if s == "FizzBuzz": continue
else: a[j] = Fal... | while(True):
m,n = map(int,input().split())
if not m: break
a = [True]*m
j = -1
for i in range(1,n+1):
if sum(a) < 2: input(); continue
j = (j+1+((a+a)[j+1:]).index(True))%m
s = input()
if not i%15:
if s == "FizzBuzz": continue
else: a[j] = Fal... | [["-", 0, 7, 8, 196, 0, 57, 15, 681, 0, 372], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 18], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 612]] | 5 | 210 | 3 |
while(True):
m,n = map(int,input().split())
if not m: break
a = list(range(1,m+1))
b = [input() for _ in range(n)]
t = [str(i+1) for i in range(n)]
t[2::3] = ["Fizz"]*len(t[2::3])
t[4::5] = ["Buzz"]*len(t[4::5])
t[14::15] = ["FizzBuzz"]*len(t[14::15])
i=0
for j in range(n):
... | while(True):
m,n = map(int,input().split())
if not m: break
a = list(range(1,m+1))
b = [input() for _ in range(n)]
t = [str(i+1) for i in range(n)]
t[2::3] = ["Fizz"]*len(t[2::3])
t[4::5] = ["Buzz"]*len(t[4::5])
t[14::15] = ["FizzBuzz"]*len(t[14::15])
i=0
for j in range(n):
... | [["-", 64, 196, 0, 1, 0, 662, 12, 41, 0, 22], ["+", 64, 196, 0, 1, 0, 662, 12, 41, 0, 612], ["-", 0, 1, 0, 662, 12, 41, 0, 666, 667, 47], ["+", 0, 1, 0, 662, 12, 41, 0, 666, 667, 20], ["-", 64, 196, 0, 1, 0, 662, 12, 41, 0, 612], ["+", 64, 196, 0, 1, 0, 662, 12, 41, 0, 22]] | 5 | 222 | 6 |
def fizzbuzz(n):
if n%15==0: return "FizzBuzz"
if n%5==0: return "Buzz"
if n%3==0: return "Fizz"
return str(n)
while True:
m,n=list(map(int,input().split()))
if m==0:break
player=list(range(1,m+1))
p=0
for i in range(n):
if len(player)==1:
break
if fizzbuzz(i+1)!=input():
del player[p]
p%=len(pla... | def fizzbuzz(n):
if n%15==0: return "FizzBuzz"
if n%5==0: return "Buzz"
if n%3==0: return "Fizz"
return str(n)
while True:
try:
m,n=list(map(int,input().split()))
if m==0:break
player=list(range(1,m+1))
p=0
for i in range(n):
if len(player)==1:
break
if fizzbuzz(i+1)!=input():
del player[p... | [["+", 0, 656, 0, 52, 8, 196, 0, 246, 0, 247], ["+", 0, 656, 0, 52, 8, 196, 0, 246, 0, 102], ["+", 0, 52, 8, 196, 0, 246, 0, 671, 0, 672], ["+", 0, 52, 8, 196, 0, 246, 0, 671, 0, 102], ["+", 0, 246, 0, 671, 0, 196, 0, 674, 0, 675]] | 5 | 158 | 5 |
public class Main {
static int N = 10000001;
public void run(java.io.InputStream in, java.io.PrintStream out) {
java.util.Scanner sc = new java.util.Scanner(in);
int[] p;
int pn, i, n, a;
p = new int[N / 6];
pn = getprime(p);
for (;;) {
n = sc.nextInt();
if (n == 0)
bre... | public class Main {
static int N = 10000001;
public void run(java.io.InputStream in, java.io.PrintStream out) {
java.util.Scanner sc = new java.util.Scanner(in);
int[] p;
int pn, i, n, a;
p = new int[N / 6];
pn = getprime(p);
for (;;) {
n = sc.nextInt();
if (n == 0)
bre... | [["-", 0, 492, 3, 4, 0, 16, 31, 16, 17, 72], ["-", 3, 4, 0, 16, 31, 16, 12, 5, 0, 62], ["-", 3, 4, 0, 16, 31, 16, 12, 5, 0, 491], ["-", 0, 1, 0, 492, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 492, 3, 4, 0, 16, 12, 22]] | 3 | 335 | 6 |
import java.util.*;
public class Main {
private static final int mx = 10000000;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n;
boolean[] prime = (new boolean[mx]);
Arrays.fill(prime, true);
prime[0] = prime[1] = false;
for (int i = 2; i < mx; ++i)
... | import java.util.*;
public class Main {
private static final int mx = 10000000;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n;
boolean[] prime = (new boolean[mx]);
Arrays.fill(prime, true);
prime[0] = prime[1] = false;
for (int i = 2; i < mx; ++i)
... | [["-", 0, 52, 8, 196, 0, 7, 15, 16, 17, 18], ["-", 0, 52, 8, 196, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 17, 20], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 12, 499], ["-", 0, 52, 8, 196, 0, 7, 26, 27, 0, 29], ["+", 0, 52, 8, 196, 0, 7, 26, 27, 0, 68], ["-", 64, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 64, 196... | 3 | 206 | 8 |
#include <stdio.h>
char prime[10000001];
void SetPrime(int max) {
int i, j;
for (i = 4; i <= max; i += 2) {
prime[i] = 1;
}
for (i = 3; i * i <= max; i += 2) {
if (prime[i] == 0) {
for (j = i * 2; j <= max; j += i) {
prime[j] = 1;
}
}
}
}
int main(void) {
long n;
SetP... | #include <stdio.h>
char prime[10000001];
void SetPrime(int max) {
int i, j;
for (i = 4; i <= max; i += 2) {
prime[i] = 1;
}
for (i = 3; i * i <= max; i += 2) {
if (prime[i] == 0) {
for (j = i * 2; j <= max; j += i) {
prime[j] = 1;
}
}
}
}
int main(void) {
long n;
SetP... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 208 | 2 |
/*
*/
#include <stdio.h>
int max = 10000000;
short prime[10000000];
void make_prime() {
int i, p, n;
for (i = 0; i <= max; i++) {
prime[i] = 1;
}
prime[0] = 0;
prime[1] = 0;
for (p = 2; p <= max; p++) {
if (prime[p]) {
for (n = p + p; n <= max; n += p) {
prime[n] = 0;
}
... |
/*
*/
#include <stdio.h>
int max = 10000000;
short prime[10000000];
void make_prime() {
int i, p, n;
for (i = 0; i <= max; i++) {
prime[i] = 1;
}
prime[0] = 0;
prime[1] = 0;
for (p = 2; p <= max; p++) {
if (prime[p]) {
for (n = p + p; n <= max; n += p) {
prime[n] = 0;
}
... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 133], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 0 | 230 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#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_pai... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#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_pai... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 0, 70], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 0, 73], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35]] | 1 | 243 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
bool prime[1000000001];
int main() {
for (int i = 3; i * i <= 1000000000; i += 2) {
if (!prime[i]) {
for (int j = i * 2; j <= 1000000000; j += i) {
prime[j] = true;
}
}
}
int n;
while (cin >> n, n) {
for (;; n--) {
... | #include <algorithm>
#include <iostream>
using namespace std;
bool prime[10000001];
int main() {
for (int i = 3; i * i <= 10000000; i += 2) {
if (!prime[i]) {
for (int j = i * 2; j <= 10000000; j += i) {
prime[j] = true;
}
}
}
int n;
while (cin >> n, n) {
for (;; n--) {
... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13]] | 1 | 148 | 6 |
#include <algorithm>
#include <bitset>
#include <cassert>
#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 <iterator>
#include <list>
#... | #include <algorithm>
#include <bitset>
#include <cassert>
#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 <iterator>
#include <list>
#... | [["-", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 308 | 2 |
#include <iostream>
using namespace std;
int main() {
while (true) {
int answer;
int b, r, g, c, s, t;
cin >> b >> r >> g >> c >> s >> t;
if (b == 0) {
break;
}
int bonus = b * 5 + r * 3;
answer = 100 + b * 15 + r * 15 + bonus * 15 + g * 7 + c * 2 -
((t - s - bonus) ... | #include <iostream>
using namespace std;
int main() {
while (true) {
int answer;
int b, r, g, c, s, t;
cin >> b >> r >> g >> c >> s >> t;
if (t == 0) {
break;
}
int bonus = b * 5 + r * 3;
answer = 100 + b * 15 + r * 15 + bonus * 15 + g * 7 + c * 2 -
((t - s - bonus) ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 120 | 2 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include... |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 146 | 2 |
#include <iostream>
using namespace std;
int main() {
int b, r, g, c, s, t;
while (cin >> b >> r >> g >> c >> s >> t) {
if (b == 0 && r == 0 && g == 0 && c == 0 && s == 0 && t)
break;
int point = 100;
point += b * 15;
point += (b * 5) * 16;
point += r * 15;
point += (r * 3) * 16;
... | #include <iostream>
using namespace std;
int main() {
int b, r, g, c, s, t;
while (cin >> b >> r >> g >> c >> s >> t) {
if (b == 0 && r == 0 && g == 0 && c == 0 && s == 0 && t == 0)
break;
int point = 100;
point += b * 15;
point += (b * 5) * 16;
point += r * 15;
point += (r * 3) * 16... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 139 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 570 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
while (true) {
int N;
int Num[200];
scanf("%d", &N);
if (N == 0)
break;
for (int i = 0; i < 2 * N; i++)
scanf("%d", &Num[i]);
bool G[200][200];
for (int i = 0; i < 2 ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
while (true) {
int N;
int Num[200];
scanf("%d", &N);
if (N == 0)
break;
for (int i = 0; i < 2 * N; i++)
scanf("%d", &Num[i]);
bool G[200][200];
for (int i = 0; i < 2 ... | [["-", 15, 339, 51, 16, 31, 16, 12, 16, 31, 13], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 48], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 31, 13], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 48]] | 1 | 1,392 | 4 |
#include <iostream>
using namespace std;
int bill[2][100];
int n;
bool visited[2][100];
int jump(int, int, int);
main() {
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
cin >> bill[i][j];
}
}
for (int i = 0; i < 2;... | #include <iostream>
using namespace std;
int bill[2][100];
int n;
bool visited[2][100];
int jump(int, int, int);
main() {
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
cin >> bill[i][j];
}
}
for (int i = 0; i < 2;... | [["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 447 | 4 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define mp make_pair
typedef pair<int, int> pii;
const int N = 200;
const int inf ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define mp make_pair
typedef pair<int, int> pii;
const int N = 200;
const int inf ... | [["-", 0, 57, 64, 9, 0, 14, 49, 53, 49, 22], ["+", 0, 57, 64, 9, 0, 14, 49, 53, 49, 22], ["+", 64, 9, 0, 14, 49, 53, 54, 55, 0, 21], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 538 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int dp[2][103];
int n;
int bill[2][103];
while (cin >> n, n) {
rep(i, 2) rep(j, 103) dp[i][j] = (1 << 21);
rep(i, 2) rep(j, 103) bill[i][j] = 0;
rep(i, 2) rep(j... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int dp[2][103];
int n;
int bill[2][103];
while (cin >> n, n) {
rep(i, 2) rep(j, 103) dp[i][j] = (1 << 21);
rep(i, 2) rep(j, 103) bill[i][j] = 0;
rep(i, 2) rep(j... | [["-", 15, 339, 51, 16, 31, 69, 28, 69, 28, 22], ["+", 15, 339, 51, 16, 31, 69, 28, 69, 28, 22]] | 1 | 613 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int f(int a[][100], int b[][100], int p, int q, int r, int n) {
int mn = -1;
if (a[p][q] == 1)
for (; q < n && a[p][q + 1] ==... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int f(int a[][100], int b[][100], int p, int q, int r, int n) {
int mn = -1;
if (a[p][q] == 1)
for (; q + 1 < n && a[p][q + 1... | [["+", 64, 7, 15, 16, 31, 16, 31, 16, 17, 72], ["+", 64, 7, 15, 16, 31, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 533 | 4 |
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int n;
int bill[2][102];
bool mem[2][102];
const int INF = 1000000000;
int count;
int DFS(int i, int j) {
mem[i][j] = true;
while (bill[i][j] == 1 && bill[i][j + 1] == 1)
j++;
while (bill[i][j] == 2)
j--;
if (j >= n - 1)
... | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int n;
int bill[2][102];
bool mem[2][102];
const int INF = 1000000000;
int count;
int DFS(int i, int j) {
mem[i][j] = true;
while (bill[i][j] == 1 && bill[i][j + 1] == 1)
j++;
while (bill[i][j] == 2)
j--;
if (j >= n - 1)
... | [["-", 51, 16, 31, 69, 28, 69, 341, 342, 0, 13], ["+", 51, 16, 31, 69, 28, 69, 341, 342, 0, 13]] | 1 | 329 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> PP;
void solve() {
int n;
while (cin >> n, n) {
vector<vector<int>> Buil(2, vector<int>(n + 2));
for (int i = 0; i < 2; ++i) {
for (int j... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> PP;
void solve() {
int n;
while (cin >> n, n) {
vector<vector<int>> Buil(2, vector<int>(n + 2));
for (int i = 0; i < 2; ++i) {
for (int j... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 459 | 2 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 1 << 20
struct node {
int kind, h, step;
node() { this->kind = this->h = this->step = 0; }
node(int kind, int h, int step) : kind(kind), h(h), step(step) {}
};
int main() {
int H;
while (cin >> H, H) {
vector<vect... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 1 << 20
struct node {
int kind, h, step;
node() { this->kind = this->h = this->step = 0; }
node(int kind, int h, int step) : kind(kind), h(h), step(step) {}
};
int main() {
int H;
while (cin >> H, H) {
vector<vect... | [["-", 0, 57, 64, 52, 15, 339, 51, 16, 17, 79], ["+", 0, 57, 64, 52, 15, 339, 51, 16, 17, 60], ["-", 64, 9, 0, 52, 15, 339, 51, 16, 17, 79], ["+", 64, 9, 0, 52, 15, 339, 51, 16, 17, 60]] | 1 | 510 | 4 |
#include <iostream>
using namespace std;
int main() {
int m[100], a[100], b[100], c[200];
int i, j, s, n, f;
while (1) {
cin >> n;
if (n == 0)
break;
f = 0;
for (i = 0; i < n; i++) {
cin >> m[i] >> a[i] >> b[i];
c[2 * i] = a[i];
c[2 * i + 1] = b[i];
}
for (i = 0; i ... | #include <iostream>
using namespace std;
int main() {
int m[100], a[100], b[100], c[200];
int i, j, s, n, f;
while (1) {
cin >> n;
if (n == 0)
break;
f = 0;
for (i = 0; i < n; i++) {
cin >> m[i] >> a[i] >> b[i];
c[2 * i] = a[i];
c[2 * i + 1] = b[i];
}
for (i = 0; i ... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19]] | 1 | 237 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> vec;
int N, x[1000], y[1000], w[1000];
int main() {
while (true) {
vec.clear();
cin >> N;
if (N == 0) {
break;
}
for (int i = 0; i < N; i++) {
cin >> w[i] >> x[i] >> y[i];
int ok1 = 1, ok2... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> vec;
int N, x[1000], y[1000], w[1000];
int main() {
while (true) {
vec.clear();
cin >> N;
if (N == 0) {
break;
}
for (int i = 0; i < N; i++) {
cin >> w[i] >> x[i] >> y[i];
int ok1 = 1, ok2... | [["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22]] | 1 | 446 | 2 |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0231
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
//??\???
#define MAX_N 100
#define W_LIM 150
int N;
int main() {
ios::sync_with_stdio(false);
while (cin >> N) {
if (N == 0)
break;
map<... | // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0231
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
//??\???
#define MAX_N 100
#define W_LIM 150
int N;
int main() {
ios::sync_with_stdio(false);
while (cin >> N) {
if (N == 0)
break;
map<... | [["-", 12, 23, 0, 41, 15, 23, 0, 16, 17, 47], ["+", 12, 23, 0, 41, 15, 23, 0, 16, 17, 19]] | 1 | 160 | 2 |
#include <iostream>
using namespace std;
int main() {
int t;
while (cin >> t && t != 0) {
int n;
int sum = 0;
cin >> n;
while (n--) {
int s, f;
cin >> s >> f;
sum += (f - s);
}
if (sum >= t)
cout << "OK" << endl;
else
cout << n - sum << endl;
}
retur... | #include <iostream>
using namespace std;
int main() {
int t;
while (cin >> t && t != 0) {
int n;
int sum = 0;
cin >> n;
while (n--) {
int s, f;
cin >> s >> f;
sum += (f - s);
}
if (sum >= t)
cout << "OK" << endl;
else
cout << t - sum << endl;
}
return... | [["-", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22]] | 1 | 91 | 2 |
#include <stdio.h>
int main(void) {
int n, t, i, k, h, x, w;
w = 0;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
scanf("%d", &t);
for (i = 0; i < t; i++) {
scanf("%d %d", &k, &h);
w += h - k;
}
if (n >= w) {
printf("OK\n");
} else {
x = n - w;
pri... | #include <stdio.h>
int main(void) {
int n, t, i, k, h, x, w;
w = 0;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
scanf("%d", &t);
for (i = 0; i < t; i++) {
scanf("%d %d", &k, &h);
w += h - k;
}
if (n <= w) {
printf("OK\n");
} else {
x = n - w;
pri... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 138 | 2 |
#include <iostream>
using namespace std;
int main() {
int t, n, s, f, sum;
while (cin >> t && t) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s >> f;
sum += (f - s);
}
if (sum >= t) {
cout << "OK" << endl;
} else {
cout << t - sum << endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int t, n, s, f, sum;
while (cin >> t && t) {
cin >> n;
sum = 0;
for (int i = 0; i < n; i++) {
cin >> s >> f;
sum += (f - s);
}
if (sum >= t) {
cout << "OK" << endl;
} else {
cout << t - sum << endl;
}
}
... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 97 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 185 | 2 |
#include <iostream>
using namespace std;
int main(void) {
while (true) {
int n, m, p;
p = 0;
cin >> n;
if (n == 0) {
break;
}
cin >> m;
while (m > 0) {
int s, q;
cin >> s >> q;
p += q - s;
m--;
}
if (p >= n) {
cout << "OK" << endl;
} else {
... | #include <iostream>
using namespace std;
int main(void) {
while (true) {
int n, m, p;
p = 0;
cin >> n;
if (n == 0) {
break;
}
cin >> m;
while (m > 0) {
int s, q;
cin >> s >> q;
p += q - s;
m--;
}
if (p >= n) {
cout << "OK" << endl;
} else {
... | [["+", 75, 76, 0, 9, 0, 1, 0, 16, 17, 151], ["+", 75, 76, 0, 9, 0, 1, 0, 16, 12, 22]] | 1 | 104 | 2 |
#include <stdio.h>
int main() {
int s, f, t, total;
int i, j, n;
scanf("%d", &t);
while (t != 0) {
//初期化
total = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &s, &f);
total += f - s;
}
if (total < t)
printf("%d\n", t - total);
else
printf("N... | #include <stdio.h>
int main() {
int s, f, t, total;
int i, j, n;
scanf("%d", &t);
while (t != 0) {
//初期化
total = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &s, &f);
total += f - s;
}
if (total < t)
printf("%d\n", t - total);
else
printf("O... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 131 | 2 |
#include <iostream>
using namespace std;
int main() {
int t, n, s, f, cnt;
while (true) {
cin >> t;
if (t == 0)
break;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s >> f;
cnt += f - s;
}
if (cnt >= t)
cout << "OK" << endl;
else
cout << t - cnt << endl;
... | #include <iostream>
using namespace std;
int main() {
int t, n, s, f, cnt;
while (true) {
cin >> t;
cnt = 0;
if (t == 0)
break;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s >> f;
cnt += f - s;
}
if (cnt >= t)
cout << "OK" << endl;
else
cout << t - c... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 99 | 4 |
#include <iostream>
using namespace std;
int d, n, s, t, sum;
int main() {
while (cin >> d >> n, d) {
sum = 0;
for (int i = 0; i < n; i++) {
cin >> s >> t;
sum += t - s;
}
if (sum < d)
cout << sum - d << endl;
else
cout << "OK" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int d, n, s, t, sum;
int main() {
while (cin >> d >> n, d) {
sum = 0;
for (int i = 0; i < n; i++) {
cin >> s >> t;
sum += t - s;
}
if (sum < d)
cout << d - sum << endl;
else
cout << "OK" << endl;
}
return 0;
} | [["-", 64, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["-", 64, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 64, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 64, 1, 0, 16, 31, 16, 12, 16, 12, 22]] | 1 | 93 | 4 |
import java.io.*;
import java.util.*;
public class Main {
static void solve(FastScanner in, PrintWriter out, Methods ms) {
while (true) {
int n = in.nextInt();
if (n == 0)
return;
Food[] food = new Food[n];
for (int i = 0; i < n; i++) {
food[i] =
new Food(in... | import java.io.*;
import java.util.*;
public class Main {
static void solve(FastScanner in, PrintWriter out, Methods ms) {
while (true) {
int n = in.nextInt();
if (n == 0)
return;
Food[] food = new Food[n];
for (int i = 0; i < n; i++) {
food[i] =
new Food(in... | [["-", 0, 16, 31, 16, 31, 16, 31, 16, 17, 18], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 17, 19], ["-", 0, 16, 31, 16, 31, 16, 12, 16, 17, 18], ["+", 0, 16, 31, 16, 31, 16, 12, 16, 17, 19], ["-", 15, 15, 0, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 15, 0, 16, 31, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 15, 0, 16, 12, 16, 17, 18]... | 3 | 1,303 | 8 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
while (scan.hasNext()) {
int n = Integer.parseInt(scan.nextLine());
if (n == 0) {
break;
}
String[] str[] = new String[n + 1][];
for (int i = 0; i... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
while (scan.hasNext()) {
int n = Integer.parseInt(scan.nextLine());
if (n == 0) {
break;
}
String[] str[] = new String[n + 1][];
for (int i = 0; i... | [["-", 8, 196, 0, 503, 49, 200, 51, 518, 0, 499], ["+", 8, 196, 0, 503, 49, 200, 51, 518, 0, 499]] | 3 | 315 | 2 |
import java.util.*;
public class Main {
Scanner in = new Scanner(System.in);
public static void main(String[] args) { new Main(); }
public Main() { new AOJ0239(); }
class AOJ0239 {
public AOJ0239() {
while (true) {
int n = in.nextInt();
if (n == 0)
break;
ArrayList<... | import java.util.*;
public class Main {
Scanner in = new Scanner(System.in);
public static void main(String[] args) { new Main(); }
public Main() { new AOJ0239(); }
class AOJ0239 {
public AOJ0239() {
while (true) {
int n = in.nextInt();
if (n == 0)
break;
ArrayList<... | [["+", 0, 11, 12, 16, 31, 16, 31, 16, 17, 48], ["+", 0, 11, 12, 16, 31, 16, 31, 16, 12, 499], ["+", 0, 11, 12, 16, 31, 16, 12, 16, 17, 48], ["+", 0, 11, 12, 16, 31, 16, 12, 16, 12, 499], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 17, 48], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 12, 499]] | 3 | 354 | 6 |
#include <stdio.h>
int main(void) {
int n;
int i[1001], p[1001], q[1001], r[1001], c[1001];
int P, Q, R, C;
int j, flg;
scanf("%d", &n);
while (n != 0) {
flg = 0;
for (j = 0; j < n; j++) {
scanf("%d %d %d %d", &i[j], &p[j], &q[j], &r[j]);
c[j] = p[j] * 4 + q[j] * 9 + r[j] * 4;
}
... | #include <stdio.h>
int main(void) {
int n;
int i[1001], p[1001], q[1001], r[1001], c[1001];
int P, Q, R, C;
int j, flg;
scanf("%d", &n);
while (n != 0) {
flg = 0;
for (j = 0; j < n; j++) {
scanf("%d %d %d %d", &i[j], &p[j], &q[j], &r[j]);
c[j] = p[j] * 4 + q[j] * 9 + r[j] * 4;
}
... | [["-", 0, 16, 31, 16, 31, 16, 31, 16, 17, 18], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 17, 19], ["-", 0, 16, 31, 16, 31, 16, 12, 16, 17, 18], ["+", 0, 16, 31, 16, 31, 16, 12, 16, 17, 19], ["-", 15, 23, 0, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 23, 0, 16, 31, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 18]... | 0 | 258 | 8 |
#include <stdio.h>
int main() {
int n, id[1000], p[1000], q[1000], r[1000], P, Q, R, c[1000], C, i, a;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &id[i], &p[i], &q[i], &r[i]);
c[i] = (p[i] + r[i]) * 4 + q[i] * 9;
}
scanf("%d %... | #include <stdio.h>
int main() {
int n, id[1000], p[1000], q[1000], r[1000], P, Q, R, c[1000], C, i, a;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &id[i], &p[i], &q[i], &r[i]);
c[i] = (p[i] + r[i]) * 4 + q[i] * 9;
}
scanf("%d %... | [["-", 0, 16, 31, 16, 31, 16, 31, 16, 17, 47], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 17, 20], ["-", 0, 16, 31, 16, 31, 16, 12, 16, 17, 47], ["+", 0, 16, 31, 16, 31, 16, 12, 16, 17, 20], ["-", 15, 23, 0, 16, 31, 16, 12, 16, 17, 47], ["+", 15, 23, 0, 16, 31, 16, 12, 16, 17, 20], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 47]... | 0 | 246 | 8 |
#include <stdio.h>
int main() {
int n, i, f, a[1010], b[1010], c[1010], d[1010], l[4];
while (scanf("%d", &n), n) {
for (i = 0; i < n; i++)
scanf("%d %d %d %d", &a[i], &b[i], &c[i], &d[i]);
for (i = 0; i < 4; i++)
scanf("%d", &l[i]);
for (i = f = 0; i < n; i++) {
if (b[i] > l[0] || c[i... | #include <stdio.h>
int main() {
int n, i, f, a[1010], b[1010], c[1010], d[1010], l[4];
while (scanf("%d", &n), n) {
for (i = 0; i < n; i++)
scanf("%d %d %d %d", &a[i], &b[i], &c[i], &d[i]);
for (i = 0; i < 4; i++)
scanf("%d", &l[i]);
for (i = f = 0; i < n; i++) {
if (b[i] > l[0] || c[i... | [["-", 15, 23, 0, 16, 31, 16, 12, 16, 12, 13], ["+", 15, 23, 0, 16, 31, 16, 12, 16, 12, 13]] | 0 | 243 | 2 |
#include <stdio.h>
int main(void) {
int y, i, n, d[1024][4] = {0}, p, q, r, c;
while (scanf("%d", &n), n != 0) {
for (i = 1; i <= n; i++) {
scanf("%d%d%d%d", &d[i][0], &d[i][1], &d[i][2], &d[i][3]);
}
scanf("%d%d%d%d", &p, &q, &r, &c);
y = 1;
for (i = 1; i <= n; i++) {
if (d[i][1] <... | #include <stdio.h>
int main(void) {
int y, i, n, d[1024][4] = {0}, p, q, r, c;
while (scanf("%d", &n), n != 0) {
for (i = 1; i <= n; i++) {
scanf("%d%d%d%d", &d[i][0], &d[i][1], &d[i][2], &d[i][3]);
}
scanf("%d%d%d%d", &p, &q, &r, &c);
y = 1;
for (i = 1; i <= n; i++) {
if (d[i][1] <... | [["+", 0, 16, 12, 16, 31, 16, 12, 16, 17, 48], ["+", 0, 16, 12, 16, 31, 16, 12, 16, 12, 13]] | 0 | 251 | 2 |
#define _CRT_SECURE_NO_WARNINGS
////#define _USE_MATH_DEFINES
#include <stdio.h>
//#include<stdlib.h>
//#include<math.h>
//#include<string.h>
//#include<time.h>
#define P(type, x) fprintf(stdout, "%" #type "\n", x)
int main() {
int n, d[1000][5], i, p, q, r, f, c;
while (fscanf(stdin, "%d", &n), n) {
f = 1;
... | #define _CRT_SECURE_NO_WARNINGS
////#define _USE_MATH_DEFINES
#include <stdio.h>
//#include<stdlib.h>
//#include<math.h>
//#include<string.h>
//#include<time.h>
#define P(type, x) fprintf(stdout, "%" #type "\n", x)
int main() {
int n, d[1000][5], i, p, q, r, f, c;
while (fscanf(stdin, "%d", &n), n) {
f = 1;
... | [["-", 0, 16, 31, 16, 31, 16, 31, 16, 17, 18], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 17, 19], ["-", 0, 16, 31, 16, 31, 16, 12, 16, 17, 18], ["+", 0, 16, 31, 16, 31, 16, 12, 16, 17, 19], ["-", 15, 23, 0, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 23, 0, 16, 31, 16, 12, 16, 17, 19], ["-", 8, 57, 15, 23, 0, 16, 12, 16, 17, 18]... | 0 | 271 | 8 |
#include <stdio.h>
int main(void) {
for (;;) {
int a[1000], b[1000], c[1000], d[1000], e[1000], f, g, h, i, j, k, l[1000],
n;
j = 0;
scanf("%d", &k);
if (k == 0) {
break;
}
for (n = 1; n <= k; n++) {
scanf("%d %d %d %d", &a[n], &b[n], &c[n], &d[n]);
e[n] = b[n] * 4 + ... | #include <stdio.h>
int main(void) {
for (;;) {
int a[1000], b[1000], c[1000], d[1000], e[1000], f, g, h, i, j, k, l[1000],
n;
j = 0;
scanf("%d", &k);
if (k == 0) {
break;
}
for (n = 1; n <= k; n++) {
scanf("%d %d %d %d", &a[n], &b[n], &c[n], &d[n]);
e[n] = b[n] * 4 + ... | [["-", 0, 16, 31, 16, 31, 16, 31, 16, 17, 18], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 17, 19], ["-", 0, 16, 31, 16, 31, 16, 12, 16, 17, 18], ["+", 0, 16, 31, 16, 31, 16, 12, 16, 17, 19], ["-", 15, 23, 0, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 23, 0, 16, 31, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 18]... | 0 | 286 | 8 |
/*
?????????????????????????????????????¨???? ?????????4
??????
???????????¬??\???????§?????????????????£??????????????????????????????£?????§???????????????????????????
??????????????¬??????????????????????????????????????????????????????????????????????????????????????????
??????????????????????¢???????????????§???... | /*
?????????????????????????????????????¨???? ?????????4
??????
???????????¬??\???????§?????????????????£??????????????????????????????£?????§???????????????????????????
??????????????¬??????????????????????????????????????????????????????????????????????????????????????????
??????????????????????¢???????????????§???... | [["+", 0, 2, 3, 4, 0, 69, 28, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 69, 28, 69, 0, 70], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 2, 3, 4, 0, 69, 28, 69, 0, 73], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 0, 70], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 0, 73... | 0 | 307 | 8 |
#include <stdio.h>
typedef struct {
int no;
int b, c, d;
int cal;
} P;
int main() {
int n, i, flg;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
P tmp[n];
P max;
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &tmp[i].no, &tmp[i].b, &tmp[i].c, &tmp[i].d);
tmp[i].cal = (t... | #include <stdio.h>
typedef struct {
int no;
int b, c, d;
int cal;
} P;
int main() {
int n, i, flg;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
P tmp[n];
P max;
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &tmp[i].no, &tmp[i].b, &tmp[i].c, &tmp[i].d);
tmp[i].cal = (t... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13]] | 0 | 285 | 2 |
#include <stdio.h>
int main() {
int n, f[1005][5], i, j, t;
for (; scanf("%d", &n), n;) {
for (i = 0; i <= n; f[i][4] = f[i][1] * 4 + f[i][2] * 9 + f[i][3] * 4, i++)
for (j = 0; j < 4; j++)
scanf("%d", &f[i][j]);
for (i = t = 0; i < n; i++) {
for (j = 1; j < 5 && f[i][j] < f[n][j - 1]; j... | #include <stdio.h>
int main() {
int n, f[1005][5], i, j, t;
for (; scanf("%d", &n), n;) {
for (i = 0; i <= n; f[i][4] = f[i][1] * 4 + f[i][2] * 9 + f[i][3] * 4, i++)
for (j = 0; j < 4; j++)
scanf("%d", &f[i][j]);
for (i = t = 0; i < n; i++) {
for (j = 1; j < 5 && f[i][j] <= f[n][j - 1];)... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 18], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 19], ["+", 8, 9, 0, 7, 8, 9, 0, 7, 0, 25], ["-", 8, 9, 0, 7, 8, 9, 0, 7, 0, 25]] | 0 | 211 | 4 |
#include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int s[n], p[n], q[n], r[n], c[n];
int P, Q, R, C;
for (int i = 0; i < n; i++) {
cin >> s[i] >> p[i] >> q[i] >> r[i];
c[i] = 4 * p[i] + 9 * q[i] + 4 * r[i];
}
cin ... | #include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int s[n], p[n], q[n], r[n], c[n];
int P, Q, R, C;
for (int i = 0; i < n; i++) {
cin >> s[i] >> p[i] >> q[i] >> r[i];
c[i] = 4 * p[i] + 9 * q[i] + 4 * r[i];
}
cin ... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 151], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19]] | 1 | 224 | 2 |
#include <iostream>
using namespace std;
int f(int a, int b, int c) { return (a * c) * 4 + b * 9; }
int I[1000], a[1000], b[1000], c[1000];
int P, Q, R, C;
main() {
int n;
while (cin >> n, n) {
for (int i = 0; i < n; i++)
cin >> I[i] >> a[i] >> b[i] >> c[i];
cin >> P >> Q >> R >> C;
int cnt = 0;
... | #include <iostream>
using namespace std;
int f(int a, int b, int c) { return (a + c) * 4 + b * 9; }
int I[1000], a[1000], b[1000], c[1000];
int P, Q, R, C;
main() {
int n;
while (cin >> n, n) {
for (int i = 0; i < n; i++)
cin >> I[i] >> a[i] >> b[i] >> c[i];
cin >> P >> Q >> R >> C;
int cnt = 0;
... | [["-", 0, 16, 31, 16, 31, 23, 0, 16, 17, 48], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 17, 72]] | 1 | 230 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, i[1000], p[1000], q[1000], r[1000];
int P, Q, R, C, count;
while (cin >> n && n != 0) {
count = 0;
for (int j = 0; j < n; j++) {
cin >> i[j] >> p[j] >> q[j] >> r[j];
}
cin >> P >> Q >> R >> C;
for (int j = 0; j < n; j++) {
... | #include <iostream>
using namespace std;
int main() {
int n, i[1000], p[1000], q[1000], r[1000];
int P, Q, R, C, count;
while (cin >> n && n != 0) {
count = 0;
for (int j = 0; j < n; j++) {
cin >> i[j] >> p[j] >> q[j] >> r[j];
}
cin >> P >> Q >> R >> C;
for (int j = 0; j < n; j++) {
... | [["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 209 | 3 |
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
const int MAX = 10000100;
int main(void) {
int n;
while (cin >> n, n) {
vector<vector<int>> vec(n + 1, vector<int>(5));
for (int i = 0; i < n + 1; i++) {
... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
const int MAX = 10000100;
int main(void) {
int n;
while (cin >> n, n) {
vector<vector<int>> vec(n + 1, vector<int>(5));
for (int i = 0; i < n + 1; i++) {
... | [["-", 0, 1, 0, 11, 12, 16, 12, 16, 12, 13], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 12, 13]] | 1 | 251 | 2 |
#include <stdio.h>
int main() {
int N;
int p, q, r, c;
while (1) {
int n[1002][6] = {};
scanf("%d", &N);
if (N == 0)
break;
for (int i = 0; i < N; i++) {
scanf("%d %d %d %d", &n[i][0], &n[i][1], &n[i][2], &n[i][3]);
n[i][4] = 4 * n[i][1] + 7 * n[i][2] + 4 * n[i][3];
}
... | #include <stdio.h>
int main() {
int N;
int p, q, r, c;
while (1) {
int n[1024][6] = {};
scanf("%d", &N);
if (N == 0)
break;
for (int i = 0; i < N; i++) {
scanf("%d %d %d %d", &n[i][0], &n[i][1], &n[i][2], &n[i][3]);
n[i][4] = 4 * n[i][1] + 9 * n[i][2] + 4 * n[i][3];
}
... | [["-", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["-", 0, 11, 12, 16, 31, 16, 12, 16, 31, 13], ["+", 0, 11, 12, 16, 31, 16, 12, 16, 31, 13]] | 1 | 274 | 4 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | [["+", 51, 16, 12, 16, 31, 16, 12, 16, 17, 48], ["+", 51, 16, 12, 16, 31, 16, 12, 16, 12, 13]] | 1 | 268 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
while (cin >> n, n) {
int I[n], p[n], q[n], r[n], cnt = 0;
for (int i = 0; i < n; i++) {
cin >> I[i] >> p[i] >> q[i] >> r[i];
}
int P, Q, R, C;
cin >> P >> Q >> R >> C;
for (int i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
while (cin >> n, n) {
int I[n], p[n], q[n], r[n], cnt = 0;
for (int i = 0; i < n; i++) {
cin >> I[i] >> p[i] >> q[i] >> r[i];
}
int P, Q, R, C;
cin >> P >> Q >> R >> C;
for (int i = 0; i < n; i++) ... | [["+", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["+", 0, 16, 31, 16, 12, 69, 341, 342, 0, 70], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 69, 341, 342, 0, 73]] | 1 | 217 | 5 |
#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 FOR(I, F, N) for (int I = F; I < (int... | #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 FOR(I, F, N) for (int I = F; I < (int... | [["-", 51, 16, 31, 16, 31, 16, 31, 16, 17, 18], ["+", 51, 16, 31, 16, 31, 16, 31, 16, 17, 19], ["-", 51, 16, 31, 16, 31, 16, 12, 16, 17, 18], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 17, 19], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 1... | 1 | 390 | 8 |
#include <stdio.h>
int main(void) {
int a, s[1001], d[1001], f[1001], g[1001], h[1001], i, j;
scanf("%d", &a);
while (a != 0) {
j = 0;
for (i = 1; i <= a + 1; i++) {
scanf("%d %d %d %d", &s[i], &d[i], &f[i], &g[i]);
h[i] = 4 * d[i] + 9 * f[i] + g[i] * 4;
}
for (i = 1; i <= a; i++) {
... | #include <stdio.h>
int main(void) {
int a, s[1001], d[1001], f[1001], g[1001], h[1001], i, j;
scanf("%d", &a);
while (a != 0) {
j = 0;
for (i = 1; i <= a + 1; i++) {
scanf("%d %d %d %d", &s[i], &d[i], &f[i], &g[i]);
h[i] = 4 * d[i] + 9 * f[i] + g[i] * 4;
}
for (i = 1; i <= a; i++) {
... | [["-", 51, 16, 31, 16, 31, 16, 31, 16, 17, 18], ["+", 51, 16, 31, 16, 31, 16, 31, 16, 17, 19], ["-", 51, 16, 31, 16, 31, 16, 12, 16, 17, 18], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 17, 19], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 1... | 1 | 250 | 42 |
#include <cstdio>
int p[1000][4], q[4];
int main() {
int n;
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < 4; j++) {
scanf("%d", &p[i][j]);
}
}
for (int i = 0; i < 4; i++) {
scanf("%d", &q[i]);
}
bool NA = 1;
for (int i = 0; i < n; i+... | #include <cstdio>
int p[1000][4], q[4];
int main() {
int n;
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < 4; j++) {
scanf("%d", &p[i][j]);
}
}
for (int i = 0; i < 4; i++) {
scanf("%d", &q[i]);
}
bool NA = 1;
for (int i = 0; i < n; i+... | [["-", 51, 16, 12, 16, 12, 69, 28, 69, 28, 22], ["-", 12, 16, 12, 69, 28, 69, 341, 342, 0, 70], ["-", 12, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["-", 12, 16, 12, 69, 28, 69, 341, 342, 0, 73], ["+", 15, 339, 51, 16, 12, 16, 12, 69, 28, 22]] | 1 | 257 | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
int num[1000], p[1000], q[1000], r[1000];
for (int i = 0; i < N; i++)
cin >> num[i] >> p[i] >> q[i] >> r[i];
int P, Q, R, C;
cin >> P >> Q >> R >> C;
bool NA = true;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
int num[1000], p[1000], q[1000], r[1000];
for (int i = 0; i < N; i++)
cin >> num[i] >> p[i] >> q[i] >> r[i];
int P, Q, R, C;
cin >> P >> Q >> R >> C;
bool NA = true;
for (int i = 0; i < N; i++) {
... | [["+", 51, 16, 12, 16, 31, 16, 12, 16, 17, 48], ["+", 51, 16, 12, 16, 31, 16, 12, 16, 12, 13]] | 1 | 196 | 2 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string... | [["-", 0, 43, 49, 50, 51, 16, 31, 16, 17, 72], ["+", 49, 50, 51, 16, 31, 16, 12, 16, 17, 48]] | 1 | 267 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i+... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i+... | [["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13], ["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 21], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 21], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13]] | 1 | 432 | 4 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug ... | [["-", 51, 16, 31, 16, 31, 16, 31, 16, 17, 18], ["+", 51, 16, 31, 16, 31, 16, 31, 16, 17, 19], ["-", 51, 16, 31, 16, 31, 16, 12, 16, 17, 18], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 17, 19], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 1... | 1 | 300 | 8 |
#include <stdio.h>
int main(void) {
int flg, a[1000], b[1000], c[1000], d[1000], A, B, C, D, n, i, x[1000];
while (1) {
flg = 0;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &a[i], &b[i], &c[i], &d[i]);
x[i] = 4 * b[i] + 9 * c[i] + 4 * d[i];
... | #include <stdio.h>
int main(void) {
int flg, a[1000], b[1000], c[1000], d[1000], A, B, C, D, n, i, x[1000];
while (1) {
flg = 0;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &a[i], &b[i], &c[i], &d[i]);
x[i] = 4 * b[i] + 9 * c[i] + 4 * d[i];
... | [["+", 0, 1, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 73]] | 1 | 251 | 5 |
#include <stdio.h>
int main(void) {
int n, j, i[1000], p[100], q[100], r[100], p2, q2, r2, c, flg, x[1000], cnt;
while (1) {
cnt = 0;
flg = 0;
scanf("%d", &n);
if (n == 0)
break;
for (j = 0; j < n; j++) {
scanf("%d %d %d %d", &i[j], &p[j], &q[j], &r[j]);
}
scanf("%d %d %d %d"... | #include <stdio.h>
int main(void) {
int n, j, i[1000], p[1000], q[1000], r[1000], p2, q2, r2, c, flg, x[1000],
cnt;
while (1) {
cnt = 0;
flg = 0;
scanf("%d", &n);
if (n == 0)
break;
for (j = 0; j < n; j++) {
scanf("%d %d %d %d", &i[j], &p[j], &q[j], &r[j]);
}
scanf("%d ... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 12, 16, 31, 16, 31, 16, 12, 16, 17, 48], ["+", 12, 16, 31, 16, 31, 16, 12, 16, 12, 13]] | 1 | 276 | 8 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int i[1000], p[1000], q[1000], r[1000];
int P, Q, R, C;
bool flg = false;
for (int j = 0; j < n; j++) {
cin >> i[j] >> p[j] >> q[j] >> r[j];
}
cin >> P >> Q >> R >> C;
for (int j = 0; j < n; j++) ... | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int i[1000], p[1000], q[1000], r[1000];
int P, Q, R, C;
bool flg = false;
for (int j = 0; j < n; j++) {
cin >> i[j] >> p[j] >> q[j] >> r[j];
}
cin >> P >> Q >> R >> C;
for (int j = 0; j < n; j++) ... | [["-", 51, 16, 31, 16, 31, 16, 31, 16, 17, 18], ["+", 51, 16, 31, 16, 31, 16, 31, 16, 17, 19], ["-", 51, 16, 31, 16, 31, 16, 12, 16, 17, 18], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 17, 19], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 19], ["-", 15, 339, 51, 16, 12, 23, 0, 1... | 1 | 206 | 8 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
while (cin >> a, a) {
vector<vector<int>> l(a);
for (int b = 0; b < a; b++) {
vector<int> r(4);
cin >> r[0] >> r[1] >> r[2] >> r[3];
l[b] = r;
}
vector<int> o(4);
cin >> o[0] >> o[... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
while (cin >> a, a) {
vector<vector<int>> l(a);
for (int b = 0; b < a; b++) {
vector<int> r(4);
cin >> r[0] >> r[1] >> r[2] >> r[3];
l[b] = r;
}
vector<int> o(4);
cin >> o[0] >> o[... | [["+", 51, 16, 12, 16, 31, 16, 12, 16, 17, 48], ["+", 51, 16, 12, 16, 31, 16, 12, 16, 12, 13]] | 1 | 272 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int i[1000], p[1000], q[1000], r[1000];
int main() {
int n;
while (cin >> n, n) {
vector<int> v;
rep(j, n) { cin >> i[j] >> p[j] >> q[j] >> r[j]; }
int P, Q, R, C;
cin >> P >> Q >> R >> ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int i[1000], p[1000], q[1000], r[1000];
int main() {
int n;
while (cin >> n, n) {
vector<int> v;
rep(j, n) { cin >> i[j] >> p[j] >> q[j] >> r[j]; }
int P, Q, R, C;
cin >> P >> Q >> R >> ... | [["-", 51, 16, 31, 16, 31, 16, 12, 16, 12, 22], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 338, 49, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 338, 49, 22], ["-", 0, 338, 8, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 338, 8, 1, 0, 16, 31, 16, 12, 22]] | 1 | 206 | 6 |
#include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
struct Sweets {
Sweets() { id = protein = lipid = carbo = 0; }
Sweets(int arg_id, int arg_protein, int arg_lipid, int arg_carbo) {
id = arg_id;
protein = arg_protein;
lipid = arg_lipid;
carbo = arg_carbo;
}
int id,... | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
struct Sweets {
Sweets() { id = protein = lipid = carbo = 0; }
Sweets(int arg_id, int arg_protein, int arg_lipid, int arg_carbo) {
id = arg_id;
protein = arg_protein;
lipid = arg_lipid;
carbo = arg_carbo;
}
int id,... | [["-", 51, 16, 12, 16, 31, 16, 12, 16, 31, 13], ["+", 51, 16, 12, 16, 31, 16, 12, 16, 31, 13]] | 1 | 309 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int a[n + 1][5], p = 0;
r(i, n + 1) {
cin >> a[i][0] >> a[i][1] >> a[i][2] >> a[i][3];
a[i][4] = a[i][1] * 4 + a[i][2] * 7 + a[i][3] * 4;
}
r(i, n) {
... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int a[n + 1][5], p = 0;
r(i, n + 1) {
cin >> a[i][0] >> a[i][1] >> a[i][2] >> a[i][3];
a[i][4] = a[i][1] * 4 + a[i][2] * 9 + a[i][3] * 4;
}
r(i, n) {
... | [["-", 0, 11, 12, 16, 31, 16, 12, 16, 12, 13], ["+", 0, 11, 12, 16, 31, 16, 12, 16, 12, 13]] | 1 | 235 | 2 |
#include <stdio.h>
int main(void) {
int n, s[1000], i, p[1000], q[1000], r[1000], c[1000];
int P, Q, R, C, j;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &s[i], &p[i], &q[i], &r[i]);
c[i] = p[i] * 4 + q[i] * 9 + 4 * r[i];
... | #include <stdio.h>
int main(void) {
int n, s[1000], i, p[1000], q[1000], r[1000], c[1000];
int P, Q, R, C, j;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &s[i], &p[i], &q[i], &r[i]);
c[i] = p[i] * 4 + q[i] * 9 + 4 * r[i];
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 253 | 2 |
#include <stdio.h>
int main() {
int i, n, s[1024], p[1024], q[1024], r[1024], Q, R, P, C, m;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d%d%d%d", &s[i], &p[i], &q[i], &r[i]);
}
scanf("%d%d%d%d", &P, &Q, &R, &C);
m = 1;
for (i = 0... | #include <stdio.h>
int main() {
int i, n, s[1024], p[1024], q[1024], r[1024], Q, R, P, C, m;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d%d%d%d", &s[i], &p[i], &q[i], &r[i]);
}
scanf("%d%d%d%d", &P, &Q, &R, &C);
m = 1;
for (i = 0... | [["-", 12, 16, 31, 16, 12, 16, 12, 69, 28, 22], ["+", 12, 16, 31, 16, 12, 16, 12, 69, 28, 22]] | 1 | 235 | 2 |
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct food {
int p, q, r, id;
food(int p_, int q_, int r_, int id_) {
p = p_;
q = q_;
r = r_;
id = id_;
}
food() { p = q = r = id = 0; }
int cal() { return p * 4 + q * 9 + r * 4; }
};
int main() {
int n;
while (ci... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
struct food {
int p, q, r, id;
food(int p_, int q_, int r_, int id_) {
p = p_;
q = q_;
r = r_;
id = id_;
}
food() { p = q = r = id = 0; }
int cal() { return p * 4 + q * 9 + r * 4; }
};
int main() {
int n;
while (ci... | [["-", 51, 16, 31, 16, 31, 16, 31, 16, 17, 18], ["+", 51, 16, 31, 16, 31, 16, 31, 16, 17, 19], ["-", 51, 16, 31, 16, 31, 16, 12, 16, 17, 18], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 17, 19], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 1... | 1 | 282 | 8 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
int num[1001], p[1001], q[1001], r[1001], cal[1001];
while (cin >> n, n) {
for (int i = 0; i < 1001; i++) {
num[i] = p[i] = q[i] = r[i] = cal[i] = 0;
}
for (int i = 0; i < n; ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
int num[1001], p[1001], q[1001], r[1001], cal[1001];
while (cin >> n, n) {
for (int i = 0; i < 1001; i++) {
num[i] = p[i] = q[i] = r[i] = cal[i] = 0;
}
for (int i = 0; i < n; ... | [["+", 0, 11, 12, 16, 31, 16, 31, 16, 17, 48], ["+", 0, 11, 12, 16, 31, 16, 31, 16, 12, 13], ["+", 0, 11, 12, 16, 31, 16, 12, 16, 17, 48], ["+", 0, 11, 12, 16, 31, 16, 12, 16, 12, 13], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 17, 48], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 12, 13]] | 1 | 258 | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.