buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <stdio.h>
#define N 50
int main(void) {
int n, r;
int c[N];
int deck_A[N], deck_B[N], deck_C[N];
int i, j, k;
int len;
int last;
// input the number of cards n and the number of operations r
while (scanf("%d%d", &n, &r) != EOF) {
// input each operation c
for (i = 0; i != r; ++i) {
... | #include <stdio.h>
#define N 50
int main(void) {
int n, r;
int c[N];
int deck_A[N], deck_B[N], deck_C[N];
int i, j, k;
int len;
int last;
// input the number of cards n and the number of operations r
while (scanf("%d%d", &n, &r) != EOF) {
// input each operation c
for (i = 0; i != r; ++i) {
... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 2, 3, 4, 0, 66, 28, 69, 0, 70], ["+", 0, 2, 3, 4, 0, 66, 28, 69, 0, 73], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 25]] | 0 | 373 | 6 |
#include <stdio.h>
static const int MAX_CARD_SIZE = 52;
static const int SENTINEL = 1000;
int main(void) {
int i, j, k, t, n, r, c;
int p_a, p_b, p_c, deck_A[MAX_CARD_SIZE / 2], deck_B[MAX_CARD_SIZE / 2],
deck_C[MAX_CARD_SIZE];
while (EOF != scanf(" %d %d", &n, &r)) {
for (i = 0; i < n; i++) {
... | #include <stdio.h>
static const int MAX_CARD_SIZE = 52;
static const int SENTINEL = 1000;
int main(void) {
int i, j, k, t, n, r, c;
int p_a, p_b, p_c, deck_A[MAX_CARD_SIZE / 2], deck_B[MAX_CARD_SIZE / 2],
deck_C[MAX_CARD_SIZE];
while (EOF != scanf(" %d %d", &n, &r)) {
for (i = 0; i < n; i++) {
... | [["+", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 329 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int N, R;
while (cin >> N >> R) {
queue<int> A, B, C;
rep(i, N) { C.push(i); }
rep(_, R) {
int c;
cin >> c;
rep(i, N) {
if (N / 2 <= i)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int N, R;
while (cin >> N >> R) {
queue<int> A, B, C;
rep(i, N) { C.push(i); }
rep(_, R) {
int c;
cin >> c;
rep(i, N) {
if (N / 2 <= i)... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 98], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 106]] | 1 | 241 | 2 |
while gets
n = $_.to_i
a = gets.split.map(&:to_i).sort
s = 0
for i in 0...n
s += a[i] * n-i
end
p s
end | while gets
n = $_.to_i
a = gets.split.map(&:to_i).sort
s = 0
for i in 0...n
s += a[i] * (n-i)
end
p s
end | [["+", 8, 170, 0, 755, 12, 738, 12, 739, 0, 24], ["+", 8, 170, 0, 755, 12, 738, 12, 739, 0, 25]] | 4 | 43 | 2 |
import java.util.*;
class Main {
public static void main(String[] z) {
Scanner s = new Scanner(System.in);
for (int n, k, i; (n = s.nextInt()) > 0;) {
int[] a = new int[k = s.nextInt()];
for (i = 0; i < k; ++i)
a[i] = s.nextInt();
for (; n-- > 0;)
for (i = 0; i < k; ++i)
... | import java.util.*;
class Main {
public static void main(String[] z) {
Scanner s = new Scanner(System.in);
for (int n, k, i; (n = s.nextInt()) > 0;) {
int[] a = new int[k = s.nextInt()];
for (i = 0; i < k; ++i)
a[i] = s.nextInt();
for (; n-- > 0;)
for (i = 0; i < k; ++i)
... | [["-", 0, 492, 3, 4, 0, 510, 64, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 510, 64, 5, 0, 491], ["-", 0, 492, 3, 4, 0, 510, 75, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 510, 75, 5, 0, 491]] | 3 | 161 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
while (true) {
int n = stdIn.nextInt();
int k = stdIn.nextInt();
if (n == 0 && k == 0) {
return;
}
int[] have = new int[k];
for (int i =... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
while (true) {
int n = stdIn.nextInt();
int k = stdIn.nextInt();
if (n == 0 && k == 0) {
return;
}
int[] have = new int[k];
for (int i =... | [["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 205 | 4 |
import java.util.*;
class Main {
static void solve(int n, int k, int[] needs, int[][] wants) {
for (int i = 0; i < k; i++) {
int sum = 0;
for (int j = 0; j < n; j++) {
sum += wants[j][i];
}
if (sum > needs[i]) {
System.out.println("NO");
return;
}
}
... | import java.util.*;
class Main {
static void solve(int n, int k, int[] needs, int[][] wants) {
for (int i = 0; i < k; i++) {
int sum = 0;
for (int j = 0; j < n; j++) {
sum += wants[j][i];
}
if (sum > needs[i]) {
System.out.println("No");
return;
}
}
... | [["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 283 | 4 |
import java.util.Scanner;
public class Main {
Scanner sc;
void run() {
sc = new Scanner(System.in);
while (true) {
boolean possible = true;
int n = sc.nextInt();
int k = sc.nextInt();
if (n == 0 && k == 0) {
return;
}
int[] s = new int[k];
int[] rs = new int... | import java.util.Scanner;
public class Main {
Scanner sc;
void run() {
sc = new Scanner(System.in);
while (true) {
boolean possible = true;
int n = sc.nextInt();
int k = sc.nextInt();
if (n == 0 && k == 0) {
return;
}
int[] s = new int[k];
int[] rs = new int... | [["-", 0, 492, 3, 4, 0, 510, 64, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 510, 64, 5, 0, 491], ["-", 0, 492, 3, 4, 0, 510, 75, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 510, 75, 5, 0, 491]] | 3 | 231 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
final int N = sc.nextInt();
final int K = sc.nextInt();
if (N == 0 && K == 0) {
break;
}
int[] drinks = new int[K];
for (i... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
final int N = sc.nextInt();
final int K = sc.nextInt();
if (N == 0 && K == 0) {
break;
}
int[] drinks = new int[K];
for (i... | [["-", 0, 492, 3, 4, 0, 510, 64, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 510, 64, 5, 0, 491], ["-", 0, 492, 3, 4, 0, 510, 75, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 510, 75, 5, 0, 491]] | 3 | 193 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
int k = sc.nextInt();
if (n == 0 && k == 0)
break;
int blood[] = new int[k];
for (int i = 0; i < k; i++)
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
int k = sc.nextInt();
if (n == 0 && k == 0)
break;
int blood[] = new int[k];
for (int i = 0; i < k; i++)
... | [["-", 8, 196, 0, 503, 49, 200, 51, 5, 0, 491], ["+", 8, 196, 0, 503, 49, 200, 51, 5, 0, 491], ["-", 0, 57, 64, 1, 0, 11, 12, 5, 0, 491], ["+", 0, 57, 64, 1, 0, 11, 12, 5, 0, 491]] | 3 | 245 | 4 |
#include <stdio.h>
short rml[100];
int d, g, n, k, i, j, s[100];
int main(void) {
while (scanf("%d%d", &n, &k), (n == k && k == 0)) {
for (i = 0; i < k; i++)
scanf("%d", s + i);
for (i = 0; i < n * k; i++) {
scanf("%d", &g);
s[i % k] -= g;
if (s[i % k] < 0)
rml[d] = 1;
}
... | #include <stdio.h>
short rml[100];
int d, g, n, k, i, j, s[100];
int main(void) {
while (scanf("%d%d", &n, &k), (n != k || k)) {
for (i = 0; i < k; i++)
scanf("%d", s + i);
for (i = 0; i < n * k; i++) {
scanf("%d", &g);
s[i % k] -= g;
if (s[i % k] < 0)
rml[d] = 1;
}
d++... | [["-", 0, 34, 12, 23, 0, 16, 31, 16, 17, 60], ["+", 0, 34, 12, 23, 0, 16, 31, 16, 17, 79], ["-", 15, 23, 0, 34, 12, 23, 0, 16, 17, 98], ["+", 15, 23, 0, 34, 12, 23, 0, 16, 17, 106], ["-", 0, 34, 12, 23, 0, 16, 12, 16, 17, 60], ["-", 0, 34, 12, 23, 0, 16, 12, 16, 12, 13]] | 0 | 181 | 6 |
#include <stdio.h>
#define MAX 101
int main(void) {
int N, K, i, j, sum = 0, check;
int S[MAX], B[MAX][MAX];
while (scanf("%d %d", &N, &K)) {
if (N == 0 && K == 0)
break;
else {
for (i = 0; i < K; i++) {
scanf("%d ", &S[i]);
}
for (i = 0; i < N; i++) {
for (j = 0;... | #include <stdio.h>
#define MAX 101
int main(void) {
int N, K, i, j, sum, check;
int S[MAX], B[MAX][MAX];
while (scanf("%d %d", &N, &K)) {
if (N == 0 && K == 0)
break;
else {
for (i = 0; i < K; i++) {
scanf("%d ", &S[i]);
}
for (i = 0; i < N; i++) {
for (j = 0; j <... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 75, 76, 0, 9, 0, 1, 0, 35]] | 0 | 240 | 6 |
#include <stdio.h>
int main() {
int n, k, s[105], b[105], i, j, x;
while (1) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
break;
for (i = 0; i < k; i++)
scanf("%d", &s[i]), b[i] = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < k; j++) {
scanf("%d", &x);
b[j] += x;
... | #include <stdio.h>
int main() {
int n, k, s[105], b[105], i, j, x;
while (1) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
break;
for (i = 0; i < k; i++)
scanf("%d", &s[i]), b[i] = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < k; j++) {
scanf("%d", &x);
b[j] += x;
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 203 | 2 |
#include <stdio.h>
int main() {
int a[100];
int n, k, i, j;
for (;;) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
break;
for (i = 0; i < k; i++) {
scanf("%d", &a[i]);
}
while (n--) {
for (i = 0; i < k; i++) {
scanf("%d", &j);
a[i] -= j;
}
}
for... | #include <stdio.h>
int main() {
int a[100];
int n, k, i, j;
for (;;) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
break;
for (i = 0; i < k; i++) {
scanf("%d", &a[i]);
}
while (n--) {
for (i = 0; i < k; i++) {
scanf("%d", &j);
a[i] -= j;
}
}
for... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 174 | 4 |
k, i, j, b[999];
main(n) {
for (; scanf("%d%d", &n, &k), n; puts(b[i] < 0 ? "No" : "Yes")) {
for (i = 0; i < k;)
scanf("%d", &b[i++]);
for (; n--;)
for (j = 0; j < k; b[j++] -= i)
scanf("%d", &i);
for (i = 0; i < k - 1;)
if (b[i++] < 0)
break;
}
exit(0);
} | k, i, j, b[999];
main(n) {
for (; scanf("%d%d", &n, &k), n; puts(b[i] < 0 ? "No" : "Yes")) {
for (i = 0; i < k;)
scanf("%d", &b[i++]);
for (; n--;)
for (j = 0; j < k; b[j++] -= i)
scanf("%d", &i);
for (i = 0; i < k - 1; i++)
if (b[i] < 0)
break;
}
exit(0);
} | [["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29], ["-", 15, 23, 0, 16, 31, 69, 71, 27, 17, 29]] | 0 | 145 | 3 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int i, j, b, n, k, *blood, canMake;
while (1) {
scanf("%d %d", &n, &k);
if (!n && !k)
break;
canMake = 1;
blood = malloc(sizeof(int) * k);
scanf("%d", blood);
for (i = 1; i < k; i++)
scanf(" %d", blood + i);
for (i = 0; i <... | #include <stdio.h>
#include <stdlib.h>
int main() {
int i, j, b, n, k, *blood, canMake;
while (1) {
scanf("%d %d", &n, &k);
if (!n && !k)
break;
canMake = 1;
blood = malloc(sizeof(int) * k);
scanf("%d", blood);
for (i = 1; i < k; i++)
scanf(" %d", blood + i);
for (i = 0; i <... | [["-", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 71, 13]] | 0 | 215 | 2 |
#include <stdio.h>
#define N 100
int main() {
int i;
for (;;) {
int s[N];
int n, k;
scanf("%d%d", &n, &k);
if (!(n | k))
break;
for (i = 0; i < k; ++i) {
scanf("%d", &s[i]);
}
while (n--) {
for (i = 0; i < k; ++i) {
int b;
scanf("%d", &b);
... | #include <stdio.h>
#define N 100
int main() {
int i;
for (;;) {
int s[N];
int n, k;
scanf("%d%d", &n, &k);
if (!(n | k))
break;
for (i = 0; i < k; ++i) {
scanf("%d", &s[i]);
}
while (n--) {
for (i = 0; i < k; ++i) {
int b;
scanf("%d", &b);
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["-", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["-", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6]] | 0 | 172 | 6 |
#include <stdio.h>
int main() {
while (1) {
int N, K;
int flg = 0, i, j, S[100], B;
scanf("%d %d", &N, &K);
if (N == 0 && K == 0)
break;
for (i = 0; i < K; i++)
scanf("%d", &S[i]);
for (i = 0; i < N; i++) {
for (j = 0; j < K; j++) {
scanf("%d", &B);
S[j] -= ... | #include <stdio.h>
int main() {
while (1) {
int N, K;
int flg = 0, i, j, S[100], B;
scanf("%d %d", &N, &K);
if (N == 0 && K == 0)
break;
for (i = 0; i < K; i++)
scanf("%d", &S[i]);
for (i = 0; i < N; i++) {
for (j = 0; j < K; j++) {
scanf("%d", &B);
S[j] -= ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 181 | 4 |
#include <iostream>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < int(b); i++)
#define rep(i, b) loop(i, 0, b)
int main() {
int n, k;
while (cin >> n >> k, n | k) {
int t[110];
bool possible = true;
rep(i, 110) t[i] = 0;
rep(i, k) cin >> t[i];
rep(i, n) {
rep(j, k) {
... | #include <iostream>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < int(b); i++)
#define rep(i, b) loop(i, 0, b)
int main() {
int n, k;
while (cin >> n >> k, n | k) {
int t[110];
bool possible = true;
rep(i, 110) t[i] = 0;
rep(i, k) cin >> t[i];
rep(i, n) {
rep(j, k) {
... | [["-", 0, 1, 0, 27, 28, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 110], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 22]] | 1 | 157 | 5 |
#include <iostream>
using namespace std;
int main() {
int N, K;
while (cin >> N >> K && (N | K)) {
int S[100];
for (int i = 0; i < K; i++) {
cin >> S[i];
}
int B[100][100];
for (int i = 0; i < N; i++) {
for (int j = 0; j < K; j++) {
cin >> B[i][j];
}
}
for (i... | #include <iostream>
using namespace std;
int main() {
int N, K;
while (cin >> N >> K && (N | K)) {
int S[100];
for (int i = 0; i < K; i++) {
cin >> S[i];
}
int B[100][100];
for (int i = 0; i < N; i++) {
for (int j = 0; j < K; j++) {
cin >> B[i][j];
}
}
for (i... | [["-", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22]] | 1 | 196 | 4 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
while (cin >> N >> K && (N || K)) {
vector<int> S(K);
for (int i = 0; i < K; ++i)
cin >> S[i];
int t;
bool ok = true;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < K; ++j) {
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
while (cin >> N >> K && (N || K)) {
vector<int> S(K);
for (int i = 0; i < K; ++i)
cin >> S[i];
int t;
bool ok = true;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < K; ++j) {
... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22]] | 1 | 152 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 22]] | 1 | 291 | 2 |
#include <iostream>
using namespace std;
int n, m, x, s[100];
int main() {
while (cin >> n >> m, n + m) {
for (int i = 0; i < m; i++)
cin >> s[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
cin >> x, s[x]--;
}
int f = 1;
for (int i = 0; i < m; i++) {
if (s[... | #include <iostream>
using namespace std;
int n, m, x, s[100];
int main() {
while (cin >> n >> m, n + m) {
for (int i = 0; i < m; i++)
cin >> s[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
cin >> x, s[j] -= x;
}
int f = 1;
for (int i = 0; i < m; i++) {
if ... | [["-", 0, 34, 12, 27, 28, 69, 341, 342, 0, 22], ["+", 0, 34, 12, 11, 31, 69, 341, 342, 0, 22], ["-", 0, 7, 8, 1, 0, 34, 12, 27, 17, 68], ["+", 0, 7, 8, 1, 0, 34, 12, 11, 17, 110], ["+", 0, 7, 8, 1, 0, 34, 12, 11, 12, 22]] | 1 | 149 | 5 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#def... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#def... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 231 | 2 |
#include <iostream>
using namespace std;
int main() {
long long int N, K, S[100] = {}, a, flag = 0;
while (1) {
cin >> N >> K;
if (N == 0 && K == 0)
break;
for (int i = 0; i < K; i++) {
cin >> S[i];
}
for (int j = 0; j < N; j++) {
for (int i = 0; i < K; i++) {
cin >> a;... | #include <iostream>
using namespace std;
int main() {
long long int N, K, S[101] = {}, a, flag = 0;
while (1) {
cin >> N >> K;
if (N == 0 && K == 0)
break;
for (int i = 0; i < K; i++) {
cin >> S[i];
}
for (int j = 0; j < N; j++) {
for (int i = 0; i < K; i++) {
cin >> a;... | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15... | 1 | 182 | 8 |
#include <iostream>
using namespace std;
int main() {
int n, k, l;
while (1) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
int s[k];
int b[k];
for (int i = 0; i < k; i++) {
s[i] = 0;
b[i] = 0;
cin >> s[i];
}
for (int i = 0; i < n; i++)
for (int j = 0; j < k... | #include <iostream>
using namespace std;
int main() {
int n, k, l;
while (1) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
int s[k];
int b[k];
for (int i = 0; i < k; i++) {
s[i] = 0;
b[i] = 0;
cin >> s[i];
}
for (int i = 0; i < n; i++)
for (int j = 0; j < k... | [["-", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["-", 75, 76, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 75, 76, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 187 | 4 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, t;
while (cin >> n >> k && n || k) {
bool flag = true;
vector<int> blood(k);
for (int i = 0; i < k; i++) {
cin >> blood[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
cin >> ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, t;
while (cin >> n >> k && n || k) {
bool flag = true;
vector<int> blood(k);
for (int i = 0; i < k; i++) {
cin >> blood[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
cin >> ... | [["-", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["-", 75, 76, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 75, 76, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 149 | 4 |
#include <stdio.h>
int main() {
int fami, kind, need[100], chi[100];
int i, j, judge = 0, temp;
for (;; judge = 0) {
for (i = 0; i < 100; i++) {
need[i] = 0;
chi[i] = 0;
}
scanf("%d%d", &fami, &kind);
if (fami == 0 && kind == 0)
break;
for (i = 0; i < kind; i++)
sca... | #include <stdio.h>
int main() {
int fami, kind, need[100], chi[100];
int i, j, judge = 0, temp;
for (;; judge = 0) {
for (i = 0; i < 100; i++) {
need[i] = 0;
chi[i] = 0;
}
scanf("%d%d", &fami, &kind);
if (fami == 0 && kind == 0)
break;
for (i = 0; i < kind; i++)
sca... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 232 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, k, i, j;
int b[1012];
for (;;) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (i = 0; i < k; i++)
cin >> b[i];
int a, flag = 1;
for (i = 0; i < n; i++) {
for (j = 0; j < k; j++) {
cin >> a;
... | #include <iostream>
using namespace std;
int main() {
int n, k, i, j;
int b[1012];
for (;;) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (i = 0; i < k; i++)
cin >> b[i];
int a, flag = 1;
for (i = 0; i < n; i++) {
for (j = 0; j < k; j++) {
cin >> a;
... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22]] | 1 | 156 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (true) {
int N, K;
cin >> N >> K;
if (N == 0 && K == 0)
break;
vector<int> S(K);
for (int i = 0; i < K; i++)
cin >> S[i];
for (int i = 0; i < N; i++)
for (int j = 0; j < K; j+... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (true) {
int N, K;
cin >> N >> K;
if (N == 0 && K == 0)
break;
vector<int> S(K);
for (int i = 0; i < K; i++)
cin >> S[i];
for (int i = 0; i < N; i++)
for (int j = 0; j < K; j+... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 156 | 4 |
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int N;
int K;
int *S;
int **B;
bool calc() {
int sumB = 0;
for (int j = 0; j < K; j++) {
sumB = 0;
for (int i = 0; i < N; i++) {
sumB += B[i][j];
}
if (S[j] < sumB) {
return false;
}
}
return true... | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int N;
int K;
int *S;
int **B;
bool calc() {
int sumB = 0;
for (int j = 0; j < K; j++) {
sumB = 0;
for (int i = 0; i < N; i++) {
sumB += B[i][j];
}
if (S[j] < sumB) {
return false;
}
}
return true... | [["-", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22]] | 1 | 317 | 8 |
#include <stdio.h>
int main() {
int n, k, s[100], t;
while (true) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
break;
for (int i = 0; i < k; ++i) {
scanf("%d", &t);
s[i] = t;
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < k; ++j) {
scanf("%d", &t);
... | #include <stdio.h>
int main() {
int n, k, s[100], t;
while (true) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
break;
for (int i = 0; i < k; ++i) {
scanf("%d", &t);
s[i] = t;
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < k; ++j) {
scanf("%d", &t);
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 191 | 6 |
#include <algorithm>
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int exist[100000];
int needed[100000];
int main() {
int n, k;
while (1) {
cin >> n >> k;
if (n == 0)
break;
memset(exist, 0, sizeof(exist));
memset(needed, 0, sizeof(needed))... | #include <algorithm>
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int exist[100000];
int needed[100000];
int main() {
int n, k;
while (1) {
cin >> n >> k;
if (n == 0)
break;
memset(exist, 0, sizeof(exist));
memset(needed, 0, sizeof(needed))... | [["-", 0, 41, 64, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 41, 64, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 41, 75, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 41, 75, 16, 31, 16, 12, 5, 0, 6]] | 1 | 216 | 4 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int x, K, N;
int pre[200], rea[200];
while (cin >> N >> K, K || N) {
for (int i = 0; i < K; i++) {
rea[i] = 0;
cin >> x;
pre[i] = x;
}
for (int i = 0; i < N; i++)
for (int j = 0; j < K; j++) {
cin >... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int x, K, N;
int pre[200], rea[200];
while (cin >> N >> K, K || N) {
for (int i = 0; i < K; i++) {
rea[i] = 0;
cin >> x;
pre[i] = x;
}
for (int i = 0; i < N; i++)
for (int j = 0; j < K; j++) {
cin >... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 180 | 6 |
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
while (scanf("%d %d ", &N, &K) == 2) {
if (N == 0 && K == 0) {
break;
}
// printf("(N, K) = (%d, %d)\n", N, K);
vector<int> S(K);
for (int i = 0; i < K; i++) {
int s;
scanf("... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
while (scanf("%d %d ", &N, &K) == 2) {
if (N == 0 && K == 0) {
break;
}
// printf("(N, K) = (%d, %d)\n", N, K);
vector<int> S(K);
for (int i = 0; i < K; i++) {
int s;
scanf("... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 197 | 2 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 184 | 4 |
#include <iostream>
#include <vector>
using namespace std;
int N, K, tmp;
void solve() {
vector<int> bloods(K), family(K);
for (int i = 0; i < K; i += 1)
cin >> bloods[i];
for (int i = 0; i < N; i += 1) {
for (int j = 0; j < K; j += 1) {
cin >> tmp;
family[j] += tmp;
}
}
// calc
fo... | #include <iostream>
#include <vector>
using namespace std;
int N, K, tmp;
void solve() {
vector<int> bloods(K), family(K);
for (int i = 0; i < K; i += 1)
cin >> bloods[i];
for (int i = 0; i < N; i += 1) {
for (int j = 0; j < K; j += 1) {
cin >> tmp;
family[j] += tmp;
}
}
// calc
fo... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 198 | 4 |
#include <cstdio>
int s[110], n, m;
int main() {
int i, j, k, l;
bool pass;
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
for (i = 0; i < m; i++)
scanf("%d", &s[i]);
for (i = 0; i < n; i++)
for (j = 0; j < m; j++) {
scanf("%d", &k);
s[j] -= k;
... | #include <cstdio>
int s[110], n, m;
int main() {
int i, j, k, l;
bool pass;
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
for (i = 0; i < m; i++)
scanf("%d", &s[i]);
for (i = 0; i < n; i++)
for (j = 0; j < m; j++) {
scanf("%d", &k);
s[j] -= k;
... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 190 | 4 |
#include <iostream>
#include <vector>
using namespace std;
void solve() {
int N, K;
while (cin >> N >> K) {
if (!N && !K) {
break;
}
vector<int> S(K);
vector<vector<int>> B(N);
for (int i = 0; i < N; ++i) {
B[i].resize(K);
}
for (int i = 0; i < K; ++i) {
cin >> S[i];
... | #include <iostream>
#include <vector>
using namespace std;
void solve() {
int N, K;
while (cin >> N >> K) {
if (!N && !K) {
break;
}
vector<int> S(K);
vector<vector<int>> B(N);
for (int i = 0; i < N; ++i) {
B[i].resize(K);
}
for (int i = 0; i < K; ++i) {
cin >> S[i];
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 262 | 4 |
#include <iostream>
using namespace std;
int s[100];
int main() {
int n, k;
while (cin >> n >> k) {
if (!n && !k)
break;
bool flag = true;
for (int i = 0; i < k; i++) {
cin >> s[k];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
int a;
cin >> a;... | #include <iostream>
using namespace std;
int s[100];
int main() {
int n, k;
while (cin >> n >> k) {
if (!n && !k)
break;
bool flag = true;
for (int i = 0; i < k; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
int a;
cin >> a;... | [["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 154 | 4 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
while (cin >> n >> k, n != 0 && k != 0) {
bool flug = false;
vector<int> blood_stock(k);
for (int i = 0; i < k; i++) {
cin >> blood_stock[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
while (cin >> n >> k, n != 0 && k != 0) {
bool flug = false;
vector<int> blood_stock(k);
for (int i = 0; i < k; i++) {
cin >> blood_stock[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 180 | 4 |
#include <iostream>
#define MAX_K 110
using namespace std;
int main() {
int n, k;
while (cin >> n >> k) {
if (n == 0 && k == 0)
break;
int dx[MAX_K] = {0}, max[MAX_K] = {0};
for (int i = 0; i < k; i++) {
cin >> max[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++... | #include <iostream>
#define MAX_K 110
using namespace std;
int main() {
int n, k;
while (cin >> n >> k) {
if (n == 0 && k == 0)
break;
int dx[MAX_K] = {0}, max[MAX_K] = {0};
for (int i = 0; i < k; i++) {
cin >> max[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++... | [["-", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["-", 75, 76, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 75, 76, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 195 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, k;
int s[100];
bool f;
while (cin >> n >> k && (n || k)) {
for (int i = 0; i < k; i++)
cin >> s[i];
f = true;
for (int i = 0; i < n; i++) {
for (int j = 0, l; j < k; j++) {
cin >> l;
s[k] -= l;
if (s[... | #include <iostream>
using namespace std;
int main() {
int n, k;
int s[100];
bool f;
while (cin >> n >> k && (n || k)) {
for (int i = 0; i < k; i++)
cin >> s[i];
f = true;
for (int i = 0; i < n; i++) {
for (int j = 0, l; j < k; j++) {
cin >> l;
s[j] -= l;
if (s[... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22]] | 1 | 149 | 4 |
#include <stdio.h>
int main() {
int N, K;
int S[100];
int B;
int count;
int h = 1;
int i, j;
scanf("%d %d", &N, &K);
while ((N != 0) && (K != 0)) {
h = 1;
for (i = 0; i < K; i++) {
scanf("%d", &S[i]);
}
for (i = 0; i < N; i++) {
for (j = 0; j < K; j++) {
scanf("%... | #include <stdio.h>
int main() {
int N, K;
int S[100];
int B;
int count;
int h = 1;
int i, j;
scanf("%d %d", &N, &K);
while ((N != 0) && (K != 0)) {
h = 1;
for (i = 0; i < K; i++) {
scanf("%d", &S[i]);
}
for (i = 0; i < N; i++) {
for (j = 0; j < K; j++) {
scanf("%... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 16, 31, 69, 341, 342, 0, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22]] | 1 | 206 | 6 |
#include <stdio.h>
bool check(int m, int k) {
int blood[101];
int eats[101] = {0};
for (int i = 0; i < k; i++)
scanf("%d", &blood[i]);
for (int i = 0; i < m; i++) {
for (int j = 0; j < k; j++) {
int temp;
scanf("%d", &temp);
eats[j] += temp;
}
}
for (int i = 0; i < k; i++)
... | #include <stdio.h>
bool check(int m, int k) {
int blood[101];
int eats[101] = {0};
for (int i = 0; i < k; i++)
scanf("%d", &blood[i]);
for (int i = 0; i < m; i++) {
for (int j = 0; j < k; j++) {
int temp;
scanf("%d", &temp);
eats[j] += temp;
}
}
for (int i = 0; i < k; i++)
... | [["-", 0, 41, 64, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 41, 64, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 41, 75, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 41, 75, 2, 3, 4, 0, 5, 0, 6]] | 1 | 205 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int N, K, S[100];
int main() {
while (true) {
scanf("%d %d", &N, &K);
if (N == 0 && K == 0)
break;
for (int i = 0; i < K; ++i) {
scanf("%d", S + i);
}
for (int i = 0; ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int N, K, S[100];
int main() {
while (true) {
scanf("%d %d", &N, &K);
if (N == 0 && K == 0)
break;
for (int i = 0; i < K; ++i) {
scanf("%d", S + i);
}
for (int i = 0; ... | [["-", 31, 66, 28, 2, 3, 4, 0, 16, 12, 22], ["+", 31, 66, 28, 2, 3, 4, 0, 16, 12, 22]] | 1 | 169 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
while (cin >> N >> K) {
if (N == 0 && K == 0)
break;
int S[K];
for (int i = 0; i < K; i++) {
cin >> S[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < K; j++) {
int b;
cin... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
while (cin >> N >> K) {
if (N == 0 && K == 0)
break;
int S[K];
for (int i = 0; i < K; i++) {
cin >> S[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < K; j++) {
int b;
cin... | [["-", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6], ["+", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6], ["-", 64, 9, 0, 1, 0, 11, 12, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 11, 12, 5, 0, 6], ["-", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 1 | 167 | 6 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int N, K;
int S[101];
int B;
while (cin >> N >> K) {
if (N == 0 && K == 0)
break;
bool flag = 1;
for (int i = 0; i < K; i++) {
cin >> S[i];
}
for (int i = 0; i < N; i++) {
for (in... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int N, K;
int S[101];
int B;
while (cin >> N >> K) {
if (N == 0 && K == 0)
break;
bool flag = 1;
for (int i = 0; i < K; i++) {
cin >> S[i];
}
for (int i = 0; i < N; i++) {
for (in... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22]] | 1 | 160 | 2 |
// 58
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
for (int N, K; cin >> N >> K, N | K;) {
int s[100];
for (int i = 0; i < K; i++) {
cin >> s[i];
}
bool fail = false;
for (int i = 0; i < N; i++) {
for (int j = 0; j < K; j++) {
int b;
cin ... | // 58
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
for (int N, K; cin >> N >> K, N | K;) {
int s[100];
for (int i = 0; i < K; i++) {
cin >> s[i];
}
bool fail = false;
for (int i = 0; i < N; i++) {
for (int j = 0; j < K; j++) {
int b;
cin ... | [["-", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 151 | 4 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <st... | [["-", 0, 52, 15, 339, 51, 34, 12, 16, 17, 98], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 106], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 334 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n, k;
int s[111];
while (cin >> n >> k && n) {
for (int i = 0; i < k; i++) {
cin >> s[i];
}
for (int j = 0; j < n; j++) {
for (int i = 0; i < k; i++) {
int b;
cin >> b;
s[i] -= b;
... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n, k;
int s[111];
while (cin >> n >> k && n) {
for (int i = 0; i < k; i++) {
cin >> s[i];
}
for (int j = 0; j < n; j++) {
for (int i = 0; i < k; i++) {
int b;
cin >> b;
s[i] -= b;
... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 163 | 2 |
#include <stdio.h>
int s[100];
int main() {
int n, k;
int i, j;
while (1) {
scanf("%d %d", &n, &k);
if (n == 0)
return 0;
for (i = 0; i < k; i++)
scanf("%d", &s[i]);
for (i = 0; i < n; i++) {
for (j = 0; j < k; j++) {
int x;
scanf("%d", &x);
s[j] -= x;
... | #include <stdio.h>
int s[100];
int main() {
int n, k;
int i, j;
while (1) {
scanf("%d %d", &n, &k);
if (n == 0)
return 0;
for (i = 0; i < k; i++)
scanf("%d", &s[i]);
for (i = 0; i < n; i++) {
for (j = 0; j < k; j++) {
int x;
scanf("%d", &x);
s[j] -= x;
... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 175 | 4 |
#include <stdio.h>
main() {
int N, K, blood[101], family[101], tmp, i, j, x;
while (1) {
scanf("%d %d", &N, &K);
if (N == 0 && K == 0)
break;
tmp = 1;
for (i = 0; i < K; i++)
scanf("%d", &blood[i]);
for (i = 0; i < N; i++) {
for (j = 0; j < K; j++) {
scanf("%d", &x);
... | #include <stdio.h>
main() {
int N, K, blood[101], family[101], tmp, i, j, x;
while (1) {
scanf("%d %d", &N, &K);
if (N == 0 && K == 0)
break;
tmp = 1;
for (i = 0; i < K; i++)
scanf("%d", &blood[i]);
for (i = 0; i < N; i++) {
for (j = 0; j < K; j++) {
scanf("%d", &x);
... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 174 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, k;
while (cin >> n >> k, n | k) {
bool ok = true;
int r[100], tmp;
for (int i = 0; i < k; i++)
cin >> r[i];
for (int j = 0; j < n; j++) {
for (int i = 0; i < k; i++) {
cin >> tmp;
r[i] -= t... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, k;
while (cin >> n >> k, n | k) {
bool ok = true;
int r[100], tmp;
for (int i = 0; i < k; i++)
cin >> r[i];
for (int j = 0; j < n; j++) {
for (int i = 0; i < k; i++) {
cin >> tmp;
r[i] -= t... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 148 | 4 |
loop do
n, k = gets.split.map(&:to_i)
break if n == 0
s, ans = gets.split.map(&:to_i), "Yes"
n.times do
b = gets.split.map(&:to_i)
k.times do |i|
s[i] -= b[i]
ans = "No" if s[i] < 0
end
end
p ans
end | loop do
n, k = gets.split.map(&:to_i)
break if n == 0
s, ans = gets.split.map(&:to_i), "Yes"
n.times do
b = gets.split.map(&:to_i)
k.times do |i|
s[i] -= b[i]
ans = "No" if s[i] < 0
end
end
puts ans
end | [["-", 0, 652, 196, 737, 8, 736, 0, 652, 735, 22], ["+", 0, 652, 196, 737, 8, 736, 0, 652, 735, 22]] | 4 | 85 | 2 |
while gets
n,k = $_.split.map(&:to_i)
break if n == 0
l = gets.split.to_a.map(&:to_i)
n.times do
m = gets.split.to_a.map(&:to_i)
k.times do |i|
l[i] -= m[i]
end
end
puts l.all?{|i| i >= 0} ? "yes" : "no"
end | while gets
n,k = $_.split.map(&:to_i)
break if n == 0
l = gets.split.to_a.map(&:to_i)
n.times do
m = gets.split.to_a.map(&:to_i)
k.times do |i|
l[i] -= m[i]
end
end
puts l.all?{|i| i >= 0} ? "Yes" : "No"
end | [["-", 0, 652, 3, 4, 0, 754, 64, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 754, 64, 557, 0, 6], ["-", 0, 652, 3, 4, 0, 754, 75, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 754, 75, 557, 0, 6]] | 4 | 89 | 14 |
loop{
n,k = gets.split.map(&:to_i)
if n == 0 and k == 0 then
break
end
s = gets.split.map(&:to_i)
n.times do
s = gets.split.each_with_index.map{|b,i| (s[i] - b.to_i())}
end
print s.all?{|a| a >= 0} ? "YES" : "NO"
print "\n"
} | loop{
n,k = gets.split.map(&:to_i)
if n == 0 and k == 0 then
break
end
s = gets.split.map(&:to_i)
n.times do
s = gets.split.each_with_index.map{|b,i| (s[i] - b.to_i())}
end
print s.all?{|a| a >= 0} ? "Yes" : "No"
print "\n"
} | [["-", 0, 652, 3, 4, 0, 754, 64, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 754, 64, 557, 0, 6], ["-", 0, 652, 3, 4, 0, 754, 75, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 754, 75, 557, 0, 6]] | 4 | 95 | 4 |
import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
static int[] vx = new int[] {0, 1, 0, -1};
static int[] vy = new int[] {1, 0, -1, 0};
static int[] Y = new int[] {0, 0, 0, 1, 1, 1, 2, 2, 2};
static int[] X = new int[] {0, 1, 2, 0, 1, 2, 0, 1, 2};
public st... | import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
static int[] vx = new int[] {0, 1, 0, -1};
static int[] vy = new int[] {1, 0, -1, 0};
static int[] Y = new int[] {0, 0, 0, 1, 1, 1, 2, 2, 2};
static int[] X = new int[] {0, 1, 2, 0, 1, 2, 0, 1, 2};
public st... | [["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 44]] | 3 | 523 | 1 |
#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)... | [["+", 0, 57, 64, 1, 0, 11, 12, 16, 17, 48], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 12, 13]] | 1 | 423 | 2 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
typedef long double ld;
const int EMPTY = 0;
const int BATTERY = 1;
const int STORE = 2;
const int WALL = 3;
struct Point {
public:
int x, y;
Point() {}
Point(int x, int y) : x(x... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
typedef long double ld;
const int EMPTY = 0;
const int BATTERY = 1;
const int STORE = 2;
const int WALL = 3;
struct Point {
public:
int x, y;
Point() {}
Point(int x, int y) : x(x... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78], ["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 13], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0,... | 1 | 594 | 8 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
pii get_pos(int x) { return pii(x / 3, x % 3); }
bool inField(int x, int y) { return (0 <= x && x < 3 && 0 <= y && y < 3); }
int main() {
int N;
while (cin >> N, N) {
string S = "ABCDEFGHI";
char a[3];
for (int i = 0; i < 3; ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
pii get_pos(int x) { return pii(x / 3, x % 3); }
bool inField(int x, int y) { return (0 <= x && x < 3 && 0 <= y && y < 3); }
int main() {
int N;
while (cin >> N, N) {
string S = "ABCDEFGHI";
char a[3];
for (int i = 0; i < 3; ... | [["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 85], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 404 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int N;
while (cin >> N, N) {
char s, t, b;
cin >> s >> t >> b;
int sx, sy;
sx = (s - 'A') / 3;
sy = (s - 'A') % 3;
int tx, ty;
tx = (t - 'A') / 3;
ty = (t - 'A') % 3;
int bx, by;
bx = (b -... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int N;
while (cin >> N, N) {
char s, t, b;
cin >> s >> t >> b;
int sx, sy;
sx = (s - 'A') / 3;
sy = (s - 'A') % 3;
int tx, ty;
tx = (t - 'A') / 3;
ty = (t - 'A') % 3;
int bx, by;
bx = (b -... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22]] | 1 | 465 | 4 |
#include <iostream>
using namespace std;
string intersection(string tree1, string tree2);
string tunion(string tree1, string tree2);
int camma_pos(string tree);
int camma_pos(string tree) {
int i, camma_p;
int braket = 0;
for (i = 0; i < tree.size(); i++) {
if (tree[i] == '(') {
braket++;
} else i... | #include <iostream>
using namespace std;
string intersection(string tree1, string tree2);
string tunion(string tree1, string tree2);
int camma_pos(string tree);
int camma_pos(string tree) {
int i, camma_p;
int braket = 0;
for (i = 0; i < tree.size(); i++) {
if (tree[i] == '(') {
braket++;
} else i... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 558 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#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)
#define pb push_back
#... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#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)
#define pb push_back
#... | [["-", 0, 69, 28, 69, 341, 342, 0, 16, 31, 13], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 31, 22]] | 1 | 785 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int dp[100005][3];
void solve(string s1, string s2) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 0;
dp[0][1] = 1000;
dp[0][2] = 1000;
for (int i = 0; i < s1.size(); i += 2) {
if ((s1[i] == 'Y' || s1[i + 1] == 'Y') &&
... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int dp[100005][3];
void solve(string s1, string s2) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 0;
dp[0][1] = 1000;
dp[0][2] = 1000;
for (int i = 0; i < s1.size(); i += 2) {
if ((s1[i] == 'Y' || s1[i + 1] == 'Y') &&
... | [["-", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 12, 16, 31, 2, 3, 4, 0, 16, 12, 13], ["+", 12, 16, 31, 2, 3, 4, 0, 16, 12, 13]] | 1 | 879 | 8 |
#include <algorithm>
#include <iostream>
using namespace std;
const int INF = 100000000;
int n, dp[3][10002], t;
bool input[2][10002];
int cost[3][3][4] = {{{1, 2, 4, 4}, {2, 2, 3, 3}, {3, 3, 3, 3}},
{{2, 2, 3, 3}, {1, 2, 2, 3}, {2, 3, 2, 3}},
{{3, 3, 3, 3}, {2, 3, 2, 3}, {1... | #include <algorithm>
#include <iostream>
using namespace std;
const int INF = 100000000;
int n, dp[3][10002], t;
bool input[2][10002];
int cost[3][3][4] = {{{1, 2, 4, 4}, {2, 2, 3, 3}, {3, 3, 3, 3}},
{{2, 2, 3, 3}, {1, 2, 2, 3}, {2, 3, 2, 3}},
{{3, 3, 3, 3}, {2, 3, 2, 3}, {1... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 449 | 2 |
#include <iostream>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
string s[2];
{
string t;
cin >> t;
s[0] = 'N' + t.substr(0, 2 * n) + 'N';
s[1] = 'N' + t.substr(2 * n) + 'N';
}
vector<vector<int>> dp(2, vector<int>(n + 1));
if (s[1][0] == 'Y') {
dp[0][0] =... | #include <iostream>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
string s[2];
{
string t;
cin >> t;
s[0] = 'N' + t.substr(0, 2 * n) + 'N';
s[1] = 'N' + t.substr(2 * n) + 'N';
}
vector<vector<int>> dp(2, vector<int>(n + 1));
if (s[1][1] == 'Y') {
dp[0][0] =... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 13], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 13]] | 1 | 672 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int q;
cin >> q;
for (int loop = 0; loop < q; loop++) {
int n;
string str;
cin >> n;
cin >> str;
vector<vector<bool>> field(2, vector<bool>(n + 1, false)... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int q;
cin >> q;
for (int loop = 0; loop < q; loop++) {
int n;
string str;
cin >> n;
cin >> str;
vector<vector<bool>> field(2, vector<bool>(n + 1, false)... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 48]] | 1 | 335 | 2 |
pre = [
((0, 1, 2), (1, 0, 1), (2, 1, 0)),
((3, 2, 2), (2, 1, 1), (2, 1, 1)),
((1, 1, 2), (1, 1, 2), (2, 2, 3)),
((3, 2, 2), (2, 2, 2), (2, 2, 3)),
]
q = int(input())
for _ in range(q):
n = int(input())
books = [c == 'Y' for c in input()]
books = [(False, False)] + list(map(lambda u, l: (u,... | pre = [
((0, 1, 2), (1, 0, 1), (2, 1, 0)),
((3, 2, 2), (2, 1, 1), (2, 1, 1)),
((1, 1, 2), (1, 1, 2), (2, 2, 3)),
((3, 2, 2), (2, 2, 2), (2, 2, 3)),
]
q = int(input())
for _ in range(q):
n = int(input())
books = [c == 'Y' for c in input()]
books = [(False, False)] + list(map(lambda u, l: (u,... | [["-", 8, 196, 0, 1, 0, 662, 12, 634, 0, 612], ["+", 8, 196, 0, 1, 0, 662, 12, 634, 0, 612]] | 5 | 295 | 47 |
import java.util.Scanner;
public class Main {
String str[][] = {{" "},
{"'", ",", ".", "!", "?"},
{"a", "b", "c", "A", "B", "C"},
{"d", "e", "f", "D", "E", "F"},
{"g", "h", "i", "G", "H", "I"},
{"j", "k", "l", "J", "K... | import java.util.Scanner;
public class Main {
String str[][] = {{" "},
{"'", ",", ".", "!", "?"},
{"a", "b", "c", "A", "B", "C"},
{"d", "e", "f", "D", "E", "F"},
{"g", "h", "i", "G", "H", "I"},
{"j", "k", "l", "J", "K... | [["-", 8, 196, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 196, 0, 7, 15, 16, 12, 16, 12, 499]] | 3 | 510 | 2 |
import java.util.Scanner;
class Main {
private static void solve() {
final Scanner scanner = new Scanner(System.in);
final char[][] keymap = {null,
{',', ',', '.', '!', '?'},
{'a', 'b', 'c', 'A', 'B', 'A'},
{'d', 'e', 'f',... | import java.util.Scanner;
class Main {
private static void solve() {
final Scanner scanner = new Scanner(System.in);
final char[][] keymap = {null,
{'\'', ',', '.', '!', '?'},
{'a', 'b', 'c', 'A', 'B', 'C'},
{'d', 'e', 'f'... | [["-", 0, 503, 49, 200, 51, 518, 0, 518, 0, 252], ["+", 0, 503, 49, 200, 51, 518, 0, 518, 0, 252]] | 3 | 351 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String one = ",,.,!?";
String two = "abcABC";
String three = "defDEF";
String four = "ghiGHI";
String five = "jklJKL";
String six = "mnoMNO";
String seven = "p... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String one = "',.,!?";
String two = "abcABC";
String three = "defDEF";
String four = "ghiGHI";
String five = "jklJKL";
String six = "mnoMNO";
String seven = "p... | [["-", 8, 196, 0, 503, 49, 200, 51, 5, 0, 491], ["+", 8, 196, 0, 503, 49, 200, 51, 5, 0, 491]] | 3 | 421 | 2 |
// Aizu Vol-10 1003: Extraordinary Girl II
// 2017.8.18 bal4u@uu
#include <stdio.h>
char *gets();
char tbl[10][8] = {{0},
{'\'', ',', '.', '!', '?'},
{'a', 'b', 'c', 'A', 'B', 'C'},
{'d', 'e', 'f', 'D', 'E', 'F'},
{'g', 'h', 'i', 'G', 'H', 'I... | // Aizu Vol-10 1003: Extraordinary Girl II
// 2017.8.18 bal4u@uu
#include <stdio.h>
char *gets();
char tbl[10][8] = {{0},
{'\'', ',', '.', '!', '?'},
{'a', 'b', 'c', 'A', 'B', 'C'},
{'d', 'e', 'f', 'D', 'E', 'F'},
{'g', 'h', 'i', 'G', 'H', 'I... | [["-", 49, 50, 51, 83, 0, 83, 0, 103, 0, 125], ["+", 49, 50, 51, 83, 0, 83, 0, 103, 0, 125]] | 0 | 420 | 2 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define pb(a) push_back(a)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
using namespace std;
int main() {
string s;
while (cin >> s) {
char c;
int count ... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define pb(a) push_back(a)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
using namespace std;
int main() {
string s;
while (cin >> s) {
char c;
int count ... | [["-", 64, 1, 0, 11, 12, 16, 12, 16, 12, 13], ["+", 64, 1, 0, 11, 12, 16, 12, 16, 12, 13]] | 1 | 675 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
string button[] = {"", "',.!?", "abcABC", "defDEF", "ghiGHI",
"jklJKL", "mnoMNO", "pqrsPQRS", "ruvTUV", "wxyzWXYZ"};
char cal(int buf, int cnt) { return button[buf][... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
string button[] = {"", "',.!?", "abcABC", "defDEF", "ghiGHI",
"jklJKL", "mnoMNO", "pqrsPQRS", "tuvTUV", "wxyzWXYZ"};
char cal(int buf, int cnt) { return button[buf][... | [["-", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6], ["+", 0, 43, 49, 50, 51, 83, 0, 5, 0, 6]] | 1 | 243 | 2 |
alpha = ["","'.!?","abcABC","defDEF","ghiGHI","jklJKL","mnoMNO","pqrsPQRS","tuvTUV","wxyzWXYZ"]
while True:
try:
ans = ""
sers = ""
c = 0
for key in input():
if key == "0":
if len(sers) > 0:
n,l = int(sers[0]),len(sers)
... | alpha = ["","',.!?","abcABC","defDEF","ghiGHI","jklJKL","mnoMNO","pqrsPQRS","tuvTUV","wxyzWXYZ"]
while True:
try:
ans = ""
sers = ""
c = 0
for key in input():
if key == "0":
if len(sers) > 0:
n,l = int(sers[0]),len(sers)
... | [["-", 0, 1, 0, 662, 12, 634, 0, 557, 0, 6], ["+", 0, 1, 0, 662, 12, 634, 0, 557, 0, 6]] | 5 | 270 | 2 |
import static java.lang.Math.*;
import java.io.*;
import java.util.*;
class Main {
static int[] makePrimes(final int lim) {
BitSet isPrime = new BitSet(lim + 1);
isPrime.set(0, lim + 1, true);
isPrime.set(0, 2, false);
final int limIndex = (int)sqrt(lim);
for (int index = 2; index <= limIndex;... | import static java.lang.Math.*;
import java.io.*;
import java.util.*;
class Main {
static int[] makePrimes(final int lim) {
BitSet isPrime = new BitSet(lim + 1);
isPrime.set(0, lim + 1, true);
isPrime.set(0, 2, false);
final int limIndex = (int)sqrt(lim);
for (int index = 2; index <= limIndex;... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499]] | 3 | 346 | 2 |
#include <math.h>
#include <stdio.h>
#define MAX 10000
int main(int argc, char const *argv[]) {
int i, j, n, count = 0;
int prime[MAX];
for (i = 0; i <= MAX; i++)
prime[i] = 1; // i == 1 -> prime
prime[0] = prime[1] = 0; // i == 0 -> !prime
for (i = 2; i < sqrt(MAX); i++) {
if (prime[i] ==... | #include <math.h>
#include <stdio.h>
#define MAX 10000
int main(int argc, char const *argv[]) {
int i, j, n, count = 0;
int prime[MAX];
for (i = 0; i <= MAX; i++)
prime[i] = 1; // i == 1 -> prime
prime[0] = prime[1] = 0; // i == 0 -> !prime
for (i = 2; i < sqrt(MAX); i++) {
if (prime[i] ==... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 0 | 193 | 4 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <queue>
#include <string>
using namespace std;
typedef pair<int, int> P;
const int INF = INT_MAX / 3;
// const int V_MAX=10000,E_MAX=10000;
// int V,E;
const int N = 20000;
bool primes[N];
void sieve() {
fill(primes, primes + N, true);
prim... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <queue>
#include <string>
using namespace std;
typedef pair<int, int> P;
const int INF = INT_MAX / 3;
// const int V_MAX=10000,E_MAX=10000;
// int V,E;
const int N = 20000;
bool primes[N];
void sieve() {
fill(primes, primes + N, true);
prim... | [["-", 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], ["+", 8, 9, 0, 52, 8, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 52, 8, 1, 0, 16, 12, 22]] | 1 | 201 | 6 |
#include <iostream>
#include <string>
using namespace std;
int main(void) {
bool m[10001];
int k;
for (int i = 0; i < 10001; i++)
m[i] = true;
m[0] = m[1] = false;
for (int i = 2; i < 10001; i++) {
if (!m[i])
continue;
for (int j = i * 2; j < 10001; j += i) {
m[j] = false;
}
}
... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
bool m[10001];
int k;
for (int i = 0; i < 10001; i++)
m[i] = true;
m[0] = m[1] = false;
for (int i = 2; i < 10001; i++) {
if (!m[i])
continue;
for (int j = i * 2; j < 10001; j += i) {
m[j] = false;
}
}
... | [["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 31, 22], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 17, 67], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 25], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 183 | 6 |
#include <cmath>
#include <iostream>
using namespace std;
bool p(int n) {
if (n == 2)
return true;
if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i += 2)
if (n % i == 0)
return false;
return true;
}
int main() {
int n;
while (cin >> n) {
if (n < 4)
cout << "0\n";
... | #include <cmath>
#include <iostream>
using namespace std;
bool p(int n) {
if (n == 2)
return true;
if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i += 2)
if (n % i == 0)
return false;
return true;
}
int main() {
int n;
while (cin >> n) {
if (n < 3)
cout << "0\n";
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 145 | 2 |
import math
import bisect
primes=[2]
top=2
nlist=[2*x-1 for x in range(2,5000)]
while top<math.sqrt(10000):
top=nlist[0]
primes.append(top)
newnlist=[]
for i in nlist:
if i%top!=0:
newnlist.append(i)
nlist=newnlist
primes=primes+nlist
while(1):
try:
n=int(input())
... | import math
import bisect
primes=[2]
top=2
nlist=[2*x-1 for x in range(2,5000)]
while top<math.sqrt(10000):
top=nlist[0]
primes.append(top)
newnlist=[]
for i in nlist:
if i%top!=0:
newnlist.append(i)
nlist=newnlist
primes=primes+nlist
while(1):
try:
n=int(input())
... | [["-", 75, 76, 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 | 291 | 4 |
primes = [0, 0] + [1] * 9999
for i in range(2, 101):
if primes[i]:
for j in range(i*i, 10001, i):
primes[j] = 0
while True:
try:
N = int(input())
except:
break
print(sum(primes[i] & primes[-i] for i in range(1, N+1))) | primes = [0, 0] + [1] * 9999
for i in range(2, 101):
if primes[i]:
for j in range(i*i, 10001, i):
primes[j] = 0
while True:
try:
N = int(input())
except:
break
print(sum(primes[i] & primes[N-i+1] for i in range(1, N+1))) | [["+", 8, 657, 12, 206, 206, 657, 31, 657, 31, 22], ["+", 3, 668, 8, 657, 12, 206, 206, 657, 17, 72], ["+", 3, 668, 8, 657, 12, 206, 206, 657, 12, 612]] | 5 | 92 | 3 |
import math
def ifprime(num):
if num == 1:
return False
for i in range(2,math.floor(num ** 0.5) + 1):
if num % i:
continue
else:
return False
return True
while(True):
try:
num = input()
except:
break
count = 0
for i in range(1,num+1):
if ifprime(i) and ifprime(num-i):... | import math
def ifprime(num):
if num == 1:
return False
for i in range(2,math.floor(num ** 0.5) + 1):
if num % i:
continue
else:
return False
return True
while(True):
try:
num = int(input())
except:
break
count = 0
for i in range(1,num+1):
if ifprime(i) and ifprime(nu... | [["+", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["+", 12, 652, 3, 4, 0, 657, 31, 657, 17, 72], ["+", 12, 652, 3, 4, 0, 657, 31, 657, 12, 612]] | 5 | 96 | 5 |
r = 10000
sqrt = int(math.sqrt(r))
p = [1 for i in range(r)]
p[0] = 0
for i in range(sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for j in range(2*i+1,r,i+1)]
while True:
try:
n = int(input())
count = 0
for i in range(n):
if p[i]*p[n-i-1] == 1:
count += 1
... | import math
r = 10000
sqrt = int(math.sqrt(r))
p = [1 for i in range(r)]
p[0] = 0
for i in range(sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for j in range(2*i+1,r,i+1)]
while True:
try:
n = int(input())
count = 0
for i in range(n):
if p[i]*p[n-i-1] == 1:
coun... | [["+", 36, 36, 36, 36, 0, 656, 0, 596, 0, 487], ["+", 36, 36, 0, 656, 0, 596, 141, 673, 0, 22]] | 5 | 131 | 2 |
import math
r = 9999
sqrt = int(math.sqrt(r))
p = [1*r]
p[0] = 0
for i in range(sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for j in range(2*i+1,r,i+1)]
prime = []
for i in range(r):
if p[i]:
prime.append(i)
while True:
try:
n = int(input())
count = 0
for i in prime:
... | import math
r = 9999
sqrt = int(math.sqrt(r))
p = [1 for i in range(r)]
p[0] = 0
for i in range(sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for j in range(2*i+1,r,i+1)]
prime = []
for i in range(r):
if p[i]:
prime.append(i)
while True:
try:
n = int(input())
count = 0
for i in... | [["-", 0, 1, 0, 662, 12, 634, 0, 657, 17, 48], ["+", 0, 1, 0, 662, 12, 658, 0, 659, 0, 88], ["+", 0, 1, 0, 662, 12, 658, 0, 659, 31, 22], ["+", 0, 1, 0, 662, 12, 658, 0, 659, 0, 267], ["+", 0, 662, 12, 658, 0, 659, 12, 652, 63, 22], ["+", 12, 658, 0, 659, 12, 652, 3, 4, 0, 24], ["+", 12, 658, 0, 659, 12, 652, 3, 4, 0, ... | 5 | 152 | 7 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
final int n = sc.nextInt();
if (n == 0) {
break;
}
int[][] count = new int[n][n];
int[][] data = new in... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
final int n = sc.nextInt();
if (n == 0) {
break;
}
int[][] count = new int[n][n];
int[][] data = new in... | [["-", 0, 57, 15, 15, 0, 16, 12, 509, 119, 22], ["+", 0, 57, 15, 15, 0, 16, 12, 509, 119, 22]] | 3 | 454 | 2 |
// Aizu Vol-10 1005: Advanced Algorithm Class
// 2017.8.17 bal4u@uu
#include <stdio.h>
#define N 100
int a[N][N][3], n;
int main() {
int r, c, h, t, min, max;
while (scanf("%d", &n) == 1 && n) {
for (r = 0; r < n; r++)
for (c = 0; c < n; c++)
scanf("%d", &a[r][c][0]);
for (r = 0; r < n; r+... | // Aizu Vol-10 1005: Advanced Algorithm Class
// 2017.8.17 bal4u@uu
#include <stdio.h>
#define N 100
int a[N][N][3], n;
int main() {
int r, c, h, t, min, max;
while (scanf("%d", &n) == 1 && n) {
for (r = 0; r < n; r++)
for (c = 0; c < n; c++)
scanf("%d", &a[r][c][0]);
for (r = 0; r < n; r... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13]] | 0 | 418 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
const int INF = 1 << 20;
int main() {
int n, i, j, a, b;
for (; cin >> n, n;) {
int m[100][100], rec[100], t[100][100], mv, ind;
for (i = 0; i < n; i++) {
rec[i] = 0;
for (j = 0; j < n; j++) {
m[i][j] = t[i][j] = 0;
}
... | #include <algorithm>
#include <iostream>
using namespace std;
const int INF = 1 << 20;
int main() {
int n, i, j, a, b;
for (; cin >> n, n;) {
int m[100][100], rec[100], t[100][100], mv, ind;
for (i = 0; i < n; i++) {
rec[i] = 0;
for (j = 0; j < n; j++) {
m[i][j] = t[i][j] = 0;
}
... | [["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 98], ["+", 8, 9, 0, 7, 15, 16, 12, 91, 17, 111], ["+", 8, 9, 0, 7, 15, 16, 12, 91, 28, 22]] | 1 | 472 | 6 |
#include <iostream>
#define NMAX 100
using namespace std;
int main() {
int n;
int input;
int class_room[NMAX][NMAX];
int class_room_hand[NMAX][NMAX]; // 1 right 2 left 3 both
int right[NMAX] = {0};
int left[NMAX] = {0};
int ans = 0;
int ans_n = 0;
while (cin >> n) {
if (n == 0) {
break;
... | #include <iostream>
#define NMAX 100
using namespace std;
int main() {
int n;
int input;
int class_room[NMAX][NMAX];
int class_room_hand[NMAX][NMAX]; // 1 right 2 left 3 both
int right[NMAX] = {0};
int left[NMAX] = {0};
int ans = 0;
int ans_n = 0;
while (cin >> n) {
if (n == 0) {
break;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 504 | 24 |
#include <algorithm>
#include <stdio.h>
using namespace std;
int b[110][110];
int main() {
int a;
while (scanf("%d", &a), a) {
for (int i = 0; i < a; i++)
for (int j = 0; j < a; j++)
scanf("%d", &b[i][j]);
bool yet = true;
for (int i = 0; i < a; i++) {
for (int j = 0; j < a; j++) {
... | #include <algorithm>
#include <stdio.h>
using namespace std;
int b[110][110];
int main() {
int a;
while (scanf("%d", &a), a) {
for (int i = 0; i < a; i++)
for (int j = 0; j < a; j++)
scanf("%d", &b[i][j]);
bool yet = true;
for (int i = 0; i < a; i++) {
for (int j = 0; j < a; j++) {
... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 218 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, row[100], column[100];
while (cin >> n) {
if (n == 0)
break;
fill(row, row + n, 0);
fill(column, column + n, 10000);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> m;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, row[100], column[100];
while (cin >> n) {
if (n == 0)
break;
fill(row, row + n, 0);
fill(column, column + n, 10000);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> m;
... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 211 | 2 |
#include <stdio.h>
int n, a[99][99];
int main() {
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
scanf("%d", &a[i][j]);
}
bool flag = false;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (!flag) {
bool ok = ... | #include <stdio.h>
int n, a[99][99];
int main() {
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
scanf("%d", &a[i][j]);
}
bool flag = false;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (!flag) {
bool ok = ... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18]] | 1 | 235 | 4 |
#include <bits/stdc++.h>
#define N 100
using namespace std;
int n, a[N][N], ans;
bool checkx(int y, int x, int p) {
for (int i = 0; i < n; i++)
if (x != i && p > a[y][i])
return false;
return true;
}
bool checky(int y, int x, int p) {
for (int i = 0; i < n; i++)
if (y != i && p < a[i][x])
re... | #include <bits/stdc++.h>
#define N 100
using namespace std;
int n, a[N][N], ans;
bool checkx(int y, int x, int p) {
for (int i = 0; i < n; i++)
if (x != i && p > a[y][i])
return false;
return true;
}
bool checky(int y, int x, int p) {
for (int i = 0; i < n; i++)
if (y != i && p < a[i][x])
re... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 262 | 4 |
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DEBUG 0
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define dump(o) \
if... | #include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DEBUG 0
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define dump(o) \
if... | [["+", 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, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 433 | 6 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int h[100][100];
bool lef[100][100], rig[100][100];
int main() {
int n;
while (scanf("%d", &n), n) {
memset(lef, 0, sizeof(lef));
memset(rig, 0, sizeof(rig));
rep(i, n) rep(j, n) scanf("%d", &h[i][j]);
rep(i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int h[100][100];
bool lef[100][100], rig[100][100];
int main() {
int n;
while (scanf("%d", &n), n) {
memset(lef, 0, sizeof(lef));
memset(rig, 0, sizeof(rig));
rep(i, n) rep(j, n) scanf("%d", &h[i][j]);
rep(i... | [["+", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 306 | 7 |
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
int main(void) {
int n;
while (cin >> n && n) {
VVI students(n, VI(n));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> students[i][j];
VVI tallests(n, VI(n, 0));
... | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
int main(void) {
int n;
while (cin >> n && n) {
VVI students(n, VI(n));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> students[i][j];
VVI tallests(n, VI(n, 0));
... | [["-", 64, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 64, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22]] | 1 | 414 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
int imap[110][110];
int mmap[110][2]; // 0->row 1->column
while (cin >> n && n) {
for (int i = 0; i < n; i++) {
mmap[i][1] = 1 << 30;
mmap[i][0] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
... | #include <iostream>
using namespace std;
int main() {
int n;
int imap[110][110];
int mmap[110][2]; // 0->row 1->column
while (cin >> n && n) {
for (int i = 0; i < n; i++) {
mmap[i][1] = 1 << 30;
mmap[i][0] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
... | [["+", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 51, 22], ["+", 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]] | 1 | 283 | 6 |
while gets
n = $_.to_i
break if n == 0
m = Array.new(n){ Array.new(n) }
n.times { |i| m[i] = gets.split.map(&:to_i) }
a = Array.new
n.times { |i| a << m[i].min }
mt = m.transpose
b = Array.new
n.times { |i| b << mt[i].max }
puts a & b == nil ? 0 : a & b
end | while gets
n = $_.to_i
break if n == 0
m = Array.new(n){ Array.new(n) }
n.times { |i| m[i] = gets.split.map(&:to_i) }
a = Array.new
n.times { |i| a << m[i].min }
mt = m.transpose
b = Array.new
n.times { |i| b << mt[i].max }
puts (a & b).empty? ? 0 : a & b
end | [["+", 3, 4, 0, 754, 15, 652, 486, 739, 0, 24], ["-", 0, 652, 3, 4, 0, 754, 15, 738, 17, 60], ["-", 3, 4, 0, 754, 15, 738, 12, 477, 0, 477], ["+", 3, 4, 0, 754, 15, 652, 486, 739, 0, 25], ["+", 0, 652, 3, 4, 0, 754, 15, 652, 17, 131], ["+", 0, 652, 3, 4, 0, 754, 15, 652, 735, 22]] | 4 | 110 | 6 |
function bomb(y, x, f) {
yx[y][x] = (" " + cnt).slice(-3);
cnt++;
if (y == n - 1 && x == n - 1)
return;
else if (y == n - 1 && f == -1)
bomb(y, x + 1, 1);
else if (y == n - 1 && f == 1)
bomb(y - 1, x + 1, 1);
else if (x == n - 1 && f == 1)
bomb(y + 1, x, -1);
else if (x == n - 1 && f == ... | function bomb(y, x, f) {
yx[y][x] = (" " + cnt).slice(-3);
cnt++;
if (y == n - 1 && x == n - 1)
return;
else if (y == n - 1 && f == -1)
bomb(y, x + 1, 1);
else if (y == n - 1 && f == 1)
bomb(y - 1, x + 1, 1);
else if (x == n - 1 && f == 1)
bomb(y + 1, x, -1);
else if (x == n - 1 && f == ... | [["+", 0, 493, 0, 52, 8, 556, 0, 198, 0, 217], ["+", 0, 52, 8, 556, 0, 198, 0, 200, 141, 22], ["+", 0, 52, 8, 556, 0, 198, 0, 200, 0, 32], ["+", 0, 52, 8, 556, 0, 198, 0, 200, 51, 555], ["+", 0, 493, 0, 52, 8, 556, 0, 198, 0, 35]] | 2 | 471 | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.