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) {
int x, y, i, j;
while (scanf("%d%d", &x, &y), x, y) {
int masu[20][20] = {0};
int dp[20][20] = {0};
int ans = 0;
for (i = 1; i <= y; i++) {
for (j = 1; j <= x; j++) {
scanf("%d", &masu[i][j]);
}
}
for (i = 0; i <= y; i++)
masu[i][0] = 1;
for (j = 0; j <= x; j++)
masu[0][j] = 1;
for (j = 1; j <= x; j++) {
if (masu[1][j] == 0)
dp[1][j] = 1;
}
for (i = 2; i <= y; i++) {
for (j = 1; j <= x; j++) {
if (masu[i][j] == 0) {
if (masu[i - 1][j - 1] == 0)
dp[i][j] += dp[i - 1][j - 1];
if (masu[i - 1][j] == 0)
dp[i][j] += dp[i - 1][j];
if (masu[i - 1][j + 1] == 0)
dp[i][j] += dp[i - 1][j + 1];
if (masu[i - 2][j] == 2) {
dp[i][j] += dp[i - 2][j];
}
}
if (masu[i][j] == 1) {
dp[i][j] = 0;
}
if (masu[i][j] == 2) {
if (dp[i - 1][j] == 0)
dp[i][j] = dp[i - 1][j];
if (masu[i - 2][j] == 2)
dp[i][j] += dp[i - 2][j];
}
}
}
for (i = 1; i <= x; i++) {
ans += dp[y][i];
if (masu[y - 1][i] == 2)
ans += dp[y - 1][i];
}
printf("%d\n", ans);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int x, y, i, j;
while (scanf("%d%d", &x, &y), x, y) {
int masu[20][20] = {0};
int dp[20][20] = {0};
int ans = 0;
for (i = 1; i <= y; i++) {
for (j = 1; j <= x; j++) {
scanf("%d", &masu[i][j]);
}
}
for (i = 0; i <= y; i++)
masu[i][0] = 1;
for (j = 0; j <= x; j++)
masu[0][j] = 1;
for (j = 1; j <= x; j++) {
if (masu[1][j] == 0)
dp[1][j] = 1;
}
for (i = 2; i <= y; i++) {
for (j = 1; j <= x; j++) {
if (masu[i][j] == 0) {
if (masu[i - 1][j - 1] == 0)
dp[i][j] += dp[i - 1][j - 1];
if (masu[i - 1][j] == 0)
dp[i][j] += dp[i - 1][j];
if (masu[i - 1][j + 1] == 0)
dp[i][j] += dp[i - 1][j + 1];
if (masu[i - 2][j] == 2) {
dp[i][j] += dp[i - 2][j];
}
}
if (masu[i][j] == 1) {
dp[i][j] = 0;
}
if (masu[i][j] == 2) {
if (masu[i - 1][j] == 0)
dp[i][j] = dp[i - 1][j];
if (masu[i - 2][j] == 2)
dp[i][j] += dp[i - 2][j];
}
}
}
/*
for(i=1;i<=y;i++){
for(j=1;j<=x;j++){
printf("%d",dp[i][j]);
}
puts("");
}
*/
for (i = 1; i <= x; i++) {
ans += dp[y][i];
if (masu[y - 1][i] == 2)
ans += dp[y - 1][i];
}
printf("%d\n", ans);
}
return 0;
}
|
[["-", 15, 339, 51, 16, 31, 69, 28, 69, 28, 22], ["+", 15, 339, 51, 16, 31, 69, 28, 69, 28, 22]]
| 1
| 547
| 2
|
#include <algorithm>
#include <iostream>
using namespace std;
int X, Y;
int c[15][15];
int dp[15][15];
int main() {
while (cin >> X >> Y, X | Y) {
int ans = 0;
for (int i = 0; i < Y; i++)
for (int j = 0; j < X; j++)
cin >> c[i][j];
fill_n((int *)dp, 15 * 15, 0);
for (int j = 0; j < X; j++) {
if (c[0][j] != 1)
dp[0][j] = 1;
}
cout << endl;
for (int i = 0; i < Y; i++) {
for (int j = 0; j < X; j++) {
if (dp[i][j] == 0)
continue;
if (Y - 1 == i || c[i][j] == 2 && Y - 2 == i) {
ans += dp[i][j];
continue;
}
for (int dx = -1; dx <= 1; dx++) {
if (j + dx < 0 || X <= j + dx)
continue;
if (c[i][j] == 2) {
if (dx == 0 && c[i + 2][j] != 1) {
dp[i + 2][j] += dp[i][j];
}
} else {
if (c[i + 1][j + dx] == 0)
dp[i + 1][j + dx] += dp[i][j];
else if (c[i + 1][j + dx] == 2 && dx == 0)
dp[i + 1][j] += dp[i][j];
}
}
}
}
cout << ans << endl;
}
}
|
//配るDP
#include <algorithm>
#include <iostream>
using namespace std;
int X, Y;
int c[15][15];
int dp[15][15];
int main() {
while (cin >> X >> Y, X | Y) {
int ans = 0;
for (int i = 0; i < Y; i++)
for (int j = 0; j < X; j++)
cin >> c[i][j];
fill_n((int *)dp, 15 * 15, 0);
for (int j = 0; j < X; j++) {
if (c[0][j] != 1)
dp[0][j] = 1;
}
for (int i = 0; i < Y; i++) {
for (int j = 0; j < X; j++) {
if (dp[i][j] == 0)
continue;
if (Y - 1 == i || c[i][j] == 2 && Y - 2 == i) {
ans += dp[i][j];
continue;
}
for (int dx = -1; dx <= 1; dx++) {
if (j + dx < 0 || X <= j + dx)
continue;
if (c[i][j] == 2) {
if (dx == 0 && c[i + 2][j] != 1) {
dp[i + 2][j] += dp[i][j];
}
} else {
if (c[i + 1][j + dx] == 0)
dp[i + 1][j + dx] += dp[i][j];
else if (c[i + 1][j + dx] == 2 && dx == 0)
dp[i + 1][j] += dp[i][j];
}
}
}
}
cout << ans << endl;
}
}
|
[["-", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 403
| 4
|
#include <cstring>
#include <iostream>
using namespace std;
#define MAX_XY 16
int X, Y;
int field[MAX_XY][MAX_XY];
int way[MAX_XY][MAX_XY];
int main() {
while (cin >> X >> Y, X || Y) {
memset(field, 0, sizeof(field));
memset(way, 0, sizeof(way));
for (int i = 0; i < X; i++) {
cin >> field[0][i];
if (field[0][i] == 1) {
way[0][i] = 0;
} else {
way[0][i] = 1;
}
}
for (int i = 1; i < Y; i++) {
for (int j = 0; j < X; j++) {
cin >> field[i][j];
}
}
for (int i = 0; i < Y - 1; i++) {
for (int j = 0; j < X; j++) {
if (field[i][j] == 2 && field[i + 2][j] != 1) {
way[i + 2][j] += way[i][j];
} else {
if (1 <= j && field[i + 1][j - 1] == 0) {
way[i + 1][j - 1] += way[i][j];
}
if (j < X - 1 && field[i + 1][j + 1] == 0) {
way[i + 1][j + 1] += way[i][j];
}
if (field[i + 1][j] != 1) {
way[i + 1][j] += way[i][j];
}
}
}
}
// for (int i = 0; i < Y; i++) {
// for (int j = 0; j < X; j++) {
// cout << way[i][j] << ' ';
// }
// cout << endl;
// }
int cnt = 0;
for (int i = 0; i < X; i++) {
cnt += way[Y - 1][i];
}
for (int i = 0; i < X; i++) {
if (field[Y - 2][i] == 2)
cnt += way[Y - 2][i];
}
cout << cnt << endl;
}
return 0;
}
|
#include <cstring>
#include <iostream>
using namespace std;
#define MAX_XY 16
int X, Y;
int field[MAX_XY][MAX_XY];
int way[MAX_XY][MAX_XY];
int main() {
while (cin >> X >> Y, X || Y) {
memset(field, 0, sizeof(field));
memset(way, 0, sizeof(way));
for (int i = 0; i < X; i++) {
cin >> field[0][i];
if (field[0][i] == 1) {
way[0][i] = 0;
} else {
way[0][i] = 1;
}
}
for (int i = 1; i < Y; i++) {
for (int j = 0; j < X; j++) {
cin >> field[i][j];
}
}
for (int i = 0; i < Y - 1; i++) {
for (int j = 0; j < X; j++) {
if (field[i][j] == 2) {
if (field[i + 2][j] != 1) {
way[i + 2][j] += way[i][j];
}
} else {
if (1 <= j && field[i + 1][j - 1] == 0) {
way[i + 1][j - 1] += way[i][j];
}
if (j < X - 1 && field[i + 1][j + 1] == 0) {
way[i + 1][j + 1] += way[i][j];
}
if (field[i + 1][j] != 1) {
way[i + 1][j] += way[i][j];
}
}
}
}
// for (int i = 0; i < Y; i++) {
// for (int j = 0; j < X; j++) {
// cout << way[i][j] << ' ';
// }
// cout << endl;
// }
int cnt = 0;
for (int i = 0; i < X; i++) {
cnt += way[Y - 1][i];
}
for (int i = 0; i < X; i++) {
if (field[Y - 2][i] == 2)
cnt += way[Y - 2][i];
}
cout << cnt << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 474
| 6
|
#include <iostream>
#include <vector>
using namespace std;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) loop(i, 0, b)
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
int main() {
int w, h;
while (cin >> w >> h, w || h) {
int G[100][100] = {};
int dp[100][100] = {};
rep(i, h) rep(j, w) cin >> G[i][j];
rep(i, w) dp[0][i] = G[0][i] == 0;
rep(i, h - 1) rep(j, w) {
if (G[i][j] == 1) {
dp[i][j] = 0;
} else if (G[i][j] == 2 && G[i + 2][j] != 1) {
dp[i + 2][j] += dp[i][j];
} else {
if (G[i + 1][j] == 2)
dp[i + 1][j] += dp[i][j];
loop(k, -1, 2) {
if (0 <= j + k && j + k < w && G[i + 1][j + k] == 0) {
dp[i + 1][j + k] += dp[i][j];
}
}
}
}
ull res = 0;
for (int i : {h - 1, h})
rep(j, w) { res += dp[i][j]; }
cout << res << endl;
}
}
|
#include <iostream>
#include <vector>
using namespace std;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) loop(i, 0, b)
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
int main() {
int w, h;
while (cin >> w >> h, w || h) {
int G[100][100] = {};
int dp[100][100] = {};
rep(i, h) rep(j, w) cin >> G[i][j];
rep(i, w) dp[0][i] = G[0][i] == 0;
rep(i, h - 1) rep(j, w) {
if (G[i][j] == 1) {
dp[i][j] = 0;
} else if (G[i][j] == 2) {
if (G[i + 2][j] != 1) {
dp[i + 2][j] += dp[i][j];
}
} else {
if (G[i + 1][j] == 2)
dp[i + 1][j] += dp[i][j];
loop(k, -1, 2) {
if (0 <= j + k && j + k < w && G[i + 1][j + k] == 0) {
dp[i + 1][j + k] += dp[i][j];
}
}
}
}
ull res = 0;
for (int i : {h - 1, h})
rep(j, w) { res += dp[i][j]; }
cout << res << endl;
}
}
|
[["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 25], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 45], ["+", 75, 76, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 365
| 6
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <list>
#include <vector>
using namespace std;
#define EPS 1e-6
typedef complex<double> P;
struct L : public vector<P> {
L(const P &a, const P &b) {
push_back(a);
push_back(b);
}
};
struct C {
P p;
double r;
C(const P &p, double r) : p(p), r(r) {}
};
double cross(const P &a, const P &b) { return imag(conj(a) * b); }
double dot(const P &a, const P &b) { return real(conj(a) * b); }
double dist(const P &a, const P &b) {
return sqrt((a.real() - b.real()) * (a.real() - b.real()) +
(a.imag() - b.imag()) * (a.imag() - b.imag()));
}
bool isIntoC(const P &p, const C &c) { return dist(p, c.p) < c.r + EPS; }
bool isIntoC(const L &l, const C &c) {
return dist(l[0], c.p) < c.r + EPS && dist(l[1], c.p) < c.r + EPS;
}
int CrossPtNum(const C &c, const L &l) {
P LV = l[0] - l[1];
double A = (LV.real() * LV.real()) + (LV.imag() * LV.imag());
double B = (LV.real() * l[0].real()) - (LV.real() * c.p.real()) +
(LV.imag() * l[0].imag()) - (LV.imag() * c.p.imag());
double C = (l[0].real() - c.p.real()) * (l[0].real() - c.p.real()) +
(l[0].imag() - c.p.imag()) * (l[0].imag() - c.p.imag()) -
(c.r * c.r);
if (fabs(B * B - A * C) < EPS)
return 1;
if (B * B - A * C > 0)
return 2;
return 0;
}
bool intersectSC(const L &l, const C &c) {
double vc = dot(l[1] - l[0], c.p - l[0]);
if (vc < 0) {
double dif = c.r - dist(l[0], c.p);
return dif + EPS > 0;
}
double vv = dot(l[1] - l[0], l[1] - l[0]);
if (vc > vv) {
double d = dist(l[1], c.p);
double dif = c.r * c.r - d * d;
return dif + EPS > 0;
}
double cc = dot(c.p - l[0], c.p - l[0]);
double dif = c.r * c.r - (cc - (vc / vv) * vc);
return dif + EPS > 0;
}
int tmr;
class UFO {
public:
double x, y, r, v, d, x0, y0;
UFO(int X, int Y, int R, int V) {
x0 = X;
y0 = Y;
r = R;
v = V;
d = sqrt(x0 * x0 + y0 * y0);
}
int move() {
x = x0 - tmr * v * x0 / sqrt(x0 * x0 + y0 * y0);
y = y0 - tmr * v * y0 / sqrt(x0 * x0 + y0 * y0);
d -= v;
return d;
}
};
int main() {
int R, N, x, y, r, v;
while (cin >> R >> N, (R || N)) {
list<UFO> ls;
while (N--) {
cin >> x >> y >> r >> v;
ls.push_back(UFO(x, y, r, v));
}
int cnt = 0;
tmr = 0;
while (true) {
tmr++;
double md = 1e20;
double mx, my;
for (list<UFO>::iterator it = ls.begin(); it != ls.end();) {
it->move();
if (it->d <= R) {
it = ls.erase(it);
cnt++;
} else {
if (md > it->d) {
mx = it->x;
my = it->y;
md = it->d;
}
it++;
}
}
if (ls.empty()) {
cout << cnt << endl;
break;
}
L laser(P(R * mx / sqrt(mx * mx + my + my) + EPS,
R * my / sqrt(mx * mx + my + my)) +
EPS,
P(mx * 3000, my * 3000));
for (list<UFO>::iterator it = ls.begin(); it != ls.end();) {
C ufo(P(it->x, it->y), it->r);
if (intersectSC(laser, ufo)) {
it = ls.erase(it);
} else {
it++;
}
}
}
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <list>
#include <vector>
using namespace std;
#define EPS 1e-6
typedef complex<double> P;
struct L : public vector<P> {
L(const P &a, const P &b) {
push_back(a);
push_back(b);
}
};
struct C {
P p;
double r;
C(const P &p, double r) : p(p), r(r) {}
};
double cross(const P &a, const P &b) { return imag(conj(a) * b); }
double dot(const P &a, const P &b) { return real(conj(a) * b); }
double dist(const P &a, const P &b) {
return sqrt((a.real() - b.real()) * (a.real() - b.real()) +
(a.imag() - b.imag()) * (a.imag() - b.imag()));
}
bool isIntoC(const P &p, const C &c) { return dist(p, c.p) < c.r + EPS; }
bool isIntoC(const L &l, const C &c) {
return dist(l[0], c.p) < c.r + EPS && dist(l[1], c.p) < c.r + EPS;
}
int CrossPtNum(const C &c, const L &l) {
P LV = l[0] - l[1];
double A = (LV.real() * LV.real()) + (LV.imag() * LV.imag());
double B = (LV.real() * l[0].real()) - (LV.real() * c.p.real()) +
(LV.imag() * l[0].imag()) - (LV.imag() * c.p.imag());
double C = (l[0].real() - c.p.real()) * (l[0].real() - c.p.real()) +
(l[0].imag() - c.p.imag()) * (l[0].imag() - c.p.imag()) -
(c.r * c.r);
if (fabs(B * B - A * C) < EPS)
return 1;
if (B * B - A * C > 0)
return 2;
return 0;
}
bool intersectSC(const L &l, const C &c) {
double vc = dot(l[1] - l[0], c.p - l[0]);
if (vc < 0) {
double dif = c.r - dist(l[0], c.p);
return dif + EPS > 0;
}
double vv = dot(l[1] - l[0], l[1] - l[0]);
if (vc > vv) {
double d = dist(l[1], c.p);
double dif = c.r * c.r - d * d;
return dif + EPS > 0;
}
double cc = dot(c.p - l[0], c.p - l[0]);
double dif = c.r * c.r - (cc - (vc / vv) * vc);
return dif + EPS > 0;
}
int tmr;
class UFO {
public:
double x, y, r, v, d, x0, y0;
UFO(int X, int Y, int R, int V) {
x0 = X;
y0 = Y;
r = R;
v = V;
d = sqrt(x0 * x0 + y0 * y0);
}
int move() {
x = x0 - tmr * v * x0 / sqrt(x0 * x0 + y0 * y0);
y = y0 - tmr * v * y0 / sqrt(x0 * x0 + y0 * y0);
d -= v;
return d;
}
};
int main() {
int R, N, x, y, r, v;
while (cin >> R >> N, (R || N)) {
list<UFO> ls;
while (N--) {
cin >> x >> y >> r >> v;
ls.push_back(UFO(x, y, r, v));
}
int cnt = 0;
tmr = 0;
while (true) {
tmr++;
double md = 1e20;
double mx, my;
for (list<UFO>::iterator it = ls.begin(); it != ls.end();) {
it->move();
if (it->d <= R) {
it = ls.erase(it);
cnt++;
} else {
if (md > it->d) {
mx = it->x;
my = it->y;
md = it->d;
}
it++;
}
}
if (ls.empty()) {
cout << cnt << endl;
break;
}
L laser(P(R * mx / sqrt(mx * mx + my * my) + EPS,
R * my / sqrt(mx * mx + my * my)) +
EPS,
P(mx * 3000, my * 3000));
for (list<UFO>::iterator it = ls.begin(); it != ls.end();) {
C ufo(P(it->x, it->y), it->r);
if (intersectSC(laser, ufo)) {
it = ls.erase(it);
} else {
it++;
}
}
}
}
return 0;
}
|
[["-", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 12, 2, 3, 4, 0, 16, 12, 16, 17, 48], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 17, 72]]
| 1
| 1,219
| 4
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
template <class T> T sqr(T x) { return x * x; }
const double eps = 1e-9;
int main() {
for (int R, N; cin >> R >> N, R;) {
int x0[100], y0[100], r[100], v[100];
vector<int> rem(N);
for (int i = 0; i < N; i++) {
cin >> x0[i] >> y0[i] >> r[i] >> v[i];
rem[i] = i;
}
int ans = 0;
for (int i = 1;; i++) {
auto d = [&](int x) { return sqrt(sqr(x0[x]) + sqr(y0[x])) - i * v[x]; };
auto it = remove_if(begin(rem), end(rem),
[&](int x) { return d(x) <= R + eps; });
ans += end(rem) - it;
rem.erase(it, end(rem));
if (rem.empty())
break;
auto cl = min_element(begin(rem), end(rem),
[&](int a, int b) { return d(a) < d(b); });
double arg = atan2(y0[*cl], x0[*cl]);
double xc = d(*cl);
rem.erase(remove_if(begin(rem), end(rem),
[&](int x) {
complex<double> rp =
polar(d(x), atan2(y0[x], x0[x]) - arg);
return r[x] >= fabs(rp.imag()) &&
sqrt(sqr(r[x]) - sqr(rp.imag())) + rp.real();
}),
end(rem));
}
cout << ans << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <vector>
using namespace std;
template <class T> T sqr(T x) { return x * x; }
const double eps = 1e-9;
int main() {
for (int R, N; cin >> R >> N, R;) {
int x0[100], y0[100], r[100], v[100];
vector<int> rem(N);
for (int i = 0; i < N; i++) {
cin >> x0[i] >> y0[i] >> r[i] >> v[i];
rem[i] = i;
}
int ans = 0;
for (int i = 1;; i++) {
auto d = [&](int x) { return sqrt(sqr(x0[x]) + sqr(y0[x])) - i * v[x]; };
auto it = remove_if(begin(rem), end(rem),
[&](int x) { return d(x) <= R + eps; });
ans += end(rem) - it;
rem.erase(it, end(rem));
if (rem.empty())
break;
auto cl = min_element(begin(rem), end(rem),
[&](int a, int b) { return d(a) < d(b); });
double arg = atan2(y0[*cl], x0[*cl]);
double xc = d(*cl);
rem.erase(
remove_if(begin(rem), end(rem),
[&](int x) {
complex<double> rp =
polar(d(x), atan2(y0[x], x0[x]) - arg);
return r[x] >= fabs(rp.imag()) &&
sqrt(sqr(r[x]) - sqr(rp.imag())) + rp.real() > R;
}),
end(rem));
}
cout << ans << endl;
}
}
|
[["+", 8, 9, 0, 37, 0, 16, 12, 16, 17, 47], ["+", 8, 9, 0, 37, 0, 16, 12, 16, 12, 22]]
| 1
| 438
| 2
|
import math
ans = []
while True:
ufo = []
n = input().split()
if n == ["0", "0"]:
for an in ans:
print(an)
break
else:
R = int(n[0])
for i in range(int(n[1])):
m = [int(f) for f in input().split()]
ufo.append([math.sqrt(m[0] ** 2 + m[1] ** 2), math.sqrt(m[0] ** 2 + m[1] ** 2), (m[0], m[1]), m[2], m[3]])
a = 0
while len(ufo) > 0:
flag = True
for xs in ufo: xs[0] -= xs[4]
ufo.sort()
for xs in ufo[:]:
if xs[0] + xs[3] <= R:
a += 1
ufo.remove(xs)
continue
elif flag:
r = xs[1]
pos = xs[2]
ufo.remove(xs)
flag = False
continue
else:
d = xs[0] / xs[1] * abs(pos[0] * xs[2][1] - pos[1] * xs[2][0]) / r
if d <= xs[3]:
if xs[0] * math.cos(math.atan2(xs[2][1], xs[2][0]) - math.atan2(pos[1], pos[0])) + math.sqrt(xs[3] ** 2 + d ** 2) > R:
ufo.remove(xs)
else:
ans.append(a)
|
import math
ans = []
while True:
ufo = []
n = input().split()
if n == ["0", "0"]:
for an in ans:
print(an)
break
else:
R = int(n[0])
for i in range(int(n[1])):
m = [int(f) for f in input().split()]
ufo.append([math.sqrt(m[0] ** 2 + m[1] ** 2), math.sqrt(m[0] ** 2 + m[1] ** 2), (m[0], m[1]), m[2], m[3]])
a = 0
while len(ufo) > 0:
flag = True
for xs in ufo: xs[0] -= xs[4]
ufo.sort()
for xs in ufo[:]:
if xs[0] <= R:
a += 1
ufo.remove(xs)
continue
elif flag:
r = xs[1]
pos = xs[2]
ufo.remove(xs)
flag = False
continue
else:
d = xs[0] / xs[1] * abs(pos[0] * xs[2][1] - pos[1] * xs[2][0]) / r
if d <= xs[3]:
if xs[0] * math.cos(math.atan2(xs[2][1], xs[2][0]) - math.atan2(pos[1], pos[0])) + math.sqrt(xs[3] ** 2 - d ** 2) > R:
ufo.remove(xs)
else:
ans.append(a)
|
[["-", 8, 196, 0, 57, 15, 666, 0, 657, 17, 72], ["-", 0, 57, 15, 666, 0, 657, 12, 206, 51, 22], ["-", 0, 57, 15, 666, 0, 657, 12, 206, 0, 70], ["-", 0, 57, 15, 666, 0, 657, 12, 206, 206, 612], ["-", 0, 57, 15, 666, 0, 657, 12, 206, 0, 73], ["-", 0, 657, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 657, 12, 652, 3, 4, 0, 657, 17, 33]]
| 5
| 374
| 7
|
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = (input.trim()).split("\n");
while (true) {
var a0 = Arr.shift() - 0;
if (a0 == 0)
break;
var a1 = Arr.shift() - 0;
var a2 = Arr.shift() - 0;
var a3 = Arr.shift() - 0;
var a4 = Arr.shift() - 0;
var arr = [ a0, a1, a2, a3, a4 ];
var rps = [ 1, 2, 3 ];
rps = rps.filter(function(
v) { return (v != a0 && v != a1 && v != a2 && v != a3 && v != a4); });
if (rps.length == 2 || rps.length == 0) {
for (var i = 0; i < 5; i++)
console.log(3);
} else {
arr.forEach(function(v) {
if (rps[0] == 1)
console.log((v == 2) ? 2 : 1);
if (rps[0] == 2)
console.log((v == 1) ? 2 : 1);
if (rps[0] == 3)
console.log((v == 1) ? 1 : 2);
});
}
}
|
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = (input.trim()).split("\n");
while (true) {
var a0 = Arr.shift() - 0;
if (a0 == 0)
break;
var a1 = Arr.shift() - 0;
var a2 = Arr.shift() - 0;
var a3 = Arr.shift() - 0;
var a4 = Arr.shift() - 0;
var arr = [ a0, a1, a2, a3, a4 ];
var rps = [ 1, 2, 3 ];
rps = rps.filter(function(
v) { return (v != a0 && v != a1 && v != a2 && v != a3 && v != a4); });
if (rps.length == 2 || rps.length == 0) {
for (var i = 0; i < 5; i++)
console.log(3);
} else {
arr.forEach(function(v) {
if (rps[0] == 1)
console.log((v == 2) ? 1 : 2);
if (rps[0] == 2)
console.log((v == 1) ? 2 : 1);
if (rps[0] == 3)
console.log((v == 1) ? 1 : 2);
});
}
}
|
[["-", 64, 1, 0, 2, 3, 3, 0, 510, 64, 555], ["-", 64, 1, 0, 2, 3, 3, 0, 510, 0, 102], ["+", 64, 1, 0, 2, 3, 3, 0, 510, 0, 102], ["+", 64, 1, 0, 2, 3, 3, 0, 510, 75, 555]]
| 2
| 295
| 4
|
// Rock, Paper, Scissors
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String input;
int count = 0;
String[] data = new String[5];
String judge;
while (!(input = in.readLine()).equals("0")) {
data[count] = input;
count++;
if (count == 5) {
judge = Judge(data);
for (int i = 0; i < data.length; i++) {
if (judge.equals("drow")) {
System.out.println("3");
} else if (judge.equals(data[i])) {
System.out.println("1");
} else {
System.out.println("2");
}
}
count = 0;
}
}
}
private static String Judge(String[] data) {
boolean rock = false;
boolean paper = false;
boolean scissors = false;
for (int i = 0; i < data.length; i++) {
if (data[i].equals("1")) {
rock = true;
} else if (data[i].equals("2")) {
paper = true;
} else if (data[i].equals("3")) {
scissors = true;
}
}
if (rock && !paper && scissors) {
return "1";
} else if (!rock && paper && scissors) {
return "2";
} else if (rock && paper && !scissors) {
return "3";
}
return "drow";
}
}
|
// Rock, Paper, Scissors
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String input;
int count = 0;
String[] data = new String[5];
String judge;
while (!(input = in.readLine()).equals("0")) {
data[count] = input;
count++;
if (count == 5) {
judge = Judge(data);
for (int i = 0; i < data.length; i++) {
if (judge.equals("drow")) {
System.out.println("3");
} else if (judge.equals(data[i])) {
System.out.println("1");
} else {
System.out.println("2");
}
}
count = 0;
}
}
}
private static String Judge(String[] data) {
boolean rock = false;
boolean paper = false;
boolean scissors = false;
for (int i = 0; i < data.length; i++) {
if (data[i].equals("1")) {
rock = true;
} else if (data[i].equals("2")) {
scissors = true;
} else if (data[i].equals("3")) {
paper = true;
}
}
if (rock && !paper && scissors) {
return "1";
} else if (!rock && paper && scissors) {
return "2";
} else if (rock && paper && !scissors) {
return "3";
}
return "drow";
}
}
|
[["-", 75, 57, 64, 196, 0, 1, 0, 11, 31, 22], ["+", 75, 57, 64, 196, 0, 1, 0, 11, 31, 22]]
| 3
| 372
| 4
|
public class Main {
public void run(java.io.InputStream in, java.io.PrintStream out) {
java.util.Scanner sc = new java.util.Scanner(in);
/*answer*/
int[] a;
int[] count;
int i;
count = new int[3];
a = new int[5];
for (;;) {
for (i = 0; i < 3; i++)
count[i] = 0;
a[0] = sc.nextInt();
if (a[0] == 0)
break;
count[a[0] - 1]++;
for (i = 1; i < 5; i++) {
a[i] = sc.nextInt();
count[a[i] - 1]++;
}
if (count[0] * count[1] * count[2] != 0) {
out.printf("3%n3%n3%n3%n3%n");
} else if (count[0] == 5) {
out.printf("3%n3%n3%n3%n3%n");
} else if (count[1] == 5) {
out.printf("3%n3%n3%n3%n3%n");
} else if (count[2] == 5) {
out.printf("3%n3%n3%n3%n3%n");
} else if (count[0] == 0) {
for (i = 0; i < 5; i++) {
if (a[i] == 2)
out.println("1");
else
out.println("2");
}
} else if (count[1] == 0) {
for (i = 0; i < 5; i++) {
if (a[i] == 2)
out.println("1");
else
out.println("2");
}
} else if (count[2] == 0) {
for (i = 0; i < 5; i++) {
if (a[i] == 1)
out.println("1");
else
out.println("2");
}
}
}
sc.close();
}
public static void main(String[] args) {
(new Main()).run(System.in, System.out);
}
}
|
public class Main {
public void run(java.io.InputStream in, java.io.PrintStream out) {
java.util.Scanner sc = new java.util.Scanner(in);
/*answer*/
int[] a;
int[] count;
int i;
count = new int[3];
a = new int[5];
for (;;) {
for (i = 0; i < 3; i++)
count[i] = 0;
a[0] = sc.nextInt();
if (a[0] == 0)
break;
count[a[0] - 1]++;
for (i = 1; i < 5; i++) {
a[i] = sc.nextInt();
count[a[i] - 1]++;
}
if (count[0] * count[1] * count[2] != 0) {
out.printf("3%n3%n3%n3%n3%n");
} else if (count[0] == 5) {
out.printf("3%n3%n3%n3%n3%n");
} else if (count[1] == 5) {
out.printf("3%n3%n3%n3%n3%n");
} else if (count[2] == 5) {
out.printf("3%n3%n3%n3%n3%n");
} else if (count[0] == 0) {
for (i = 0; i < 5; i++) {
if (a[i] == 2)
out.println("1");
else
out.println("2");
}
} else if (count[1] == 0) {
for (i = 0; i < 5; i++) {
if (a[i] == 3)
out.println("1");
else
out.println("2");
}
} else if (count[2] == 0) {
for (i = 0; i < 5; i++) {
if (a[i] == 1)
out.println("1");
else
out.println("2");
}
}
}
sc.close();
}
public static void main(String[] args) {
(new Main()).run(System.in, System.out);
}
}
|
[["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499]]
| 3
| 463
| 2
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = null;
try {
scan = new Scanner(System.in);
int[] dataset = new int[5];
while ((dataset[0] = scan.nextInt()) != 0) {
boolean[] janken = new boolean[3];
for (int i = 0; i < janken.length; i++)
janken[i] = false;
janken[dataset[0] - 1] = true;
for (int i = 1; i < dataset.length; i++) {
dataset[i] = scan.nextInt();
janken[dataset[i] - 1] = true;
}
if (check(janken)) {
for (int i = 0; i < 5; i++) {
System.out.println("3");
}
} else {
for (int i = 0; i < 5; i++) {
if (janken[point(dataset[i] + 1)] == true) {
System.out.println("2");
} else {
System.out.println("1");
}
}
}
}
} finally {
if (scan != null)
scan.close();
}
}
public static boolean check(boolean[] janken) {
for (int i = 0; i < janken.length; i++) {
if (janken[point(i)] == true && janken[point(i)] == false &&
janken[point(i)] == false) {
return true;
}
}
if (janken[0] == true && janken[1] == true && janken[2] == true)
return true;
return false;
}
public static int point(int i) { return i % 3; }
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = null;
try {
scan = new Scanner(System.in);
int[] dataset = new int[5];
while ((dataset[0] = scan.nextInt()) != 0) {
boolean[] janken = new boolean[3];
for (int i = 0; i < janken.length; i++)
janken[i] = false;
janken[dataset[0] - 1] = true;
for (int i = 1; i < dataset.length; i++) {
dataset[i] = scan.nextInt();
janken[dataset[i] - 1] = true;
}
if (check(janken)) {
for (int i = 0; i < 5; i++) {
System.out.println("3");
}
} else {
for (int i = 0; i < 5; i++) {
if (janken[point(dataset[i] + 1)] == true) {
System.out.println("2");
} else {
System.out.println("1");
}
}
}
}
} finally {
if (scan != null)
scan.close();
}
}
public static boolean check(boolean[] janken) {
for (int i = 0; i < janken.length; i++) {
if (janken[point(i)] == true && janken[point(i + 1)] == false &&
janken[point(i + 2)] == false) {
return true;
}
}
if (janken[0] == true && janken[1] == true && janken[2] == true)
return true;
return false;
}
public static int point(int i) { return i % 3; }
}
|
[["+", 31, 504, 71, 492, 3, 4, 0, 16, 17, 72], ["+", 31, 504, 71, 492, 3, 4, 0, 16, 12, 499]]
| 3
| 384
| 4
|
#include <stdio.h>
int main(void) {
int g = 0, c = 0, p = 0, n, i, a[5];
while (scanf("%d", &n)) {
if (n == 0) {
break;
}
a[0] = n;
if (n == 1) {
g++;
}
if (n == 2) {
c++;
}
if (n == 3) {
p++;
}
for (i = 1; i < 5; i++) {
scanf("%d", &n);
a[i] = n;
if (n == 1) {
g++;
}
if (n == 2) {
c++;
}
if (n == 3) {
p++;
}
}
if (g == 5 || c == 5 || p == 5) {
for (i = 0; i < 5; i++) {
a[i] = 3;
printf("%d\n", a[i]);
}
} else if (g == 0 || c == 0 || p == 0) {
if (g > 0 && c > 0) {
for (i = 0; i < 5; i++) {
printf("%d\n", a[i]);
}
} else if (c > 0 && p > 0) {
for (i = 0; i < 5; i++) {
if (a[i] == 2) {
printf("1\n");
} else {
printf("2\n");
}
}
} else if (p > 0 && g > 0) {
for (i = 0; i < 5; i++) {
if (a[1] == 3) {
printf("1\n");
} else {
printf("2\n");
}
}
}
} else {
for (i = 0; i < 5; i++) {
a[i] = 3;
printf("%d\n", a[i]);
}
}
g = 0;
c = 0;
p = 0;
}
}
|
#include <stdio.h>
int main(void) {
int g = 0, c = 0, p = 0, n, i, a[5];
while (scanf("%d", &n)) {
if (n == 0) {
break;
}
a[0] = n;
if (n == 1) {
g++;
}
if (n == 2) {
c++;
}
if (n == 3) {
p++;
}
for (i = 1; i < 5; i++) {
scanf("%d", &n);
a[i] = n;
if (n == 1) {
g++;
}
if (n == 2) {
c++;
}
if (n == 3) {
p++;
}
}
if (g == 5 || c == 5 || p == 5) {
for (i = 0; i < 5; i++) {
a[i] = 3;
printf("%d\n", a[i]);
}
} else if (g == 0 || c == 0 || p == 0) {
if (g > 0 && c > 0) {
for (i = 0; i < 5; i++) {
printf("%d\n", a[i]);
}
} else if (c > 0 && p > 0) {
for (i = 0; i < 5; i++) {
if (a[i] == 2) {
printf("1\n");
} else {
printf("2\n");
}
}
} else if (p > 0 && g > 0) {
for (i = 0; i < 5; i++) {
if (a[i] == 3) {
printf("1\n");
} else {
printf("2\n");
}
}
}
} else {
for (i = 0; i < 5; i++) {
a[i] = 3;
printf("%d\n", a[i]);
}
}
g = 0;
c = 0;
p = 0;
}
}
|
[["-", 0, 57, 15, 23, 0, 16, 31, 69, 71, 13], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22]]
| 0
| 434
| 2
|
p[5];
i, j, f, t;
*s;
main() {
for (; ({
for (f = t = i = 0; i < 5; f |= 1 << p[i++])
scanf("%d", &p[i]), t += p[i];
}),
*p;)
for (i = 0; i < 5; i++) {
for (j = 0; j < 5; j++)
p[i] - p[j] ? s = p[j] - p[i] - 1 && p[j] - p[i] - 2 ? "2" : "1" : 0;
puts(14 ^ f && t % 5 ? s : "3");
}
}
|
p[5];
i, j, f, t;
*s;
main() {
for (; ({
for (f = t = i = 0; i < 5; f |= 1 << p[i++])
scanf("%d", &p[i]), t += p[i];
}),
*p;)
for (i = 0; i < 5; i++) {
for (j = 0; j < 5; j++)
p[i] - p[j] ? s = p[j] - p[i] - 1 && p[j] - p[i] + 2 ? "2" : "1" : 0;
puts(14 ^ f && t % 5 ? s : "3");
}
}
|
[["-", 64, 11, 12, 41, 15, 16, 12, 16, 17, 33], ["+", 64, 11, 12, 41, 15, 16, 12, 16, 17, 72]]
| 0
| 169
| 2
|
i, f, p[5];
main() {
for (; ~scanf("%d\n", p + i); (i %= 5) ?: ({
for (i = -1; i++ < 4;
puts(f % 5 + 1 - p[i] ? f % 5 - p[i] % 3 ? "3" : "1" : "2"))
;
f = 0;
}))
f |= 1 << p[i++];
}
|
i, f, p[5];
main() {
for (; ~scanf("%d\n", p + i); i - 5 ?: ({
for (i = -1; i++ < 4;
puts(f % 5 + 1 - p[i] ? f % 5 - p[i] % 3 ? "3" : "1" : "2"))
;
f = i = 0;
}))
f |= 1 << p[i++];
}
|
[["-", 0, 9, 0, 7, 26, 41, 15, 23, 0, 24], ["-", 0, 7, 26, 41, 15, 23, 0, 11, 17, 132], ["+", 0, 9, 0, 7, 26, 41, 15, 16, 17, 33], ["-", 0, 9, 0, 7, 26, 41, 15, 23, 0, 25], ["+", 0, 7, 26, 41, 75, 23, 0, 11, 17, 32], ["+", 26, 41, 75, 23, 0, 11, 12, 11, 31, 22]]
| 0
| 106
| 6
|
#include <stdio.h>
int main() {
int a[5], g, c, p, i;
while (scanf("%d", &a[0]), a[0]) {
g = 0;
c = 0;
p = 0;
if (a[0] == 1)
g++;
else if (a[0] == 2)
c++;
else if (a[0] == 3)
p++;
for (i = 1; i < 5; i++) {
scanf("%d", &a[i]);
if (a[i] == 1)
g++;
else if (a[i] == 2)
c++;
else if (a[i] == 3)
p++;
}
if (g > 0 && c > 0 && p > 0)
for (i = 0; i < 5; i++)
printf("3\n");
else if (g == 5 || c == 5 || p == 5)
for (i = 0; i < 5; i++)
printf("3\n");
else if (g > 0 && c > 0)
for (i = 0; i < 5; i++) {
if (a[i] == 1)
printf("1\n");
else
printf("2\n");
}
else if (g > 0 && p > 0)
for (i = 0; i < 5; i++) {
if (a[i] == 1)
printf("2\n");
else
printf("1\n");
}
else
for (i = 0; i < 5; i++) {
if (a[i] == 2)
printf("2\n");
else
printf("1\n");
}
}
return 0;
}
|
#include <stdio.h>
int main() {
int a[5], g, c, p, i;
while (scanf("%d", &a[0]), a[0]) {
g = 0;
c = 0;
p = 0;
if (a[0] == 1)
g++;
else if (a[0] == 2)
c++;
else if (a[0] == 3)
p++;
for (i = 1; i < 5; i++) {
scanf("%d", &a[i]);
if (a[i] == 1)
g++;
else if (a[i] == 2)
c++;
else if (a[i] == 3)
p++;
}
if (g > 0 && c > 0 && p > 0)
for (i = 0; i < 5; i++)
printf("3\n");
else if (g == 5 || c == 5 || p == 5)
for (i = 0; i < 5; i++)
printf("3\n");
else if (g > 0 && c > 0)
for (i = 0; i < 5; i++) {
if (a[i] == 1)
printf("1\n");
else
printf("2\n");
}
else if (g > 0 && p > 0)
for (i = 0; i < 5; i++) {
if (a[i] == 1)
printf("2\n");
else
printf("1\n");
}
else
for (i = 0; i < 5; i++) {
if (a[i] == 2)
printf("1\n");
else
printf("2\n");
}
}
return 0;
}
|
[["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 380
| 4
|
h[], b;
main(i) {
for (;
i < 6 ? ~scanf("%d", h + i) ? b |= 8 >> h[i] : 0
: printf("%d\n", b & ~-b && b - 7 ? h[i - 5] - b % 4 ? 1 : 2 : 3);
b = i++ ? b : 0)
i %= 10;
}
|
h[6], b;
main(i) {
for (;
i < 6 ? ~scanf("%d", h + i) ? b |= 8 >> h[i] : 0
: printf("%d\n", b & ~-b && b - 7 ? h[i - 5] - b % 4 ? 1 : 2 : 3);
b = i++ ? b : 0)
i %= 10;
}
|
[["+", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13]]
| 0
| 90
| 9
|
#include <stdio.h>
int main() {
while (1) {
int i, t[5], used[] = {0, 0, 0};
for (i = 0; i < 5; i++) {
scanf("%d", t + i);
used[t[i] % 3]++;
}
if (t[0] == 0)
return 0;
if (used[0] && used[1] && used[2]) {
for (i = 0; i < 5; i++)
puts("3");
} else if (used[0] == 0) {
if (used[1] == 0 || used[2] == 0) {
for (i = 0; i < 5; i++)
puts("3");
} else {
for (i = 0; i < 5; i++) {
if (t[i] == 1)
puts("1");
else
puts("2");
}
}
} else if (used[1] == 0) {
if (used[2] == 0) {
for (i = 0; i < 5; i++)
puts("3");
} else {
for (i = 0; i < 5; i++) {
if (t[i] == 2)
puts("1");
else
puts("2");
}
}
} else {
for (i = 0; i < 5; i++) {
if (t[i] == 0)
puts("1");
else
puts("2");
}
}
}
}
|
#include <stdio.h>
int main() {
while (1) {
int i, t[5], used[] = {0, 0, 0};
for (i = 0; i < 5; i++) {
scanf("%d", t + i);
used[t[i] % 3]++;
}
if (t[0] == 0)
return 0;
if (used[0] && used[1] && used[2]) {
for (i = 0; i < 5; i++)
puts("3");
} else if (used[0] == 0) {
if (used[1] == 0 || used[2] == 0) {
for (i = 0; i < 5; i++)
puts("3");
} else {
for (i = 0; i < 5; i++) {
if (t[i] == 1)
puts("1");
else
puts("2");
}
}
} else if (used[1] == 0) {
if (used[2] == 0) {
for (i = 0; i < 5; i++)
puts("3");
} else {
for (i = 0; i < 5; i++) {
if (t[i] == 2)
puts("1");
else
puts("2");
}
}
} else {
for (i = 0; i < 5; i++) {
if (t[i] == 3)
puts("1");
else
puts("2");
}
}
}
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13]]
| 0
| 341
| 2
|
#include <stdio.h>
int main(void) {
int hand[5], kind[3][2], i, num;
while (1) {
scanf("%d", &hand[0]);
if (hand[0] == 0)
break;
for (i = 0; i < 3; i++)
kind[i][0] = 0, kind[i][1] = 0;
scanf("%d %d %d %d", &hand[1], &hand[2], &hand[3], &hand[4]);
for (i = 0; i < 5; i++)
kind[hand[i] - 1][0]++;
if ((kind[0][0] > 0 && kind[1][0] > 0 && kind[2][0] > 0) ||
kind[0][0] == 5 || kind[1][0] == 5 || kind[2][0] == 5) {
kind[0][1] = 3, kind[1][1] = 3, kind[2][1] = 3;
} else if (kind[0][0] > 0 && kind[1][0] > 0) {
kind[0][1] = 1, kind[1][1] = 2;
} else if (kind[1][0] > 0 && kind[2][0] > 0) {
kind[1][1] = 1, kind[2][1] = 2;
} else if (kind[0][0] > 0 && kind[1][0] > 0) {
kind[2][1] = 1, kind[0][1] = 2;
}
for (i = 0; i < 5; i++) {
printf("%d\n", kind[hand[i] - 1][1]);
}
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int hand[5], kind[3][2], i, num;
while (1) {
scanf("%d", &hand[0]);
if (hand[0] == 0)
break;
for (i = 0; i < 3; i++)
kind[i][0] = 0, kind[i][1] = 0;
scanf("%d %d %d %d", &hand[1], &hand[2], &hand[3], &hand[4]);
for (i = 0; i < 5; i++)
kind[hand[i] - 1][0]++;
if ((kind[0][0] > 0 && kind[1][0] > 0 && kind[2][0] > 0) ||
kind[0][0] == 5 || kind[1][0] == 5 || kind[2][0] == 5) {
kind[0][1] = 3, kind[1][1] = 3, kind[2][1] = 3;
} else if (kind[0][0] > 0 && kind[1][0] > 0) {
kind[0][1] = 1, kind[1][1] = 2;
} else if (kind[1][0] > 0 && kind[2][0] > 0) {
kind[1][1] = 1, kind[2][1] = 2;
} else if (kind[2][0] > 0 && kind[0][0] > 0) {
kind[2][1] = 1, kind[0][1] = 2;
}
for (i = 0; i < 5; i++) {
printf("%d\n", kind[hand[i] - 1][1]);
}
}
return 0;
}
|
[["-", 0, 16, 31, 16, 31, 69, 28, 69, 71, 13], ["+", 0, 16, 31, 16, 31, 69, 28, 69, 71, 13], ["-", 0, 16, 12, 16, 31, 69, 28, 69, 71, 13], ["+", 0, 16, 12, 16, 31, 69, 28, 69, 71, 13]]
| 0
| 418
| 4
|
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int INF = 1e9;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, d[10], v[10];
while (cin >> n && n) {
REP(i, n) {
cin >> d[i] >> v[i];
ll a = gcd(d[i], v[i]);
v[i] /= a;
d[i] /= a;
}
ll c = 1;
REP(i, n) c = lcm(c, d[i]);
REP(i, n) v[i] *= (c / d[i]);
ll ans = d[0];
REP(i, n) ans = gcd(ans, v[i]);
REP(i, n) cout << v[i] / ans << endl;
}
}
|
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int INF = 1e9;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, d[10], v[10];
while (cin >> n && n) {
REP(i, n) {
cin >> d[i] >> v[i];
ll a = gcd(d[i], v[i]);
v[i] /= a;
d[i] /= a;
}
ll c = 1;
REP(i, n) c = lcm(c, d[i]);
REP(i, n) v[i] *= (c / d[i]);
ll ans = v[0];
REP(i, n) ans = gcd(ans, v[i]);
REP(i, n) cout << v[i] / ans << endl;
}
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 69, 28, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 69, 28, 22]]
| 1
| 280
| 2
|
#!/usr/bin/ruby
require 'rational'
while(n=gets.to_i)>0
a=n.times.map{b=gets.split.map(&:to_i)}
l=1;n.times{|i|l=l/l.gcd(a[i][0])*a[i][0]}
b=n.times.map{|i|a[i][1]*l/a[i][0]}
g=b[0];n.times{|i|g=g.gcd b[i]}
n.times{|i|p b[0]/g}
end
|
#!/usr/bin/ruby
require 'rational'
while(n=gets.to_i)>0
a=n.times.map{b=gets.split.map(&:to_i)}
l=1;n.times{|i|l=l/l.gcd(a[i][0])*a[i][0]}
b=n.times.map{|i|a[i][1]*l/a[i][0]}
g=b[0];n.times{|i|g=g.gcd b[i]}
n.times{|i|p b[i]/g}
end
|
[["-", 0, 652, 3, 4, 0, 738, 31, 742, 0, 612], ["+", 0, 652, 3, 4, 0, 738, 31, 742, 0, 22]]
| 4
| 140
| 20
|
import java.util.*;
public class Main {
Scanner sc = new Scanner(System.in);
class State implements Comparable<State> {
int now, cost, tick;
public State(int now, int cost, int tick) {
this.now = now;
this.cost = cost;
this.tick = tick;
}
@Override
public int compareTo(State arg0) {
return this.cost - arg0.cost;
}
}
private void doit() {
while (true) {
int c = sc.nextInt();
int n = sc.nextInt();
int m = sc.nextInt();
int s = sc.nextInt();
int d = sc.nextInt();
if ((c | n | m | s | d) == 0)
break;
s--;
d--;
int[][] pass = new int[n][n];
int INF = 1 << 24;
for (int i = 0; i < n; i++) {
Arrays.fill(pass[i], INF);
pass[i][i] = 0;
}
for (int i = 0; i < n; i++) {
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
int cost = sc.nextInt();
pass[a][b] = cost;
pass[b][a] = cost;
}
PriorityQueue<State> open = new PriorityQueue<Main.State>();
open.add(new State(s, 0, c));
int[][] close = new int[n][c + 1];
for (int i = 0; i < n; i++) {
Arrays.fill(close[i], INF);
}
close[s][c] = 0;
int ans = -1;
while (!open.isEmpty()) {
State now = open.poll();
if (now.now == d) {
ans = now.cost;
break;
}
for (int i = 0; i < n; i++) {
if (pass[now.now][i] == INF)
continue;
int nextcost = now.cost + pass[now.now][i];
if (close[i][now.tick] > nextcost) {
open.add(new State(i, nextcost, now.tick));
close[i][now.tick] = nextcost;
}
if (now.tick != 0) {
nextcost = now.cost + pass[now.now][i] / 2;
if (close[i][now.tick - 1] > nextcost) {
open.add(new State(i, nextcost, now.tick - 1));
close[i][now.tick - 1] = nextcost;
}
}
}
}
System.out.println(ans);
}
}
private void debug(Object... o) {
System.out.println("debug = " + Arrays.deepToString(o));
}
public static void main(String[] args) { new Main().doit(); }
}
|
import java.util.*;
public class Main {
Scanner sc = new Scanner(System.in);
class State implements Comparable<State> {
int now, cost, tick;
public State(int now, int cost, int tick) {
this.now = now;
this.cost = cost;
this.tick = tick;
}
@Override
public int compareTo(State arg0) {
return this.cost - arg0.cost;
}
}
private void doit() {
while (true) {
int c = sc.nextInt();
int n = sc.nextInt();
int m = sc.nextInt();
int s = sc.nextInt();
int d = sc.nextInt();
if ((c | n | m | s | d) == 0)
break;
s--;
d--;
int[][] pass = new int[n][n];
int INF = 1 << 24;
for (int i = 0; i < n; i++) {
Arrays.fill(pass[i], INF);
pass[i][i] = 0;
}
for (int i = 0; i < m; i++) {
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
int cost = sc.nextInt();
pass[a][b] = cost;
pass[b][a] = cost;
}
PriorityQueue<State> open = new PriorityQueue<Main.State>();
open.add(new State(s, 0, c));
int[][] close = new int[n][c + 1];
for (int i = 0; i < n; i++) {
Arrays.fill(close[i], INF);
}
close[s][c] = 0;
int ans = -1;
while (!open.isEmpty()) {
State now = open.poll();
if (now.now == d) {
ans = now.cost;
break;
}
for (int i = 0; i < n; i++) {
if (pass[now.now][i] == INF)
continue;
int nextcost = now.cost + pass[now.now][i];
if (close[i][now.tick] > nextcost) {
open.add(new State(i, nextcost, now.tick));
close[i][now.tick] = nextcost;
}
if (now.tick != 0) {
nextcost = now.cost + pass[now.now][i] / 2;
if (close[i][now.tick - 1] > nextcost) {
open.add(new State(i, nextcost, now.tick - 1));
close[i][now.tick - 1] = nextcost;
}
}
}
}
System.out.println(ans);
}
}
private void debug(Object... o) {
System.out.println("debug = " + Arrays.deepToString(o));
}
public static void main(String[] args) { new Main().doit(); }
}
|
[["-", 0, 52, 8, 196, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 12, 22]]
| 3
| 663
| 2
|
#include <stdio.h>
#include <string.h>
#define NODE (100)
#define TICKET (10)
#define INF (100000000)
int U[NODE];
int dist[TICKET + 1][NODE];
int cost[NODE][NODE];
int c, n, s, d;
int V;
int min(int a, int b) { return (a > b ? b : a); }
void dijkstra(int s) {
int i, j, k;
int v;
for (i = 0; i < V; i++) {
U[i] = 1;
}
for (i = 0; i <= c; i++) {
for (j = 0; j < V; j++) {
dist[i][j] = INF;
}
}
for (i = 0; i <= c; i++) {
dist[i][s] = 0;
}
for (k = 0; k <= c; k++) {
memset(U, 0, sizeof(U));
for (i = 0; i < V; i++) {
v = -1;
for (j = 0; j < V; j++) {
if (U[j] == 0 && (v == -1 || dist[c][v] > dist[c][j])) {
v = j;
}
}
if (v == -1) {
break;
}
U[v] = 1;
for (j = 0; j < V; j++) {
if (U[j] == 0) {
if (k == 0) {
dist[k][j] = min(dist[k][j], dist[k][v] + cost[v][j]);
} else {
dist[k][j] = min(dist[k][j], min(dist[k][v] + cost[v][j],
dist[k - 1][v] + cost[v][j] / 2));
}
}
}
}
}
}
int main(void) {
int i, j;
int from, to, m;
while (1) {
scanf("%d%d%d%d%d", &c, &V, &n, &s, &d);
if (c + V + n + s + d == 0) {
break;
}
for (i = 0; i < V; i++) {
for (j = 0; j < V; j++) {
cost[i][j] = INF;
}
}
while (n-- != 0) {
scanf("%d%d%d", &from, &to, &m);
cost[from - 1][to - 1] = cost[to - 1][from - 1] = m;
}
dijkstra(s - 1);
printf("%d\n", dist[c][d - 1]);
}
return (0);
}
|
#include <stdio.h>
#include <string.h>
#define NODE (100)
#define TICKET (10)
#define INF (100000000)
int U[NODE];
int dist[TICKET + 1][NODE];
int cost[NODE][NODE];
int c, n, s, d;
int V;
int min(int a, int b) { return (a > b ? b : a); }
void dijkstra(int s) {
int i, j, k;
int v;
for (i = 0; i < V; i++) {
U[i] = 1;
}
for (i = 0; i <= c; i++) {
for (j = 0; j < V; j++) {
dist[i][j] = INF;
}
}
for (i = 0; i <= c; i++) {
dist[i][s] = 0;
}
for (k = 0; k <= c; k++) {
memset(U, 0, sizeof(U));
for (i = 0; i < V; i++) {
v = -1;
for (j = 0; j < V; j++) {
if (U[j] == 0 && (v == -1 || dist[k][v] > dist[k][j])) {
v = j;
}
}
if (v == -1) {
break;
}
U[v] = 1;
for (j = 0; j < V; j++) {
if (U[j] == 0) {
if (k == 0) {
dist[k][j] = min(dist[k][j], dist[k][v] + cost[v][j]);
} else {
dist[k][j] = min(dist[k][j], min(dist[k][v] + cost[v][j],
dist[k - 1][v] + cost[v][j] / 2));
}
}
}
}
}
}
int main(void) {
int i, j;
int from, to, m;
while (1) {
scanf("%d%d%d%d%d", &c, &V, &n, &s, &d);
if (c + V + n + s + d == 0) {
break;
}
for (i = 0; i < V; i++) {
for (j = 0; j < V; j++) {
cost[i][j] = INF;
}
}
while (n-- != 0) {
scanf("%d%d%d", &from, &to, &m);
cost[from - 1][to - 1] = cost[to - 1][from - 1] = m;
}
dijkstra(s - 1);
printf("%d\n", dist[c][d - 1]);
}
return (0);
}
|
[["-", 0, 16, 12, 16, 31, 69, 28, 69, 71, 22], ["+", 0, 16, 12, 16, 31, 69, 28, 69, 71, 22], ["-", 0, 16, 12, 16, 12, 69, 28, 69, 71, 22], ["+", 0, 16, 12, 16, 12, 69, 28, 69, 71, 22]]
| 0
| 609
| 4
|
#include <algorithm>
#include <iostream>
using namespace std;
#define MAX 100
#define INF 100000000
int G[MAX][MAX];
int c, n, m, s, d, a, b, f;
int dijkstra() {
int D[MAX][11];
bool visited[MAX][11];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= c; j++) {
D[i][j] = INF;
visited[i][j] = false;
}
}
D[s][c] = 0;
while (true) {
int u, w, minv = INF;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= c; j++) {
if (!visited[i][j] && minv > D[i][j]) {
minv = D[i][j];
u = i;
w = j;
}
}
}
if (minv == INF) {
break;
}
visited[u][w] = true;
for (int v = 0; v < n; v++) {
if (G[u][v] == INF) {
continue;
}
D[v][w] = min(D[v][w], D[u][w] + G[u][v]);
if (w) {
D[v][w - 1] = min(D[v][w - 1], D[u][w] + G[u][v] / 2);
}
}
}
int minv = INF;
for (int i = 0; i <= c; i++) {
minv = min(minv, D[d][i]);
}
return minv;
}
int main() {
while (true) {
cin >> c >> n >> m >> s >> d;
if (s == 0 && d == 0) {
break;
}
s--;
d--;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
G[i][j] = INF;
}
}
for (int i = 0; i < n; i++) {
cin >> a >> b >> f;
a--;
b--;
G[a][b] = G[b][a] = f;
}
cout << dijkstra() << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
#define MAX 100
#define INF 1000000
int G[MAX][MAX];
int c, n, m, s, d, a, b, f;
int dijkstra() {
int D[MAX][11];
bool visited[MAX][11];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= c; j++) {
D[i][j] = INF;
visited[i][j] = false;
}
}
D[s][c] = 0;
while (true) {
int u, w, minv = INF;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= c; j++) {
if (!visited[i][j] && minv > D[i][j]) {
minv = D[i][j];
u = i;
w = j;
}
}
}
if (minv == INF) {
break;
}
visited[u][w] = true;
for (int v = 0; v < n; v++) {
if (G[u][v] == INF) {
continue;
}
D[v][w] = min(D[v][w], D[u][w] + G[u][v]);
if (w) {
D[v][w - 1] = min(D[v][w - 1], D[u][w] + G[u][v] / 2);
}
}
}
int minv = INF;
for (int i = 0; i <= c; i++) {
minv = min(minv, D[d][i]);
}
return minv;
}
int main() {
while (true) {
cin >> c >> n >> m >> s >> d;
if (s == 0 && d == 0) {
break;
}
s--;
d--;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
G[i][j] = INF;
}
}
for (int i = 0; i < m; i++) {
cin >> a >> b >> f;
a--;
b--;
G[a][b] = G[b][a] = f;
}
cout << dijkstra() << endl;
}
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22]]
| 1
| 532
| 4
|
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#define reep(i, n, m) for (int i = (n); i < (m); i++)
#define rep(i, n) reep(i, 0, n)
using namespace std;
class Edge {
public:
int to;
int cost;
Edge(int to, int cost) : to(to), cost(cost) {}
};
class Node {
public:
int distance;
int num;
int ticket;
Node() {}
Node(int distance, int num, int ticket)
: distance(distance), num(num), ticket(ticket) {}
bool operator<(const Node &b) const { return distance > b.distance; }
};
vector<Edge> edge[101];
bool flg[101][11];
int c, n, m, s, d;
int solve() {
priority_queue<Node> Q;
Q.push(Node(0, s, 0));
int ans = 1000000;
while (!Q.empty()) {
Node node = Q.top();
Q.pop();
if (flg[node.num][node.ticket]) {
continue;
}
flg[node.num][node.ticket] = true;
// printf("num->%d cost->%d
// ticket->%d\n",node.num,node.distance,node.ticket);
if (node.num == d) {
ans = min(ans, node.distance);
}
rep(i, edge[node.num].size()) {
Edge e = edge[node.num][i];
int cost = node.distance + e.cost;
Q.push(Node(cost, e.to, node.ticket));
if (node.ticket < c) {
int cost = node.distance + e.cost / 2;
Q.push(Node(cost, e.to, node.ticket + 1));
}
}
}
return solve();
}
void init() {
rep(i, 101) {
edge[i].clear();
rep(k, 11) { flg[i][k] = 0; }
}
}
int main() {
while (cin >> c >> n >> m >> s >> d, !m == 0) {
init();
rep(i, m) {
int a, b, c;
cin >> a >> b >> c;
edge[a].push_back(Edge(b, c));
edge[b].push_back(Edge(a, c));
}
cout << solve() << endl;
}
}
|
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#define reep(i, n, m) for (int i = (n); i < (m); i++)
#define rep(i, n) reep(i, 0, n)
using namespace std;
class Edge {
public:
int to;
int cost;
Edge(int to, int cost) : to(to), cost(cost) {}
};
class Node {
public:
int distance;
int num;
int ticket;
Node() {}
Node(int distance, int num, int ticket)
: distance(distance), num(num), ticket(ticket) {}
bool operator<(const Node &b) const { return distance > b.distance; }
};
vector<Edge> edge[101];
bool flg[101][11];
int c, n, m, s, d;
int solve() {
priority_queue<Node> Q;
Q.push(Node(0, s, 0));
int ans = 1000000;
while (!Q.empty()) {
Node node = Q.top();
Q.pop();
if (flg[node.num][node.ticket]) {
continue;
}
flg[node.num][node.ticket] = true;
// printf("num->%d cost->%d
// ticket->%d\n",node.num,node.distance,node.ticket);
if (node.num == d) {
ans = min(ans, node.distance);
}
rep(i, edge[node.num].size()) {
Edge e = edge[node.num][i];
int cost = node.distance + e.cost;
Q.push(Node(cost, e.to, node.ticket));
if (node.ticket < c) {
int cost = node.distance + e.cost / 2;
Q.push(Node(cost, e.to, node.ticket + 1));
}
}
}
return ans;
}
void init() {
rep(i, 101) {
edge[i].clear();
rep(k, 11) { flg[i][k] = 0; }
}
}
int main() {
while (cin >> c >> n >> m >> s >> d, !m == 0) {
init();
rep(i, m) {
int a, b, c;
cin >> a >> b >> c;
edge[a].push_back(Edge(b, c));
edge[b].push_back(Edge(a, c));
}
cout << solve() << endl;
}
}
|
[["-", 0, 14, 8, 9, 0, 37, 0, 2, 63, 22], ["-", 8, 9, 0, 37, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 37, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22]]
| 1
| 515
| 4
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define CLR(a) memset((a), 0, sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF 1e8
struct edge {
int to, cost;
};
struct P {
int from, cost, ticket;
bool operator>(const P &p) const { return cost > p.cost; }
};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
int ticket_n, node_n, edge_n, start, goal;
int main() {
while (cin >> ticket_n >> node_n >> edge_n >> start >> goal,
ticket_n | node_n | edge_n | start | goal) {
vector<vector<edge>> E(edge_n + 1);
REP(i, edge_n) {
int from, to, cost;
cin >> from >> to >> cost;
E[from].push_back({to, cost});
E[to].push_back({from, cost});
}
vvi G(edge_n + 1, vi(ticket_n + 1, INF));
priority_queue<P, vector<P>, greater<P>> q;
q.push({start, 0, ticket_n});
while (!q.empty()) {
P p = q.top();
q.pop();
if (p.from == goal) {
cout << p.cost << endl;
break;
}
int from = p.from, cost = p.cost, ticket = p.ticket;
for (edge e : E[from]) {
// use ticket
if (G[e.to][ticket] > cost + e.cost) {
G[e.to][ticket] = cost + e.cost;
q.push({e.to, cost + e.cost, ticket});
}
// don't use ticket
if (ticket - 1 >= 0) {
if (G[e.to][ticket - 1] > cost + e.cost / 2) {
G[e.to][ticket - 1] = cost + e.cost / 2;
q.push({e.to, cost + e.cost / 2, ticket - 1});
}
}
}
}
}
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define CLR(a) memset((a), 0, sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF 1e8
struct edge {
int to, cost;
};
struct P {
int from, cost, ticket;
bool operator>(const P &p) const { return cost > p.cost; }
};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
int ticket_n, node_n, edge_n, start, goal;
int main() {
while (cin >> ticket_n >> node_n >> edge_n >> start >> goal,
ticket_n | node_n | edge_n | start | goal) {
vector<vector<edge>> E(node_n + 1);
REP(i, edge_n) {
int from, to, cost;
cin >> from >> to >> cost;
E[from].push_back({to, cost});
E[to].push_back({from, cost});
}
vvi G(node_n + 1, vi(ticket_n + 1, INF));
priority_queue<P, vector<P>, greater<P>> q;
q.push({start, 0, ticket_n});
while (!q.empty()) {
P p = q.top();
q.pop();
if (p.from == goal) {
cout << p.cost << endl;
break;
}
int from = p.from, cost = p.cost, ticket = p.ticket;
for (edge e : E[from]) {
// use ticket
if (G[e.to][ticket] > cost + e.cost) {
G[e.to][ticket] = cost + e.cost;
q.push({e.to, cost + e.cost, ticket});
}
// don't use ticket
if (ticket - 1 >= 0) {
if (G[e.to][ticket - 1] > cost + e.cost / 2) {
G[e.to][ticket - 1] = cost + e.cost / 2;
q.push({e.to, cost + e.cost / 2, ticket - 1});
}
}
}
}
}
}
|
[["-", 0, 43, 49, 50, 51, 4, 0, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 31, 22]]
| 1
| 611
| 4
|
#include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
const int MAX_V = 101;
const int INF = 0x3f3f3f3f;
//??? T???cap??????rev????????°???????????§?????£???????????????
struct Edge {
int to;
int cost;
Edge(int to_, int cost_) : to(to_), cost(cost_) {}
};
std::vector<Edge> G[MAX_V]; //??£??\?????????
int d[11][MAX_V]; //[?????¨???????????±??????????????°][?????????]
int pre[MAX_V];
void AddEdge(int from, int to, int cost) { G[from].push_back(Edge(to, cost)); }
void ClearEdge() {
for (int i = 0; i < MAX_V; ++i)
G[i].clear();
memset(d, 0, sizeof(d));
memset(pre, -1, sizeof(pre));
}
void Dijkstra(int c, int s) {
typedef std::pair<int, int> P; // first:???????????¢, second:????????????
std::priority_queue<P, std::vector<P>, std::greater<P>> q;
std::fill(d[c], d[c] + MAX_V, INF);
memset(pre, -1, sizeof(pre));
d[c][s] = 0;
q.push(P(0, s));
while (!q.empty()) {
P p = q.top();
q.pop();
int from = p.second;
if (d[c][from] < p.first)
continue;
for (Edge e : G[from]) {
int dmin;
if (c == 0)
dmin = d[c][from] + e.cost;
else
dmin = std::min(d[c][from] + e.cost, d[c - 1][from] + e.cost / 2);
if (d[c][e.to] > dmin) {
d[c][e.to] = dmin;
q.push(P(d[c][e.to], e.to));
pre[e.to] = from;
}
}
}
}
std::vector<int> GetPath(int t) {
std::vector<int> path;
for (; t != -1; t = pre[t])
path.push_back(t);
std::reverse(path.begin(), path.end());
return path;
}
using namespace std;
int main(void) {
int c, n, m, s, g;
while (1) {
cin >> c >> n >> m >> s >> g;
if (c == n && n == m && m == s && s == g && g == 0)
return 0;
int a, b, f;
for (int i = 0; i < n; ++i) {
cin >> a >> b >> f;
AddEdge(a, b, f);
AddEdge(b, a, f);
}
for (int i = 0; i <= c; ++i) {
Dijkstra(i, s);
}
cout << d[c][g] << endl;
ClearEdge();
}
}
|
#include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
const int MAX_V = 101;
const int INF = 0x3f3f3f3f;
//??? T???cap??????rev????????°???????????§?????£???????????????
struct Edge {
int to;
int cost;
Edge(int to_, int cost_) : to(to_), cost(cost_) {}
};
std::vector<Edge> G[MAX_V]; //??£??\?????????
int d[11][MAX_V]; //[?????¨???????????±??????????????°][?????????]
int pre[MAX_V];
void AddEdge(int from, int to, int cost) { G[from].push_back(Edge(to, cost)); }
void ClearEdge() {
for (int i = 0; i < MAX_V; ++i)
G[i].clear();
memset(d, 0, sizeof(d));
memset(pre, -1, sizeof(pre));
}
void Dijkstra(int c, int s) {
typedef std::pair<int, int> P; // first:???????????¢, second:????????????
std::priority_queue<P, std::vector<P>, std::greater<P>> q;
std::fill(d[c], d[c] + MAX_V, INF);
memset(pre, -1, sizeof(pre));
d[c][s] = 0;
q.push(P(0, s));
while (!q.empty()) {
P p = q.top();
q.pop();
int from = p.second;
if (d[c][from] < p.first)
continue;
for (Edge e : G[from]) {
int dmin;
if (c == 0)
dmin = d[c][from] + e.cost;
else
dmin = std::min(d[c][from] + e.cost, d[c - 1][from] + e.cost / 2);
if (d[c][e.to] > dmin) {
d[c][e.to] = dmin;
q.push(P(d[c][e.to], e.to));
pre[e.to] = from;
}
}
}
}
std::vector<int> GetPath(int t) {
std::vector<int> path;
for (; t != -1; t = pre[t])
path.push_back(t);
std::reverse(path.begin(), path.end());
return path;
}
using namespace std;
int main(void) {
int c, n, m, s, g;
while (1) {
cin >> c >> n >> m >> s >> g;
if (c == n && n == m && m == s && s == g && g == 0)
return 0;
int a, b, f;
for (int i = 0; i < m; ++i) {
cin >> a >> b >> f;
AddEdge(a, b, f);
AddEdge(b, a, f);
}
for (int i = 0; i <= c; ++i) {
Dijkstra(i, s);
}
cout << d[c][g] << endl;
ClearEdge();
}
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22]]
| 1
| 660
| 2
|
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> edge;
struct state {
int cost, coupon, station;
state(int cost_, int coupon_, int station_)
: cost(cost_), coupon(coupon_), station(station_) {}
bool operator<(const state &s) const {
if (cost == s.cost) {
return coupon > s.coupon;
}
return cost > s.cost;
}
};
int djikstra(vector<vector<edge>> graph, int start, int goal, int coupon) {
priority_queue<state> pq;
pq.push(state(0, coupon, start));
bool visited[coupon][graph.size()];
return 0;
fill_n((bool *)visited, (coupon + 1) * graph.size(), false);
while (!pq.empty()) {
state cur = pq.top();
pq.pop();
if (visited[cur.coupon][cur.station]) {
continue;
}
if (cur.station == goal) {
return cur.cost;
}
visited[cur.coupon][cur.station] = true;
for (int i = 0; i < graph[cur.station].size(); ++i) {
int to = graph[cur.station][i].first;
int c = graph[cur.station][i].second;
if (cur.coupon > 0) {
pq.push(state(cur.cost + c / 2, cur.coupon - 1, to));
}
pq.push(state(cur.cost + c, cur.coupon, to));
}
}
// assert(false);
return -1;
}
int main() {
int c, n, m, s, d;
while (true) {
cin >> c >> n >> m >> s >> d;
if ((c | n | m | s | d) == 0) {
break;
}
vector<vector<edge>> graph(n + 1, vector<edge>());
for (int i = 0; i < m; ++i) {
int a, b, f;
cin >> a >> b >> f;
graph[a].push_back(make_pair(b, f));
graph[b].push_back(make_pair(a, f));
}
cout << djikstra(graph, s, d, c) << endl;
}
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> edge;
struct state {
int cost, coupon, station;
state(int cost_, int coupon_, int station_)
: cost(cost_), coupon(coupon_), station(station_) {}
bool operator<(const state &s) const {
if (cost == s.cost) {
return coupon > s.coupon;
}
return cost > s.cost;
}
};
int djikstra(vector<vector<edge>> graph, int start, int goal, int coupon) {
priority_queue<state> pq;
pq.push(state(0, coupon, start));
bool visited[coupon + 1][graph.size()];
fill_n((bool *)visited, (coupon + 1) * graph.size(), false);
while (!pq.empty()) {
state cur = pq.top();
pq.pop();
if (visited[cur.coupon][cur.station]) {
continue;
}
if (cur.station == goal) {
return cur.cost;
}
visited[cur.coupon][cur.station] = true;
for (int i = 0; i < graph[cur.station].size(); ++i) {
int to = graph[cur.station][i].first;
int c = graph[cur.station][i].second;
if (cur.coupon > 0) {
pq.push(state(cur.cost + c / 2, cur.coupon - 1, to));
}
pq.push(state(cur.cost + c, cur.coupon, to));
}
}
// assert(false);
return -1;
}
int main() {
int c, n, m, s, d;
while (true) {
cin >> c >> n >> m >> s >> d;
if ((c | n | m | s | d) == 0) {
break;
}
vector<vector<edge>> graph(n + 1, vector<edge>());
for (int i = 0; i < m; ++i) {
int a, b, f;
cin >> a >> b >> f;
graph[a].push_back(make_pair(b, f));
graph[b].push_back(make_pair(a, f));
}
cout << djikstra(graph, s, d, c) << endl;
}
return 0;
}
|
[["+", 0, 43, 49, 80, 49, 80, 81, 16, 17, 72], ["+", 0, 43, 49, 80, 49, 80, 81, 16, 12, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]]
| 1
| 524
| 5
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> piii; // cost, v, ticket
struct edge {
int to, cost;
};
int main(int argc, char *argv[]) {
int c, n, m, s, d;
while (std::cin >> c >> n >> m >> s >> d, n) {
s--;
d--;
vector<vector<edge>> g(n);
for (int i = 0; i < m; i++) {
edge e;
int from;
std::cin >> from >> e.to >> e.cost;
e.to--;
from--;
g[from].push_back(e);
g[e.to].push_back((edge){from, e.cost});
}
vector<vector<int>> dp(c + 1, vector<int>(n, 1e9));
dp[0][s] = 0;
priority_queue<piii, vector<piii>, greater<piii>> que;
que.push(piii(0, pii(s, 0)));
while (!que.empty()) {
int cost = que.top().first;
int v = que.top().second.first;
int ticket = que.top().second.second;
que.pop();
for (int i = 0; i < g[v].size(); i++) {
edge e = g[v][i];
if (dp[ticket][e.to] > dp[ticket][v] + e.cost) {
dp[ticket][e.to] = dp[ticket][v] + e.cost;
que.push(piii(dp[ticket][e.to], pii(e.to, ticket)));
}
if (ticket + 1 <= c &&
dp[ticket + 1][e.to] > dp[ticket][v] + e.cost / 2) {
dp[ticket + 1][e.to] = dp[ticket][v] + e.cost / 2;
que.push(piii(dp[ticket + 1][e.to], pii(e.to, ticket + 1)));
}
}
}
int ans = 1e9;
for (int i = 0; i < c; i++) {
ans = min(ans, dp[i][d]);
}
std::cout << ans << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> piii; // cost, v, ticket
struct edge {
int to, cost;
};
int main(int argc, char *argv[]) {
int c, n, m, s, d;
while (std::cin >> c >> n >> m >> s >> d, n) {
s--;
d--;
vector<vector<edge>> g(n);
for (int i = 0; i < m; i++) {
edge e;
int from;
std::cin >> from >> e.to >> e.cost;
e.to--;
from--;
g[from].push_back(e);
g[e.to].push_back((edge){from, e.cost});
}
vector<vector<int>> dp(c + 1, vector<int>(n, 1e9));
dp[0][s] = 0;
priority_queue<piii, vector<piii>, greater<piii>> que;
que.push(piii(0, pii(s, 0)));
while (!que.empty()) {
int cost = que.top().first;
int v = que.top().second.first;
int ticket = que.top().second.second;
que.pop();
for (int i = 0; i < g[v].size(); i++) {
edge e = g[v][i];
if (dp[ticket][e.to] > dp[ticket][v] + e.cost) {
dp[ticket][e.to] = dp[ticket][v] + e.cost;
que.push(piii(dp[ticket][e.to], pii(e.to, ticket)));
}
if (ticket + 1 <= c &&
dp[ticket + 1][e.to] > dp[ticket][v] + e.cost / 2) {
dp[ticket + 1][e.to] = dp[ticket][v] + e.cost / 2;
que.push(piii(dp[ticket + 1][e.to], pii(e.to, ticket + 1)));
}
}
}
int ans = 1e9;
for (int i = 0; i <= c; i++) {
ans = min(ans, dp[i][d]);
}
std::cout << ans << std::endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 545
| 2
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF INT_MAX / 3
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define CLR(a) memset(a, 0, sizeof(a))
typedef long long int ll;
using namespace std;
int c, n, m, s, d;
int main() {
while (true) {
scanf("%d%d%d%d%d", &c, &n, &m, &s, &d);
if (c == 0 || n == 0 || m == 0 || s == 0 || d == 0)
break;
int rosen[101][101] = {10000000};
int dp[11][101];
REP(i, 101) REP(j, 101) rosen[i][j] = 10000000;
REP(i, 11) REP(j, 101) dp[i][j] = 10000000;
REP(i, m) {
int a, b, f;
cin >> a >> b >> f;
rosen[a][b] = f;
rosen[b][a] = f;
}
int ans = 10000000;
vector<bool> used(n + 1, false);
queue<int> q;
queue<int> th;
dp[c][s] = 0;
q.push(s);
th.push(c);
while (!q.empty()) {
int p = q.front();
int t = th.front();
q.pop();
th.pop();
FOR(i, 1, n + 1) {
if (dp[c][i] > dp[c][p] + rosen[p][i]) {
dp[c][i] = dp[c][p] + rosen[p][i];
q.push(i);
th.push(t);
}
if (t > 0 && dp[t - 1][i] > dp[t][p] + rosen[p][i] / 2) {
dp[t - 1][i] = dp[t][p] + rosen[p][i] / 2;
q.push(i);
th.push(t - 1);
}
}
}
REP(i, c + 1) {
if (dp[i][d] > 0)
ans = min(ans, dp[i][d]);
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF INT_MAX / 3
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define CLR(a) memset(a, 0, sizeof(a))
typedef long long int ll;
using namespace std;
int c, n, m, s, d;
int main() {
while (true) {
scanf("%d%d%d%d%d", &c, &n, &m, &s, &d);
if (c == 0 || n == 0 || m == 0 || s == 0 || d == 0)
break;
int rosen[101][101] = {10000000};
int dp[11][101];
REP(i, 101) REP(j, 101) rosen[i][j] = 10000000;
REP(i, 11) REP(j, 101) dp[i][j] = 10000000;
REP(i, m) {
int a, b, f;
cin >> a >> b >> f;
rosen[a][b] = f;
rosen[b][a] = f;
}
int ans = 10000000;
vector<bool> used(n + 1, false);
queue<int> q;
queue<int> th;
dp[c][s] = 0;
q.push(s);
th.push(c);
while (!q.empty()) {
int p = q.front();
int t = th.front();
q.pop();
th.pop();
FOR(i, 1, n + 1) {
if (dp[t][i] > dp[t][p] + rosen[p][i]) {
dp[t][i] = dp[t][p] + rosen[p][i];
q.push(i);
th.push(t);
}
if (t > 0 && dp[t - 1][i] > dp[t][p] + rosen[p][i] / 2) {
dp[t - 1][i] = dp[t][p] + rosen[p][i] / 2;
q.push(i);
th.push(t - 1);
}
}
}
REP(i, c + 1) {
if (dp[i][d] > 0)
ans = min(ans, dp[i][d]);
}
cout << ans << endl;
}
return 0;
}
|
[["-", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 12, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 12, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22]]
| 1
| 553
| 8
|
#include <bits/stdc++.h>
#define MAX_V 101
using namespace std;
struct edge {
int to, cost;
edge() {}
edge(int to, int cost) : to(to), cost(cost){};
};
typedef pair<int, int> P;
const int INF = 1 << 30;
int V; //ノードの数
vector<edge> Graph[MAX_V];
int min_cost[11][MAX_V];
int c, m, s, d;
void Dijkstra(int s, int chip) { // s:スタートからの最小コストをmin_costに設定
priority_queue<P, vector<P>, greater<P>> que;
min_cost[chip][s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int now = p.second;
int cost = p.first;
if (min_cost[chip][now] < cost)
continue;
for (int i = 0; i < Graph[now].size(); i++) {
edge e = Graph[now][i];
int a;
if (chip == 0) {
a = min_cost[chip][now] + e.cost;
} else {
a = min(min_cost[chip][now] + e.cost,
min_cost[chip - 1][now] + e.cost / 2);
if (min_cost[chip][e.to] > a) {
min_cost[chip][e.to] = a;
que.push(P(min_cost[chip][e.to], e.to));
}
}
}
}
}
int main() {
while (cin >> c >> V >> m >> s >> d && (c || V || m || s || d)) {
s--;
d--;
for (int i = 0; i < m; i++) {
int a, b, f;
cin >> a >> b >> f;
a--;
b--;
Graph[a].push_back(edge(b, f));
Graph[b].push_back(edge(a, f));
}
for (int i = 0; i <= c; i++) {
for (int j = 0; j < MAX_V; j++) {
min_cost[i][j] = INF;
}
}
for (int i = 0; i <= c; i++) {
Dijkstra(s, i);
}
cout << min_cost[c][d] << endl;
for (int i = 0; i < MAX_V; i++)
Graph[i].clear();
}
return 0;
}
|
#include <bits/stdc++.h>
#define MAX_V 101
using namespace std;
struct edge {
int to, cost;
edge() {}
edge(int to, int cost) : to(to), cost(cost){};
};
typedef pair<int, int> P;
const int INF = 1 << 30;
int V; //ノードの数
vector<edge> Graph[MAX_V];
int min_cost[11][MAX_V];
int c, m, s, d;
void Dijkstra(int s, int chip) { // s:スタートからの最小コストをmin_costに設定
priority_queue<P, vector<P>, greater<P>> que;
min_cost[chip][s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int now = p.second;
int cost = p.first;
if (min_cost[chip][now] < cost)
continue;
for (int i = 0; i < Graph[now].size(); i++) {
edge e = Graph[now][i];
int a;
if (chip == 0) {
a = min_cost[chip][now] + e.cost;
} else {
a = min(min_cost[chip][now] + e.cost,
min_cost[chip - 1][now] + e.cost / 2);
}
if (min_cost[chip][e.to] > a) {
min_cost[chip][e.to] = a;
que.push(P(min_cost[chip][e.to], e.to));
}
}
}
}
int main() {
while (cin >> c >> V >> m >> s >> d && (c || V || m || s || d)) {
s--;
d--;
for (int i = 0; i < m; i++) {
int a, b, f;
cin >> a >> b >> f;
a--;
b--;
Graph[a].push_back(edge(b, f));
Graph[b].push_back(edge(a, f));
}
for (int i = 0; i <= c; i++) {
for (int j = 0; j < MAX_V; j++) {
min_cost[i][j] = INF;
}
}
for (int i = 0; i <= c; i++) {
Dijkstra(s, i);
}
cout << min_cost[c][d] << endl;
for (int i = 0; i < MAX_V; i++)
Graph[i].clear();
}
return 0;
}
|
[["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46], ["-", 75, 76, 0, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 552
| 2
|
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct State {
int no_;
int cost_;
int ticket_;
State(int no, int cost, int ticket) : no_(no), cost_(cost), ticket_(ticket) {}
};
struct Edge {
int to_;
int cost_;
Edge(int to, int cost) : to_(to), cost_(cost) {}
};
int c, n, m, s, d;
auto dijkstra(vector<vector<Edge>> &g, vector<vector<int>> &dm) -> int {
auto comp = [](auto &lhs, auto &rhs) { return lhs.cost_ > rhs.cost_; };
priority_queue<State, vector<State>, decltype(comp)> que(comp);
que.push(State(s, 0, c));
for (auto &e : dm[s]) {
e = 0;
}
while (!que.empty()) {
State s = que.top();
que.pop();
int current_no = s.no_;
int current_cost = s.cost_;
int current_ticket = s.ticket_;
for (auto &e : g[current_no]) {
int to = e.to_;
int cost = e.cost_;
if (current_ticket > 0) {
// not use ticket
if (dm[to][current_ticket] > dm[current_no][current_ticket] + cost) {
que.push(
State(to, dm[current_no][current_ticket] + cost, current_ticket));
dm[to][current_ticket] = dm[current_no][current_ticket] + cost;
}
// use ticket
if (dm[to][current_ticket - 1] >
dm[current_no][current_ticket] + cost / 2) {
que.push(State(to, dm[current_no][current_ticket] + cost / 2,
current_ticket - 1));
dm[to][current_ticket - 1] =
dm[current_no][current_ticket - 1] + cost / 2;
}
} else {
if (dm[to][current_ticket] > dm[current_no][current_ticket] + cost) {
que.push(
State(to, dm[current_no][current_ticket] + cost, current_ticket));
dm[to][current_ticket] = dm[current_no][current_ticket] + cost;
}
}
}
}
int ans = 1e8;
for (auto &e : dm[d]) {
ans = min(ans, e);
}
return ans;
}
auto main(int argc, char const *argv[]) -> int {
constexpr int INF = 1e8;
while (cin >> c >> n >> m >> s >> d, c || n || m || s || d) {
vector<vector<Edge>> g(n + 1);
vector<vector<int>> dm(n + 1);
for (auto &e : dm) {
for (int i = 0; i < c + 1; ++i) {
e.push_back(INF);
}
}
for (int i = 0; i < m; ++i) {
int a, b, f;
cin >> a >> b >> f;
g[a].push_back(Edge(b, f));
g[b].push_back(Edge(a, f));
}
cout << dijkstra(g, dm) << endl;
}
return 0;
}
|
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct State {
int no_;
int cost_;
int ticket_;
State(int no, int cost, int ticket) : no_(no), cost_(cost), ticket_(ticket) {}
};
struct Edge {
int to_;
int cost_;
Edge(int to, int cost) : to_(to), cost_(cost) {}
};
int c, n, m, s, d;
auto dijkstra(vector<vector<Edge>> &g, vector<vector<int>> &dm) -> int {
auto comp = [](auto &lhs, auto &rhs) { return lhs.cost_ > rhs.cost_; };
priority_queue<State, vector<State>, decltype(comp)> que(comp);
que.push(State(s, 0, c));
for (auto &e : dm[s]) {
e = 0;
}
while (!que.empty()) {
State s = que.top();
que.pop();
int current_no = s.no_;
int current_cost = s.cost_;
int current_ticket = s.ticket_;
for (auto &e : g[current_no]) {
int to = e.to_;
int cost = e.cost_;
if (current_ticket > 0) {
// not use ticket
if (dm[to][current_ticket] > dm[current_no][current_ticket] + cost) {
que.push(
State(to, dm[current_no][current_ticket] + cost, current_ticket));
dm[to][current_ticket] = dm[current_no][current_ticket] + cost;
}
// use ticket
if (dm[to][current_ticket - 1] >
dm[current_no][current_ticket] + cost / 2) {
que.push(State(to, dm[current_no][current_ticket] + cost / 2,
current_ticket - 1));
dm[to][current_ticket - 1] =
dm[current_no][current_ticket] + cost / 2;
}
} else {
if (dm[to][current_ticket] > dm[current_no][current_ticket] + cost) {
que.push(
State(to, dm[current_no][current_ticket] + cost, current_ticket));
dm[to][current_ticket] = dm[current_no][current_ticket] + cost;
}
}
}
}
int ans = 1e8;
for (auto &e : dm[d]) {
ans = min(ans, e);
}
return ans;
}
auto main(int argc, char const *argv[]) -> int {
constexpr int INF = 1e8;
while (cin >> c >> n >> m >> s >> d, c || n || m || s || d) {
vector<vector<Edge>> g(n + 1);
vector<vector<int>> dm(n + 1);
for (auto &e : dm) {
for (int i = 0; i < c + 1; ++i) {
e.push_back(INF);
}
}
for (int i = 0; i < m; ++i) {
int a, b, f;
cin >> a >> b >> f;
g[a].push_back(Edge(b, f));
g[b].push_back(Edge(a, f));
}
cout << dijkstra(g, dm) << endl;
}
return 0;
}
|
[["-", 12, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["-", 12, 16, 31, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 701
| 2
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define fi first
#define se second
template <typename A, typename B> inline bool chmax(A &a, B b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename A, typename B> inline bool chmin(A &a, B b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pll> pip;
const ll INF = 1ll << 29;
const ll MOD = 1000000007;
const double EPS = 1e-9;
int C, N, M, S, D;
vector<pii> g[100];
int d[11][100];
int main() {
while (cin >> C >> N >> M >> S >> D, C || N || M || S || D) {
S--;
D--;
REP(i, N) g[i].clear();
REP(i, M) {
int a, b, f;
scanf("%d %d %d", &a, &b, &f);
a--;
b--;
g[a].push_back(pii(b, f));
g[b].push_back(pii(a, f));
}
fill(d[0], d[C + 1], INF);
priority_queue<pii, vector<pii>, greater<pii>> pq[11];
pq[0].push(pii(0, S));
d[0][S] = 0;
REP(i, C + 1) {
while (!pq[i].empty()) {
pii now = pq[i].top();
pq[i].pop();
int u = now.se, cost = now.fi;
REP(i, g[u].size()) {
int v = g[u][i].fi, c = g[u][i].se;
if (i < C && chmin(d[i + 1][v], cost + c / 2))
pq[i + 1].push(pii(cost + c / 2, v));
if (chmin(d[i][v], cost + c))
pq[i].push(pii(cost + c, v));
}
}
}
int ans = INF;
REP(i, C + 1) chmin(ans, d[i][D]);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define fi first
#define se second
template <typename A, typename B> inline bool chmax(A &a, B b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename A, typename B> inline bool chmin(A &a, B b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pll> pip;
const ll INF = 1ll << 29;
const ll MOD = 1000000007;
const double EPS = 1e-9;
int C, N, M, S, D;
vector<pii> g[100];
int d[11][100];
int main() {
while (cin >> C >> N >> M >> S >> D, C || N || M || S || D) {
S--;
D--;
REP(i, N) g[i].clear();
REP(i, M) {
int a, b, f;
scanf("%d %d %d", &a, &b, &f);
a--;
b--;
g[a].push_back(pii(b, f));
g[b].push_back(pii(a, f));
}
fill(d[0], d[C + 1], INF);
priority_queue<pii, vector<pii>, greater<pii>> pq[11];
pq[0].push(pii(0, S));
d[0][S] = 0;
REP(i, C + 1) {
while (!pq[i].empty()) {
pii now = pq[i].top();
pq[i].pop();
int u = now.se, cost = now.fi;
REP(j, g[u].size()) {
int v = g[u][j].fi, c = g[u][j].se;
if (i < C && chmin(d[i + 1][v], cost + c / 2))
pq[i + 1].push(pii(cost + c / 2, v));
if (chmin(d[i][v], cost + c))
pq[i].push(pii(cost + c, v));
}
}
}
int ans = INF;
REP(i, C + 1) chmin(ans, d[i][D]);
cout << ans << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 49, 50, 51, 118, 28, 69, 341, 342, 0, 22], ["+", 49, 50, 51, 118, 28, 69, 341, 342, 0, 22]]
| 1
| 593
| 6
|
#include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(x) (x).begin(), (x).end()
#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string) { cout << endl; }
template <class H, class... T> void _dbg(string s, H h, T... t) {
int l = s.find(',');
cout << s.substr(0, l) << " = " << h << ", ";
_dbg(s.substr(l + 1), t...);
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &p) {
o << "(" << p.fi << "," << p.se << ")";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "[";
for (T t : v) {
o << t << ",";
}
o << "]";
return o;
}
#define INF 1120000000
int main() {
using P = pair<int, int>;
int c, n, m, s, t;
while (cin >> c >> n >> m >> s >> t, c | n | m) {
s--;
t--;
vector<vector<P>> vec(n);
rep(i, m) {
int a, b, f;
cin >> a >> b >> f;
a--;
b--;
vec[a].pb(mp(f, b));
vec[b].pb(mp(f, a));
}
vector<vector<int>> d(m, vector<int>(c + 1, INF));
priority_queue<P, vector<P>, greater<P>> pq;
pq.push(mp(0, s * (c + 1)));
d[s][c] = 0;
while (!pq.empty()) {
auto p = pq.top();
pq.pop();
int v = p.se / (c + 1);
int k = p.se % (c + 1);
if (d[v][k] < p.fi)
continue;
auto go = [&](int nv, int nk, int dist) {
if (d[nv][nk] > dist) {
pq.push(mp(dist, nv * (c + 1) + nk));
d[nv][nk] = dist;
}
};
for (auto to : vec[v]) {
go(to.se, k, p.fi + to.fi);
if (k < c)
go(to.se, k + 1, p.fi + to.fi / 2);
}
}
cout << *min_element(all(d[t])) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(x) (x).begin(), (x).end()
#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string) { cout << endl; }
template <class H, class... T> void _dbg(string s, H h, T... t) {
int l = s.find(',');
cout << s.substr(0, l) << " = " << h << ", ";
_dbg(s.substr(l + 1), t...);
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &p) {
o << "(" << p.fi << "," << p.se << ")";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "[";
for (T t : v) {
o << t << ",";
}
o << "]";
return o;
}
#define INF 1120000000
int main() {
using P = pair<int, int>;
int c, n, m, s, t;
while (cin >> c >> n >> m >> s >> t, c | n | m) {
s--;
t--;
vector<vector<P>> vec(n);
rep(i, m) {
int a, b, f;
cin >> a >> b >> f;
a--;
b--;
vec[a].pb(mp(f, b));
vec[b].pb(mp(f, a));
}
vector<vector<int>> d(n, vector<int>(c + 1, INF));
priority_queue<P, vector<P>, greater<P>> pq;
pq.push(mp(0, s * (c + 1)));
d[s][c] = 0;
while (!pq.empty()) {
auto p = pq.top();
pq.pop();
int v = p.se / (c + 1);
int k = p.se % (c + 1);
if (d[v][k] < p.fi)
continue;
auto go = [&](int nv, int nk, int dist) {
if (d[nv][nk] > dist) {
pq.push(mp(dist, nv * (c + 1) + nk));
d[nv][nk] = dist;
}
};
for (auto to : vec[v]) {
go(to.se, k, p.fi + to.fi);
if (k < c)
go(to.se, k + 1, p.fi + to.fi / 2);
}
}
cout << *min_element(all(d[t])) << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 22]]
| 1
| 658
| 2
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> Pi;
typedef pair<int, Pi> Ti;
int c, n, m, s, d;
vector<vector<Pi>> edge;
int djk(int s, int g) {
int d[100][11];
for (int i = 0; i < n; i++)
for (int j = 0; j <= c; j++)
d[i][j] = 1000000000;
d[s][c] = 0;
priority_queue<Ti, vector<Ti>, greater<Ti>> pq;
pq.push(make_pair(0, make_pair(s, c)));
while (pq.size()) {
Ti tmp = pq.top();
pq.pop();
int N = tmp.second.first, ticket = tmp.second.second;
if (d[N][ticket] < tmp.first)
continue;
for (int i = 0; i < edge[N].size(); i++) {
int to = edge[N][i].first, cost = edge[N][i].second;
if (ticket > 0) {
if (d[to][ticket - 1] > d[N][ticket] + cost / 2) {
d[to][ticket - 1] = d[N][ticket] + cost / 2;
pq.push(make_pair(d[to][ticket - 1], make_pair(to, ticket - 1)));
}
} else {
if (d[to][ticket] > d[N][ticket] + cost) {
d[to][ticket] = d[N][ticket] + cost;
pq.push(make_pair(d[to][ticket], make_pair(to, ticket)));
}
}
}
}
int ans = 1000000000;
for (int i = 0; i <= c; i++)
ans = min(ans, d[g][i]);
return ans;
}
int main() {
while (cin >> c >> n >> m >> s >> d, c + n + m + s + d) {
s--, d--;
edge.resize(n);
for (int i = 0; i < m; i++) {
int a, b, f;
cin >> a >> b >> f, a--, b--;
edge[a].push_back(make_pair(b, f));
edge[b].push_back(make_pair(a, f));
}
cout << djk(s, d) << endl;
edge.clear();
}
return 0;
}
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> Pi;
typedef pair<int, Pi> Ti;
int c, n, m, s, d;
vector<vector<Pi>> edge;
int djk(int s, int g) {
int d[100 + 16][11];
for (int i = 0; i < n; i++)
for (int j = 0; j <= c; j++)
d[i][j] = 1000000000;
d[s][c] = 0;
priority_queue<Ti, vector<Ti>, greater<Ti>> pq;
pq.push(make_pair(0, make_pair(s, c)));
while (pq.size()) {
Ti tmp = pq.top();
pq.pop();
int N = tmp.second.first, ticket = tmp.second.second;
if (d[N][ticket] < tmp.first)
continue;
for (int i = 0; i < edge[N].size(); i++) {
int to = edge[N][i].first, cost = edge[N][i].second;
if (ticket > 0) {
if (d[to][ticket - 1] > d[N][ticket] + cost / 2) {
d[to][ticket - 1] = d[N][ticket] + cost / 2;
pq.push(make_pair(d[to][ticket - 1], make_pair(to, ticket - 1)));
}
}
if (d[to][ticket] > d[N][ticket] + cost) {
d[to][ticket] = d[N][ticket] + cost;
pq.push(make_pair(d[to][ticket], make_pair(to, ticket)));
}
}
}
int ans = 1000000000;
for (int i = 0; i <= c; i++)
ans = min(ans, d[g][i]);
return ans;
}
int main() {
while (cin >> c >> n >> m >> s >> d, c + n + m + s + d) {
s--, d--;
edge.resize(n);
for (int i = 0; i < m; i++) {
int a, b, f;
cin >> a >> b >> f, a--, b--;
edge[a].push_back(make_pair(b, f));
edge[b].push_back(make_pair(a, f));
}
cout << djk(s, d) << endl;
edge.clear();
}
return 0;
}
|
[["+", 0, 43, 49, 80, 49, 80, 81, 16, 17, 72], ["+", 0, 43, 49, 80, 49, 80, 81, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["-", 75, 76, 0, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 577
| 5
|
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct state {
int node;
int ticket;
int cost;
state(int n, int t, int c) : node(n), ticket(t), cost(c) {}
bool operator<(const state &s) const { return cost > s.cost; }
};
int main() {
int c, n, m, s, d;
while (cin >> c >> n >> m >> s >> d && c != 0) {
--s;
--d;
vector<vector<pair<int, int>>> g(n);
for (int i = 0; i < m; i++) {
int a, b, f;
cin >> a >> b >> f;
--a;
--b;
g[a].push_back(make_pair(b, f));
g[b].push_back(make_pair(a, f));
}
priority_queue<state> q;
q.push(state(s, c, 0));
vector<vector<int>> city(n, vector<int>(c, 1000000));
city[s][c] = 0;
while (!q.empty()) {
const state s = q.top();
q.pop();
if (s.node == d) {
cout << s.cost << endl;
break;
}
city[s.node][s.ticket] = s.cost;
for (vector<pair<int, int>>::const_iterator it(g[s.node].begin());
it != g[s.node].end(); ++it) {
const int next = it->first;
const int cost = s.cost + it->second;
if (cost < city[next][s.ticket]) {
city[next][s.ticket] = cost;
q.push(state(next, s.ticket, cost));
}
if (s.ticket > 0) {
const int cost2 = s.cost + it->second / 2;
if (cost2 < city[next][s.ticket - 1]) {
city[next][s.ticket - 1] = cost2;
q.push(state(next, s.ticket - 1, cost2));
}
}
}
}
}
return 0;
}
|
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct state {
int node;
int ticket;
int cost;
state(int n, int t, int c) : node(n), ticket(t), cost(c) {}
bool operator<(const state &s) const { return cost > s.cost; }
};
int main() {
int c, n, m, s, d;
while (cin >> c >> n >> m >> s >> d && c != 0) {
--s;
--d;
vector<vector<pair<int, int>>> g(n);
for (int i = 0; i < m; i++) {
int a, b, f;
cin >> a >> b >> f;
--a;
--b;
g[a].push_back(make_pair(b, f));
g[b].push_back(make_pair(a, f));
}
priority_queue<state> q;
q.push(state(s, c, 0));
vector<vector<int>> city(n, vector<int>(c + 1, 1000000));
city[s][c] = 0;
while (!q.empty()) {
const state s = q.top();
q.pop();
if (s.node == d) {
cout << s.cost << endl;
break;
}
city[s.node][s.ticket] = s.cost;
for (vector<pair<int, int>>::const_iterator it(g[s.node].begin());
it != g[s.node].end(); ++it) {
const int next = it->first;
const int cost = s.cost + it->second;
if (cost < city[next][s.ticket]) {
city[next][s.ticket] = cost;
q.push(state(next, s.ticket, cost));
}
if (s.ticket > 0) {
const int cost2 = s.cost + it->second / 2;
if (cost2 < city[next][s.ticket - 1]) {
city[next][s.ticket - 1] = cost2;
q.push(state(next, s.ticket - 1, cost2));
}
}
}
}
}
return 0;
}
|
[["+", 51, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 51, 4, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 499
| 2
|
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int INF = 10000000;
int city[101][101];
int solve(int s, int d, int c, int n) {
int dist[11][101];
int history[101];
for (int i = 0; i < 11; i++) {
for (int j = 1; j < 101; j++) {
dist[i][j] = INF;
}
}
for (int i = 1; i < 101; i++) {
history[i] = 0;
}
for (int i = 0; i < 11; i++)
dist[i][s] = 0;
typedef pair<int, int> data;
typedef pair<int, data> graph;
priority_queue<graph, vector<graph>, greater<graph>> q;
q.push(graph(0, data(s, c)));
while (!q.empty()) {
graph a = q.top();
int u = a.second.first;
int uc = a.second.second;
q.pop();
history[u] = 1;
for (int i = 1; i <= n; i++) {
if (dist[uc][i] > dist[uc][u] + city[u][i]) {
dist[uc][i] = dist[uc][u] + city[u][i];
q.push(graph(dist[uc][i], data(i, uc)));
}
if (uc && dist[uc - 1][i] > dist[uc][i] + city[u][i] / 2) {
dist[uc - 1][i] = dist[uc][u] + city[u][i] / 2;
q.push(graph(dist[uc - 1][i], data(i, uc - 1)));
}
}
}
int answer = INF;
for (int i = 0; i < 11; i++)
answer = min(dist[i][d], answer);
return answer;
}
int main(int argc, char const *argv[]) {
int c, n, m, s, d;
while (cin >> c >> n >> m >> s >> d && c != 0) {
int a, b, f;
for (int i = 1; i < 101; i++) {
for (int j = 1; j < 101; j++) {
city[i][j] = INF * 2;
}
}
for (int i = 0; i < m; i++) {
cin >> a >> b >> f;
city[a][b] = f;
city[b][a] = f;
}
cout << solve(s, d, c, n) << endl;
}
return 0;
}
|
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int INF = 10000000;
int city[101][101];
int solve(int s, int d, int c, int n) {
int dist[11][101];
int history[101];
for (int i = 0; i < 11; i++) {
for (int j = 1; j < 101; j++) {
dist[i][j] = INF;
}
}
for (int i = 1; i < 101; i++) {
history[i] = 0;
}
for (int i = 0; i < 11; i++)
dist[i][s] = 0;
typedef pair<int, int> data;
typedef pair<int, data> graph;
priority_queue<graph, vector<graph>, greater<graph>> q;
q.push(graph(0, data(s, c)));
while (!q.empty()) {
graph a = q.top();
int u = a.second.first;
int uc = a.second.second;
q.pop();
history[u] = 1;
for (int i = 1; i <= n; i++) {
if (dist[uc][i] > dist[uc][u] + city[u][i]) {
dist[uc][i] = dist[uc][u] + city[u][i];
q.push(graph(dist[uc][i], data(i, uc)));
}
if (uc && dist[uc - 1][i] > dist[uc][u] + city[u][i] / 2) {
dist[uc - 1][i] = dist[uc][u] + city[u][i] / 2;
q.push(graph(dist[uc - 1][i], data(i, uc - 1)));
}
}
}
int answer = INF;
for (int i = 0; i < 11; i++)
answer = min(dist[i][d], answer);
return answer;
}
int main(int argc, char const *argv[]) {
int c, n, m, s, d;
while (cin >> c >> n >> m >> s >> d && c != 0) {
int a, b, f;
for (int i = 1; i < 101; i++) {
for (int j = 1; j < 101; j++) {
city[i][j] = INF * 2;
}
}
for (int i = 0; i < m; i++) {
cin >> a >> b >> f;
city[a][b] = f;
city[b][a] = f;
}
cout << solve(s, d, c, n) << endl;
}
return 0;
}
|
[["-", 12, 16, 12, 16, 31, 69, 341, 342, 0, 22], ["+", 12, 16, 12, 16, 31, 69, 341, 342, 0, 22]]
| 1
| 626
| 2
|
#include <algorithm>
#include <iostream>
const int MAX = (1 << 30);
using namespace std;
int minnode;
int main() {
int c, city, bus, from, to;
while (cin >> c >> city >> bus >> from >> to && c && city && bus && from &&
to) {
int price[city + 1][city + 1];
for (int i = 0; i < city + 1; i++) {
for (int j = 0; j < city + 1; j++) {
price[i][j] = 0;
}
}
for (int i = 0; i < bus; i++) {
int start, end, pri;
cin >> start >> end >> pri;
price[start][end] = pri;
price[end][start] = pri;
}
int node[city + 1][c + 1];
int visited[city + 1][c + 1];
for (int i = 0; i < city + 1; i++) {
for (int j = 0; j < c + 1; j++) {
node[i][j] = MAX;
visited[i][j] = 0;
}
}
minnode = from;
int ticket = c;
node[from][c] = 0;
int nownode = MAX;
int minpos, mintic;
while (1) {
for (int i = 1; i < city + 1; i++) {
for (int j = 1; j < c + 1; j++) {
if (visited[i][j])
continue;
if (node[i][j] < nownode) {
nownode = node[i][j];
minpos = i;
mintic = j;
}
}
}
visited[minpos][mintic] = 1;
if (nownode == MAX)
break;
nownode = MAX;
for (int i = 1; i < city + 1; i++) {
if (price[minpos][i]) {
node[i][mintic] =
min(node[i][mintic], node[minpos][mintic] + price[minpos][i]);
if (mintic) {
node[i][mintic - 1] =
min(node[i][mintic - 1],
node[minpos][mintic] + price[minpos][i] / 2);
}
}
}
}
for (int i = 1; i <= ticket; i++) {
if (node[to][0] > node[to][i])
node[to][0] = node[to][i];
}
cout << node[to][0] << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
const int MAX = (1 << 30);
using namespace std;
int minnode;
int main() {
int c, city, bus, from, to;
while (cin >> c >> city >> bus >> from >> to && c && city && bus && from &&
to) {
int price[city + 1][city + 1];
for (int i = 0; i < city + 1; i++) {
for (int j = 0; j < city + 1; j++) {
price[i][j] = 0;
}
}
for (int i = 0; i < bus; i++) {
int start, end, pri;
cin >> start >> end >> pri;
price[start][end] = pri;
price[end][start] = pri;
}
int node[city + 1][c + 1];
int visited[city + 1][c + 1];
for (int i = 0; i < city + 1; i++) {
for (int j = 0; j < c + 1; j++) {
node[i][j] = MAX;
visited[i][j] = 0;
}
}
minnode = from;
int ticket = c;
node[from][c] = 0;
int nownode = MAX;
int minpos, mintic;
while (1) {
for (int i = 1; i < city + 1; i++) {
for (int j = 0; j < c + 1; j++) {
if (visited[i][j])
continue;
if (node[i][j] < nownode) {
nownode = node[i][j];
minpos = i;
mintic = j;
}
}
}
visited[minpos][mintic] = 1;
if (nownode == MAX)
break;
nownode = MAX;
for (int i = 1; i < city + 1; i++) {
if (price[minpos][i]) {
node[i][mintic] =
min(node[i][mintic], node[minpos][mintic] + price[minpos][i]);
if (mintic) {
node[i][mintic - 1] =
min(node[i][mintic - 1],
node[minpos][mintic] + price[minpos][i] / 2);
}
}
}
}
for (int i = 1; i <= ticket; i++) {
if (node[to][0] > node[to][i])
node[to][0] = node[to][i];
}
cout << node[to][0] << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]]
| 1
| 570
| 2
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#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) < (int)(n); ++(i))
#define foreach(c, i) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
struct edge {
int to, cost;
};
struct state {
int cur, card, cost;
bool operator<(const state &lhs) const { return cost > lhs.cost; }
};
typedef pair<int, int> P;
const int kInf = 1 << 28;
int C, N, M, S, D;
vector<edge> es[102];
int d[102][12];
int solve() {
// init
for (int i = 0; i < 102; ++i)
for (int j = 0; j < 12; ++j)
d[i][j] = kInf;
// dijkstra
priority_queue<state> Q;
d[S][C] = 0;
Q.push((state){S, C, 0});
while (!Q.empty()) {
state s = Q.top();
Q.pop();
if (d[s.cur][s.card] < s.cost)
continue;
rep(i, es[s.cur].size()) {
const edge &e = es[s.cur][i];
// without ticket
if (d[e.to][s.card] > s.cost + e.cost) {
d[e.to][s.card] = s.cost + e.cost;
Q.push((state){e.to, s.card, s.cost + e.cost});
}
// use ticket
if (s.card > 0 && d[e.to][s.card - 1] > s.cost + (e.cost / 2)) {
d[e.to][s.card - 1] = s.cost + (e.cost / 2);
Q.push((state){e.to, s.card - 1, s.cost + (e.cost / 2)});
}
}
}
return *min_element(d[D], d[D] + 12);
}
int main() {
while (scanf("%d%d%d%d%d", &C, &N, &M, &S, &D), C) {
--S;
--D;
rep(i, N) { es[i].clear(); }
rep(i, N) {
int a, b, f;
scanf("%d%d%d", &a, &b, &f);
--a;
--b;
es[a].push_back((edge){b, f});
es[b].push_back((edge){a, f});
}
printf("%d\n", solve());
}
return 0;
}
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#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) < (int)(n); ++(i))
#define foreach(c, i) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
struct edge {
int to, cost;
};
struct state {
int cur, card, cost;
bool operator<(const state &lhs) const { return cost > lhs.cost; }
};
typedef pair<int, int> P;
const int kInf = 1 << 28;
int C, N, M, S, D;
vector<edge> es[102];
int d[102][12];
int solve() {
// init
for (int i = 0; i < 102; ++i)
for (int j = 0; j < 12; ++j)
d[i][j] = kInf;
// dijkstra
priority_queue<state> Q;
d[S][C] = 0;
Q.push((state){S, C, 0});
while (!Q.empty()) {
state s = Q.top();
Q.pop();
if (d[s.cur][s.card] < s.cost)
continue;
rep(i, es[s.cur].size()) {
const edge &e = es[s.cur][i];
// without ticket
if (d[e.to][s.card] > s.cost + e.cost) {
d[e.to][s.card] = s.cost + e.cost;
Q.push((state){e.to, s.card, s.cost + e.cost});
}
// use ticket
if (s.card > 0 && d[e.to][s.card - 1] > s.cost + (e.cost / 2)) {
d[e.to][s.card - 1] = s.cost + (e.cost / 2);
Q.push((state){e.to, s.card - 1, s.cost + (e.cost / 2)});
}
}
}
return *min_element(d[D], d[D] + 12);
}
int main() {
while (scanf("%d%d%d%d%d", &C, &N, &M, &S, &D), C) {
--S;
--D;
rep(i, N) { es[i].clear(); }
rep(i, M) {
int a, b, f;
scanf("%d%d%d", &a, &b, &f);
--a;
--b;
es[a].push_back((edge){b, f});
es[b].push_back((edge){a, f});
}
printf("%d\n", solve());
}
return 0;
}
|
[["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]]
| 1
| 625
| 2
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define INF 10e8
using namespace std;
int c, n, m, s, d;
int cost[101][101];
int state[101][11];
struct node {
int c; // cost
int n; // number
int t; // times
bool operator>(node b) const { return c > b.c; }
};
int dijkstra(int s, int g) {
node start;
start.c = 0, start.n = s, start.t = c;
priority_queue<node, vector<node>, greater<node>> q;
q.push(start);
while (!q.empty()) {
node cur = q.top();
q.pop();
if (cur.n == g) {
int ans = cur.c;
return ans;
}
if (state[cur.n][cur.t] <= cur.c)
continue;
else
state[cur.n][cur.t] = cur.c;
for (int i = 1; i <= n; i++) {
if (cur.n == i)
continue;
node next;
if (cur.t > 0) {
next.c = cur.c + (cost[cur.n][i] / 2);
next.n = i;
next.t = cur.t - 1;
q.push(next);
}
next.c = cur.c + cost[cur.n][i];
next.n = i;
next.t = cur.t;
q.push(next);
}
}
}
int main(void) {
while (cin >> c >> n >> m >> s >> d, c | n | m | s | d) {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= c; j++)
state[i][j] = INF;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
cost[i][j] = INF;
int a, b, f;
for (int i = 0; i < m; i++) {
cin >> a >> b >> f;
cost[a][b] = cost[b][a] = f;
}
int ans = dijkstra(s, d);
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define INF 10e8
using namespace std;
int c, n, m, s, d;
int cost[101][101];
int state[101][11];
struct node {
int c; // cost
int n; // number
int t; // times
bool operator>(node b) const { return c > b.c; }
};
int dijkstra(int s, int g) {
node start;
start.c = 0, start.n = s, start.t = c;
priority_queue<node, vector<node>, greater<node>> q;
q.push(start);
while (!q.empty()) {
node cur = q.top();
q.pop();
if (cur.n == g) {
int ans = cur.c;
return ans;
}
if (state[cur.n][cur.t] <= cur.c)
continue;
else
state[cur.n][cur.t] = cur.c;
for (int i = 1; i <= n; i++) {
if (cur.n == i)
continue;
node next;
if (cur.t > 0) {
next.c = cur.c + (cost[cur.n][i] / 2);
next.n = i;
next.t = cur.t - 1;
q.push(next);
}
next.c = cur.c + cost[cur.n][i];
next.n = i;
next.t = cur.t;
q.push(next);
}
}
}
int main(void) {
while (cin >> c >> n >> m >> s >> d, c | n | m | s | d) {
for (int i = 1; i <= n; i++)
for (int j = 0; j <= c; j++)
state[i][j] = INF;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
cost[i][j] = INF;
int a, b, f;
for (int i = 0; i < m; i++) {
cin >> a >> b >> f;
cost[a][b] = cost[b][a] = f;
}
int ans = dijkstra(s, d);
cout << ans << endl;
}
return 0;
}
|
[["-", 0, 7, 8, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 7, 10, 43, 49, 50, 51, 13]]
| 1
| 516
| 2
|
from sys import stdin
from heapq import heappush,heappop
while(True):
c,n,m,s,d = map(int, stdin.readline().split())
if not c: break
ma = [[] for _ in range(n)]
s -= 1
d -= 1
for _ in range(m):
a,b,f = map(int, stdin.readline().split())
a -= 1
b -= 1
ma[a].append([f,b])
ma[b].append([f,a])
cost = [[10**10]*(c+1) for _ in range(n)]
cost[s][c] = 0
que = [[ cost[s][c], s, c ]]
while que:
co, pl, ti = heappop(que)
for fee, town in ma[pl]:
if cost[town][ti] > co+fee:
cost[town][ti] = co+fee
heappush(que,[cost[town][ti],town,ti])
if ti and cost[town][ti-1] > co+fee//2:
cost[town][ti-1] = co+fee//2
heappush(que,[cost[town][ti-1],town,ti-1])
print(cost[d][0])
|
from sys import stdin
from heapq import heappush,heappop
while(True):
c,n,m,s,d = map(int, stdin.readline().split())
if not c: break
ma = [[] for _ in range(n)]
s -= 1
d -= 1
for _ in range(m):
a,b,f = map(int, stdin.readline().split())
a -= 1
b -= 1
ma[a].append([f,b])
ma[b].append([f,a])
cost = [[10**10]*(c+1) for _ in range(n)]
cost[s][c] = 0
que = [[ cost[s][c], s, c ]]
while que:
co, pl, ti = heappop(que)
for fee, town in ma[pl]:
if cost[town][ti] > co+fee:
cost[town][ti] = co+fee
heappush(que,[cost[town][ti],town,ti])
if ti and cost[town][ti-1] > co+fee//2:
cost[town][ti-1] = co+fee//2
heappush(que,[cost[town][ti-1],town,ti-1])
print(min(cost[d]))
|
[["+", 0, 1, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["-", 0, 652, 3, 4, 0, 206, 51, 206, 0, 73], ["-", 0, 1, 0, 652, 3, 4, 0, 206, 0, 70], ["-", 0, 1, 0, 652, 3, 4, 0, 206, 206, 612], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]]
| 5
| 302
| 6
|
#include <stdio.h>
int main(void) {
int n, i;
int p, d1, d2;
int max, p1;
scanf("%d", &n);
max = 0;
while (n != 0) {
for (i = 0; i < n; i++) {
scanf("%d %d %d", &p, &d1, &d2);
if (max < d1 + d2) {
p1 = p;
max = d1 + d2;
}
}
printf("%d %d\n", p1, max);
scanf("%d", &n);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, i;
int p, d1, d2;
int max, p1;
scanf("%d", &n);
max = 0;
while (n != 0) {
for (i = 0; i < n; i++) {
scanf("%d %d %d", &p, &d1, &d2);
if (max < d1 + d2) {
p1 = p;
max = d1 + d2;
}
}
printf("%d %d\n", p1, max);
scanf("%d", &n);
max = 0;
}
return 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
| 124
| 4
|
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int max_p = 0, max_d = 0;
for (int i = 0; i < n; i++) {
int p, d1, d2;
cin >> p >> d1 >> d2;
if (max_d <= d1 + d2) {
max_d = d1 + d2;
max_p = p;
}
}
cout << max_p << " " << max_d;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int max_p = 0, max_d = 0;
for (int i = 0; i < n; i++) {
int p, d1, d2;
cin >> p >> d1 >> d2;
if (max_d <= d1 + d2) {
max_d = d1 + d2;
max_p = p;
}
}
cout << max_p << " " << max_d << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 106
| 2
|
#include <stdio.h>
int main(void) {
int n, a[10000], s, d, max, z, x[10000], i, j;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d %d", &a[i], &s, &d);
x[i] = s + d;
}
max = 0;
for (j = 0; j < n; j++) {
if (max < x[i]) {
max = x[i];
z = a[i];
}
}
printf("%d %d\n", z, max);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, a[10000], s, d, max, z, x[10000], i, j;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d %d", &a[i], &s, &d);
x[i] = s + d;
}
max = 0;
for (i = 0; i < n; i++) {
if (max < x[i]) {
max = x[i];
z = a[i];
}
}
printf("%d %d\n", z, max);
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 10, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 31, 22], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 28, 22]]
| 1
| 160
| 6
|
#define scanf_s scanf
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define MAX 100000
int main() {
while (1) {
int n, max, maxi = 0, p, d1, d2, d;
scanf_s("%d", &n);
if (n == 0)
break;
for (int i = 0; i < n; ++i) {
scanf_s("%d %d %d", &p, &d1, &d2);
d = d1 + d2;
if (i == 0 || max < d) {
max = d;
maxi = p;
}
printf("%d %d\n", maxi, max);
}
}
}
|
#define scanf_s scanf
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define MAX 100000
int main() {
while (1) {
int n, max, maxi = 0, p, d1, d2, d;
scanf_s("%d", &n);
if (n == 0)
break;
for (int i = 0; i < n; ++i) {
scanf_s("%d %d %d", &p, &d1, &d2);
d = d1 + d2;
if (i == 0 || max < d) {
max = d;
maxi = p;
}
}
printf("%d %d\n", maxi, max);
}
}
|
[["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 143
| 2
|
#include <stdio.h>
int main(void) {
int a, b, c, d, e, f, g = 0, max = 0;
while (scanf("%d", &a), a != 0) {
for (e = 0; e < a; e++) {
scanf("%d %d %d", &b, &c, &d);
f = c + d;
if (max < f) {
max = f;
g = b;
}
}
printf("%d %d\n", g, max);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int a, b, c, d, e, f, g = 0, max = 0;
while (scanf("%d", &a), a != 0) {
for (e = 0; e < a; e++) {
scanf("%d %d %d", &b, &c, &d);
f = c + d;
if (max < f) {
max = f;
g = b;
}
}
printf("%d %d\n", g, max);
max = 0;
}
return 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
| 116
| 4
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int p[10000], d1[10000], d2[10000];
int top[2] = {};
for (int i = 0; i < n; i++) {
cin >> p[i] >> d1[i] >> d2[i];
if (top[1] < d1[i] + d2[i]) {
top[0] = p[i];
top[1] = d1[i] + d2[i];
}
}
cout << top[0] << top[1] << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int p[10000], d1[10000], d2[10000];
int top[2] = {};
for (int i = 0; i < n; i++) {
cin >> p[i] >> d1[i] >> d2[i];
if (top[1] < d1[i] + d2[i]) {
top[0] = p[i];
top[1] = d1[i] + d2[i];
}
}
cout << top[0] << " " << top[1] << endl;
}
return 0;
}
|
[["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]]
| 1
| 144
| 4
|
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
while (cin >> n && n != 0) {
vector<int> I(n, 0);
vector<int> L(n, 0);
for (int i = 0; i < n; i++) {
int p, d1, d2;
cin >> p >> d1 >> d2;
I[i] = p;
L[i] = d1 + d2;
}
int maxNo = -1;
int maxL = 0;
for (int i = 0; i < n - 1; i++) {
if (i == 0) {
maxNo = I[i];
maxL = L[i];
} else if (L[i] > maxL) {
maxNo = I[i];
maxL = L[i];
}
}
cout << maxNo << " " << maxL << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
while (cin >> n && n != 0) {
vector<int> I(n, 0);
vector<int> L(n, 0);
for (int i = 0; i < n; i++) {
int p, d1, d2;
cin >> p >> d1 >> d2;
I[i] = p;
L[i] = d1 + d2;
}
int maxNo = -1;
int maxL = 0;
for (int i = 0; i < n; i++) {
if (i == 0) {
maxNo = I[i];
maxL = L[i];
} else if (L[i] > maxL) {
maxNo = I[i];
maxL = L[i];
}
}
cout << maxNo << " " << maxL << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]]
| 1
| 190
| 2
|
#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>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <class T> T RoundOff(T a) { return int(a + .5 - (a < 0)); }
template <class T, class C> void chmax(T &a, C b) {
if (a < b)
a = b;
}
template <class T, class C> void chmin(T &a, C b) {
if (b < a)
a = b;
}
template <class T, class C> pair<T, C> mp(T a, C b) { return make_pair(a, b); }
int main() {
int n;
int p, d1, d2, mah, mad;
while (cin >> n && n) {
mad = -1;
rep(i, n) {
cin >> p >> d1 >> d2;
if (mad < d1 + d2) {
mad = d1 + d2;
mah = p;
}
cout << mah << " " << mad << endl;
}
}
}
|
#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>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <class T> T RoundOff(T a) { return int(a + .5 - (a < 0)); }
template <class T, class C> void chmax(T &a, C b) {
if (a < b)
a = b;
}
template <class T, class C> void chmin(T &a, C b) {
if (b < a)
a = b;
}
template <class T, class C> pair<T, C> mp(T a, C b) { return make_pair(a, b); }
int main() {
int n;
int p, d1, d2, mah, mad;
while (cin >> n && n) {
mad = -1;
rep(i, n) {
cin >> p >> d1 >> d2;
if (mad < d1 + d2) {
mad = d1 + d2;
mah = p;
}
}
cout << mah << " " << mad << endl;
}
}
|
[["+", 0, 52, 8, 9, 0, 14, 8, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 14, 8, 9, 0, 46]]
| 1
| 310
| 2
|
#include <iostream>
using namespace std;
int main() {
int n, p, d1, d2, top = 0, num;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
cin >> p >> d1 >> d2;
if (d1 + d2 >= top) {
num = p;
top = d1 + d2;
}
}
cout << num << " " << top << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int n, p, d1, d2, top = 0, num;
while (cin >> n, n) {
top = 0;
for (int i = 0; i < n; i++) {
cin >> p >> d1 >> d2;
if (d1 + d2 >= top) {
num = p;
top = d1 + d2;
}
}
cout << num << " " << top << 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
| 93
| 4
|
#include <stdio.h>
int main() {
int NO, max, p, d1, d2;
int n, i, j;
scanf("%d", &n);
while (n != 0) {
max = 0;
for (i = 0; i < n; i++) {
scanf("%d%d%d", &p, &d1, &d2);
if (max < d1 + d2) {
max = d1 + d2;
NO = p;
}
}
printf("%d %d", NO, max);
scanf("%d", &n);
}
return 0;
}
|
#include <stdio.h>
int main() {
int NO, max, p, d1, d2;
int n, i, j;
scanf("%d", &n);
while (n != 0) {
max = 0;
for (i = 0; i < n; i++) {
scanf("%d%d%d", &p, &d1, &d2);
if (max < d1 + d2) {
max = d1 + d2;
NO = p;
}
}
printf("%d %d\n", NO, max);
scanf("%d", &n);
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 123
| 1
|
#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
int main() {
int num;
map<int, int, greater<int>> mp;
while (cin >> num, num) {
int patient, walk1, walk2;
for (int i = 0; i < num; i++) {
cin >> patient >> walk1 >> walk2;
mp.insert(make_pair(walk1 + walk2, patient));
}
map<int, int>::iterator it = mp.begin();
printf("%d %d\n", (*it).second, (*it).first);
}
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
int main() {
int num;
map<int, int, greater<int>> mp;
while (cin >> num, num) {
mp.clear();
int patient, walk1, walk2;
for (int i = 0; i < num; i++) {
cin >> patient >> walk1 >> walk2;
mp.insert(make_pair(walk1 + walk2, patient));
}
map<int, int>::iterator it = mp.begin();
printf("%d %d\n", (*it).second, (*it).first);
}
return 0;
}
|
[["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 128
| 6
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int maxP = -1, maxD = -1;
int p, d1, d2;
int num;
while (cin >> num, num) {
for (int i = 0; i < num; i++) {
cin >> p >> d1 >> d2;
maxD = max(maxD, d1 + d2);
if (maxD == d1 + d2)
maxP = p;
}
cout << maxP << " " << maxD << endl;
}
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int maxP = -1, maxD = -1;
int p, d1, d2;
int num;
while (cin >> num, num) {
maxD = 0;
for (int i = 0; i < num; i++) {
cin >> p >> d1 >> d2;
maxD = max(maxD, d1 + d2);
if (maxD == d1 + d2)
maxP = p;
}
cout << maxP << " " << maxD << 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
| 102
| 4
|
#include <iostream>
using namespace std;
int main() {
int n, p, d1, d2, maxp, maxv;
while (1) {
cin >> n;
if (n == 0)
break;
maxp = maxv = -1;
while (n--) {
cin >> p >> d1 >> d2;
if (maxv < d1 + d2) {
maxp = p;
maxv = d1 + d2;
}
}
cout << maxp << " " << maxv;
}
}
|
#include <iostream>
using namespace std;
int main() {
int n, p, d1, d2, maxp, maxv;
while (1) {
cin >> n;
if (n == 0)
break;
maxp = maxv = 0;
while (n--) {
cin >> p >> d1 >> d2;
if (maxv < d1 + d2) {
maxp = p;
maxv = d1 + d2;
}
}
cout << maxp << " " << maxv << endl;
}
}
|
[["-", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 94
| 4
|
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = (input.trim()).split("\n");
for (var i = 0; i < Arr.length; i++) {
if (arr[i] == "0")
break;
var arr = Arr[i].split(" ").map(Number);
if (arr.length == 1)
continue;
var ave = (arr[0] + arr[1] + arr[2]) / 3;
var str = C;
if (arr.indexOf(100) != -1) {
str = "A";
} else if ((arr[0] + arr[1]) / 2 >= 90) {
str = "A";
} else if (ave >= 80) {
str = "A";
} else if (ave >= 70) {
str = "B";
} else if (ave >= 50 && (arr[0] >= 80 || arr[1] >= 80)) {
str = "B";
}
console.log(str);
}
|
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = (input.trim()).split("\n");
for (var i = 0; i < Arr.length; i++) {
if (Arr[i] == "0")
break;
var arr = Arr[i].split(" ").map(Number);
if (arr.length == 1)
continue;
var ave = (arr[0] + arr[1] + arr[2]) / 3;
var str = "C";
if (arr.indexOf(100) != -1) {
str = "A";
} else if ((arr[0] + arr[1]) / 2 >= 90) {
str = "A";
} else if (ave >= 80) {
str = "A";
} else if (ave >= 70) {
str = "B";
} else if (ave >= 50 && (arr[0] >= 80 || arr[1] >= 80)) {
str = "B";
}
console.log(str);
}
|
[["-", 0, 57, 15, 23, 0, 16, 31, 69, 500, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 500, 22], ["+", 8, 556, 0, 198, 0, 200, 51, 557, 0, 62]]
| 2
| 242
| 4
|
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
final int n = sc.nextInt();
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
int pm = sc.nextInt(), pe = sc.nextInt(), pj = sc.nextInt();
if (Math.max(Math.max(pm, pe), pj) == 100) {
System.out.println("A");
} else if ((pm + pe) / 2 >= 90) {
System.out.println("A");
} else if ((pm + pe + pj) / 3 >= 80) {
System.out.println("A");
} else if ((pm + pe + pj) / 3 >= 70) {
System.out.println("B");
} else if ((pm + pe + pj >= 50 && Math.max(pm, pe) >= 80)) {
System.out.println("B");
} else {
System.out.println("C");
}
}
}
}
}
|
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
final int n = sc.nextInt();
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
int pm = sc.nextInt(), pe = sc.nextInt(), pj = sc.nextInt();
if (Math.max(Math.max(pm, pe), pj) == 100) {
System.out.println("A");
} else if ((pm + pe) / 2 >= 90) {
System.out.println("A");
} else if ((pm + pe + pj) / 3 >= 80) {
System.out.println("A");
} else if ((pm + pe + pj) / 3 >= 70) {
System.out.println("B");
} else if ((pm + pe + pj) / 3 >= 50 && Math.max(pm, pe) >= 80) {
System.out.println("B");
} else {
System.out.println("C");
}
}
}
}
}
|
[["+", 0, 16, 31, 16, 31, 16, 31, 23, 0, 25], ["+", 15, 15, 0, 16, 31, 16, 31, 16, 17, 85], ["+", 15, 15, 0, 16, 31, 16, 31, 16, 12, 499], ["-", 75, 57, 75, 57, 15, 15, 0, 23, 0, 25]]
| 3
| 289
| 4
|
#include <stdio.h>
int n;
int a, b, c;
int i;
int main() {
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
if (a == 100 || b == 100 || c == 100)
printf("A\n");
else if ((a + b) / 2 >= 90)
printf("A\n");
else if ((a + b + c) / 3 >= 80)
printf("A\n");
else if ((a + b + c) / 3 >= 70)
printf("B\n");
else if ((a + b + c) / 3 >= 50 && c >= 80 || a >= 80)
printf("B\n");
else
printf("C\n");
}
}
return 0;
}
|
#include <stdio.h>
int n;
int a, b, c;
int i;
int main() {
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
if (a == 100 || b == 100 || c == 100)
printf("A\n");
else if ((a + b) / 2 >= 90)
printf("A\n");
else if ((a + b + c) / 3 >= 80)
printf("A\n");
else if ((a + b + c) / 3 >= 70)
printf("B\n");
else if ((a + b + c) / 3 >= 50 && (b >= 80 || a >= 80))
printf("B\n");
else
printf("C\n");
}
}
return 0;
}
|
[["-", 15, 23, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 23, 0, 24], ["+", 0, 16, 12, 23, 0, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 23, 0, 25]]
| 0
| 222
| 4
|
#include <stdio.h>
int main(void) {
int i, a, b, c, d;
while (1) {
scanf("%d", &a);
if (a == 0)
break;
for (i = 0; i < a; i++) {
scanf("%d %d %d", &b, &c, &d);
if (b == 100 || c == 100 || d == 100) {
printf("A\n");
} else if ((b + c) / 2 >= 90) {
printf("A\n");
} else if ((b + c + d) / 3 >= 80) {
printf("A\n");
} else if ((b + c + d) / 3 >= 70) {
printf("B\n");
} else if ((b + c + d) / 3 >= 50) {
if (b >= 80 || c >= 80) {
printf("B\n");
}
} else {
printf("C\n");
}
}
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, a, b, c, d;
while (1) {
scanf("%d", &a);
if (a == 0)
break;
for (i = 0; i < a; i++) {
scanf("%d %d %d", &b, &c, &d);
if (b == 100 || c == 100 || d == 100) {
printf("A\n");
} else if ((b + c) / 2 >= 90) {
printf("A\n");
} else if ((b + c + d) / 3 >= 80) {
printf("A\n");
} else if ((b + c + d) / 3 >= 70) {
printf("B\n");
} else if ((b + c + d) / 3 >= 50 && b >= 80 || c >= 80) {
printf("B\n");
} else {
printf("C\n");
}
}
}
return 0;
}
|
[["-", 0, 57, 75, 76, 0, 57, 15, 23, 0, 25], ["-", 0, 57, 75, 76, 0, 57, 64, 9, 0, 45], ["-", 75, 76, 0, 57, 64, 9, 0, 57, 0, 121], ["-", 0, 57, 64, 9, 0, 57, 15, 23, 0, 24], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 98], ["-", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46]]
| 0
| 223
| 6
|
#include <stdio.h>
int main(void) {
int n;
int pm, pe, pj;
int i;
scanf("%d", &n);
while (n != 0) {
for (i = 0; i < n; i++) {
scanf("%d %d %d", &pm, &pe, &pj);
if (pm == 100 || pe == 100 || pj == 100) {
printf("A");
} else if ((pm + pe) / 2 >= 90) {
printf("A");
} else if ((pm + pe + pj) / 3 >= 80) {
printf("A");
} else if ((pm + pe + pj) / 3 >= 70) {
printf("B");
} else if ((pm + pe + pj) / 3 >= 50 && (pm == 80 || pe == 80)) {
printf("B");
} else {
printf("C");
}
printf("\n");
}
scanf("%d", &n);
}
return (0);
}
|
#include <stdio.h>
int main(void) {
int n;
int pm, pe, pj;
int i;
scanf("%d", &n);
while (n != 0) {
for (i = 0; i < n; i++) {
scanf("%d %d %d", &pm, &pe, &pj);
if (pm == 100 || pe == 100 || pj == 100) {
printf("A");
} else if ((pm + pe) / 2 >= 90) {
printf("A");
} else if ((pm + pe + pj) / 3 >= 80) {
printf("A");
} else if ((pm + pe + pj) / 3 >= 70) {
printf("B");
} else if ((pm + pe + pj) / 3 >= 50 && (pm >= 80 || pe >= 80)) {
printf("B");
} else {
printf("C");
}
printf("\n");
}
scanf("%d", &n);
}
return (0);
}
|
[["-", 0, 16, 12, 23, 0, 16, 31, 16, 17, 60], ["+", 0, 16, 12, 23, 0, 16, 31, 16, 17, 20], ["-", 0, 16, 12, 23, 0, 16, 12, 16, 17, 60], ["+", 0, 16, 12, 23, 0, 16, 12, 16, 17, 20]]
| 0
| 230
| 4
|
/*
AizuOnline A0218
Title Dividing Students
*/
#include <stdio.h>
// Select Below
//#include <stdlib.h>
//#include <string.h>
//#include <float.h>
//#include <math.h>
//#include <limits.h>
// Global data section
int n;
int pe, pm, pj;
//
main() {
int i;
int av, avme;
while (EOF != scanf("%d", &n) && n) {
for (i = 0; i < n; i++) {
scanf("%d %d %d", &pm, &pe, &pj);
av = (pe + pm + pj) / 3;
avme = (pe + pm) / 2;
if (pe == 100 || pm == 100 || pj == 100 || av >= 80 || avme >= 80)
printf("A\n");
else if ((av >= 70) || (av >= 50 && (pe >= 80 || pm >= 80)))
printf("B\n");
else
printf("C\n");
}
}
return (0);
}
|
/*
AizuOnline A0218
Title Dividing Students
*/
#include <stdio.h>
// Select Below
//#include <stdlib.h>
//#include <string.h>
//#include <float.h>
//#include <math.h>
//#include <limits.h>
// Global data section
int n;
int pe, pm, pj;
//
main() {
int i;
int av, avme;
while (EOF != scanf("%d", &n) && n) {
for (i = 0; i < n; i++) {
scanf("%d %d %d", &pm, &pe, &pj);
av = (pe + pm + pj) / 3;
avme = (pe + pm) / 2;
if (pe == 100 || pm == 100 || pj == 100 || av >= 80 || avme >= 90)
printf("A\n");
else if ((av >= 70) || (av >= 50 && (pe >= 80 || pm >= 80)))
printf("B\n");
else
printf("C\n");
}
}
return (0);
}
|
[["-", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]]
| 0
| 183
| 2
|
#include <stdio.h>
void dividing(int pm, int pe, int pj);
int main(void) {
int n;
int pm, pe, pj;
while (1) {
int i = 0;
scanf("%d", &n);
if (n == 0) {
break;
} else {
while (i < n) {
scanf("%d %d %d", &pm, &pe, &pj);
dividing(pm, pe, pj);
i++;
}
}
}
return 0;
}
void dividing(int pm, int pe, int pj) {
if (pm == 100 || pe == 100 || pj == 100) {
printf("A\n");
} else if (pm + pe >= 90 * 2) {
printf("A\n");
} else if (pm + pe + pj >= 80 * 3) {
printf("A\n");
} else if (pm + pe + pj >= 70 * 3) {
printf("B\n");
} else if ((pm + pe + pj >= 50 * 3) && (pm > 80 || pe > 80)) {
printf("B\n");
} else {
printf("C\n");
}
}
|
#include <stdio.h>
void dividing(int pm, int pe, int pj);
int main(void) {
int n;
int pm, pe, pj;
while (1) {
int i = 0;
scanf("%d", &n);
if (n == 0) {
break;
} else {
while (i < n) {
scanf("%d %d %d", &pm, &pe, &pj);
dividing(pm, pe, pj);
i++;
}
}
}
return 0;
}
void dividing(int pm, int pe, int pj) {
if (pm == 100 || pe == 100 || pj == 100) {
printf("A\n");
} else if (pm + pe >= 90 * 2) {
printf("A\n");
} else if (pm + pe + pj >= 80 * 3) {
printf("A\n");
} else if (pm + pe + pj >= 70 * 3) {
printf("B\n");
} else if ((pm + pe + pj >= 50 * 3) && (pm >= 80 || pe >= 80)) {
printf("B\n");
} else {
printf("C\n");
}
}
|
[["-", 51, 16, 12, 23, 0, 16, 31, 16, 17, 47], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 17, 20], ["-", 51, 16, 12, 23, 0, 16, 12, 16, 17, 47], ["+", 51, 16, 12, 23, 0, 16, 12, 16, 17, 20]]
| 1
| 256
| 4
|
#include <stdio.h>
char dividing(int pm, int pe, int pj);
int main(void) {
while (1) {
int number;
scanf("%d", &number);
if (number == 0) {
break;
} else {
for (int i = 0; i < number; i++) {
int pm, pe, pj;
scanf("%d %d %d", &pm, &pe, &pj);
printf("%c\n", dividing(pm, pe, pj));
}
}
}
}
char dividing(int pm, int pe, int pj) {
if (pm == 100 || pe == 100 || pj == 100 || (pm + pe) / 2 >= 90 ||
(pm + pe + pj) / 3 >= 80) {
return 'A';
} else if ((pm + pe + pj) / 3 >= 70 ||
((pm + pe + pj) / 3 >= 50 && !(pm >= 80 && pe >= 80))) {
return 'B';
} else {
return 'C';
}
}
|
#include <stdio.h>
char dividing(int pm, int pe, int pj);
int main(void) {
while (1) {
int number;
scanf("%d", &number);
if (number == 0) {
break;
} else {
for (int i = 0; i < number; i++) {
int pm, pe, pj;
scanf("%d %d %d", &pm, &pe, &pj);
printf("%c\n", dividing(pm, pe, pj));
}
}
}
}
char dividing(int pm, int pe, int pj) {
if (pm == 100 || pe == 100 || pj == 100 || (pm + pe) / 2 >= 90 ||
(pm + pe + pj) / 3 >= 80) {
return 'A';
} else if ((pm + pe + pj) / 3 >= 70 ||
((pm + pe + pj) / 3 >= 50 && (pm >= 80 || pe >= 80))) {
return 'B';
} else {
return 'C';
}
}
|
[["-", 51, 16, 12, 23, 0, 16, 12, 91, 17, 111], ["-", 0, 16, 12, 91, 28, 23, 0, 16, 17, 98], ["+", 12, 23, 0, 16, 12, 23, 0, 16, 17, 106]]
| 1
| 222
| 3
|
#include <stdio.h>
int main(void) {
int n, i;
int pm, pe, pj;
int meh, h;
int flg = 0;
scanf("%d", &n);
while (n != 0) {
for (i = 0; i < n; i++) {
scanf("%d %d %d", &pm, &pe, &pj);
meh = (pm + pe) / 2;
h = (pm + pe + pj) / 3;
if (pe >= 80 || pj >= 80) {
flg = 1;
}
if (pm == 100 || pe == 100 || pj == 100) {
printf("A\n");
} else if (meh >= 90) {
printf("A\n");
} else if (h >= 80) {
printf("A\n");
} else if (h >= 70) {
printf("B\n");
} else if (h >= 50 && flg == 1) {
printf("B\n");
} else {
printf("C\n");
}
}
scanf("%d", &n);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, i;
int pm, pe, pj;
int meh, h;
int flg = 0;
scanf("%d", &n);
while (n != 0) {
for (i = 0; i < n; i++) {
scanf("%d %d %d", &pm, &pe, &pj);
meh = (pm + pe) / 2;
h = (pm + pe + pj) / 3;
if (pm >= 80 || pe >= 80) {
flg = 1;
}
if (pm == 100 || pe == 100 || pj == 100) {
printf("A\n");
} else if (meh >= 90) {
printf("A\n");
} else if (h >= 80) {
printf("A\n");
} else if (h >= 70) {
printf("B\n");
} else if (h >= 50 && flg == 1) {
printf("B\n");
} else {
printf("C\n");
}
flg = 0;
}
scanf("%d", &n);
}
return 0;
}
|
[["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]]
| 1
| 238
| 8
|
#include <cstdio>
int n;
int main() {
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++) {
int pm, pe, pj, ave;
scanf("%d%d%d", &pm, &pe, &pj);
ave = (pm + pe + pj) / 3;
if (pm == 100 || pe == 100 || pj == 100 || ave >= 90 ||
(pm + pe) / 2 >= 80)
printf("A\n");
else if (ave >= 70 || (ave >= 50 && (pm >= 80 || pe >= 80)))
printf("B\n");
else
printf("C\n");
}
}
}
|
#include <cstdio>
int n;
int main() {
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++) {
int pm, pe, pj, ave;
scanf("%d%d%d", &pm, &pe, &pj);
ave = (pm + pe + pj) / 3;
if (pm == 100 || pe == 100 || pj == 100 || ave >= 80 ||
(pm + pe) / 2 >= 90)
printf("A\n");
else if (ave >= 70 || (ave >= 50 && (pm >= 80 || pe >= 80)))
printf("B\n");
else
printf("C\n");
}
}
}
|
[["-", 15, 339, 51, 16, 31, 16, 12, 16, 12, 13], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]]
| 1
| 156
| 4
|
/*
* File: main.cpp
* Author: freebsd
*
* Created on 2014/08/28, 10:07
*/
#include <cstdio>
using namespace std;
int main() {
while (true) {
int n = 0, pm = 0, pe = 0, pj = 0;
int ave = 0, avepe = 0;
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d %d %d", &pm, &pe, &pj);
avepe = (pm + pe) / 2;
ave = (pm + pe + pj) / 3;
if (pm == 100 || pe == 100 || pj == 100)
printf("A\n");
else if (avepe >= 90)
printf("A\n");
else if (ave >= 80)
printf("A\n");
else if (ave >= 70)
printf("B\n");
else if (ave >= 50 && (pm >= 80 || pe >= 80))
printf("B\n");
else
("C\n");
}
}
return 0;
}
|
/*
* File: main.cpp
* Author: freebsd
*
* Created on 2014/08/28, 10:07
*/
#include <cstdio>
using namespace std;
int main() {
while (true) {
int n = 0, pm = 0, pe = 0, pj = 0;
int ave = 0, avepe = 0;
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d %d %d", &pm, &pe, &pj);
avepe = (pm + pe) / 2;
ave = (pm + pe + pj) / 3;
if (pm == 100 || pe == 100 || pj == 100)
printf("A\n");
else if (avepe >= 90)
printf("A\n");
else if (ave >= 80)
printf("A\n");
else if (ave >= 70)
printf("B\n");
else if (ave >= 50 && (pm >= 80 || pe >= 80))
printf("B\n");
else
printf("C\n");
}
}
return 0;
}
|
[["+", 0, 57, 75, 76, 0, 1, 0, 2, 63, 22]]
| 1
| 220
| 1
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n != 0) {
while (n > 0) {
int pm, pe, pj;
cin >> pm >> pe >> pj;
if (pm = 100 || pe == 100 || pj == 100 || pm >= 90 ||
(pm + pe) / 2 >= 90 || (pm + pe + pj) / 3 >= 80)
cout << "A" << endl;
else if ((pm + pe + pj) / 3 >= 70 ||
((pm + pe + pj) / 3 >= 50 && pm >= 80 || pe >= 80))
cout << "B" << endl;
else
cout << "C" << endl;
n--;
}
} else
break;
}
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n != 0) {
while (n > 0) {
int pm, pe, pj;
cin >> pm >> pe >> pj;
if (pm == 100 || pe == 100 || pj == 100 || (pm + pe) / 2 >= 90 ||
(pm + pe + pj) / 3 >= 80)
cout << "A" << endl;
else if ((pm + pe + pj) / 3 >= 70 ||
((pm + pe + pj) / 3 >= 50 && pm >= 80 || pe >= 80))
cout << "B" << endl;
else
cout << "C" << endl;
n--;
}
} else
break;
}
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 17, 60], ["-", 51, 11, 12, 16, 31, 16, 31, 16, 17, 106], ["-", 12, 16, 31, 16, 31, 16, 12, 16, 31, 22], ["-", 12, 16, 31, 16, 31, 16, 12, 16, 17, 20], ["-", 12, 16, 31, 16, 31, 16, 12, 16, 12, 13]]
| 1
| 162
| 6
|
#include <bits/stdc++.h>
using namespace std;
main() {
int n, pm, pe, pj;
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> pm >> pe >> pj;
if (pm == 100 || pe == 100 || pj == 100 || (pe + pm) / 2 >= 90 ||
(pe + pm + pj) / 3 >= 80) {
cout << 'A' << endl;
} else if ((pe + pm + pj) / 3 >= 70 ||
((pe + pm + pj) / 3 >= 50 && (pe == 80 || pm == 80))) {
cout << 'B' << endl;
} else {
cout << 'C' << endl;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
main() {
int n, pm, pe, pj;
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> pm >> pe >> pj;
if (pm == 100 || pe == 100 || pj == 100 || (pe + pm) / 2 >= 90 ||
(pe + pm + pj) / 3 >= 80) {
cout << 'A' << endl;
} else if ((pe + pm + pj) / 3 >= 70 ||
((pe + pm + pj) / 3 >= 50 && (pe >= 80 || pm >= 80))) {
cout << 'B' << endl;
} else {
cout << 'C' << endl;
}
}
}
}
|
[["-", 0, 16, 12, 23, 0, 16, 31, 16, 17, 60], ["+", 0, 16, 12, 23, 0, 16, 31, 16, 17, 20], ["-", 0, 16, 12, 23, 0, 16, 12, 16, 17, 60], ["+", 0, 16, 12, 23, 0, 16, 12, 16, 17, 20]]
| 1
| 168
| 4
|
#include <stdio.h>
float mean2(int x, int y) { return (float)(x + y) / 2.0; }
float mean3(int x, int y, int z) { return (float)(x + y + z) / 3.0; }
char grading(int p_math, int p_eng, int p_jpn) {
if (p_math == 100 || p_eng == 100 || p_jpn == 100) {
return 'A';
} else if (mean2(p_math, p_eng) >= 90.0) {
return 'A';
} else if (mean3(p_math, p_eng, p_jpn) >= 80.0) {
return 'A';
} else if (mean3(p_math, p_eng, p_jpn) >= 70.0) {
return 'B';
} else if (mean3(p_math, p_eng, p_jpn) >= 70.0 &&
(p_math >= 80 || p_eng >= 80)) {
return 'B';
} else {
return 'C';
}
}
int main(void) {
int i, p_math, p_eng, p_jpn, n_iteration;
char grade;
while (1) {
scanf("%d", &n_iteration);
if (n_iteration == 0) {
break;
}
for (i = 0; i < n_iteration; i++) {
scanf("%d %d %d", &p_math, &p_eng, &p_jpn);
grade = grading(p_math, p_eng, p_jpn);
printf("%c\n", grade);
}
}
return 0;
}
|
#include <stdio.h>
float mean2(int x, int y) { return (float)(x + y) / 2.0; }
float mean3(int x, int y, int z) { return (float)(x + y + z) / 3.0; }
char grading(int p_math, int p_eng, int p_jpn) {
if (p_math == 100 || p_eng == 100 || p_jpn == 100) {
return 'A';
} else if (mean2(p_math, p_eng) >= 90.0) {
return 'A';
} else if (mean3(p_math, p_eng, p_jpn) >= 80.0) {
return 'A';
} else if (mean3(p_math, p_eng, p_jpn) >= 70.0) {
return 'B';
} else if (mean3(p_math, p_eng, p_jpn) >= 50.0 &&
(p_math >= 80 || p_eng >= 80)) {
return 'B';
} else {
return 'C';
}
}
int main(void) {
int i, p_math, p_eng, p_jpn, n_iteration;
char grade;
while (1) {
scanf("%d", &n_iteration);
if (n_iteration == 0) {
break;
}
for (i = 0; i < n_iteration; i++) {
scanf("%d %d %d", &p_math, &p_eng, &p_jpn);
grade = grading(p_math, p_eng, p_jpn);
printf("%c\n", grade);
}
}
return 0;
}
|
[["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]]
| 1
| 290
| 2
|
#include <stdio.h>
char classify(int pm, int pe, int pj);
int main(void) {
int n, pm, pe, pj;
while (true) {
scanf("%d", &n);
if (n == 0) {
break;
} else {
for (int i = 0; i < n; i++) {
scanf("%d %d %d", &pm, &pe, &pj);
printf("%c\n", classify(pm, pe, pj));
}
}
return 0;
}
}
char classify(int pm, int pe, int pj) {
int ave = (pm + pe + pj) / 3;
if (pm == 100 || pe == 100 || pj == 100) {
return 'A';
} else if ((pm + pe) / 2 >= 90) {
return 'A';
} else if (ave >= 80) {
return 'A';
} else if (ave >= 70) {
return 'B';
} else if (ave >= 50 && (pm >= 80 || pe >= 80)) {
return 'B';
} else {
return 'C';
}
}
|
#include <stdio.h>
char classify(int pm, int pe, int pj);
int main(void) {
int n, pm, pe, pj;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
} else {
for (int i = 0; i < n; i++) {
scanf("%d %d %d", &pm, &pe, &pj);
printf("%c\n", classify(pm, pe, pj));
}
}
}
return 0;
}
char classify(int pm, int pe, int pj) {
int ave = (pm + pe + pj) / 3;
if (pm == 100 || pe == 100 || pj == 100) {
return 'A';
} else if ((pm + pe) / 2 >= 90) {
return 'A';
} else if (ave >= 80) {
return 'A';
} else if (ave >= 70) {
return 'B';
} else if (ave >= 50 && (pm >= 80 || pe >= 80)) {
return 'B';
} else {
return 'C';
}
}
|
[["-", 0, 14, 8, 9, 0, 52, 15, 339, 51, 146], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["+", 75, 76, 0, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 240
| 4
|
#include <iostream>
using namespace std;
int n, a, b, c;
int main() {
while (true) {
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a + b + c >= 240) {
goto A;
}
if (a + b >= 180) {
goto A;
}
if (a == 100 || b == 100 || c == 100) {
goto A;
}
if (a + b + c >= 210) {
goto B;
}
if (a + b + c >= 150 && (a == 80 || b == 80)) {
goto B;
}
goto C;
A:;
cout << 'A' << endl;
goto D;
B:;
cout << 'B' << endl;
goto D;
C:;
cout << 'C' << endl;
goto D;
D:;
}
}
}
|
#include <iostream>
using namespace std;
int n, a, b, c;
int main() {
while (true) {
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a + b + c >= 240) {
goto A;
}
if (a + b >= 180) {
goto A;
}
if (a == 100 || b == 100 || c == 100) {
goto A;
}
if (a + b + c >= 210) {
goto B;
}
if (a + b + c >= 150 && (a >= 80 || b >= 80)) {
goto B;
}
goto C;
A:;
cout << 'A' << endl;
goto D;
B:;
cout << 'B' << endl;
goto D;
C:;
cout << 'C' << endl;
goto D;
D:;
}
}
}
|
[["-", 51, 16, 12, 23, 0, 16, 31, 16, 17, 60], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 17, 20], ["-", 51, 16, 12, 23, 0, 16, 12, 16, 17, 60], ["+", 51, 16, 12, 23, 0, 16, 12, 16, 17, 20]]
| 1
| 200
| 4
|
#include <iostream>
using namespace std;
int main() {
int n, pm, pe, pj;
while (cin >> n, n) {
for (; n; --n) {
cin >> pm >> pe >> pj;
int avr = pm + pe + pj;
if (pm == 100 || pe == 100 || pj == 100)
cout << "A";
else if (pm + pe >= 160)
cout << "A";
else if (avr >= 240)
cout << "A";
else if (avr >= 210)
cout << "B";
else if (avr >= 150 && (pm >= 80 || pe >= 80))
cout << "B";
else
cout << "C";
cout << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, pm, pe, pj;
while (cin >> n, n) {
for (; n; --n) {
cin >> pm >> pe >> pj;
int avr = pm + pe + pj;
if (pm == 100 || pe == 100 || pj == 100)
cout << "A";
else if (pm + pe >= 180)
cout << "A";
else if (avr >= 240)
cout << "A";
else if (avr >= 210)
cout << "B";
else if (avr >= 150 && (pm >= 80 || pe >= 80))
cout << "B";
else
cout << "C";
cout << endl;
}
}
return 0;
}
|
[["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13]]
| 1
| 156
| 2
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
while (cin >> n, n) {
while (n--) {
double a, b, c;
cin >> a >> b >> c;
if (a == 100 or b == 100 or c == 100)
cout << "A";
else if ((a + b) / 2 >= 90)
cout << "A";
else if ((a + b + c) / 3 >= 80)
cout << "A";
else if ((a + b + c) / 3 >= 70)
cout << "B";
else if ((a + b + c) / 3 >= 50) {
if (a >= 80 || b >= 80)
cout << "B";
} else
cout << "C";
cout << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
while (cin >> n, n) {
while (n--) {
double a, b, c;
cin >> a >> b >> c;
if (a == 100 or b == 100 or c == 100)
cout << "A";
else if ((a + b) / 2 >= 90)
cout << "A";
else if ((a + b + c) / 3 >= 80)
cout << "A";
else if ((a + b + c) / 3 >= 70)
cout << "B";
else if ((a + b + c) / 3 >= 50 && (a >= 80 or b >= 80))
cout << "B";
else
cout << "C";
cout << endl;
}
}
}
|
[["-", 0, 57, 75, 76, 0, 57, 15, 339, 0, 25], ["-", 0, 57, 75, 76, 0, 57, 64, 9, 0, 45], ["-", 75, 76, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 98], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 354], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 25], ["-", 0, 57, 75, 76, 0, 57, 64, 9, 0, 46]]
| 1
| 190
| 8
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
while (n--) {
int a, b, c;
cin >> a >> b >> c;
if (a == 100 || b == 100 || c == 100) {
cout << 'A' << endl;
continue;
}
if (a + b >= 180) {
cout << 'A' << endl;
continue;
}
if (a + b + c >= 240) {
cout << 'A' << endl;
}
if (a + b + c >= 210) {
cout << 'B' << endl;
continue;
}
if (a + b + c >= 150 && (a >= 80 || b >= 80)) {
cout << 'B' << endl;
continue;
}
cout << 'C' << endl;
}
}
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
while (n--) {
int a, b, c;
cin >> a >> b >> c;
if (a == 100 || b == 100 || c == 100) {
cout << 'A' << endl;
continue;
}
if (a + b >= 180) {
cout << 'A' << endl;
continue;
}
if (a + b + c >= 240) {
cout << 'A' << endl;
continue;
}
if (a + b + c >= 210) {
cout << 'B' << endl;
continue;
}
if (a + b + c >= 150 && (a >= 80 || b >= 80)) {
cout << 'B' << endl;
continue;
}
cout << 'C' << endl;
}
}
}
|
[["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 35]]
| 1
| 177
| 2
|
#include <iostream>
char detClass(int pm, int pe, int pj) {
int mean = pm + pe + pj;
if ((pm == 100) | (pe == 100) | (pj == 100)) {
return 'A';
} else if ((pm + pe) / 2 >= 90) {
return 'A';
} else if (mean >= 240) {
return 'A';
} else if (mean >= 140) {
return 'B';
} else if ((mean >= 100) && ((pm >= 80) | (pe >= 80))) {
return 'B';
} else {
return 'C';
}
}
int main() {
int n, pm, pe, pj = 0;
while (true) {
std::cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
std::cin >> pm >> pe >> pj;
std::cout << detClass(pm, pe, pj) << std::endl;
}
}
return 0;
}
|
#include <iostream>
char detClass(int pm, int pe, int pj) {
int mean = pm + pe + pj;
if ((pm == 100) | (pe == 100) | (pj == 100)) {
return 'A';
} else if ((pm + pe) >= 180) {
return 'A';
} else if (mean >= 240) {
return 'A';
} else if (mean >= 210) {
return 'B';
} else if ((mean >= 150) && ((pm >= 80) | (pe >= 80))) {
return 'B';
} else {
return 'C';
}
}
int main() {
int n, pm, pe, pj = 0;
while (true) {
std::cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
std::cin >> pm >> pe >> pj;
std::cout << detClass(pm, pe, pj) << std::endl;
}
}
return 0;
}
|
[["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 85], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 15, 339, 51, 16, 31, 23, 0, 16, 12, 13], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 12, 13]]
| 1
| 223
| 8
|
#include <stdio.h>
int main(void) {
int n, pm, pe, pj, s, i;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d%d%d", &pm, &pe, &pj);
s = (pm + pe + pj) / 3;
if (pm == 100 || pe == 100 || pj == 100)
printf("A\n");
else if ((pm + pe) / 2 >= 90)
printf("A\n");
else if (s >= 80)
printf("A\n");
else if (s >= 70)
printf("B\n");
else if (s >= 50 && (pm == 80 || pe == 80))
printf("B\n");
else
printf("C\n");
}
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, pm, pe, pj, s, i;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d%d%d", &pm, &pe, &pj);
s = (pm + pe + pj) / 3;
if (pm == 100 || pe == 100 || pj == 100)
printf("A\n");
else if ((pm + pe) / 2 >= 90)
printf("A\n");
else if (s >= 80)
printf("A\n");
else if (s >= 70)
printf("B\n");
else if (s >= 50 && (pm >= 80 || pe >= 80))
printf("B\n");
else
printf("C\n");
}
}
return 0;
}
|
[["-", 51, 16, 12, 23, 0, 16, 31, 16, 17, 60], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 17, 20], ["-", 51, 16, 12, 23, 0, 16, 12, 16, 17, 60], ["+", 51, 16, 12, 23, 0, 16, 12, 16, 17, 20]]
| 1
| 199
| 4
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
for (int i = 0; i < n; i++) {
int e, f, g, a = 0, b = 0, c = 0;
char l;
cin >> e >> f >> g;
if (e == 100 || f == 100 || g == 100)
a++;
if ((e + f) / 2 >= 90)
a++;
double d = (e + f + g) / 3;
if (d >= 80)
a++;
if (d >= 70)
b++;
if (d >= 50 && (e >= 80 || f >= 80))
b++;
if (a != 0 || b >= 2)
cout << 'A' << endl;
else if (b != 0)
cout << 'B' << endl;
else
cout << 'C' << endl;
}
}
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
for (int i = 0; i < n; i++) {
int e, f, g, a = 0, b = 0, c = 0;
char l;
cin >> e >> f >> g;
if (e == 100 || f == 100 || g == 100)
a++;
if ((e + f) / 2 >= 90)
a++;
double d = (e + f + g) / 3;
if (d >= 80)
a++;
if (d >= 70)
b++;
if (d >= 50 && (e >= 80 || f >= 80))
b++;
if (a != 0)
cout << 'A' << endl;
else if (b != 0)
cout << 'B' << endl;
else
cout << 'C' << endl;
}
}
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]]
| 1
| 197
| 4
|
#include <algorithm>
#include <bitset>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, b, n) for (int i = b; i < n; i++)
#define SORT(c) sort((c).begin(), (c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
const float PI = 3.1415926;
static const int INFTY = (1 << 30);
using namespace std;
typedef long long ll;
typedef long double ld;
int n;
int main() {
while (cin >> n, n) {
rep(i, n) {
int pm, pe, pj;
cin >> pm >> pe >> pj;
float tmp1 = (pm + pe) / 2.0;
float tmp2 = (pm + pe + pj) / 3.0;
if (tmp1 > 90 || tmp2 > 80 || pm == 100 || pe == 100 || pj == 100) {
cout << 'A' << endl;
} else if (tmp2 > 70 || (tmp2 > 50 && (pm > 80 || pe > 80))) {
cout << 'B' << endl;
} else {
cout << 'C' << endl;
}
}
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, b, n) for (int i = b; i < n; i++)
#define SORT(c) sort((c).begin(), (c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
const float PI = 3.1415926;
static const int INFTY = (1 << 30);
using namespace std;
typedef long long ll;
typedef long double ld;
int n;
int main() {
while (cin >> n, n) {
rep(i, n) {
int pm, pe, pj;
cin >> pm >> pe >> pj;
float tmp1 = (pm + pe) / 2.0;
float tmp2 = (pm + pe + pj) / 3.0;
if (tmp1 >= 90 || tmp2 >= 80 || pm == 100 || pe == 100 || pj == 100) {
cout << 'A' << endl;
} else if (tmp2 >= 70 || (tmp2 >= 50 && (pm >= 80 || pe >= 80))) {
cout << 'B' << endl;
} else {
cout << 'C' << endl;
}
}
}
return 0;
}
|
[["-", 31, 16, 31, 16, 31, 16, 31, 16, 17, 47], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 17, 20], ["-", 31, 16, 31, 16, 31, 16, 12, 16, 17, 47], ["+", 31, 16, 31, 16, 31, 16, 12, 16, 17, 20], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 20], ["-", 51, 16, 12, 23, 0, 16, 31, 16, 17, 47], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 17, 20], ["-", 0, 16, 12, 23, 0, 16, 31, 16, 17, 47], ["+", 0, 16, 12, 23, 0, 16, 31, 16, 17, 20], ["-", 0, 16, 12, 23, 0, 16, 12, 16, 17, 47], ["+", 0, 16, 12, 23, 0, 16, 12, 16, 17, 20]]
| 1
| 226
| 12
|
#include <iostream>
char *c;
int n, pm, pe, pj;
char solve(int m, int e, int j) {
char ans = 'C';
if (m == 100 || e == 100 || j == 100 || m + e >= 180 || m + e + j >= 240)
ans = 'A';
else if (m + e + j >= 210 || (m + e + j >= 50 && (m >= 80 || e >= 80)))
ans = 'B';
return ans;
}
int main() {
while (true) {
std::cin >> n;
if (!n)
return 0;
c = new char[n];
for (int i = 0; i < n; i++) {
std::cin >> pm >> pe >> pj;
c[i] = solve(pm, pe, pj);
}
for (int i = 0; i < n; i++)
std::cout << c[i] << std::endl;
delete[] c;
}
return 0;
}
|
#include <iostream>
char *c;
int n, pm, pe, pj;
char solve(int m, int e, int j) {
char ans = 'C';
if (m == 100 || e == 100 || j == 100 || m + e >= 180 || m + e + j >= 240)
ans = 'A';
else if (m + e + j >= 210 || (m + e + j >= 150 && (m >= 80 || e >= 80)))
ans = 'B';
return ans;
}
int main() {
while (true) {
std::cin >> n;
if (!n)
return 0;
c = new char[n];
for (int i = 0; i < n; i++) {
std::cin >> pm >> pe >> pj;
c[i] = solve(pm, pe, pj);
}
for (int i = 0; i < n; i++)
std::cout << c[i] << std::endl;
delete[] c;
}
return 0;
}
|
[["-", 51, 16, 12, 23, 0, 16, 31, 16, 12, 13], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 12, 13]]
| 1
| 219
| 2
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
while (n--) {
int pm, pe, pj;
cin >> pm >> pe >> pj;
if (pm == 100 || pe == 100 || pj == 100 || pm + pe >= 180 ||
pm + pe + pj >= 240)
cout << "A" << endl;
else if (pm + pe + pj >= 210 ||
(pm + pe + pj >= 50 && (pm >= 80 || pe >= 80)))
cout << "B" << endl;
else
cout << "C" << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
while (n--) {
int pm, pe, pj;
cin >> pm >> pe >> pj;
if (pm == 100 || pe == 100 || pj == 100 || pm + pe >= 180 ||
pm + pe + pj >= 240)
cout << "A" << endl;
else if (pm + pe + pj >= 210 ||
(pm + pe + pj >= 150 && (pm >= 80 || pe >= 80)))
cout << "B" << endl;
else
cout << "C" << endl;
}
}
return 0;
}
|
[["-", 51, 16, 12, 23, 0, 16, 31, 16, 12, 13], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 12, 13]]
| 1
| 140
| 2
|
#include <iostream>
using namespace std;
int main() {
int n, pm, pe, pj;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
cin >> pm >> pe >> pj;
double me = (pm + pe) / 2;
double avg = (pm + pe + pj) / 3;
if (pm == 100 || pe == 100 || pj == 100 || me >= 90 || avg >= 80) {
cout << "A" << endl;
} else if (avg > 70 || avg >= 50 && (pm >= 80 || pe >= 80)) {
cout << "B" << endl;
} else
cout << "C" << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, pm, pe, pj;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
cin >> pm >> pe >> pj;
double me = (pm + pe) / 2;
double avg = (pm + pe + pj) / 3;
if (pm == 100 || pe == 100 || pj == 100 || me >= 90 || avg >= 80) {
cout << "A" << endl;
} else if (avg >= 70 || avg >= 50 && (pm >= 80 || pe >= 80)) {
cout << "B" << endl;
} else
cout << "C" << endl;
}
}
return 0;
}
|
[["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 20]]
| 1
| 154
| 2
|
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int pm, pe, pj;
for (int i = 0; i < n; i++) {
cin >> pm >> pe >> pj;
if (pm == 100 || pe == 100 || pj == 100)
cout << 'A' << endl;
else if ((pm + pe) / 2 >= 90)
cout << 'A' << endl;
else if ((pm + pe + pj) / 3 >= 80)
cout << 'B' << endl;
else if ((pm + pe + pj) / 3 >= 70)
cout << 'B' << endl;
else if ((pm >= 80 || pe >= 80) && (pm + pe + pj) / 3 >= 50)
cout << 'B' << endl;
else
cout << 'C' << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int pm, pe, pj;
for (int i = 0; i < n; i++) {
cin >> pm >> pe >> pj;
if (pm == 100 || pe == 100 || pj == 100)
cout << 'A' << endl;
else if ((pm + pe) / 2 >= 90)
cout << 'A' << endl;
else if ((pm + pe + pj) / 3 >= 80)
cout << 'A' << endl;
else if ((pm + pe + pj) / 3 >= 70)
cout << 'B' << endl;
else if ((pm >= 80 || pe >= 80) && (pm + pe + pj) / 3 >= 50)
cout << 'B' << endl;
else
cout << 'C' << endl;
}
}
return 0;
}
|
[["-", 64, 1, 0, 16, 31, 16, 12, 103, 0, 125], ["+", 64, 1, 0, 16, 31, 16, 12, 103, 0, 125]]
| 1
| 198
| 2
|
#include <iostream>
using namespace std;
int main(void) {
int n;
while (cin >> n, n) {
int a, b, c;
while (--n, n >= 0) {
cin >> a >> b >> c;
if (a == 100 || b == 100 || c == 100)
cout << "A" << endl;
else if ((a + b) / 2 >= 90)
cout << "A" << endl;
else if ((a + b + c) / 3 >= 90)
cout << "A" << endl;
else if ((a + b + c) / 3 >= 70 ||
((a + b + c) / 3 >= 50 && (a >= 80 || b >= 80)))
cout << "B" << endl;
else
cout << "C" << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int n;
while (cin >> n, n) {
int a, b, c;
while (--n, n >= 0) {
cin >> a >> b >> c;
if (a == 100 || b == 100 || c == 100)
cout << "A" << endl;
else if ((a + b) / 2 >= 90)
cout << "A" << endl;
else if ((a + b + c) / 3 >= 80)
cout << "A" << endl;
else if ((a + b + c) / 3 >= 70 ||
((a + b + c) / 3 >= 50 && (a >= 80 || b >= 80)))
cout << "B" << endl;
else
cout << "C" << endl;
}
}
return 0;
}
|
[["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13]]
| 1
| 177
| 2
|
#include <stdio.h>
int main() {
int i, n, pm, pj, pe;
double avg, emav;
char type;
scanf("%d", &n);
while (n != 0) {
for (i = 0; i < n; i++) {
scanf("%d%d%d", &pm, &pe, &pj);
avg = (pm + pe + pj) / 3.0;
emav = (pm + pe) / 2.0;
if (pm == 100.0 || pe == 100.0 || pj == 100.0 || emav >= 90.0 ||
avg >= 80.0)
type = 'A';
else if (avg >= 70.0)
type = 'B';
else if (avg >= 50.0 && (pe >= 80.0 || pm >= 80.0))
type = 'B';
else
type = 'C';
}
printf("%c\n", type);
scanf("%d", &n);
}
return 0;
}
|
#include <stdio.h>
int main() {
int i, n, pm, pj, pe;
double avg, emav;
char type;
scanf("%d", &n);
while (n != 0) {
for (i = 0; i < n; i++) {
scanf("%d%d%d", &pm, &pe, &pj);
avg = (pm + pe + pj) / 3.0;
emav = (pm + pe) / 2.0;
if (pm == 100.0 || pe == 100.0 || pj == 100.0 || emav >= 90.0 ||
avg >= 80.0)
type = 'A';
else if (avg >= 70.0)
type = 'B';
else if (avg >= 50.0 && (pe >= 80.0 || pm >= 80.0))
type = 'B';
else
type = 'C';
printf("%c\n", type);
}
scanf("%d", &n);
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 192
| 2
|
#include <iostream>
using namespace std;
int main() {
int n, m, e, j;
while (1) {
cin >> n;
if (!n)
break;
for (int i = 0; i < n; i++) {
cin >> m >> e >> j;
if ((m + e) / 2 >= 90 || m == 100 || e == 100 || j == 100 ||
(m + e + j) / 3 >= 80)
cout << 'A' << endl;
else if ((m + e + j) / 3 >= 70 ||
(m + e + j) >= 50 && (m >= 80 || e >= 80))
cout << 'B' << endl;
else
cout << 'C' << endl;
}
}
}
|
#include <iostream>
using namespace std;
int main() {
int n, m, e, j;
while (1) {
cin >> n;
if (!n)
break;
for (int i = 0; i < n; i++) {
cin >> m >> e >> j;
if ((m + e) / 2 >= 90 || m == 100 || e == 100 || j == 100 ||
(m + e + j) / 3 >= 80)
cout << 'A' << endl;
else if ((m + e + j) / 3 >= 70 ||
(m + e + j) / 3 >= 50 && (m >= 80 || e >= 80))
cout << 'B' << endl;
else
cout << 'C' << endl;
}
}
}
|
[["+", 51, 16, 12, 16, 31, 16, 31, 16, 17, 85], ["+", 51, 16, 12, 16, 31, 16, 31, 16, 12, 13]]
| 1
| 158
| 2
|
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int school(int m, int e, int j) {
if (m == 100 || e == 100 || j == 100)
return 'A';
if ((m + e) >= 180 || (m + e + j) >= 240)
return 'A';
if ((m + e + j) >= 210 || ((m + e + j) >= 150 && (m >= 80 || e >= 80)))
return 'B';
return 'C';
}
int main() {
int x, m, e, j;
while (cin >> x) {
for (int i = 0; i < x; i++) {
cin >> m >> e >> j;
cout << school(m, e, j);
}
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
char school(int m, int e, int j) {
if (m == 100 || e == 100 || j == 100)
return 'A';
if ((m + e) >= 180 || (m + e + j) >= 240)
return 'A';
if ((m + e + j) >= 210 || ((m + e + j) >= 150 && (m >= 80 || e >= 80)))
return 'B';
else
return 'C';
}
int main() {
int x, m, e, j;
while (cin >> x) {
for (int i = 0; i < x; i++) {
cin >> m >> e >> j;
cout << school(m, e, j) << endl;
}
}
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 173
| 5
|
#include <iostream>
using namespace std;
int middium(int mat, int ing, int jap) { return (mat + ing + jap) / 3; }
void classes(int mat, int ing, int jap) {
int mid;
mid = middium(mat, ing, jap);
if (mat == 100 || ing == 100 || jap == 100)
cout << "A";
else if ((mat + ing) / 2 >= 90)
cout << "A";
else if (mid >= 80)
cout << "B";
else if (mid >= 70)
cout << "B";
else if (mid >= 50 && (mat >= 80 || ing >= 80))
cout << "B";
else
cout << "C";
}
int main() {
int n, pm, pe, pj;
char cla;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
cin >> pm >> pe >> pj;
classes(pm, pe, pj);
cout << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int middium(int mat, int ing, int jap) { return (mat + ing + jap) / 3; }
void classes(int mat, int ing, int jap) {
int mid;
mid = middium(mat, ing, jap);
if (mat == 100 || ing == 100 || jap == 100)
cout << "A";
else if ((mat + ing) / 2 >= 90)
cout << "A";
else if (mid >= 80)
cout << "A";
else if (mid >= 70)
cout << "B";
else if (mid >= 50 && (mat >= 80 || ing >= 80))
cout << "B";
else
cout << "C";
}
int main() {
int n, pm, pe, pj;
char cla;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
cin >> pm >> pe >> pj;
classes(pm, pe, pj);
cout << endl;
}
}
return 0;
}
|
[["-", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6]]
| 1
| 222
| 2
|
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
while (n--) {
int ei, suu, koku;
cin >> suu >> ei >> koku;
if (suu == 100 || ei == 100 || koku == 100)
puts("A");
else if ((suu + ei) / 2 >= 90)
puts("A");
else if ((suu + ei + koku) / 3 >= 80)
puts("A");
else if ((suu + ei + koku) / 3 >= 70)
puts("B");
else if ((suu + ei + koku) / 3 >= 50 && (suu == 80 || ei == 80))
puts("B");
else
puts("C");
}
}
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
while (n--) {
int ei, suu, koku;
cin >> suu >> ei >> koku;
if (suu == 100 || ei == 100 || koku == 100)
puts("A");
else if ((suu + ei) / 2 >= 90)
puts("A");
else if ((suu + ei + koku) / 3 >= 80)
puts("A");
else if ((suu + ei + koku) / 3 >= 70)
puts("B");
else if ((suu + ei + koku) / 3 >= 50 && (suu >= 80 || ei >= 80))
puts("B");
else
puts("C");
}
}
return 0;
}
|
[["-", 51, 16, 12, 23, 0, 16, 31, 16, 17, 60], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 17, 20], ["-", 51, 16, 12, 23, 0, 16, 12, 16, 17, 60], ["+", 51, 16, 12, 23, 0, 16, 12, 16, 17, 20]]
| 1
| 195
| 4
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
for (int i = 0; i < 3; i++) {
int a, b, c;
cin >> a >> b >> c;
if (a == 100 || b == 100 || c == 100)
cout << "A" << endl;
else if ((a + b) / 2 >= 90)
cout << "A" << endl;
else if ((a + b + c) / 3 >= 80)
cout << "A" << endl;
else if ((a + b + c) / 3 >= 70)
cout << "B" << endl;
else if ((a + b + c) / 3 >= 50 && (a >= 80 || b >= 80))
cout << "B" << endl;
else
cout << "C" << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
double a, b, c;
cin >> a >> b >> c;
if (a == 100 || b == 100 || c == 100)
cout << "A" << endl;
else if ((a + b) / 2 >= 90)
cout << "A" << endl;
else if ((a + b + c) / 3 >= 80)
cout << "A" << endl;
else if ((a + b + c) / 3 >= 70)
cout << "B" << endl;
else if ((a + b + c) / 3 >= 50 && (a >= 80 || b >= 80))
cout << "B" << endl;
else
cout << "C" << endl;
}
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40]]
| 1
| 190
| 4
|
import sys
for s in sys.stdin:
s = list(map(int, s.split()))
if len(s) == 1:
continue
else:
(pm, pe, pj) = tuple(s)
if 100 in (pm, pe, pj): c = "A"
elif pm + pe >= 180: c = "A"
elif pm + pe + pj >= 240: c = "A"
elif pm + pe + pj >= 240: c = "B"
elif pm + pe + pj >= 150 and (pm >= 80 or pe >= 80): c = "B"
else: c = "C"
print(c)
|
import sys
for s in sys.stdin:
s = list(map(int, s.split()))
if len(s) == 1:
continue
else:
(pm, pe, pj) = tuple(s)
if 100 in (pm, pe, pj): c = "A"
elif pm + pe >= 180: c = "A"
elif pm + pe + pj >= 240: c = "A"
elif pm + pe + pj >= 210: c = "B"
elif pm + pe + pj >= 150 and (pm >= 80 or pe >= 80): c = "B"
else: c = "C"
print(c)
|
[["-", 8, 196, 0, 57, 75, 665, 15, 666, 0, 612], ["+", 8, 196, 0, 57, 75, 665, 15, 666, 0, 612]]
| 5
| 138
| 2
|
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
while (n != 0) {
int c[] = new int[11];
int i = 0;
int g = 0;
for (i = 0; i < 10; i++) {
int ice = i;
c[ice] = 0;
}
for (g = 0; g < n; g++) {
int ice = scan.nextInt();
c[ice] += 1;
}
for (int f = 1; f <= 10; f++) {
if (c[f] == 0) {
System.out.println("-");
} else {
for (int b = 0; b < c[f]; b++) {
System.out.print("#");
}
System.out.println("");
}
}
n = scan.nextInt();
}
}
}
|
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
while (n != 0) {
int c[] = new int[10];
int i = 0;
int g = 0;
for (i = 0; i < 10; i++) {
int ice = i;
c[ice] = 0;
}
for (g = 0; g < n; g++) {
int ice = scan.nextInt();
c[ice] += 1;
}
for (int f = 0; f < 10; f++) {
if (c[f] == 0) {
System.out.println("-");
} else {
for (int b = 0; b < c[f]; b++) {
System.out.print("*");
}
System.out.println("");
}
}
n = scan.nextInt();
}
}
}
|
[["-", 0, 503, 49, 200, 51, 227, 497, 505, 0, 499], ["+", 0, 503, 49, 200, 51, 227, 497, 505, 0, 499], ["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["-", 0, 52, 8, 196, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 17, 18], ["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491]]
| 3
| 219
| 8
|
#include <stdio.h>
int main(void) {
int i, j, a, b, c[10000];
while (1) {
scanf("%d", &a);
if (a == 0)
break;
for (i = 0; i < 10; i++) {
c[i] = 0;
}
for (i = 0; i < a; i++) {
scanf("%d", &b);
c[b - 1] += 1;
}
for (i = -1; i < 9; i++) {
if (c[i] > 0) {
for (j = 0; j < c[i]; j++) {
printf("*");
}
printf("\n");
} else {
printf("-\n");
}
}
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, j, a, b, c[10000];
while (1) {
scanf("%d", &a);
if (a == 0)
break;
for (i = 0; i < 10; i++) {
c[i] = 0;
}
for (i = 0; i < a; i++) {
scanf("%d", &b);
c[b] += 1;
}
for (i = 0; i < 10; i++) {
if (c[i] > 0) {
for (j = 0; j < c[i]; j++) {
printf("*");
}
printf("\n");
} else {
printf("-\n");
}
}
}
return 0;
}
|
[["-", 0, 1, 0, 11, 31, 69, 71, 16, 17, 33], ["-", 0, 1, 0, 11, 31, 69, 71, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 175
| 6
|
#include <stdio.h>
int main(void) {
while (1) {
int n, i, j;
int a[11] = {0}, b;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &b);
a[b]++;
}
for (i = 1; i <= 10; i++) {
if (a[i] == 0) {
printf("-\n");
} else {
for (j = 0; j < a[i]; j++) {
printf("*");
}
printf("\n");
}
}
}
}
|
#include <stdio.h>
int main(void) {
while (1) {
int n, i, j;
int a[11] = {0}, b;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &b);
a[b]++;
}
for (i = 0; i <= 9; i++) {
if (a[i] == 0) {
printf("-\n");
} else {
for (j = 0; j < a[i]; j++) {
printf("*");
}
printf("\n");
}
}
}
}
|
[["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 152
| 4
|
#include <stdio.h>
int main(void) {
int i, j, n, data[10000 + 1], suu[10000 + 1];
scanf("%d", &n);
while (n != 0) {
for (i = 0; i < n; i++) {
suu[i] = 0;
}
for (j = 0; j < n; j++) {
scanf("%d", &data[j]);
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (data[j] == i) {
suu[i]++;
}
}
}
for (i = 0; i < n; i++) {
if (suu[i] != 0) {
for (j = 0; j < suu[i]; j++) {
printf("*");
}
printf("\n");
} else if (suu[i] == 0) {
printf("-\n");
}
}
scanf("%d", &n);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, j, n, data[10000 + 1], suu[10000 + 1];
scanf("%d", &n);
while (n != 0) {
for (i = 0; i < 10; i++) {
suu[i] = 0;
}
for (j = 0; j < n; j++) {
scanf("%d", &data[j]);
}
for (i = 0; i < 10; i++) {
for (j = 0; j < n; j++) {
if (data[j] == i) {
suu[i]++;
}
}
}
for (i = 0; i < 10; i++) {
if (suu[i] != 0) {
for (j = 0; j < suu[i]; j++) {
printf("*");
}
printf("\n");
} else if (suu[i] == 0) {
printf("-\n");
}
}
scanf("%d", &n);
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 236
| 6
|
#include <stdio.h>
int main() {
while (1) {
int n, i, k, a[10000] = {0}, b[100] = {0};
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
for (k = 0; k < 10; k++) {
if (k == a[i])
b[k]++;
}
}
printf("\n");
for (i = 0; i < 10; i++) {
if (b[i] == 0)
printf("-");
else
for (k = 0; k < b[i]; k++) {
printf("*");
}
printf("\n");
}
}
return 0;
}
|
#include <stdio.h>
int main() {
while (1) {
int n, i, k, a[10000] = {0}, b[100] = {0};
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
for (k = 0; k < 10; k++) {
if (k == a[i])
b[k]++;
}
}
for (i = 0; i < 10; i++) {
if (b[i] == 0)
printf("-");
else
for (k = 0; k < b[i]; k++) {
printf("*");
}
printf("\n");
}
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 0
| 189
| 7
|
#include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int cnt[10] = {0}, tmp;
for (int i = 0; i < n; i++) {
cin >> tmp;
cnt[tmp]++;
}
for (int i = 0; i < 9; i++) {
if (cnt[i] == 0)
cout << "-" << endl;
else
for (int j = 0; j < cnt[i]; j++)
(j == cnt[i] - 1) ? cout << "*" << endl : cout << "*";
}
}
}
|
#include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int cnt[10] = {0}, tmp;
for (int i = 0; i < n; i++) {
cin >> tmp;
cnt[tmp]++;
}
for (int i = 0; i < 10; i++) {
if (cnt[i] == 0)
cout << "-" << endl;
else
for (int j = 0; j < cnt[i]; j++)
(j == cnt[i] - 1) ? cout << "*" << endl : cout << "*";
}
}
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 143
| 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_pair
#define all(in) in.begin(), in.end()
const double PI = acos(-1);
const double EPS = 1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
int n;
while (cin >> n, n) {
vector<int> in(11);
rep(i, n) {
int a;
cin >> a;
in[a]++;
}
loop(i, 1, 11) {
if (in[i])
rep(j, in[i]) cout << "*";
else
cout << "-";
cout << endl;
}
}
}
|
#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_pair
#define all(in) in.begin(), in.end()
const double PI = acos(-1);
const double EPS = 1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
int n;
while (cin >> n, n) {
vector<int> in(10);
rep(i, n) {
int a;
cin >> a;
in[a]++;
}
rep(i, 10) {
if (in[i])
rep(j, in[i]) cout << "*";
else
cout << "-";
cout << endl;
}
}
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["-", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]]
| 1
| 176
| 8
|
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
int n;
cin >> n;
for (; n != 0; cin >> n) {
int a[10] = {};
rep(i, n) {
int x;
cin >> x;
a[x]++;
}
rep(i, 9) {
if (a[i] == 0) {
cout << "-" << endl;
continue;
}
rep(k, a[i]) { cout << "*"; }
cout << endl;
}
}
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
int n;
cin >> n;
for (; n != 0; cin >> n) {
int a[10] = {};
rep(i, n) {
int x;
cin >> x;
a[x]++;
}
rep(i, 10) {
if (a[i] == 0) {
cout << "-" << endl;
continue;
}
rep(k, a[i]) { cout << "*"; }
cout << endl;
}
}
}
|
[["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]]
| 1
| 129
| 2
|
#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)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout << V << endl
#define pb push_back
#define INF (1 << 30)
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main(void) {
int n;
while (cin >> n) {
if (n == 0)
break;
int menu[10];
fill_n(menu, n, 0);
rep(i, n) {
int a;
cin >> a;
menu[a]++;
}
rep(i, 10) {
if (menu[i] == 0) {
cout << "-" << endl;
} else {
rep(j, menu[i]) { cout << "*"; }
cout << endl;
}
}
}
return 0;
}
int StrToInt(string s) {
stringstream ss;
ss << s;
int val;
ss >> val;
return val;
}
string IntToStr(int i) {
stringstream ss;
ss << i;
return ss.str();
}
|
#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)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout << V << endl
#define pb push_back
#define INF (1 << 30)
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main(void) {
int n;
while (cin >> n) {
if (n == 0)
break;
int menu[15];
fill_n(menu, 15, 0);
rep(i, n) {
int a;
cin >> a;
menu[a]++;
}
rep(i, 10) {
if (menu[i] == 0) {
cout << "-" << endl;
} else {
rep(j, menu[i]) { cout << "*"; }
cout << endl;
}
}
}
return 0;
}
int StrToInt(string s) {
stringstream ss;
ss << s;
int val;
ss >> val;
return val;
}
string IntToStr(int i) {
stringstream ss;
ss << i;
return ss.str();
}
|
[["-", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]]
| 1
| 291
| 4
|
#include <iostream>
using namespace std;
int main() {
int n, i;
while (cin >> n) {
// cout << '!' << endl;
int ice[10] = {};
while (n--) {
cin >> i;
ice[i]++;
}
for (i = 0; i < 10; i++) {
if (ice[i])
while (ice[i]--)
cout << '*';
else
cout << '-';
cout << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, i;
while (cin >> n, n != 0) {
// cout << '!' << endl;
int ice[10] = {};
while (n--) {
cin >> i;
ice[i]++;
}
for (i = 0; i < 10; i++) {
if (ice[i])
while (ice[i]--)
cout << '*';
else
cout << '-';
cout << endl;
}
}
return 0;
}
|
[["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 79], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 12, 13]]
| 1
| 102
| 4
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int num[10], m;
for (int i = 0; i < 10; i++)
num[i] = 0;
for (int i = 0; i < n; i++) {
cin >> m;
num[m]++;
}
for (int i = 0; i < 10; i++) {
if (num[i] == 0)
cout << '-' << endl;
else {
for (int j = 0; j < num[i]; j++) {
cout << '*' << endl;
}
}
}
}
return (0);
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int num[10], m;
for (int i = 0; i < 10; i++)
num[i] = 0;
for (int i = 0; i < n; i++) {
cin >> m;
num[m]++;
}
for (int i = 0; i < 10; i++) {
if (num[i] == 0)
cout << '-' << endl;
else {
for (int j = 0; j < num[i]; j++) {
cout << '*';
}
cout << endl;
}
}
}
return (0);
}
|
[["+", 0, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["+", 75, 76, 0, 9, 0, 7, 8, 9, 0, 46], ["+", 75, 76, 0, 9, 0, 1, 0, 16, 31, 22], ["-", 75, 76, 0, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 148
| 4
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int ice[10] = {0};
int num;
for (int i = 0; i < n; i++) {
cin >> num;
ice[num]++;
}
for (int i = 0; i < 10; i++) {
if (ice[i]) {
for (int j = 0; j < ice[i]; j++) {
cout << "*";
}
} else {
cout << "-";
}
cout << endl;
}
}
return (0);
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int ice[10] = {0};
int num;
for (int i = 0; i < n; i++) {
cin >> num;
ice[num]++;
}
for (int i = 0; i < 10; i++) {
if (ice[i]) {
for (int j = 0; j < ice[i]; j++) {
cout << "*";
}
} else {
cout << "-";
}
cout << endl;
}
}
return (0);
}
|
[["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]]
| 1
| 130
| 2
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.