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>
int main(void) {
double w;
while (scanf("%lf", &w) != EOF) {
if (w <= 48.00) {
printf("light fly\n");
} else if (w > 48.00 && w <= 51.00) {
puts("fly");
} else if (w > 51.00 && w <= 54.00) {
puts("bantam");
} else if (w > 54.00 && w <= 57.00) {
puts("feat... | #include <stdio.h>
int main(void) {
double w;
while (scanf("%lf", &w) != EOF) {
if (w <= 48.00) {
printf("light fly\n");
} else if (w > 48.00 && w <= 51.00) {
puts("fly");
} else if (w > 51.00 && w <= 54.00) {
puts("bantam");
} else if (w > 54.00 && w <= 57.00) {
puts("feat... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19]] | 1 | 233 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(i... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 305 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int dp[1001][1001];
vector<string> split(const string &str, char delim) {
vector<string> res;
size_t current = 0, found;
while ((fo... | #include <algorithm>
#include <iostream>
#include <map>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int dp[1001][1001];
vector<string> split(const string &str, char delim) {
vector<string> res;
size_t current = 0, found;
while ((fo... | [["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151]] | 1 | 424 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int dataset = 1, w;
while (cin >> w, w) {
int dp[1001], n, treas_val[1000], treas_w[1000], ans_val = 0, ans_w;
for (int i = 0; i <= w; i++) {
dp[i] = -1;
}
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d,%d", ... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int dataset = 1, w;
while (cin >> w, w) {
int dp[1001], n, treas_val[1000], treas_w[1000], ans_val = 0, ans_w;
for (int i = 0; i <= w; i++) {
dp[i] = -1;
}
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d,%d", ... | [["+", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 277 | 3 |
#include <cstdio>
#include <iostream>
using namespace std;
const int INF = -1;
int main() {
int W, cnt = 0;
while (cin >> W, W) {
cnt++;
int dp[1001], n;
cin >> n;
for (int i = 0; i < 1001; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; i++) {
int v, w;
scanf("%d,%d"... | #include <cstdio>
#include <iostream>
using namespace std;
const int INF = -1;
int main() {
int W, cnt = 0;
while (cin >> W, W) {
cnt++;
int dp[1001], n;
cin >> n;
for (int i = 0; i < 1001; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; i++) {
int v, w;
scanf("%d,%d"... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 264 | 2 |
#include <stdio.h>
int main() {
int price[1000], weight[1000];
int weight_MAX;
int treasure;
int i, j;
int ans_p, ans_w, time;
int dp[10000];
time = 1;
scanf("%d", &weight_MAX);
while (weight_MAX != 0) {
scanf("%d", &treasure);
for (i = 0; i < treasure; i++) {
scanf("%d,%d", &price... | #include <stdio.h>
int main() {
int price[1000], weight[1000];
int weight_MAX;
int treasure;
int i, j;
int ans_p, ans_w, time;
int dp[10000];
time = 1;
scanf("%d", &weight_MAX);
while (weight_MAX != 0) {
scanf("%d", &treasure);
for (i = 0; i < treasure; i++) {
scanf("%d,%d", &price... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 287 | 6 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
int dp[2000][2000];
int main() {
int W;
int n;
int c = 0;
while (cin >> W) {
... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
int dp[2000][2000];
int main() {
int W;
int n;
int c = 0;
while (cin >> W) {
... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 369 | 3 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int W, N;
int dp[1001][1001]; // 宝の数×重さ
struct Obj {
int price;
int weight;
} obj[1001];
int main(void) {
int cnt = 1;
while (cin >> W, W) {
// input
cin >> N;
char buf;
for (int i = 0; i < N; i++... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int W, N;
int dp[1001][1001]; // 宝の数×重さ
struct Obj {
int price;
int weight;
} obj[1001];
int main(void) {
int cnt = 1;
while (cin >> W, W) {
// input
cin >> N;
char buf;
for (int i = 0; i < N; i++... | [["+", 0, 1, 0, 2, 3, 4, 0, 27, 17, 29]] | 1 | 423 | 1 |
#include <bits/stdc++.h>
using namespace std;
#define iota(i, n, b, s) \
for (int i = int(b); i != int((b) + (s) * (n)); i += (s))
#define range(i, n, m) \
iota(i, (((n) > (m)) ? ((n) - (m)) : ((m) - (n)))... | #include <bits/stdc++.h>
using namespace std;
#define iota(i, n, b, s) \
for (int i = int(b); i != int((b) + (s) * (n)); i += (s))
#define range(i, n, m) \
iota(i, (((n) > (m)) ? ((n) - (m)) : ((m) - (n)))... | [["+", 0, 1, 0, 16, 31, 16, 12, 103, 0, 104], ["+", 0, 1, 0, 16, 31, 16, 12, 103, 0, 125], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151]] | 1 | 516 | 4 |
#include <bits/stdc++.h>
using namespace std;
int table[1001];
int main() {
int C;
for (int i = 1; cin >> C, C; ++i) {
for (int k = 0; k < 1001; ++k)
table[k] = -1e9;
table[0] = 0;
int n;
cin >> n;
for (; n--;) {
int v, w;
char comma;
cin >> v >> comma >> w;
for ... | #include <bits/stdc++.h>
using namespace std;
int table[1001];
int main() {
int C;
for (int i = 1; cin >> C, C; ++i) {
for (int k = 0; k < 1001; ++k)
table[k] = -1e9;
table[0] = 0;
int n;
cin >> n;
for (; n--;) {
int v, w;
char comma;
cin >> v >> comma >> w;
for ... | [["-", 0, 1, 0, 2, 3, 4, 0, 27, 17, 29]] | 1 | 213 | 1 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int dp[1001][1001];
int w[1001], v[1001], n, W;
char s;
int k = 1;
while (1) {
cin >> W >> n;
if (W == 0)
break;
for (int i = 0; i < n; i++) {
cin >> v[i] >> s >> w[i];
}
memset(dp, 0,... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int dp[1001][1001];
int w[1001], v[1001], n, W;
char s;
int k = 1;
while (1) {
cin >> W >> n;
if (W == 0)
break;
for (int i = 0; i < n; i++) {
cin >> v[i] >> s >> w[i];
}
memset(dp, 0,... | [["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151]] | 1 | 279 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int cas = 0;
int anskati = 0;
int ansomo;
int w, n;
int kati[1111], omo[1111];
int memo[1111][1111];
while (1) {
cas++;
cin >> w;
if (w == 0)
break;
cin >> n;
for (int i = 0; i <= w; i++)... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int cas = 0;
int anskati = 0;
int ansomo;
int w, n;
int kati[1111], omo[1111];
int memo[1111][1111];
while (1) {
cas++;
anskati = 0;
cin >> w;
if (w == 0)
break;
cin >> n;
for (int i ... | [["+", 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 | 319 | 4 |
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int dp[1001][1001] = {0};
int main() {
int W, N;
int t = 1;
while (cin >> W, W) {
cin >> N;
vector<int> v(N), w(N);
for (int i = 0; i < N; ++i) {
scanf("%d,%d", &v[i], &w[i]);
}
fill(&dp[0][0], &dp[0][0] + 100... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int dp[1001][1001] = {0};
int main() {
int W, N;
int t = 1;
while (cin >> W, W) {
cin >> N;
vector<int> v(N), w(N);
for (int i = 0; i < N; ++i) {
scanf("%d,%d", &v[i], &w[i]);
}
fill(&dp[0][0], &dp[0][0] + 100... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 333 | 6 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int dp[1001][1001];
int n, W;
int v[1000], w[1000];
int num = 0;
char c;
int cnt = 0;
while (1) {
cin >> W;
if (W == 0)
break;
cin >> n;
cnt++;
for (int i = 0; i <= n; i++) {
for (int... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int dp[1001][1001];
int n, W;
int v[1000], w[1000];
int num = 0;
char c;
int cnt = 0;
while (1) {
cin >> W;
if (W == 0)
break;
cin >> n;
cnt++;
for (int i = 0; i <= n; i++) {
for (int... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 332 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int cnt, N, W, value, weight, v[1001][1001], w[1001][1001];
cnt = 0;
while (1) {
cin >> W;
if (W == 0)
break;
cnt++;
cin >> N;
for (int i = 0; i < N; i++) {
for (int j = 0; j < W; j++... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int cnt, N, W, value, weight, v[1001][1001], w[1001][1001];
cnt = 0;
while (1) {
cin >> W;
if (W == 0)
break;
cnt++;
cin >> N;
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= W; j... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 422 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
int main() {
int W, N, cou = 0;
int tr[1001], we[1001];
while (cin >> W, W) {
cou++;
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d,%d", &tr[i], &we[i]);
}
int dp... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
int main() {
int W, N, cou = 0;
int tr[1001], we[1001];
while (cin >> W, W) {
cou++;
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d,%d", &tr[i], &we[i]);
}
int dp... | [["-", 12, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 22]] | 1 | 257 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int dp[1000], w[1000], v[1000], a, n, t = 0;
int main() {
while (cin >> a, a) {
t++;
cin >> n;
fill(dp, dp + a + 1, 0);
for (int i = 0; i < n; i++)
scanf("%d,%d", &v[i], &w[i]);
for (int i = 0; i < n; i++)... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int dp[1000], w[1000], v[1000], a, n, t = 0;
int main() {
while (cin >> a, a) {
t++;
cin >> n;
fill(dp, dp + a + 1, 0);
for (int i = 0; i < n; i++)
scanf("%d,%d", &v[i], &w[i]);
for (int i = 0; i < n; i++)... | [["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 243 | 2 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
int main() {
int W;
int cnt = 0;
while (cin >> W, W) {
int n;
cin ... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
int main() {
int W;
int cnt = 0;
while (cin >> W, W) {
int n;
cin ... | [["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 16, 31, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 16, 31, 16, 31, 16, 12, 16, 12, 13]] | 1 | 285 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const ll MOD = 1000000007;
int n, w;
int t;
int m... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const ll MOD = 1000000007;
int n, w;
int t;
int m... | [["-", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 348 | 6 |
#include <algorithm>
#include <stdio.h>
using namespace std;
int W, N, v[1000], w[1000], dp[1001][1001], c, r;
int main() {
while (~scanf("%d", &W)) {
if (!W)
break;
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d,%d", &w[i], &v[i]);
for (int i = 1; i <= N; i++) {
for (int j =... | #include <algorithm>
#include <stdio.h>
using namespace std;
int W, N, v[1000], w[1000], dp[1001][1001], c, r;
int main() {
while (~scanf("%d", &W)) {
if (!W)
break;
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d,%d", &v[i], &w[i]);
for (int i = 1; i <= N; i++) {
for (int j =... | [["-", 0, 2, 3, 4, 0, 66, 28, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 66, 28, 69, 28, 22]] | 1 | 280 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <utility>
#define N_MAX 1000 // ??????????????° ?????§???
#define W_MAX 1000 // ?¢¨?????????????????????????????? ?????§???
using namespace std;
int dp[N_MAX + 1][W_MAX + 1];
int v[N_MAX + 1], w[N_MAX + 1];
int N, W;
pair<int, int> knapsack() {
i... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <utility>
#define N_MAX 1000 // ??????????????° ?????§???
#define W_MAX 1000 // ?¢¨?????????????????????????????? ?????§???
using namespace std;
int dp[N_MAX + 1][W_MAX + 1];
int v[N_MAX + 1], w[N_MAX + 1];
int N, W;
pair<int, int> knapsack() {
i... | [["+", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 380 | 3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define REPR(i, n) for (ll i = 1; i < n; ++i)
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define DEBUG(x) cout << #x << ": "... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define REPR(i, n) for (ll i = 1; i < n; ++i)
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define DEBUG(x) cout << #x << ": "... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 351 | 3 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#pragma warning(disable : 4996)
#define MAX_N 1200
#define MAX_W 1200
int dp[MAX_N][MAX_W];
int W, N, v[MAX_N], w[MAX_N], cnt;
int main() {
while (true) {
cnt++;
memset(dp, 0, sizeof(dp));
cin >> W;
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#pragma warning(disable : 4996)
#define MAX_N 1200
#define MAX_W 1200
int dp[MAX_N][MAX_W];
int W, N, v[MAX_N], w[MAX_N], cnt;
int main() {
while (true) {
cnt++;
memset(dp, 0, sizeof(dp));
cin >> W;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 351 | 2 |
#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, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 578 | 7 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [["-", 31, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["-", 31, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 31, 22], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 11, 31, 69, 341, 342, 0, ... | 1 | 622 | 8 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include ... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 240 | 2 |
#include <stdio.h>
int a, s, d[1001], f[1001], g[1001][1001], h, z, i, j, x;
int main(void) {
x = 0;
scanf("%d", &a);
while (a != 0) {
x++;
scanf("%d", &s);
for (i = 0; i < s; i++) {
scanf("%d,%d", &d[i], &f[i]);
}
for (i = 0; i <= s; i++) {
for (j = 0; j <= a; j++) {
g[i][... | #include <stdio.h>
int a, s, d[1001], f[1001], g[1001][1001], h, z, i, j, x;
int main(void) {
x = 0;
scanf("%d", &a);
while (a != 0) {
x++;
scanf("%d", &s);
for (i = 0; i < s; i++) {
scanf("%d,%d", &d[i], &f[i]);
}
for (i = 0; i <= s; i++) {
for (j = 0; j <= a; j++) {
g[i][... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 379 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 490 | 1 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int parse(string a) {
int s = 0;
for (char b : a) {
s *= 10;
s += b - 48;
}
return s;
}
vector<int> split(string a) {
vector<int> b;
string c = "";
for (char d : a) {
if (d == ',') {
b.push... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int parse(string a) {
int s = 0;
for (char b : a) {
s *= 10;
s += b - 48;
}
return s;
}
vector<int> split(string a) {
vector<int> b;
string c = "";
for (char d : a) {
if (d == ',') {
b.push... | [["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 382 | 2 |
#include <algorithm>
#include <cstdio>
#include <utility>
using namespace std;
typedef pair<int, int> Pair;
int w;
int n;
int vs[1001];
int ws[1001];
int dp[1001][1001];
int main() {
for (int Case = 1;; Case++) {
scanf("%d", &w);
if (w == 0)
return 0;
scanf("%d", &n);
for (int i = 0; i < n; ... | #include <algorithm>
#include <cstdio>
#include <utility>
using namespace std;
typedef pair<int, int> Pair;
int w;
int n;
int vs[1001];
int ws[1001];
int dp[1001][1001];
int main() {
for (int Case = 1;; Case++) {
scanf("%d", &w);
if (w == 0)
return 0;
scanf("%d", &n);
for (int i = 0; i < n; ... | [["+", 3, 4, 0, 2, 3, 4, 0, 91, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 91, 17, 33]] | 1 | 336 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, W;
int v[1000], w[1000];
for (int cnt = 0;; cnt++) {
cin >> W >> n;
if (!W)
break;
int dp[1001][1001] = {}, ma = 0, mi = 1e+9;
for (int i = 0; i < n; i++) {
scanf("%d,%d", &v[i], &w[i]);
}
dp[0][0] ... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, W;
int v[1000], w[1000];
for (int cnt = 0;; cnt++) {
cin >> W >> n;
if (!W)
break;
int dp[1001][1001] = {}, ma = 0, mi = 1e+9;
for (int i = 0; i < n; i++) {
scanf("%d,%d", &v[i], &w[i]);
}
dp[0][0] ... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 301 | 2 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | [["-", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 447 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define ALL(x) x.begin(), x.end()
template <typename T> bool chmax(T &a, const T &b) {
return a < b ? (a = b, true) : false;
}
template <typename T> bool chmin(T &a, const T &b) {
return b < a ? (a = b, tru... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define ALL(x) x.begin(), x.end()
template <typename T> bool chmax(T &a, const T &b) {
return a < b ? (a = b, true) : false;
}
template <typename T> bool chmin(T &a, const T &b) {
return b < a ? (a = b, tru... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 387 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int mp[1001][1001];
int main() {
int W;
char c;
for (int num = 0; cin >> W && W; num++) {
int v[1001], w[1001], n;
cin >> n;
fill((int *)mp, (int *)(mp + n + 1), 0);
for (int i = 0;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int mp[1001][1001];
int main() {
int W;
char c;
for (int num = 0; cin >> W && W; num++) {
int v[1000], w[1000], n;
cin >> n;
fill((int *)mp, (int *)(mp + n + 1), 0);
for (int i = 0;... | [["-", 0, 7, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 303 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define req(i, r, k) for (int i = k; i < r; i++)
#define rep(i, r) req(i, r, 0)
const long long int INF = 100000000000000;
long long int dp[1001][1001];
int main() {
for (int a = 1; 1; a++) {
int w, n;
scanf(" %d", &w);
if (w == 0)
break;
scanf(... | #include <bits/stdc++.h>
using namespace std;
#define req(i, r, k) for (int i = k; i < r; i++)
#define rep(i, r) req(i, r, 0)
const long long int INF = 100000000000000;
long long int dp[1002][1002];
int main() {
for (int a = 1; 1; a++) {
int w, n;
scanf(" %d", &w);
if (w == 0)
break;
scanf(... | [["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 356 | 10 |
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int MAX_V = 105;
int INF = 1000000000;
int main() {
int n = 1;
int W, N, i, j;
while (cin >> W, W) {
cin >> N;
int dp[... | #include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int MAX_V = 105;
int INF = 1000000000;
int main() {
int n = 1;
int W, N, i, j;
while (cin >> W, W) {
cin >> N;
int dp[... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 314 | 3 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 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, 16, 31, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 432 | 5 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 100000000
#define LINF ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 100000000
#define LINF ... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 509 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(), vec.end()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1234567;
const ll INF = 1000000010;
const ll LINF = 1000000000000000010LL;
const int MAX = 10000010;
const double EPS = 1e-3;
int dx[4] = {0, 1, 0, 1};
int dy[4] = {0,... | #include <bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(), vec.end()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1234567;
const ll INF = 1000000010;
const ll LINF = 1000000000000000010LL;
const int MAX = 10000010;
const double EPS = 1e-3;
int dx[4] = {0, 1, 0, 1};
int dy[4] = {0,... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 453 | 6 |
#include <iostream>
#include <vector>
int main() {
for (int i = 1;; i++) {
int W;
std::cin >> W;
if (W == 0) {
break;
}
int N;
std::cin >> N;
std::vector<std::vector<int>> table(N + 1, std::vector<int>(W + 1, -1));
table[0][0] = 0;
for (int n = 0; n < N; n++) {
int vi, ... | #include <iostream>
#include <vector>
int main() {
for (int i = 1;; i++) {
int W;
std::cin >> W;
if (W == 0) {
break;
}
int N;
std::cin >> N;
std::vector<std::vector<int>> table(N + 1, std::vector<int>(W + 1, -1));
table[0][0] = 0;
for (int n = 0; n < N; n++) {
int vi, ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 17, 151], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 1, 0, ... | 1 | 313 | 8 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 24], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 49, 50, 51, 4, 0, 2, 63, 118, 17, 131], ["-", 49, 50, 51, 4, 0, 2, 63, 118, 119, 120], ["-", 49, 50, 51, 4, 0, 2, 3, 4, 0, 24], ["-", 49, 50, 51, 4, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 25]] | 1 | 352 | 7 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int dp[1005];
int main() {
int n, w, t = 1;
while (scanf("%d", &w), w) {
memset(dp, -1, sizeof(dp));
scanf("%d", &n);
dp[0] = 0;
int v, x;
for (int i = 0; i < n; ++i) {
scanf("%d,%d", &v, &x);
for (int j... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int dp[1005];
int main() {
int n, w, t = 1;
while (scanf("%d", &w), w) {
memset(dp, -1, sizeof(dp));
scanf("%d", &n);
dp[0] = 0;
int v, x;
for (int i = 0; i < n; ++i) {
scanf("%d,%d", &v, &x);
for (int j... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 238 | 6 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int W, N, v, w, i, j;
int cnt = 0, maxv, maxw;
vector<vector<int>> dp;
while (cin >> W >> N, W) {
vector<vector<int>> dp(N + 2, vector<int>(W + 1));
for (i = 1; i <= N; i++) {
scanf("%d,%d", &v, &w);
for (j = 0; j <= W;... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int W, N, v, w, i, j;
int cnt = 0, maxv, maxw;
vector<vector<int>> dp;
while (cin >> W >> N, W) {
vector<vector<int>> dp(N + 2, vector<int>(W + 1));
for (i = 1; i <= N; i++) {
scanf("%d,%d", &v, &w);
for (j = 0; j <= W;... | [["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 261 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [["-", 0, 43, 49, 50, 51, 4, 0, 16, 31, 22], ["-", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["-", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 21], ["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 414 | 6 |
#include <iostream>
using namespace std;
#define SAFE_DELETE(x) \
{ \
if (x) { \
delete x; ... | #include <iostream>
using namespace std;
#define SAFE_DELETE(x) \
{ \
if (x) { \
delete x; ... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22]] | 1 | 766 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> status;
int main() {
int W, N, cnt = 1;
while (true) {
cin >> W;
if (W == 0)
return 0;
cin >> N;
int val[1001], weight[1001];
memset(val, 0, siz... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> status;
int main() {
int W, N, cnt = 1;
while (true) {
cin >> W;
if (W == 0)
return 0;
cin >> N;
int val[1001], weight[1001];
memset(val, 0, siz... | [["-", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 297 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int map[1001], save[1001];
int w, count;
count = 1;
while (cin >> w, w) {
++w;
for (int i = 0; i < w; ++i)
map[i] = save[i] = 0;
int n, value, weight;
cin >> n;
scanf("%d,%d", &value, &weight);
save[we... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int map[1001], save[1001];
int w;
long long count;
count = 1;
while (cin >> w, w) {
++w;
for (int i = 0; i < w; ++i)
map[i] = save[i] = 0;
int n, value, weight;
cin >> n;
scanf("%d,%d", &value, &weight);... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 347 | 7 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 480 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int W, n, v[1000], w[1000], dp[10000][10000], t = 1;
while (cin >> W, W) {
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d,%d", &v[i], &w[i]);
for (int i = 0; i < 1000; i++)
for (int j = 0; j < 1000; j++)
... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int W, n, v[1000], w[1000], dp[1001][1001], t = 1;
while (cin >> W, W) {
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d,%d", &v[i], &w[i]);
for (int i = 0; i < 1000; i++)
for (int j = 0; j < 1000; j++)
... | [["-", 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]] | 1 | 324 | 4 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const int maxw = 1001;
const int maxn = 1001;
const int maxp = 10001;
int dp[maxn][maxw] = {};
int w[maxn] = {};
int p[maxn] = {};
int W, N;
int main() {
int casenum = 0;
while (cin >> ... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const int maxw = 1001;
const int maxn = 1001;
const int maxp = 10001;
int dp[maxn][maxw] = {};
int w[maxn] = {};
int p[maxn] = {};
int W, N;
int main() {
int casenum = 0;
while (cin >> ... | [["-", 0, 7, 8, 57, 15, 339, 51, 16, 17, 18], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 17, 19], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 310 | 4 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int W, N, casenum = 0, ans, wmin;
int v[1000], w[1000];
int dp[1001][1001];
int rec_dp(int, int);
void solve();
int main() {
int i;
char c;
while (1) {
cin >> W >> N;
if (W == 0)
break;
casenum++;
for (i =... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int W, N, casenum = 0, ans, wmin;
int v[1000], w[1000];
int dp[1001][1001];
int rec_dp(int, int);
void solve();
int main() {
int i;
char c;
while (1) {
cin >> W >> N;
if (W == 0)
break;
casenum++;
for (i =... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 327 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
int W, N;
int c[1000], w[1000];
int t[10000 ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
int W, N;
int c[1000], w[1000];
int t[10000 ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 285 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int w, n, tre[1001][2], dp[1001][1001] = {0}, x;
for (int c = 1; cin >> w, w; c++) {
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d,%d", &tre[i][0], &tre[i][1]);
}
for (int i = 1; i <= n; i++) {
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int w, n, tre[1001][2], dp[1001][1001] = {0}, x;
for (int c = 1; cin >> w, w; c++) {
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d,%d", &tre[i][0], &tre[i][1]);
}
for (int i = 1; i <= n; i++) {
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 288 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int tr[1100][2] = {0}, dp[1100][1100] = {0};
int main() {
for (int c = 1;; c++) {
int w, n, ans = 0, q;
cin >> w;
if (w == 0)
break;
cin >> n;
for (int i = 0; i < 1100; i++) {
tr[i][0] = tr[i][1] = 0;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int tr[1100][2] = {0}, dp[1100][1100] = {0};
int main() {
for (int c = 1;; c++) {
int w, n, ans = 0, q;
cin >> w;
if (w == 0)
break;
cin >> n;
for (int i = 0; i < 1100; i++) {
tr[i][0] = tr[i][1] = 0;
... | [["-", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95]] | 1 | 437 | 1 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int W, N, cs = 0;
int cost[1001], weight[1001];
int dp[1001];
while (cin >> W, W) {
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d,%d", &cost[i], &weight[i]);
}
fill(dp, dp ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int W, N, cs = 0;
int cost[1001], weight[1001];
int dp[1001];
while (cin >> W, W) {
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d,%d", &cost[i], &weight[i]);
}
fill(dp, dp ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 259 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int dp[1001][1001];
int main() {
int W, cnt = 1;
while (cin >> W, W) {
int n, v[1000], w[1000];
memset(dp, -1, sizeof(dp));
cin >> n;
rep(i, n) { scanf("... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int dp[1001][1001];
int main() {
int W, cnt = 1;
while (cin >> W, W) {
int n, v[1000], w[1000];
memset(dp, -1, sizeof(dp));
cin >> n;
rep(i, n) { scanf("... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 274 | 3 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, W;
char dummy;
int count = 1;
while (true) {
cin >> W;
if (W == 0) {
break;
}
cin >> n;
vector<int> item_val(n);
vector<int> item_wei(n);
vector<vector<int... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, W;
char dummy;
int count = 1;
while (true) {
cin >> W;
if (W == 0) {
break;
}
cin >> n;
vector<int> item_val(n);
vector<int> item_wei(n);
vector<vector<int... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 330 | 6 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
int dp[1111][1111];
int w[1111], v[1111];
int main() {
int W, N;
int c = 1;
while (1) {
cin >> W;
if (!W)
break;
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d,%d"... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
int dp[1111][1111];
int w[1111], v[1111];
int main() {
int W, N;
int c = 1;
while (1) {
cin >> W;
if (!W)
break;
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d,%d"... | [["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 308 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
const int NUM_MAX = 1001;
int dp[NUM_MAX][NUM_MAX];
int we[NUM_MAX], v[NUM_MAX];
int w, n;
void solve() {
int max_idx;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= w; j++) {
if (j < we[i])
dp[i + 1][j] = dp[i][j];
else
... | #include <algorithm>
#include <iostream>
using namespace std;
const int NUM_MAX = 1001;
int dp[NUM_MAX][NUM_MAX];
int we[NUM_MAX], v[NUM_MAX];
int w, n;
void solve() {
int max_idx;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= w; j++) {
if (j < we[i])
dp[i + 1][j] = dp[i][j];
else
... | [["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 7, 8, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 7, 8, 57, 64, 9, 0, 46]] | 1 | 320 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(T) T.begin(), T.end()
#define mp make_pair
#define pb push_back
u... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(T) T.begin(), T.end()
#define mp make_pair
#define pb push_back
u... | [["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 17, 151]] | 1 | 247 | 4 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, w;
for (int num = 1;; num++) {
cin >> w;
if (w == 0)
break;
cin >> n;
int input1, input2;
char input3;
vector<int> value;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, w;
for (int num = 1;; num++) {
cin >> w;
if (w == 0)
break;
cin >> n;
int input1, input2;
char input3;
vector<int> value;
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 340 | 4 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int c = 1, W;
while (cin >> W, W) {
int n, mx = 0, w[1000], d[1000];
long dp[1001] = {0};
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d,%d", &d[i], &w[i]);
for (int i = 1; i <= W; i++)
dp[i] = -1;
f... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int c = 1, W;
while (cin >> W, W) {
int n, mx = 0, w[1000], d[1000];
long dp[1001] = {0};
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d,%d", &d[i], &w[i]);
for (int i = 1; i <= W; i++)
dp[i] = -1;
f... | [["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151]] | 1 | 289 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int dp[1001][1001];
int main() {
int c = 1;
while (1) {
for (int i = 0; i <= 1000; i++)
for (int j = 0; j <= 1000; j++)
dp[i][j] = 0;
int w, n;
cin >> w >> n;
if (w == 0)
break;
int treasure[1... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int dp[1001][1001];
int main() {
int c = 1;
while (1) {
for (int i = 0; i <= 1000; i++)
for (int j = 0; j <= 1000; j++)
dp[i][j] = 0;
int w, n;
cin >> w >> n;
if (w == 0)
break;
int treasure[1... | [["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 313 | 2 |
#include <algorithm>
#include <cstdio>
using namespace std;
int T, N, V[1010], W[1010];
int main() {
for (int t = 1; scanf("%d", &T) && T; t++) {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d,%d", &V[i], &W[i]);
}
int A[1010][1010] = {{0}};
for (int i = 1; i < N; i++) {
... | #include <algorithm>
#include <cstdio>
using namespace std;
int T, N, V[1010], W[1010];
int main() {
for (int t = 1; scanf("%d", &T) && T; t++) {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d,%d", &V[i], &W[i]);
}
int A[1010][1010] = {{0}};
for (int i = 1; i <= N; i++) {
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 293 | 6 |
// バグ有
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int W, N;
char d;
int counter = 1;
int takara[1000][2];
while (1) {
cin >> W;
if (W == 0) {
break;
}
cin >> N;
for (int i = 0; i < N; i++) {
cin >> takara[i][0] >> d >> takara[i][... | // バグ有
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int W, N;
char d;
int counter = 1;
int takara[1000][2];
while (1) {
cin >> W;
if (W == 0) {
break;
}
cin >> N;
for (int i = 0; i < N; i++) {
cin >> takara[i][0] >> d >> takara[i][... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13]] | 1 | 433 | 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>
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUNT(i, n) for (int i = 1; i <= n; i++)
#define AL... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUNT(i, n) for (int i = 1; i <= n; i++)
#define AL... | [["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 17, 151], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 62]] | 1 | 291 | 6 |
i = 1
until (furoshiki = $<.gets.to_i).zero?
table = {0 => 0}
Array.new($<.gets.to_i) {$<.gets.split(",").map(&:to_i)}.each do |v, w|
h = Hash.new(0)
table.each {|key, value| h[key + w] = table[key] + v if key + w <= furoshiki}
table.merge!(h) {|k, v1, v2| [v1, v2].max}
end
p table
m = table.value... | i = 1
until (furoshiki = $<.gets.to_i).zero?
table = {0 => 0}
Array.new($<.gets.to_i) {$<.gets.split(",").map(&:to_i)}.each do |v, w|
h = Hash.new(0)
table.each {|key, value| h[key + w] = table[key] + v if key + w <= furoshiki}
table.merge!(h) {|k, v1, v2| [v1, v2].max}
end
m = table.values.max
ma... | [["-", 0, 493, 0, 750, 8, 170, 0, 652, 735, 22], ["-", 0, 750, 8, 170, 0, 652, 3, 4, 0, 22]] | 4 | 184 | 2 |
#!/usr/bin/env ruby
k = 0
loop do
k += 1
w = gets.chomp!.to_i
break if w.zero?
n = gets.chomp!.to_i
things = []
dyn = Array.new(w+1, -1)
n.times do
things << gets.chomp!.split(?,).map(&:to_i)
end
## ???????¨???????
# ?????????
dyn[0] = 0
# ??????
things.each do |e|
w.downto(0) do ... | #!/usr/bin/env ruby
k = 0
loop do
k += 1
w = gets.chomp!.to_i
break if w.zero?
n = gets.chomp!.to_i
things = []
dyn = Array.new(w+1, -1)
n.times do
things << gets.chomp!.split(?,).map(&:to_i)
end
## ???????¨???????
# ?????????
dyn[0] = 0
# ??????
things.each do |e|
w.downto(0) do ... | [["+", 196, 737, 8, 736, 0, 652, 486, 739, 0, 24], ["+", 8, 736, 0, 652, 486, 739, 0, 738, 17, 72], ["+", 8, 736, 0, 652, 486, 739, 0, 738, 12, 612], ["+", 196, 737, 8, 736, 0, 652, 486, 739, 0, 25], ["+", 8, 736, 0, 121, 64, 749, 0, 94, 0, 94]] | 4 | 185 | 5 |
loop do
w = gets.to_i
@num ||= 1
break if w==0
n = gets.to_i
dp = Array.new(n+1){ Array.new(w+1){ {v: 0, w: 0}}}
n.times.map{ gets.split(",").map(&:to_i) }.each_with_index do |(vi,wi), i|
w.times do |j|
t = dp[i][[j+1-wi,0].max]
dp[i+1][j+1] = if j+1>=wi && t[:v]+vi >= dp[i][j+1][:v]
... | loop do
w = gets.to_i
@num ||= 1
break if w==0
n = gets.to_i
dp = Array.new(n+1){ Array.new(w+1){ {v: 0, w: 0}}}
n.times.map{ gets.split(",").map(&:to_i) }.each_with_index do |(vi,wi), i|
w.times do |j|
t = dp[i][[j+1-wi,0].max]
dp[i+1][j+1] = if j+1>=wi && t[:v]+vi >= dp[i][j+1][:v]
... | [["+", 8, 736, 0, 652, 3, 4, 0, 557, 0, 6]] | 4 | 284 | 1 |
@case_num = 1
while true do
w = gets.to_i
break if w == 0
n = gets.to_i
table = n.times.map{ gets.split(',').map(&:to_i) }
mw, mv = w, 0
dp = Array.new(n+1){Array.new}
dp[0][0] = 0
table.each.with_index(1) do |p, i|
(0..w).reject{ |wi| dp[i-1][wi].nil? }.each do |wi|
va = dp[i][wi] = [dp[i][w... | @case_num = 1
while true do
w = gets.to_i
break if w == 0
n = gets.to_i
table = n.times.map{ gets.split(',').map(&:to_i) }
mw, mv = w, 0
dp = Array.new(n+1){Array.new}
dp[0][0] = 0
table.each.with_index(1) do |p, i|
(0..w).reject{ |wi| dp[i-1][wi].nil? }.each do |wi|
va = dp[i][wi] = [dp[i][w... | [["-", 196, 737, 8, 736, 0, 121, 15, 738, 17, 18], ["+", 196, 737, 8, 736, 0, 121, 15, 738, 17, 19]] | 4 | 281 | 2 |
@num = 1
loop do
w = gets.to_i
break if w == 0
n = gets.to_i
arr = n.times.map { gets.split(',').map(&:to_i) }
dp = Array.new(n+1) { Array.new(w+1) }
dp[0][0] = 0
mw, mv = w, 0
arr.each_with_index do |ia, i|
(0..w).to_a.reject{ |wi| dp[i][wi].nil? }.each do |wi|
t = dp[i+1][wi] = [dp[i][wi],... | @num = 1
loop do
w = gets.to_i
break if w == 0
n = gets.to_i
arr = n.times.map { gets.split(',').map(&:to_i) }
dp = Array.new(n+1) { Array.new(w+1) }
dp[0][0] = 0
mw, mv = w, 0
arr.each_with_index do |ia, i|
(0..w).to_a.reject{ |wi| dp[i][wi].nil? }.each do |wi|
t = dp[i+1][wi] = [dp[i][wi],... | [["-", 8, 736, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 8, 736, 0, 652, 3, 4, 0, 557, 0, 6]] | 4 | 281 | 32 |
from sys import stdin
case = 0
while(True):
case += 1
W = int(stdin.readline())
if not W: break
print("Case %d"%case)
N = int(stdin.readline())
v = [0] * N
w = [0] * N
dp = [[0]*(W + 1) for _ in range(N + 1)]
for k in range(N):
v[k], w[k] = map(int, stdin.readline().split("... | from sys import stdin
case = 0
while(True):
case += 1
W = int(stdin.readline())
if not W: break
print("Case %d:"%case)
N = int(stdin.readline())
v = [0] * N
w = [0] * N
dp = [[0]*(W + 1) for _ in range(N + 1)]
for k in range(N):
v[k], w[k] = map(int, stdin.readline().split(... | [["-", 0, 652, 3, 4, 0, 657, 31, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 657, 31, 557, 0, 6]] | 5 | 255 | 2 |
#include <iostream>
using namespace std;
int main() {
char com, from, to, ball = 'A';
while (cin >> from >> com >> to) {
if (from == ball)
ball = to;
if (to == ball)
ball = from;
}
cout << ball << endl;
} | #include <iostream>
using namespace std;
int main() {
char com, from, to, ball = 'A';
while (cin >> from >> com >> to) {
if (from == ball) {
ball = to;
} else if (to == ball) {
ball = from;
}
}
cout << ball << endl;
} | [["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 46]] | 1 | 63 | 5 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
char a, b, ans = 'A';
while (scanf(" %c,%c", &a, &b) != EOF) {
if (a = ans) {
ans = b;
} else if (b == ans) {
ans = a;
}
}
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
char a, b, ans = 'A';
while (scanf(" %c,%c", &a, &b) != EOF) {
if (a == ans) {
ans = b;
} else if (b == ans) {
ans = a;
}
}
cout << ans << endl;
return 0;
} | [["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 78 | 2 |
#include <iostream>
using namespace std;
int conv(char c) {
switch (c) {
case 'A':
return 0;
case 'B':
return 1;
case 'C':
return 2;
}
return 1;
}
int main() {
bool b[3];
b[0] = 1;
b[1] = 0;
b[2] = 0;
string s;
while (cin >> s) {
int swap1, swap2;
swap1 = conv(s[0]);
sw... | #include <iostream>
using namespace std;
int conv(char c) {
switch (c) {
case 'A':
return 0;
case 'B':
return 1;
case 'C':
return 2;
}
return 1;
}
int main() {
bool b[3];
b[0] = 1;
b[1] = 0;
b[2] = 0;
string s;
while (cin >> s) {
int swap1, swap2;
swap1 = conv(s[0]);
sw... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 206 | 4 |
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int main() {
char X, Y, P = 'A';
while (scanf("%c,%c", X, Y)) {
if (X == P) {
P = Y;
} else if (Y == P) {
P = X;
}
}
printf("%c\n", P);
return 0;
} | #define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int main() {
char X, Y, P = 'A';
while (scanf("%c,%c", &X, &Y) != EOF) {
if (X == P) {
P = Y;
} else if (Y == P) {
P = X;
}
}
printf("%c\n", P);
return 0;
} | [["+", 51, 16, 31, 2, 3, 4, 0, 66, 17, 67], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]] | 1 | 75 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int a, b, c, d;
a = 1;
b = c = 0;
while (cin >> str) {
if ((str[0] == 'A' && str[2] == 'B') || (str[0] == 'B' && str[2] == 'A')) {
d = a;
a = b;
b = d;
} else if ((str[0] == 'B' && str[3] == 'C') ||
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int a, b, c, d;
a = 1;
b = 0;
c = 0;
while (cin >> str) {
if ((str[0] == 'A' && str[2] == 'B') || (str[0] == 'B' && str[2] == 'A')) {
d = a;
a = b;
b = d;
} else if ((str[0] == 'B' && str[2] == 'C'... | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 16, 12, 16, 31, 69, 341, 342, 0, 13], ["+", 0, 16, 12, 16, 31, 69, 341, 342, 0, 13]] | 1 | 217 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fi first
#define se second
#define fcout(n) cout << fixed << setprecision((n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fi first
#define se second
#define fcout(n) cout << fixed << setprecision((n... | [["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 237 | 4 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define shosu(x) fixed << setprecision(x)
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, P> pip;
typedef long long ll;
const i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define shosu(x) fixed << setprecision(x)
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, P> pip;
typedef long long ll;
const i... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 139 | 1 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std... | [["+", 51, 16, 31, 2, 3, 4, 0, 5, 0, 44]] | 1 | 389 | 1 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define PUSH(n, v) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define PUSH(n, v) ... | [["+", 8, 9, 0, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 9, 0, 57, 64, 9, 0, 46]] | 1 | 193 | 2 |
#define scanf_s scanf
//#define gets_s gets
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
#define MIN -1
#define MAX 1000000
int main(void) {
char a, b, x = 'A';
while (scanf_s("%c,%c", &a, &b) != EOF) {
if (a == x)
x = b;
if (b == x)
x = a;
}
... | #define scanf_s scanf
//#define gets_s gets
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
#define MIN -1
#define MAX 1000000
int main(void) {
char a, b, x = 'A';
while (scanf_s("%c,%c", &a, &b) != EOF) {
if (a == x)
x = b;
else if (b == x)
x = a;... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 89 | 1 |
#include <iostream>
using namespace std;
int main() {
char c1, c2, delim, ball = 'A';
while (cin >> c1 >> delim >> c2) {
if (c1 == ball)
ball == c2;
else if (c2 == ball)
ball == c1;
}
cout << ball << endl;
} | #include <iostream>
using namespace std;
int main() {
char c1, c2, delim, ball = 'A';
while (cin >> c1 >> delim >> c2) {
if (c1 == ball)
ball = c2;
else if (c2 == ball)
ball = c1;
}
cout << ball << endl;
} | [["-", 8, 9, 0, 57, 64, 1, 0, 16, 17, 60], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["-", 75, 76, 0, 57, 64, 1, 0, 16, 17, 60], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 17, 32]] | 1 | 64 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
char x, y, now = 'A';
while (scanf("%c,%c", &x, &y) > 0) {
if (now == x)
now = y;
if (now == y)
now = x;
}
cout << now << endl;
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
char x, y, now = 'A';
while (scanf("%c,%c", &x, &y) > 0) {
if (now == x)
now = y;
else if (now == y)
now = x;
}
cout << now << endl;
return 0;
} | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 73 | 1 |
#include <iostream>
using namespace std;
int main() {
char a, b, c, ans = 'A';
while (cin >> a >> c >> b) {
if (a == 'A' && a == ans) {
if (b == 'B') {
ans = 'B';
}
if (b == 'C') {
ans = 'C';
}
}
if (a == 'B' && a == ans) {
if (b == 'A') {
ans = 'A'... | #include <iostream>
using namespace std;
int main() {
char a, b, c, ans = 'A';
while (cin >> a >> c >> b) {
if (a == 'A' && a == ans) {
if (b == 'B') {
ans = 'B';
}
if (b == 'C') {
ans = 'C';
}
} else if (a == 'B' && a == ans) {
if (b == 'A') {
ans = 'A... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95]] | 1 | 322 | 5 |
#include <iostream>
using namespace std;
main() {
bool C[3];
C[1] = C[2] = false;
C[0] = true;
char s, t, k;
while (cin >> s >> k >> t)
swap(C[s - 'a'], C[t - 'a']);
if (C[0])
cout << "A" << endl;
if (C[1])
cout << "B" << endl;
if (C[2])
cout << "C" << endl;
} | #include <iostream>
using namespace std;
main() {
bool C[3];
C[1] = C[2] = false;
C[0] = true;
char s, t, k;
while (cin >> s >> k >> t)
swap(C[s - 'A'], C[t - 'A']);
if (C[0])
cout << "A" << endl;
if (C[1])
cout << "B" << endl;
if (C[2])
cout << "C" << endl;
} | [["-", 0, 69, 341, 342, 0, 16, 12, 103, 0, 125], ["+", 0, 69, 341, 342, 0, 16, 12, 103, 0, 125]] | 1 | 119 | 4 |
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
char c = 'A', x, y;
while (scanf("%c,%c", &x, &y) != EOF) {
if (c == x)
c = y;
if (c == y)
c = x;
}
cout << c << endl;
} | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
char c = 'A', x, y;
while (scanf("%c,%c", &x, &y) != EOF) {
if (c == x) {
c = y;
continue;
}
if (c == y)
c = x;
}
cout << c << endl;
} | [["+", 0, 52, 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, 116, 0, 117], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 76 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
char cur = 'A';
char x, y;
while (scanf("%c,%c ", &x, &y) == 2) {
if (x == cur) {
cur = x;
} else if (y == cur) {
cur = y;
}
}
printf("%c\n", cur);
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
char cur = 'A';
char x, y;
while (scanf("%c,%c ", &x, &y) == 2) {
if (x == cur) {
cur = y;
} else if (y == cur) {
cur = x;
}
}
printf("%c\n", cur);
} | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 1 | 80 | 4 |
#include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#de... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#de... | [["+", 51, 16, 31, 2, 3, 4, 0, 5, 0, 44]] | 1 | 130 | 1 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
void solve() {}
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
void solve() {}
... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 111 | 1 |
#include <cstdio>
using namespace std;
int main() {
char from, to, ball = 'A';
while (scanf("%c%*c%c", &from, &to) != EOF) {
if (ball == from) {
ball = to;
} else if (ball == to) {
ball = from;
}
}
printf("%c\n", ball);
} | #include <cstdio>
using namespace std;
int main() {
char from, to, ball = 'A';
while (scanf("%c,%c", &from, &to) != EOF) {
if (ball == from) {
ball = to;
} else if (ball == to) {
ball = from;
}
}
printf("%c\n", ball);
} | [["-", 51, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 51, 16, 31, 2, 3, 4, 0, 5, 0, 6]] | 1 | 77 | 2 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using name... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using name... | [["-", 8, 9, 0, 57, 64, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 22], ["-", 75, 76, 0, 57, 64, 1, 0, 11, 12, 22], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 12, 22]] | 1 | 208 | 4 |
#include <iostream>
using namespace std;
int main() {
char i1, i2, c;
bool ball[3] = {false};
ball[0] = true;
while (cin >> i1) {
cin >> c;
cin >> i2;
cin >> c;
i1 -= 'A';
i2 -= 'A';
bool tmp = ball[i1];
ball[i1] = ball[i2];
ball[i2] = tmp;
}
c = 0;
while (!ball[c]) {
... | #include <iostream>
using namespace std;
int main() {
char i1, i2, c;
bool ball[3] = {false};
ball[0] = true;
while (cin >> i1) {
cin >> c;
cin >> i2;
i1 -= 'A';
i2 -= 'A';
bool tmp = ball[i1];
ball[i1] = ball[i2];
ball[i2] = tmp;
}
c = 0;
while (!ball[c]) {
c++;
}
co... | [["-", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 17, 152], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 125 | 4 |
#include <iostream>
using namespace std;
int main() {
int a = 1, b = 0, c = 0, temp;
char x, y;
while (scanf("%c,%c", &x, &y) == 2) {
if (x == 'A') {
temp = a;
if (y == 'B') {
a = b;
b = temp;
} else {
a = c;
c = temp;
}
} else if (x == 'B') {
... | #include <iostream>
using namespace std;
int main() {
int a = 1, b = 0, c = 0, temp;
char x, y;
while (scanf(" %c,%c", &x, &y) == 2) {
// cout << x << y << endl;
if (x == 'A') {
temp = a;
if (y == 'B') {
a = b;
b = temp;
} else {
a = c;
c = temp;
... | [["-", 51, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 51, 16, 31, 2, 3, 4, 0, 5, 0, 6]] | 1 | 212 | 2 |
#include <cstdio>
char boul = 'A';
int main() {
char a, b;
while (scanf("%c,%c", &a, &b) != EOF) {
if (a == boul)
boul = b;
if (b == boul)
boul = a;
getchar();
}
printf("%c\n", boul);
return 0;
} | #include <cstdio>
char boul = 'A';
int main() {
char a, b;
while (scanf("%c,%c", &a, &b) != EOF) {
if (a == boul)
boul = b;
else if (b == boul)
boul = a;
getchar();
}
printf("%c\n", boul);
return 0;
} | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 76 | 1 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int cup[3] = {1, 0, 0};
string str;
while (cin >> str, !cin.eof()) {
swap(cup[str[0] - 'A'], cup[str[2] - 'A']);
}
for (int i = 0; i < 3; i++) {
if (cup[i] == 1)
cout << ('A' + i) << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int cup[3] = {1, 0, 0};
string str;
while (cin >> str, !cin.eof()) {
swap(cup[str[0] - 'A'], cup[str[2] - 'A']);
}
for (int i = 0; i < 3; i++) {
if (cup[i] == 1)
cout << (char)('A' + i) << endl;
}
return 0;
} | [["+", 0, 16, 31, 16, 12, 74, 39, 77, 39, 40], ["+", 64, 1, 0, 16, 31, 16, 12, 74, 0, 25], ["+", 0, 16, 31, 16, 12, 74, 51, 23, 0, 24]] | 1 | 113 | 3 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
char a, b;
int ball[3] = {1, 0, 0};
while (scanf("%c,%c", &a, &b) != EOF) {
swap(ball[a - 'A'], ball[b - 'A']);
}
for (int i = 0; i < 3; ++i) {
if (ball[i])
printf("%c\n", i + 'A');
}
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
char a, b;
int ball[3] = {1, 0, 0};
while (scanf(" %c,%c", &a, &b) != EOF) {
swap(ball[a - 'A'], ball[b - 'A']);
}
for (int i = 0; i < 3; ++i) {
if (ball[i])
printf("%c\n", i + 'A');
}
return 0;
} | [["-", 51, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 51, 16, 31, 2, 3, 4, 0, 5, 0, 6]] | 1 | 115 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define pu push
#define pb push_back
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define pu push
#define pb push_back
... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 123 | 1 |
#include <iostream>
using namespace std;
int main(void) {
char p1, p2;
char ten;
char ans = 'A';
while (cin >> p1 >> ten >> p2) {
if (p1 == ans) {
ans = p2;
}
if (p2 == ans) {
ans = p1;
}
}
cout << ans << endl;
return 0;
} |
//今、ボールがどこにあるかだけ考えれば出来る
#include <iostream>
using namespace std;
int main(void) {
char p1, p2;
char ten;
char ans = 'A';
while (cin >> p1 >> ten >> p2) {
if (p1 == ans) {
ans = p2;
} else if (p2 == ans) {
ans = p1;
}
}
cout << ans << endl;
return 0;
} | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 73 | 1 |
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
string line;
char ball = 'A';
while (getline(cin, line)) {
stringstream s;
s << line;
char a, b, c;
s >> a >> b >> c;
if (ball == a)
ball = c;
if (ball == c)
ball = a;
}
cout << ball ... | #include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
string line;
char ball = 'A';
while (getline(cin, line)) {
stringstream s;
s << line;
char a, b, c;
s >> a >> b >> c;
if (ball == a)
ball = c;
else if (ball == c)
ball = a;
}
cout << ... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 85 | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.