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 <bits/stdc++.h>
using namespace std;
int dp[3001][3001];
int main(void) {
int N, T, S;
int A[3001], B[3001];
int i, j;
cin >> N >> T >> S;
for (i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
for (i = 0; i <= N; i++) {
for (j = 0; j <= T; j++) {
dp[i][j] = 0;
}
}
int TT;
f... | #include <bits/stdc++.h>
using namespace std;
int dp[3001][3001];
int main(void) {
int N, T, S;
int A[3001], B[3001];
int i, j;
cin >> N >> T >> S;
for (i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
for (i = 0; i <= N; i++) {
for (j = 0; j <= T; j++) {
dp[i][j] = 0;
}
}
int TT;
f... | [["-", 0, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 323 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | [["-", 31, 91, 28, 23, 0, 16, 31, 16, 17, 18], ["+", 31, 91, 28, 23, 0, 16, 31, 16, 17, 19], ["-", 15, 339, 51, 16, 31, 16, 31, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 19], ["-", 15, 339, 51, 16, 12, 16, 31, 16, 17, 72], ["-", 15, 339, 51, 16, 12, 16, 31, 16, 12, 13], ["-", 0, 16, 31, 2, 3, 4, 0, 16, 17... | 1 | 445 | 8 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T, S, M[3001] = {};
cin >> N >> T >> S;
for (int n = 0; n < N; n++) {
int mise_fun, mise_time;
cin >> mise_fun >> mise_time;
for (int t = T; t >= mise_time; t--)
if (t <= S || t >= S + mise_time)
M[t] = max... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T, S, M[3001] = {};
cin >> N >> T >> S;
for (int n = 0; n < N; n++) {
int mise_fun, mise_time;
cin >> mise_fun >> mise_time;
for (int t = T; t >= mise_time; t--)
if (t <= S || t >= S + mise_time)
M[t] = max... | [["+", 12, 66, 28, 2, 3, 4, 0, 16, 17, 72], ["+", 12, 66, 28, 2, 3, 4, 0, 16, 12, 13]] | 1 | 131 | 16 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, S;
cin >> N >> T >> S;
vector<int> A(N);
vector<int> B(N);
vector<int> dp(T + 1, 0);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
int ans = 0;
for (int n = 0; n < N; n++) {
for (... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, T, S;
cin >> N >> T >> S;
vector<int> A(N);
vector<int> B(N);
vector<int> dp(T + 1, 0);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
int ans = 0;
for (int n = 0; n < N; n++) {
for (... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 31, 69, 341, 342, 0, 16, 12, 69, 28, 22], ["+", 341, 342, 0, 16, 12, 69, 341, 342, 0, 70], ["+", 341, 342, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 341, 342, 0, 16, 12, 69, 341, 342, 0, 73]] | 1 | 203 | 19 |
#include <bits/stdc++.h>
using namespace std;
int dp[3001][3001];
int a[3001], b[3001];
int N, T, S;
int rec(int idx, int time) {
if (idx == N || time == T)
return (0);
if (~dp[idx][time])
return (dp[idx][time]);
int ret = max(rec(idx + 1, time), rec(idx, time + 1));
if ((time + b[idx] <= S || time >=... | #include <bits/stdc++.h>
using namespace std;
int dp[3001][3001];
int a[3000], b[3000];
int N, T, S;
int rec(int idx, int time) {
if (idx == N || time == T)
return (0);
if (~dp[idx][time])
return (dp[idx][time]);
int ret = max(rec(idx + 1, time), rec(idx, time + 1));
if ((time + b[idx] <= S || time >=... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 237 | 8 |
#include <algorithm>
#include <iostream>
using namespace std;
#define reps(i, j, n) for (int i = (j); i < (n); ++i)
#define rep(i, j) reps(i, 0, j)
#define INF (1 << 30)
int dp[3001][3001];
int main() {
int a[3001], b[3001];
int ans = 0, N, T, S;
cin >> N >> T >> S;
reps(i, 1, N) cin >> a[i] >> b[i];
reps(i, ... | #include <algorithm>
#include <iostream>
using namespace std;
#define reps(i, j, n) for (int i = (j); i < (n); ++i)
#define rep(i, j) reps(i, 0, j)
#define INF (1 << 30)
int dp[3001][3001];
int main() {
int a[3001], b[3001];
int ans = 0, N, T, S;
cin >> N >> T >> S;
reps(i, 1, N + 1) cin >> a[i] >> b[i];
reps... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 231 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, T, S, A, B, dp[3001];
for (int i = 0; i <= 3000; i++)
dp[i] = 0;
cin >> N >> T >> S;
for (int i = 0; i < N; i++) {
cin >> A >> B;
for (int j = T; j >= 0; j--) {
if (dp[j] == -1 || (j != S && ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, T, S, A, B, dp[3001];
for (int i = 0; i <= 3000; i++)
dp[i] = 0;
cin >> N >> T >> S;
for (int i = 0; i < N; i++) {
cin >> A >> B;
for (int j = T; j >= 0; j--) {
if (dp[j] == -1 || (j < S && j... | [["-", 31, 16, 12, 23, 0, 16, 31, 16, 17, 79], ["+", 31, 16, 12, 23, 0, 16, 31, 16, 17, 18]] | 1 | 196 | 2 |
#include <bits/stdc++.h>
using namespace std;
int N, T, S, A[3000], B[3000];
int dp[3010];
int main() {
scanf("%d%d%d", &N, &T, &S);
for (int i = 0; i < N; i++)
scanf("%d%d", &A[i], &B[i]);
for (int i = 0; i < N; i++) {
for (int j = T; j >= 0; j--) {
dp[j] = max(dp[j], dp[j]);
if (j - B[i] ... | #include <bits/stdc++.h>
using namespace std;
int N, T, S, A[3000], B[3000];
int dp[3010];
int main() {
scanf("%d%d%d", &N, &T, &S);
for (int i = 0; i < N; i++)
scanf("%d%d", &A[i], &B[i]);
for (int i = 0; i < N; i++) {
for (int j = T; j >= 0; j--) {
dp[j] = max(dp[j], dp[j]);
if (j - B[i] ... | [["+", 0, 66, 28, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 66, 28, 2, 3, 4, 0, 16, 12, 13]] | 1 | 211 | 2 |
#include <stdio.h>
int a, b, c, d[3001], e[3001], f[3001][3001], i, j, m = 0, k;
int main(void) {
scanf("%d %d %d", &a, &b, &c);
for (i = 0; i < a; i++) {
scanf("%d %d", &d[i], &e[i]);
}
for (i = 0; i <= a; i++) {
for (j = 0; j <= b; j++) {
f[i][j] = -1;
}
}
f[0][0] = 0;
for (i = 0; i < ... | #include <stdio.h>
int a, b, c, d[3001], e[3001], f[3001][3001], i, j, m = 0, k;
int main(void) {
scanf("%d %d %d", &a, &b, &c);
for (i = 0; i < a; i++) {
scanf("%d %d", &d[i], &e[i]);
}
for (i = 0; i <= a; i++) {
for (j = 0; j <= b; j++) {
f[i][j] = -1;
}
}
f[0][0] = 0;
for (i = 0; i < ... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["+", 64, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46]] | 1 | 482 | 6 |
#include <bits/stdc++.h>
#define INF (1 << 31)
//#define int long long
using namespace std;
int n, t, s, a[3005], b[3005], dp[3005];
signed main() {
cin >> n >> t >> s;
for (int i = 1; i <= n; ++i)
cin >> a[i] >> b[i];
int ans = 0;
for (int i = 1; i <= n; ++i) {
for (int j = t; 0 < j - b[i]; --j) {... | #include <bits/stdc++.h>
#define INF (1 << 31)
//#define int long long
using namespace std;
int n, t, s, a[3005], b[3005], dp[3005];
signed main() {
cin >> n >> t >> s;
for (int i = 1; i <= n; ++i)
cin >> a[i] >> b[i];
int ans = 0;
for (int i = 1; i <= n; ++i) {
for (int j = t; 0 <= j - b[i]; --j) ... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 15, 339, 51, 16, 31, 23, 0, 16, 12, 22], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 12, 22], ["-", 15, 339, 51, 16, 12, 23, 0, 16, 31, 22], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 31, 22]] | 1 | 182 | 6 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
using namespace std;
int a[100001], b[100001], dp[3001][3001];
int main(void) {
int i, j, n, s, t, max, sum, x;
scanf("%d %d %d", &n, &t, &s);
for (i = 0; i < n; i++)
scanf("%d %d", &a[i], &b[i]);
for (i = 0; i < n; i++) {
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
using namespace std;
int a[100001], b[100001], dp[3001][3001];
int main(void) {
int i, j, n, s, t, max, sum, x;
scanf("%d %d %d", &n, &t, &s);
for (i = 0; i < n; i++)
scanf("%d %d", &a[i], &b[i]);
for (i = 0; i < n; i++) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 405 | 6 |
#include <algorithm>
#include <cstdio>
using namespace std;
int n, t, s;
int markets[3001][2], dp[3001][3001];
int main() {
scanf("%d%d%d", &n, &t, &s);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &markets[i][0], &markets[i][1]);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= t; j++) {
... | #include <algorithm>
#include <cstdio>
using namespace std;
int n, t, s;
int markets[3001][2], dp[3001][3001];
int main() {
scanf("%d%d%d", &n, &t, &s);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &markets[i][0], &markets[i][1]);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= t; j++) {
... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 17, 47], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 20]] | 1 | 260 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int N, T, S;
int A[3010];
int B[3010];
int dp[3010][3010];
int main() {
cin >> N >> T >> S;
for (int i = 0; i < N; i++)
cin >> A[i] >> B[i];
for (int i = 0; i < N; i++) {
if (i > 0) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int N, T, S;
int A[3010];
int B[3010];
int dp[3010][3010];
int main() {
cin >> N >> T >> S;
for (int i = 0; i < N; i++)
cin >> A[i] >> B[i];
for (int i = 0; i < N; i++) {
if (i > 0) {
... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18]] | 1 | 339 | 2 |
#include <algorithm>
#include <cstdio>
using namespace std;
int a[3000], b[3000];
int dp[5000];
int main() {
int n, t, s;
scanf("%d%d%d", &n, &t, &s);
for (int i = 0; i < n; i++)
scanf("%d%d", &a[i], &b[i]);
int res = 0;
for (int i = 0; i < n; i++) {
for (int j = t - b[i]; j >= 0; j--) {
if (i >... | #include <algorithm>
#include <cstdio>
using namespace std;
int a[3000], b[3000];
int dp[5000];
int main() {
int n, t, s;
scanf("%d%d%d", &n, &t, &s);
for (int i = 0; i < n; i++)
scanf("%d%d", &a[i], &b[i]);
int res = 0;
for (int i = 0; i < n; i++) {
for (int j = t - b[i]; j >= 0; j--) {
if (j <... | [["-", 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, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 31, 22], ["-", 15, 339, 51, 16, 12, 16, 12, 1... | 1 | 206 | 10 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
class Market {
public:
int time;
int cost;
Market() {}
Market(int _time, int _cost) {
time = _time;
cost = _cost;
}
};
int n, t, s;
vector<Market> market;
const int INF = 1000000;
int dp[3001][3001];
void debug() {
... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
class Market {
public:
int time;
int cost;
Market() {}
Market(int _time, int _cost) {
time = _time;
cost = _cost;
}
};
int n, t, s;
vector<Market> market;
const int INF = 1000000;
int dp[3001][3001];
void debug() {
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 3, 4, 0, 69, 341, 342, 0, 16, 17, 33], ["-", 3, 4, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 564 | 4 |
#include <algorithm>
#include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, T, S;
scanf("%d%d%d", &n, &T, &S);
int a[3000], b[3000];
rep(i, n) scanf("%d%d", a + i, b + i);
static int dp[3001][3001];
rep(i, n + 1) dp[0][i] = 0;
for (int t = 1; t <= T;... | #include <algorithm>
#include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, T, S;
scanf("%d%d%d", &n, &T, &S);
int a[3000], b[3000];
rep(i, n) scanf("%d%d", a + i, b + i);
// dp[t][i+1] := ( 時刻 t で夜店 0..i だけを考えたときの満足度 )
static int dp[3001][3001];
rep... | [["-", 0, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 286 | 2 |
// AOJ 0574
#include <iostream>
#include <map>
#define REP(i, x) for (int i = 0; i < (x); i++)
#define TRI(a, b) nails[1 + (((a)-1) * ((a) + 4)) / 2 + 1 + (b)]
using namespace std;
typedef pair<int, int> P;
const int NMAX = 5008;
int nails[NMAX * (NMAX + 1) / 2];
int N, M;
void put(int a, int b, int x) {
TRI(a, b... | // AOJ 0574
#include <iostream>
#include <map>
#define REP(i, x) for (int i = 0; i < (x); i++)
#define TRI(a, b) nails[1 + (((a)-1) * ((a) + 4)) / 2 + 1 + (b)]
using namespace std;
typedef pair<int, int> P;
const int NMAX = 5008;
int nails[NMAX * (NMAX + 1) / 2];
int N, M;
void put(int a, int b, int x) {
TRI(a, b... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 407 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int N, M;
int dp[5010][5010];
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a, b, x;
cin >> a >> b >> x;
dp[a - 1][b - 1] = max(dp[a - 1][b - 1], x + 1);
}
for (int i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int N, M;
int dp[5010][5010];
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a, b, x;
cin >> a >> b >> x;
dp[a - 1][b - 1] = max(dp[a - 1][b - 1], x + 1);
}
for (int i... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 264 | 8 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int member = in.nextInt();
int sum, cnt = 0;
int[][] num = new int[member][3];
for (int i = 0; i < member; i++) {
for (int j = 0; j < 3; j++) {
num[i][j] = in.... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int member = in.nextInt();
int sum, cnt = 0;
int[][] num = new int[member][3];
for (int i = 0; i < member; i++) {
for (int j = 0; j < 3; j++) {
num[i][j] = in.... | [["-", 64, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 0, 57, 15, 15, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 15, 0, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 15, 0, 16, 12, 16, 12, 499], ["+", 0, 7, 8, 196, 0, 57, 64, 196, 0, 46], ["-", 0, 7, 8, 196, 0, 7, 8, 196, 0, 46]] | 3 | 285 | 6 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
// INPUT
int n = sc.nextInt();
if (2 > n && n < 200)
System.exit(-1);
int[][] arr = new int[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
// INPUT
int n = sc.nextInt();
if (2 > n && n < 200)
System.exit(-1);
int[][] arr = new int[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
... | [["-", 0, 1, 0, 11, 31, 504, 516, 504, 71, 22], ["+", 0, 1, 0, 11, 31, 504, 516, 504, 71, 22]] | 3 | 346 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int n, i, k, j, o, flag = 0;
scanf("%d", &n);
int data[n][3], copy_data[n][3], sum[n];
for (i = 0; i < n; i++) {
sum[i] = 0;
for (k = 0; k < 3; k++) {
scanf("%d", &data[i][k]);
}
}
for (i = 0; i < n; i++) {
for (k = 0; k < 3; k++) {
... | #include <math.h>
#include <stdio.h>
int main() {
int n, i, k, j, o, flag = 0;
scanf("%d", &n);
int data[n][3], copy_data[n][3], sum[n];
for (i = 0; i < n; i++) {
sum[i] = 0;
for (k = 0; k < 3; k++) {
scanf("%d", &data[i][k]);
}
}
for (i = 0; i < n; i++) {
for (k = 0; k < 3; k++) {
... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 287 | 2 |
#include <stdio.h>
int main() {
int n, i, j, k, flag = 0;
scanf("%d\n", &n);
int score[n][3];
int result[n][3];
for (i = 0; i < n; i++) {
scanf("%d %d %d\n", &score[n][0], &score[n][1], &score[n][2]);
}
for (i = 0; i < n; i++) {
for (k = 0; k < 3; k++) {
for (j = 0; j < n; j++) {
if ... | #include <stdio.h>
int main() {
int n, i, j, k, flag = 0;
scanf("%d\n", &n);
int score[n][3];
int result[n][3];
for (i = 0; i < n; i++) {
scanf("%d %d %d\n", &score[i][0], &score[i][1], &score[i][2]);
}
for (i = 0; i < n; i++) {
for (k = 0; k < 3; k++) {
for (j = 0; j < n; j++) {
if ... | [["-", 3, 4, 0, 66, 28, 69, 28, 69, 71, 22], ["+", 3, 4, 0, 66, 28, 69, 28, 69, 71, 22]] | 0 | 262 | 6 |
#include <stdio.h>
#include <string.h>
int main(void) {
int number = 0;
int i = 0;
int j = 0;
int input_first[200] = {0};
int input_second[200] = {0};
int input_third[200] = {0};
int check_num = 0;
int result[200];
int count = 0;
scanf("%d", &number);
while (i < number) {
scanf("%d", &inpu... | #include <stdio.h>
#include <string.h>
int main(void) {
int number = 0;
int i = 0;
int j = 0;
int input_first[200] = {0};
int input_second[200] = {0};
int input_third[200] = {0};
int check_num = 0;
int result[200] = {0};
int count = 0;
scanf("%d", &number);
while (i < number) {
scanf("%d",... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 0 | 403 | 4 |
#include <stdio.h>
#include <string.h>
int main(void) {
int number = 0;
int i = 0;
int j = 0;
int input_first[200] = {0};
int input_second[200] = {0};
int input_third[200] = {0};
int check_num = 0;
int result[200];
int count = 0;
scanf("%d", &number);
while (i < number) {
scanf("%d", &inpu... | #include <stdio.h>
#include <string.h>
int main(void) {
int number = 0;
int i = 0;
int j = 0;
int input_first[200] = {0};
int input_second[200] = {0};
int input_third[200] = {0};
int check_num = 0;
int result[200] = {0};
int count = 0;
scanf("%d", &number);
while (i < number) {
scanf("%d",... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 0 | 442 | 4 |
#include <stdio.h>
int main(void) {
int n, p[200][3], t[200], i, j, k, flg;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d", &p[i][0], &p[i][1], &p[i][2]);
t[i] = 0;
}
for (i = 0; i < 3; i++) {
for (j = 0; j < n; i++) {
flg = 1;
for (k = 0; k < n; k++) {
if (p[j][i]... | #include <stdio.h>
int main(void) {
int n, p[200][3], t[200], i, j, k, flg;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d", &p[i][0], &p[i][1], &p[i][2]);
t[i] = 0;
}
for (i = 0; i < 3; i++) {
for (j = 0; j < n; j++) {
flg = 1;
for (k = 0; k < n; k++) {
if (p[j][i]... | [["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22]] | 0 | 230 | 2 |
/*??°???????????????(Unique number)*/
#include <stdio.h>
int main() {
int i, k, l, x, N;
int data[200][3];
int sum[200];
scanf("%d", &N);
for (i = 0; i < N; i++) {
for (k = 0; k < 3; k++) {
scanf("%d", &data[i][k]);
}
}
for (i = 0; i < N; i++) {
for (k = 0; k < 3; k++) {
x = 0;
... | /*??°???????????????(Unique number)*/
#include <stdio.h>
int main() {
int i, k, l, x, N;
int data[200][3];
int sum[200] = {0};
scanf("%d", &N);
for (i = 0; i < N; i++) {
for (k = 0; k < 3; k++) {
scanf("%d", &data[i][k]);
}
}
for (i = 0; i < N; i++) {
for (k = 0; k < 3; k++) {
x = ... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 0 | 219 | 4 |
#include <stdio.h>
int main() {
int n, i, j, k;
int sub[200][3], score[200][3], total[200] = {0};
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < 3; j++) {
scanf("%d", sub[i][j]);
score[i][j] = sub[i][j];
}
}
for (i = 0; i < 3; i++) {
for (j = 0; j < n; j++) {
for... | #include <stdio.h>
int main() {
int n, i, j, k;
int sub[200][3], score[200][3], total[200] = {0};
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < 3; j++) {
scanf("%d", &sub[i][j]);
score[i][j] = sub[i][j];
}
}
for (i = 0; i < 3; i++) {
for (j = 0; j < n; j++) {
fo... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 260 | 1 |
#include <stdio.h>
int main(void) {
int a[3][201] = {0};
int b[222] = {0};
int c[3][1001] = {0};
int n, i, j, x, y;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < 3; j++) {
scanf("%d", &a[j][i]);
c[j][a[j][i]]++;
}
}
for (i = 0; i < 3; i++) {
for (j = 0; j < n; j++) {... | #include <stdio.h>
int main(void) {
int a[3][201] = {0};
int b[222] = {0};
int c[3][1001] = {0};
int n, i, j, x, y;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < 3; j++) {
scanf("%d", &a[j][i]);
c[j][a[j][i]]++;
}
}
for (i = 0; i < 3; i++) {
for (j = 0; j < n; j++) {... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18]] | 0 | 218 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int num, a[200][3], i, j, score[200], h, k;
scanf("%d", &num);
for (i = 0; i < num; i++) {
for (j = 0; j < 3; j++)
scanf("%d", &a[i][j]);
score[i] = 0;
}
for (i = 0; i < 3; i++) {
for (j = 0; j < num; j++) {
h = 0;
for (k = 0; k ... | #include <math.h>
#include <stdio.h>
int main() {
int num, a[200][3], i, j, score[200], h, k;
scanf("%d", &num);
for (i = 0; i < num; i++) {
for (j = 0; j < 3; j++)
scanf("%d", &a[i][j]);
score[i] = 0;
}
for (i = 0; i < 3; i++) {
for (j = 0; j < num; j++) {
h = 0;
for (k = 0; k ... | [["+", 0, 57, 15, 23, 0, 16, 31, 69, 0, 70], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 0, 73], ["+", 15, 23, 0, 16, 12, 69, 28, 69, 0, 73], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 0, 70], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 71, 22]] | 0 | 220 | 6 |
#include <stdio.h>
int main(void) {
int input[200][3];
int N, i, j;
scanf("%d", &N); //人数を入力
for (i = 0; i < N; i++)
scanf("%d%d%d", &input[i][0], &input[i][1], &input[i][2]);
for (i = 0; i < N; i++) {
int hantei[3] = {1, 1, 1};
for (j = 1; j < N; j++) {
if (i != j) {
if (input[i... | #include <stdio.h>
int main(void) {
int input[200][3];
int N, i, j;
scanf("%d", &N); //人数を入力
for (i = 0; i < N; i++)
scanf("%d%d%d", &input[i][0], &input[i][1], &input[i][2]);
for (i = 0; i < N; i++) {
int hantei[3] = {1, 1, 1};
for (j = 0; j < N; j++) {
if (i != j) {
if (input[i... | [["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13]] | 1 | 260 | 2 |
#include <stdio.h>
int main(void) {
int n;
int i, j;
int a[1000], b[1000], c[1000];
int a1[1000], b1[1000], c1[1000];
int sum[1000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d", &a[i], &b[i], &c[i]);
a1[i] = a[i];
b1[i] = b[i];
c1[i] = c[i];
}
for (i = 0; i < n; i++) {... | #include <stdio.h>
int main(void) {
int n;
int i, j;
int a[1000], b[1000], c[1000];
int a1[1000], b1[1000], c1[1000];
int sum[1000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d", &a[i], &b[i], &c[i]);
a1[i] = a[i];
b1[i] = b[i];
c1[i] = c[i];
}
for (i = 0; i < n; i++) {... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32]] | 1 | 293 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int result[200] = {0};
int main() {
int member;
cin >> member;
int time1[200], time2[200], time3[200];
for (int i = 0; i < member; i++) {
cin >> time1[i] >> time2[i] >> time3[i];
}
int sign[200] = {0};
for (int i = 0; i... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int result[200] = {0};
int main() {
int member;
cin >> member;
int time1[200], time2[200], time3[200];
for (int i = 0; i < member; i++) {
cin >> time1[i] >> time2[i] >> time3[i];
}
int sign[200] = {0};
for (int i = 0; i... | [["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 107]] | 1 | 355 | 6 |
#include <iostream>
using namespace std;
int a[1000], b[1000], c[1000], p[3][1000];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> p[j][i];
}
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 1000; j++)
a[j] = 0;
for (int j = 0; j... | #include <iostream>
using namespace std;
int a[1000], b[1000], c[1000], p[3][1000];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> p[j][i];
}
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 1000; j++)
a[j] = 0;
for (int j = 0; j... | [["-", 8, 9, 0, 57, 64, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 107], ["+", 0, 57, 64, 1, 0, 11, 12, 69, 28, 22], ["+", 64, 1, 0, 11, 12, 69, 341, 342, 0, 70], ["+", 64, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 64, 1, 0, 11, 12, 69, 341, 342, 0, 73]] | 1 | 220 | 6 |
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[200][3], cnt[101][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cnt[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
int s;
cin >> s;
a[i][j] =... | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[200][3], cnt[101][3];
for (int i = 0; i < 101; i++) {
for (int j = 0; j < 3; j++) {
cnt[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
int s;
cin >> s;
a[i][j]... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 210 | 2 |
#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
const int N = 222;
int main() {
int n;
cin >> n;
int board[N][3] = {0};
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> board[i][j];
}
}
int ans[N] = {0};
for (int i = 0; i < 3; i++) {
... |
#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
const int N = 222;
int main() {
int n;
cin >> n;
int board[N][3] = {0};
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> board[i][j];
}
}
int ans[N] = {0};
for (int i = 0; i < 3; i++) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 225 | 2 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typed... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typed... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 481 | 2 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 273 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, h = 0, h1 = 0, h2 = 0;
cin >> n;
int ans[n], p[n], p1[n], p2[n];
for (int i = 0; i < n; i++)
ans[i] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
if (j == 0)
cin >> p[i];
else if (j == 1)
cin >>... | #include <iostream>
using namespace std;
int main() {
int n, h = 0, h1 = 0, h2 = 0;
cin >> n;
int ans[n], p[n], p1[n], p2[n];
for (int i = 0; i < n; i++)
ans[i] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
if (j == 0)
cin >> p[i];
else if (j == 1)
cin >>... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 366 | 2 |
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int po[201][3], a[201] = {0};
int ch[101][3];
memset(ch, 0, sizeof(ch));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> po[i][j];
ch[j][po[i][j]]++;
}
}
for (int i = 0; i < ... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int po[201][3], a[201] = {0};
int ch[3][101];
memset(ch, 0, sizeof(ch));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> po[i][j];
ch[j][po[i][j]]++;
}
}
for (int i = 0; i < ... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 203 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, game[201][3], flg, sum[201];
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> game[i][j];
}
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < n; j++) {
flg = 0;
for (int k = j + 1; k < n; k... | #include <iostream>
using namespace std;
int main() {
int n, game[201][3], flg, sum[201] = {};
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> game[i][j];
}
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < n; j++) {
flg = 0;
for (int k = j + 1; k <... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 1 | 254 | 3 |
N = gets.to_i
arr = Array.new(){ Array.new() }
score = Array.new(N) { |i| i=0 }
while (line = gets) do
arr << line.split.map(&:to_i)
end
arr = arr.transpose
arr.each_with_index { |a,n| a.each_with_index { |num, i| a.delete_at(i); score[i] += num if !a.index(num); a.insert(i, num) }}
p score | N = gets.to_i
arr = Array.new(){ Array.new() }
score = Array.new(N) { |i| i=0 }
while (line = gets) do
arr << line.split.map(&:to_i)
end
arr = arr.transpose
arr.each_with_index { |a,n| a.each_with_index { |num, i| a.delete_at(i); score[i] += num if !a.index(num); a.insert(i, num) }}
puts score | [["-", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]] | 4 | 111 | 2 |
n = int(input())
lst = [list(map(int,input().split())) for i in range(n)]
p = [0 for i in range(n)]
for i in range(3):
dic = [[] for _ in range(101)]
for j in range(n):
print(lst)
dic[lst[j][i]].append(j)
for x in range(101):
l = dic[x]
if lst:
if len(l) == 1:
p[l[0]] += x
for i in ... | n = int(input())
lst = [list(map(int,input().split())) for i in range(n)]
p = [0 for i in range(n)]
for i in range(3):
dic = [[] for _ in range(101)]
for j in range(n):
dic[lst[j][i]].append(j)
for x in range(101):
l = dic[x]
if lst:
if len(l) == 1:
p[l[0]] += x
for i in p:
print(i)
| [["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 137 | 4 |
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.... | import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.... | [["-", 0, 57, 15, 15, 0, 16, 31, 492, 500, 22], ["+", 0, 57, 15, 15, 0, 16, 31, 492, 500, 22], ["-", 0, 57, 15, 15, 0, 16, 12, 492, 500, 22], ["+", 0, 57, 15, 15, 0, 16, 12, 492, 500, 22]] | 3 | 862 | 8 |
// include----------------------------------------------------------------------------------------------------------------------
#include <bits/stdc++.h>
// using
// namespace--------------------------------------------------------------------------------------------------------------
using namespace std;
// define---... | // include----------------------------------------------------------------------------------------------------------------------
#include <bits/stdc++.h>
// using
// namespace--------------------------------------------------------------------------------------------------------------
using namespace std;
// define---... | [["-", 0, 57, 64, 9, 0, 43, 49, 50, 51, 146], ["+", 0, 57, 64, 9, 0, 43, 49, 50, 51, 147], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 146], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 618 | 6 |
#include <iostream>
#include <string>
int main() {
int n;
std::cin >> n;
std::string str;
std::cin >> str;
int res = 0;
for (int i = 0; i < n; i++) {
std::string sign;
std::cin >> sign;
for (int j = 0; j < sign.size(); j++) {
if (sign[j] == str[0]) {
for (int k = j + 1; k < s... | #include <iostream>
#include <string>
int main() {
int n;
std::cin >> n;
std::string str;
std::cin >> str;
int res = 0;
for (int i = 0; i < n; i++) {
std::string sign;
std::cin >> sign;
for (int j = 0; j < sign.size(); j++) {
if (sign[j] == str[0]) {
for (int k = j + 1; k < s... | [["-", 15, 339, 51, 16, 12, 16, 12, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 16, 12, 69, 28, 22]] | 1 | 228 | 2 |
#include <stdio.h>
#include <string.h>
int main(void) {
int N;
char shop_name[100];
char old_board[200];
int cut_i, cut_j, cut_k;
int count;
int board_num;
int len;
int shop_len;
int hantei1, hantei2;
scanf("%d", &N);
scanf("%s", shop_name);
shop_len = strlen(shop_name);
count = 0;
for (b... | #include <stdio.h>
#include <string.h>
int main(void) {
int N;
char shop_name[100];
char old_board[200];
int cut_i, cut_j, cut_k;
int count;
int board_num;
int len;
int shop_len;
int hantei1, hantei2;
scanf("%d", &N);
scanf("%s", shop_name);
shop_len = strlen(shop_name);
count = 0;
for (b... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 230 | 2 |
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
char storeName[25 + 1];
cin >> storeName;
int storeNameLen = strlen(storeName);
int canMake = 0;
for (int i = 0; i < n; i++) {
char board[100 + 1];
cin >> board;
... | #include <iostream>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
char storeName[25 + 1];
cin >> storeName;
int storeNameLen = strlen(storeName);
int canMake = 0;
for (int i = 0; i < n; i++) {
char board[100 + 1];
cin >> board;
... | [["-", 0, 7, 8, 9, 0, 57, 15, 339, 0, 25], ["-", 0, 7, 8, 9, 0, 57, 64, 93, 0, 94], ["-", 0, 7, 8, 9, 0, 57, 64, 93, 0, 35], ["-", 64, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["-", 0, 7, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106]] | 1 | 371 | 6 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vec... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vec... | [["-", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22], ["-", 0, 1, 0, 11, 12, 2, 63, 118, 28, 22], ["+", 0, 1, 0, 11, 12, 2, 63, 118, 28, 22]] | 1 | 266 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, c = 0, ans = 0;
int count = 0, cou = 0;
string name, prob, newname;
cin >> n;
cin >> name;
for (int i = 0; i < n; i++) {
cin >> prob;
int flag = 0;
for (int e = 0; e < prob.size(); e++) {
c = 0;
for (... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, c = 0, ans = 0;
int count = 0, cou = 0;
string name, prob, newname;
cin >> n;
cin >> name;
for (int i = 0; i < n; i++) {
cin >> prob;
int flag = 0;
for (int e = 0; e < prob.size(); e++) {
c = 0;
for (... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 223 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string name;
string board;
int count = 0;
cin >> n >> name;
for (int i = 0; i < n; i++) {
cin >> board;
bool x = 0;
for (int j = 0; j < board.size() && !x; j++) {
if (name[0] == board[j]) {
for (int k... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string name;
string board;
int count = 0;
cin >> n >> name;
for (int i = 0; i < n; i++) {
cin >> board;
bool x = 0;
for (int j = 0; j < board.size() && !x; j++) {
if (name[0] == board[j]) {
for (int k... | [["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 214 | 2 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1e9;
int MOD = 1e9 + 7;
main() {
int N, cnt = 0;
string S, T;
cin >> N >> S;
for (int i = 0; i < N; i++) {
cin >> T;
int c = 2;
for (int j = 0; j < T.length(); j++) {
if (S[0] != T[j])
continue;
for (in... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1e9;
int MOD = 1e9 + 7;
main() {
int N, cnt = 0;
string S, T;
cin >> N >> S;
for (int i = 0; i < N; i++) {
cin >> T;
int c = 2;
for (int j = 0; j < T.length(); j++) {
if (S[0] != T[j])
continue;
for (in... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 246 | 2 |
//============================================================================
// Name : AOL.cpp
// Author : Akari Fujii
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#in... | //============================================================================
// Name : AOL.cpp
// Author : Akari Fujii
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#in... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 0, 57, 15, 339, 51, 16, 12, 91, 17, 111], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79]] | 1 | 235 | 7 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int ans = 0;
bool flag;
string target;
string instr;
cin >> N;
cin >> target;
for (int i = 0; i < N; ++i) {
cin >> instr;
for (int j = 0; j < (int)instr.size(); ++j) {
if (target[0] != instr[j])
cont... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int ans = 0;
bool flag;
string target;
string instr;
cin >> N;
cin >> target;
for (int i = 0; i < N; ++i) {
cin >> instr;
for (int j = 0; j < (int)instr.size(); ++j) {
if (target[0] != instr[j])
cont... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 213 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72]] | 1 | 271 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
#define ll long long int
struct ST {
ll x1, x2;
ll y1, y2;
ll z1, z2;
};
ll x[100 + 10] = {0};
ll y[100 + 10] = {0};
ll z[100 + 10] = {0};
ll area = 0;
int main() {
ST fish[50 + 10];
int n, k;
int i, j;
int xi, yi, zi;
int cnt = 0;
... | #include <algorithm>
#include <iostream>
using namespace std;
#define ll long long int
struct ST {
ll x1, x2;
ll y1, y2;
ll z1, z2;
};
ll x[100 + 10] = {0};
ll y[100 + 10] = {0};
ll z[100 + 10] = {0};
ll area = 0;
int main() {
ST fish[50 + 10];
int n, k;
int i, j;
int xi, yi, zi;
int cnt = 0;
... | [["-", 15, 339, 51, 16, 12, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 16, 31, 69, 28, 22]] | 1 | 545 | 2 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int coun[105][105][105];
vector<int> x, y, z;
int rx[52][2], ry[52][2], rz[52][2];
int n, m;
int compress1(int x1[52], int x2[52]) {
for (int i = 0; i < n; i++) {
x.push_back(x1[i]);
x.push_back(x2[i]);
}
sort(x.begin(), x.end(... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int coun[105][105][105];
vector<int> x, y, z;
int rx[52][2], ry[52][2], rz[52][2];
int n, m;
int compress1(int x1[52], int x2[52]) {
for (int i = 0; i < n; i++) {
x.push_back(x1[i]);
x.push_back(x2[i]);
}
sort(x.begin(), x.end(... | [["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22]] | 1 | 1,021 | 2 |
def main():
n, k = map(int, input().split())
plst = []
xlst = []
ylst = []
dlst = []
for i in range(n):
x1,y1,d1,x2,y2,d2 = map(int, input().split())
plst.append((x1,y1,d1,x2,y2,d2))
xlst.append(x1)
xlst.append(x2)
ylst.append(y1)
ylst.append(y2)
dlst.append(d1)
dlst.ap... | def main():
n, k = map(int, input().split())
plst = []
xlst = []
ylst = []
dlst = []
for i in range(n):
x1,y1,d1,x2,y2,d2 = map(int, input().split())
plst.append((x1,y1,d1,x2,y2,d2))
xlst.append(x1)
xlst.append(x2)
ylst.append(y1)
ylst.append(y2)
dlst.append(d1)
dlst.ap... | [["-", 0, 1, 0, 662, 12, 206, 206, 657, 17, 33], ["+", 0, 1, 0, 662, 12, 206, 206, 657, 17, 72]] | 5 | 490 | 6 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_N 60
#define MAX_K 3
#define MAX_D 6
#define MAX_C 4096
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int dp[MAX_N][MAX_N][MAX_K + 1][MAX_C];
int x[MAX_N][MAX_N];
int h, w, K, a;
cha... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_N 60
#define MAX_K 3
#define MAX_D 6
#define MAX_C 4096
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int dp[MAX_N][MAX_N][MAX_K + 1][MAX_C];
int x[MAX_N][MAX_N];
int h, w, K, a;
cha... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 1,649 | 2 |
import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReade... | import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReade... | [["-", 8, 196, 0, 57, 64, 196, 0, 116, 0, 117], ["+", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94]] | 3 | 326 | 2 |
import java.util.*;
public class Main {
private static int check(int[] lines) {
if (lines[0] + lines[1] <= lines[2]) {
return 0;
}
for (int i = 0, i_len = lines.length; i < i_len; i += 1) {
lines[i] *= lines[i];
}
if (lines[0] + lines[1] > lines[2]) {
return 1;
} else if (... | import java.util.*;
public class Main {
private static int check(int[] lines) {
if (lines[0] + lines[1] <= lines[2]) {
return 0;
}
for (int i = 0, i_len = lines.length; i < i_len; i += 1) {
lines[i] *= lines[i];
}
if (lines[0] + lines[1] == lines[2]) {
return 1;
} else if ... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 60], ["-", 0, 57, 75, 57, 15, 15, 0, 16, 17, 60], ["+", 0, 57, 75, 57, 15, 15, 0, 16, 17, 47]] | 3 | 349 | 4 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] len_list = new int[3];
int[] triangles = new int[3];
while (true) {
for (int i = 0; i < 3; i++) {
int len = sc.nextInt();
le... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] len_list = new int[3];
int[] triangles = new int[3];
while (true) {
for (int i = 0; i < 3; i++) {
int len = sc.nextInt();
le... | [["-", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 3, 4, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 3, 4, 0, 16, 31, 16, 31, 16, 12, 22]] | 3 | 260 | 4 |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
class Main {
public static void main(String[] a) {
int sankaku = 0;
int eikaku = 0;
int donkaku = 0;
int cyokkaku = 0;
int maximum, middle, minimal;
int[] hen = new int[3];
BufferedReader ... | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
class Main {
public static void main(String[] a) {
int sankaku = 0;
int eikaku = 0;
int donkaku = 0;
int cyokkaku = 0;
int maximum, middle, minimal;
int[] hen = new int[3];
BufferedReader ... | [["-", 0, 57, 15, 15, 0, 16, 31, 16, 17, 19], ["+", 0, 57, 15, 15, 0, 16, 31, 16, 17, 20]] | 3 | 509 | 2 |
#include <stdio.h>
int main(void) {
int a, b, c;
int s = 0, p = 0, cnt = 0, count = 0;
int i = 0;
int j;
int t;
while (scanf("%d%d%d", &a, &b, &c) != EOF) {
if (c > a)
t = a, a = c, c = t;
if (b > a)
t = a, a = b, b = t;
if (a < b + c) {
s++;
if (a * a == b * b + c * c)
... | #include <stdio.h>
int main(void) {
int a, b, c;
int s = 0, p = 0, cnt = 0, count = 0;
int i = 0;
int j;
int t;
while (scanf("%d%d%d", &a, &b, &c) != EOF) {
if (c > a)
t = a, a = c, c = t;
if (b > a)
t = a, a = b, b = t;
if (a < b + c) {
s++;
if (a * a == b * b + c * c)
... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 75, 76, 0, 93, 0, 35]] | 0 | 173 | 3 |
#include <stdio.h>
int multi(int ar[3]) {
int i;
for (i = 0; i < 3; i++) {
ar[i] = ar[i] * ar[i];
}
}
int main() {
int cnt = 0, cnt_a = 0, cnt_b = 0, cnt_c = 0;
while (1) {
int array[3];
int temp, i, j;
for (i = 0; i < 3; i++) {
scanf("%d", &array[i]);
}
for (i = 0; i < 2; i+... | #include <stdio.h>
int multi(int ar[3]) {
int i;
for (i = 0; i < 3; i++) {
ar[i] = ar[i] * ar[i];
}
}
int main() {
int cnt = 0, cnt_a = 0, cnt_b = 0, cnt_c = 0;
while (1) {
int array[3];
int temp, i, j;
for (i = 0; i < 3; i++) {
scanf("%d", &array[i]);
}
for (i = 0; i < 2; i+... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 309 | 4 |
#include <stdio.h>
int main() {
int a[3], b, i, j, e = 0, f = 0, g = 0, h = 0;
while (scanf("%d %d %d", &a[0], &a[1], &a[2]) != EOF) {
for (i = 0; i < 2; i++) {
for (j = i + 1; j < 3; j++) {
if (a[i] < a[j]) {
b = a[i];
a[i] = a[j];
a[j] = b;
}
}
}
... | #include <stdio.h>
int main() {
int a[3], b, i, j, e = 0, f = 0, g = 0, h = 0;
while (scanf("%d %d %d", &a[0], &a[1], &a[2]) != EOF) {
for (i = 0; i < 2; i++) {
for (j = i + 1; j < 3; j++) {
if (a[i] < a[j]) {
b = a[i];
a[i] = a[j];
a[j] = b;
}
}
}
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["-", 0, 52, 8, 9, 0, 57, 64, 116, 0, 117], ["+", 0, 52, 8, 9, 0, 57, 64, 93, 0, 94]] | 0 | 254 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i+... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i+... | [["-", 64, 1, 0, 27, 28, 69, 341, 342, 0, 13], ["+", 64, 1, 0, 27, 28, 69, 341, 342, 0, 13], ["-", 0, 1, 0, 27, 28, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 27, 28, 69, 341, 342, 0, 13]] | 1 | 347 | 6 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | [["-", 0, 1, 0, 27, 28, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 27, 28, 69, 341, 342, 0, 13]] | 1 | 250 | 4 |
#include <bits/stdc++.h>
#define sqr(x) ((x) * (x))
using namespace std;
int a[3], p, q, r;
int main() {
ios::sync_with_stdio(false);
while (cin >> a[0] >> a[1] >> a[2]) {
sort(a, a + 3);
if (a[0] + a[1] <= a[2])
break;
if (sqr(a[0]) + sqr(a[1]) == sqr(a[2]))
p++;
else if (sqr(a[0]) + sq... | #include <bits/stdc++.h>
#define sqr(x) ((x) * (x))
using namespace std;
int a[3], p, q, r;
int main() {
ios::sync_with_stdio(false);
while (cin >> a[0] >> a[1] >> a[2]) {
sort(a, a + 3);
if (a[0] + a[1] <= a[2])
break;
if (sqr(a[0]) + sqr(a[1]) == sqr(a[2]))
p++;
else if (sqr(a[0]) + sq... | [["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 180 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
a = b = c = 0;
while (1) {
int k[3];
for (int d = 0; d < 3; d++)
cin >> k[d];
sort(k, k + 3);
if (k[0] + k[1] <= k[2]) {
printf("%d %d %d %d\n", a + b + c, b, a,... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
a = b = c = 0;
while (1) {
int k[3];
for (int d = 0; d < 3; d++)
cin >> k[d];
sort(k, k + 3);
if (k[0] + k[1] <= k[2]) {
printf("%d %d %d %d\n", a + b + c, b, a,... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 175 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#def... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#def... | [["-", 8, 9, 0, 57, 75, 76, 0, 116, 0, 117], ["+", 8, 9, 0, 57, 75, 76, 0, 93, 0, 94]] | 1 | 300 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int e[3];
int cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0;
while (cin >> e[0] >> e[1] >> e[2]) {
sort(e, e + 3);
int a = e[0], b = e[1], m = e[2];
if (m < a + b) {
++cnt1;
if (m * m < a * a + b * b)
++cnt3;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int e[3];
int cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0;
while (cin >> e[0] >> e[1] >> e[2]) {
sort(e, e + 3);
int a = e[0], b = e[1], m = e[2];
if (m < a + b) {
++cnt1;
if (m * m < a * a + b * b)
++cnt3;
... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 75, 76, 0, 93, 0, 35]] | 1 | 168 | 3 |
#include <iostream>
using namespace std;
typedef unsigned int U4;
#define TRUE 1
#define FALSE 0
#define ACUTE_TRIANGLE 0
#define RIGHT_TRIANGLE 1
#define OBTUSE_TRIANGLE 2
U4 TrinagleNum = 0;
U4 AcuteTriangleNum = 0;
U4 RightTriangleNum = 0;
U4 ObtuseTriangleNum = 0;
U4 U4_TriangleCheck(U4, U4, U4);
U4 U4_TypeChec... | #include <iostream>
using namespace std;
typedef unsigned int U4;
#define TRUE 1
#define FALSE 0
#define ACUTE_TRIANGLE 0
#define RIGHT_TRIANGLE 1
#define OBTUSE_TRIANGLE 2
U4 TrinagleNum = 0;
U4 AcuteTriangleNum = 0;
U4 RightTriangleNum = 0;
U4 ObtuseTriangleNum = 0;
U4 U4_TriangleCheck(U4, U4, U4);
U4 U4_TypeChec... | [["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 22], ["-", 75, 76, 0, 57, 64, 9, 0, 37, 0, 22], ["+", 75, 76, 0, 57, 64, 9, 0, 37, 0, 22]] | 1 | 444 | 4 |
/**
*
*/
// #include {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <chrono>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include... | /**
*
*/
// #include {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <chrono>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include... | [["-", 0, 1, 0, 27, 28, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 27, 28, 69, 341, 342, 0, 13]] | 1 | 5,161 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a = 0, b = 0, c = 0;
int e[3];
while (scanf("%d%d%d", &e[0], &e[1], &e[2]) != EOF) {
sort(e, e + 3);
if (e[2] >= e[1] + e[0])
continue;
if (e[2] * e[2] == e[0] * e[0] + e[1] * e[1]... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a = 0, b = 0, c = 0;
int e[3];
while (scanf("%d%d%d", &e[0], &e[1], &e[2]) != EOF) {
sort(e, e + 3);
if (e[2] >= e[1] + e[0])
break;
if (e[2] * e[2] == e[0] * e[0] + e[1] * e[1])
... | [["-", 0, 52, 8, 9, 0, 57, 64, 116, 0, 117], ["+", 0, 52, 8, 9, 0, 57, 64, 93, 0, 94]] | 1 | 224 | 2 |
/**
* File : JOI_2005_triangle_types.cpp
* Author : Kazune Takahashi
* Created : 2018-3-8 21:20:52
* Powered by Visual Studio Code
*/
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdl... | /**
* File : JOI_2005_triangle_types.cpp
* Author : Kazune Takahashi
* Created : 2018-3-8 21:20:52
* Powered by Visual Studio Code
*/
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdl... | [["-", 31, 16, 31, 16, 12, 69, 341, 342, 0, 13], ["+", 31, 16, 31, 16, 12, 69, 341, 342, 0, 13]] | 1 | 254 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
vector<int> cnt(3, 0);
while (true) {
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(), v.end());
if (v[2] >= v[0] + v[1])
break;
if (v[2] * v[2] > v[0] * v[0] + v[1] * v[1])
cnt[2]++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
vector<int> cnt(3, 0);
while (true) {
vector<int> v(3);
cin >> v[0] >> v[1] >> v[2];
sort(v.begin(), v.end());
if (v[2] >= v[0] + v[1])
break;
if (v[2] * v[2] > v[0] * v[0] + v[1] * v[1])
cnt[2]++;
... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 17, 151], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6]] | 1 | 219 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int Length[3];
int Triangle[4] = {0};
bool flag = 0;
while (cin >> Length[0] >> Length[1] >> Length[2]) {
sort(Length, Length + 3);
if (Length[0] + Length[1] <= Length[2])
flag = 1;
if (flag == 1)
continue;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int Length[3];
int Triangle[4] = {0};
bool flag = 0;
while (cin >> Length[0] >> Length[1] >> Length[2]) {
sort(Length, Length + 3);
if (Length[0] + Length[1] <= Length[2])
flag = 1;
if (flag == 1)
continue;
... | [["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 225 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, count1 = 0, count2 = 0, count3 = 0, count4 = 0;
while (cin >> a >> b >> c) {
int ia, ib, ic, max, z;
ia = a * a;
ib = b * b;
ic = c * c;
if (ia >= ib && ia >= ic) {
if (a < b + c) {
max = ia;
ia = ic;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, count1 = 0, count2 = 0, count3 = 0, count4 = 0;
while (cin >> a >> b >> c) {
int ia, ib, ic, max, z;
ia = a * a;
ib = b * b;
ic = c * c;
if (ia >= ib && ia >= ic) {
if (a < b + c) {
max = ia;
ia = ic;
... | [["-", 8, 9, 0, 52, 8, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 52, 8, 9, 0, 93, 0, 35]] | 1 | 235 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b, c;
int ansn = 0, ans1 = 0, ans2 = 0, ans3 = 0;
while (cin >> a >> b >> c) {
if (a + b > c && b + c > a && c + a > b) {
ansn++;
if (a < b) {
int swap = a;
a = b;
b = swap;
}
if (a < c) {
in... | #include <iostream>
using namespace std;
int main() {
int a, b, c;
int ansn = 0, ans1 = 0, ans2 = 0, ans3 = 0;
while (cin >> a >> b >> c) {
if (a + b > c && b + c > a && c + a > b) {
ansn++;
if (a < b) {
int swap = a;
a = b;
b = swap;
}
if (a < c) {
in... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 183 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int hen[3];
int cnt = 0;
int d = 0;
int e = 0;
while (1) {
for (int i = 0; i < 3; i++) {
cin >> hen[i];
}
sort(hen, hen + 3);
int judge = pow(hen[0], 2) + pow(hen[1], 2);
int most = pow(hen[2], 2);
if (hen[0] + hen[1]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int hen[3];
int cnt = 0;
int d = 0;
int e = 0;
while (1) {
for (int i = 0; i < 3; i++) {
cin >> hen[i];
}
sort(hen, hen + 3);
int judge = pow(hen[0], 2) + pow(hen[1], 2);
int most = pow(hen[2], 2);
if (hen[0] + hen[1]... | [["-", 31, 16, 31, 16, 12, 16, 31, 16, 12, 22], ["-", 31, 16, 31, 16, 31, 16, 12, 16, 17, 72], ["+", 31, 16, 31, 16, 31, 16, 12, 16, 17, 72], ["+", 31, 16, 31, 16, 31, 16, 12, 16, 12, 22], ["-", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22... | 1 | 227 | 8 |
#include <algorithm>
#include <iostream>
using namespace std;
const double EPS = 1e-8;
int main() {
int v[3], ans[3], ansn = 0;
bool f = false;
fill(ans, ans + 3, 0);
while (cin >> v[0] >> v[1] >> v[2]) {
if (f)
continue;
sort(v, v + 3);
if (v[2] >= v[1] + v[0]) {
cout << ansn;
f... | #include <algorithm>
#include <iostream>
using namespace std;
const double EPS = 1e-8;
int main() {
int v[3], ans[3], ansn = 0;
bool f = false;
fill(ans, ans + 3, 0);
while (cin >> v[0] >> v[1] >> v[2]) {
if (f)
continue;
sort(v, v + 3);
if (v[2] >= v[1] + v[0]) {
cout << ansn;
f... | [["+", 8, 1, 0, 16, 31, 16, 12, 103, 0, 104], ["+", 8, 1, 0, 16, 31, 16, 12, 103, 0, 125], ["+", 64, 9, 0, 7, 8, 1, 0, 16, 17, 151]] | 1 | 260 | 4 |
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
double a, b, c;
int cnt[4];
fill(cnt, cnt + 4, 0);
while (cin >> a >> b >> c) {
double array[3];
int sum = a + b + c;
int Max = max(a, max(b, c));
int remain = sum - Max;
if (Max >= remain) {
... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
double a, b, c;
int cnt[4];
fill(cnt, cnt + 4, 0);
while (cin >> a >> b >> c) {
double array[3];
int sum = a + b + c;
int Max = max(a, max(b, c));
int remain = sum - Max;
if (Max >= remain) {
... | [["-", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 1 | 300 | 2 |
#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, 52, 8, 9, 0, 57, 64, 116, 0, 117], ["+", 0, 52, 8, 9, 0, 57, 64, 93, 0, 94]] | 1 | 397 | 6 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int length[3];
int w = 0, x = 0, y = 0, z = 0;
while (cin >> length[0] >> length[1] >> length[2]) {
sort(length, length + 3);
if (length[2] < length[0] + length[1]) {
w++;
if (pow(length[2], 2) == po... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int length[3];
int w = 0, x = 0, y = 0, z = 0;
while (cin >> length[0] >> length[1] >> length[2]) {
sort(length, length + 3);
if (length[2] < length[0] + length[1]) {
w++;
if (pow(length[2], 2) == po... | [["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 0, 57, 75, 76, 0, 9, 0, 93, 0, 94], ["+", 0, 57, 75, 76, 0, 9, 0, 93, 0, 35], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 190 | 7 |
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int a, b, c;
int na, nb, nc, nd;
na = nb = nc = nd = 0;
while (1) {
scanf("%d %d %d", &a, &b, &c);
if (a < b)
swap(a, b);
if (a < c)
swap(a, c);
if (a >= b + c)
break;
na++;
if (b * b + c * c =... | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int a, b, c;
int na, nb, nc, nd;
na = nb = nc = nd = 0;
while (1) {
scanf("%d %d %d", &a, &b, &c);
if (a < b)
swap(a, b);
if (a < c)
swap(a, c);
if (a >= b + c)
break;
na++;
if (b * b + c * c =... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 161 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)... | [["-", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22]] | 1 | 257 | 4 |
def triangle?(a, b, c)
return false if a + b <= c
true
end
sankaku = 0
eikaku = 0
chokaku = 0
donkaku = 0
end_flg = false
loop do
line = gets
if line == "\n"
break;
end
next if end_flg
a, b, c = line.split.map(&:to_i).sort
if !triangle?(a, b, c)
puts "#{sankaku} #{chok... | def triangle?(a, b, c)
return false if a + b <= c
true
end
sankaku = 0
eikaku = 0
chokaku = 0
donkaku = 0
end_flg = false
loop do
line = gets
if line == "\n"
break;
end
next if end_flg
a, b, c = line.split.map(&:to_i).sort
if !triangle?(a, b, c)
puts "#{sankaku} #{chok... | [["-", 196, 737, 8, 736, 0, 121, 75, 95, 0, 95]] | 4 | 142 | 10 |
f = True
cnt = 0
l = [0,0,0]
while f:
t = [int(s) for s in input().split()]
t.sort()
if t[0]+t[1] <= t[2]:
f = False
continue
if t[0]**2+t[1]**2 > t[2]**2:
l[0]+=1
elif t[0]**2+t[1]**2 == t[2]**2:
l[1]+=1
else:
l[2]+=1
print(sum(l),l[0],l[1],l[2])
| f = True
cnt = 0
l = [0,0,0]
while f:
t = [int(s) for s in input().split()]
t.sort()
if t[0]+t[1] <= t[2]:
f = False
break
if t[0]**2+t[1]**2 > t[2]**2:
l[0]+=1
elif t[0]**2+t[1]**2 == t[2]**2:
l[1]+=1
else:
l[2]+=1
print(sum(l),l[1],l[0],l[2])
| [["-", 8, 196, 0, 57, 64, 196, 0, 116, 0, 117], ["+", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94], ["-", 0, 1, 0, 652, 3, 4, 0, 206, 206, 612], ["+", 0, 1, 0, 652, 3, 4, 0, 206, 206, 612]] | 5 | 147 | 6 |
ans = [0 for i in range(4)]
while True:
sides = sorted([int(inp) for inp in input().split()])
if sides[2] >= sides[1] + sides[0]:
print(ans[0], ans[1], ans[2], ans[3])
break
if sides[2]**2 > sides[1]**2 + sides[0]**2:
ans[3]+=1
elif sides[2]**2 == sides[1]**2 + sides[0]**2:
ans[2]+=1
else:
... | ans = [0 for i in range(4)]
while True:
sides = sorted([int(inp) for inp in input().split()])
if sides[2] >= sides[1] + sides[0]:
print(ans[0], ans[1], ans[2], ans[3])
break
if sides[2]**2 > sides[1]**2 + sides[0]**2:
ans[3]+=1
elif sides[2]**2 == sides[1]**2 + sides[0]**2:
ans[1]+=1
else:
... | [["-", 64, 196, 0, 1, 0, 677, 31, 206, 206, 612], ["+", 64, 196, 0, 1, 0, 677, 31, 206, 206, 612], ["-", 8, 196, 0, 1, 0, 677, 31, 206, 206, 612], ["+", 8, 196, 0, 1, 0, 677, 31, 206, 206, 612]] | 5 | 145 | 4 |
r=a=o=0
while 1:
l,m,n=sorted(list(map(int,input().split())))
if l+m<=n:break
c=l*l+m*m-n*n
if c>0:a+=1
elif c<0:o+=1
else:r+=1
print(sum(r,a,o),r,a,o)
| r=a=o=0
while 1:
l,m,n=sorted(list(map(int,input().split())))
if l+m<=n:break
c=l*l+m*m-n*n
if c>0:a+=1
elif c<0:o+=1
else:r+=1
print(r+a+o,r,a,o)
| [["-", 0, 1, 0, 652, 3, 4, 0, 652, 63, 22], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 21], ["+", 0, 652, 3, 4, 0, 657, 31, 657, 17, 72], ["+", 0, 1, 0, 652, 3, 4, 0, 657, 17, 72], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 93 | 7 |
a,b,c,d = 0,0,0,0
while 1:
lng=list(map(int,input().split()))
lng.sort()
if lng[0] + lng[1] <= lng[2]:
print('%d %d %d %d' % (a,b,c,d))
break
else:
a += 1
if lng[0]**2 + lng[1]**2 == lng[2]**2:
b += 1
elif lng[0]**2 + lng[1]**2 >= lng[2]**2:
d += 1
else:
c += 1
| a,b,c,d = 0,0,0,0
while 1:
lng=list(map(int,input().split()))
lng.sort()
if lng[0] + lng[1] <= lng[2]:
print('%d %d %d %d' % (a,b,c,d))
break
else:
a += 1
if lng[0]**2 + lng[1]**2 == lng[2]**2:
b += 1
elif lng[0]**2 + lng[1]**2 <= lng[2]**2:
d += 1
else:
c += 1
| [["-", 8, 196, 0, 57, 75, 665, 15, 666, 667, 20], ["+", 8, 196, 0, 57, 75, 665, 15, 666, 667, 19]] | 5 | 133 | 2 |
# -*- coding: utf-8 -*-
import sys
from math import sqrt
def calc_triangle_type(edge_length_str):
edge_length = edge_length_str.split(" ")
edge_length = list(map(lambda x: int(x), edge_length))
edge_length_sorted = sorted(edge_length)
if edge_length_sorted[0] + edge_length_sorted[1] <= edge_length_sor... | # -*- coding: utf-8 -*-
import sys
from math import sqrt
def calc_triangle_type(edge_length_str):
edge_length = edge_length_str.split(" ")
edge_length = list(map(lambda x: int(x), edge_length))
edge_length_sorted = sorted(edge_length)
if edge_length_sorted[0] + edge_length_sorted[1] <= edge_length_sor... | [["-", 8, 196, 0, 57, 64, 196, 0, 116, 0, 117], ["+", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94]] | 5 | 228 | 2 |
t=[0]*4
while True:
try:
l=sorted(map(int,input().split()))
if l[2]>=l[1]+l[0]: continue
t[0]+=1
r=l[2]**2-(l[1]**2+l[0]**2)
if r>0: t[3]+=1
elif r<0: t[2]+=1
else: t[1]+=1
except EOFError:
break;
print(" ".join(map(str,t))) | t=[0]*4
while True:
try:
l=sorted(map(int,input().split()))
if l[2]>=l[1]+l[0]: break
t[0]+=1
r=l[2]**2-(l[1]**2+l[0]**2)
if r>0: t[3]+=1
elif r<0: t[2]+=1
else: t[1]+=1
except EOFError:
break;
print(" ".join(map(str,t))) | [["-", 8, 196, 0, 57, 64, 196, 0, 116, 0, 117], ["+", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94]] | 5 | 127 | 2 |
k=l=m=n=0
while True:
a,b,c=sorted(map(int,input().split()))
if a+b<=c:break
k+=1
if a**2+b**2<c**2:l+=1
elif a**2+b**2>c**2:n+=1
else:m+=1
print(k,l,m,n) | k=l=m=n=0
while True:
a,b,c=sorted(map(int,input().split()))
if a+b<=c:break
k+=1
if a**2+b**2>c**2:m+=1
elif a**2+b**2<c**2:n+=1
else:l+=1
print(k,l,m,n) | [["-", 0, 52, 8, 196, 0, 57, 15, 666, 667, 18], ["+", 0, 52, 8, 196, 0, 57, 15, 666, 667, 47], ["-", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22], ["-", 8, 196, 0, 57, 75, 665, 15, 666, 667, 47], ["+", 8, 196, 0, 57, 75, 665, 15, 666, 667, 18], ["-", 75, 76, 8, 196, 0, 1, 0, 677, 3... | 5 | 91 | 8 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
while (scan.hasNext()) {
int n = scan.nextInt();
int[] num = new int[n];
for (int i = 0; i < n; i++) {
num[i] = scan.nextInt();
... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
while (scan.hasNext()) {
int n = scan.nextInt();
int[] num = new int[n];
for (int i = 0; i < n; i++) {
num[i] = scan.nextInt();
... | [["-", 0, 57, 15, 15, 0, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 15, 0, 16, 12, 16, 12, 499]] | 3 | 188 | 2 |
#include <stdio.h>
int mintwo(int kouyaku1, int kouyaku2);
int minthree(int kouyaku1, int kouyaku2, int kouyaku3);
void kouyakutwo();
void kouyakuthree();
int main(void) {
int n = 0;
scanf("%d", &n);
if (n == 2) {
kouyakutwo();
} else {
kouyakuthree();
}
}
void kouyakutwo() {
int kouyaku1 = 0, ko... | #include <stdio.h>
int mintwo(int kouyaku1, int kouyaku2);
int minthree(int kouyaku1, int kouyaku2, int kouyaku3);
void kouyakutwo();
void kouyakuthree();
int main(void) {
int n = 0;
scanf("%d", &n);
if (n == 2) {
kouyakutwo();
} else {
kouyakuthree();
}
}
void kouyakutwo() {
int kouyaku1 = 0, k... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 344 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
int gcd(int m, int n) {
if (n == 0 || m == 0)
return m + n;
return gcd(n % m, m);
}
int main() {
int n;
cin >> n;
int a[3] = {};
int g;
if (n == 2) {
cin >> a[0] >> a[1];
sort(a, a + n);
g = gcd(a[0], a[1]);
for (int i = 1... | #include <algorithm>
#include <iostream>
using namespace std;
int gcd(int m, int n) {
if (n == 0 || m == 0)
return m + n;
return gcd(n % m, m);
}
int main() {
int n;
cin >> n;
int a[3] = {};
int g;
if (n == 2) {
cin >> a[0] >> a[1];
sort(a, a + n);
g = gcd(a[0], a[1]);
for (int i = 1... | [["-", 12, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 13]] | 1 | 238 | 6 |
#include <stdio.h>
int GCD(int a, int b) {
int A, B, buff;
// A >= B
if (b > a) {
A = b;
B = a;
} else {
A = a;
B = b;
}
while (A % B) {
buff = B;
B = A % B;
A = buff;
}
return B;
}
int main() {
int N, a, b, c;
int G;
int GC[100000000];
scanf("%d", &N);
if (!(N - ... | #include <stdio.h>
int GCD(int a, int b) {
int A, B, buff;
// A >= B
if (b > a) {
A = b;
B = a;
} else {
A = a;
B = b;
}
while (A % B) {
buff = B;
B = A % B;
A = buff;
}
return B;
}
int main() {
int N, a, b, c;
int G;
int GC[1000000];
scanf("%d", &N);
if (!(N - 2)... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 358 | 2 |
// Vol5 588
#include <stdio.h>
#include <string.h>
int main() {
int n, s = 0;
char c, l = '+';
while (1) {
scanf("%d", &n);
scanf("%c", &c);
if (l == '+') {
s += n;
} else if (l == '-') {
s -= n;
} else if (l == '*') {
s *= n;
} else {
s /= n;
}
l = c;
i... | // Vol5 588
#include <stdio.h>
#include <string.h>
int main() {
int n, s = 0;
char c, l = '+';
while (1) {
scanf("%d\n", &n);
scanf("%c", &c);
if (l == '+') {
s += n;
} else if (l == '-') {
s -= n;
} else if (l == '*') {
s *= n;
} else {
s /= n;
}
l = c;
... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 133 | 1 |
#include <iostream>
using namespace std;
int main() {
int n, rst;
char k;
cin >> rst;
while (1) {
cin >> k;
if (k = '=')
break;
cin >> n;
switch (k) {
case '+':
rst += n;
break;
case '-':
rst -= n;
break;
case '*':
rst *= n;
break;
case ... | #include <iostream>
using namespace std;
int main() {
int n, rst;
char k;
cin >> rst;
while (1) {
cin >> k;
if (k == '=')
break;
cin >> n;
switch (k) {
case '+':
rst += n;
break;
case '-':
rst -= n;
break;
case '*':
rst *= n;
break;
case... | [["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 107 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.