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>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF INT_MAX / 3
#define ALL(a) (a).begin(), (a).end()
#... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF INT_MAX / 3
#define ALL(a) (a).begin(), (a).end()
#... | [["-", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22]] | 1 | 239 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
int main() {
vector<int> prime;
vector<bool> used(10001, false);
used[0] = used[1] = true;
for (int i = 2; i * i <= 10000; i++) {
if (!used[i])
prime.push_back(i);
u... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
int main() {
vector<int> prime;
vector<bool> used(10001, false);
used[0] = used[1] = true;
for (int i = 2; i * i <= 10000; i++) {
if (!used[i])
prime.push_back(i);
u... | [["-", 51, 66, 28, 23, 0, 16, 31, 2, 63, 22], ["+", 51, 66, 28, 23, 0, 16, 31, 2, 63, 22]] | 1 | 280 | 2 |
#include <bits/stdc++.h>
#define r(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int s[10001] = {1, 1, 0, 0, 1};
int main() {
r(i, 2, 10001) for (int j = i * 2; j < 10001; j += i) s[j]++;
int a;
while (cin >> a, a) {
while (a--) {
if (!s[a] && !s[a - 2]) {
cout << a - 2 << ' ' << a <... | #include <bits/stdc++.h>
#define r(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int s[10001] = {1, 1, 0, 0, 1};
int main() {
r(i, 2, 10001) for (int j = i * 2; j < 10001; j += i) s[j]++;
int a;
while (cin >> a, a) {
while (a) {
if (!s[a] && !s[a - 2]) {
cout << a - 2 << ' ' << a << ... | [["-", 8, 9, 0, 52, 15, 339, 51, 27, 17, 68], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 126 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n, flg, i, j, p1, q1, fllg, ii;
while (1) {
cin >> n;
if (n == 0)
break;
for (i = n - 1; i > 1; i--) {
flg = 1;
if (i != 2 && i % 2 != 0) {
for (j = 2; j < i; j++) {
if (i % j == 0) {
... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n, flg, i, j, p1, q1, fllg, ii;
while (1) {
cin >> n;
if (n == 0)
break;
for (i = n; i > 1; i--) {
flg = 1;
if (i != 2 && i % 2 != 0) {
for (j = 2; j < i; j++) {
if (i % j == 0) {
... | [["-", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 1 | 212 | 2 |
#include <stdio.h>
int isprime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
int main() {
int k, n;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (k = n - 2; k >= 2; k--) {
if (isprime(k) && isprime(k + 2)) {
printf("%d %d\n... | #include <stdio.h>
int isprime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
int main() {
int k, n;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (k = n - 2; k >= 2; k--) {
if (isprime(k) && isprime(k + 2)) {
printf("%d %d\n... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 127 | 2 |
#include <cmath>
#include <iostream>
#include <vector>
std::vector<bool> Eratosthenes(const int n) {
std::vector<bool> primes(n + 1, true);
primes[0] = primes[1] = false;
for (int i = 2; i < std::sqrt(n); ++i) {
if (!primes[i])
continue;
for (int j = i * i; j < n; j += i)
primes[j] = false;
... | #include <cmath>
#include <iostream>
#include <vector>
std::vector<bool> Eratosthenes(const int n) {
std::vector<bool> primes(n + 1, true);
primes[0] = primes[1] = false;
for (int i = 2; i <= std::sqrt(n); ++i) {
if (!primes[i])
continue;
for (int j = i * i; j <= n; j += i)
primes[j] = false... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 221 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
const int MAX = 10010;
int katarogu[MAX] = {0};
const int NOsosu = 1;
int num[MAX] = {0};
num[1] = NOsosu;
for (int i = 3; i < MAX; i = i + 2) {
for (int j = 3; j * j <= i; j = j + 2) {
if (i % j == 0) {
num[i] = NOsos... | #include <iostream>
#include <string>
using namespace std;
int main() {
const int MAX = 10010;
int katarogu[MAX] = {0};
const int NOsosu = 1;
int num[MAX] = {0};
num[1] = NOsosu;
for (int i = 3; i < MAX; i = i + 2) {
for (int j = 3; j * j <= i; j = j + 2) {
if (i % j == 0) {
num[i] = NOsos... | [["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 199 | 4 |
#include <iostream>
using namespace std;
int main() {
//ツ素ツ青板青カツ青ャ
const int NUM = 10001;
bool prime[NUM];
prime[0] = false;
prime[1] = false;
for (int i = 2; i < NUM; i++)
prime[i] = true;
for (int i = 2; i * i < NUM; i++)
for (int k = 2; i * k < NUM; k++)
prime[i * k] = false;
int maxtw... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
//ツ素ツ青板青カツ青ャ
const int NUM = 10001;
bool prime[NUM];
prime[0] = false;
prime[1] = false;
for (int i = 2; i < NUM; i++)
prime[i] = true;
for (int i = 2; i * i < NUM; i++)
for (int k = 2; i * k < NUM; k++)
prime[i * k] = f... | [["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 15, 34, 31, 2, 3, 4, 0, 66, 17, 67]] | 1 | 192 | 3 |
#include <iostream>
#include <vector>
#define MAX 1000000
using namespace std;
int main() {
int k = 0;
vector<int> prid(MAX);
vector<int> pre(MAX);
for (int i = 0; i < MAX; i++)
prid[i] = 1;
prid[0] = 0;
prid[1] = 0;
for (int i = 0; i * i < MAX; i++)
if (prid[i]) {
for (int j = i * 2; j < MA... | #include <iostream>
#include <vector>
#define MAX 1000000
using namespace std;
int main() {
int k = 0;
vector<int> prid(MAX);
vector<int> pre(MAX);
for (int i = 0; i < MAX; i++)
prid[i] = 1;
prid[0] = 0;
prid[1] = 0;
for (int i = 0; i * i < MAX; i++)
if (prid[i]) {
for (int j = i * 2; j < MA... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19]] | 1 | 245 | 2 |
#include <iostream>
using namespace std;
#define MAX (10001)
bool prime[MAX];
int main() {
int n;
for (int i = 2; i < MAX; i++)
prime[i] = true;
for (int i = 2; i < MAX; i++) {
if (prime[i]) {
for (int j = i + i; j < MAX; j += i) {
prime[j] = false;
}
}
}
while (cin >> n, n) ... | #include <iostream>
using namespace std;
#define MAX (10001)
bool prime[MAX];
int main() {
int n;
for (int i = 2; i < MAX; i++)
prime[i] = true;
for (int i = 2; i < MAX; i++) {
if (prime[i]) {
for (int j = i + i; j < MAX; j += i) {
prime[j] = false;
}
}
}
while (cin >> n, n) ... | [["-", 31, 16, 31, 16, 31, 16, 12, 16, 12, 13], ["+", 31, 16, 31, 16, 31, 16, 12, 16, 12, 13], ["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 1 | 155 | 5 |
require 'prime'
m = 10000
cache = Prime.each(m).each_cons(2).select {|a,b|
b-a == 2
}.reverse
while (n = gets.to_i)!=0
p1,q1 = cache.bsearch {|_,q|
n > q
}
puts "#{p1} #{q1}"
end | require 'prime'
m = 10000
cache = Prime.each(m).each_cons(2).select {|a,b|
b-a == 2
}.reverse
while (n = gets.to_i)!=0
p1,q1 = cache.bsearch {|_,q|
n >= q
}
puts "#{p1} #{q1}"
end | [["-", 12, 652, 196, 196, 8, 734, 0, 738, 17, 47], ["+", 12, 652, 196, 196, 8, 734, 0, 738, 17, 20]] | 4 | 74 | 2 |
require 'prime'
twin_prime = Prime.each(10000).each_cons(2).select{ |p, q| q - p == 2}
loop do
n = gets.to_i
break if n.zero?
ans = twin_prime.select{ |twin| twin.last < n }.last
puts ans.join(' ')
end | require 'prime'
twin_prime = Prime.each(10000).each_cons(2).select{ |p, q| q - p == 2}
loop do
n = gets.to_i
break if n.zero?
ans = twin_prime.select{ |twin| twin.last <= n }.last
puts ans.join(' ')
end | [["-", 486, 652, 196, 196, 8, 734, 0, 738, 17, 18], ["+", 486, 652, 196, 196, 8, 734, 0, 738, 17, 19]] | 4 | 70 | 2 |
# -*- coding: utf-8 -*-
"""
"""
import sys
from sys import stdin
from bisect import bisect_left
input = stdin.readline
def create_prime_list(limit):
""" ??¨??????????????????????????§limit?????§????´???°?????????????±???????
https://ja.wikipedia.org/wiki/%E3%82%A8%E3%83%A9%E3%83%88%E3%82%B9%E3%83%86%E3%83%8D%... | # -*- coding: utf-8 -*-
"""
"""
import sys
from sys import stdin
from bisect import bisect_right
input = stdin.readline
def create_prime_list(limit):
""" ??¨??????????????????????????§limit?????§????´???°?????????????±???????
https://ja.wikipedia.org/wiki/%E3%82%A8%E3%83%A9%E3%83%88%E3%82%B9%E3%83%86%E3%83%8D... | [["-", 36, 36, 0, 656, 0, 686, 141, 673, 0, 22], ["+", 36, 36, 0, 656, 0, 686, 141, 673, 0, 22], ["-", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22]] | 5 | 215 | 32 |
# Aizu Problem 00150: Twin Prime
#
import sys, math, os, bisect
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
def primes2(n):
""" Input n>=6, Returns a list of primes, 2 <= p < n """
n, correction = n-n%6+6, 2-(n%6>1)
sieve = [True] * (n//3... | # Aizu Problem 00150: Twin Prime
#
import sys, math, os, bisect
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
def primes2(n):
""" Input n>=6, Returns a list of primes, 2 <= p < n """
n, correction = n-n%6+6, 2-(n%6>1)
sieve = [True] * (n//3... | [["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 612], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 612], ["-", 0, 52, 8, 196, 0, 57, 15, 666, 667, 20], ["+", 0, 52, 8, 196, 0, 57, 15, 666, 667, 47]] | 5 | 333 | 4 |
from bisect import bisect_left
MAXN = 10000
P = [True]*MAXN
P[0] = P[1] = False
for i in range(int(MAXN**0.5)+1):
if P[i]:
for j in range(i+i,MAXN,i):
P[j] = False
TP = [i for i in range(2,MAXN) if P[i] and P[i-2]]
while True:
n = int(input())
if n == 0:
break
m = TP[bisect_l... | from bisect import bisect
MAXN = 10000
P = [True]*MAXN
P[0] = P[1] = False
for i in range(int(MAXN**0.5)+1):
if P[i]:
for j in range(i+i,MAXN,i):
P[j] = False
TP = [i for i in range(2,MAXN) if P[i] and P[i-2]]
while True:
n = int(input())
if n == 0:
break
m = TP[bisect(TP,n)-... | [["-", 36, 36, 0, 656, 0, 686, 141, 673, 0, 22], ["+", 36, 36, 0, 656, 0, 686, 141, 673, 0, 22], ["-", 0, 662, 12, 206, 206, 657, 31, 652, 63, 22], ["+", 0, 662, 12, 206, 206, 657, 31, 652, 63, 22]] | 5 | 130 | 4 |
r = 10001
sqrt = int(r**0.5)
p = [1]*r
twin = [0]*r
p[0] = 0
p[1::2] = [0 for x in range(1,r,2)]
for i in range(2,r,2):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
if p[i-2]:
twin[i:i+100] = [i+1 for x in range(i,i+100)]
while True:
n = int(input())
if n == 0: break
print(twin[n-1]-2,twin[n-1... | r = 10001
sqrt = int(r**0.5)
p = [1]*r
twin = [0]*r
p[0] = 0
p[1::2] = [0 for x in range(1,r,2)]
for i in range(2,r,2):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
if p[i-2]:
twin[i:i+250] = [i+1 for x in range(i,i+250)]
while True:
n = int(input())
if n == 0: break
print(twin[n-1]-2,twin[n-1... | [["-", 0, 662, 31, 206, 206, 663, 0, 657, 12, 612], ["+", 0, 662, 31, 206, 206, 663, 0, 657, 12, 612], ["-", 0, 659, 12, 652, 3, 4, 0, 657, 12, 612], ["+", 0, 659, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 173 | 4 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX(x, y) ((x > y) ? x : y)
char x[260][260];
int main() {
int i, j, n, ans, a, b, c, d;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
memset(x, 0, sizeof(x));
for (i = 0; i < n; i++)
scanf("%s", x[i]);
ans = 0;
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX(x, y) ((x > y) ? x : y)
char x[260][260];
int main() {
int i, j, n, ans, a, b, c, d;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
memset(x, 0, sizeof(x));
for (i = 0; i < n; i++)
scanf("%s", x[i]);
ans = 0;
... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 64, 9, 0, 1, 0, 11, 12, 11, 31, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["+", 64, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 64, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 0 | 455 | 6 |
#include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef vector<int> vi;
string board[265];
int main() {
int n;
while (cin >> n && n) {
int ans = -1;
int wchain = 0;
int hchain = 0;
int schain = 0;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef vector<int> vi;
string board[265];
int main() {
int n;
while (cin >> n && n) {
int ans = -1;
int wchain = 0;
int hchain = 0;
int schain = 0;
for (int i = 0; i < n; i++) {
... | [["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]] | 1 | 796 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
char f[300][300];
bool used[300][300];
int n;
int ans;
int dx[4] = {1, 0, 1, -1};
int dy[4] = {0, 1, -1, 1};
void dfs(int x, int y, int d, int k) {
if (x < 0 || x >= n || y < 0 || y >= n)
return;
if (used[x][y])
return;
if (f... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
char f[300][300];
bool used[300][300];
int n;
int ans;
int dx[4] = {1, 0, 1, 1};
int dy[4] = {0, 1, -1, 1};
void dfs(int x, int y, int d, int k) {
if (x < 0 || x >= n || y < 0 || y >= n)
return;
if (used[x][y])
return;
if (f[... | [["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13]] | 1 | 328 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
int n;
int dx[] = {1, 1, -1}, dy[] = {0, 1, 1};
vector<string> V;
int cnt(int y, int x, int d) {
if (x < 0 || x >= n || y < 0 || y >= n)
return 0;
if (V[y][x] == '0')
return 0;
ret... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
int n;
int dx[] = {1, 1, -1, 0}, dy[] = {0, 1, 1, 1};
vector<string> V;
int cnt(int y, int x, int d) {
if (x < 0 || x >= n || y < 0 || y >= n)
return 0;
if (V[y][x] == '0')
return 0;... | [["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 21], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13], ["-", 0, 1, 0, 11, 31, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 11, 31, 2, 3, 4, 0, 13]] | 1 | 217 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
bool prime[10002];
int field[256][256];
int dx[] = {1, 1, 1, 0}, dy[] = {-1, 1, 0, 1};
int n;
int func(int x, int y, int k) {
int cnt = 0;
while (1) {
if (x < 0 || x >= n || y < 0 || y >= n)
break;
if (field[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
bool prime[10002];
int field[256][256];
int dx[] = {1, 1, 1, 0}, dy[] = {-1, 1, 0, 1};
int n;
int func(int x, int y, int k) {
int cnt = 0;
while (1) {
if (x < 0 || x >= n || y < 0 || y >= n)
break;
if (field[... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 271 | 2 |
#include <bits/stdc++.h>
using namespace std;
int underR(int y, int x);
int underL(int y, int x);
char maps[260][260];
int check[260][260];
int n;
int gyomax[260] = {0};
int gyoans = 0;
int gyonum[260] = {0};
int retumax[260] = {0};
int retuans = 0;
int retunum[260] = {0};
int ans = 0;
main() {
while (1) {
ans = ... | #include <bits/stdc++.h>
using namespace std;
int underR(int y, int x);
int underL(int y, int x);
char maps[260][260];
int check[260][260];
int n;
int gyomax[260] = {0};
int gyoans = 0;
int gyonum[260] = {0};
int retumax[260] = {0};
int retuans = 0;
int retunum[260] = {0};
int ans = 0;
main() {
while (1) {
ans = ... | [["-", 64, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 2, 63, 22]] | 1 | 606 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
while (cin >> a, a) {
bool b[258][258];
for (int c = 0; c < a; c++) {
string s;
cin >> s;
for (int d = 0; d < a; d++) {
b[c][d] = s[d] == '1';
}
}
in... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
while (cin >> a, a) {
bool b[258][258];
for (int c = 0; c < a; c++) {
string s;
cin >> s;
for (int d = 0; d < a; d++) {
b[c][d] = s[d] == '1';
}
}
in... | [["-", 0, 57, 75, 76, 0, 1, 0, 27, 17, 68], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 12, 13]] | 1 | 264 | 3 |
#include <iostream>
const int N = 257;
using namespace std;
int main(void) {
while (true) {
int n;
int ans = 0;
int G[N][N] = {
{
0,
},
};
int H[N][N][4] = {
{
{
0,
},
},
};
cin >> n;
if (n == 0)
... | #include <iostream>
const int N = 257;
using namespace std;
int main(void) {
while (true) {
int n;
int ans = 0;
int G[N][N] = {
{
0,
},
};
int H[N][N][4] = {
{
{
0,
},
},
};
cin >> n;
if (n == 0)
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 28, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 28, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 473 | 4 |
#include <stdio.h>
char table1[255][256];
int slash[255][255];
int yen[255][255];
int yoko[255][255];
int tate[255][255];
int main() {
int n;
while (scanf("%d", &n), n) {
for (int i = 0; i < 255; i++)
for (int j = 0; j < 255; j++)
table1[i][j] = '0';
for (int i = 0; i < n; i++) {
scanf("... | #include <stdio.h>
char table1[255][256];
int slash[255][255];
int yen[255][255];
int yoko[255][255];
int tate[255][255];
int main() {
int n;
while (scanf("%d", &n), n) {
for (int i = 0; i < 255; i++)
for (int j = 0; j < 255; j++)
table1[i][j] = '0';
for (int i = 0; i < n; i++) {
scanf("... | [["-", 51, 16, 31, 23, 0, 16, 12, 16, 12, 13], ["+", 31, 23, 0, 16, 12, 16, 12, 16, 31, 22], ["+", 31, 23, 0, 16, 12, 16, 12, 16, 17, 33], ["+", 31, 23, 0, 16, 12, 16, 12, 16, 12, 13], ["-", 12, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 17, 72]] | 1 | 681 | 6 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include ... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 576 | 2 |
#include <algorithm>
#include <cstdio>
int main() {
int n;
while (scanf("%d", &n), n) {
int m = 0, v[4][2] = {{0, -1}, {-1, 0}, {1, -1}, {-1, -1}},
map[257][257] = {{0}};
for (int y = 1; y <= n; y++)
for (int x = 1; x <= n; x++)
scanf("%1d", &map[x][y]);
for (int i = 0; i < 4; i--... | #include <algorithm>
#include <cstdio>
int main() {
int n;
while (scanf("%d", &n), n) {
int m = 0, v[4][2] = {{0, -1}, {-1, 0}, {1, -1}, {-1, -1}},
map[257][257] = {{0}};
for (int y = 1; y <= n; y++)
for (int x = 1; x <= n; x++)
scanf("%1d", &map[x][y]);
for (int i = 0; i < 4; i++... | [["-", 0, 52, 8, 9, 0, 7, 26, 27, 17, 68], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 17, 29]] | 1 | 254 | 38 |
#include <cstring>
#include <iostream>
using namespace std;
const int SIZE = 255;
int main() {
bool table[SIZE][SIZE * 3];
int n;
while (cin >> n && n) {
memset(table, 0, sizeof(table));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
char c;
cin >> c;
table[i]... | #include <cstring>
#include <iostream>
using namespace std;
const int SIZE = 255;
int main() {
bool table[SIZE][SIZE * 3];
int n;
while (cin >> n && n) {
memset(table, 0, sizeof(table));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
char c;
cin >> c;
table[i]... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 48], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 355 | 2 |
def f():
max_c = 0
c = 0
for h in range(n):
for w in range(n):
if grid[h][w] == 1:
c += 1
else:
if max_c < c:
max_c = c
c = 0
else:
if max_c < c:
max_c = c
... | def f():
max_c = 0
c = 0
for h in range(n):
for w in range(n):
if grid[h][w] == 1:
c += 1
else:
if max_c < c:
max_c = c
c = 0
else:
if max_c < c:
max_c = c
... | [["+", 75, 76, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 75, 76, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 75, 76, 8, 196, 0, 1, 0, 662, 12, 612]] | 5 | 424 | 3 |
#include <stdio.h>
#include <stdlib.h>
typedef struct {
int id;
int score;
} man_t;
int compare(const void *x, const void *y) {
man_t *a;
man_t *b;
a = (man_t *)x;
b = (man_t *)y;
if (a->score > b->score)
return 1;
if (a->score < b->score)
return -1;
if (a->id > b->id)
return 1;
if (a-... | #include <stdio.h>
#include <stdlib.h>
typedef struct {
int id;
int score;
} man_t;
int compare(const void *x, const void *y) {
man_t *a;
man_t *b;
a = (man_t *)x;
b = (man_t *)y;
if (a->score < b->score)
return 1;
if (a->score > b->score)
return -1;
if (a->id > b->id)
return 1;
if (a-... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 607 | 4 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int i, j, n, score[50][2], order[50], frame, first, last, pin, str, spa;
void swap(int *x, int *y) {
int z;
z = *x;
*x = *y;
*y = z;
}
int main() {
while (scanf("%d", &n) * n) {
for (i = 0; i < n; i++) {
scanf("%d", &score[i][0]);
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int i, j, n, score[50][2], order[50], frame, first, last, pin, str, spa;
void swap(int *x, int *y) {
int z;
z = *x;
*x = *y;
*y = z;
}
int main() {
while (scanf("%d", &n) * n) {
for (i = 0; i < n; i++) {
scanf("%d", &score[i][0]);
... | [["+", 0, 57, 15, 23, 0, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 98]] | 0 | 460 | 4 |
#include <math.h>
#include <stack>
#include <stdio.h>
using namespace std;
struct Student {
int id, score;
};
struct Data {
int score, first, second;
bool strike, spare;
};
int main() {
int num, tmp, index, pre_score;
char buf[120];
Student students[40];
Data game_data[12];
bool First;
while (tr... | #include <math.h>
#include <stack>
#include <stdio.h>
using namespace std;
struct Student {
int id, score;
};
struct Data {
int score, first, second;
bool strike, spare;
};
int main() {
int num, tmp, index, pre_score;
char buf[120];
Student students[40];
Data game_data[12];
bool First;
while (tr... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 789 | 2 |
def get_point(info):
info.reverse()
acc = 0
NORMAL, SPARE, STRIKE, DOUBLE = 0, 1, 2, 3
flag = NORMAL
game_num = 0
while info:
if game_num != 9:
down_num1 = info.pop()
if down_num1 != 10:
down_num2 = info.pop()
if flag == SPARE:
acc += down_num1 * 2 + down_num2
... | def get_point(info):
info.reverse()
acc = 0
NORMAL, SPARE, STRIKE, DOUBLE = 0, 1, 2, 3
flag = NORMAL
game_num = 0
while info:
if game_num != 9:
down_num1 = info.pop()
if down_num1 != 10:
down_num2 = info.pop()
if flag == SPARE:
acc += down_num1 * 2 + down_num2
... | [["-", 8, 196, 0, 1, 0, 652, 63, 319, 500, 22], ["+", 8, 196, 0, 1, 0, 652, 63, 319, 500, 22], ["-", 8, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 8, 196, 0, 1, 0, 652, 63, 319, 319, 22]] | 5 | 347 | 4 |
#include <algorithm>
#include <stdio.h>
using namespace std;
int g[100][100];
int main() {
int a;
scanf("%d", &a);
for (int i = 0; i < 100; i++)
for (int j = 0; j < 100; j++)
g[i][j] = 1999999999;
for (int i = 0; i < a; i++)
g[i][i] = 0;
for (int i = 0; i < a; i++) {
int b, c;
scanf("%d%... | #include <algorithm>
#include <stdio.h>
using namespace std;
int g[100][100];
int main() {
int a;
scanf("%d", &a);
for (int i = 0; i < 100; i++)
for (int j = 0; j < 100; j++)
g[i][j] = 99999999;
for (int i = 0; i < a; i++)
g[i][i] = 0;
for (int i = 0; i < a; i++) {
int b, c;
scanf("%d%d"... | [["-", 0, 7, 8, 7, 8, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 7, 8, 1, 0, 11, 12, 13]] | 1 | 348 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, j) FOR(i, 0, j)
#define FOR(i, j, k) for (int i = j; i < k; ++i)
using namespace std;
int a[100][100];
int main() {
int n, r, k, t;
scanf("%d", &n);
rep(i... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, j) FOR(i, 0, j)
#define FOR(i, j, k) for (int i = j; i < k; ++i)
using namespace std;
int a[100][100];
int main() {
int n, r, k, t;
scanf("%d", &n);
rep(i... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 298 | 2 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, minimum, tmp;
scanf("%d", &n);
int table[n][n];
int data[n][2];
for (int i = 0; i < n; i++) {
for (int k = 0; k < n; k++)
tabl... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, minimum, tmp;
scanf("%d", &n);
int table[n][n];
int data[n][2];
for (int i = 0; i < n; i++) {
for (int k = 0; k < n; k++)
tabl... | [["-", 0, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 16, 31, 69, 341, 342, 0, 16, 12, 22]] | 1 | 360 | 2 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 531 | 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() {... | [["-", 12, 16, 31, 16, 31, 16, 31, 69, 28, 22], ["+", 12, 16, 31, 16, 31, 16, 31, 69, 28, 22], ["-", 12, 16, 31, 16, 31, 16, 12, 69, 28, 22], ["+", 12, 16, 31, 16, 31, 16, 12, 69, 28, 22], ["-", 51, 16, 12, 16, 31, 16, 12, 69, 28, 22], ["+", 51, 16, 12, 16, 31, 16, 12, 69, 28, 22], ["-", 49, 50, 51, 16, 12, 16, 12, 69,... | 1 | 276 | 8 |
def dfs(l, r):
if l == r:
return 0
if (l, r) in cache:
return cache[(l, r)]
cache[(l, r)] = min(dfs(l, m) + dfs(m + 1, r) + L[l][1] * L[m][0] * L[m + 1][1] * L[r][0] for m in range(l, r))
return cache[(l, r)]
cache = {}
L = [list(map(int, input().split())) for _ in range(eval(input()))]... | def dfs(l, r):
if l == r:
return 0
if (l, r) in cache:
return cache[(l, r)]
cache[(l, r)] = min(dfs(l, m) + dfs(m + 1, r) + L[l][0] * L[m][1] * L[m + 1][0] * L[r][1] for m in range(l, r))
return cache[(l, r)]
cache = {}
L = [list(map(int, input().split())) for _ in range(eval(input()))]... | [["-", 12, 657, 31, 657, 31, 657, 31, 206, 206, 612], ["+", 12, 657, 31, 657, 31, 657, 31, 206, 206, 612], ["-", 12, 657, 31, 657, 31, 657, 12, 206, 206, 612], ["+", 12, 657, 31, 657, 31, 657, 12, 206, 206, 612], ["-", 8, 657, 12, 657, 31, 657, 12, 206, 206, 612], ["+", 8, 657, 12, 657, 31, 657, 12, 206, 206, 612], ["-... | 5 | 161 | 8 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
// const int INF = 1e8;
using namespace std;
// i???????????????????????????
bool getBit(int num, int... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
// const int INF = 1e8;
using namespace std;
// i???????????????????????????
bool getBit(int num, int... | [["-", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 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, 22]] | 1 | 603 | 6 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int i = 0, j, k, b, n, m, g, kn[100], km[15], sg[15], kg[32768], fr[32768][15],
bn[32768], e[16], ans[15];
double ti[32768][15], t;
int main() {
for (j = 1; j < 65536; j *= 2)
e[i++] = j;
for (j = 0; j < 327... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int i = 0, j, k, b, n, m, g, kn[100], km[15], sg[15], kg[32768], fr[32768][15],
bn[32768], e[16], ans[15];
double ti[32768][15], t;
int main() {
for (j = 1; j < 65536; j *= 2)
e[i++] = j;
for (j = 0; j < 327... | [["-", 0, 11, 12, 16, 12, 74, 39, 77, 39, 40], ["-", 0, 1, 0, 11, 12, 16, 12, 74, 0, 25], ["-", 0, 11, 12, 16, 12, 74, 51, 23, 0, 24], ["+", 12, 23, 0, 16, 31, 16, 12, 74, 0, 24], ["+", 0, 16, 31, 16, 12, 74, 39, 77, 39, 40], ["+", 12, 23, 0, 16, 31, 16, 12, 74, 0, 25]] | 1 | 653 | 6 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 31, 13], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 17, 151]] | 1 | 727 | 4 |
import static java.lang.Math.*;
import static java.lang.System.out;
import java.util.*;
// AOJ3
public class Main {
final Scanner sc = new Scanner(System.in);
final int[] vx = {0, 1, 0, -1}, vy = {-1, 0, 1, 0};
static class Point {
int x, y;
Point(int x, int y) {
this.x = x;
this.y = y;
... | import static java.lang.Math.*;
import static java.lang.System.out;
import java.util.*;
// AOJ3
public class Main {
final Scanner sc = new Scanner(System.in);
final int[] vx = {0, 1, 0, -1}, vy = {-1, 0, 1, 0};
static class Point {
int x, y;
Point(int x, int y) {
this.x = x;
this.y = y;
... | [["-", 8, 196, 0, 1, 0, 11, 12, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 492, 141, 22], ["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19], ["-", 0, 493, 0, 235, 8, 498, 0, 195, 141, 22], ["+", 0, 493, 0, 235, 8, 498, 0, 195, 141, 22]] | 3 | 1,354 | 6 |
import java.io.*;
import java.util.*;
public class Main {
int[] ans = new int[100];
public int judge(int[] seat, int i) {
int key = -1;
int[] dp = new int[18];
int num = (i % 5 == 1) ? 5 : 2;
for (int j = 1; j < 18; j++) {
if (seat[j - 1] == -1) {
dp[j] = dp[j - 1] + 1;
if (d... | import java.io.*;
import java.util.*;
public class Main {
int[] ans = new int[120];
public int judge(int[] seat, int i) {
int key = -1;
int[] dp = new int[18];
int num = (i % 5 == 1) ? 5 : 2;
for (int j = 1; j < 18; j++) {
if (seat[j - 1] == -1) {
dp[j] = dp[j - 1] + 1;
if (d... | [["-", 0, 124, 49, 200, 51, 227, 497, 505, 0, 499], ["+", 0, 124, 49, 200, 51, 227, 497, 505, 0, 499], ["-", 0, 195, 8, 196, 0, 7, 15, 16, 12, 499], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 12, 499]] | 3 | 878 | 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[] arrivals = new int[100];
int[] seats = new int[17];
int[] end_seats = new int[17];
int[] wait = new int[100];
Arrays.fill(seats, -1);
... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] arrivals = new int[100];
int[] seats = new int[17];
int[] end_seats = new int[17];
int[] wait = new int[100];
Arrays.fill(seats, -1);
... | [["-", 0, 52, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 428 | 2 |
import java.util.*;
public class Main {
Scanner sc = new Scanner(System.in);
int[][] data;
int[] table;
LinkedList<Integer> mat;
private void doit() {
data = new int[100][2];
init();
while (sc.hasNext()) {
int n = sc.nextInt();
System.out.println(data[n][1] - data[n][0]);
}
}
... | import java.util.*;
public class Main {
Scanner sc = new Scanner(System.in);
int[][] data;
int[] table;
LinkedList<Integer> mat;
private void doit() {
data = new int[100][2];
init();
while (sc.hasNext()) {
int n = sc.nextInt();
System.out.println(data[n][1] - data[n][0]);
}
}
... | [["-", 51, 16, 31, 16, 31, 16, 31, 504, 71, 499], ["+", 51, 16, 31, 16, 31, 16, 31, 504, 71, 499]] | 3 | 584 | 2 |
// 32
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
for (int n; cin >> n, n;) {
int ans = 0;
while (n--) {
int s[] = {60, 80, 100, 120, 140, 160};
int wt[] = {2, 5, 10, 15, 20, 25};
int p[] = {600, 800, 1000, 1200, 1400, 1600, 0};
int x, y, h, w;
ci... | // 32
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
for (int n; cin >> n, n;) {
int ans = 0;
while (n--) {
int s[] = {60, 80, 100, 120, 140, 160};
int wt[] = {2, 5, 10, 15, 20, 25};
int p[] = {600, 800, 1000, 1200, 1400, 1600, 0};
int x, y, h, w;
ci... | [["-", 31, 2, 3, 4, 0, 16, 31, 16, 12, 22], ["+", 31, 2, 3, 4, 0, 16, 31, 16, 12, 22], ["-", 0, 16, 31, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 12, 22]] | 1 | 166 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int sum = 0;
for (int i = 0; i < n; ++i) {
int x, y, h, w;
cin >> x >> y >> h >> w;
int s = x + y + h;
if (s <= 60 && w <= 2)
sum += 600;
else if (s <= 80 && w <= 5)
sum +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int sum = 0;
for (int i = 0; i < n; ++i) {
int x, y, h, w;
cin >> x >> y >> h >> w;
int s = x + y + h;
if (s <= 60 && w <= 2)
sum += 600;
else if (s <= 80 && w <= 5)
sum +... | [["-", 75, 76, 0, 57, 64, 1, 0, 16, 17, 60], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 17, 107]] | 1 | 172 | 2 |
until (n = gets.to_i) == 0
sum = 0
n.times do
x, y, h, w = file.gets.split.map(&:to_i)
s = x + y + h
if s <= 60 and w <= 2
sum += 600
elsif s <= 80 and w <= 5
sum += 800
elsif s <= 100 and w <= 10
sum += 1000
elsif s <= 120 and w <= 15
sum += 1200
elsif s <= 140 a... | until (n = gets.to_i) == 0
sum = 0
n.times do
x, y, h, w = gets.split.map(&:to_i)
s = x + y + h
if s <= 60 and w <= 2
sum += 600
elsif s <= 80 and w <= 5
sum += 800
elsif s <= 100 and w <= 10
sum += 1000
elsif s <= 120 and w <= 15
sum += 1200
elsif s <= 140 and w ... | [["-", 0, 662, 12, 652, 486, 652, 486, 652, 486, 22], ["-", 0, 662, 12, 652, 486, 652, 486, 652, 17, 131]] | 4 | 114 | 2 |
criteria = [
[60, 2, 600],
[80, 5, 800],
[100, 10, 1000],
[120, 15, 1200],
[140, 20, 1400],
[160, 25, 1600]
]
while line = gets
n = line.chomp.to_i
break if n == 0
fee = 0
n.times do
x, y, h, w = gets.chomp.split.map(&:to_i)
criteria.each do |a|
if [x, y, h].max <= a[0] && w <= a[1]... | criteria = [
[60, 2, 600],
[80, 5, 800],
[100, 10, 1000],
[120, 15, 1200],
[140, 20, 1400],
[160, 25, 1600]
]
while line = gets
n = line.chomp.to_i
break if n == 0
fee = 0
n.times do
x, y, h, w = gets.chomp.split.map(&:to_i)
criteria.each do |a|
if x + y + h <= a[0] && w <= a[1]
... | [["-", 15, 738, 31, 738, 31, 652, 486, 516, 0, 70], ["-", 15, 738, 31, 738, 31, 652, 486, 516, 0, 21], ["+", 15, 738, 31, 738, 31, 738, 31, 738, 17, 72], ["+", 0, 121, 15, 738, 31, 738, 31, 738, 17, 72], ["-", 15, 738, 31, 738, 31, 652, 486, 516, 0, 73], ["-", 0, 121, 15, 738, 31, 738, 31, 652, 17, 131], ["-", 0, 121, ... | 4 | 135 | 8 |
def f(x, y):
x = 6
for a, b in zip(A, B):
if x <= a and y <= b: x -= 1
return x
A = list(range(60, 180, 20))
B = [2] + list(range(5, 30, 5))
C = list(range(600, 1800, 200))
while True:
n = eval(input())
if n==0: break
s = 0
for _ in [0]*n:
x, y, h, w = list(map(int, input().split()))
r = f(x... | def f(x, y):
c = 6
for a, b in zip(A, B):
if x <= a and y <= b: c -= 1
return c
A = list(range(60, 180, 20))
B = [2] + list(range(5, 30, 5))
C = list(range(600, 1800, 200))
while True:
n = eval(input())
if n==0: break
s = 0
for _ in [0]*n:
x, y, h, w = list(map(int, input().split()))
r = f(x... | [["-", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["-", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22], ["-", 0, 656, 0, 14, 8, 196, 0, 37, 0, 22], ["+", 0, 656, 0, 14, 8, 196, 0, 37, 0, 22]] | 5 | 159 | 6 |
from bisect import bisect_left
S = [60,80,100,120,140,160]
W = [2,5,10,15,20,25]
F = [600,800,1000,1200,1400,1600,0]
def func(x,y,h,w):
return F[max(bisect_left(S,max(x,y,h)),bisect_left(W,w))]
while True:
n = eval(input())
if n == 0:
break
print(sum(func(*list(map(int,input().split()))) for _ i... | from bisect import bisect_left
S = [60,80,100,120,140,160]
W = [2,5,10,15,20,25]
F = [600,800,1000,1200,1400,1600,0]
def func(x,y,h,w):
return F[max(bisect_left(S,x+y+h),bisect_left(W,w))]
while True:
n = eval(input())
if n == 0:
break
print(sum(func(*list(map(int,input().split()))) for _ in ran... | [["-", 3, 4, 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], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 72], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 139 | 7 |
INF = 10000000000
sl = [60, 80, 100, 120, 140, 160, INF]
wl = [2, 5, 10, 15, 20, 25, INF]
pl = [600, 800, 1000, 1200, 1400, 1600, 0 ]
def le(n, l):
for i, v in enumerate(l):
if v >= n:
return i
while True:
N = eval(input())
if not N:
break
s = 0
for i in range(N):
x, y, ... | INF = 10000000000
sl = [60, 80, 100, 120, 140, 160, INF]
wl = [2, 5, 10, 15, 20, 25, INF]
pl = [600, 800, 1000, 1200, 1400, 1600, 0 ]
def le(n, l):
for i, v in enumerate(l):
if v >= n:
return i
while True:
N = eval(input())
if not N:
break
s = 0
for i in range(N):
x, y, ... | [["-", 3, 4, 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], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 72], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 161 | 7 |
#include <stdio.h>
int main(void) {
int n, i, j;
while (1) {
scanf("&d", &n);
if (n == 0)
break;
int teamnum[n];
int timedata[n][8];
int time[n];
for (i = 0; i < n; i++) {
scanf("%d", &teamnum[i]);
for (j = 0; j < 8; j++)
scanf("%d", &timedata[i][j]);
}
... | #include <stdio.h>
int main(void) {
int n, i, j;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
int teamnum[n];
int timedata[n][8];
int time[n];
for (i = 0; i < n; i++) {
scanf("%d", &teamnum[i]);
for (j = 0; j < 8; j++)
scanf("%d", &timedata[i][j]);
}
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 360 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int a, b, n;
pair<int, int> x[8000000];
int main() {
while (true) {
memset(x, 0, sizeof(x));
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> x[i].second;
for (int i = 0; i < 4; ... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int a, b, n;
pair<int, int> x[8000000];
int main() {
while (true) {
memset(x, 0, sizeof(x));
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> x[i].second;
for (int j = 0; j < 4; ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["-", 31, 16, 31, 16, 31, 16, 12, 118, 119, 120], ["+", 31, 16, 31, 1... | 1 | 166 | 12 |
#include <algorithm>
#include <stdio.h>
using namespace std;
int n, m, s;
pair<int, int> d[1000000];
int main() {
while (true) {
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d", &d[i].second);
d[i].first = 0;
for (int j = 0; j < 4; j++)
scanf("%... | #include <algorithm>
#include <stdio.h>
using namespace std;
int n, m, s;
pair<int, int> d[1000000];
int main() {
while (true) {
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d", &d[i].second);
d[i].first = 0;
for (int j = 0; j < 4; j++)
scanf("%... | [["-", 0, 118, 28, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 118, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 183 | 2 |
#include <math.h>
#include <stack>
#include <stdio.h>
using namespace std;
struct Info {
int id, sum;
};
int main() {
int n, m1, m2, m3, m4, s1, s2, s3, s4, tmp_id, tmp_sum;
Info table[4];
while (true) {
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < 4; i++) {
scanf("%d %d... | #include <math.h>
#include <stack>
#include <stdio.h>
using namespace std;
struct Info {
int id, sum;
};
int main() {
int n, m1, m2, m3, m4, s1, s2, s3, s4, tmp_id, tmp_sum;
Info table[4];
while (true) {
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < 4; i++) {
scanf("%d %d... | [["-", 0, 11, 31, 118, 28, 69, 341, 342, 0, 13], ["+", 0, 11, 31, 118, 28, 69, 341, 342, 0, 13]] | 1 | 544 | 4 |
#include <bits/stdc++.h>
using namespace std;
main() {
int n;
while (cin >> n, n) {
pair<int, int> a[n];
for (int i = 0; i < n; i++) {
int q, w, e, r, t, y, u, o, p;
cin >> q >> w >> e >> r >> t >> y >> u >> o >> p;
a[i].second = q;
a[i].first = (w + r + y + o) * 60 + e + t + u + p;
... | #include <bits/stdc++.h>
using namespace std;
main() {
int n;
while (cin >> n, n) {
pair<int, int> a[n];
for (int i = 0; i < n; i++) {
int q, w, e, r, t, y, u, o, p;
cin >> q >> w >> e >> r >> t >> y >> u >> o >> p;
a[i].second = q;
a[i].first = (w + r + y + o) * 60 + e + t + u + p;
... | [["-", 12, 118, 28, 69, 341, 342, 0, 16, 12, 13], ["+", 12, 118, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 166 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = 1000000;
boolean[] l = new boolean[n + 1];
int[] c = new int[n + 1];
l[1] = true;
c[1] = 1;
for (int i = 2; i <= n; i++) {
if (i % 2 == 0 && l[i / 2])
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = 1000000;
boolean[] l = new boolean[n + 1];
int[] c = new int[n + 1];
l[1] = true;
c[1] = 1;
for (int i = 2; i <= n; i++) {
if (i % 2 == 0 && l[i / 2])
... | [["+", 3, 4, 0, 16, 12, 504, 71, 16, 17, 33], ["+", 3, 4, 0, 16, 12, 504, 71, 16, 12, 499]] | 3 | 245 | 2 |
import java.util.*;
class Main {
public static void main(String[] args) {
Solve s = new Solve();
s.solve();
}
}
class Solve {
Solve() {}
Scanner in = new Scanner(System.in);
void solve() {
while (in.hasNext()) {
int n = in.nextInt();
if (n == 0)
return;
int ai = 0;
... | import java.util.*;
class Main {
public static void main(String[] args) {
Solve s = new Solve();
s.solve();
}
}
class Solve {
Solve() {}
Scanner in = new Scanner(System.in);
void solve() {
while (in.hasNext()) {
int n = in.nextInt();
if (n == 0)
return;
int ai = 10000... | [["-", 0, 52, 8, 196, 0, 503, 49, 200, 51, 499], ["+", 0, 52, 8, 196, 0, 503, 49, 200, 51, 499], ["-", 0, 52, 8, 196, 0, 503, 49, 200, 51, 515], ["+", 8, 196, 0, 503, 49, 200, 51, 91, 17, 33], ["+", 8, 196, 0, 503, 49, 200, 51, 91, 439, 515]] | 3 | 250 | 5 |
#include <stdio.h>
/*ûj BMI©çQQðø¢½lÅär·é*/
int main() {
int i, h, w, n, j, no = 100000000;
double BMI, BMI2 = 1000, BMIH;
while (1) {
scanf("%d", &n);
if (n == 0)
break; /*whileI¹ð*/
for (j = 0; j < n; j++) {
scanf("%d%d%d", &i, &h, &w);
BMI = (double)w / ... | #include <stdio.h>
/*æ¹éÂÂâÂÂ
* BMIãÂÂãÂÂï¼Âï¼ÂãÂÂå¼ÂãÂÂãÂÂå¤ã§æ¯Âè¼ÂãÂÂãÂÂ*/
int main() {
int i, h, w, n, j, no = 100000000;
double BMI, BMI2 = 1000, BMIH;
while (1) {
scanf("%d", &n);
if (n == 0)
break; /*whileçµÂäºÂæ¡件*/
... | [["+", 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 | 184 | 4 |
#include <stdio.h>
#define ABS(x) (((x) < 0) ? (-(x)) : (x))
int main(void) {
int i, j, k, n, num, h, w, nownum;
double now, bmi;
while (scanf("%d", &n) && n) {
now = 22;
for (i = 0; i < n; i++) {
scanf("%d %d %d", &num, &h, &w);
bmi = 10000 * w / (double)(h * h);
if (ABS(22 - bmi) < n... | #include <stdio.h>
#define ABS(x) (((x) < 0) ? (-(x)) : (x))
int main(void) {
int i, j, k, n, num, h, w, nownum;
double now, bmi;
while (scanf("%d", &n) && n) {
now = 100000;
for (i = 0; i < n; i++) {
scanf("%d %d %d", &num, &h, &w);
bmi = 10000 * w / (double)(h * h);
if (ABS(22 - bmi)... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 142 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
struct Human {
int n, h, w;
double bmi;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
struct Human {
int n, h, w;
double bmi;
... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 222 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int n, d, h, w, p;
int main() {
while (scanf("%d", &n), n) {
double s = 1.0e6;
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &d, &h, &w);
double r = abs(22.0 - 10000.0 * w / h / h);
if (r < s)
r = s, p = d;
}
printf("%... | #include <cmath>
#include <iostream>
using namespace std;
int n, d, h, w, p;
int main() {
while (scanf("%d", &n), n) {
double s = 1.0e6;
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &d, &h, &w);
double r = abs(22.0 - 10000.0 * w / h / h);
if (r < s)
s = r, p = d;
}
printf("%... | [["-", 0, 57, 64, 1, 0, 34, 31, 11, 31, 22], ["-", 0, 57, 64, 1, 0, 34, 31, 11, 17, 32], ["+", 0, 57, 64, 1, 0, 34, 31, 11, 17, 32], ["+", 0, 57, 64, 1, 0, 34, 31, 11, 12, 22]] | 1 | 121 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
int id = 1000000000;
double bmi = 22.0;
for (int i = 0; i < N; i++) {
int d;
double h, w;
cin >> d >> h >> w;
h /= 100.0;
if (bmi > abs(22.0 - (w / (h * h)))) {
id = d;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
int id = 1000000000;
double bmi = 2000.0;
for (int i = 0; i < N; i++) {
int d;
double h, w;
cin >> d >> h >> w;
h /= 100.0;
if (bmi > abs(22.0 - (w / (h * h)))) {
id = d;
... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 153 | 2 |
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | [["-", 0, 134, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 134, 39, 344, 3, 347, 0, 77, 39, 40]] | 1 | 309 | 4 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int bmi(double h, double w) { return w / ((h / 100) * (h / 100)); }
int main() {
int n, p;
double h, w;
const double c = 22;
while (true) {
cin >> n;
if (n == 0)
return 0;
int num;
double diff;
for (int i = 0;... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
double bmi(double h, double w) { return w / ((h / 100) * (h / 100)); }
int main() {
int n, p;
double h, w;
const double c = 22;
while (true) {
cin >> n;
if (n == 0)
return 0;
int num;
double diff;
for (int i =... | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40]] | 1 | 194 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["-", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 162 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 290 | 2 |
#include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int min;
int minnum;
double bmi[n];
for (int i = 0; i < n; i++) {
int num;
double tall, wei;
cin >> num >> tall >> wei;
bmi[i] = wei / (tall / 100) ... | #include <iostream>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
double min;
int minnum;
double bmi[n];
for (int i = 0; i < n; i++) {
int num;
double tall, wei;
cin >> num >> tall >> wei;
bmi[i] = wei / (tall / 10... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 191 | 3 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
#define BESTBMI 22
#define MAX 10000
class CDATA {
public:
int stnum;
double hei, wei;
int bmi;
void setBMI() { bmi = wei / (hei * hei); }
bool operator<(const CDATA &t) const {
if (abs(22 - bmi) == abs(22 - t.bmi))
r... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
#define BESTBMI 22
#define MAX 10000
class CDATA {
public:
int stnum;
double hei, wei;
double bmi;
void setBMI() { bmi = wei / (hei * hei); }
bool operator<(const CDATA &t) const {
if (abs(22 - bmi) == abs(22 - t.bmi))
... | [["-", 0, 30, 0, 353, 8, 123, 0, 124, 39, 40], ["+", 0, 30, 0, 353, 8, 123, 0, 124, 39, 40]] | 1 | 210 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
for (; cin >> n, n;) {
int num[n];
double data[n];
int min = 1000000;
int min_num;
for (int i = 0; i < n; i++) {
int a, b;
cin >> num[i] >> a >> b;
data[i] = (double)b / ((a / 100.0) * (a / 100.0));
/// cout<<... | #include <iostream>
using namespace std;
int main() {
int n;
for (; cin >> n, n;) {
int num[n];
double data[n];
double min = 1000000;
int min_num;
for (int i = 0; i < n; i++) {
int a, b;
cin >> num[i] >> a >> b;
data[i] = (double)b / ((a / 100.0) * (a / 100.0));
/// cou... | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40]] | 1 | 178 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, num;
double ta, omo, bmi;
while (cin >> n) {
if (n == 0) {
break;
}
double max = 100000, sa;
int best = 1000000;
for (int k = 0; k < n; k++) {
cin >> num >> ta >> omo;
bmi = omo * 10000 / (ta * ta);
if (bmi -... | #include <iostream>
using namespace std;
int main() {
int n, num;
double ta, omo, bmi;
while (cin >> n) {
if (n == 0) {
break;
}
double max = 100000, sa;
int best = 1000000;
for (int k = 0; k < n; k++) {
cin >> num >> ta >> omo;
bmi = omo * 10000 / (ta * ta);
if (bmi -... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 0, 57, 15, 339, 51, 16, 12, 23, 0, 24], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 31, 22], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 17,... | 1 | 144 | 8 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
while (true) {
int baggageNum = stdIn.nextInt();
if (baggageNum == 0)
break;
int cost = 0;
for (int i = 0; i < baggageNum; i++) {
int size = ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
while (true) {
int baggageNum = stdIn.nextInt();
if (baggageNum == 0)
break;
int cost = 0;
for (int i = 0; i < baggageNum; i++) {
int size = ... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 106], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 98]] | 3 | 225 | 2 |
#include <stdio.h>
int main(void) {
int size_limit[6] = {60, 80, 100, 120, 140, 160};
int weight_limit[6] = {2, 5, 10, 15, 20, 25};
int fee[6] = {600, 800, 1000, 1200, 1400, 1600};
int n;
int x, y, h, w;
int size;
int sum;
int i, j;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
... | #include <stdio.h>
int main(void) {
int size_limit[6] = {60, 80, 100, 120, 140, 160};
int weight_limit[6] = {2, 5, 10, 15, 20, 25};
int fee[6] = {600, 800, 1000, 1200, 1400, 1600};
int n;
int x, y, h, w;
int size;
int sum;
int i, j;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 0 | 231 | 2 |
#include <stdio.h>
int main(void) {
int x, y, h, w, n, i, j, k, money;
int count[6];
while (scanf("%d", &n), n) {
money = 0;
for (i = 0; i < 6; i++)
count[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d%d%d%d", &x, &y, &h, &w);
if (x + y + h <= 60) {
if (w <= 2)
count... | #include <stdio.h>
int main(void) {
int x, y, h, w, n, i, j, k, money;
int count[6];
while (scanf("%d", &n), n) {
money = 0;
for (i = 0; i < 6; i++)
count[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d%d%d%d", &x, &y, &h, &w);
if (x + y + h <= 60) {
if (w <= 2)
count... | [["-", 64, 57, 15, 23, 0, 16, 31, 16, 17, 33], ["-", 64, 57, 15, 23, 0, 16, 31, 16, 12, 13]] | 0 | 324 | 2 |
// #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <locale>
#include <map>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef ... | // #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <locale>
#include <map>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef ... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 320 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 202 | 2 |
#include <iostream>
using namespace std;
#define rep2(x, from, to) for (int x = (from); x < (to); ++(x))
#define rep(x, to) rep2(x, 0, to)
int main() {
int n;
int size[] = {0, 60, 80, 100, 120, 140, 160};
int weight[] = {0, 2, 5, 10, 15, 20, 25};
int cost[] = {600, 800, 1000, 1200, 1400, 1600, 0};
while (cin... | #include <iostream>
using namespace std;
#define rep2(x, from, to) for (int x = (from); x < (to); ++(x))
#define rep(x, to) rep2(x, 0, to)
int main() {
int n;
int size[] = {0, 60, 80, 100, 120, 140, 160};
int weight[] = {0, 2, 5, 10, 15, 20, 25};
int cost[] = {600, 800, 1000, 1200, 1400, 1600, 0};
while (cin... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 20]] | 1 | 214 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int n, m;
struct bill {
int b, x, y;
bill(int b, int x, int y) : b(b), x(x), y(y){};
};
vector<bill> bi;
map<int, int> bn;
map<int, int> bnb;
typ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int n, m;
struct bill {
int b, x, y;
bill(int b, int x, int y) : b(b), x(x), y(y){};
};
vector<bill> bi;
map<int, int> bn;
map<int, int> bnb;
typ... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22]] | 1 | 691 | 2 |
from collections import namedtuple, defaultdict
Point = namedtuple("Point", ["x", "y"])
def main():
while True:
n = eval(input())
if n == 0:
break
bldgs = {}
for _ in range(n):
b, x, y = list(map(int, input().split()))
bldgs[b] = Point(x, y)
... | from collections import namedtuple, defaultdict
Point = namedtuple("Point", ["x", "y"])
def main():
while True:
n = eval(input())
if n == 0:
break
bldgs = {}
for _ in range(n):
b, x, y = list(map(int, input().split()))
bldgs[b] = Point(x, y)
... | [["-", 3, 4, 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, 25]] | 5 | 441 | 3 |
#include <algorithm>
#include <iostream>
#define INF (1 << 24)
using namespace std;
int W, H, mini, mini_x, mini_y, ny, nx, cost, ans;
string str;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {-1, 0, 1, 0};
char t[102][102];
bool vd[102][102];
int u[102][102];
int main() {
while (cin >> W >> H) {
if (W == 0 && H == ... | #include <algorithm>
#include <iostream>
#define INF (1 << 24)
using namespace std;
int W, H, mini, mini_x, mini_y, ny, nx, cost, ans;
string str;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {-1, 0, 1, 0};
char t[102][102];
bool vd[102][102];
int u[102][102];
int main() {
while (cin >> W >> H) {
if (W == 0 && H == ... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 606 | 4 |
#include <stdio.h>
#include <string.h>
typedef struct {
int h, r;
} P;
int max(int a, int b) { return a > b ? a : b; }
int main(void) {
P t[201] = {0}, tt;
int l[201];
int n, m, i, j, p, res;
for (;;) {
scanf("%d", &n);
if (!n)
break;
for (i = 1; i <= n; i++)
scanf("%d%d", &t[i].h, &t[... | #include <stdio.h>
#include <string.h>
typedef struct {
int h, r;
} P;
int max(int a, int b) { return a > b ? a : b; }
int main(void) {
P t[201] = {0}, tt;
int l[201];
int n, m, i, j, p, res;
for (;;) {
scanf("%d", &n);
if (!n)
break;
for (i = 1; i <= n; i++)
scanf("%d%d", &t[i].h, &t[... | [["-", 8, 9, 0, 7, 8, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 17, 18]] | 0 | 384 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const int MAX = 100000;
int dp[200];
int dfs(int index, vector<pair<int, int>> &mato) {
if (dp[in... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const int MAX = 100000;
int dp[200];
int dfs(int index, vector<pair<int, int>> &mato) {
if (dp[in... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 356 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(5)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<short, short> P;... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) begin(a), end(a)
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(5)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<short, short> P;... | [["+", 0, 57, 15, 339, 51, 16, 31, 91, 17, 33], ["+", 0, 16, 31, 2, 3, 4, 0, 91, 17, 33], ["+", 3, 4, 0, 2, 3, 4, 0, 91, 17, 33]] | 1 | 407 | 4 |
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, m;
int table[250];
pair<int, int> data[250];
while (cin >> n) {
for (int i = 0; i < n; i++)
cin >> data[i].first >> data[i].second;
cin >> m;
for (int i = 0; i < m; i++)
cin >> data[n + i]... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, m;
int table[250];
pair<int, int> data[250];
while (cin >> n, n) {
for (int i = 0; i < n; i++)
cin >> data[i].first >> data[i].second;
cin >> m;
for (int i = 0; i < m; i++)
cin >> data[n +... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 298 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define PP(m) REP(i, m.size()) cout << m[i] << endl;
struct Ma {
int h, r;
bool operator<(const Ma &right) const {
return h == right.h ? r < right.r : h < right.h;
}
};
int main() {... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define PP(m) REP(i, m.size()) cout << m[i] << endl;
struct Ma {
int h, r;
bool operator<(const Ma &right) const {
return h == right.h ? r < right.r : h < right.h;
}
};
int main() {... | [["-", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 338 | 5 |
#include <bits/stdc++.h>
using namespace std;
struct doll {
int h, r;
};
bool operator<(const doll &d1, const doll &d2) {
if (d1.h == d2.h) {
return d1.r > d2.r;
}
return d1.h < d2.h;
}
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int h, r;
vector<doll> v... | #include <bits/stdc++.h>
using namespace std;
struct doll {
int h, r;
};
bool operator<(const doll &d1, const doll &d2) {
if (d1.h == d2.h) {
return d1.r > d2.r;
}
return d1.h < d2.h;
}
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int h, r;
vector<doll> v... | [["-", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 335 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
int h[200], r[200], dp[200];
while (1) {
cin >> n;
if (!n)
break;
for (int i = 0; i < n; i++)
cin >> h[i] >> r[i];
cin >> m;
for (int i = n; i < n + m; i++)
cin >> h[i] >> r[i];
for ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
int h[200], r[200], dp[200];
while (1) {
cin >> n;
if (!n)
break;
for (int i = 0; i < n; i++)
cin >> h[i] >> r[i];
cin >> m;
for (int i = n; i < n + m; i++)
cin >> h[i] >> r[i];
for ... | [["-", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13]] | 1 | 333 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
const int MAX_SIZE = 1000;
const int N = 100;
main() {
int n, m, sizeH, sizeR;
int dp[MAX_SIZE + 1][MAX_SIZE + 1];
int dataH[2][N];
int dataR[2][N];
while (cin >> n && n) {
sizeH = sizeR = 0;
for (int i = 0; i < n; ++i) {
cin >> da... | #include <algorithm>
#include <iostream>
using namespace std;
const int MAX_SIZE = 1001;
const int N = 100;
main() {
int n, m, sizeH, sizeR;
int dp[MAX_SIZE + 1][MAX_SIZE + 1];
int dataH[2][N];
int dataR[2][N];
while (cin >> n && n) {
sizeH = sizeR = 0;
for (int i = 0; i < n; ++i) {
cin >> da... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 527 | 10 |
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-10
#define equals(a, b) (fabs((a) - (b)) < EPS)
// c++ 11,14
#define COUNTER_CLOCKWISE 1
#define CLOCKWISE -1
#define ONLINE_BACK 2
#define ONLINE_FRONT -2
#define ON_SEGMENT 0
typedef struct point {
double x, y;
point(){};
point(double x, double y) : ... | #include <bits/stdc++.h>
using namespace std;
#define EPS 1e-10
#define equals(a, b) (fabs((a) - (b)) < EPS)
// c++ 11,14
#define COUNTER_CLOCKWISE 1
#define CLOCKWISE -1
#define ONLINE_BACK 2
#define ONLINE_FRONT -2
#define ON_SEGMENT 0
typedef struct point {
double x, y;
point(){};
point(double x, double y) : ... | [["-", 31, 16, 12, 2, 3, 4, 0, 69, 28, 22], ["+", 31, 16, 12, 2, 3, 4, 0, 69, 28, 22], ["-", 12, 16, 12, 2, 3, 4, 0, 69, 28, 22], ["+", 12, 16, 12, 2, 3, 4, 0, 69, 28, 22]] | 1 | 2,495 | 6 |
#include <bits/stdc++.h>
using namespace std;
// objects-----------------------------------------------------------------
typedef complex<double> Point;
typedef Point Vector;
typedef vector<Point> Polygon;
struct Segment {
Point p1, p2;
Segment(const Point &p1 = Point(), const Point &p2 = Point())
: p1(p1),... | #include <bits/stdc++.h>
using namespace std;
// objects-----------------------------------------------------------------
typedef complex<double> Point;
typedef Point Vector;
typedef vector<Point> Polygon;
struct Segment {
Point p1, p2;
Segment(const Point &p1 = Point(), const Point &p2 = Point())
: p1(p1),... | [["-", 28, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["+", 28, 2, 3, 4, 0, 69, 341, 342, 0, 22]] | 1 | 2,554 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
static const double eps = 1e-10;
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
bool equals(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
static const double eps = 1e-10;
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
bool equals(... | [["-", 15, 339, 51, 16, 31, 16, 31, 16, 17, 47], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 20], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 47], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 20], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20]] | 1 | 1,941 | 6 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#defin... | [["-", 31, 16, 31, 16, 31, 23, 0, 16, 17, 106], ["+", 31, 16, 31, 16, 31, 23, 0, 16, 17, 98], ["+", 31, 16, 31, 23, 0, 16, 12, 91, 17, 111], ["-", 31, 16, 31, 16, 12, 23, 0, 16, 17, 106], ["+", 31, 16, 31, 16, 12, 23, 0, 16, 17, 98], ["+", 31, 16, 12, 23, 0, 16, 12, 91, 17, 111], ["-", 51, 16, 31, 16, 12, 23, 0, 16, 17... | 1 | 1,959 | 9 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <v... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <v... | [["-", 51, 16, 31, 16, 31, 16, 12, 16, 17, 47], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 17, 20], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 47], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 20], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20], ["-", 15, 339, 51, 16, 31, 16, 31, ... | 1 | 2,624 | 12 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define dle(a, b) (equals(a, b) || a < b)
static const double PI = acos(-1);
class Point {
public:
... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define dle(a, b) (equals(a, b) || a < b)
static const double PI = acos(-1);
class Point {
public:
... | [["-", 51, 16, 31, 16, 31, 16, 31, 16, 17, 20], ["+", 51, 16, 31, 16, 31, 16, 31, 16, 17, 47], ["-", 51, 16, 31, 16, 31, 16, 12, 16, 17, 20], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 17, 47], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 20], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 47]] | 1 | 2,291 | 6 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int m = sc.nextInt();
if (m == 0)
break;
int[] a = new int[m + 1];
int[] b = new int[m + 1];
for (int i = 0; i < m; i++) {
a[i] = s... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int m = sc.nextInt();
if (m == 0)
break;
int[] a = new int[m + 1];
int[] b = new int[m + 1];
for (int i = 1; i <= m; i++) {
a[i] = ... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["-", 0, 52, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 276 | 4 |
#include <iostream>
using namespace std;
int card_value[7];
int card_num[7];
int sum1[1001];
int sum2[1001];
int sum3[1001];
void get_sum(int a, int b, int sum[], int count) {
if (a >= b) {
if (count <= 1000) {
sum[count]++;
}
} else {
for (int i = 0; i <= card_num[a]; i++) {
get_sum(a + ... | #include <iostream>
using namespace std;
int card_value[7];
int card_num[7];
int sum1[1001];
int sum2[1001];
int sum3[1001];
void get_sum(int a, int b, int sum[], int count) {
if (a >= b) {
if (count <= 1000) {
sum[count]++;
}
} else {
for (int i = 0; i <= card_num[a]; i++) {
get_sum(a + ... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 48]] | 1 | 328 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int m, g, n, a[8], b[8], dp[9][1000];
while (cin >> m, m) {
fill(a, a + 8, 0);
fill(b, b + 8, 0);
for (int i = 1; i <= m; i++) {
cin >> a[i] >> b[i];
}
fill(dp[0], dp[8], 0);
dp[0][... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int m, g, n, a[8], b[8], dp[9][1001];
while (cin >> m, m) {
fill(a, a + 8, 0);
fill(b, b + 8, 0);
for (int i = 1; i <= m; i++) {
cin >> a[i] >> b[i];
}
fill(dp[0], dp[9], 0);
dp[0][... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 8, 9, 0, 57, 1... | 1 | 248 | 10 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Ti = tuple<int, int, int>;
using Tl = tuple<ll, ll, ll>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define Get(t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Ti = tuple<int, int, int>;
using Tl = tuple<ll, ll, ll>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define Get(t... | [["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 740 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.