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 <iostream>
using namespace std;
int main() {
const int MAX = 1e5;
for (int n, m; cin >> n >> m, n;) {
int cost[m][m];
int time[m][m];
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
cost[i][j] = MAX;
time[i][j] = MAX;
}
}
int a, b, c, t;
for (... | #include <iostream>
using namespace std;
int main() {
const int MAX = 1e5;
for (int n, m; cin >> n >> m, n;) {
int cost[m][m];
int time[m][m];
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
cost[i][j] = MAX;
time[i][j] = MAX;
}
}
int a, b, c, t;
for (... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 418 | 4 |
#include <iostream>
using namespace std;
int t[303][303];
int c[303][303];
int main() {
for (int N, M; cin >> M >> N, (N || M);) {
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) {
t[i][j] = 987654321;
c[i][j] = 987654321;
}
for (int i = 0; i < N; i++)
t[i][i] = c... | #include <iostream>
using namespace std;
int t[303][303];
int c[303][303];
int main() {
for (int N, M; cin >> M >> N, (N || M);) {
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) {
t[i][j] = 987654321;
c[i][j] = 987654321;
}
for (int i = 0; i < N; i++)
t[i][i] = c... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 397 | 2 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() ... | [["-", 12, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 12, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 11, 12, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 11, 31, 69, 341, 342, 0, 22]] | 1 | 439 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, time, cost, querys;
int i, j, k, p, q, r, n, m;
int times[101][101], costs[101][101];
while (true) {
cin >> n >> m;
if (!n && !m)
break;
for (i = 0; i < m; i++) {
for (j = 0; j < m;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, time, cost, querys;
int i, j, k, p, q, r, n, m;
int times[100][100], costs[100][100];
while (true) {
cin >> n >> m;
if (!n && !m)
break;
for (i = 0; i < m; i++) {
for (j = 0; j < m;... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 1, 0, 11, 31, 69, 28, 69, 28, 22], ["+", 0, 1, 0, 11, 31, 69, 28, 69, 28, 22]] | 1 | 407 | 10 |
#include <iostream>
#define N 101
#define INF 1e+9
using namespace std;
int main(void) {
int n, m;
while (cin >> n >> m, n || m) {
int cost[N][N], times[N][N];
for (int i = 1; i <= m; ++i)
for (int j = 1; j <= m; ++j) {
cost[i][j] = times[i][j] = INF;
}
for (int i = 0, a, b, c, t; ... | #include <iostream>
#define N 101
#define INF 1e+9
using namespace std;
int main(void) {
int n, m;
while (cin >> n >> m, n || m) {
int cost[N][N], times[N][N];
for (int i = 1; i <= m; ++i)
for (int j = 1; j <= m; ++j) {
cost[i][j] = times[i][j] = INF;
}
for (int i = 0, a, b, c, t; ... | [["-", 0, 57, 64, 9, 0, 1, 0, 16, 17, 60], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32]] | 1 | 528 | 4 |
#include <iostream>
using namespace std;
const int MAX_N = 110;
const int INF = 10000;
int d_cost[MAX_N][MAX_N];
int d_time[MAX_N][MAX_N];
int n, m;
void warshall_floyd(int d[MAX_N][MAX_N]) {
for (int k = 0; k < m; k++)
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++)
d[i][j] = min(d[i][j]... | #include <iostream>
using namespace std;
const int MAX_N = 110;
const int INF = 10000;
int d_cost[MAX_N][MAX_N];
int d_time[MAX_N][MAX_N];
int n, m;
void warshall_floyd(int d[MAX_N][MAX_N]) {
for (int k = 0; k < m; k++)
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++)
d[i][j] = min(d[i][j]... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 9, 0, 7, 8, 7, 15, 16, 12, 22], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 12, 22]] | 1 | 390 | 4 |
inf = 0x10101010
def solve(A, strt):
cost = [inf]*m
visited = [False]*m
cost[strt] = 0
while True:
min = inf
next = -1
visited[strt] = True
for i in range(m):
if visited[i]:
continue
if A[strt][i]:
d = cost[strt] + A[strt][i]
if d < cost[i]:
cost[i] = d
if cost[i] < min... | inf = 0x10101010
def solve(A, strt):
cost = [inf]*m
visited = [False]*m
cost[strt] = 0
while True:
min = inf
next = -1
visited[strt] = True
for i in range(m):
if visited[i]: continue
if A[strt][i]:
d = cost[strt] + A[strt][i]
if d < cost[i]:
cost[i] = d
if min > cost[i]:
mi... | [["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["-", 0, 57, 64, 196, 0, 57, 15, 666, 667, 18], ["-", 0, 57, 64, 196, 0, 57, 15, 666, 0, 22]] | 5 | 374 | 4 |
inf = 0x10101010
def solve(A,strt,goal):
cost = [inf]*m
visited = [False]*m
cost[strt] = 0
while True:
min = inf
next = -1
visited[strt] = True
for i in range(m):
if visited[i]: continue
if A[strt][i]:
d = cost[strt] + A[strt][i]
if d < cost[i]:
cost[i] = d
if min > cost[i]:
min = ... | inf = 0x10101010
def solve(A,strt,goal):
cost = [inf]*m
visited = [False]*m
cost[strt] = 0
while True:
min = inf
next = -1
visited[strt] = True
for i in range(m):
if visited[i]: continue
if A[strt][i]:
d = cost[strt] + A[strt][i]
if d < cost[i]:
cost[i] = d
if min > cost[i]:
min = ... | [["-", 0, 662, 12, 662, 31, 206, 51, 206, 51, 22], ["+", 0, 662, 12, 662, 31, 206, 51, 206, 51, 22]] | 5 | 345 | 2 |
#include <stdio.h>
#include <string.h>
typedef struct item {
char n[105];
int p, f, k, m[105];
} ITEM;
ITEM d[105];
int func(int n) {
int sp = 0, i;
if (d[n].f == 0)
return d[n].p;
else {
for (i = 0; i < d[n].k; i++) {
sp += func(d[n].m[i]);
}
if (sp < d[n].p)
d[n].p = sp;
retu... | #include <stdio.h>
#include <string.h>
typedef struct item {
char n[105];
int p, f, k, m[105];
} ITEM;
ITEM d[105];
int func(int n) {
int sp = 0, i;
if (d[n].f == 0)
return d[n].p;
else {
for (i = 0; i < d[n].k; i++) {
sp += func(d[n].m[i]);
}
if (sp < d[n].p)
d[n].p = sp;
retu... | [["-", 0, 57, 75, 76, 0, 9, 0, 37, 0, 22], ["+", 0, 9, 0, 37, 0, 118, 28, 69, 28, 22], ["+", 0, 9, 0, 37, 0, 118, 28, 69, 0, 70], ["+", 0, 9, 0, 37, 0, 118, 28, 69, 71, 22], ["+", 0, 9, 0, 37, 0, 118, 28, 69, 0, 73], ["+", 75, 76, 0, 9, 0, 37, 0, 118, 17, 131], ["+", 75, 76, 0, 9, 0, 37, 0, 118, 119, 120]] | 0 | 495 | 7 |
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main() {
std::map<std::string, int> ItemData;
int Item_num;
while (std::cin >> Item_num) {
if (Item_num == 0)
break;
for (int i = 0; i < Item_num; ++i) {
std::string ItemName;
int ItemPrice;
std::cin ... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main() {
std::map<std::string, int> ItemData;
int Item_num;
while (std::cin >> Item_num) {
if (Item_num == 0)
break;
for (int i = 0; i < Item_num; ++i) {
std::string ItemName;
int ItemPrice;
std::cin ... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 210 | 2 |
#include <iostream>
using namespace std;
struct item {
int id;
int price;
};
struct recipe {
int id;
int size;
int price;
int ingre[100];
};
item I[100];
recipe R[100];
string T[100];
int solve(int id, int n, int m);
int main(int argc, char **argv) {
string name, o, q;
int n, m, p, k;
while (1... | #include <iostream>
using namespace std;
struct item {
int id;
int price;
};
struct recipe {
int id;
int size;
int price;
int ingre[100];
};
item I[100];
recipe R[100];
string T[100];
int solve(int id, int n, int m);
int main(int argc, char **argv) {
string name, o, q;
int n, m, p, k;
while (1... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 43, 49, 50, 51, 118, 28, 69, 28, 22], ["+", 49, 50, 51, 118, 28, 69, 341, 342, 0, 70], ["+", 49, 50, 51, 118, 28, 69, 341, 342, 0, 22], ["+", 49, 50, 51, 118, 28, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 43, 49, 50, 51, 118, 17, 131], ["+", 8, 9, 0, 43, 49, 50, 51, 118, ... | 1 | 493 | 7 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int n, m;
map<string, int> t;
int c[111];
vector<int> v[111];
int solve(int k) {
int sum = 0;
if (v[k].empty())
return c[k];
for (int i = 0; i < (int)v[k].size(); i++) {
sum ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int n, m;
map<string, int> t;
int c[111];
vector<int> v[111];
int solve(int k) {
int sum = 0;
if (v[k].empty())
return c[k];
for (int i = 0; i < (int)v[k].size(); i++) {
sum ... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 304 | 4 |
import java.util.*;
public class Main {
Scanner sc = new Scanner(System.in);
double DP(double gn[][], int n, int m) {
double result = 1.00;
double gli[][] = new double[n][m];
for (int i = 0; i < n; i++) {
gli[i][0] = 1.00;
}
for (int i = 1; i < m; i++) {
for (int j = 0; j < n; j++) ... | import java.util.*;
public class Main {
Scanner sc = new Scanner(System.in);
double DP(double gn[][], int n, int m) {
double result = 0;
double gli[][] = new double[n][m];
for (int i = 0; i < n; i++) {
gli[i][0] = 1.00;
}
for (int i = 1; i < m; i++) {
for (int j = 0; j < n; j++) {
... | [["-", 0, 195, 8, 196, 0, 503, 49, 200, 51, 515], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 51, 499], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 44]] | 3 | 381 | 3 |
import java.util.Scanner;
public class Main {
int n, m;
double table[][];
double memo[][];
public static void main(String[] args) { new Main().run(); }
void run() {
Scanner sc = new Scanner(System.in);
while (true) {
n = sc.nextInt();
m = sc.nextInt();
if (n + m == 0)
break... | import java.util.Scanner;
public class Main {
int n, m;
double table[][];
double memo[][];
public static void main(String[] args) { new Main().run(); }
void run() {
Scanner sc = new Scanner(System.in);
while (true) {
n = sc.nextInt();
m = sc.nextInt();
if (n + m == 0)
break... | [["-", 3, 4, 0, 16, 31, 492, 3, 4, 0, 22], ["+", 3, 4, 0, 16, 31, 492, 3, 4, 0, 22]] | 3 | 422 | 2 |
#include <stdio.h>
int main() {
int n, m, i, j, k;
double dp[110][110], d[110][110], max;
while (scanf("%d %d", &n, &m), n || m) {
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
scanf("%lf", &d[i][j]);
dp[0][i] = 1;
}
for (k = 1; k < m; k++) {
for (i = 0; i < n; i++) {
... | #include <stdio.h>
int main() {
int n, m, i, j, k;
double dp[110][110], d[110][110], max;
while (scanf("%d %d", &n, &m), n || m) {
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
scanf("%lf", &d[i][j]);
dp[0][i] = 1;
}
for (k = 1; k < m; k++) {
for (i = 0; i < n; i++) {
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 270 | 2 |
#include <stdio.h>
#include <string.h>
int main(void) {
int n, m;
double g[100][100];
double baby[100], baby_next[100];
int i, j, k;
double max;
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0) {
break;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scan... | #include <stdio.h>
#include <string.h>
int main(void) {
int n, m;
double g[100][100];
double baby[100], baby_next[100];
int i, j, k;
double max;
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0) {
break;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scan... | [["-", 15, 23, 0, 16, 12, 16, 31, 69, 71, 22], ["+", 15, 23, 0, 16, 12, 16, 31, 69, 71, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 69, 71, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 69, 71, 22]] | 0 | 319 | 4 |
#include <stdio.h>
#define Double double
#define Int int
#define For for
#define Scanf scanf
#define If if
#define Printf printf
#define Roop(i, n) for (i = 0; i < n; i++)
#define Roop2(i, n) for (i = 1; i <= n; i++)
#define Roop3(i, n) for (i = 2; i <= n; i++)
Double dp[101][101], x[101][101];
int main() {
Int i, ... | #include <stdio.h>
#define Double double
#define Int int
#define For for
#define Scanf scanf
#define If if
#define Printf printf
#define Roop(i, n) for (i = 0; i < n; i++)
#define Roop2(i, n) for (i = 1; i <= n; i++)
#define Roop3(i, n) for (i = 2; i <= n; i++)
Double dp[101][101], x[101][101];
int main() {
Int i, ... | [["-", 8, 9, 0, 42, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 42, 0, 2, 3, 4, 0, 22]] | 0 | 279 | 2 |
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
double dp[100][100], g[100][100];
int main() {
int n, m;
while (cin >> n >> m, n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> g[i][j];
}
}
fill_n(dp[0], n, 1.0);
for (int i =... | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
double dp[100][100], g[100][100];
int main() {
int n, m;
while (cin >> n >> m, n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> g[i][j];
}
}
fill_n(dp[0], n, 1.0);
for (int i =... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 261 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
#define TT template <typename T>
#define ET(T) typename T::value_type
TT inline T sq(T x) { return x * x; }
TT inline T In() {
T x;
cin >> x;
return x;
}
TT inline int ubnd(T &v, ET(T) x) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
#define TT template <typename T>
#define ET(T) typename T::value_type
TT inline T sq(T x) { return x * x; }
TT inline T In() {
T x;
cin >> x;
return x;
}
TT inline int ubnd(T &v, ET(T) x) {
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 806 | 2 |
#include <algorithm>
#include <cstdio>
using namespace std;
double growth[200][200];
double dp[200][200];
int main() {
int n, m;
while (scanf("%d %d", &n, &m), n + m) {
for (int i = 0; i < 200; i++) {
dp[0][i] = 1.0;
for (int j = 1; j < 200; j++) {
dp[j][i] = 0.0;
}
}
for (... | #include <algorithm>
#include <cstdio>
using namespace std;
double growth[200][200];
double dp[200][200];
int main() {
int n, m;
while (scanf("%d %d", &n, &m), n + m) {
for (int i = 0; i < 200; i++) {
dp[0][i] = 1.0;
for (int j = 1; j < 200; j++) {
dp[j][i] = 0.0;
}
}
for (... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 302 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n || m) {
double gr[128][128] = {0};
double dptab[128][128] = {0};
for (int i = 0; i < 128; i++) {
dptab[0][i] = 1.0;
}
for (int i = 0; i < n; i++) {
for (int... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n || m) {
double gr[128][128] = {0};
double dptab[128][128] = {0};
for (int i = 0; i < 128; i++) {
dptab[0][i] = 1.0;
}
for (int i = 0; i < n; i++) {
for (int... | [["-", 3, 4, 0, 16, 31, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 31, 69, 341, 342, 0, 22]] | 1 | 262 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair... | [["-", 0, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 31, 22]] | 1 | 294 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#de... | [["-", 12, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 22]] | 1 | 338 | 2 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int n, m;
double g[100][100];
double dp[101][100];
double rec(int a, int b) { // a回目，前に与えた肥料b
if (dp[a][b] > 0)
return dp[a][b];
double ret = 1.0;
if (a == m - 1)
ret = 1.0;
else {
double t = 0;
for (int i = 0; i < n... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int n, m;
double g[100][100];
double dp[101][100];
double rec(int a, int b) { // a回目，前に与えた肥料b
if (dp[a][b] > 0)
return dp[a][b];
double ret = 1.0;
if (a == m - 1)
ret = 1.0;
else {
double t = -1;
for (int i = 0; i < ... | [["-", 75, 76, 0, 9, 0, 43, 49, 50, 51, 13], ["+", 75, 76, 0, 9, 0, 43, 49, 50, 51, 13], ["-", 75, 76, 0, 9, 0, 1, 0, 11, 17, 108], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 7, 8, 7, 15, 16, 12, 22], ["+", 8, 9, 0, 7, 8, ... | 1 | 336 | 8 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
for (;;) {
int n, m;
cin >> n >> m;
if (n == 0) {
return 0;
}
double map[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> map[i][j];
}
}
double dp[m][n];
f... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
for (;;) {
int n, m;
cin >> n >> m;
if (n == 0) {
return 0;
}
double map[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> map[i][j];
}
}
double dp[m][n];
f... | [["-", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 341 | 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 vi vector<int>
#define pb push_back
#define INF 999999999
//#define INF (1LL<<59)
int main() {
int n, m;
while (cin >> n >... | #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 vi vector<int>
#define pb push_back
#define INF 999999999
//#define INF (1LL<<59)
int main() {
int n, m;
while (cin >> n >... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 263 | 2 |
#include <cfloat>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
const int NMAX = 100;
int main() {
int n, m;
double dp[2][NMAX];
double g[NMAX][NMAX];
double lg[NMAX][NMAX];
while (1) {
cin >> n >> m;
if (!n && !m) {
break;
}
for (int i = 0; i < n; ++i)... | #include <cfloat>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
const int NMAX = 100;
int main() {
int n, m;
double dp[2][NMAX];
double g[NMAX][NMAX];
double lg[NMAX][NMAX];
while (1) {
cin >> n >> m;
if (!n && !m) {
break;
}
for (int i = 0; i < n; ++i)... | [["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 16, 31, 69, 341, 342, 0, 13], ["-", 12, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 12, 16, 12, 69, 28, 69, 341, 342, 0, 13], ["-", 0, 11, 12, 16, 12, 69, 341, 342, 0, 13], ["+", 0, 11, 12, 16, 12, 69, 341, 342, 0, 22], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 5... | 1 | 363 | 8 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (n == 0 && m == 0)
break;
double data[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (n == 0 && m == 0)
break;
double data[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n... | [["-", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 290 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 150
int main() {
int N, M;
while (cin >> N >> M, N) {
double g[N][N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> g[i][j];
}
}
double dp[MAX][MAX];
for (int i = 0; i < MAX; i++) {
for (... | #include <bits/stdc++.h>
using namespace std;
#define MAX 150
int main() {
int N, M;
while (cin >> N >> M, N) {
double g[N][N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> g[i][j];
}
}
double dp[MAX][MAX];
for (int i = 0; i < MAX; i++) {
for (... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 282 | 2 |
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int n, m;
double e[111][111], dp[111][111];
int main() {
while (cin >> n >> m) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
cin >> e[i][j];
}
for (int i = 0; i < n; i++)
dp[0][i] = 1.0;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int n, m;
double e[111][111], dp[111][111];
int main() {
while (cin >> n >> m, n | m) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
cin >> e[i][j];
}
for (int i = 0; i < n; i++)
dp[0][i] = 1.... | [["+", 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, 139], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 12, 22]] | 1 | 241 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll long long int
#define ld long long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i, n) for (i = 0; i < n; i++)
using namesp... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll long long int
#define ld long long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i, n) for (i = 0; i < n; i++)
using namesp... | [["-", 0, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 31, 22]] | 1 | 332 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
#define ll (long long)
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
#include <algorithm>
#i... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
#define ll (long long)
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
#include <algorithm>
#i... | [["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["-", 64, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 64, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 400 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
int n, m;
double grow[100][100];
double dp[110][110];
int main() {
while (std::cin >> n >> m, n + m) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
std::cin >> grow[i][j];
}
}
for (int i = 0;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
int n, m;
double grow[100][100];
double dp[110][110];
int main() {
while (std::cin >> n >> m, n + m) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
std::cin >> grow[i][j];
}
}
for (int i = 0;... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 16, 31, 23, 0, 74, 39, 77, 39, 40], ["+", 31, 23, 0, 74, 39, 77, 39, 86, 0, 96]] | 1 | 295 | 7 |
#include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) begin(r), end(r)
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " << x << endl
#define fcout(n) cout << fixed << setprecision((... | #include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) begin(r), end(r)
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " << x << endl
#define fcout(n) cout << fixed << setprecision((... | [["-", 0, 16, 31, 16, 31, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 13]] | 1 | 520 | 2 |
#include <stdio.h>
double dp[100][100];
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MAX(x, y) ((x) > (y) ? (x) : (y))
int main(void) {
double grow[100][100]; //[ツ前ツづ個氾ャツ猟ソ][ツ債。ツづ個氾ャツ猟ソ]
int n, m;
while (1) {
REP(i, 100) dp[0][i] = 1.0;
scanf("%d%d", &n, &m);
if (n == 0 || m == 0) {
... | #include <stdio.h>
double dp[100][100];
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MAX(x, y) ((x) > (y) ? (x) : (y))
int main(void) {
double grow[100][100]; //[ツ前ツづ個氾ャツ猟ソ][ツ債。ツづ個氾ャツ猟ソ]
int n, m;
while (1) {
REP(i, 100) dp[0][i] = 1.0;
scanf("%d%d", &n, &m);
if (n == 0 || m == 0) {
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 284 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
long double r, a[101][101], dp[101][101];
while (cin >> n >> m && (m + n)) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
fill(&dp[0][0], &dp[100][100], 0);
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
long double r, a[101][101], dp[101][101];
while (cin >> n >> m && (m + n)) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
fill(&dp[0][0], &dp[n][m], 0);
f... | [["-", 0, 66, 28, 69, 28, 69, 341, 342, 0, 13], ["+", 0, 66, 28, 69, 28, 69, 341, 342, 0, 22], ["-", 3, 4, 0, 66, 28, 69, 341, 342, 0, 13], ["+", 3, 4, 0, 66, 28, 69, 341, 342, 0, 22], ["-", 0, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+"... | 1 | 281 | 8 |
#include <cstdio>
#include <iostream>
#define INF 0
using namespace std;
int main() {
int n, m;
double t[200][200];
while (cin >> n >> m, n || m) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> t[i][j];
double dp[200][200];
for (int i = 0; i <= n; i++)
for (int j =... | #include <cstdio>
#include <iostream>
#define INF 0
using namespace std;
int main() {
int n, m;
double t[200][200];
while (cin >> n >> m, n || m) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> t[i][j];
double dp[200][200];
for (int i = 0; i <= m; i++)
for (int j =... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 3, 4, 0, 69, 341, 342, 0, 16, 31, 22], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 31, 22]] | 1 | 282 | 6 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cout << setprecision(2);
cout << setiosflags(ios::fixed);
int n, m, i, j, k;
long double M;
while (cin >> n >> m, n | m) {
vector<vector<long double>> manure(n, vector<long double>(n)),
... |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cout << setprecision(2);
cout << setiosflags(ios::fixed);
int n, m, i, j, k;
long double M;
while (cin >> n >> m, n | m) {
vector<vector<long double>> manure(n, vector<long double>(n)),
... | [["-", 0, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 31, 22]] | 1 | 282 | 2 |
// 43
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
for (int n, m; cin >> n >> m, n | m;) {
double g[100][100] = {{}};
for (int y = 0; y < n; y++) {
for (int x = 0; x < n; x++) {
cin >> g[y][x];
}
}
double r[101][100] = {{}};
fi... | // 43
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
for (int n, m; cin >> n >> m, n | m;) {
double g[100][100] = {{}};
for (int y = 0; y < n; y++) {
for (int x = 0; x < n; x++) {
cin >> g[y][x];
}
}
double r[101][100] = {{}};
fi... | [["-", 3, 4, 0, 69, 341, 342, 0, 16, 31, 22], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 31, 22], ["-", 28, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 28, 2, 3, 4, 0, 69, 341, 342, 0, 22]] | 1 | 241 | 4 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 418 | 2 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using na... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using na... | [["-", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 346 | 4 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using na... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using na... | [["-", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 314 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define re... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define re... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 42, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 344 | 8 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define rep(i, k, n) for (int i = k; i < n; i++)
double G[101][101];
int main() {
int n, m;
while (cin >> n >> m, n + m) {
rep(i, 1, n + 1) rep(j, 1, n + 1) cin >> G[i][j];
double dp[101][101];
fill(dp[0], dp[101], 0);
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define rep(i, k, n) for (int i = k; i < n; i++)
double G[101][101];
int main() {
int n, m;
while (cin >> n >> m, n + m) {
rep(i, 1, n + 1) rep(j, 1, n + 1) cin >> G[i][j];
double dp[101][101];
fill(dp[0], dp[101], 0);
... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 3, 4, 0, 69, 28, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 69, 28, 69, 341, 342, 0, 22]] | 1 | 249 | 6 |
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
void solve() {
int n, m;
while (cin >> n >> m, n || m) {
long double data[101][101];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
scanf("%lf", &data[i][j]);
}
}
long do... | #include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
void solve() {
int n, m;
while (cin >> n >> m, n || m) {
long double data[101][101];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
scanf("%Lf", &data[i][j]);
}
}
long do... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 322 | 17 |
def solve trans,m,n
prev = Array.new(n,1.0)
(m-1).times do
cur = Array.new(n,0)
n.times do |i|
n.times do |j|
cur[i] = [cur[i], prev[j]*trans[j][i]].max
end
end
cur,prev = prev,cur
end
prev.max
end
loop do
n,m = gets.chomp.split.map{|i|i.to_i}
break if n==0
trans = []
... | def solve trans,m,n
prev = Array.new(n,1.0)
(m-1).times do
cur = Array.new(n,0)
n.times do |i|
n.times do |j|
cur[i] = [cur[i], prev[j]*trans[j][i]].max
end
end
cur,prev = prev,cur
end
prev.max
end
loop do
n,m = gets.chomp.split.map{|i|i.to_i}
break if n==0
trans = []
... | [["-", 0, 652, 3, 4, 0, 738, 31, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 738, 31, 557, 0, 6]] | 4 | 158 | 23 |
# AOJ 0191: Baby Tree
# Python3 2018.6.20 bal4u
while True:
n, m = list(map(int, input().split()))
if n == 0: break
d = [[0.0 for j in range(n)] for i in range(n)]
for i in range(n): d[i] = list(map(float, input().split()))
dp = [[0.0 for j in range(n)] for i in range(n)]
for i in range(n): dp[0][i] = 1
for k... | # AOJ 0191: Baby Tree
# Python3 2018.6.20 bal4u
while True:
n, m = list(map(int, input().split()))
if n == 0: break
d = [[0.0 for j in range(n)] for i in range(n)]
for i in range(n): d[i] = list(map(float, input().split()))
dp = [[0.0 for j in range(n)] for k in range(m)]
for i in range(n): dp[0][i] = 1
for k... | [["-", 0, 1, 0, 662, 12, 658, 0, 659, 31, 22], ["+", 0, 1, 0, 662, 12, 658, 0, 659, 31, 22], ["-", 12, 658, 0, 659, 12, 652, 3, 4, 0, 22], ["+", 12, 658, 0, 659, 12, 652, 3, 4, 0, 22]] | 5 | 225 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1 << 30;
class Parking {
public:
int id, time;
Parking(int _id = -1, int _time = INF) : id(_id), time(_time) {}
};
int main() {
int n, m;
while (cin >> m >> n) {
if ((n | m) == 0)
break;
vector<int... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1 << 30;
class Parking {
public:
int id, time;
Parking(int _id = -1, int _time = INF) : id(_id), time(_time) {}
};
int main() {
int n, m;
while (cin >> m >> n) {
if ((n | m) == 0)
break;
vector<int... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72]] | 1 | 811 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#in... | [["-", 8, 9, 0, 57, 64, 37, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 64, 37, 0, 16, 17, 18], ["-", 8, 9, 0, 57, 64, 37, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 64, 37, 0, 16, 17, 47]] | 1 | 1,126 | 4 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define IINF (INT_MAX)
#define MAX 20
using namespace std;
typedef pair<int, int> ii;
... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define IINF (INT_MAX)
#define MAX 20
using namespace std;
typedef pair<int, int> ii;
... | [["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 116, 0, 117], ["+", 8, 9, 0, 57, 75, 76, 0, 116, 0, 35]] | 1 | 1,005 | 3 |
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
// Deven-Eleven
public class Main {
static int[][] move = {{0, -1}, {1, -1}, {-1, 0}, {1, 0}, {0, 1}, {1, 1}};
static int[][] move2 = {{-1, -1}, {0, -1}, {-1, 0}, {1, 0}, {-1, 1}, {0, 1}};
static int m, n, s;
static int[][] bfs(int ... | import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
// Deven-Eleven
public class Main {
static int[][] move = {{0, -1}, {1, -1}, {-1, 0}, {1, 0}, {0, 1}, {1, 1}};
static int[][] move2 = {{-1, -1}, {0, -1}, {-1, 0}, {1, 0}, {-1, 1}, {0, 1}};
static int m, n, s;
static int[][] bfs(int ... | [["-", 0, 195, 8, 196, 0, 503, 49, 200, 51, 499], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 51, 499]] | 3 | 714 | 2 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const int dy[6] = {-1, -1, 0, 1, 1, 0};
const int dx[2][6] = {{-1, 0, 1, 0, -1, -1}, {0, 1, 1, 1, 0, -1}};
struct Data {
i... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const int dy[6] = {-1, -1, 0, 1, 1, 0};
const int dx[2][6] = {{-1, 0, 1, 0, -1, -1}, {0, 1, 1, 1, 0, -1}};
struct Data {
i... | [["-", 15, 339, 51, 34, 31, 16, 31, 16, 12, 22], ["-", 0, 52, 15, 339, 51, 34, 31, 16, 17, 152], ["-", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 0, 52, 15, 339, 51, 34, 31, 16, 17, 152], ["-", 0, 52, 15, 339, 51, 34, 12, 16, 17, 106], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 1... | 1 | 495 | 8 |
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct NODE {
int x, y, c, num;
NODE(int x, int y, int c) : x(x), y(y), c(c) {}
NODE(int x, int y, int c, int num) : x(x), y(y), c(c), num(num) {}
};
int W, H;
int doit(vector<NODE> v) {
queue<NODE> Q;
for (int i =... | #include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct NODE {
int x, y, c, num;
NODE(int x, int y, int c) : x(x), y(y), c(c) {}
NODE(int x, int y, int c, int num) : x(x), y(y), c(c), num(num) {}
};
int W, H;
int doit(vector<NODE> v) {
queue<NODE> Q;
for (int i =... | [["-", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13]] | 1 | 768 | 4 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); ++i)
#defi... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); ++i)
#defi... | [["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 499 | 4 |
def g;gets.split.map &:to_i;end
while(m,n=g)[0]>0
a=(1..g[0]).map{|i|g<<i}
p (1..g[0]).map{d=a+[c=g<<11]
(0..m*n).count{|k|i=k/n+1;j=k%n+1
d.min_by{|x,y,t|z=(y-j).abs
[z+[(x-i).abs-(z+(i<x ?1-j%2:j%2))/2,0].max,t]}==c}}.max
end | def g;gets.split.map &:to_i;end
while(m,n=g)[0]>0
a=(1..g[0]).map{|i|g<<i}
p (1..g[0]).map{d=a+[c=g<<11]
(0..m*n-1).count{|k|i=k/n+1;j=k%n+1
d.min_by{|x,y,t|z=(y-j).abs
[z+[(x-i).abs-(z+(i<x ?1-j%2:j%2))/2,0].max,t]}==c}}.max
end | [["-", 0, 493, 0, 89, 8, 170, 0, 768, 0, 769], ["+", 0, 493, 0, 89, 8, 170, 0, 768, 0, 769]] | 4 | 47 | 2 |
### constant
MAX_INT = (1 << 31) - 1
NEIGHBORS = [
[[-1, -1], [ 0, -1], [-1, 0], [ 1, 0], [-1, 1], [ 0, 1]],
[[ 0, -1], [ 1, -1], [-1, 0], [ 1, 0], [ 0, 1], [ 1, 1]]
]
### global variables
### subroutines
def gen_dists(x, y, m, n)
dists = n.times.map{m.times.map{MAX_INT}}
dists[y][x] = 0
queue = ... | ### constant
MAX_INT = (1 << 31) - 1
NEIGHBORS = [
[[-1, -1], [ 0, -1], [-1, 0], [ 1, 0], [-1, 1], [ 0, 1]],
[[ 0, -1], [ 1, -1], [-1, 0], [ 1, 0], [ 0, 1], [ 1, 1]]
]
### global variables
### subroutines
def gen_dists(x, y, m, n)
dists = n.times.map{m.times.map{MAX_INT}}
dists[y][x] = 0
queue = ... | [["-", 0, 121, 15, 738, 31, 738, 12, 738, 12, 22], ["+", 0, 121, 15, 738, 31, 738, 12, 738, 12, 22]] | 4 | 501 | 2 |
import java.util.*;
class Main {
public static void main(String[] z) {
int a, b = 0, t, i;
for (Scanner s = new Scanner(System.in);;
System.out.printf("%c %d\n", a + 65, b), b = 0)
for (i = a = 5; i-- > 0;)
if ((t = s.nextInt() + s.nextInt()) < 1)
return;
else if (b < ... | import java.util.*;
class Main {
public static void main(String[] z) {
int a, b = 0, t, i;
for (Scanner s = new Scanner(System.in);;
System.out.printf("%c %d\n", a + 64, b), b = 0)
for (i = a = 0; i++ < 5;)
if ((t = s.nextInt() + s.nextInt()) < 1)
return;
else if (b < ... | [["-", 0, 7, 26, 492, 3, 4, 0, 16, 12, 499], ["+", 0, 7, 26, 492, 3, 4, 0, 16, 12, 499], ["-", 0, 7, 8, 7, 502, 11, 12, 11, 12, 499], ["+", 0, 7, 8, 7, 502, 11, 12, 11, 12, 499], ["-", 0, 7, 8, 7, 15, 16, 31, 27, 0, 68], ["-", 8, 196, 0, 7, 8, 7, 15, 16, 17, 47], ["-", 8, 196, 0, 7, 8, 7, 15, 16, 12, 499], ["+", 0, 7, ... | 3 | 123 | 10 |
#include <algorithm>
#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++)
using namespace std;
int main() {
int l;
while (cin >> l && l) {
bool flag = false;
int t, t2;
vector<int> v;
rep(i, 12) {
... | #include <algorithm>
#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++)
using namespace std;
int main() {
int l;
while (cin >> l && l) {
bool flag = false;
int t, t2;
vector<int> v;
rep(i, 12) {
... | [["+", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111]] | 1 | 144 | 1 |
#include <iostream>
using namespace std;
int main() {
int l, m, n;
int k[12];
while (cin >> l) {
if (l = 0)
break;
for (int i = 0; i < 12; i++) {
cin >> m >> n;
k[i] = m - n;
}
for (int i = 0; i < 12; i++) {
l -= k[i];
if (l <= 0) {
cout << i + 1 << endl;
... | #include <iostream>
using namespace std;
int main() {
int l, m, n;
int k[12];
while (cin >> l) {
if (l == 0)
break;
for (int i = 0; i < 12; i++) {
cin >> m >> n;
k[i] = m - n;
}
for (int i = 0; i < 12; i++) {
l -= k[i];
if (l <= 0) {
cout << i + 1 << endl;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 127 | 2 |
#include <iostream>
using namespace std;
int main() {
int l, m, n;
while (true) {
cin >> l;
if (!l)
break;
int f = 1;
for (int i = 0; i < 12; i++) {
cin >> m >> n;
l -= m - n;
if (l <= 0 && f) {
cout << i + 1 << endl;
f = 0;
}
}
if (l <= 0)
... | #include <iostream>
using namespace std;
int main() {
int l, m, n;
while (true) {
cin >> l;
if (!l)
break;
int f = 1;
for (int i = 0; i < 12; i++) {
cin >> m >> n;
l -= m - n;
if (l <= 0 && f) {
cout << i + 1 << endl;
f = 0;
}
}
if (l > 0)
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 108 | 2 |
#include <iostream>
using namespace std;
int sum, n, a, b, ok;
int main() {
while (true) {
sum = 0;
ok = 0;
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < 12; i++) {
cin >> a >> b;
sum += a - b;
if (sum >= n && ok == 0) {
cout << i << endl;
ok = 1;... | #include <iostream>
using namespace std;
int sum, n, a, b, ok;
int main() {
while (true) {
sum = 0;
ok = 0;
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < 12; i++) {
cin >> a >> b;
sum += a - b;
if (sum >= n && ok == 0) {
cout << i + 1 << endl;
ok ... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 117 | 2 |
#include <iostream>
using namespace std;
int main() {
int l, m, n;
while (cin >> l, l) {
int ct = 0;
for (int i = 0; i < 12; i++) {
cin >> m >> n;
if (l > 0) {
l -= (m - n);
ct++;
}
}
if (ct > 12) {
cout << "NA";
} else {
cout << ct;
}
cou... | #include <iostream>
using namespace std;
int main() {
int l, m, n;
while (cin >> l, l) {
int ct = 0;
for (int i = 0; i < 12; i++) {
cin >> m >> n;
if (l > 0) {
l -= (m - n);
ct++;
}
}
if (l > 0) {
cout << "NA";
} else {
cout << ct;
}
cout ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 105 | 4 |
#include <iostream>
using namespace std;
int main() {
int shotoku[12];
int l, m, n;
int i, total;
while (cin >> l, l) {
for (i = 0; i < 12; i++) {
cin >> m >> n;
shotoku[i] = m - n;
}
total = 0;
for (i = 0; i < 12; i++) {
total += shotoku[i];
if (l <= total) {
co... | #include <iostream>
using namespace std;
int main() {
int shotoku[12];
int l, m, n;
int i, total;
while (cin >> l, l) {
for (i = 0; i < 12; i++) {
cin >> m >> n;
shotoku[i] = m - n;
}
total = 0;
for (i = 0; i < 12; i++) {
total += shotoku[i];
if (l <= total) {
co... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 131 | 2 |
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
while (1) {
bool isfirst = true;
int M, N, L, S = 0;
cin >> L;
if (L == 0)
break;
for (int i = 0; i < 12; i++) {
cin >> M >> N;
S += M - N;
if (L <= S && isfirst) {
cout << i + 1 << ... | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
while (1) {
bool isfirst = true;
int M, N, L, S = 0;
cin >> L;
if (L == 0)
break;
for (int i = 0; i < 12; i++) {
cin >> M >> N;
S += M - N;
if (L <= S && isfirst) {
cout << i + 1 << ... | [["+", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 51, 22], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 118 | 6 |
#include <iostream>
#define N 12
using namespace std;
int main() {
int L;
int m, n;
int mon;
bool skip;
while (true) {
cin >> L;
if (L == 0)
break;
// sum = L;
skip = false;
for (int i = 0; i < N; i++) {
cin >> m >> n;
L -= m - n;
if (L <= 0 && !skip) {
... | #include <iostream>
#define N 12
using namespace std;
int main() {
int L;
int m, n;
int mon;
bool skip;
while (true) {
cin >> L;
if (L == 0)
break;
// sum = L;
skip = false;
for (int i = 0; i < N; i++) {
cin >> m >> n;
L -= m - n;
if (L <= 0 && !skip) {
... | [["+", 8, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 12, 22]] | 1 | 117 | 2 |
#include <stdio.h>
int main() {
int l, m, n, i, j;
while (0 <= scanf("%d", &l)) {
if (l == 0)
break;
j = -1;
for (i = 0; i < 12; i++) {
scanf("%d%d", &m, &n);
l -= (m - n);
if (j == -1 && l <= 0)
j = i;
}
if (j != 0) {
printf("%d\n", j + 1);
continue... | #include <stdio.h>
int main() {
int l, m, n, i, j;
while (0 <= scanf("%d", &l)) {
if (l == 0)
break;
j = -1;
for (i = 0; i < 12; i++) {
scanf("%d%d", &m, &n);
l -= (m - n);
if (j == -1 && l <= 0)
j = i;
}
if (j != -1) {
printf("%d\n", j + 1);
continu... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 130 | 2 |
#include <stdio.h>
int main() {
int L, M, N, t = 0, c = 0, i;
for (;; t = 0, c = 0) {
scanf("%d", &L);
if (L == 0)
break;
for (i = 0; i < 12; i++) {
scanf("%d%d", &M, &N);
t += M - N;
if (t >= L && c == 0)
c = i;
}
if (c != 0)
printf("%d\n", c + 1);
else... | #include <stdio.h>
int main() {
int L, M, N, t = 0, c = 0, i;
for (;; t = 0, c = 0) {
scanf("%d", &L);
if (L == 0)
break;
for (i = 1; i < 13; i++) {
scanf("%d%d", &M, &N);
t += M - N;
if (t >= L && c == 0) {
c = i;
}
}
if (c != 0)
printf("%d\n", c);
... | [["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 64, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 64, 1, 0, 2, 3, 4, 0, 16, 12, ... | 1 | 134 | 8 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22], ["-", 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, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 167 | 8 |
#include <cstdio>
int main() {
int l;
while (scanf("%d", &l), l) {
int cm = -1;
for (int i = 1; i <= 12; i++) {
int m, n;
scanf("%d%d", &m, &n);
l -= m - n;
if (l <= 0 && cm < 0)
cm = i;
}
if (cm < 0)
puts("NA");
else
printf("%d", cm);
}
} | #include <cstdio>
int main() {
int l;
while (scanf("%d", &l), l) {
int cm = -1;
for (int i = 1; i <= 12; i++) {
int m, n;
scanf("%d%d", &m, &n);
l -= m - n;
if (l <= 0 && cm < 0)
cm = i;
}
if (cm < 0)
puts("NA");
else
printf("%d\n", cm);
}
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 109 | 1 |
#include <iostream>
using namespace std;
int main() {
long long int l, m, n;
long long int savingMoney;
bool output = true;
while (cin >> l, l) {
savingMoney = 0;
for (int i = 1; i <= 12; i++) {
cin >> m >> n;
savingMoney += m - n;
if (l <= savingMoney && output) {
cout << i... | #include <iostream>
using namespace std;
int main() {
long long int l, m, n;
long long int savingMoney;
bool output = true;
while (cin >> l, l) {
savingMoney = 0;
output = true;
for (int i = 1; i <= 12; i++) {
cin >> m >> n;
savingMoney += m - n;
if (l <= savingMoney && output) ... | [["+", 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, 146], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 113 | 4 |
#include <iostream>
using namespace std;
int main(void) {
int M[12] = {0};
int N[12] = {0};
int L = 0;
while (true) {
int ans = 0;
cin >> L;
if (L == 0) {
return 0;
}
int i = 0;
for (i = 0; i < 12; i++) {
cin >> M[i] >> N[i];
}
for (int i = 0; i < 12; i++) {
... | #include <iostream>
using namespace std;
int main(void) {
int M[12] = {0};
int N[12] = {0};
int L = 0;
while (true) {
int ans = 0;
cin >> L;
if (L == 0) {
return 0;
}
int i = 0;
for (i = 0; i < 12; i++) {
cin >> M[i] >> N[i];
}
for (i = 0; i < 12; i++) {
... | [["-", 0, 52, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 166 | 5 |
while (l = gets.to_i) != 0
sum = 0
flag = true
1.upto(12) do |i|
m,n = gets.split(" ").map(&:to_i)
sum += m - n
if sum >= l && flag
puts i
flag = false
end
end
puts "NA" unless flag
end | while (l = gets.to_i) != 0
sum = 0
flag = true
1.upto(12) do |i|
m,n = gets.split(" ").map(&:to_i)
sum += m - n
if sum >= l && flag
puts i
flag = false
end
end
puts "NA" if flag
end | [["-", 0, 493, 0, 89, 8, 170, 0, 745, 0, 747], ["+", 0, 493, 0, 89, 8, 170, 0, 751, 0, 121]] | 4 | 69 | 2 |
class NextTrip
def solve
while true
target_price = gets.to_i
break if target_price <= 0
calc(target_price)
end
end
private
def calc(target_price)
answer = 'NA'
1.upto(12) do |month|
m, n = gets.split.map(&:to_i)
target_price -= (m - n)
if target_price <= 0 &&... | class NextTrip
def solve
while true
target_price = gets.to_i
break if target_price <= 0
calc(target_price)
end
end
private
def calc(target_price)
answer = 'NA'
1.upto(12) do |month|
m, n = gets.split.map(&:to_i)
target_price -= (m - n)
if target_price <= 0 &&... | [["-", 8, 736, 0, 735, 8, 736, 0, 652, 735, 22], ["+", 8, 736, 0, 735, 8, 736, 0, 652, 735, 22]] | 4 | 90 | 2 |
while True:
l = eval(input())
if l==0: break
c = []; m = 0;
for i in range(12):
c += list(map(int, input().split()))
for i in range(0,12,2):
m += c[i]-c[i+1]
if m>=l:
print(i/2+1); break;
if m<l:
print("NA") | while True:
l = eval(input())
if l==0: break
c = []; m = 0;
for i in range(12):
c += list(map(int, input().split()))
for i in range(0,24,2):
m += c[i]-c[i+1]
if m>=l:
print(i/2+1); break;
if m<l:
print("NA") | [["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612]] | 5 | 103 | 2 |
#include <iostream>
#include <queue>
#include <string.h>
using namespace std;
#define TATE 1
#define YOKO 0
struct ST {
int x;
int y;
};
int main(void) {
int map[101][101];
int board[101][101];
int T[] = {0, -1, 1, 0};
int Y[] = {1, 0, 0, -1};
int w, h, xs, xg, ys, yg, n, color, muki, x, y;
ST RE;
... | #include <iostream>
#include <queue>
#include <string.h>
using namespace std;
#define TATE 1
#define YOKO 0
struct ST {
int x;
int y;
};
int main(void) {
int map[101][101];
int board[101][101];
int T[] = {0, -1, 1, 0};
int Y[] = {1, 0, 0, -1};
int w, h, xs, xg, ys, yg, n, color, muki, x, y;
ST RE;
... | [["-", 12, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 12, 69, 28, 69, 341, 342, 0, 118, 28, 22], ["+", 12, 69, 28, 69, 341, 342, 0, 118, 17, 131], ["+", 12, 69, 28, 69, 341, 342, 0, 118, 119, 120], ["-", 31, 16, 12, 16, 12, 69, 341, 342, 0, 22], ["+", 12, 16, 12, 69, 341, 342, 0, 118, 28, 22], ["+", 12, 16, 12, 69, 34... | 1 | 589 | 8 |
#include <iostream>
#include <stack>
#include <string.h>
using namespace std;
struct ST {
int a;
int b;
int c;
};
long long brock[1000][1000];
long long ds[1000][1000];
int q[4] = {0, -1, 0, 1};
int p[4] = {1, 0, -1, 0};
int main() {
stack<ST> S;
ST ma;
ST ba;
int w, h; //???????????§??????
int xs... | #include <iostream>
#include <stack>
#include <string.h>
using namespace std;
struct ST {
int a;
int b;
int c;
};
long long brock[1000][1000];
long long ds[1000][1000];
int q[4] = {0, -1, 0, 1};
int p[4] = {1, 0, -1, 0};
int main() {
stack<ST> S;
ST ma;
ST ba;
int w, h; //???????????§??????
int xs... | [["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["-", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 675 | 5 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long l... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long l... | [["-", 51, 16, 31, 16, 31, 16, 31, 16, 17, 18], ["+", 51, 16, 31, 16, 31, 16, 31, 16, 17, 19], ["-", 51, 16, 31, 16, 31, 16, 12, 16, 17, 20], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 17, 47], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 1... | 1 | 682 | 8 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#def... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#def... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 682 | 4 |
#include <iostream>
#include <vector>
using namespace std;
#define BLANK 0
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
bool dfs(int color, int x, int y, int gx, int gy, vector<vector<int>> &blocks) {
if (x == gx && y == gy) {
return true;
}
blocks[x][y] = BLANK;
for (int i = 0; i < 4;... | #include <iostream>
#include <vector>
using namespace std;
#define BLANK 0
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
bool dfs(int color, int x, int y, int gx, int gy, vector<vector<int>> &blocks) {
if (x == gx && y == gy) {
return true;
}
blocks[x][y] = BLANK;
for (int i = 0; i < 4;... | [["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117]] | 1 | 435 | 3 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int show = 1;
int w, h, sx, sy, gx, gy, d[101][101], dx[4] = {1, ... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int show = 0;
int w, h, sx, sy, gx, gy, d[101][101], dx[4] = {1, ... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 11, 12, 69, 28, 69, 341, 342, 0, 13], ["+", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22]] | 1 | 696 | 6 |
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
typedef pair<int, int> P;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
const int dy[4] = {-1, 1, 0, 0};
const int dx[4] = {0, 0, -1, 1};
const int MAX_W = 101, MAX_H = 101;
int maze[MAX_... | #include <cstring>
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
typedef pair<int, int> P;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
const int dy[4] = {-1, 1, 0, 0};
const int dx[4] = {0, 0, -1, 1};
const int MAX_W = 102, MAX_H = 102;
int maze[MAX_... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 106], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 20], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 47], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, ... | 1 | 518 | 10 |
#include <algorithm> // require sort next_permutation count etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio> // require printf
#include <cstdlib> // require abs
#include <cstring> // require memset
#include <deque>
#include <fstream> // requi... | #include <algorithm> // require sort next_permutation count etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio> // require printf
#include <cstdlib> // require abs
#include <cstring> // require memset
#include <deque>
#include <fstream> // requi... | [["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13]] | 1 | 637 | 8 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <vector>
#define rep(i, j) FOR(i, 0, j)
#define FOR(i, j, k) for (int i = j; i < k; ++i)
using namespace std;
int w, h, xs, ys, xg, yg, n, c, d, x, y, b[101][101];
int dx[] = {0, -1, 0, 1}, dy[] = {-1, 0, 1, 0};
bool dfs(int x, int y)... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <vector>
#define rep(i, j) FOR(i, 0, j)
#define FOR(i, j, k) for (int i = j; i < k; ++i)
using namespace std;
int w, h, xs, ys, xg, yg, n, c, d, x, y, b[101][101];
int dx[] = {0, -1, 0, 1}, dy[] = {-1, 0, 1, 0};
bool dfs(int x, int y)... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 376 | 4 |
#include <stdio.h>
int main() {
int i, j, k;
int a, b, c;
int n[200] = {0};
while (1) {
scanf("%d", &a);
if (a == 0) {
break;
}
b = 0;
while (a) {
n[b] = a % 8;
a /= 8;
b++;
}
n[b] = 0;
c = 0;
i = 0;
while (i <= b) {
if (n[i] > 5) {
... | #include <stdio.h>
int main() {
int i, j, k;
int a, b, c;
int n[200] = {0};
while (1) {
scanf("%d", &a);
if (a == 0) {
break;
}
b = 0;
while (a) {
n[b] = a % 8;
a /= 8;
b++;
}
n[b] = 0;
c = 0;
i = 0;
while (i <= b) {
if (n[i] > 3) {
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13]] | 0 | 180 | 4 |
#include <stdio.h>
int main(void) {
int n;
char s[16];
char new_num[8] = {0, 1, 2, 3, 5, 7, 8, 9};
int i;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
sprintf(s, "%o", n);
for (i = 0; s[i] != '\0'; i++) {
if (s[i] >= '4') {
s[i]++;
}
if (s[i] >= '5... | #include <stdio.h>
int main(void) {
int n;
char s[16];
char new_num[8] = {0, 1, 2, 3, 5, 7, 8, 9};
int i;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
sprintf(s, "%o", n);
for (i = 0; s[i] != '\0'; i++) {
if (s[i] >= '5') {
s[i]++;
}
if (s[i] >= '4... | [["-", 0, 57, 15, 23, 0, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 23, 0, 16, 12, 103, 0, 125]] | 0 | 155 | 4 |
#include <iostream>
using namespace std;
int table[] = {0, 1, 2, 3, 5, 7, 8, 9};
void solve(int n) {
if (n >= 8) {
solve(n / 8);
}
cout << table[n % 8];
}
int main() {
int n;
while (cin >> n) {
solve(n);
cout << endl;
}
} | #include <iostream>
using namespace std;
int table[] = {0, 1, 2, 3, 5, 7, 8, 9};
void solve(int n) {
if (n >= 8) {
solve(n / 8);
}
cout << table[n % 8];
}
int main() {
int n;
while (cin >> n, n) {
solve(n);
cout << endl;
}
} | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 87 | 2 |
/*#include <iostream>
unsigned long long int func(unsigned long long int a);
unsigned long long answ[1000000000];
int main(){
unsigned long long int n;
while(std::cin >> n, n){
unsigned long long int ans = 0;
unsigned long long int n_=n;
while(n_--){
... | /*#include <iostream>
unsigned long long int func(unsigned long long int a);
unsigned long long answ[1000000000];
int main(){
unsigned long long int n;
while(std::cin >> n, n){
unsigned long long int ans = 0;
unsigned long long int n_=n;
while(n_--){
... | [["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 154 | 2 |
#include <stdio.h>
int main(void) {
int i;
char ans[10];
while (scanf("%d", &i), i) {
sprintf(ans, "%o", i);
for (i = 0; i < 10; i++) {
if (ans[i] == 0)
break;
if (ans[i] >= 4)
ans[i]++;
if (ans[i] >= 6)
ans[i]++;
}
printf("%s\n", ans);
}
return 0;
} | #include <stdio.h>
int main(void) {
int i;
char ans[10];
while (scanf("%d", &i), i) {
sprintf(ans, "%o", i);
for (i = 0; i < 10; i++) {
if (ans[i] == '\0')
break;
if (ans[i] >= '4')
ans[i]++;
if (ans[i] >= '6')
ans[i]++;
}
printf("%s\n", ans);
}
retu... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 104], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 44]] | 1 | 114 | 8 |
#include <bits/stdc++.h>
#define INF (1 << 29)
#define all(c) (c).begin(), (c).end()
#define pb(c) push_back(c)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int getv(int x) {
if (x = 4)
return 5;
return (x < 4) ? x : x + 2;
}
void convert(int n) {
if (n = 0)
... | #include <bits/stdc++.h>
#define INF (1 << 29)
#define all(c) (c).begin(), (c).end()
#define pb(c) push_back(c)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int getv(int x) {
if (x == 4)
return 5;
return (x < 4) ? x : x + 2;
}
void convert(int n) {
if (n == 0... | [["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 141 | 4 |
#include <cstdio>
int a[] = {0, 1, 2, 3, 5, 7, 8, 9};
int b;
long long retans(int bef) {
if (bef < 8) {
return a[bef];
} else {
long long ans = a[bef % 8];
ans += retans(bef / 8) * 10;
return ans;
}
}
int main() {
for (;;) {
scanf("%d", &b);
if (b == 0) {
break;
} else {
... | #include <cstdio>
int a[] = {0, 1, 2, 3, 5, 7, 8, 9};
int b;
long long retans(int bef) {
if (bef < 8) {
return a[bef];
} else {
long long ans = a[bef % 8];
ans += retans(bef / 8) * 10;
return ans;
}
}
int main() {
for (;;) {
scanf("%d", &b);
if (b == 0) {
break;
} else {
... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 133 | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<char, int> P;
char buf[11];
int main() {
int n;
while (scanf("%d", &n), n) {
sprintf(buf, "%o", n);
rep(i, strlen(buf)) {
if (buf[i] >= '5')
buf[i]++;
if (buf[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<char, int> P;
char buf[11];
int main() {
int n;
while (scanf("%d", &n), n) {
sprintf(buf, "%o", n);
rep(i, strlen(buf)) {
if (buf[i] >= '5')
buf[i] += 2;
if (bu... | [["-", 8, 9, 0, 57, 64, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 107], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13]] | 1 | 128 | 3 |
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
unsigned n;
while (cin >> n, n) {
int b = 1;
long long m = 0;
while (n) {
m += b * (n % 8);
n /= 8;
b *= 10;
}
stringstream ss;
string s;
ss << m;
ss >> s;
ss.str("");
... | #include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
long long n;
while (cin >> n, n) {
int b = 1;
long long m = 0;
while (n) {
m += b * (n % 8);
n /= 8;
b *= 10;
}
stringstream ss;
string s;
ss << m;
ss >> s;
ss.str("");
... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 215 | 3 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<string> v(8);
string s;
int n, i;
for (i = 0; i < 8; i++)
v[i] = '0' + i + (i >= 4) + (i >= 6);
while (cin >> n, n) {
s = "";
while (n > 0) {
s += v[n % 8];
n /= 8;
}
reverse(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<string> v(8);
string s;
int n, i;
for (i = 0; i < 8; i++)
v[i] = '0' + i + (i >= 4) + (i >= 5);
while (cin >> n, n) {
s = "";
while (n > 0) {
s += v[n % 8];
n /= 8;
}
reverse(... | [["-", 0, 11, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 12, 13]] | 1 | 129 | 2 |
#include <iostream>
using namespace std;
int main() {
int a[5], cnt[3];
while (1) {
cin >> a[0];
if (a[0] == 0)
break;
for (int i = 1; i < 5; i++)
cin >> a[i];
for (int i = 0; i < 3; i++)
cnt[i] = 0;
for (int i = 0; i < 5; i++)
cnt[a[i] - 1]++;
if ((cnt[0] > 0... | #include <iostream>
using namespace std;
int main() {
int a[5], cnt[3];
while (1) {
cin >> a[0];
if (a[0] == 0)
break;
for (int i = 1; i < 5; i++)
cin >> a[i];
for (int i = 0; i < 3; i++)
cnt[i] = 0;
for (int i = 0; i < 5; i++)
cnt[a[i] - 1]++;
if ((cnt[0] > 0... | [["-", 31, 16, 31, 16, 12, 16, 31, 69, 28, 22], ["+", 31, 16, 31, 16, 12, 16, 31, 69, 28, 22], ["-", 51, 16, 31, 16, 12, 16, 31, 69, 28, 22], ["+", 51, 16, 31, 16, 12, 16, 31, 69, 28, 22], ["-", 15, 339, 51, 16, 12, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 16, 31, 69, 28, 22]] | 1 | 352 | 6 |
#include <algorithm>
#include <iostream>
#include <map>
#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++)
using namespace std;
int main() {
int t;
while (cin >> t && t) {
vector<int> v;
v.push_back(t);
rep(i, 4) {
... | #include <algorithm>
#include <iostream>
#include <map>
#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++)
using namespace std;
int main() {
int t;
while (cin >> t && t) {
vector<int> v;
v.push_back(t);
rep(i, 4) {
... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 294 | 2 |
#include <iostream>
using namespace std;
int main() {
while (true) {
int a[5];
int f[4] = {0};
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0 && a[i] == 0) {
return 0;
}
f[a[i]]++;
}
if (f[1] > 0 && f[2] > 0 && f[3] > 0 || f[1] > 5 || f[2] > 5 || f[3] > 5) {
... | #include <iostream>
using namespace std;
int main() {
while (true) {
int a[5];
int f[4] = {0};
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (i == 0 && a[i] == 0) {
return 0;
}
f[a[i]]++;
}
if (f[1] > 0 && f[2] > 0 && f[3] > 0 || f[1] > 4 || f[2] > 4 || f[3] > 4) {
... | [["-", 51, 16, 31, 16, 31, 16, 12, 16, 12, 13], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 12, 13], ["-", 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 | 312 | 6 |
#include <iostream>
using namespace std;
int main() {
int hand[5];
bool handbe[3];
bool isdraw;
while (1) {
isdraw = false;
handbe[0] = false;
handbe[1] = false;
handbe[2] = false;
cin >> hand[0];
if (hand[0] == 0)
break;
handbe[hand[0] - 1] = true;
for (int i = 1; i < 5... | // rock//
#include <iostream>
using namespace std;
int main() {
int hand[5];
bool handbe[3];
bool isdraw;
while (1) {
isdraw = false;
handbe[0] = false;
handbe[1] = false;
handbe[2] = false;
cin >> hand[0];
if (hand[0] == 0)
break;
handbe[hand[0] - 1] = true;
for (int i ... | [["-", 12, 23, 0, 41, 15, 16, 12, 23, 0, 24], ["-", 15, 16, 12, 23, 0, 16, 31, 23, 0, 24], ["-", 15, 16, 12, 23, 0, 16, 31, 23, 0, 25], ["-", 0, 41, 15, 16, 12, 23, 0, 16, 17, 109], ["-", 0, 41, 15, 16, 12, 23, 0, 16, 12, 13], ["-", 12, 23, 0, 41, 15, 16, 12, 23, 0, 25]] | 1 | 280 | 6 |
#include <iostream>
#include <vector>
using namespace std;
void solve(vector<int> &a) {
int f[3] = {};
int s[] = {0, 1, 2};
int t[] = {1, 2, 1};
for (int i = 0; i < a.size(); i++) {
f[a[i] - 1] = 1;
}
if ((f[0] + f[1] + f[2]) % 2 == 1)
for (int i = 0; i < 5; i++)
cout << "3\n";
else
fo... | #include <iostream>
#include <vector>
using namespace std;
void solve(vector<int> &a) {
int f[3] = {};
int s[] = {0, 1, 2};
int t[] = {1, 2, 0};
for (int i = 0; i < a.size(); i++) {
f[a[i] - 1] = 1;
}
if ((f[0] + f[1] + f[2]) % 2 == 1)
for (int i = 0; i < 5; i++)
cout << "3\n";
else
fo... | [["-", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13]] | 1 | 313 | 2 |
#include <iostream>
using namespace std;
int a, b, c, d, e, x[4], f;
int main() {
while (true) {
x[0] = 0;
x[1] = 0;
x[2] - 0;
x[3] - 0;
cin >> a;
if (a == 0) {
break;
}
x[a]++;
cin >> b >> c >> d >> e;
x[b]++;
x[c]++;
x[d]++;
x[e]++;
if (x[1] >= 1 && x[2]... | #include <iostream>
using namespace std;
int a, b, c, d, e, x[4], f;
int main() {
while (true) {
x[0] = 0;
x[1] = 0;
x[2] = 0;
x[3] = 0;
cin >> a;
if (a == 0) {
break;
}
x[a]++;
cin >> b >> c >> d >> e;
x[b]++;
x[c]++;
x[d]++;
x[e]++;
if (x[1] >= 1 && x[2]... | [["-", 0, 52, 8, 9, 0, 1, 0, 16, 17, 33], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32]] | 1 | 490 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define X real()
#define Y imag()
#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))
#d... | #include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define X real()
#define Y imag()
#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))
#d... | [["+", 0, 16, 31, 66, 28, 23, 0, 27, 17, 29], ["-", 0, 16, 12, 16, 31, 23, 0, 16, 17, 72], ["-", 0, 16, 12, 16, 31, 23, 0, 16, 12, 13], ["-", 12, 23, 0, 16, 12, 16, 31, 23, 0, 25], ["+", 51, 16, 12, 23, 0, 16, 12, 23, 0, 25]] | 1 | 597 | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.