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 <algorithm>
#include <assert.h>
#include <complex>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(... | #include <algorithm>
#include <assert.h>
#include <complex>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47]] | 1 | 1,218 | 2 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define COUNTER_CLOCKWISE 1
#define CLOCKWISE -1
#define ONLINE_BACK 2
#define ONLINE_FRONT -2
#define ON_SEGMENT 0
using namespace std;
class Poin... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define COUNTER_CLOCKWISE 1
#define CLOCKWISE -1
#define ONLINE_BACK 2
#define ONLINE_FRONT -2
#define ON_SEGMENT 0
using namespace std;
class Poin... | [["+", 0, 14, 8, 9, 0, 14, 8, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 57, 15, 339, 0, 25], ["-", 0, 14, 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], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 1,378 | 6 |
#include <algorithm>
#include <stdio.h>
using namespace std;
pair<int, pair<int, int>> c[1100];
pair<int, pair<int, int>> d[1100];
int dp[1100];
int dp2[1100];
int main() {
int a;
while (scanf("%d", &a), a) {
int sx, sy, tx, ty;
scanf("%d%d%d%d", &sx, &sy, &tx, &ty);
int sz = 0;
int sz2 = 0;
for... | #include <algorithm>
#include <stdio.h>
using namespace std;
pair<int, pair<int, int>> c[1100];
pair<int, pair<int, int>> d[1100];
int dp[1100];
int dp2[1100];
int main() {
int a;
while (scanf("%d", &a), a) {
int sx, sy, tx, ty;
scanf("%d%d%d%d", &sx, &sy, &tx, &ty);
int sz = 0;
int sz2 = 0;
for... | [["-", 8, 9, 0, 7, 8, 7, 15, 16, 12, 22], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 12, 22], ["-", 12, 2, 3, 4, 0, 16, 12, 69, 28, 22], ["+", 12, 2, 3, 4, 0, 16, 12, 69, 28, 22]] | 1 | 943 | 4 |
#include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int distsq(int y1, int x1, int y2, int x2) {
return (y1 - y2) * (y1 - y2) + (x1 - x2) * (x1 - x2);
}
bool includes(int y1, int x1, int r1, int y2, int x2, int r2) {
return r1 >= r2 && distsq(y1, x1, y2, x2) <= (r1 - ... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int distsq(int y1, int x1, int y2, int x2) {
return (y1 - y2) * (y1 - y2) + (x1 - x2) * (x1 - x2);
}
bool includes(int y1, int x1, int r1, int y2, int x2, int r2) {
return r1 >= r2 && distsq(y1, x1, y2, x2) < (r1 - r... | [["-", 8, 9, 0, 37, 0, 16, 12, 16, 17, 19], ["+", 8, 9, 0, 37, 0, 16, 12, 16, 17, 18]] | 1 | 651 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX_R 10005
typedef complex<ll> P;
int n;
vector<P> G[MAX_R];
ll sx, sy, tx, ty;
P sp, tp;
int main() {
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < MAX_R; i++)
G[i].clear();
cin >> sx >> sy >> t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX_R 10005
typedef complex<ll> P;
int n;
vector<P> G[MAX_R];
ll sx, sy, tx, ty;
P sp, tp;
int main() {
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < MAX_R; i++)
G[i].clear();
cin >> sx >> sy >> t... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 755 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define SQR(x) ((x) * (x))
int main() {
int N, ax, ay, bx, by, X[1000], Y[1000], R[1000];
while (scanf("%d", &N), N) {
scanf("%d %d %d %d", &ax, &ay, &bx, &by);
for (int i = 0; i < N; i++) {
scanf("%d %d %d", &X[i], &Y[i], &R[i]);
}
vector<int>... | #include <bits/stdc++.h>
using namespace std;
#define SQR(x) ((x) * (x))
int main() {
int N, ax, ay, bx, by, X[1000], Y[1000], R[1000];
while (scanf("%d", &N), N) {
scanf("%d %d %d %d", &ax, &ay, &bx, &by);
for (int i = 0; i < N; i++) {
scanf("%d %d %d", &X[i], &Y[i], &R[i]);
}
vector<int>... | [["-", 51, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 51, 16, 12, 2, 3, 4, 0, 16, 17, 72]] | 1 | 577 | 2 |
#include <algorithm>
#include <cstdio>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
class Point {
public:
int x, y;
Point() {}
Point(int X, int Y) : x(X), y(Y) {}
};
class Circle {
public:
Point c;
int r;
Circle() {}
Circle(const Point &C, int R) : c(C), r(R) ... | #include <algorithm>
#include <cstdio>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
class Point {
public:
int x, y;
Point() {}
Point(int X, int Y) : x(X), y(Y) {}
};
class Circle {
public:
Point c;
int r;
Circle() {}
Circle(const Point &C, int R) : c(C), r(R) ... | [["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 18], ["-", 8, 9, 0, 37, 0, 16, 12, 16, 17, 19], ["+", 8, 9, 0, 37, 0, 16, 12, 16, 17, 18]] | 1 | 874 | 4 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vecto... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vecto... | [["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 47], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 19]] | 1 | 914 | 2 |
#include <stdio.h>
char S[80001], A[80001], B[11];
int char_to_int(char c) { return (int)c - (int)'0'; }
int main() {
int N, i, j, ans;
while (1) {
scanf("%s", S);
for (N = 0; S[N] != '\0'; N++) {
}
if (N == 1 && S[0] == '0') {
return 0;
}
A[N] = 0;
for (i = N - 1; i >= 0; i--) ... | #include <stdio.h>
char S[80001];
int A[80001], B[11];
int char_to_int(char c) { return (int)c - (int)'0'; }
int main() {
int N, i, j, ans;
while (1) {
scanf("%s", S);
for (N = 0; S[N] != '\0'; N++) {
}
if (N == 1 && S[0] == '0') {
return 0;
}
A[N] = 0;
for (i = N - 1; i >= 0; i... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 0, 57, 15, 23, 0, 16, 12, 103, 0, 104]] | 0 | 286 | 5 |
#include <iostream>
#define REP(i, a, n) for (int i = (a); i < (n); i++)
using namespace std;
typedef long long ll;
string S;
int d[80001];
ll dp[80001][2][10];
int main(void) {
while (cin >> S, S != "0") {
REP(i, 0, S.length()) d[i] = S[i] - '0';
REP(i, 0, S.length()) REP(j, 0, 2) REP(k, 0, 10) dp[i][j][k... | #include <iostream>
#define REP(i, a, n) for (int i = (a); i < (n); i++)
using namespace std;
typedef long long ll;
string S;
int d[80001];
ll dp[80001][2][10];
int main(void) {
while (cin >> S, S != "0") {
REP(i, 0, S.length()) d[i] = S[i] - '0';
REP(i, 0, S.length() + 1) REP(j, 0, 2) REP(k, 0, 10) dp[i][... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]] | 1 | 289 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll c[16], x[20000];
ll dp[20001][256];
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (n + m == 0)
break;
for (int i = 0; i < m; i++)
cin >> c[i];
for (int i = 0; i < n; i++)
cin >> x[i]... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll c[16], x[20000];
ll dp[20001][256];
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (n + m == 0)
break;
for (int i = 0; i < m; i++)
cin >> c[i];
for (int i = 0; i < n; i++)
cin >> x[i]... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 332 | 4 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int N, M;
int C[20];
int X[20004];
const long long INF = 1000000000000;
long long dp[20004][130];
long long dfs(int i_, int y_) {
if (i_ == N)
return dp[i_][y_] = 0;
if (dp[i_][y_] != INF)
return dp[i_][y_];
lon... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int N, M;
int C[20];
int X[20004];
const long long INF = 1000000000000;
long long dp[20004][260];
long long dfs(int i_, int y_) {
if (i_ == N)
return dp[i_][y_] = 0;
if (dp[i_][y_] != INF)
return dp[i_][y_];
lon... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 31, 69, 28, 69, 28, 2, 3, 4, 0, 13], ["+", 31, 69, 28, 69, 28, 2, 3, 4, 0, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 354 | 6 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
int main() {
int N, M, C[16], x[20000];
int dp[2][256];
while (scanf("%d %d", &N, &M), N) {
for (int i = 0; i < M; i++) {
scanf("%d", &C[i]);
}
for (int i = 0; i < N; i++) {
scanf("%d", &x[i]);
}
fill_n(dp[1],... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
int main() {
int N, M, C[16], x[20000];
int dp[2][256];
while (scanf("%d %d", &N, &M), N) {
for (int i = 0; i < M; i++) {
scanf("%d", &C[i]);
}
for (int i = 0; i < N; i++) {
scanf("%d", &x[i]);
}
fill_n(*dp, 2... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 48], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 73], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 48]] | 1 | 360 | 6 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
using namespace std;
typedef long long ll;
int dp[200005][300];
int main() {
int n, m;
while (cin >> ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
using namespace std;
typedef long long ll;
int dp[200005][300];
int main() {
int n, m;
while (cin >> ... | [["-", 12, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 22]] | 1 | 328 | 2 |
// Yattazo! Watashiha-Yosen-tsuukashita! It's 460points/600points! OHO!!!!!
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int x[64000][256], n, m, y[64000], z[64000], d, minx;
int main() {
while (true) {
minx = 2000000000;
for (int i = 0; i < 65536; i++) {
for (int j = 0... | // Yattazo! Watashiha-Yosen-tsuukashita! It's 460points/600points! OHO!!!!!
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int x[21000][256], n, m, y[64000], z[64000], d, minx;
int main() {
while (true) {
minx = 2000000000;
for (int i = 0; i < 21000; i++) {
for (int j = 0... | [["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 349 | 4 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define INF 1LL << 50
int main() {
int n, m;
while (cin >> n >> m) {
if (n == 0 && m == 0)
break;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define INF 1LL << 50
int main() {
int n, m;
while (cin >> n >> m) {
if (n == 0 && m == 0)
break;
... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 31, 69, 28, 69, 28, 2, 3, 4, 0, 13], ["+", 31, 69, 28, 69, 28, 2, 3, 4, 0, 13]] | 1 | 324 | 4 |
#include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 765 | 3 |
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
const int INF = 1e+8;
const int MAX_M = 16;
const int MAX_N = 20001;
// dp[i][y] := i 番目までの差分の総和
int dp[MAX_N][256];
int main() {
int N, M;
while (cin >> N >> M, N || M) {
int C[MAX_M] = {0};
for (int i = 0; i < M; i++) {
... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
const int INF = 1e+8;
const int MAX_M = 16;
const int MAX_N = 20001;
// dp[i][y] := i 番目までの差分の総和
int dp[MAX_N][256];
int main() {
int N, M;
while (cin >> N >> M, N || M) {
int C[MAX_M] = {0};
for (int i = 0; i < M; i++) {
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 322 | 2 |
#!/usr/bin/env python
from collections import deque
import itertools as it
import sys
sys.setrecursionlimit(1000000)
while True:
S = input()
if S == '0':
break
m = [0 for i in range(11)]
m[0] = 1
diff = 0
even = 1
S = reversed(S)
ans = 0
for c in S:
num = int(c)
... | #!/usr/bin/env python
from collections import deque
import itertools as it
import sys
sys.setrecursionlimit(1000000)
while True:
S = input()
if S == '0':
break
m = [0 for i in range(11)]
m[0] = 1
diff = 0
even = 1
S = reversed(S)
ans = 0
for c in S:
num = int(c)
... | [["+", 8, 196, 0, 1, 0, 677, 12, 664, 17, 33]] | 5 | 109 | 13 |
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
const long double EPS = 1e-15;
const long double INF = 1e+10;
const long double PI = acos(-1);
int sig(long double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
inline long double ABS(long double a) { return max(a, -... | #include <algorithm>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
const long double EPS = 1e-15;
const long double INF = 1e+10;
const long double PI = acos(-1);
int sig(long double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
inline long double ABS(long double a) { return max(a, -... | [["+", 0, 2, 3, 4, 0, 16, 12, 16, 17, 48], ["+", 0, 2, 3, 4, 0, 16, 12, 16, 12, 13]] | 1 | 1,792 | 4 |
#include <stdio.h>
int main(void) {
int X, Y, W, H, N;
int num;
int cat = 0;
int i, j;
int x[101], y[101];
scanf("%d", &num);
for (i = 0; i < num; i++) {
scanf("%d %d %d %d", &X, &Y, &W, &H);
scanf("%d", &N);
for (j = 0; j < N; j++) {
scanf("%d %d", &x[j], &y[j]);
if ((x[j] >= X &&... | #include <stdio.h>
int main(void) {
int X, Y, W, H, N;
int num;
int cat = 0;
int i, j;
int x[101], y[101];
scanf("%d", &num);
for (i = 0; i < num; i++) {
cat = 0;
scanf("%d %d %d %d", &X, &Y, &W, &H);
scanf("%d", &N);
for (j = 0; j < N; j++) {
scanf("%d %d", &x[j], &y[j]);
if (... | [["+", 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]] | 0 | 186 | 4 |
#include <stdio.h>
int main() {
int x, y, w, h, a, i, j, n, k, l, t;
int catx[101], caty[101], nekokazu[101];
for (t = 0; t < 101; t++) {
nekokazu[t] = 0;
}
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d %d %d %d", &x, &y, &w, &h);
scanf("%d", &n);
for (j = 0; j < n; j++) {
... | #include <stdio.h>
int main() {
int x, y, w, h, a, i, j, n, k, l, t;
int catx[101], caty[101], nekokazu[101];
for (t = 0; t < 101; t++) {
nekokazu[t] = 0;
}
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d %d %d %d", &x, &y, &w, &h);
scanf("%d", &n);
for (j = 0; j < n; j++) {
... | [["-", 15, 23, 0, 16, 31, 16, 12, 16, 17, 47], ["+", 15, 23, 0, 16, 31, 16, 12, 16, 17, 20], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 20]] | 0 | 246 | 4 |
#include <stdio.h>
int main() {
int n, x, y, w, h, N, i, j, cx, cy, count;
scanf("%d", &n);
for (i = 0; i < n; i++) {
count = 0;
scanf("%d %d %d %d", &x, &y, &w, &h);
scanf("%d", &N);
for (j = 0; j < N; j++) {
scanf("%d %d", &cx, &cy);
if (cx >= x && cx <= x + w && cy >= y && cy... | #include <stdio.h>
int main() {
int n, x, y, w, h, N, i, j, cx, cy, count;
scanf("%d", &n);
for (i = 0; i < n; i++) {
count = 0;
scanf("%d %d %d %d", &x, &y, &w, &h);
scanf("%d", &N);
for (j = 0; j < N; j++) {
scanf("%d %d", &cx, &cy);
if (cx >= x && cx <= x + w && cy >= y && cy... | [["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 20], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 19]] | 0 | 155 | 2 |
#include <iostream>
using namespace std;
main() {
int x, y, w, h, n, tx, ty, cnt;
cin >> x;
while (cin >> x >> y >> w >> h >> n) {
for (int i = 0, cnt = 0; i < n; i++) {
cin >> tx >> ty;
if (x <= tx && tx <= x + w && y <= ty && ty <= y + h)
cnt++;
}
cout << cnt << endl;
}
} | #include <iostream>
using namespace std;
main() {
int x, y, w, h, n, tx, ty, cnt, i;
cin >> x;
while (cin >> x >> y >> w >> h >> n) {
for (i = 0, cnt = 0; i < n; i++) {
cin >> tx >> ty;
if (x <= tx && tx <= x + w && y <= ty && ty <= y + h)
cnt++;
}
cout << cnt << endl;
}
} | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 52, 8, 9, 0, 7, 10, 43, 39, 40]] | 1 | 105 | 17 |
#include <cstdio>
int main() {
int T;
scanf("%d", &T);
for (int t = 0; t < T; ++t) {
int X, Y, W, H, N, ans = 0;
scanf("%d %d %d %d %d", &X, &Y, &W, &H, &N);
for (int i = 0; i < N; ++i) {
int x, y;
scanf("%d %d", &x, &y);
if (X - W <= x && x <= X + W && Y - H <= y && y <= Y + H)
... | #include <cstdio>
int main() {
int T;
scanf("%d", &T);
for (int t = 0; t < T; ++t) {
int X, Y, W, H, N, ans = 0;
scanf("%d %d %d %d %d", &X, &Y, &W, &H, &N);
for (int i = 0; i < N; ++i) {
int x, y;
scanf("%d %d", &x, &y);
if (X <= x && x <= X + W && Y <= y && y <= Y + H)
++a... | [["-", 31, 16, 31, 16, 31, 16, 31, 16, 17, 33], ["-", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 51, 16, 31, 16, 12, 16, 31, 16, 17, 33], ["-", 51, 16, 31, 16, 12, 16, 31, 16, 12, 22]] | 1 | 150 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x, y, w, h;
cin >> x >> y >> w >> h;
int cat;
int catcount = 0;
cin >> cat;
for (int j = 0; j < cat; j++) {
int catx, caty;
cin >> catx >> caty;
if (x - w <= catx &... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x, y, w, h;
cin >> x >> y >> w >> h;
int cat;
int catcount = 0;
cin >> cat;
for (int j = 0; j < cat; j++) {
int catx, caty;
cin >> catx >> caty;
if (x <= catx && x ... | [["-", 31, 16, 31, 16, 31, 16, 31, 16, 17, 33], ["-", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 51, 16, 31, 16, 12, 16, 31, 16, 17, 33], ["-", 51, 16, 31, 16, 12, 16, 31, 16, 12, 22]] | 1 | 130 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, nn;
cin >> n;
while (n--) {
int X, Y, W, H, cnt = 0;
cin >> X >> Y >> W >> H;
cin >> nn;
while (nn--) {
int catX, catY;
cin >> catX >> catY;
if (X <= catX && catX... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, nn;
cin >> n;
while (n--) {
int X, Y, W, H, cnt = 0;
cin >> X >> Y >> W >> H;
cin >> nn;
while (nn--) {
int catX, catY;
cin >> catX >> catY;
if (X <= catX && catX... | [["+", 31, 16, 31, 16, 12, 16, 12, 16, 17, 72], ["+", 31, 16, 31, 16, 12, 16, 12, 16, 12, 22], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 72], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 12, 22]] | 1 | 109 | 4 |
#include <stdio.h>
#include <stdlib.h>
int max(int a, int b) { return (a < b ? b : a); }
int main(int argc, char *argv[]) {
int testcase = 0;
scanf("%d", &testcase);
while (testcase--) {
int i, j;
int m, n, o;
scanf("%d%d%d", &m, &n, &o);
int walks[1 + m][1 + n];
int prohibited[1 + m][1 + ... | #include <stdio.h>
#include <stdlib.h>
int max(int a, int b) { return (a < b ? b : a); }
int main(int argc, char *argv[]) {
int testcase = 0;
scanf("%d", &testcase);
while (testcase--) {
int i, j;
int m, n, o;
scanf("%d%d%d", &m, &n, &o);
int walks[1 + m][1 + n];
int prohibited[1 + m][1 + ... | [["-", 15, 23, 0, 16, 12, 91, 28, 69, 71, 13], ["+", 15, 23, 0, 16, 12, 91, 28, 69, 71, 13]] | 0 | 462 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int T[17][17];
bool Vert[17][17];
bool Horiz[17][17];
void initialize(void);
void input_matatabi(void);
void calc_t(void);
int main() {
int n, gx, gy, num_matatabi;
cin >> n;
for (int i = 0; i < 17; i++) {
initialize();
cin >> gx >> gy;
ci... | #include <cmath>
#include <iostream>
using namespace std;
int T[17][17];
bool Vert[17][17];
bool Horiz[17][17];
void initialize(void);
void input_matatabi(void);
void calc_t(void);
int main() {
int n, gx, gy, num_matatabi;
cin >> n;
for (int i = 0; i < n; i++) {
initialize();
cin >> gx >> gy;
cin... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 410 | 29 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
vector<int> c[4];
int h, w, n, p, x[2], y[2], z[17][17];
int main() {
cin >> p;
for (int h = 0; h < p; h++) {
c[0].clear();
c[1].clear();
c[2].clear();
c[3].clear();
memset(z, 0, sizeof(z));
ci... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
vector<int> c[4];
int h, w, n, p, x[2], y[2], z[17][17];
int main() {
cin >> p;
for (int g = 0; g < p; g++) {
c[0].clear();
c[1].clear();
c[2].clear();
c[3].clear();
memset(z, 0, sizeof(z));
ci... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22]] | 1 | 491 | 6 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
typedef pair<int, int> pint;
int fld[20][20];
bool yoko[20][20],
tate[20][20]; // yoko(?????????tate)??????(j, i) ???????§... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
typedef pair<int, int> pint;
int fld[20][20];
bool yoko[20][20],
tate[20][20]; // yoko(?????????tate)??????(j, i) ???????§... | [["-", 8, 9, 0, 57, 64, 1, 0, 2, 63, 22], ["-", 0, 57, 64, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 57, 64, 1, 0, 16, 31, 16, 31, 22], ["+", 0, 57, 64, 1, 0, 16, 31, 16, 17, 151], ["-", 0, 57, 64, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 12, 22]] | 1 | 421 | 7 |
#include <algorithm>
#include <iostream>
using namespace std;
int a[16][16], b[16][16];
int map[16][16];
int gx, gy;
int rec(int x, int y) {
if (map[x][y] != -1)
return map[x][y];
if (x == 0) {
map[x][y] = a[x][y - 1] * rec(x, y - 1);
} else if (y == 0) {
map[x][y] = b[x - 1][y] * rec(x - 1, y);
} ... | #include <algorithm>
#include <iostream>
using namespace std;
int a[16][16], b[16][16];
int map[16][16];
int gx, gy;
int rec(int x, int y) {
if (map[x][y] != -1)
return map[x][y];
if (x == 0) {
map[x][y] = a[x][y - 1] * rec(x, y - 1);
} else if (y == 0) {
map[x][y] = b[x - 1][y] * rec(x - 1, y);
} ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 406 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define gsort(st, en) sort((st), (en), greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " ... | #include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define gsort(st, en) sort((st), (en), greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " ... | [["-", 0, 43, 49, 50, 51, 4, 0, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 31, 22], ["-", 51, 4, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 51, 4, 0, 2, 3, 4, 0, 16, 31, 22]] | 1 | 753 | 4 |
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int t;
cin >> t;
rep(aa, t) {
int x, y, p, dp[17][17] = {};
bool tate[16][16] = {}, yoko[16][16] = {};
cin >> x >> y >> p;
rep(i, p) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (... | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int t;
cin >> t;
rep(aa, t) {
int x, y, p, dp[17][17] = {};
bool tate[16][16] = {}, yoko[16][16] = {};
cin >> x >> y >> p;
rep(i, p) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (... | [["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 73], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 70], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 73], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 70], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 272 | 6 |
import java.util.*;
public class Main {
void solve() {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
String[] name = new String[n];
double[] eff = new double[n];
for (int i = 0; i < n; i++) {
name[i] = sc.next();
... | import java.util.*;
public class Main {
void solve() {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
String[] name = new String[n];
double[] eff = new double[n];
for (int i = 0; i < n; i++) {
name[i] = sc.next();
... | [["-", 49, 200, 51, 16, 12, 16, 31, 23, 0, 24], ["+", 49, 200, 51, 16, 12, 16, 31, 23, 0, 24]] | 3 | 527 | 2 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N;
cin >> N;
while (N) {
vector<pair<double, string>> V(N);
rep(i, 0, N) {
string str;
int p, a, b, c, d, e,... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N;
cin >> N;
while (N) {
vector<pair<double, string>> V(N);
rep(i, 0, N) {
string str;
int p, a, b, c, d, e,... | [["+", 49, 50, 51, 16, 12, 16, 31, 23, 0, 24], ["+", 51, 16, 12, 16, 31, 23, 0, 16, 17, 33], ["+", 51, 16, 12, 16, 31, 23, 0, 16, 12, 13], ["+", 49, 50, 51, 16, 12, 16, 31, 23, 0, 25]] | 1 | 308 | 4 |
#include <bits/stdc++.h>
#define lp(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<pair<double, string>> lis;
lp(i, n) {
string l;
int p, a, b, c, d, e, f, s, m;
cin >> l >> p >> a >> b >> c >> d >... | #include <bits/stdc++.h>
#define lp(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<pair<double, string>> lis;
lp(i, n) {
string l;
int p, a, b, c, d, e, f, s, m;
cin >> l >> p >> a >> b >> c >> d >... | [["+", 0, 11, 12, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 11, 12, 16, 31, 74, 0, 25], ["+", 31, 74, 51, 23, 0, 16, 31, 23, 0, 24]] | 1 | 230 | 3 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [["-", 0, 30, 0, 43, 49, 50, 51, 23, 0, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 23, 0, 13], ["-", 49, 50, 51, 16, 31, 16, 31, 16, 17, 72], ["-", 49, 50, 51, 16, 31, 16, 31, 16, 12, 22], ["-", 0, 43, 49, 50, 51, 16, 31, 16, 17, 72], ["-", 0, 43, 49, 50, 51, 16, 31, 16, 12, 22]] | 1 | 427 | 6 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < int(b); i++)
#define rep(i, b) loop(i, 0, b)
int main() {
int n;
while (cin >> n && n) {
typedef pair<double, string> data;
vector<data> v(n);
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < int(b); i++)
#define rep(i, b) loop(i, 0, b)
int main() {
int n;
while (cin >> n && n) {
typedef pair<double, string> data;
vector<data> v(n);
... | [["-", 49, 50, 51, 16, 12, 16, 31, 23, 0, 24], ["+", 49, 50, 51, 16, 12, 16, 31, 23, 0, 24]] | 1 | 255 | 2 |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2198
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n)... |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2198
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n)... | [["-", 0, 30, 0, 122, 8, 123, 0, 124, 39, 40], ["+", 0, 30, 0, 122, 8, 123, 0, 124, 39, 40], ["-", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 277 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int N;
cin >> N;
if (N == 0)
break;
vector<pair<double, string>> items;
for (int i = 0; i < N; i++) {
string name;
cin >> name;
int p, a, b, c, d, e, f, s, m;
cin >> p >> a >> b >> c >> d >> e >... | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int N;
cin >> N;
if (N == 0)
break;
vector<pair<double, string>> items;
for (int i = 0; i < N; i++) {
string name;
cin >> name;
int p, a, b, c, d, e, f, s, m;
cin >> p >> a >> b >> c >> d >> e >... | [["-", 0, 43, 49, 50, 51, 16, 31, 16, 17, 72], ["-", 0, 43, 49, 50, 51, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22]] | 1 | 236 | 4 |
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.... | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.... | [["+", 3, 4, 0, 16, 31, 23, 0, 16, 17, 33], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 12, 22], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 22]] | 1 | 493 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF 1145141919
#define MOD 1000000007
#define ALL(a) begin((a)), end((a))
#define ms(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typed... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF 1145141919
#define MOD 1000000007
#define ALL(a) begin((a)), end((a))
#define ms(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef vector<int> vi;
typed... | [["+", 0, 1, 0, 11, 12, 16, 31, 2, 63, 40], ["+", 0, 11, 12, 16, 31, 2, 3, 4, 0, 24], ["+", 0, 11, 12, 16, 31, 2, 3, 4, 0, 25]] | 1 | 373 | 3 |
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define P pair<long double, string>
int main() {
int n;
while (true) {
cin >> n;
if (n == 0)
break;
vector<P> ans(0);
for (int iii = 0; iii < n; iii++) {
int p, a, b, c, d, e... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define P pair<long double, string>
int main() {
int n;
while (true) {
cin >> n;
if (n == 0)
break;
vector<P> ans(0);
for (int iii = 0; iii < n; iii++) {
long double p, a, b,... | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 39, 40]] | 1 | 337 | 3 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
vector<string> name(n);
vector<int> price(n);
vector<int> sold(n);
vector<int> times(n);
vector<int> m(n);
vector<int> count(n);
for (int i = 0; i ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
vector<string> name(n);
vector<int> price(n);
vector<int> sold(n);
vector<int> times(n);
vector<int> m(n);
vector<int> count(n);
for (int i = 0; i ... | [["-", 0, 11, 12, 16, 12, 16, 31, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 16, 31, 23, 0, 24]] | 1 | 308 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for (int i = s; i < (int)n; i++)
#define per(i, n) for (int i = n; i >= 0; i--)
#define ROF(i, s, n) for (int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(), (a).end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for (int i = s; i < (int)n; i++)
#define per(i, n) for (int i = n; i >= 0; i--)
#define ROF(i, s, n) for (int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(), (a).end()
#defin... | [["-", 0, 77, 39, 344, 3, 347, 0, 77, 39, 78], ["+", 0, 77, 39, 344, 3, 347, 0, 77, 39, 40]] | 1 | 637 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
int di[4] = {1, 0, -1, 0};
int dj[4] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
int di[4] = {1, 0, -1, 0};
int dj[4] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = ... | [["-", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 253 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int dx[] = {0, 0, -1, 1};
const int dy... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int dx[] = {0, 0, -1, 1};
const int dy... | [["+", 12, 74, 51, 23, 0, 16, 31, 16, 12, 22], ["+", 0, 16, 12, 74, 51, 23, 0, 16, 17, 72], ["-", 12, 16, 12, 23, 0, 16, 31, 16, 31, 22], ["-", 12, 16, 12, 23, 0, 16, 31, 16, 17, 72]] | 1 | 267 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
for (int N; cin >> N && N;) {
vector<pair<double, string>> v;
for (int i = 0; i < N; ++i) {
string name;
int p, a, b, c, d, e, f, s, m;
cin >> name >> p >> a >> b >> c >> d >> e >> f >> s >> m;
int t = a + b + c + (d + e) * m;... | #include <bits/stdc++.h>
using namespace std;
int main() {
for (int N; cin >> N && N;) {
vector<pair<double, string>> v;
for (int i = 0; i < N; ++i) {
string name;
int p, a, b, c, d, e, f, s, m;
cin >> name >> p >> a >> b >> c >> d >> e >> f >> s >> m;
int t = a + b + c + (d + e) * m;... | [["+", 0, 16, 31, 91, 28, 74, 51, 23, 0, 24], ["+", 31, 91, 28, 74, 51, 23, 0, 16, 17, 33], ["+", 31, 91, 28, 74, 51, 23, 0, 16, 12, 22], ["+", 0, 16, 31, 91, 28, 74, 51, 23, 0, 25]] | 1 | 201 | 4 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
struct R {
string L;
int P, A, B, C, D, E, F, S, M;
int SUM;
int SY;
double W;
};
int main() {
int N;
while (1) {
cin >> N;
if (N == 0)
break;
struct R R1[51] = {};
for (int i = 0; ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
struct R {
string L;
int P, A, B, C, D, E, F, S, M;
int SUM;
int SY;
double W;
};
int main() {
int N;
while (1) {
cin >> N;
if (N == 0)
break;
struct R R1[51] = {};
for (int i = 0; ... | [["+", 0, 1, 0, 11, 12, 16, 31, 74, 0, 24], ["+", 0, 11, 12, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 11, 12, 16, 31, 74, 0, 25]] | 1 | 492 | 3 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
#define pb push_back
using namespace std;
typedef pair<double, string> P;
bool solve() {
int n;
cin >> n;
if (n... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
#define pb push_back
using namespace std;
typedef pair<double, string> P;
bool solve() {
int n;
cin >> n;
if (n... | [["-", 51, 16, 12, 16, 31, 23, 0, 16, 17, 48], ["+", 51, 16, 12, 16, 31, 23, 0, 16, 17, 72]] | 1 | 232 | 2 |
#include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
struct crop {
string name;
int income;
int times;
long double effic;
bool operator<(const crop &right) const {
ret... | #include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
struct crop {
string name;
int income;
int times;
double effic;
bool operator<(const crop &right) const {
return e... | [["-", 0, 122, 8, 123, 0, 124, 39, 86, 0, 96], ["-", 0, 11, 12, 16, 12, 16, 31, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 16, 31, 23, 0, 24]] | 1 | 292 | 3 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
int main() {
int n;
while (cin >> n, n) {
vector<string> nam... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
int main() {
int n;
while (cin >> n, n) {
vector<string> nam... | [["-", 0, 11, 12, 16, 12, 16, 31, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 16, 31, 23, 0, 24]] | 1 | 328 | 2 |
#include <bits/stdc++.h>
using namespace std;
int N;
const double EPS = 1e-10;
struct state {
string name;
double k;
state() {}
state(int P, int A, int B, int C, int D, int E, int F, int S, int M) {
int time = (A + B + C + D + E) * M;
int num = M * F;
int mon = num * S;
int s = mon - P;
k ... | #include <bits/stdc++.h>
using namespace std;
int N;
const double EPS = 1e-10;
struct state {
string name;
double k;
state() {}
state(int P, int A, int B, int C, int D, int E, int F, int S, int M) {
int time = A + B + C + (D + E) * M;
int num = M * F;
int mon = num * S;
int s = mon - P;
k ... | [["-", 0, 43, 49, 50, 51, 16, 31, 23, 0, 24], ["+", 49, 50, 51, 16, 12, 16, 31, 23, 0, 24]] | 1 | 307 | 2 |
#include "bits/stdc++.h"
#pragma warning(disable : 4996)
using namespace std;
int main() {
while (1) {
int N;
cin >> N;
if (!N)
break;
vector<pair<string, long double>> pls;
for (int i = 0; i < N; ++i) {
string st;
int p, a, b, c, d, e, f, s, m;
cin >> st >> p >> a >> b >>... | #include "bits/stdc++.h"
#pragma warning(disable : 4996)
using namespace std;
int main() {
while (1) {
int N;
cin >> N;
if (!N)
break;
vector<pair<string, long double>> pls;
for (int i = 0; i < N; ++i) {
string st;
int p, a, b, c, d, e, f, s, m;
cin >> st >> p >> a >> b >>... | [["-", 0, 16, 12, 16, 12, 23, 0, 16, 17, 33], ["-", 0, 16, 12, 16, 12, 23, 0, 16, 12, 13], ["-", 8, 9, 0, 37, 0, 41, 15, 16, 12, 13], ["+", 8, 9, 0, 37, 0, 41, 15, 16, 12, 13]] | 1 | 292 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<pair<double, string>> x;
int n;
double P, A, B, C, D, E, F, S, M;
string L;
int main() {
while (true) {
x.clear();
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
c... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<pair<double, string>> x;
int n;
double P, A, B, C, D, E, F, S, M;
string L;
int main() {
while (true) {
x.clear();
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
c... | [["-", 12, 23, 0, 16, 12, 16, 31, 23, 0, 24], ["+", 12, 23, 0, 16, 12, 16, 31, 23, 0, 24]] | 1 | 208 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define vec vector
int main(void) {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vec<string> l(n);
vec<int> buy(n), p(n), q... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define vec vector
int main(void) {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vec<string> l(n);
vec<int> buy(n), p(n), q... | [["-", 8, 9, 0, 1, 0, 16, 12, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 16, 12, 69, 28, 22]] | 1 | 299 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int N, P, A, B, C, D, E, F, S, M;
pair<long double, string> G[50];
int main() {
while (true) {
scanf("%d", &N);
if (N == 0)
break;
for (int i = 0; i < N; i++) {
cin >> G[i].second >> P >> A >> B >> C >> D >> E >> F... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int N, P, A, B, C, D, E, F, S, M;
pair<long double, string> G[50];
int main() {
while (true) {
scanf("%d", &N);
if (N == 0)
break;
for (int i = 0; i < N; i++) {
cin >> G[i].second;
cin >> P >> A >> B >> C >> ... | [["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 31, 22], ["+", 0, 11, 12, 16, 31, 16, 12, 23, 0, 24], ["+", 0, 11, 12, 16, 31, 16, 12, 23, 0, 25]] | 1 | 204 | 4 |
#include <algorithm>
#include <iostream>
#define N 51
using namespace std;
int main() {
while (1) {
string str[N];
int p, a, b, c, d, e, f, s, m, n, ans[N];
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> str[i] >> p >> a >> b >> c >> d >> e >> f >> s >> m;
ans... | #include <algorithm>
#include <iostream>
#define N 51
using namespace std;
int main() {
while (1) {
string str[N];
int p, a, b, c, d, e, f, s, m, n;
double ans[N];
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> str[i] >> p >> a >> b >> c >> d >> e >> f >> s >> m... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 21], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 31, 23, 0, 16, 31, 74, 39, 77, 39, 40], ["+", 12, 16, 31, 23, 0, 16, 31, 74, 0, 25], ["+", 31, 23, 0, 16, 31, 74, 51, 23, 0, 24], ["+", 8, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 300 | 7 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#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 ll long long
#define ull unsigned long long
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#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 ll long long
#define ull unsigned long long
... | [["-", 0, 77, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 77, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 11, 12, 16, 12, 16, 31, 74, 0, 24], ["+", 12, 16, 12, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 11, 12, 16, 12, 16, 31, 74, 0, 25]] | 1 | 269 | 5 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef... | [["+", 0, 43, 49, 50, 51, 16, 12, 23, 0, 24], ["+", 0, 16, 12, 23, 0, 16, 12, 23, 0, 25]] | 1 | 428 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
// define
#define ALL(a) a.begin(), a.end()
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) fo... | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
// define
#define ALL(a) a.begin(), a.end()
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) fo... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 33], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22]] | 1 | 331 | 2 |
#define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std... | #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std... | [["-", 0, 57, 64, 37, 0, 16, 31, 118, 119, 120], ["+", 0, 57, 64, 37, 0, 16, 31, 118, 119, 120], ["-", 0, 57, 64, 37, 0, 16, 12, 118, 119, 120], ["+", 0, 57, 64, 37, 0, 16, 12, 118, 119, 120], ["-", 12, 16, 12, 16, 12, 23, 0, 16, 17, 72], ["-", 12, 16, 12, 16, 12, 23, 0, 16, 12, 22]] | 1 | 429 | 6 |
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string l;
int n;
double a, b, c, d, e, f, s, m, p;
vector<pair<double, string>> vp;
pair<double, string> pa;
while (1) {
cin >> n;
if (n == 0)
break;
vp.clear(... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string l;
int n;
double a, b, c, d, e, f, s, m, p;
vector<pair<double, string>> vp;
pair<double, string> pa;
while (1) {
cin >> n;
if (n == 0)
break;
vp.clear(... | [["-", 0, 11, 12, 16, 31, 16, 31, 16, 12, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 17, 72], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72]] | 1 | 234 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | [["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 72], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["+", 0, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 564 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#define ERROR 1e-10
using namespace std;
void dict(string s[], double a[], int n) {
for (int i = 0; i < n - 1; i++) {
if (-ERROR < a[i] - a[i + 1] && a[i] - a[i + 1] < ERROR) {
int t;
for (int j = i; j < n - 1; j++) {
if (!(-ERROR < a... | #include <algorithm>
#include <iostream>
#include <string>
#define ERROR 1e-10
using namespace std;
void dict(string s[], double a[], int n) {
for (int i = 0; i < n - 1; i++) {
if (-ERROR < a[i] - a[i + 1] && a[i] - a[i + 1] < ERROR) {
int t;
for (int j = i; j < n - 1; j++) {
if (!(-ERROR < a... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 636 | 6 |
//#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, x, n) for (int i = x; i < (int)n; ++i)
#define rep... | //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, x, n) for (int i = x; i < (int)n; ++i)
#define rep... | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 17, 72]] | 1 | 770 | 6 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define ... | [["-", 12, 16, 12, 23, 0, 16, 31, 16, 31, 22], ["-", 12, 16, 12, 23, 0, 16, 31, 16, 17, 72]] | 1 | 580 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
struct Product {
Product(string name, double effi) : name_(name), efficiency_(effi) {}
string name_;
double efficiency_;
};
int main(int argc, ch... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
struct Product {
Product(string name, double effi) : name_(name), efficiency_(effi) {}
string name_;
double efficiency_;
};
int main(int argc, ch... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40]] | 1 | 292 | 6 |
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
vector<pair<double, string>> v(n);
for (int i = 0; i < n; i++) {
string l;
int p, a, b, c, d, e, ... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
vector<pair<double, string>> v(n);
for (int i = 0; i < n; i++) {
string l;
int p, a, b, c, d, e, ... | [["+", 12, 16, 31, 91, 28, 74, 39, 77, 39, 40], ["+", 0, 11, 12, 16, 31, 91, 28, 74, 0, 25], ["+", 12, 16, 31, 91, 28, 74, 51, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 12, 74, 0, 24], ["+", 0, 11, 12, 16, 12, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 11, 12, 16, 12, 74, 0, 25]] | 1 | 211 | 6 |
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
vector<pair<double, string>> moonlight;
string l;
int p, a, b, c, d, e, f, s, m;
for (int i = 0; i < n; i++... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
vector<pair<double, string>> moonlight;
string l;
int p, a, b, c, d, e, f, s, m;
for (int i = 0; i < n; i++... | [["-", 51, 16, 12, 16, 31, 23, 0, 16, 17, 72], ["-", 51, 16, 12, 16, 31, 23, 0, 16, 12, 22]] | 1 | 214 | 2 |
#include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define ... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define ... | [["-", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 670 | 4 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
typedef struct Pr {
string name;
double eff;
bool eq(const Pr &r) { return fabs(eff - r.eff) < 0.0000001; }
bool operator<(const Pr &r) {
return (eq(r) ? (name < r.name) : (eff > r.eff));
}
} Pr;
int N, P, ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
typedef struct Pr {
string name;
double eff;
bool eq(const Pr &r) { return fabs(eff - r.eff) < 0.0000001; }
bool operator<(const Pr &r) {
return (eq(r) ? (name < r.name) : (eff > r.eff));
}
} Pr;
int N, P, ... | [["+", 0, 1, 0, 11, 12, 16, 31, 16, 31, 13], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 48]] | 1 | 257 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
pair<double, string> temp;
vector<pair<double, string>> list(n, temp);
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
pair<double, string> temp;
vector<pair<double, string>> list(n, temp);
for (int i = 0; i < n; i++) {
... | [["-", 49, 50, 51, 16, 12, 16, 31, 16, 17, 48], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72]] | 1 | 220 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
vector<pair<float, string>> v;
for (int i = 0; i < n; i++) {
string l;
int p, a, b, c, d, e, f, s, m;
cin >> l >> p >> a >> b >> c >> d >> e >> f >> s >> m;
v.push_back(make_pair(-float(s * m - p... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
vector<pair<double, string>> v;
for (int i = 0; i < n; i++) {
string l;
int p, a, b, c, d, e, f, s, m;
cin >> l >> p >> a >> b >> c >> d >> e >> f >> s >> m;
v.push_back(
make_pair(-dou... | [["-", 0, 77, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 77, 39, 344, 3, 347, 0, 77, 39, 40], ["-", 3, 4, 0, 16, 31, 91, 28, 2, 63, 40], ["+", 3, 4, 0, 16, 31, 91, 28, 2, 63, 40], ["+", 3, 4, 0, 16, 31, 16, 31, 16, 31, 22], ["+", 3, 4, 0, 16, 31, 16, 31, 16, 17, 48]] | 1 | 186 | 6 |
#include <bits/stdc++.h>
using namespace std;
struct Crop {
string str;
double efficiency;
};
int foo(string A, string B) {
int sizeA = (int)A.size(), sizeB = (int)B.size(), size;
size = min(sizeA, sizeB);
for (int i = 0; i < size; i++) {
if (A[i] != B[i]) {
if (A[i] > B[i]) { // cout<<A[i]<<">"<<... | #include <bits/stdc++.h>
using namespace std;
struct Crop {
string str;
double efficiency;
};
int foo(string A, string B) {
int sizeA = (int)A.size(), sizeB = (int)B.size(), size;
size = min(sizeA, sizeB);
for (int i = 0; i < size; i++) {
if (A[i] != B[i]) {
if (A[i] > B[i]) { // cout<<A[i]<<">"<<... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 473 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)... | [["-", 49, 50, 51, 16, 31, 16, 31, 69, 28, 22], ["-", 51, 16, 31, 16, 31, 69, 341, 342, 0, 70], ["-", 51, 16, 31, 16, 31, 69, 341, 342, 0, 22], ["-", 51, 16, 31, 16, 31, 69, 341, 342, 0, 73], ["-", 0, 43, 49, 50, 51, 16, 31, 16, 17, 72]] | 1 | 448 | 5 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<double, string> P;
int main() {
int n;
while (cin >> n, n) {
P pr[55];
for (int i = 0; i < n; i++) {
string l;
cin >> l;
int p, a, b, c, d, e, f, s, m;
cin >> p >> a >> b >> c >> d >> e >> f >> s >> m;
double sumi = s *... | #include <bits/stdc++.h>
using namespace std;
typedef pair<double, string> P;
int main() {
int n;
while (cin >> n, n) {
P pr[55];
for (int i = 0; i < n; i++) {
string l;
cin >> l;
int p, a, b, c, d, e, f, s, m;
cin >> p >> a >> b >> c >> d >> e >> f >> s >> m;
double sumi = f *... | [["+", 49, 50, 51, 16, 31, 16, 31, 16, 31, 22], ["+", 49, 50, 51, 16, 31, 16, 31, 16, 17, 48], ["-", 51, 16, 12, 16, 31, 23, 0, 16, 17, 72], ["-", 51, 16, 12, 16, 31, 23, 0, 16, 12, 22]] | 1 | 192 | 4 |
//=================================
// Created on: 2018/07/03 04:20:37
//=================================
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
int main() {
using P = pair<ld, string>;
for (int N;;) {
cin >> N;
if (N == 0) {
break;
}
vector<P> p(N);
for (in... | //=================================
// Created on: 2018/07/03 04:20:37
//=================================
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
int main() {
using P = pair<ld, string>;
for (int N;;) {
cin >> N;
if (N == 0) {
break;
}
vector<P> p(N);
for (in... | [["+", 0, 43, 49, 50, 51, 16, 31, 23, 0, 25], ["+", 49, 50, 51, 16, 12, 16, 31, 23, 0, 24]] | 1 | 265 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct Crop {
string l;
double rate;
Crop() {}
Crop(string _l, int p, int a, int b, int c, int d, int e, int f, int s,
int m) {
l = _l;
int time = a + b + c + (d + e) * m;
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct Crop {
string l;
double rate;
Crop() {}
Crop(string _l, int p, int a, int b, int c, int d, int e, int f, int s,
int m) {
l = _l;
int time = a + b + c + (d + e) * m;
int... | [["+", 0, 43, 49, 50, 51, 16, 12, 23, 0, 24], ["+", 0, 43, 49, 50, 51, 16, 12, 23, 0, 25], ["+", 0, 1, 0, 11, 12, 16, 31, 74, 0, 24], ["+", 0, 11, 12, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 11, 12, 16, 31, 74, 0, 25]] | 1 | 319 | 5 |
#include <algorithm>
#include <cstdio>
#include <map>
#include <string>
using namespace std;
int main() {
int n, i, p, a, b, c, d, e, f, m, s;
char l[32];
pair<double, string> A[50];
while (scanf("%d", &n), n) {
for (i = 0; i < n; ++i) {
scanf("%s%d%d%d%d%d%d%d%d%d", l, &p, &a, &b, &c, &d, &e, &f, &s,... | #include <algorithm>
#include <cstdio>
#include <map>
#include <string>
using namespace std;
int main() {
int n, i, p, a, b, c, d, e, f, m, s;
char l[32];
pair<double, string> A[50];
while (scanf("%d", &n), n) {
for (i = 0; i < n; ++i) {
scanf("%s%d%d%d%d%d%d%d%d%d", l, &p, &a, &b, &c, &d, &e, &f, &s,... | [["+", 0, 1, 0, 11, 12, 16, 12, 2, 63, 40]] | 1 | 214 | 1 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
class st {
public:
string a;
int u, d;
bool operator<(const st &b) const {
if (u * b.d != b.u * d)
return u * b.d > b.u * d;
return a < b.a... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
class st {
public:
string a;
int u, d;
bool operator<(const st &b) const {
if (u * b.d != b.u * d)
return u * b.d > b.u * d;
return a < b.a... | [["-", 0, 11, 12, 16, 12, 16, 31, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 16, 31, 23, 0, 24]] | 1 | 240 | 2 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <set>
#include <utility>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define EPS (1e-8)
struct State {
double param;
string name;
State(double p, string n) : param(p)... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <set>
#include <utility>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define EPS (1e-8)
struct State {
double param;
string name;
State(double p, string n) : param(p)... | [["-", 49, 50, 51, 16, 12, 16, 31, 23, 0, 24], ["+", 49, 50, 51, 16, 12, 16, 31, 23, 0, 24]] | 1 | 314 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
int p, a, b, c, d, e, f, s, m;
string l;
vector<pair<double, string>> vpii;
for (int i = 0; i < n; i++) {
cin >> l >> p >> a >> b >> c >> d >> e >>... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
int p, a, b, c, d, e, f, s, m;
string l;
vector<pair<double, string>> vpii;
for (int i = 0; i < n; i++) {
cin >> l >> p >> a >> b >> c >> d >> e >>... | [["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 91, 17, 33], ["+", 8, 9, 0, 43, 49, 50, 51, 91, 28, 22], ["-", 0, 7, 8, 1, 0, 11, 12, 16, 17, 33], ["-", 0, 7, 8, 1, 0, 11, 12, 16, 12, 22]] | 1 | 244 | 5 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (i... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (i... | [["-", 0, 16, 12, 16, 12, 23, 0, 16, 17, 72], ["-", 0, 16, 12, 16, 12, 23, 0, 16, 12, 22]] | 1 | 305 | 2 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n;
string name;
int price;
int a;
int b;
int c;
int d;
int e;
int seedCount;
int seedPrice;
int Time;
struct G {
string name;
double value;
};
bool operator>(const G &left, const G &right) {... | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n;
string name;
int price;
int a;
int b;
int c;
int d;
int e;
int seedCount;
int seedPrice;
int Time;
struct G {
string name;
double value;
};
bool operator>(const G &left, const G &right) {... | [["+", 0, 16, 12, 23, 0, 16, 31, 23, 0, 25], ["+", 12, 23, 0, 16, 12, 16, 31, 23, 0, 24], ["+", 0, 16, 12, 23, 0, 16, 12, 16, 17, 48], ["+", 0, 16, 12, 23, 0, 16, 12, 16, 12, 22]] | 1 | 368 | 4 |
// 07
#include <algorithm>
#include <iostream>
using namespace std;
struct S {
string s;
double e;
bool operator<(S a) const {
if (e != a.e) {
return e > a.e;
} else {
return s < a.s;
}
}
};
int main() {
for (int n; cin >> n, n;) {
S a[50];
for (int i = 0; i < n; i++) {
... | // 07
#include <algorithm>
#include <iostream>
using namespace std;
struct S {
string s;
double e;
bool operator<(S a) const {
if (e != a.e) {
return e > a.e;
} else {
return s < a.s;
}
}
};
int main() {
for (int n; cin >> n, n;) {
S a[50];
for (int i = 0; i < n; i++) {
... | [["-", 12, 23, 0, 16, 12, 16, 31, 16, 12, 22], ["-", 12, 16, 12, 23, 0, 16, 12, 16, 17, 48]] | 1 | 229 | 2 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | [["-", 0, 43, 49, 50, 51, 16, 31, 23, 0, 24], ["+", 49, 50, 51, 16, 12, 16, 31, 23, 0, 24]] | 1 | 339 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef pair<double, string> P;
int main(void) {
int n;
while (cin >> n, n) {
vector<P> v;
for (int i = 0; i < n; ++i) {
string l;
int p, a, b, c, d, e, f, s, m;
cin >> l >> p >> a >> b >... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef pair<double, string> P;
int main(void) {
int n;
while (cin >> n, n) {
vector<P> v;
for (int i = 0; i < n; ++i) {
string l;
int p, a, b, c, d, e, f, s, m;
cin >> l >> p >> a >> b >... | [["-", 49, 50, 51, 16, 12, 16, 31, 16, 12, 22], ["-", 0, 43, 49, 50, 51, 16, 12, 16, 17, 48]] | 1 | 216 | 2 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <st... | [["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 48], ["+", 0, 11, 12, 16, 31, 16, 12, 69, 28, 22], ["+", 12, 16, 31, 16, 12, 69, 341, 342, 0, 70], ["+", 12, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 12, 16, 31, 16, 12, 69, 341, 342, 0, 73]] | 1 | 606 | 5 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MP make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> P;
struct item {
double eff;
string name;
boo... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MP make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> P;
struct item {
double eff;
string name;
boo... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22], ["-", 0, 43, 49, 50, 51, 16, 31, 16, 31, 22], ["-", 0, 43, 49, 50, 51, 16, 31, 16, 17, 72]] | 1 | 286 | 4 |
#include "algorithm"
#include "cmath"
#include "iostream"
#include "string"
#define eps 10e-9
using namespace std;
typedef struct crop {
string name;
double eff;
static bool comp(const crop &l, const crop &r) {
if (abs(l.eff - r.eff) > eps)
return l.eff > r.eff;
return l.name < r.name;
}
} crop;
... | #include "algorithm"
#include "cmath"
#include "iostream"
#include "string"
#define eps 10e-9
using namespace std;
typedef struct crop {
string name;
double eff;
static bool comp(const crop &l, const crop &r) {
if (abs(l.eff - r.eff) > eps)
return l.eff > r.eff;
return l.name < r.name;
}
} crop;
... | [["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 48], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 12, 13]] | 1 | 262 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct seed {
string name;
double ic;
};
bool cmp(const seed &a, const seed &b) {
return a.ic == b.ic ? a.name < b.name : a.ic > b.ic;
}
int main() {
int n;
while (cin >> n && n) {
vector<seed> data(n);
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct seed {
string name;
double ic;
};
bool cmp(const seed &a, const seed &b) {
return a.ic == b.ic ? a.name < b.name : a.ic > b.ic;
}
int main() {
int n;
while (cin >> n && n) {
vector<seed> data(n);
... | [["+", 0, 11, 12, 16, 31, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 11, 12, 16, 31, 74, 0, 25], ["+", 0, 11, 12, 16, 31, 74, 51, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 12, 74, 0, 24], ["+", 0, 11, 12, 16, 12, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 11, 12, 16, 12, 74, 0, 25]] | 1 | 245 | 6 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40]] | 1 | 342 | 2 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct node {
string name;
double prime;
node(string s, double d) : name(s), prime(d) {}
bool operator>(const node &e) const {
if (prime == e.prime)
return name > e.name;
return prime < e.prime;
}
};
int main() {
int... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct node {
string name;
double prime;
node(string s, double d) : name(s), prime(d) {}
bool operator>(const node &e) const {
if (prime == e.prime)
return name > e.name;
return prime < e.prime;
}
};
int main() {
int... | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40]] | 1 | 262 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
struct sPlant {
string name;
int sale;
};
bool Greater(const sPlant &lPlant, const sPlant &rPlant) {
if (lPlant.sale != rPlant.sale)
return lPlant.sale > rPlant.sale;
return lPlant.name < rPlant.name;
}
int main() {
int n;
while (cin >> n... | #include <algorithm>
#include <iostream>
using namespace std;
struct sPlant {
string name;
double sale;
};
bool Greater(const sPlant &lPlant, const sPlant &rPlant) {
if (lPlant.sale != rPlant.sale)
return lPlant.sale > rPlant.sale;
return lPlant.name < rPlant.name;
}
int main() {
int n;
while (cin >... | [["-", 0, 30, 0, 122, 8, 123, 0, 124, 39, 40], ["+", 0, 30, 0, 122, 8, 123, 0, 124, 39, 40]] | 1 | 250 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<pair<double, string>> ans(n);
for (int i = 0; i < n; i++) {
string name;
cin >> name;
int p, a, b, c, d, e, f, s, m;
cin... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<pair<double, string>> ans(n);
for (int i = 0; i < n; i++) {
string name;
cin >> name;
int p, a, b, c, d, e, f, s, m;
cin... | [["-", 49, 50, 51, 16, 12, 16, 31, 23, 0, 24], ["+", 49, 50, 51, 16, 12, 16, 31, 23, 0, 24]] | 1 | 225 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n, p, a, b, c, d, e, f, s, m;
string l;
while (true) {
cin >> n;
if (n == 0)
break;
vector<pair<long long int, string>> list;
for (long long int i = 0; i < n; ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n, p, a, b, c, d, e, f, s, m;
string l;
while (true) {
cin >> n;
if (n == 0)
break;
vector<pair<double, string>> list;
for (long long int i = 0; i < n; i++) {
... | [["-", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["-", 39, 344, 3, 347, 0, 77, 39, 86, 39, 40], ["+", 0, 77, 39, 344, 3, 347, 0, 77, 39, 40]] | 1 | 213 | 4 |
#! /usr/bin/python
# -*- coding: utf-8 -*-
#LPABCDEFSM
#0123456789
while True:
N = int(input())
if N==0: break
crop = [input().split() for i in range(N)]
for i in range(N): crop[i][1:] = list(map(int, crop[i][1:]))
ef = []
for i in range(N):
com = (crop[i][-3]*crop[i][-1])*crop[i][-2]-... | #! /usr/bin/python
# -*- coding: utf-8 -*-
#LPABCDEFSM
#0123456789
while True:
N = int(input())
if N==0: break
crop = [input().split() for i in range(N)]
for i in range(N): crop[i][1:] = list(map(int, crop[i][1:]))
ef = []
for i in range(N):
com = (crop[i][-3]*crop[i][-1])*crop[i][-2]-... | [["-", 12, 652, 3, 4, 0, 206, 206, 663, 0, 612], ["+", 12, 652, 3, 4, 0, 206, 206, 663, 0, 612]] | 5 | 218 | 2 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF... | [["-", 0, 662, 12, 657, 12, 657, 12, 23, 0, 24], ["-", 12, 657, 12, 657, 12, 23, 0, 657, 17, 33], ["-", 12, 657, 12, 657, 12, 23, 0, 657, 12, 612], ["-", 0, 662, 12, 657, 12, 657, 12, 23, 0, 25]] | 5 | 373 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.