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]... | #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]... | [["-", 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... | //配る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... | [["-", 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];
... | #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];
... | [["-", 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[1... | #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[1... | [["-", 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;
... | #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;
... | [["-", 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 (i... | #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 (i... | [["+", 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]... | 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]... | [["-", 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, 65... | 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 ];
v... | 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 ];
v... | [["-", 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;
Str... |
// 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;
Str... | [["-", 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[... | 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[... | [["-", 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 < jan... | 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 < jan... | [["+", 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... | #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... | [["-", 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(1... | 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(1... | [["-", 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++;
... | #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++;
... | [["-", 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] ==... | #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] ==... | [["-", 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[ha... | #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[ha... | [["-", 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... | #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... | [["-", 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(Stat... | 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(Stat... | [["-", 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++) {
... | #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++) {
... | [["-", 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] = fal... | #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... | [["-", 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;
in... | #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;
in... | [["-", 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 LO... | #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 LO... | [["-", 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... | #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... | [["-", 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 oper... | #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 oper... | [["+", 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 (i... | #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 (i... | [["-", 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()
#... | #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()
#... | [["-", 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 c... | #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 c... | [["+", 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... | #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... | [["-", 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;
}
ret... | #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;
}
ret... | [["-", 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... | #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... | [["-", 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... | #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 <=... | [["+", 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 >>... | #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 >>... | [["+", 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] = IN... | #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] = IN... | [["-", 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++) {
... | #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++) {
... | [["-", 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 namespac... | #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 namespac... | [["-", 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, in... | #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, in... | [["-", 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... | 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... | [["+", 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(... | #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(... | [["+", 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;
... | #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;
... | [["+", 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]) {
... | #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]) {
... | [["-", 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)
b... | #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)
b... | [["+", 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, 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];
}
... | #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];
}
... | [["+", 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;
... | #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;
... | [["-", 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>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [["+", 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... | #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("... | [["+", 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))... | #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 +... | [["+", 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 << ... | #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;
... | [["+", 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 << " " <... | #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 << " " <<... | [["-", 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.... | 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 (ar... | [["-", 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 (i... | 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 (i... | [["+", 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 >= ... | #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 >= ... | [["-", 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");
... | #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");
... | [["-", 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");
... | #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");
... | [["-", 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... | /*
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... | [["-", 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++;
}
}
... | #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++;
}
}
... | [["-", 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... | #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... | [["-", 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;
}
... | #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;
}
... | [["-", 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,... | 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");
... | #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");
... | [["-", 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("... | /*
* 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("... | [["+", 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)
c... | #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" << en... | [["-", 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 <... | #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 <... | [["-", 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) {
... | #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) {
... | [["-", 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));
}
}
... | #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));
}
}
}
... | [["-", 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... | #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... | [["-", 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... | #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... | [["-", 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 <<... | #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 <<... | [["-", 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], ... | 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;
... | #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;
... | [["+", 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)... | #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) &&... | [["-", 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) ... | #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) ... | [["-", 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 ... | #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 ... | [["-", 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())
#def... | #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())
#def... | [["-", 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, ... | 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 ... | #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... | [["-", 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;
els... | #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;
els... | [["-", 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) {
... | #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) {
... | [["-", 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... | #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... | [["-", 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 +... | #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 +... | [["-", 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 >... | #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 >... | [["-", 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;
... | #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;
... | [["+", 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';
... | #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';... | [["-", 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";
el... | #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";
el... | [["-", 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;
i... | #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;
i... | [["-", 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 ... | #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 (... | [["-", 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 = "... | 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 = "... | [["-", 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;
... |
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;
... | [["-", 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,... | 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) {
... | #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) {
fo... | [["-", 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 (... | #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, 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[... | #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 (dat... | [["-", 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 ... | #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++... | [["-", 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;
... | #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;... | [["-", 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_pai... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pai... | [["-", 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]++;
}
r... | #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]++;
}
r... | [["-", 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... | #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... | [["-", 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 <... | #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
... | [["+", 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;
... | #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;
... | [["+", 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 << "*";... | #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 << "... | [["+", 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.