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()
#define CLR(a) memset(a, 0, sizeof(a))
typedef long long int ll;
using namespace std;
int main() {
vector<int> primes;
primes.PB(2);
FOR(i, 3, 20001) {
bool flg = true;
for (int j = 2; j * j <= i; j++) {
if (i % j == 0) {
flg = false;
break;
}
}
if (flg) {
primes.PB(i);
}
}
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int x = lower_bound(ALL(primes), n) - primes.begin();
RREP(i, x) {
if (primes[i] - primes[i - 1] == 2) {
cout << primes[i - 1] << " " << primes[i] << endl;
break;
}
}
}
return 0;
}
|
#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()
#define CLR(a) memset(a, 0, sizeof(a))
typedef long long int ll;
using namespace std;
int main() {
vector<int> primes;
primes.PB(2);
FOR(i, 3, 20001) {
bool flg = true;
for (int j = 2; j * j <= i; j++) {
if (i % j == 0) {
flg = false;
break;
}
}
if (flg) {
primes.PB(i);
}
}
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int x = upper_bound(ALL(primes), n) - primes.begin();
RREP(i, x) {
if (primes[i] - primes[i - 1] == 2) {
cout << primes[i - 1] << " " << primes[i] << endl;
break;
}
}
}
return 0;
}
|
[["-", 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);
used[i] = true;
for (int j = i * 2; j <= 10000; j += i) {
used[j] = true;
}
}
REP(i, 10000 + 1) if (!used[i]) {
prime.push_back(i);
used[i] = true;
}
vector<int> ans;
FOR(i, 1, prime.size()) {
if (prime[i] == prime[i - 1] + 2)
ans.push_back(prime[i]);
}
sort(ans.begin(), ans.end());
int n;
while (cin >> n, n) {
int b = *(lower_bound(ans.begin(), ans.end(), n) - 1);
int a = b - 2;
cout << a << " " << b << endl;
}
return 0;
}
|
#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);
used[i] = true;
for (int j = i * 2; j <= 10000; j += i) {
used[j] = true;
}
}
REP(i, 10000 + 1) if (!used[i]) {
prime.push_back(i);
used[i] = true;
}
vector<int> ans;
FOR(i, 1, prime.size()) {
if (prime[i] == prime[i - 1] + 2)
ans.push_back(prime[i]);
}
sort(ans.begin(), ans.end());
int n;
while (cin >> n, n) {
int b = *(upper_bound(ans.begin(), ans.end(), n) - 1);
int a = b - 2;
cout << a << " " << b << endl;
}
return 0;
}
|
[["-", 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 << endl;
break;
}
}
}
}
|
#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 << endl;
break;
}
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) {
flg = 0;
break;
}
}
if (flg == 1) {
ii = i - 2;
for (j = 2; j < ii; j++) {
if (ii % j == 0) {
flg = 0;
break;
}
}
}
if (flg == 1)
flg = 2;
}
if (flg == 2) {
p1 = ii;
q1 = i;
break;
}
}
cout << p1 << ' ' << q1 << endl;
p1 = 0;
q1 = 0;
}
return 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) {
flg = 0;
break;
}
}
if (flg == 1) {
ii = i - 2;
for (j = 2; j < ii; j++) {
if (ii % j == 0) {
flg = 0;
break;
}
}
}
if (flg == 1)
flg = 2;
}
if (flg == 2) {
p1 = ii;
q1 = i;
break;
}
}
cout << p1 << ' ' << q1 << endl;
p1 = 0;
q1 = 0;
}
return 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", k, k + 2);
}
}
}
return 0;
}
|
#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", k, k + 2);
break;
}
}
}
return 0;
}
|
[["+", 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;
}
return primes;
}
void MaximumTwinPrimes(const std::vector<bool> &primes) {
for (int i = primes.size() - 1; i >= 2; --i) {
if (primes[i] && primes[i - 2]) {
std::cout << i - 2 << " " << i << std::endl;
return;
}
}
}
int main() {
int n;
while ((std::cin >> n) && n > 0) {
std::vector<bool> primes = Eratosthenes(n);
MaximumTwinPrimes(primes);
}
}
|
#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;
}
return primes;
}
void MaximumTwinPrimes(const std::vector<bool> &primes) {
for (int i = primes.size() - 1; i >= 2; --i) {
if (primes[i] && primes[i - 2]) {
std::cout << i - 2 << " " << i << std::endl;
return;
}
}
}
int main() {
int n;
while ((std::cin >> n) && n > 0) {
std::vector<bool> primes = Eratosthenes(n);
MaximumTwinPrimes(primes);
}
}
|
[["-", 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] = NOsosu;
break;
}
}
katarogu[i - 1] = katarogu[i - 2];
katarogu[i] = katarogu[i - 2];
if (num[i] != NOsosu && num[i - 2] != NOsosu) {
katarogu[i] = i;
}
}
int a;
while (cin >> a, a != 0) {
cout << katarogu[a] - 2 << katarogu[a] << endl;
}
return 0;
}
|
#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] = NOsosu;
break;
}
}
katarogu[i - 1] = katarogu[i - 2];
katarogu[i] = katarogu[i - 2];
if (num[i] != NOsosu && num[i - 2] != NOsosu) {
katarogu[i] = i;
}
}
int a;
while (cin >> a, a != 0) {
cout << katarogu[a] - 2 << " " << katarogu[a] << endl;
}
return 0;
}
|
[["+", 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 maxtwin[10001], twin;
for (int i = 5; i < 10001; i++) {
if (prime[i] && prime[i - 2])
twin = i;
maxtwin[i] = twin;
}
for (int n; scanf("%d", n), n;) {
cout << maxtwin[n] - 2 << " " << maxtwin[n] << endl;
}
return 0;
}
|
#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] = false;
int maxtwin[10001], twin;
for (int i = 5; i < 10001; i++) {
if (prime[i] && prime[i - 2])
twin = i;
maxtwin[i] = twin;
}
for (int n; scanf("%d", &n), n;) {
cout << maxtwin[n] - 2 << " " << maxtwin[n] << endl;
}
return 0;
}
|
[["+", 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 < MAX; j += i)
prid[j] = 0;
}
for (int i = 0; i < MAX; i++)
if (prid[i])
pre[k++] = i;
int n, v;
while (cin >> n, n) {
k = 0;
while (pre[k++] < n)
v = k - 1;
for (int j = v; j >= 0; j--)
if (pre[j] - pre[j - 1] == 2) {
cout << pre[j - 1] << " " << pre[j] << endl;
break;
}
}
return 0;
}
|
#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 < MAX; j += i)
prid[j] = 0;
}
for (int i = 0; i < MAX; i++)
if (prid[i])
pre[k++] = i;
int n, v;
while (cin >> n, n) {
k = 0;
while (pre[k++] <= n)
v = k - 1;
for (int j = v; j >= 0; j--)
if (pre[j] - pre[j - 1] == 2) {
cout << pre[j - 1] << " " << pre[j] << endl;
break;
}
}
return 0;
}
|
[["-", 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) {
for (int i = n; 0 < i; i--) {
if (prime[i] && prime[i - 2]) {
cout << i - 1 << " " << i << endl;
return 0;
}
}
}
}
|
#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) {
for (int i = n; 0 < i; i--) {
if (prime[i] && prime[i - 2]) {
cout << i - 2 << " " << i << endl;
break;
}
}
}
}
|
[["-", 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%E3%82%B9%E3%81%AE%E7%AF%A9
"""
x = limit**0.5
primes = []
nums = [x for x in range(2, limit+1)]
while nums[0]<=x:
primes.append(nums[0])
current_prime = nums[0]
nums = [x for x in nums if x%current_prime != 0]
primes.extend(nums)
return primes
def main(args):
# ??????????´???°?????????
primes = create_prime_list(10000)
twin_primes = []
prev = primes[0]
for p in primes[1:]:
if p == prev + 2:
twin_primes.append([prev, p])
prev = p
keys = [x[1] for x in twin_primes]
while True:
n = int(input())
if n == 0:
break
r = bisect_left(keys, n)
print(*twin_primes[r-1])
if __name__ == '__main__':
main(sys.argv[1:])
|
# -*- 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%E3%82%B9%E3%81%AE%E7%AF%A9
"""
x = limit**0.5
primes = []
nums = [x for x in range(2, limit+1)]
while nums[0]<=x:
primes.append(nums[0])
current_prime = nums[0]
nums = [x for x in nums if x%current_prime != 0]
primes.extend(nums)
return primes
def main(args):
# ??????????´???°?????????
primes = create_prime_list(10000)
twin_primes = []
prev = primes[0]
for p in primes[1:]:
if p == prev + 2:
twin_primes.append([prev, p])
prev = p
keys = [x[1] for x in twin_primes]
while True:
n = int(input())
if n == 0:
break
r = bisect_right(keys, n)
print(*twin_primes[r-1])
if __name__ == '__main__':
main(sys.argv[1:])
|
[["-", 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)
for i in range(1,int(n**0.5)//3+1):
if sieve[i]:
k=3*i+1|1
sieve[ k*k//3 ::2*k] = [False] * ((n//6-k*k//6-1)//k+1)
sieve[k*(k-2*(i&1)+4)//3::2*k] = [False] * ((n//6-k*(k-2*(i&1)+4)//6-1)//k+1)
return [2,3] + [3*i+1|1 for i in range(1,n//3-correction) if sieve[i]]
primes = primes2(10000)
while True:
n = int(input())
if n == 0:
break
idx = bisect.bisect_left(primes, n)
while True:
#if idx == len(primes):
# idx -= 1
if primes[idx] >= n:
idx -= 1
if primes[idx] - primes[idx - 1] == 2:
print(primes[idx - 1], primes[idx])
break
idx -= 1
|
# 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)
for i in range(1,int(n**0.5)//3+1):
if sieve[i]:
k=3*i+1|1
sieve[ k*k//3 ::2*k] = [False] * ((n//6-k*k//6-1)//k+1)
sieve[k*(k-2*(i&1)+4)//3::2*k] = [False] * ((n//6-k*(k-2*(i&1)+4)//6-1)//k+1)
return [2,3] + [3*i+1|1 for i in range(1,n//3-correction) if sieve[i]]
primes = primes2(10050)
while True:
n = int(input())
if n == 0:
break
idx = bisect.bisect_left(primes, n)
while True:
#if idx == len(primes):
# idx -= 1
if primes[idx] > n:
idx -= 1
if primes[idx] - primes[idx - 1] == 2:
print(primes[idx - 1], primes[idx])
break
idx -= 1
|
[["-", 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_left(TP,n)-1]
print(m-2, m)
|
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)-1]
print(m-2, m)
|
[["-", 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;
for (i = 0; i < n; i++) {
a = b = c = d = 0;
for (j = 0; j < n; j++) {
if (x[i][j] == '1')
a++;
else {
ans = MAX(ans, a);
a = 0;
}
if (x[j][i] == '1')
b++;
else {
ans = MAX(ans, b);
b = 0;
}
if (j <= i) {
if (x[i - j][j] == '1')
c++;
else {
ans = MAX(ans, c);
c = 0;
}
if (x[i - j][n - 1 - j] == '1')
d++;
else {
ans = MAX(ans, d);
d = 0;
}
if (j == i) {
ans = MAX(ans, c);
ans = MAX(ans, d);
}
} else {
if (x[n + i - j][j] == '1')
c++;
else {
ans = MAX(ans, c);
c = 0;
}
if (x[n + i - j][n - 1 - j] == '1')
d++;
else {
ans = MAX(ans, d);
d = 0;
}
}
}
ans = MAX(ans, a);
ans = MAX(ans, b);
ans = MAX(ans, c);
ans = MAX(ans, d);
}
printf("%d\n", ans);
}
return 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;
for (i = 0; i < n; i++) {
a = b = c = d = 0;
for (j = 0; j < n; j++) {
if (x[i][j] == '1')
a++;
else {
ans = MAX(ans, a);
a = 0;
}
if (x[j][i] == '1')
b++;
else {
ans = MAX(ans, b);
b = 0;
}
if (j <= i) {
if (x[i - j][j] == '1')
c++;
else {
ans = MAX(ans, c);
c = 0;
}
if (x[i - j][n - 1 - j] == '1')
d++;
else {
ans = MAX(ans, d);
d = 0;
}
if (j == i) {
ans = MAX(ans, c);
ans = MAX(ans, d);
c = d = 0;
}
} else {
if (x[n + i - j][j] == '1')
c++;
else {
ans = MAX(ans, c);
c = 0;
}
if (x[n + i - j][n - 1 - j] == '1')
d++;
else {
ans = MAX(ans, d);
d = 0;
}
}
}
ans = MAX(ans, a);
ans = MAX(ans, b);
ans = MAX(ans, c);
ans = MAX(ans, d);
}
printf("%d\n", ans);
}
return 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++) {
cin >> board[i];
}
for (int i = 0; i < n; i++) {
wchain = 0;
for (int j = 0; j < n; j++) {
if (board[i][j] == '1') {
wchain++;
} else {
ans = max(ans, wchain);
wchain = 0;
}
}
ans = max(ans, wchain);
}
for (int i = 0; i < n; i++) {
hchain = 0;
for (int j = 0; j < n; j++) {
if (board[j][i] == '1') {
hchain++;
} else {
ans = max(ans, hchain);
hchain = 0;
}
}
ans = max(ans, wchain);
}
for (int i = 0; i < n; i++) {
schain = 0;
int h = i, w = 0;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
while ((h - 1) >= 0 && (w + 1) < n) {
h--;
w++;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
}
ans = max(ans, schain);
}
for (int i = 0; i < n; i++) {
schain = 0;
int h = n - 1, w = i;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
while ((h - 1) >= 0 && (w + 1) < n) {
h--;
w++;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
}
ans = max(ans, schain);
}
for (int i = 0; i < n; i++) {
schain = 0;
int h = i, w = 0;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
while ((h + 1) < n && (w + 1) < n) {
h++;
w++;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
}
ans = max(ans, schain);
}
for (int i = 0; i < n; i++) {
schain = 0;
int h = 0, w = i;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
while ((h + 1) < n && (w + 1) < n) {
h++;
w++;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
}
ans = max(ans, schain);
}
cout << ans << endl;
}
return 0;
}
|
#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++) {
cin >> board[i];
}
for (int i = 0; i < n; i++) {
wchain = 0;
for (int j = 0; j < n; j++) {
if (board[i][j] == '1') {
wchain++;
} else {
ans = max(ans, wchain);
wchain = 0;
}
}
ans = max(ans, wchain);
}
for (int i = 0; i < n; i++) {
hchain = 0;
for (int j = 0; j < n; j++) {
if (board[j][i] == '1') {
hchain++;
} else {
ans = max(ans, hchain);
hchain = 0;
}
}
ans = max(ans, hchain);
}
for (int i = 0; i < n; i++) {
schain = 0;
int h = i, w = 0;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
while ((h - 1) >= 0 && (w + 1) < n) {
h--;
w++;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
}
ans = max(ans, schain);
}
for (int i = 0; i < n; i++) {
schain = 0;
int h = n - 1, w = i;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
while ((h - 1) >= 0 && (w + 1) < n) {
h--;
w++;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
}
ans = max(ans, schain);
}
for (int i = 0; i < n; i++) {
schain = 0;
int h = i, w = 0;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
while ((h + 1) < n && (w + 1) < n) {
h++;
w++;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
}
ans = max(ans, schain);
}
for (int i = 0; i < n; i++) {
schain = 0;
int h = 0, w = i;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
while ((h + 1) < n && (w + 1) < n) {
h++;
w++;
if (board[h][w] == '1') {
schain++;
} else {
ans = max(ans, schain);
schain = 0;
}
}
ans = max(ans, schain);
}
cout << ans << endl;
}
return 0;
}
|
[["-", 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[x][y] == '0')
return;
ans = max(ans, d);
dfs(x + dx[k], y + dy[k], d + 1, k);
return;
}
void solve(int k) {
memset(used, false, sizeof(used));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dfs(i, j, 1, k);
}
}
return;
}
int main() {
while (1) {
ans = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> f[i][j];
}
}
for (int i = 0; i < 4; i++)
solve(i);
cout << ans << endl;
}
return 0;
}
|
#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[x][y] == '0')
return;
ans = max(ans, d);
dfs(x + dx[k], y + dy[k], d + 1, k);
return;
}
void solve(int k) {
memset(used, false, sizeof(used));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dfs(i, j, 1, k);
}
}
return;
}
int main() {
while (1) {
ans = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> f[i][j];
}
}
for (int i = 0; i < 4; i++)
solve(i);
cout << ans << endl;
}
return 0;
}
|
[["-", 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;
return cnt(y + dy[d], x + dx[d], d) + 1;
}
int main() {
while (cin >> n, n) {
V.clear();
string str;
int mx = -1;
rep(i, n) {
cin >> str;
V.push_back(str);
}
rep(i, n) rep(j, n) rep(k, 3) mx = max(mx, cnt(i, j, k));
cout << mx << endl;
}
}
|
#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;
return cnt(y + dy[d], x + dx[d], d) + 1;
}
int main() {
while (cin >> n, n) {
V.clear();
string str;
int mx = -1;
rep(i, n) {
cin >> str;
V.push_back(str);
}
rep(i, n) rep(j, n) rep(k, 4) mx = max(mx, cnt(i, j, k));
cout << mx << endl;
}
}
|
[["+", 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[y][x] == 0)
break;
x += dx[k], y += dy[k];
cnt += 1;
}
return cnt;
}
int main() {
while (cin >> n, n) {
rep(i, n) {
string str;
cin >> str;
rep(j, str.size()) { field[i][j] = str[j] - '0'; }
}
int ans = 0;
rep(i, n) {
rep(j, n) {
if (field[i][j] == 0)
continue;
rep(k, 3) { ans = max(func(j, i, k), ans); }
}
}
cout << ans << endl;
}
return 0;
}
|
#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[y][x] == 0)
break;
x += dx[k], y += dy[k];
cnt += 1;
}
return cnt;
}
int main() {
while (cin >> n, n) {
rep(i, n) {
string str;
cin >> str;
rep(j, str.size()) { field[i][j] = str[j] - '0'; }
}
int ans = 0;
rep(i, n) {
rep(j, n) {
if (field[i][j] == 0)
continue;
rep(k, 4) { ans = max(func(j, i, k), ans); }
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 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 = 0;
memset(check, 0, sizeof(check));
memset(gyomax, 0, sizeof(gyomax));
memset(retumax, 0, sizeof(retumax));
gyoans = 0;
retuans = 0;
memset(gyonum, 0, sizeof(gyonum));
memset(retunum, 0, sizeof(retunum));
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> maps[i][j];
if (maps[i][j] == '1') {
gyonum[i]++;
gyomax[i] = max(gyomax[i], gyonum[i]);
retunum[j]++;
retumax[j] = max(retumax[j], retunum[j]);
} else {
gyonum[i] = 0;
retunum[j] = 0;
}
}
}
gyoans = *(max_element(gyomax, gyomax + n));
retuans = *(max_element(retumax, retumax + n));
// cout<<gyoans<<" "<<retuans<<endl;
ans = max(gyoans, retuans);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (maps[i][j] == '1' && check[i][j] == 0) {
check[i][j] = 1;
ans = max(ans, underR(i, j));
ans = max(ans, underL(i, j));
}
}
}
cout << ans << endl;
}
}
int underR(int y, int x) {
int num = 0;
if (maps[y][x] == '0') {
return 0;
} else {
num++;
if (y + 1 < n && x + 1 < n) {
num += underR(y + 1, x + 1);
}
return num;
}
}
int underL(int y, int x) {
int num = 0;
if (maps[y][x] == '0') {
return 0;
} else {
num++;
if (y + 1 < n && x - 1 >= 0) {
num += underR(y + 1, x - 1);
}
return num;
}
}
|
#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 = 0;
memset(check, 0, sizeof(check));
memset(gyomax, 0, sizeof(gyomax));
memset(retumax, 0, sizeof(retumax));
gyoans = 0;
retuans = 0;
memset(gyonum, 0, sizeof(gyonum));
memset(retunum, 0, sizeof(retunum));
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> maps[i][j];
if (maps[i][j] == '1') {
gyonum[i]++;
gyomax[i] = max(gyomax[i], gyonum[i]);
retunum[j]++;
retumax[j] = max(retumax[j], retunum[j]);
} else {
gyonum[i] = 0;
retunum[j] = 0;
}
}
}
/*
for(int i=0;i<n;i++){
cout<<gyomax[i]<<" ";
}
cout<<endl;
for(int i=0;i<n;i++){
cout<<retumax[i]<<" ";
}
cout<<endl;
*/
gyoans = *(max_element(gyomax, gyomax + n));
retuans = *(max_element(retumax, retumax + n));
// cout<<gyoans<<" "<<retuans<<endl;
ans = max(gyoans, retuans);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (maps[i][j] == '1' && check[i][j] == 0) {
check[i][j] = 1;
ans = max(ans, underR(i, j));
ans = max(ans, underL(i, j));
}
}
}
cout << ans << endl;
}
}
int underR(int y, int x) {
int num = 0;
if (maps[y][x] == '0') {
return 0;
} else {
num++;
if (y + 1 < n && x + 1 < n) {
num += underR(y + 1, x + 1);
}
return num;
}
}
int underL(int y, int x) {
int num = 0;
if (maps[y][x] == '0') {
return 0;
} else {
num++;
if (y + 1 < n && x - 1 >= 0) {
num += underL(y + 1, x - 1);
}
return num;
}
}
|
[["-", 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';
}
}
int MAX = 0;
for (int e = 0; e < a; e++) {
for (int f = 0; f < a; f++) {
for (int h = -1; h < 2; h++) {
for (int i = -1; i < 2; i++) {
if (h || i) {
int g = 0;
for (int j = 0; e + h * j >= 0 && e + h * j < a &&
f + i * j >= 0 && f + i * j < a;
j++) {
if (b[e + h * j][f + i * j]) {
g++;
MAX = max(MAX, g);
} else
g--;
}
}
}
}
}
}
cout << MAX << endl;
}
}
|
#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';
}
}
int MAX = 0;
for (int e = 0; e < a; e++) {
for (int f = 0; f < a; f++) {
for (int h = -1; h < 2; h++) {
for (int i = -1; i < 2; i++) {
if (h || i) {
int g = 0;
for (int j = 0; e + h * j >= 0 && e + h * j < a &&
f + i * j >= 0 && f + i * j < a;
j++) {
if (b[e + h * j][f + i * j]) {
g++;
MAX = max(MAX, g);
} else
g = 0;
}
}
}
}
}
}
cout << MAX << endl;
}
}
|
[["-", 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)
break;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
char c;
cin >> c;
G[i + 1][j + 1] = c - '0';
}
}
for (int j = 1; j < n + 1; j++) {
if (G[1][j] == 1) {
for (int k = 0; k < 4; k++) {
if (k == 0) {
H[1][j][k] = H[1][j - 1][0] + 1;
} else {
H[1][j][k] = 1;
}
}
}
}
for (int i = 2; i < n + 1; i++) {
for (int j = 1; j < n + 1; j++) {
if (G[i][j]) {
H[i][j][0] = H[i][j - 1][0] + 1;
H[i][j][1] = H[i][j - 1][1] + 1;
H[i][j][2] = H[i - 1][j][2] + 1;
H[i][j][3] = H[i - 1][j + 1][3] + 1;
}
}
}
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < n + 1; j++) {
for (int k = 0; k < 4; k++) {
ans = max(ans, H[i][j][k]);
}
}
}
cout << ans << endl;
}
return 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)
break;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
char c;
cin >> c;
G[i + 1][j + 1] = c - '0';
}
}
for (int j = 1; j < n + 1; j++) {
if (G[1][j]) {
for (int k = 0; k < 4; k++) {
if (k == 0) {
H[1][j][k] = H[1][j - 1][0] + 1;
} else {
H[1][j][k] = 1;
}
}
}
}
for (int i = 2; i < n + 1; i++) {
for (int j = 1; j < n + 1; j++) {
if (G[i][j]) {
H[i][j][0] = H[i][j - 1][0] + 1;
H[i][j][1] = H[i - 1][j - 1][1] + 1;
H[i][j][2] = H[i - 1][j][2] + 1;
H[i][j][3] = H[i - 1][j + 1][3] + 1;
}
}
}
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < n + 1; j++) {
for (int k = 0; k < 4; k++) {
ans = max(ans, H[i][j][k]);
}
}
}
cout << ans << endl;
}
return 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("%s", table1[i]);
}
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
yen[i][j] = slash[i][j] = tate[i][j] = yoko[i][j] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == 0 && table1[i][j] == '1')
tate[i][j] = 1;
else if (i > 0 && table1[i][j] == '1')
tate[i][j] = tate[i - 1][j] + 1;
if (j == 0 && table1[i][j] == '1')
yoko[i][j] = 1;
else if (j > 0 && table1[i][j] == '1')
yoko[i][j] = yoko[i][j - 1] + 1;
if ((i == 0 || j == 0) && table1[i][j] == '1')
yen[i][j] = 1;
else if (table1[i][j] == '1')
yen[i][j] = yen[i - 1][j - 1] + 1;
}
}
for (int i = n - 1; i >= 0; i--) {
for (int j = 0; j < n; j++) {
if ((i == n - 1 || j == n - 1) && table1[i][j] == '1')
slash[i][j] = 1;
else if (table1[i][j] == '1')
slash[i][j] = slash[i + 1][j + 1] + 1;
}
}
int ret = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
if (ret < yen[i][j])
ret = yen[i][j];
if (ret < slash[i][j])
ret = slash[i][j];
if (ret < yoko[i][j])
ret = yoko[i][j];
if (ret < tate[i][j])
ret = tate[i][j];
}
printf("%d\n", ret);
}
}
|
#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("%s", table1[i]);
}
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
yen[i][j] = slash[i][j] = tate[i][j] = yoko[i][j] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == 0 && table1[i][j] == '1')
tate[i][j] = 1;
else if (i > 0 && table1[i][j] == '1')
tate[i][j] = tate[i - 1][j] + 1;
if (j == 0 && table1[i][j] == '1')
yoko[i][j] = 1;
else if (j > 0 && table1[i][j] == '1')
yoko[i][j] = yoko[i][j - 1] + 1;
if ((i == 0 || j == n - 1) && table1[i][j] == '1')
yen[i][j] = 1;
else if (table1[i][j] == '1')
yen[i][j] = yen[i - 1][j + 1] + 1;
}
}
for (int i = n - 1; i >= 0; i--) {
for (int j = 0; j < n; j++) {
if ((i == n - 1 || j == n - 1) && table1[i][j] == '1')
slash[i][j] = 1;
else if (table1[i][j] == '1')
slash[i][j] = slash[i + 1][j + 1] + 1;
}
}
int ret = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
if (ret < yen[i][j])
ret = yen[i][j];
if (ret < slash[i][j])
ret = slash[i][j];
if (ret < yoko[i][j])
ret = yoko[i][j];
if (ret < tate[i][j])
ret = tate[i][j];
}
printf("%d\n", ret);
}
}
|
[["-", 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 <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
typedef pair<int, int> PI;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define F first
#define S second
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
main() {
int n;
while (cin >> n, n) {
int grid[n][n], tate[n][n], yoko[n][n], lurd[n][n], ruld[n][n];
char c;
rep(i, n) rep(j, n) {
cin >> c;
tate[i][j] = yoko[i][j] = lurd[i][j] = ruld[i][j] = grid[i][j] = c - '0';
}
int ans = 0;
rep(i, n) {
rep(j, n) {
if (grid[i][j] == 0)
continue;
if (i && j + 1 < n && ruld[i - 1][j + 1])
ruld[i][j] = max(ruld[i][j], ruld[i - 1][j + 1] + 1);
if (i && tate[i - 1][j])
tate[i][j] = max(tate[i][j], tate[i - 1][j] + 1);
if (i && j && lurd[i - 1][j - 1])
lurd[i][j] = max(lurd[i][j], lurd[i - 1][j - 1] + 1);
if (i && yoko[i][j - 1])
yoko[i][j] = max(yoko[i][j], yoko[i][j - 1] + 1);
ans = max(
ans, max(tate[i][j], max(yoko[i][j], max(lurd[i][j], ruld[i][j]))));
}
}
rep(i, n) {
rep(j, n) {
// printf("%2d",grid[i][j]);
}
// cout<<endl;
}
cout << ans << endl;
}
}
|
#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 <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
typedef pair<int, int> PI;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define F first
#define S second
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
main() {
int n;
while (cin >> n, n) {
int grid[n][n], tate[n][n], yoko[n][n], lurd[n][n], ruld[n][n];
char c;
rep(i, n) rep(j, n) {
cin >> c;
tate[i][j] = yoko[i][j] = lurd[i][j] = ruld[i][j] = grid[i][j] = c - '0';
}
int ans = 0;
rep(i, n) {
rep(j, n) {
if (grid[i][j] == 0)
continue;
if (i && j + 1 < n && ruld[i - 1][j + 1])
ruld[i][j] = max(ruld[i][j], ruld[i - 1][j + 1] + 1);
if (i && tate[i - 1][j])
tate[i][j] = max(tate[i][j], tate[i - 1][j] + 1);
if (i && j && lurd[i - 1][j - 1])
lurd[i][j] = max(lurd[i][j], lurd[i - 1][j - 1] + 1);
if (j && yoko[i][j - 1])
yoko[i][j] = max(yoko[i][j], yoko[i][j - 1] + 1);
ans = max(
ans, max(tate[i][j], max(yoko[i][j], max(lurd[i][j], ruld[i][j]))));
}
}
rep(i, n) {
rep(j, n) {
// printf("%2d",grid[i][j]);
}
// cout<<endl;
}
cout << ans << endl;
}
}
|
[["-", 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--) {
int dp[257][257] = {{0}};
for (int k = 1; k <= n; k++)
for (int j = 1; j <= n; j++)
m = std::max(
m, dp[j][k] =
map[j][k] ? map[j][k] + dp[j + v[i][0]][k + v[i][1]] : 0);
}
printf("%d\n", m);
}
}
|
#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++) {
int dp[257][257] = {{0}};
for (int k = 1; k <= n; k++)
for (int j = 1; j <= n; j++)
m = std::max(
m, dp[j][k] =
map[j][k] ? map[j][k] + dp[j + v[i][0]][k + v[i][1]] : 0);
}
printf("%d\n", m);
}
}
|
[["-", 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][j + SIZE] = c == '1' ? true : false;
}
}
int maxLength = 0;
for (int i = 0; i < n; ++i) {
int col = 0, row = 0;
for (int j = 0; j < n; ++j) {
if (table[i][j + SIZE]) {
++col;
if (maxLength < col)
maxLength = col;
} else {
col = 0;
}
if (table[j][i + SIZE]) {
++row;
if (maxLength < row)
maxLength = row;
} else {
row = 0;
}
}
}
for (int i = 0; i < n; ++i) {
int diaL = 0, diaR = 0;
for (int j = 0; j < n; ++j) {
if (table[j][i + SIZE - j]) {
++diaL;
if (maxLength < diaL)
maxLength = diaL;
} else {
diaL = 0;
}
if (table[j][n - 1 - i + j + SIZE]) {
++diaR;
if (maxLength < diaR)
maxLength = diaR;
} else {
diaR = 0;
}
}
}
cout << maxLength << endl;
}
return 0;
}
|
#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][j + SIZE] = c == '1' ? true : false;
}
}
int maxLength = 0;
for (int i = 0; i < n; ++i) {
int col = 0, row = 0;
for (int j = 0; j < n; ++j) {
if (table[i][j + SIZE]) {
++col;
if (maxLength < col)
maxLength = col;
} else {
col = 0;
}
if (table[j][i + SIZE]) {
++row;
if (maxLength < row)
maxLength = row;
} else {
row = 0;
}
}
}
for (int i = 0; i < n * 2; ++i) {
int diaL = 0, diaR = 0;
for (int j = 0; j < n; ++j) {
if (table[j][i + SIZE - j]) {
++diaL;
if (maxLength < diaL)
maxLength = diaL;
} else {
diaL = 0;
}
if (table[j][n - 1 - i + j + SIZE]) {
++diaR;
if (maxLength < diaR)
maxLength = diaR;
} else {
diaR = 0;
}
}
}
cout << maxLength << endl;
}
return 0;
}
|
[["+", 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
c = 0
for w in range(n):
for h 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
c = 0
for p in range(n):
for a in range(n-p):
if grid[p+a][0+a] == 1:
c += 1
else:
if max_c < c:
max_c = c
c = 0
else:
if max_c < c:
max_c = c
c = 0
for p in range(1,n):
for a in range(n-p):
if grid[0+a][p+a] == 1:
c += 1
else:
if max_c < c:
max_c = c
c = 0
else:
if max_c < c:
max_c = c
for p in range(n):
for a in range(n-p):
if grid[p+a][n-1-a] == 1:
c += 1
else:
if max_c < c:
max_c = c
c = 0
else:
if max_c < c:
max_c = c
c = 0
for p in range(n, -1, -1):
for a in range(p):
if grid[0+a][p-1-a] == 1:
c += 1
else:
if max_c < c:
max_c = c
c = 0
else:
if max_c < c:
max_c = c
c = 0
print(max_c)
while True:
n = eval(input())
if n == 0: break
grid = [list(map(int, input())) for i in range(n)]
f()
|
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
c = 0
for w in range(n):
for h 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
c = 0
for p in range(n):
for a in range(n-p):
if grid[p+a][0+a] == 1:
c += 1
else:
if max_c < c:
max_c = c
c = 0
else:
if max_c < c:
max_c = c
c = 0
for p in range(1,n):
for a in range(n-p):
if grid[0+a][p+a] == 1:
c += 1
else:
if max_c < c:
max_c = c
c = 0
else:
if max_c < c:
max_c = c
c = 0
for p in range(n):
for a in range(n-p):
if grid[p+a][n-1-a] == 1:
c += 1
else:
if max_c < c:
max_c = c
c = 0
else:
if max_c < c:
max_c = c
c = 0
for p in range(n, -1, -1):
for a in range(p):
if grid[0+a][p-1-a] == 1:
c += 1
else:
if max_c < c:
max_c = c
c = 0
else:
if max_c < c:
max_c = c
c = 0
print(max_c)
while True:
n = eval(input())
if n == 0: break
grid = [list(map(int, input())) for i in range(n)]
f()
|
[["+", 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->id < b->id)
return -1;
return 0;
}
int main(void) {
man_t mandata[40];
int score[10][3];
int mannum;
int i, j;
while (1) {
scanf("%d", &mannum);
if (mannum == 0)
break;
for (i = 0; i < mannum; i++) {
scanf("%d", &mandata[i].id);
for (j = 0; j < 9; j++) {
scanf("%d", &score[j][0]);
score[j][1] = 0;
if (score[j][0] != 10)
scanf("%d", &score[j][1]);
}
scanf("%d", &score[9][0]);
scanf("%d", &score[9][1]);
score[9][2] = 0;
if (score[9][0] == 10 || score[9][0] + score[9][1] == 10)
scanf("%d", &score[9][2]);
mandata[i].score = 0;
for (j = 0; j < 9; j++) {
mandata[i].score += score[j][0] + score[j][1];
if (score[j][0] == 10) {
mandata[i].score += score[j + 1][0];
if (score[j + 1][0] == 10 && j < 8)
mandata[i].score += score[j + 2][0];
else
mandata[i].score += score[j + 1][1];
} else if (score[j][0] + score[j][1] == 10) {
mandata[i].score += score[j + 1][0];
}
}
mandata[i].score += score[9][0] + score[9][1] + score[9][2];
}
qsort(mandata, mannum, sizeof(man_t), compare);
for (i = 0; i < mannum; i++) {
printf("%d %d\n", mandata[i].id, mandata[i].score);
}
}
return 0;
}
|
#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->id < b->id)
return -1;
return 0;
}
int main(void) {
man_t mandata[40];
int score[10][3];
int mannum;
int i, j;
while (1) {
scanf("%d", &mannum);
if (mannum == 0)
break;
for (i = 0; i < mannum; i++) {
scanf("%d", &mandata[i].id);
for (j = 0; j < 9; j++) {
scanf("%d", &score[j][0]);
score[j][1] = 0;
if (score[j][0] != 10)
scanf("%d", &score[j][1]);
}
scanf("%d", &score[9][0]);
scanf("%d", &score[9][1]);
score[9][2] = 0;
if (score[9][0] == 10 || score[9][0] + score[9][1] == 10)
scanf("%d", &score[9][2]);
mandata[i].score = 0;
for (j = 0; j < 9; j++) {
mandata[i].score += score[j][0] + score[j][1];
if (score[j][0] == 10) {
mandata[i].score += score[j + 1][0];
if (score[j + 1][0] == 10 && j < 8)
mandata[i].score += score[j + 2][0];
else
mandata[i].score += score[j + 1][1];
} else if (score[j][0] + score[j][1] == 10) {
mandata[i].score += score[j + 1][0];
}
}
mandata[i].score += score[9][0] + score[9][1] + score[9][2];
}
qsort(mandata, mannum, sizeof(man_t), compare);
for (i = 0; i < mannum; i++) {
printf("%d %d\n", mandata[i].id, mandata[i].score);
}
}
return 0;
}
|
[["-", 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]);
frame = 1;
score[i][1] = 0;
last = 2;
first = -1;
while (frame < 10 + last) {
scanf("%d", &pin);
score[i][1] += pin * (1 + (str + 1) / 2 + spa);
if (str > 0)
str -= (str + 1) / 2;
spa = 0;
if (frame > 9)
frame++;
if (pin == 10) {
if (frame < 10) {
str += 2;
if (frame < 10)
frame++;
} else
last = 3;
} else {
if (first < 0)
first = pin;
else {
if (first + pin == 10) {
if (frame < 10)
spa = 1;
else
last = 3;
}
first = -1;
if (frame < 10)
frame++;
}
}
}
order[i] = i;
for (j = i; j > 0; j--) {
if (score[i][1] > score[order[j - 1]][1] ||
(score[i][1] == score[order[j - 1]][1] &&
score[i][0] < score[order[j - 1]][0])) {
swap(&order[j], &order[j - 1]);
}
}
}
for (i = 0; i < n; i++)
printf("%d %d\n", score[order[i]][0], score[order[i]][1]);
}
return 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]);
frame = 1;
score[i][1] = 0;
last = 2;
first = -1;
while (frame < 10 + last) {
scanf("%d", &pin);
score[i][1] += pin * (1 + (str + 1) / 2 + spa);
if (str > 0)
str -= (str + 1) / 2;
spa = 0;
if (frame > 9)
frame++;
if (first < 0 && pin == 10) {
if (frame < 10) {
str += 2;
if (frame < 10)
frame++;
} else
last = 3;
} else {
if (first < 0)
first = pin;
else {
if (first + pin == 10) {
if (frame < 10)
spa = 1;
else
last = 3;
}
first = -1;
if (frame < 10)
frame++;
}
}
}
order[i] = i;
for (j = i; j > 0; j--) {
if (score[i][1] > score[order[j - 1]][1] ||
(score[i][1] == score[order[j - 1]][1] &&
score[i][0] < score[order[j - 1]][0])) {
swap(&order[j], &order[j - 1]);
}
}
}
for (i = 0; i < n; i++)
printf("%d %d\n", score[order[i]][0], score[order[i]][1]);
}
return 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 (true) {
scanf("%d", &num);
if (num == 0)
break;
for (int i = 0; i < 40; i++) {
students[i].score = 0;
}
getchar();
for (int i = 0; i < num; i++) {
for (int k = 0; k <= 12; k++) {
game_data[k].score = 0;
game_data[k].first = 0;
game_data[k].second = 0;
game_data[k].strike = false;
game_data[k].spare = false;
}
First = true;
fgets(buf, 120, stdin);
tmp = 0;
index = 0;
pre_score = -1;
for (int k = 0; buf[k] != '\n'; k++) {
if (buf[k] >= '0' && buf[k] <= '9') {
tmp = 10 * tmp + (buf[k] - '0');
if (buf[k + 1] == '\n') {
if (pre_score == -1) {
game_data[index].first = tmp;
game_data[index].score = tmp;
} else {
game_data[index].second = tmp;
game_data[index].score = pre_score + tmp;
}
}
} else {
if (First) {
students[i].id = tmp;
First = false;
} else {
if (pre_score == -1) {
game_data[index].first = tmp;
if (tmp == 10) {
game_data[index].score = 10;
game_data[index].strike = true;
index++;
} else {
pre_score = tmp;
}
} else {
game_data[index].second = tmp;
game_data[index].score = pre_score + tmp;
if (pre_score + tmp == 10) {
game_data[index].spare = true;
}
index++;
pre_score = -1;
}
}
tmp = 0;
}
}
for (int k = 0; k <= 11; k++) {
students[i].score += game_data[k].score;
if (k <= 8 && game_data[k].spare == true) {
students[i].score += game_data[k + 1].first;
}
if (k <= 8 && game_data[k].strike == true) {
students[i].score += game_data[k + 1].first;
if (game_data[k + 1].first == 10) {
students[i].score += game_data[k + 2].first;
} else {
students[i].score += game_data[k + 1].second;
}
}
}
}
for (int i = 1; i <= num - 1; i++) {
for (int k = num - 1; k >= i; k--) {
if (students[k].score > students[k - 1].score)
swap(students[k], students[k - 1]);
else if (students[k].score == students[k - 1].score &&
students[k].id < students[k - 1].id)
swap(students[k], students[k - 1]);
}
}
for (int i = 0; i < num; i++) {
printf("%d %d\n", students[i].id, students[i].score);
}
}
return 0;
}
|
#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 (true) {
scanf("%d", &num);
if (num == 0)
break;
for (int i = 0; i < 40; i++) {
students[i].score = 0;
}
getchar();
for (int i = 0; i < num; i++) {
for (int k = 0; k <= 11; k++) {
game_data[k].score = 0;
game_data[k].first = 0;
game_data[k].second = 0;
game_data[k].strike = false;
game_data[k].spare = false;
}
First = true;
fgets(buf, 120, stdin);
tmp = 0;
index = 0;
pre_score = -1;
for (int k = 0; buf[k] != '\n'; k++) {
if (buf[k] >= '0' && buf[k] <= '9') {
tmp = 10 * tmp + (buf[k] - '0');
if (buf[k + 1] == '\n') {
if (pre_score == -1) {
game_data[index].first = tmp;
game_data[index].score = tmp;
} else {
game_data[index].second = tmp;
game_data[index].score = pre_score + tmp;
}
}
} else {
if (First) {
students[i].id = tmp;
First = false;
} else {
if (pre_score == -1) {
game_data[index].first = tmp;
if (tmp == 10) {
game_data[index].score = 10;
game_data[index].strike = true;
index++;
} else {
pre_score = tmp;
}
} else {
game_data[index].second = tmp;
game_data[index].score = pre_score + tmp;
if (pre_score + tmp == 10) {
game_data[index].spare = true;
}
index++;
pre_score = -1;
}
}
tmp = 0;
}
}
for (int k = 0; k <= 11; k++) {
students[i].score += game_data[k].score;
if (k <= 8 && game_data[k].spare == true) {
students[i].score += game_data[k + 1].first;
}
if (k <= 8 && game_data[k].strike == true) {
students[i].score += game_data[k + 1].first;
if (game_data[k + 1].first == 10) {
students[i].score += game_data[k + 2].first;
} else {
students[i].score += game_data[k + 1].second;
}
}
}
}
for (int i = 1; i <= num - 1; i++) {
for (int k = num - 1; k >= i; k--) {
if (students[k].score > students[k - 1].score)
swap(students[k], students[k - 1]);
else if (students[k].score == students[k - 1].score &&
students[k].id < students[k - 1].id)
swap(students[k], students[k - 1]);
}
}
for (int i = 0; i < num; i++) {
printf("%d %d\n", students[i].id, students[i].score);
}
}
return 0;
}
|
[["-", 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
elif flag == STRIKE:
acc += down_num1 * 2 + down_num2 * 2
elif flag == DOUBLE:
acc += down_num1 * 3 + down_num2 * 2
else:
acc += down_num1 + down_num2
if down_num1 + down_num2 == 10:
flag = SPARE
else:
flag = NORMAL
else:
if flag in (SPARE, STRIKE):
acc += down_num1 * 2
elif flag == DOUBLE:
acc += down_num1 * 3
else:
acc += down_num1
if flag in (STRIKE, DOUBLE):
flag = DOUBLE
else:
flag = STRIKE
game_num += 1
else:
down_num1, down_num2 = info.pop(), info.pop()
if flag == SPARE:
acc += down_num1 * 2 + down_num2
elif flag == STRIKE:
acc += down_num1 * 2 + down_num2 * 2
elif flag == DOUBLE:
acc += down_num1 * 3 + down_num2 * 2
else:
acc += down_num1 + down_num2
if info:
acc += info.pop()
return acc
while True:
m = int(input())
if m == 0:
break
score = [list(map(int, input().split())) for _ in range(m)]
score_mp = [(info[0], get_point(info[1:])) for info in score]
score.mpsort()
score_mp.sort(key=lambda x:-x[1])
for pair in score_mp:
print(*pair)
|
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
elif flag == STRIKE:
acc += down_num1 * 2 + down_num2 * 2
elif flag == DOUBLE:
acc += down_num1 * 3 + down_num2 * 2
else:
acc += down_num1 + down_num2
if down_num1 + down_num2 == 10:
flag = SPARE
else:
flag = NORMAL
else:
if flag in (SPARE, STRIKE):
acc += down_num1 * 2
elif flag == DOUBLE:
acc += down_num1 * 3
else:
acc += down_num1
if flag in (STRIKE, DOUBLE):
flag = DOUBLE
else:
flag = STRIKE
game_num += 1
else:
down_num1, down_num2 = info.pop(), info.pop()
if flag == SPARE:
acc += down_num1 * 2 + down_num2
elif flag == STRIKE:
acc += down_num1 * 2 + down_num2 * 2
elif flag == DOUBLE:
acc += down_num1 * 3 + down_num2 * 2
else:
acc += down_num1 + down_num2
if info:
acc += info.pop()
return acc
while True:
m = int(input())
if m == 0:
break
score = [list(map(int, input().split())) for _ in range(m)]
score_mp = [(info[0], get_point(info[1:])) for info in score]
score_mp.sort()
score_mp.sort(key=lambda x:-x[1])
for pair in score_mp:
print(*pair)
|
[["-", 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%d", &b, &c);
for (int j = 0; j < c; j++) {
int d;
scanf("%d", &d);
g[b - 1][d - 1] = 1;
}
}
for (int k = 0; k < a; k++)
for (int i = 0; i < a; i++)
for (int j = 0; j < a; j++)
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
scanf("%d", &a);
while (a--) {
int p, q, r;
scanf("%d%d%d", &p, &q, &r);
r = min(r, 10000);
if (r <= g[p - 1][q - 1])
printf("NA\n");
else
printf("%d\n", g[p - 1][q - 1] + 1);
}
}
|
#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", &b, &c);
for (int j = 0; j < c; j++) {
int d;
scanf("%d", &d);
g[b - 1][d - 1] = 1;
}
}
for (int k = 0; k < a; k++)
for (int i = 0; i < a; i++)
for (int j = 0; j < a; j++)
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
scanf("%d", &a);
while (a--) {
int p, q, r;
scanf("%d%d%d", &p, &q, &r);
r = min(r, 10000);
if (r <= g[p - 1][q - 1])
printf("NA\n");
else
printf("%d\n", g[p - 1][q - 1] + 1);
}
}
|
[["-", 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, n) rep(j, n) a[i][j] = 1 << 16;
rep(i, n) {
scanf("%d%d", &r, &k);
r--;
rep(j, k) {
scanf("%d", &t);
t--;
a[r][t] = 1;
}
}
// solve
rep(i, n) rep(j, n) rep(k, n) a[j][k] = min(a[j][k], a[j][i] + a[i][k]);
int p, s, d, v;
scanf("%d", &p);
rep(i, p) {
scanf("%d%d%d", &s, &d, &v);
s--;
d--;
if (v - a[s][d])
printf("%d\n", a[s][d] + 1);
else
puts("NA");
}
return 0;
}
|
#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, n) rep(j, n) a[i][j] = 1 << 16;
rep(i, n) {
scanf("%d%d", &r, &k);
r--;
rep(j, k) {
scanf("%d", &t);
t--;
a[r][t] = 1;
}
}
// solve
rep(i, n) rep(j, n) rep(k, n) a[j][k] = min(a[j][k], a[j][i] + a[i][k]);
int p, s, d, v;
scanf("%d", &p);
rep(i, p) {
scanf("%d%d%d", &s, &d, &v);
s--;
d--;
if (v - a[s][d] > 0)
printf("%d\n", a[s][d] + 1);
else
puts("NA");
}
return 0;
}
|
[["+", 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++)
table[i][k] = 0;
scanf("%d %d", &data[i][0], &data[i][1]);
}
for (int col = 0; col <= n - 2; col++) {
table[1][col] =
data[col][0] * data[col][1] * data[col + 1][0] * data[col + 1][1];
}
for (int row = 2; row <= n - 1; row++) {
for (int col = 0; col <= n - (row + 1); col++) {
minimum = 2147483647;
for (int div = 0; div <= row - 1; div++) {
tmp = (table[div][col + div] + table[row - div - 1][col + div + 1]) +
(data[col][0] * data[col + div][1] * data[col + div + 1][0] *
data[col + row][1]);
minimum = min(minimum, tmp);
}
table[row][col] = minimum;
}
}
printf("%d\n", table[n - 1][0]);
return 0;
}
|
#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++)
table[i][k] = 0;
scanf("%d %d", &data[i][0], &data[i][1]);
}
for (int col = 0; col <= n - 2; col++) {
table[1][col] =
data[col][0] * data[col][1] * data[col + 1][0] * data[col + 1][1];
}
for (int row = 2; row <= n - 1; row++) {
for (int col = 0; col <= n - (row + 1); col++) {
minimum = 2147483647;
for (int div = 0; div <= row - 1; div++) {
tmp = (table[div][col] + table[row - div - 1][col + div + 1]) +
(data[col][0] * data[col + div][1] * data[col + div + 1][0] *
data[col + row][1]);
minimum = min(minimum, tmp);
}
table[row][col] = minimum;
}
}
printf("%d\n", table[n - 1][0]);
return 0;
}
|
[["-", 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 unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for (i = 0; i < n; ++i)
#define rep1(i, n) for (i = 1; i < n; ++i)
#define per(i, n) for (i = n - 1; i > -1; --i)
#define int(x) \
int x; \
scanf("%d", &x)
#define int2(x, y) \
int x, y; \
scanf("%d%d", &x, &y)
#define int3(x, y, z) \
int x, y, z; \
scanf("%d%d%d", &x, &y, &z)
#define int4(v, x, y, z) \
int v, x, y, z; \
scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z) \
int v, w, x, y, z; \
scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << (x) << "\n"
#define debug2(x, y) cout << " --- " << (x) << " " << (y) << "\n"
#define debug3(x, y, z) \
cout << " --- " << (x) << " " << (y) << " " << (z) << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)
int a[100], b[100];
ll dp[100][101] = {0};
signed main(void) {
int i, j;
for (int testcase = 0; testcase >= 0; testcase++) {
int(n);
rep(i, n) rep(j, n + 1) dp[i][j] = (1LL << 32);
rep(i, n) scanf("%d%d", a + i, b + i);
rep(i, n) dp[i][i + 1] = 0;
rep(i, n - 1) dp[i][i + 2] = a[i] * b[i] * a[i + 1] * b[i + 1];
for (j = 3; j <= n; ++j)
rep(i, n - j + 1) for (int k = 1; k < j - 1; ++k) dp[i][i + j] =
min(dp[i][i + j], dp[i][i + k] + dp[i + k][i + j] +
a[i] * b[i + k - 1] * a[i + k] * b[i + j - 1]);
pri(dp[0][n]);
/*/
//*/
break;
}
return 0;
}
|
#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 unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for (i = 0; i < n; ++i)
#define rep1(i, n) for (i = 1; i < n; ++i)
#define per(i, n) for (i = n - 1; i > -1; --i)
#define int(x) \
int x; \
scanf("%d", &x)
#define int2(x, y) \
int x, y; \
scanf("%d%d", &x, &y)
#define int3(x, y, z) \
int x, y, z; \
scanf("%d%d%d", &x, &y, &z)
#define int4(v, x, y, z) \
int v, x, y, z; \
scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z) \
int v, w, x, y, z; \
scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << (x) << "\n"
#define debug2(x, y) cout << " --- " << (x) << " " << (y) << "\n"
#define debug3(x, y, z) \
cout << " --- " << (x) << " " << (y) << " " << (z) << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)
int a[100], b[100];
ll dp[100][101] = {0};
signed main(void) {
int i, j;
for (int testcase = 0; testcase >= 0; testcase++) {
int(n);
rep(i, n) rep(j, n + 1) dp[i][j] = (1LL << 32);
rep(i, n) scanf("%d%d", a + i, b + i);
rep(i, n) dp[i][i + 1] = 0;
rep(i, n - 1) dp[i][i + 2] = a[i] * b[i] * a[i + 1] * b[i + 1];
for (j = 3; j <= n; ++j)
rep(i, n - j + 1) for (int k = 1; k < j; ++k) dp[i][i + j] =
min(dp[i][i + j], dp[i][i + k] + dp[i + k][i + j] +
a[i] * b[i + k - 1] * a[i + k] * b[i + j - 1]);
pri(dp[0][n]);
// rep(i, n)rep(j, n + 1)if(i < j)pri3(i, j, dp[i][j]);
/*/
//*/
break;
}
return 0;
}
|
[["-", 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() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; ++i)
cin >> a[i] >> b[i];
vector<vector<int>> cost(n, vector<int>(n, INT_MAX));
for (int i = 0; i < n; ++i)
cost[i][i] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 0; j + i < n; ++j) {
for (int k = j; k < j + i; ++k) {
int c =
cost[j][k] + cost[k + 1][j + i] + b[j] * a[k] * b[k + 1] * a[j + i];
cost[j][j + i] = min(cost[j][j + i], c);
}
}
}
cout << cost[0][n - 1] << endl;
return 0;
}
|
#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() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; ++i)
cin >> a[i] >> b[i];
vector<vector<int>> cost(n, vector<int>(n, INT_MAX));
for (int i = 0; i < n; ++i)
cost[i][i] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 0; j + i < n; ++j) {
for (int k = j; k < j + i; ++k) {
int c =
cost[j][k] + cost[k + 1][j + i] + a[j] * b[k] * a[k + 1] * b[j + i];
cost[j][j + i] = min(cost[j][j + i], c);
}
}
}
cout << cost[0][n - 1] << endl;
return 0;
}
|
[["-", 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, 28, 22], ["+", 49, 50, 51, 16, 12, 16, 12, 69, 28, 22]]
| 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()))]
print(dfs(0, len(L) - 1))
|
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()))]
print(dfs(0, len(L) - 1))
|
[["-", 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], ["-", 3, 668, 8, 657, 12, 657, 12, 206, 206, 612], ["+", 3, 668, 8, 657, 12, 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 i) { return ((num & (1 << i)) != 0); }
// i?????????1?????????
int setBit(int num, int i) { return num | (1 << i); }
// i?????????0?????????
int clearBit(int num, int i) {
int mask = ~(1 << i);
return num & mask;
}
// i?????????v??§???????????????
int updateBit(int num, int i, int v) {
int mask = ~(1 << i);
return (num & mask) | (v << i);
}
const int MAX_N = 16;
double dp[1 << MAX_N][MAX_N], speed[1 << MAX_N];
int pres[1 << MAX_N][MAX_N];
int main() {
int n;
cin >> n;
int id[MAX_N], dis[MAX_N], num[MAX_N];
rep(i, n) { cin >> id[i] >> dis[i] >> num[i]; }
const int N = 1 << n;
rep(s, N) {
double c = 0;
rep(i, n) {
pres[i][s] = -1;
dp[s][i] = 1e11;
if (getBit(s, i))
c += num[i];
}
speed[s] = 2000.0 / (70 + 20 * c);
}
rep(i, n) dp[1 << i][i] = 0;
range(s, 1, N) {
rep(i, n) {
rep(j, n) { // i -> j????§????
//????????°????????\????????¨????????? ||
//?????????????????§????¨??????????
if ((not getBit(s, i) || getBit(s, j)))
continue;
double time = dp[s][i] + abs(dis[i] - dis[j]) / speed[s];
int next_s = setBit(s, j);
if (dp[next_s][j] > time) {
dp[next_s][j] = time;
pres[next_s][j] = i;
}
}
}
}
int cur = 0;
range(i, 1, n) {
if (dp[N - 1][cur] > dp[N - 1][i]) {
cur = i;
}
}
vector<int> v;
int s = N - 1;
while (cur != -1) {
v.emplace_back(id[cur]);
int next = pres[s][cur];
s = clearBit(s, cur);
cur = next;
}
for (int i = v.size() - 1; i >= 0; i--) {
cout << v[i] << (i == 0 ? '\n' : ' ');
}
}
|
#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 i) { return ((num & (1 << i)) != 0); }
// i?????????1?????????
int setBit(int num, int i) { return num | (1 << i); }
// i?????????0?????????
int clearBit(int num, int i) {
int mask = ~(1 << i);
return num & mask;
}
// i?????????v??§???????????????
int updateBit(int num, int i, int v) {
int mask = ~(1 << i);
return (num & mask) | (v << i);
}
const int MAX_N = 16;
double dp[1 << MAX_N][MAX_N], speed[1 << MAX_N];
int pres[1 << MAX_N][MAX_N];
int main() {
int n;
cin >> n;
int id[MAX_N], dis[MAX_N], num[MAX_N];
rep(i, n) { cin >> id[i] >> dis[i] >> num[i]; }
const int N = 1 << n;
rep(s, N) {
int c = 0;
rep(i, n) {
pres[s][i] = -1;
dp[s][i] = 1e11;
if (getBit(s, i))
c += num[i];
}
speed[s] = 2000.0 / (70 + 20 * c);
}
rep(i, n) dp[1 << i][i] = 0;
range(s, 1, N) {
rep(i, n) {
rep(j, n) { // i -> j????§????
//????????°????????\????????¨????????? ||
//?????????????????§????¨??????????
if ((not getBit(s, i) || getBit(s, j)))
continue;
double time = dp[s][i] + abs(dis[i] - dis[j]) / speed[s];
int next_s = setBit(s, j);
if (dp[next_s][j] > time) {
dp[next_s][j] = time;
pres[next_s][j] = i;
}
}
}
}
int cur = 0;
range(i, 1, n) {
if (dp[N - 1][cur] > dp[N - 1][i]) {
cur = i;
}
}
vector<int> v;
int s = N - 1;
while (cur != -1) {
v.emplace_back(id[cur]);
int next = pres[s][cur];
s = clearBit(s, cur);
cur = next;
}
for (int i = v.size() - 1; i >= 0; i--) {
cout << v[i] << (i == 0 ? '\n' : ' ');
}
}
|
[["-", 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 < 32768; j++)
for (i = 0, bn[j] = 0; i < 15; i++) {
ti[j][i] = 999999999;
if ((j & e[i]) > 0)
bn[j]++;
}
cin >> n;
for (i = 0; i < n; i++) {
cin >> kn[i] >> km[i] >> g;
sg[i] = g * 20;
for (j = 0; j < n; j++)
ti[e[i]][j] = 0;
}
for (i = 0; i < e[n]; i++) {
kg[i] = 0;
for (j = 0; j < n; j++)
if ((i & e[j]) > 0)
kg[i] += sg[j];
}
for (i = 0; i < n; i++) {
for (j = 1; j < e[n]; j++) {
if (bn[j] != i + 1)
continue;
for (k = 0; k < n; k++) {
if ((j & e[k]) != 0)
continue;
for (b = 0; b < n; b++) {
if ((j & e[b]) == 0)
continue;
t = ti[j][b] + (double)(abs(km[k] - km[b]) * (70 + kg[j]) / 2000);
if (ti[j | e[k]][k] > t) {
ti[j | e[k]][k] = t;
fr[j | e[k]][k] = b;
}
}
}
}
}
t = 999999999;
for (i = 0; i < n; i++)
if (ti[e[n] - 1][i] < t) {
t = ti[e[n] - 1][i];
g = i;
}
for (i = n - 1, j = e[n] - 1; i >= 0; i--) {
ans[i] = kn[g];
k = g;
g = fr[j][g];
j -= e[k];
}
for (i = 0; i < n; i++) {
cout << ans[i];
if (i < n - 1)
cout << ' ';
}
cout << endl;
return 0;
}
|
#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 < 32768; j++)
for (i = 0, bn[j] = 0; i < 15; i++) {
ti[j][i] = 999999999;
if ((j & e[i]) > 0)
bn[j]++;
}
cin >> n;
for (i = 0; i < n; i++) {
cin >> kn[i] >> km[i] >> g;
sg[i] = g * 20;
for (j = 0; j < n; j++)
ti[e[i]][j] = 0;
}
for (i = 0; i < e[n]; i++) {
kg[i] = 0;
for (j = 0; j < n; j++)
if ((i & e[j]) > 0)
kg[i] += sg[j];
}
for (i = 0; i < n; i++) {
for (j = 1; j < e[n]; j++) {
if (bn[j] != i + 1)
continue;
for (k = 0; k < n; k++) {
if ((j & e[k]) != 0)
continue;
for (b = 0; b < n; b++) {
if ((j & e[b]) == 0)
continue;
t = ti[j][b] + (abs(km[k] - km[b]) * (double)(70 + kg[j]) / 2000);
if (ti[j | e[k]][k] > t) {
ti[j | e[k]][k] = t;
fr[j | e[k]][k] = b;
}
}
}
}
}
t = 999999999;
for (i = 0; i < n; i++)
if (ti[e[n] - 1][i] < t) {
t = ti[e[n] - 1][i];
g = i;
}
for (i = n - 1, j = e[n] - 1; i >= 0; i--) {
ans[i] = kn[g];
k = g;
g = fr[j][g];
j -= e[k];
}
for (i = 0; i < n; i++) {
cout << ans[i];
if (i < n - 1)
cout << ' ';
}
cout << endl;
return 0;
}
|
[["-", 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 <vector>
#define INF 1e+8
#define EPS 1e-9
#define PB push_back
#define fi first
#define se second
#define reps(i, j, k) for (int i = j; i < k; i++)
#define rep(i, j) reps(i, 0, j)
using namespace std;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
typedef long long ll;
typedef pair<int, int> Pii;
class Data {
public:
int id;
int dist;
int money;
Data() {}
Data(int a, int b, int c) {
id = a;
dist = b;
money = c;
}
};
vector<Data> D;
double dp[16][1 << 16];
vector<int> path[16][1 << 16];
vector<int> ans;
int main() {
int n;
scanf("%d", &n);
rep(i, n) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
D.PB(Data(x, y, z));
}
int weight[16];
double cost[16][16];
rep(i, n) {
rep(j, 1 << n) { dp[i][j] = INF; }
}
rep(i, n) {
rep(j, n) { cost[i][j] = (double)abs(D[i].dist - D[j].dist); }
}
rep(i, n) {
dp[i][1 << i] = 0;
path[i][1 << i].PB(i);
}
rep(i, 1 << n) {
int res = 0;
rep(j, n) {
if (i >> j & 1)
res += D[j].money;
}
weight[i] = 20 * res;
}
rep(i, 1 << n) {
double res = (double)2000.0 / (70 + weight[i]);
rep(j, n) {
int now = 1 << j;
if ((now & i) != 0) {
rep(k, n) {
int next = 1 << k;
if ((next & i) <= 0) {
double sub = cost[j][k] / res;
if (dp[k][i | next] > dp[j][i] + sub) {
dp[k][i | next] = dp[j][i] + sub;
path[k][i | next] = path[j][i];
path[k][i | next].PB(k);
}
}
}
}
}
}
double mi = INF;
int len;
rep(i, n) {
if (mi > dp[i][(1 << n) - 1]) {
mi = dp[i][(1 << n) - 1];
ans = path[i][(1 << n) - 1];
}
}
len = ans.size();
rep(i, len) { printf("%d%c", D[ans[i]].id, i == len - 1 ? '\n' : ' '); }
return 0;
}
|
#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 <vector>
#define INF 1e+100
#define EPS 1e-9
#define PB push_back
#define fi first
#define se second
#define reps(i, j, k) for (int i = j; i < k; i++)
#define rep(i, j) reps(i, 0, j)
using namespace std;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
typedef long long ll;
typedef pair<int, int> Pii;
class Data {
public:
int id;
int dist;
int money;
Data() {}
Data(int a, int b, int c) {
id = a;
dist = b;
money = c;
}
};
vector<Data> D;
double dp[16][1 << 16];
vector<int> path[16][1 << 16];
vector<int> ans;
int main() {
int n;
scanf("%d", &n);
rep(i, n) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
D.PB(Data(x, y, z));
}
int weight[1 << 16];
double cost[16][16];
rep(i, n) {
rep(j, 1 << n) { dp[i][j] = INF; }
}
rep(i, n) {
rep(j, n) { cost[i][j] = (double)abs(D[i].dist - D[j].dist); }
}
rep(i, n) {
dp[i][1 << i] = 0;
path[i][1 << i].PB(i);
}
rep(i, 1 << n) {
int res = 0;
rep(j, n) {
if (i >> j & 1)
res += D[j].money;
}
weight[i] = 20 * res;
}
rep(i, 1 << n) {
double res = (double)2000.0 / (70 + weight[i]);
rep(j, n) {
int now = 1 << j;
if ((now & i) != 0) {
rep(k, n) {
int next = 1 << k;
if ((next & i) <= 0) {
double sub = cost[j][k] / res;
if (dp[k][i | next] > dp[j][i] + sub) {
dp[k][i | next] = dp[j][i] + sub;
path[k][i | next] = path[j][i];
path[k][i | next].PB(k);
}
}
}
}
}
}
double mi = INF;
int len;
rep(i, n) {
if (mi > dp[i][(1 << n) - 1]) {
mi = dp[i][(1 << n) - 1];
ans = path[i][(1 << n) - 1];
}
}
len = ans.size();
rep(i, len) { printf("%d%c", D[ans[i]].id, i == len - 1 ? '\n' : ' '); }
return 0;
}
|
[["-", 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;
}
Point() {
this.x = 0;
this.y = 0;
}
@Override
public String toString() {
return "(" + this.x + "," + this.y + ")";
}
static boolean ok(int x, int y, int X, int Y, int min) {
return (min <= x && x < X && min <= y && y < Y) ? true : false;
}
static boolean ok(int x, int y, int X, int Y) { return ok(x, y, X, Y, 0); }
}
public static void main(String[] args) { new Main().AOJ0147(); }
void AOJ0145() {
while (sc.hasNext()) {
int N = sc.nextInt(), ans = Integer.MAX_VALUE;
C0145[] c = new C0145[N];
for (int i = 0; i < N; i++)
c[i] = new C0145(sc.nextInt(), sc.nextInt());
out.println(ans);
}
}
class C0145 {
int upper, down;
C0145(int u, int d) {
this.upper = u;
this.down = d;
}
}
void AOJ0147() {
LinkedList<Integer> queue = new LinkedList<Integer>();
int MAX = 110;
while (sc.hasNext())
queue.add(sc.nextInt());
int[] num = new int[MAX], atime = new int[MAX], itime = new int[MAX],
seat = new int[17], ans = new int[MAX];
Arrays.fill(seat, -1);
for (int i = 0; i < MAX; i++) {
num[i] = (i % 5 == 1 ? 5 : 2);
atime[i] = (17 * (i % 2) + 3 * (i % 3) + 19);
}
// for(int i=0; i<MAX; i++) out.println("TIME"+i+" "+time[i]);
// for(int i=0; i<MAX; i++) out.println("NUM"+i+" "+num[i]);
int gno = 0, min = 0;
while (gno <= 99) {
seat = ex(seat, min, atime, itime);
int temp = find(seat, num[gno]);
if (temp >= 0 && min >= gno * 5) {
ans[gno] = max(0, min - gno * 5);
for (int i = temp; i < temp + num[gno]; i++)
seat[i] = gno;
itime[gno] = min;
gno++;
} else {
// debug
// disp(seat,min);
min++;
}
}
while (!queue.isEmpty())
out.println(ans[queue.poll()]);
}
int find(int[] seat, int n) {
for (int i = 0; i < 17 - n; i++) {
boolean flag = true;
for (int j = 0; j < n; j++) {
if (seat[i + j] != -1) {
flag = false;
break;
}
}
if (flag)
return i;
}
return -1;
}
int[] ex(int[] seat, int min, int[] atime, int[] itime) {
for (int i = 0; i < 17; i++) {
if (seat[i] < 0)
continue;
int emin = itime[seat[i]] + atime[seat[i]];
if (min >= emin)
seat[i] = -1;
}
return seat;
}
void disp(int[] seat, int min) {
out.print(min + "m : ");
for (int i = 0; i < 17; i++)
out.print(seat[i] + " ");
out.println();
}
void AOJ0144() {
while (sc.hasNext()) {
int N = sc.nextInt();
boolean[][] R = new boolean[N + 1][N + 1];
for (int i = 1; i <= N; i++) {
int r = sc.nextInt(), k = sc.nextInt();
for (int j = 0; j < k; j++)
R[r][sc.nextInt()] = true;
}
int P = sc.nextInt();
for (int i = 0; i < P; i++) {
int s = sc.nextInt(), d = sc.nextInt(), v = sc.nextInt(), ans = -1;
PriorityQueue<C0144> open = new PriorityQueue<C0144>();
open.add(new C0144(s, v, 1));
int[] close = new int[N + 1];
Arrays.fill(close, Integer.MAX_VALUE);
while (!open.isEmpty()) {
C0144 now = open.poll();
// out.println("1NOW"+now.now+" TTL"+now.ttl+" C"+now.c);
if (now.ttl - 1 == 0)
continue;
for (int j = 1; j <= N; j++) {
if (R[now.now][j] && now.c + 1 < close[j]) {
if (j == d) {
ans = (ans < 0 ? now.c + 1 : min(ans, now.c + 1));
continue;
}
open.add(new C0144(j, now.ttl - 1, now.c + 1));
close[j] = now.c + 1;
}
}
}
out.println((ans < 0 ? "NA" : ans));
}
}
}
class C0144 implements Comparable<C0144> {
int now, ttl, c;
C0144(int now, int ttl, int c) {
this.now = now;
this.ttl = ttl;
this.c = c;
}
@Override
public int compareTo(C0144 o) {
if (this.c < o.c)
return -1;
if (this.c > o.c)
return 1;
return 0;
}
}
}
|
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;
}
Point() {
this.x = 0;
this.y = 0;
}
@Override
public String toString() {
return "(" + this.x + "," + this.y + ")";
}
static boolean ok(int x, int y, int X, int Y, int min) {
return (min <= x && x < X && min <= y && y < Y) ? true : false;
}
static boolean ok(int x, int y, int X, int Y) { return ok(x, y, X, Y, 0); }
}
public static void main(String[] args) { new Main().AOJ0147(); }
void AOJ0145() {
while (sc.hasNext()) {
int N = sc.nextInt(), ans = Integer.MAX_VALUE;
C0145[] c = new C0145[N];
for (int i = 0; i < N; i++)
c[i] = new C0145(sc.nextInt(), sc.nextInt());
out.println(ans);
}
}
class C0145 {
int upper, down;
C0145(int u, int d) {
this.upper = u;
this.down = d;
}
}
void AOJ0147() {
LinkedList<Integer> queue = new LinkedList<Integer>();
int MAX = 110;
while (sc.hasNext())
queue.add(sc.nextInt());
int[] num = new int[MAX], atime = new int[MAX], itime = new int[MAX],
seat = new int[17], ans = new int[MAX];
Arrays.fill(seat, -1);
for (int i = 0; i < MAX; i++) {
num[i] = (i % 5 == 1 ? 5 : 2);
atime[i] = (17 * (i % 2) + 3 * (i % 3) + 19);
}
// for(int i=0; i<MAX; i++) out.println(i+": ATIME"+atime[i]+" NUM"+num[i]);
int gno = 0, min = 0;
while (gno <= 99) {
seat = exit(seat, min, atime, itime);
int temp = find(seat, num[gno]);
if (temp >= 0 && min >= gno * 5) {
ans[gno] = max(0, min - gno * 5);
for (int i = temp; i < temp + num[gno]; i++)
seat[i] = gno;
itime[gno] = min;
gno++;
} else {
// debug
// disp(seat,min);
min++;
}
}
// disp(seat,min);
while (!queue.isEmpty())
out.println(ans[queue.poll()]);
}
int find(int[] seat, int n) {
for (int i = 0; i <= 17 - n; i++) {
boolean flag = true;
for (int j = 0; j < n; j++) {
if (seat[i + j] != -1) {
flag = false;
break;
}
}
if (flag)
return i;
}
return -1;
}
int[] exit(int[] seat, int min, int[] atime, int[] itime) {
for (int i = 0; i < 17; i++) {
if (seat[i] < 0)
continue;
int emin = itime[seat[i]] + atime[seat[i]];
if (min >= emin)
seat[i] = -1;
}
return seat;
}
void disp(int[] seat, int min) {
out.print(min + "m : ");
for (int i = 0; i < 17; i++)
out.print(seat[i] + " ");
out.println();
}
void AOJ0144() {
while (sc.hasNext()) {
int N = sc.nextInt();
boolean[][] R = new boolean[N + 1][N + 1];
for (int i = 1; i <= N; i++) {
int r = sc.nextInt(), k = sc.nextInt();
for (int j = 0; j < k; j++)
R[r][sc.nextInt()] = true;
}
int P = sc.nextInt();
for (int i = 0; i < P; i++) {
int s = sc.nextInt(), d = sc.nextInt(), v = sc.nextInt(), ans = -1;
PriorityQueue<C0144> open = new PriorityQueue<C0144>();
open.add(new C0144(s, v, 1));
int[] close = new int[N + 1];
Arrays.fill(close, Integer.MAX_VALUE);
while (!open.isEmpty()) {
C0144 now = open.poll();
// out.println("1NOW"+now.now+" TTL"+now.ttl+" C"+now.c);
if (now.ttl - 1 == 0)
continue;
for (int j = 1; j <= N; j++) {
if (R[now.now][j] && now.c + 1 < close[j]) {
if (j == d) {
ans = (ans < 0 ? now.c + 1 : min(ans, now.c + 1));
continue;
}
open.add(new C0144(j, now.ttl - 1, now.c + 1));
close[j] = now.c + 1;
}
}
}
out.println((ans < 0 ? "NA" : ans));
}
}
}
class C0144 implements Comparable<C0144> {
int now, ttl, c;
C0144(int now, int ttl, int c) {
this.now = now;
this.ttl = ttl;
this.c = c;
}
@Override
public int compareTo(C0144 o) {
if (this.c < o.c)
return -1;
if (this.c > o.c)
return 1;
return 0;
}
}
}
|
[["-", 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 (dp[j] >= num) {
key = j - num;
break;
}
}
}
return key;
}
public void simulate() {
Queue<Integer> queue = new PriorityQueue<Integer>();
Queue<Integer> time = new PriorityQueue<Integer>();
Map<Integer, Set<Integer>> map = new HashMap<Integer, Set<Integer>>();
int[] seat = new int[17];
for (int i = 0; i < 17; i++) {
seat[i] = -1;
}
for (int i = 0; i < 30; i++) {
/* writer.println(queue);
writer.println(time);
writer.println(map);
for(int a : seat){
writer.print(a + " ");
}
writer.println();*/
int t = (time.peek() == null) ? 5 * i + 1 : time.peek();
while (5 * i >= t) {
for (int j = 0; j < seat.length; j++) {
if (map.get(t).contains(seat[j])) {
seat[j] = -1;
}
}
while (queue.peek() != null) {
int check = queue.peek();
int key = judge(seat, check);
if (key >= 0) {
int num = (check % 5 == 1) ? 5 : 2;
for (int j = key; j < key + num; j++) {
seat[j] = check;
}
ans[check] = t - check * 5;
int x = 17 * (check % 2) + 3 * (check % 3) + 19 + time.peek();
time.offer(x);
Set<Integer> temp =
(map.get(x) != null) ? map.get(x) : new HashSet<Integer>();
temp.add(check);
map.put(x, temp);
queue.remove();
} else {
break;
}
}
time.remove();
t = (time.peek() == null) ? 5 * i + 1 : time.peek();
}
if (queue.peek() != null) {
queue.offer(i);
continue;
}
int key = judge(seat, i);
if (key >= 0) {
int num = (i % 5 == 1) ? 5 : 2;
for (int j = key; j < key + num; j++) {
seat[j] = i;
}
int x = 17 * (i % 2) + 3 * (i % 3) + 19 + i * 5;
time.offer(x);
Set<Integer> temp =
(map.get(x) != null) ? map.get(x) : new HashSet<Integer>();
temp.add(i);
map.put(x, temp);
} else {
queue.offer(i);
}
}
}
public void solve() throws IOException {
simulate();
while (stdIn.hasNext()) {
int n = stdIn.nextInt();
writer.println(ans[n]);
writer.flush();
}
writer.flush();
}
public static void main(String args[]) throws IOException {
new Main().run();
}
Scanner stdIn;
PrintWriter writer;
public void run() throws IOException {
stdIn = null;
try {
stdIn = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
writer = new PrintWriter(System.out);
solve();
stdIn.close();
writer.close();
} catch (Exception e) {
e.printStackTrace();
System.exit(1);
}
}
}
|
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 (dp[j] >= num) {
key = j - num;
break;
}
}
}
return key;
}
public void simulate() {
Queue<Integer> queue = new PriorityQueue<Integer>();
Queue<Integer> time = new PriorityQueue<Integer>();
Map<Integer, Set<Integer>> map = new HashMap<Integer, Set<Integer>>();
int[] seat = new int[17];
for (int i = 0; i < 17; i++) {
seat[i] = -1;
}
for (int i = 0; i < 120; i++) {
/* writer.println(queue);
writer.println(time);
writer.println(map);
for(int a : seat){
writer.print(a + " ");
}
writer.println();*/
int t = (time.peek() == null) ? 5 * i + 1 : time.peek();
while (5 * i >= t) {
for (int j = 0; j < seat.length; j++) {
if (map.get(t).contains(seat[j])) {
seat[j] = -1;
}
}
while (queue.peek() != null) {
int check = queue.peek();
int key = judge(seat, check);
if (key >= 0) {
int num = (check % 5 == 1) ? 5 : 2;
for (int j = key; j < key + num; j++) {
seat[j] = check;
}
ans[check] = t - check * 5;
int x = 17 * (check % 2) + 3 * (check % 3) + 19 + time.peek();
time.offer(x);
Set<Integer> temp =
(map.get(x) != null) ? map.get(x) : new HashSet<Integer>();
temp.add(check);
map.put(x, temp);
queue.remove();
} else {
break;
}
}
time.remove();
t = (time.peek() == null) ? 5 * i + 1 : time.peek();
}
if (queue.peek() != null) {
queue.offer(i);
continue;
}
int key = judge(seat, i);
if (key >= 0) {
int num = (i % 5 == 1) ? 5 : 2;
for (int j = key; j < key + num; j++) {
seat[j] = i;
}
int x = 17 * (i % 2) + 3 * (i % 3) + 19 + i * 5;
time.offer(x);
Set<Integer> temp =
(map.get(x) != null) ? map.get(x) : new HashSet<Integer>();
temp.add(i);
map.put(x, temp);
} else {
queue.offer(i);
}
}
}
public void solve() throws IOException {
simulate();
while (stdIn.hasNext()) {
int n = stdIn.nextInt();
writer.println(ans[n]);
writer.flush();
}
writer.flush();
}
public static void main(String args[]) throws IOException {
new Main().run();
}
Scanner stdIn;
PrintWriter writer;
public void run() throws IOException {
stdIn = null;
try {
stdIn = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
writer = new PrintWriter(System.out);
solve();
stdIn.close();
writer.close();
} catch (Exception e) {
e.printStackTrace();
System.exit(1);
}
}
}
|
[["-", 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);
Arrays.fill(end_seats, -1);
for (int i = 0; i < 100; i++) {
arrivals[i] = 5 * i;
}
int porpos = 0;
END:
for (int time = 0;; time++) {
// System.out.println(Arrays.toString(seats));
for (int i = 0; i < 17; i++) {
if (seats[i] != -1 && end_seats[i] <= time) {
seats[i] = -1;
}
}
LOOP:
while (arrivals[porpos] <= time) {
// System.out.println(porpos);
boolean f_fount = false;
for (int i = 0; i < 17 - (porpos % 5 == 1 ? 5 : 2); i++) {
boolean found = true;
for (int j = 0; j < (porpos % 5 == 1 ? 5 : 2); j++) {
if (seats[i + j] != -1) {
found = false;
break;
}
}
if (found) {
f_fount = true;
for (int j = 0; j < (porpos % 5 == 1 ? 5 : 2); j++) {
seats[i + j] = porpos;
end_seats[i + j] =
time + 17 * (porpos % 2) + 3 * (porpos % 3) + 19;
wait[porpos] = time - arrivals[porpos];
}
if (porpos == 99) {
break END;
}
porpos++;
break;
}
}
if (!f_fount) {
break;
}
}
}
while (sc.hasNext()) {
System.out.println(wait[sc.nextInt()]);
}
}
}
|
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);
Arrays.fill(end_seats, -1);
for (int i = 0; i < 100; i++) {
arrivals[i] = 5 * i;
}
int porpos = 0;
END:
for (int time = 0;; time++) {
for (int i = 0; i < 17; i++) {
if (seats[i] != -1 && end_seats[i] <= time) {
seats[i] = -1;
}
}
LOOP:
while (arrivals[porpos] <= time) {
// System.out.println(porpos);
boolean f_fount = false;
for (int i = 0; i <= 17 - (porpos % 5 == 1 ? 5 : 2); i++) {
boolean found = true;
for (int j = 0; j < (porpos % 5 == 1 ? 5 : 2); j++) {
if (seats[i + j] != -1) {
found = false;
break;
}
}
if (found) {
f_fount = true;
for (int j = 0; j < (porpos % 5 == 1 ? 5 : 2); j++) {
seats[i + j] = porpos;
end_seats[i + j] =
time + 17 * (porpos % 2) + 3 * (porpos % 3) + 19;
wait[porpos] = time - arrivals[porpos];
}
if (porpos == 99) {
break END;
}
porpos++;
break;
}
}
if (!f_fount) {
break;
}
}
// System.out.println("time = " + time + " : " + Arrays.toString(seats));
}
while (sc.hasNext()) {
System.out.println(wait[sc.nextInt()]);
}
}
}
|
[["-", 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]);
}
}
private void init() {
table = new int[17];
Arrays.fill(table, -1);
mat = new LinkedList<Integer>();
for (int i = 0;; i++) {
if (i != 0 && isOK())
break;
out(i);
if (i % 5 == 0 && i / 5 < 100) {
data[i / 5][0] = i;
mat.addLast(i / 5);
}
while (in(i)) {
}
}
}
private boolean in(int time) {
if (mat.isEmpty())
return false;
int nextid = mat.getFirst();
int num = 0;
if (nextid % 5 == 1) {
num = 5;
} else {
num = 2;
}
for (int i = 0; i < table.length; i++) {
if (table[i] != -1)
continue;
int now = 1;
for (int j = i + 1; j < table.length; j++) {
if (table[j] == -1) {
now++;
if (now == num) {
for (int k = 0; k < num; k++) {
table[i + k] = nextid;
}
data[nextid][1] = time;
mat.removeFirst();
return true;
}
} else {
break;
}
}
}
return false;
}
private void out(int time) {
for (int i = 0; i < table.length; i++) {
if (table[i] >= 0) {
int id = table[i];
int res = data[id][0] + 17 * (id % 2) + 3 * (id % 3) + 19;
if (res == time) {
table[i] = -1;
}
}
}
}
private boolean isOK() {
for (int i = 0; i < table.length; i++) {
if (table[i] != -1) {
return false;
}
}
return true;
}
private void debug(Object... o) {
System.out.println("debug = " + Arrays.deepToString(o));
}
public static void main(String[] args) { new Main().doit(); }
}
|
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]);
}
}
private void init() {
table = new int[17];
Arrays.fill(table, -1);
mat = new LinkedList<Integer>();
for (int i = 0;; i++) {
if (i != 0 && isOK())
break;
out(i);
if (i % 5 == 0 && i / 5 < 100) {
data[i / 5][0] = i;
mat.addLast(i / 5);
}
while (in(i)) {
}
}
}
private boolean in(int time) {
if (mat.isEmpty())
return false;
int nextid = mat.getFirst();
int num = 0;
if (nextid % 5 == 1) {
num = 5;
} else {
num = 2;
}
for (int i = 0; i < table.length; i++) {
if (table[i] != -1)
continue;
int now = 1;
for (int j = i + 1; j < table.length; j++) {
if (table[j] == -1) {
now++;
if (now == num) {
for (int k = 0; k < num; k++) {
table[i + k] = nextid;
}
data[nextid][1] = time;
mat.removeFirst();
return true;
}
} else {
break;
}
}
}
return false;
}
private void out(int time) {
for (int i = 0; i < table.length; i++) {
if (table[i] >= 0) {
int id = table[i];
int res = data[id][1] + 17 * (id % 2) + 3 * (id % 3) + 19;
if (res == time) {
table[i] = -1;
}
}
}
}
private boolean isOK() {
for (int i = 0; i < table.length; i++) {
if (table[i] != -1) {
return false;
}
}
return true;
}
private void debug(Object... o) {
System.out.println("debug = " + Arrays.deepToString(o));
}
public static void main(String[] args) { new Main().doit(); }
}
|
[["-", 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;
cin >> x >> y >> h >> w;
ans += p[max(lower_bound(s, s + 6, x + h + w) - s,
lower_bound(wt, wt + 6, w) - wt)];
}
cout << ans << endl;
}
return 0;
}
|
// 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;
cin >> x >> y >> h >> w;
ans += p[max(lower_bound(s, s + 6, x + y + h) - s,
lower_bound(wt, wt + 6, w) - wt)];
}
cout << ans << endl;
}
return 0;
}
|
[["-", 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 += 800;
else if (s <= 100 && w <= 10)
sum == 1000;
else if (s <= 120 && w <= 15)
sum += 1200;
else if (s <= 140 && w <= 20)
sum += 1400;
else if (s <= 160 && w <= 25)
sum += 1600;
}
cout << sum << endl;
}
return 0;
}
|
#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 += 800;
else if (s <= 100 && w <= 10)
sum += 1000;
else if (s <= 120 && w <= 15)
sum += 1200;
else if (s <= 140 && w <= 20)
sum += 1400;
else if (s <= 160 && w <= 25)
sum += 1600;
}
cout << sum << endl;
}
return 0;
}
|
[["-", 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 and w <= 20
sum += 1400
elsif s <= 160 and w <= 25
sum += 1600
end
end
puts sum
end
|
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 <= 20
sum += 1400
elsif s <= 160 and w <= 25
sum += 1600
end
end
puts sum
end
|
[["-", 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]
fee += a[2]
break
end
end
end
puts fee
end
|
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]
fee += a[2]
break
end
end
end
puts fee
end
|
[["-", 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, 15, 738, 31, 738, 31, 652, 735, 22]]
| 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+y+h, w)
if r<6: s += C[r]
print(s)
|
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+y+h, w)
if r<6: s += C[r]
print(s)
|
[["-", 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 _ in range(n)))
|
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 range(n)))
|
[["-", 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, h, w = list(map(int, input().split()))
s += pl[max(le(max(x, y, h), sl), le(w, wl))]
print(s)
|
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, h, w = list(map(int, input().split()))
s += pl[max(le(x + y + h, sl), le(w, wl))]
print(s)
|
[["-", 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]);
}
for (i = 0; i < n; i++) {
time[i] =
(timedata[i][0] + timedata[i][2] + timedata[i][4] + timedata[i][6]) *
60 +
(timedata[i][1] + timedata[i][3] + timedata[i][5] + timedata[i][7]);
}
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - 1; j++) {
if (time[j] > time[j + 1]) {
int temp = time[j];
time[j] = time[j + 1];
time[j + 1] = temp;
int temp2 = teamnum[j];
teamnum[j] = teamnum[j + 1];
teamnum[j + 1] = temp2;
}
}
}
printf("%d\n", teamnum[0]);
printf("%d\n", teamnum[1]);
printf("%d\n", teamnum[n - 2]);
}
return 0;
}
|
#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]);
}
for (i = 0; i < n; i++) {
time[i] =
(timedata[i][0] + timedata[i][2] + timedata[i][4] + timedata[i][6]) *
60 +
(timedata[i][1] + timedata[i][3] + timedata[i][5] + timedata[i][7]);
}
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - 1; j++) {
if (time[j] > time[j + 1]) {
int temp = time[j];
time[j] = time[j + 1];
time[j + 1] = temp;
int temp2 = teamnum[j];
teamnum[j] = teamnum[j + 1];
teamnum[j + 1] = temp2;
}
}
}
printf("%d\n", teamnum[0]);
printf("%d\n", teamnum[1]);
printf("%d\n", teamnum[n - 2]);
}
return 0;
}
|
[["-", 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; i++) {
cin >> a >> b;
x[i].first += a * 60 + b;
}
}
sort(x, x + n);
cout << x[0].first << endl << x[1].first << endl << x[n - 2].first << endl;
}
}
|
#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; j++) {
cin >> a >> b;
x[i].first += a * 60 + b;
}
}
sort(x, x + n);
cout << x[0].second << endl
<< x[1].second << endl
<< x[n - 2].second << endl;
}
}
|
[["-", 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, 16, 31, 16, 12, 118, 119, 120], ["-", 0, 1, 0, 16, 31, 16, 12, 118, 119, 120], ["+", 0, 1, 0, 16, 31, 16, 12, 118, 119, 120]]
| 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("%d%d", &m, &s), d[i].first += m * 60 + s;
}
sort(d, d + n);
printf("%d\n%d\n%d\n", d[0].second, d[1].second, d[n - 1].second);
}
return 0;
}
|
#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("%d%d", &m, &s), d[i].first += m * 60 + s;
}
sort(d, d + n);
printf("%d\n%d\n%d\n", d[0].second, d[1].second, d[n - 2].second);
}
return 0;
}
|
[["-", 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 %d %d %d %d %d %d %d", &table[i].id, &m1, &s1, &m2, &s2, &m3,
&s3, &m4, &s4);
table[i].sum = (60 * (m1 + m2 + m3 + m4) + (s1 + s2 + s3 + s4));
}
for (int i = 1; i <= 3; i++) {
for (int k = 3; k >= 1; k--) {
if (table[k].sum < table[k - 1].sum)
swap(table[k], table[k - 1]);
}
}
n -= 4;
for (int i = 0; i < n; i++) {
scanf("%d %d %d %d %d %d %d %d %d", &tmp_id, &m1, &s1, &m2, &s2, &m3, &s3,
&m4, &s4);
tmp_sum = (60 * (m1 + m2 + m3 + m4) + (s1 + s2 + s3 + s4));
if (tmp_sum > table[3].sum) { //??????????°?
table[2].id = table[3].id; //?????????????????????
table[2].sum = table[3].sum;
table[3].id = tmp_id;
table[3].sum = tmp_sum;
} else if (tmp_sum > table[2].sum) { // tmp???????????????
table[2].id = tmp_id;
table[2].sum = tmp_sum;
} else if (tmp_sum < table[0].sum) {
table[1].id = table[0].id;
table[1].sum = table[0].sum;
table[0].id = tmp_id;
table[0].sum = tmp_sum;
} else if (tmp_sum < table[1].sum) {
table[2].id = tmp_id;
table[2].sum = tmp_sum;
}
}
printf("%d\n", table[0].id);
printf("%d\n", table[1].id);
printf("%d\n", table[2].id);
}
return 0;
}
|
#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 %d %d %d %d %d %d %d", &table[i].id, &m1, &s1, &m2, &s2, &m3,
&s3, &m4, &s4);
table[i].sum = (60 * (m1 + m2 + m3 + m4) + (s1 + s2 + s3 + s4));
}
for (int i = 1; i <= 3; i++) {
for (int k = 3; k >= 1; k--) {
if (table[k].sum < table[k - 1].sum)
swap(table[k], table[k - 1]);
}
}
n -= 4;
for (int i = 0; i < n; i++) {
scanf("%d %d %d %d %d %d %d %d %d", &tmp_id, &m1, &s1, &m2, &s2, &m3, &s3,
&m4, &s4);
tmp_sum = (60 * (m1 + m2 + m3 + m4) + (s1 + s2 + s3 + s4));
if (tmp_sum > table[3].sum) { //??????????°?
table[2].id = table[3].id; //?????????????????????
table[2].sum = table[3].sum;
table[3].id = tmp_id;
table[3].sum = tmp_sum;
} else if (tmp_sum > table[2].sum) { // tmp???????????????
table[2].id = tmp_id;
table[2].sum = tmp_sum;
} else if (tmp_sum < table[0].sum) {
table[1].id = table[0].id;
table[1].sum = table[0].sum;
table[0].id = tmp_id;
table[0].sum = tmp_sum;
} else if (tmp_sum < table[1].sum) {
table[1].id = tmp_id;
table[1].sum = tmp_sum;
}
}
printf("%d\n", table[0].id);
printf("%d\n", table[1].id);
printf("%d\n", table[2].id);
}
return 0;
}
|
[["-", 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;
}
sort(a, a + n);
cout << a[0].second << endl
<< a[1].second << endl
<< a[n - 1].second << endl;
}
}
|
#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;
}
sort(a, a + n);
cout << a[0].second << endl
<< a[1].second << endl
<< a[n - 2].second << endl;
}
}
|
[["-", 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])
l[i] = true;
if (i % 3 == 0 && l[i / 3])
l[i] = true;
if (i % 5 == 0 && l[i / 5])
l[i] = true;
c[i] = c[i - 1] + (l[i] ? 1 : 0);
}
for (;;) {
int s = sc.nextInt();
if (s == 0) {
break;
}
int f = sc.nextInt();
// int count = 0;
// for (int i = s; i <= f; i++) {
// if (l[i]) {
// count++;
// System.out.println(i);
// }
// }
// System.out.println(count);
System.out.println(c[f] - c[s]);
}
}
}
|
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])
l[i] = true;
if (i % 3 == 0 && l[i / 3])
l[i] = true;
if (i % 5 == 0 && l[i / 5])
l[i] = true;
c[i] = c[i - 1] + (l[i] ? 1 : 0);
}
for (;;) {
int s = sc.nextInt();
if (s == 0) {
break;
}
int f = sc.nextInt();
System.out.println(c[f] - c[s - 1]);
}
}
}
|
[["+", 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;
double ab = 0.0;
for (int i = 0; i < n; i++) {
int j = in.nextInt(), h = in.nextInt(), w = in.nextInt();
if (Math.abs(22.0 - ab) > Math.abs(22.0 - calcBMI(h, w))) {
ab = calcBMI(h, w);
ai = j;
}
if (Math.abs(22.0 - ab) == Math.abs(22.0 - calcBMI(h, w))) {
if (ai > j)
ai = j;
}
}
System.out.println(ai);
}
}
double calcBMI(int h, int w) { return (double)w * 10000 / h / h; }
}
|
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 = 10000000;
double ab = -2000.0;
for (int i = 0; i < n; i++) {
int j = in.nextInt(), h = in.nextInt(), w = in.nextInt();
if (Math.abs(22.0 - ab) > Math.abs(22.0 - calcBMI(h, w))) {
ab = calcBMI(h, w);
ai = j;
}
if (Math.abs(22.0 - ab) == Math.abs(22.0 - calcBMI(h, w))) {
if (ai > j)
ai = j;
}
}
System.out.println(ai);
}
}
double calcBMI(int h, int w) { return (double)w * 10000 / h / h; }
}
|
[["-", 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 / ((h / 100.0) * (h / 100.0));
BMIH = (BMI - 22);
if (BMIH < 0) {
BMIH = -BMIH;
}
if (BMIH < BMI2) {
BMI2 = BMIH;
no = i;
} else if (BMIH == BMI && i < no) {
no = i;
}
} /*E for*/
printf("%d\n", no);
no = 100000000;
} /*E while*/
return 0;
} /*E main*/
|
#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çµÂäºÂæ¡件*/
for (j = 0; j < n; j++) {
scanf("%d%d%d", &i, &h, &w);
BMI = (double)w / ((h / 100.0) * (h / 100.0));
BMIH = (BMI - 22);
if (BMIH < 0) {
BMIH = -BMIH;
}
if (BMIH < BMI2) {
BMI2 = BMIH;
no = i;
} else if (BMIH == BMI && i < no) {
no = i;
}
} /*E for*/
printf("%d\n", no);
no = 100000000;
BMI2 = 1000;
} /*E while*/
return 0;
} /*E main*/
|
[["+", 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) < now) {
now = ABS(22 - bmi);
nownum = num;
}
}
printf("%d\n", nownum);
}
return 0;
}
|
#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) < now) {
now = ABS(22 - bmi);
nownum = num;
}
}
printf("%d\n", nownum);
}
return 0;
}
|
[["-", 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;
void calcBMI() { bmi = (double)w / (h * 0.01 * h * 0.01); }
bool operator<(const Human &h) const {
if (abs(22 - bmi) == abs(22 - h.bmi))
return n < h.n;
return abs(22 - bmi) < abs(22 - h.bmi);
}
};
Human h[1000000];
int main() {
int N;
while (cin >> N) {
for (int i = 0; i < N; i++) {
cin >> h[i].n >> h[i].h >> h[i].w;
h[i].calcBMI();
}
sort(h, h + N);
printf("%d\n", h[0].n);
}
return 0;
}
|
#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;
void calcBMI() { bmi = (double)w / (h * 0.01 * h * 0.01); }
bool operator<(const Human &h) const {
if (abs(22 - bmi) == abs(22 - h.bmi))
return n < h.n;
return abs(22 - bmi) < abs(22 - h.bmi);
}
};
Human h[1000000];
int main() {
int N;
while (cin >> N, N) {
for (int i = 0; i < N; i++) {
cin >> h[i].n >> h[i].h >> h[i].w;
h[i].calcBMI();
}
sort(h, h + N);
printf("%d\n", h[0].n);
}
return 0;
}
|
[["+", 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("%d\n", p);
}
return 0;
}
|
#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("%d\n", p);
}
return 0;
}
|
[["-", 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;
bmi = abs(22.0 - (w / (h * h)));
} else if (bmi == abs(22.0 - (w / (h * h)))) {
id = min(d, id);
}
}
cout << id << endl;
}
return 0;
}
|
#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;
bmi = abs(22.0 - (w / (h * h)));
} else if (bmi == abs(22.0 - (w / (h * h)))) {
id = min(d, id);
}
}
cout << id << endl;
}
return 0;
}
|
[["-", 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 <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
int main() {
int n;
while (cin >> n, n) {
vector<pii> v;
rep(i, n) {
pii ujimatsu;
int gotiusa;
cin >> gotiusa >> ujimatsu.first >> ujimatsu.second;
v.push_back(pii(abs(22 - (((double)ujimatsu.second /
(pow((double)ujimatsu.first / 100, 2))))),
gotiusa));
}
sort(all(v));
cout << v[0].second << endl;
}
}
|
#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 <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
#define MAX 9999999
using namespace std;
typedef pair<double, double> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
int main() {
int n;
while (cin >> n, n) {
vector<pii> v;
rep(i, n) {
pii ujimatsu;
int gotiusa;
cin >> gotiusa >> ujimatsu.first >> ujimatsu.second;
v.push_back(pii(abs(22 - (((double)ujimatsu.second /
(pow((double)ujimatsu.first / 100, 2))))),
gotiusa));
}
sort(all(v));
cout << v[0].second << endl;
}
}
|
[["-", 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; i < n; i++) {
cin >> p >> h >> w;
if (i == 0) {
num = p;
diff = abs(bmi(h, w) - c);
} else {
double k = abs(bmi(h, w) - c);
if (diff > k) {
diff = k;
num = p;
} else if (diff == k) {
if (num > p)
num = p;
}
}
}
cout << num << endl;
}
}
|
#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 = 0; i < n; i++) {
cin >> p >> h >> w;
if (i == 0) {
num = p;
diff = abs(bmi(h, w) - c);
} else {
double k = abs(bmi(h, w) - c);
if (diff > k) {
diff = k;
num = p;
} else if (diff == k) {
if (num > p)
num = p;
}
}
}
cout << num << endl;
}
}
|
[["-", 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) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define INF 1 << 30
int main() {
int n;
while (cin >> n, n) {
int mi = INF;
int res;
REP(i, n) {
int a;
double h, w;
cin >> a >> h >> w;
int hoge = abs(22.0 - 10000.0 * w / (h * h));
if (mi >= hoge) {
if (mi == hoge) {
if (a < res)
res = a;
} else {
mi = hoge;
res = a;
}
}
}
cout << res << endl;
}
}
|
#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) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define INF 1 << 30
int main() {
int n;
while (cin >> n, n) {
double mi = INF;
int res;
REP(i, n) {
int a;
double h, w;
cin >> a >> h >> w;
double hoge = abs(22.0 - 10000.0 * w / (h * h));
if (mi >= hoge) {
if (mi == hoge) {
if (a < res)
res = a;
} else {
mi = hoge;
res = a;
}
}
}
cout << res << endl;
}
}
|
[["-", 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 namespace std;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define mp make_pair
template <class T> void pv(T a, T b) {
for (T i = a; i != b; ++i)
cout << *i << " ";
cout << endl;
}
template <class T> void chmin(T &t, T f) {
if (t > f)
t = f;
}
template <class T> void chmax(T &t, T f) {
if (t < f)
t = f;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
int main() {
int n;
while (n = in()) {
int a;
double b, c;
int i;
int res;
double resbmi = 0;
double bmi;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
bmi = c * 10000 / b / b;
if (fabs(bmi - 22) < fabs(resbmi - 22)) {
res = a;
resbmi = bmi;
}
}
cout << res << endl;
}
return 0;
}
|
#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 namespace std;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define mp make_pair
template <class T> void pv(T a, T b) {
for (T i = a; i != b; ++i)
cout << *i << " ";
cout << endl;
}
template <class T> void chmin(T &t, T f) {
if (t > f)
t = f;
}
template <class T> void chmax(T &t, T f) {
if (t < f)
t = f;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
int main() {
int n;
while (n = in()) {
int a;
double b, c;
int i;
int res;
double resbmi = 100000;
double bmi;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
bmi = c * 10000 / b / b;
if (fabs(bmi - 22) < fabs(resbmi - 22)) {
res = a;
resbmi = bmi;
}
}
cout << res << endl;
}
return 0;
}
|
[["-", 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) / (tall / 100);
bmi[i] -= 22;
if (bmi[i] < 0)
bmi[i] *= -1;
if (i == 0) {
minnum = num;
min = bmi[i];
}
if (min > bmi[i]) {
minnum = num;
min = bmi[i];
} else if (min == bmi[i]) {
if (minnum > num)
minnum = num;
}
}
cout << minnum << endl;
}
return 0;
}
|
#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 / 100) / (tall / 100);
bmi[i] -= 22;
if (bmi[i] < 0)
bmi[i] *= -1;
if (i == 0) {
minnum = num;
min = bmi[i];
}
if (min > bmi[i]) {
minnum = num;
min = bmi[i];
}
if (min == bmi[i]) {
if (minnum > num)
minnum = num;
}
}
cout << minnum << endl;
}
return 0;
}
|
[["-", 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))
return stnum < t.stnum;
else
return abs(22 - bmi) < abs(22 - t.bmi);
}
};
int main() {
int n;
double h;
CDATA person[MAX];
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
cin >> person[i].stnum >> h >> person[i].wei;
person[i].hei = h / 100;
person[i].setBMI();
}
stable_sort(person, person + n);
cout << person[0].stnum << endl;
}
return 0;
}
|
#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))
return stnum < t.stnum;
else
return abs(22 - bmi) < abs(22 - t.bmi);
}
};
int main() {
int n;
double h;
CDATA person[MAX];
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
cin >> person[i].stnum >> h >> person[i].wei;
person[i].hei = h / 100;
person[i].setBMI();
}
stable_sort(person, person + n);
cout << person[0].stnum << endl;
}
return 0;
}
|
[["-", 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<<data[i]<<endl;
data[i] -= 22;
data[i] = max(data[i], -data[i]);
if (data[i] < min || data[i] == min && num[i] < num[min_num]) {
min = data[i];
min_num = i;
}
}
cout << num[min_num] << endl;
}
}
|
#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));
/// cout<<data[i]<<endl;
data[i] -= 22;
data[i] = max(data[i], -data[i]);
if (data[i] < min || data[i] == min && num[i] < num[min_num]) {
min = data[i];
min_num = i;
}
}
cout << num[min_num] << endl;
}
}
|
[["-", 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 - 22 < 0) {
sa = 22 - bmi;
} else {
sa = bmi - 22;
}
if (sa <= max && num < best) {
best = num;
max = sa;
}
}
cout << best << endl;
}
return 0;
}
|
#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 - 22 < 0) {
sa = 22 - bmi;
} else {
sa = bmi - 22;
}
if (sa < max || (sa == max && num < best)) {
best = num;
max = sa;
}
}
cout << best << endl;
}
return 0;
}
|
[["-", 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, 60], ["+", 0, 57, 15, 339, 51, 16, 12, 23, 0, 25]]
| 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 = 0;
for (int j = 0; j < 3; j++)
size += stdIn.nextInt();
int w = stdIn.nextInt();
if (size <= 60 || w <= 2) {
cost += 600;
} else if (size <= 80 && w <= 5) {
cost += 800;
} else if (size <= 100 && w <= 10) {
cost += 1000;
} else if (size <= 120 && w <= 15) {
cost += 1200;
} else if (size <= 140 && w <= 20) {
cost += 1400;
} else if (size <= 160 && w <= 25) {
cost += 1600;
}
}
System.out.println(cost);
}
}
}
|
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 = 0;
for (int j = 0; j < 3; j++)
size += stdIn.nextInt();
int w = stdIn.nextInt();
if (size <= 60 && w <= 2) {
cost += 600;
} else if (size <= 80 && w <= 5) {
cost += 800;
} else if (size <= 100 && w <= 10) {
cost += 1000;
} else if (size <= 120 && w <= 15) {
cost += 1200;
} else if (size <= 140 && w <= 20) {
cost += 1400;
} else if (size <= 160 && w <= 25) {
cost += 1600;
}
}
System.out.println(cost);
}
}
}
|
[["-", 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;
}
sum = 0;
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &x, &y, &h, &w);
size = x + y + h + w;
for (j = 0; j < 6; j++) {
if (size <= size_limit[j] && w <= weight_limit[j]) {
break;
}
}
if (j < 6) {
sum += fee[j];
}
}
printf("%d\n", sum);
}
return (0);
}
|
#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;
}
sum = 0;
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &x, &y, &h, &w);
size = x + y + h;
for (j = 0; j < 6; j++) {
if (size <= size_limit[j] && w <= weight_limit[j]) {
break;
}
}
if (j < 6) {
sum += fee[j];
}
}
printf("%d\n", sum);
}
return (0);
}
|
[["-", 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[0]++;
else {
for (j = 0; j < 5; j++) {
if (5 * j < w && w <= 5 * j + 5)
count[j + 1]++;
}
}
} else {
for (j = 0; j < 5; j++) {
if (60 + j * 20 < x + y + h && x + y + h <= 80 + j * 20) {
for (k = j; k < 5; k++) {
if (k == j)
if (5 * k - 5 >= w)
count[k + 1]++;
if (5 * k < w && w <= 5 * k + 5)
count[k + 1]++;
}
}
}
}
}
for (j = 0; j < 6; j++)
money += (600 + j * 200) * count[j];
printf("%d\n", money);
}
return 0;
}
|
#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[0]++;
else {
for (j = 0; j < 5; j++) {
if (5 * j < w && w <= 5 * j + 5)
count[j + 1]++;
}
}
} else {
for (j = 0; j < 5; j++) {
if (60 + j * 20 < x + y + h && x + y + h <= 80 + j * 20) {
for (k = j; k < 5; k++) {
if (k == j)
if (5 * k >= w)
count[k + 1]++;
if (5 * k < w && w <= 5 * k + 5)
count[k + 1]++;
}
}
}
}
}
for (j = 0; j < 6; j++)
money += (600 + j * 200) * count[j];
printf("%d\n", money);
}
return 0;
}
|
[["-", 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 long long LL;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define fastIO \
cin.tie(0); \
ios::sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
// for gcc (未test)
// #define FOREACH_IT(it,c) for(typeof(c)::iterator it=(c).begin();
// it!=(c).end(); ++it)
// for Visual Studio
//#define foreach_it(type,it,c) for(type::iterator it=c.begin(); it!=c.end();
//++it)
// fast?
#define foreach_it(type, it, c) \
for (type::iterator it = c.begin(), c_end = c.end(); it != c_end; ++it)
int Yen(int x, int y, int h, int w) {
int ret = 0;
int inSize = x + y + h;
int inWeight = w;
// C++11
vector<pair<int, int>> size_weight_List{
MP(60, 2), MP(80, 5), MP(100, 10), MP(120, 15), MP(140, 20), MP(160, 25)};
VI feeList{600, 800, 1000, 1200, 1400, 1600};
FOR(i, 0, size_weight_List.size()) {
if (inSize <= size_weight_List[i].first &&
inWeight <= size_weight_List[i].second) {
ret = feeList[i];
break;
}
}
return ret;
}
int main() {
int n;
int x, y, h, w;
long long ans = 0;
fastIO;
while (cin >> n) {
while (n--) {
cin >> x >> y >> h >> w;
ans += Yen(x, y, h, w);
}
cout << ans << endl;
ans = 0;
}
return 0;
}
|
// #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 long long LL;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define fastIO \
cin.tie(0); \
ios::sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
// for gcc (未test)
// #define FOREACH_IT(it,c) for(typeof(c)::iterator it=(c).begin();
// it!=(c).end(); ++it)
// for Visual Studio
//#define foreach_it(type,it,c) for(type::iterator it=c.begin(); it!=c.end();
//++it)
// fast?
#define foreach_it(type, it, c) \
for (type::iterator it = c.begin(), c_end = c.end(); it != c_end; ++it)
int Yen(int x, int y, int h, int w) {
int ret = 0;
int inSize = x + y + h;
int inWeight = w;
// C++11
vector<pair<int, int>> size_weight_List{
MP(60, 2), MP(80, 5), MP(100, 10), MP(120, 15), MP(140, 20), MP(160, 25)};
VI feeList{600, 800, 1000, 1200, 1400, 1600};
FOR(i, 0, size_weight_List.size()) {
if (inSize <= size_weight_List[i].first &&
inWeight <= size_weight_List[i].second) {
ret = feeList[i];
break;
}
}
return ret;
}
int main() {
int n;
int x, y, h, w;
long long ans = 0;
fastIO;
while (cin >> n, n) {
while (n--) {
cin >> x >> y >> h >> w;
ans += Yen(x, y, h, w);
}
cout << ans << endl;
ans = 0;
}
return 0;
}
|
[["+", 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) {
int ans = 0;
for (int i = 0; i < N; i++) {
int X, Y, H, W;
cin >> X >> Y >> H >> W;
int b = X + Y + H;
if (b <= 60 && W <= 2)
ans += 600;
else if (b <= 80 && W <= 5)
ans += 800;
else if (b <= 100 && W <= 10)
ans += 1000;
else if (b <= 20 && W <= 15)
ans += 1200;
else if (b <= 140 && W <= 20)
ans += 1400;
else if (b <= 160 && W <= 25)
ans += 1600;
}
printf("%d\n", ans);
}
return 0;
}
|
#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) {
int ans = 0;
for (int i = 0; i < N; i++) {
int X, Y, H, W;
cin >> X >> Y >> H >> W;
int b = X + Y + H;
if (b <= 60 && W <= 2)
ans += 600;
else if (b <= 80 && W <= 5)
ans += 800;
else if (b <= 100 && W <= 10)
ans += 1000;
else if (b <= 120 && W <= 15)
ans += 1200;
else if (b <= 140 && W <= 20)
ans += 1400;
else if (b <= 160 && W <= 25)
ans += 1600;
}
printf("%d\n", ans);
}
return 0;
}
|
[["-", 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 >> n, n) {
int ret = 0;
rep(i, n) {
int x, w, a = 0;
rep(j, 3) {
cin >> x;
a += x;
}
cin >> w;
for (int j = 6; j > 0; --j) {
if (size[j] < a) {
ret += cost[j];
break;
}
if (weight[j] < w) {
ret += cost[j];
break;
}
}
}
cout << ret << endl;
}
return 0;
}
|
#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 >> n, n) {
int ret = 0;
rep(i, n) {
int x, w, a = 0;
rep(j, 3) {
cin >> x;
a += x;
}
cin >> w;
for (int j = 6; j >= 0; --j) {
if (size[j] < a) {
ret += cost[j];
break;
}
if (weight[j] < w) {
ret += cost[j];
break;
}
}
}
cout << ret << endl;
}
return 0;
}
|
[["-", 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;
typedef pair<double, int> P;
double d[10000];
int pr[10000];
double INF = 10000000;
double sqr(int num) { return sqrt((double)num); }
int po2(int l) { return l * l; }
void dijk(int f, int t) {
fill(d, d + n + 1, INF);
priority_queue<P, vector<P>, greater<P>> que;
que.push(P(0.0, f));
d[f] = 0.0;
while (que.size()) {
P p = que.top();
que.pop();
double c = p.first;
int v = p.second;
if (d[v] < c)
continue;
for (int i = 0; i < n; i++) {
double k = sqr(po2(abs(bi[v].x - bi[i].x)) + po2(abs(bi[v].y - bi[i].y)));
if (k <= 50.0 && d[i] > c + k) {
d[i] = c + k;
pr[i] = v;
que.push(P(c + k, i));
}
}
}
}
void rc(int f, int t) {
vector<int> prev;
while (f != t) {
prev.push_back(bnb[t]);
t = pr[t];
}
prev.push_back(bnb[t]);
sort(prev.begin(), prev.end());
for (int i = 0; i < prev.size(); i++) {
if (i != 0)
printf(" ");
printf("%d", prev[i]);
}
printf("\n");
}
int main(void) {
while (1) {
scanf("%d", &n);
if (n == 0)
break;
bi.clear();
bn.clear();
bnb.clear();
for (int i = 0; i < n; i++) {
int b, x, y;
scanf("%d%d%d", &b, &x, &y);
bi.push_back(bill(b, x, y));
bn[b] = i;
bnb[i] = b;
}
scanf("%d", &m);
for (int i = 0; i < m; i++) {
int f, t;
scanf("%d%d", &f, &t);
dijk(bn[f], bn[t]);
if (d[bn[t]] != INF)
rc(bn[f], bn[t]);
else
printf("NA\n");
}
}
return 0;
}
|
#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;
typedef pair<double, int> P;
double d[10000];
int pr[10000];
double INF = 10000000;
double sqr(int num) { return sqrt((double)num); }
int po2(int l) { return l * l; }
void dijk(int f, int t) {
fill(d, d + n + 1, INF);
priority_queue<P, vector<P>, greater<P>> que;
que.push(P(0.0, f));
d[f] = 0.0;
while (que.size()) {
P p = que.top();
que.pop();
double c = p.first;
int v = p.second;
if (d[v] < c)
continue;
for (int i = 0; i < n; i++) {
double k = sqr(po2(abs(bi[v].x - bi[i].x)) + po2(abs(bi[v].y - bi[i].y)));
if (k <= 50.0 && d[i] > c + k) {
d[i] = c + k;
pr[i] = v;
que.push(P(c + k, i));
}
}
}
}
void rc(int f, int t) {
vector<int> prev;
while (f != t) {
prev.push_back(bnb[t]);
t = pr[t];
}
prev.push_back(bnb[t]);
reverse(prev.begin(), prev.end());
for (int i = 0; i < prev.size(); i++) {
if (i != 0)
printf(" ");
printf("%d", prev[i]);
}
printf("\n");
}
int main(void) {
while (1) {
scanf("%d", &n);
if (n == 0)
break;
bi.clear();
bn.clear();
bnb.clear();
for (int i = 0; i < n; i++) {
int b, x, y;
scanf("%d%d%d", &b, &x, &y);
bi.push_back(bill(b, x, y));
bn[b] = i;
bnb[i] = b;
}
scanf("%d", &m);
for (int i = 0; i < m; i++) {
int f, t;
scanf("%d%d", &f, &t);
dijk(bn[f], bn[t]);
if (d[bn[t]] != INF)
rc(bn[f], bn[t]);
else
printf("NA\n");
}
}
return 0;
}
|
[["-", 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)
graph = make_graph(bldgs)
for _ in range(eval(input())):
sb, gb = list(map(int, input().split()))
res = dijkstra(graph, sb, gb)
if res is None:
print("NA")
else:
print(" ".join(map(str, reversed(res))))
def make_graph(bldgs):
graph = defaultdict(list)
for b1, p1 in list(bldgs.items()):
for b2, p2 in list(bldgs.items()):
if b1 == b2:
continue
weight = (p1.x - p2.x) ** 2 + (p1.y - p2.y) ** 2
if weight > 2500:
continue
graph[b1].append((weight**0.5, b2,))
return graph
def dijkstra(graph, start, goal):
import heapq
hq = [(w, b, start) for w, b in graph[start]]
heapq.heapify(hq)
pre = dict((k, None) for k in list(graph.keys()))
while len(hq) > 0:
w, cb, pb = heapq.heappop(hq)
if pre[cb] is not None:
continue
pre[cb] = pb
if cb == goal:
break
for nw, nb in graph[cb]:
heapq.heappush(hq, (nw+w, nb, cb))
else:
return None
ret = [goal]
while ret[-1] != start:
ret.append(pre[ret[-1]])
return list(reversed(ret))
if __name__ == "__main__":
main()
|
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)
graph = make_graph(bldgs)
for _ in range(eval(input())):
sb, gb = list(map(int, input().split()))
res = dijkstra(graph, sb, gb)
if res is None:
print("NA")
else:
print(" ".join(map(str, res)))
def make_graph(bldgs):
graph = defaultdict(list)
for b1, p1 in list(bldgs.items()):
for b2, p2 in list(bldgs.items()):
if b1 == b2:
continue
weight = (p1.x - p2.x) ** 2 + (p1.y - p2.y) ** 2
if weight > 2500:
continue
graph[b1].append((weight**0.5, b2,))
return graph
def dijkstra(graph, start, goal):
import heapq
hq = [(w, b, start) for w, b in graph[start]]
heapq.heapify(hq)
pre = dict((k, None) for k in list(graph.keys()))
while len(hq) > 0:
w, cb, pb = heapq.heappop(hq)
if pre[cb] is not None:
continue
pre[cb] = pb
if cb == goal:
break
for nw, nb in graph[cb]:
heapq.heappush(hq, (nw+w, nb, cb))
else:
return None
ret = [goal]
while ret[-1] != start:
ret.append(pre[ret[-1]])
return list(reversed(ret))
if __name__ == "__main__":
main()
|
[["-", 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 == 0)
break;
for (int i = 0; i < 102; i++)
for (int j = 0; j < 102; j++) {
t[i][j] = '.';
vd[i][j] = false;
u[i][j] = INF;
}
for (int i = 1; i <= H; i++) {
cin >> str;
for (int j = 1; j <= W; j++) {
t[i][j] = str[j - 1];
if (t[i][j] == '&')
u[i][j] = 0;
}
}
/*
for(int i=0;i<H+2;i++){
for(int j=0;j<W+2;j++){
cout<<t[i][j];
}
cout<<endl;
}
*/
while (1) {
mini = INF;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (mini > u[i][j] && vd[i][j] == false) {
mini = u[i][j];
mini_y = i;
mini_x = j;
}
}
}
if (mini == INF)
break;
vd[mini_y][mini_x] = true;
// cout<<mini_y<<' '<<mini_x<<' '<<u[mini_y][mini_x]<<endl;
for (int i = 0; i < 4; i++) {
ny = mini_y + dy[i];
nx = mini_x + dx[i];
if (ny < 0 || nx < 0 || ny > H + 1 || nx > W + 1)
continue;
cost = ((t[mini_y][mini_x] != '#' && t[ny][nx] == '#') ? 1 : 0);
if (u[ny][nx] > u[mini_y][mini_x] + cost) {
u[ny][nx] = u[mini_y][mini_x] + cost;
}
}
}
ans = INF;
for (int i = 0; i < H + 2; i++) {
ans = max(ans, u[i][0]);
ans = max(ans, u[i][W + 1]);
}
for (int i = 0; i < W + 2; i++) {
ans = min(ans, u[0][i]);
ans = min(ans, u[H + 1][i]);
}
cout << ans << endl;
}
return 0;
}
|
#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 == 0)
break;
for (int i = 0; i < 102; i++)
for (int j = 0; j < 102; j++) {
t[i][j] = '.';
vd[i][j] = false;
u[i][j] = INF;
}
for (int i = 1; i <= H; i++) {
cin >> str;
for (int j = 1; j <= W; j++) {
t[i][j] = str[j - 1];
if (t[i][j] == '&')
u[i][j] = 0;
}
}
/*
for(int i=0;i<H+2;i++){
for(int j=0;j<W+2;j++){
cout<<t[i][j];
}
cout<<endl;
}
*/
while (1) {
mini = INF;
for (int i = 0; i < H + 2; i++) {
for (int j = 0; j < W + 2; j++) {
if (mini > u[i][j] && vd[i][j] == false) {
mini = u[i][j];
mini_y = i;
mini_x = j;
}
}
}
if (mini == INF)
break;
vd[mini_y][mini_x] = true;
// cout<<mini_y<<' '<<mini_x<<' '<<u[mini_y][mini_x]<<endl;
for (int i = 0; i < 4; i++) {
ny = mini_y + dy[i];
nx = mini_x + dx[i];
if (ny < 0 || nx < 0 || ny > H + 1 || nx > W + 1)
continue;
cost = ((t[mini_y][mini_x] != '#' && t[ny][nx] == '#') ? 1 : 0);
if (u[ny][nx] > u[mini_y][mini_x] + cost) {
u[ny][nx] = u[mini_y][mini_x] + cost;
}
}
}
ans = INF;
for (int i = 0; i < H + 2; i++) {
ans = max(ans, u[i][0]);
ans = max(ans, u[i][W + 1]);
}
for (int i = 0; i < W + 2; i++) {
ans = min(ans, u[0][i]);
ans = min(ans, u[H + 1][i]);
}
cout << ans << endl;
}
return 0;
}
|
[["+", 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[i].r);
scanf("%d", &m);
for (i = 1; i <= m; i++)
scanf("%d%d", &t[i + n].h, &t[i + n].r);
res = l[0] = 0; // memset(l,0,sizeof(l));
for (i = n + m; i > 1; i--)
for (j = 1; j <= i; j++)
if (t[j].h > t[j + 1].h)
tt = t[j], t[j] = t[j + 1], t[j + 1] = tt;
for (i = 1; i <= n + m; i++) {
p = 0;
for (j = 0; j <= i - 1; j++)
if (t[j].h < t[i].h && t[j].r < t[i].r && l[j] > l[p])
p = j;
l[i] = l[p] + 1;
res = max(res, l[i]);
}
printf("%d\n", res);
}
return 0;
}
|
#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[i].r);
scanf("%d", &m);
for (i = 1; i <= m; i++)
scanf("%d%d", &t[i + n].h, &t[i + n].r);
res = l[0] = 0; // memset(l,0,sizeof(l));
for (i = n + m; i > 1; i--)
for (j = 1; j < i; j++)
if (t[j].h > t[j + 1].h)
tt = t[j], t[j] = t[j + 1], t[j + 1] = tt;
for (i = 1; i <= n + m; i++) {
p = 0;
for (j = 0; j <= i - 1; j++)
if (t[j].h < t[i].h && t[j].r < t[i].r && l[j] > l[p])
p = j;
l[i] = l[p] + 1;
res = max(res, l[i]);
}
printf("%d\n", res);
}
return 0;
}
|
[["-", 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[index])
return dp[index];
if (!index)
return 1;
int maxc = 0;
for (int i = index - 1; i >= 0; i--) {
if ((mato[index].first <= mato[i].first) ||
(mato[index].second <= mato[i].second))
continue;
maxc = max(maxc, dfs(i, mato));
}
dp[index] = maxc + 1;
return dp[index];
}
void substitute(int time, vector<pair<int, int>> &mato) {
for (int i = 0; i < time; i++) {
pair<int, int> tmp;
cin >> tmp.first >> tmp.second;
mato.push_back(tmp);
}
}
int main() {
int n, m;
while (cin >> n && n != 0) {
fill(dp, dp + 200, 0);
vector<pair<int, int>> mato;
substitute(n, mato);
cin >> m;
substitute(m, mato);
sort(mato.begin(), mato.end());
int maxc = 0;
for (int i = n + m - 1; i >= 0; i--)
maxc = max(maxc, dfs(i, mato));
cout << "ans:" << maxc << endl;
}
return 0;
}
|
#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[index])
return dp[index];
if (!index)
return 1;
int maxc = 0;
for (int i = index - 1; i >= 0; i--) {
if ((mato[index].first <= mato[i].first) ||
(mato[index].second <= mato[i].second))
continue;
maxc = max(maxc, dfs(i, mato));
}
dp[index] = maxc + 1;
return dp[index];
}
void substitute(int time, vector<pair<int, int>> &mato) {
for (int i = 0; i < time; i++) {
pair<int, int> tmp;
cin >> tmp.first >> tmp.second;
mato.push_back(tmp);
}
}
int main() {
int n, m;
while (cin >> n && n != 0) {
fill(dp, dp + 200, 0);
vector<pair<int, int>> mato;
substitute(n, mato);
cin >> m;
substitute(m, mato);
sort(mato.begin(), mato.end());
int maxc = 0;
for (int i = n + m - 1; i >= 0; i--)
maxc = max(maxc, dfs(i, mato));
cout << maxc << endl;
}
return 0;
}
|
[["-", 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;
typedef complex<double> Point;
typedef long long ll;
const int INF = 114514810;
const int MOD = 100000007;
const double EPS = 1e-10;
const double PI = acos(-1.0);
struct edge {
int from, to, cost;
bool operator<(const edge &e) const { return cost < e.cost; }
bool operator>(const edge &e) const { return cost > e.cost; }
};
///*************************************************************************************///
///*************************************************************************************///
///*************************************************************************************///
vector<P> v;
int n, m;
int dp[201][1001];
int solve(int i, int r) {
if (i == v.size())
return 0;
if (dp[i][r] >= 0)
return dp[i][r];
int res;
if (v[i].second > r) {
res = max(solve(i + 1, r), solve(i + 1, v[i].second) + 1);
} else
res = solve(i + 1, r);
return dp[i][r] = res;
}
int main() {
while (cin >> n, n) {
v.clear();
MS(dp, -1);
REP(i, n) {
int a, b;
cin >> a >> b;
v.push_back(P(a, b));
}
cin >> m;
REP(i, m) {
int a, b;
cin >> a >> b;
v.push_back(P(a, b));
}
sort(ALL(v));
cout << solve(0, 0) << endl;
}
return 0;
}
|
#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;
typedef complex<double> Point;
typedef long long ll;
const int INF = 114514810;
const int MOD = 100000007;
const double EPS = 1e-10;
const double PI = acos(-1.0);
struct edge {
int from, to, cost;
bool operator<(const edge &e) const { return cost < e.cost; }
bool operator>(const edge &e) const { return cost > e.cost; }
};
///*************************************************************************************///
///*************************************************************************************///
///*************************************************************************************///
vector<P> v;
int n, m;
int dp[201][1001];
int solve(int i, int r) {
if (i == v.size())
return 0;
if (dp[i][r] >= 0)
return dp[i][r];
int res;
if (-v[i].second > r) {
res = max(solve(i + 1, r), solve(i + 1, -v[i].second) + 1);
} else
res = solve(i + 1, r);
return dp[i][r] = res;
}
int main() {
while (cin >> n, n) {
v.clear();
MS(dp, -1);
REP(i, n) {
int a, b;
cin >> a >> b;
v.push_back(P(a, -b));
}
cin >> m;
REP(i, m) {
int a, b;
cin >> a >> b;
v.push_back(P(a, -b));
}
sort(ALL(v));
cout << solve(0, 0) << endl;
}
return 0;
}
|
[["+", 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].first >> data[n + i].second;
for (int i = 0; i < n + m; i++) {
for (int j = i + 1; j < n + m; j++) {
if (data[i].first > data[j].first)
swap(data[i], data[j]);
}
}
int ans = 0;
for (int i = 0; i < n + m; i++) {
table[i] = 1;
for (int j = 0; j < i; j++) {
if (data[i].first > data[j].first && data[i].second > data[j].second)
table[i] = max(table[i], table[j] + 1);
}
ans = max(ans, table[i]);
}
cout << ans << endl;
}
return 0;
}
|
#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 + i].first >> data[n + i].second;
for (int i = 0; i < n + m; i++) {
for (int j = i + 1; j < n + m; j++) {
if (data[i].first > data[j].first)
swap(data[i], data[j]);
}
}
int ans = 0;
for (int i = 0; i < n + m; i++) {
table[i] = 1;
for (int j = 0; j < i; j++) {
if (data[i].first > data[j].first && data[i].second > data[j].second)
table[i] = max(table[i], table[j] + 1);
}
ans = max(ans, table[i]);
}
cout << ans << endl;
}
return 0;
}
|
[["+", 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() {
int n, m;
while (cin >> n && n) {
vector<Ma> ich(n);
REP(i, n) cin >> ich[i].h >> ich[i].r;
cin >> m;
vector<Ma> jir(m);
REP(i, m) cin >> jir[i].h >> jir[i].r;
vector<Ma> mas(n + m);
REP(i, n) mas[i] = ich[i];
REP(i, m) mas[i + n] = jir[i];
sort(mas.begin(), mas.end());
vector<int> dp(n + m, 1);
int result = 0;
REP(i, n + m) {
REP(j, n + m) {
if (mas[i].h < mas[j].h && mas[i].r < mas[j].r) {
dp[j] = max(dp[j], dp[i] + 1);
}
if (result < dp[j]) {
result = dp[j];
}
}
}
PP(dp);
cout << result << endl;
}
return 0;
}
|
#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() {
int n, m;
while (cin >> n && n) {
vector<Ma> ich(n);
REP(i, n) cin >> ich[i].h >> ich[i].r;
cin >> m;
vector<Ma> jir(m);
REP(i, m) cin >> jir[i].h >> jir[i].r;
vector<Ma> mas(n + m);
REP(i, n) mas[i] = ich[i];
REP(i, m) mas[i + n] = jir[i];
sort(mas.begin(), mas.end());
vector<int> dp(n + m, 1);
int result = 0;
REP(i, n + m) {
REP(j, n + m) {
if (mas[i].h < mas[j].h && mas[i].r < mas[j].r) {
dp[j] = max(dp[j], dp[i] + 1);
}
if (result < dp[j]) {
result = dp[j];
}
}
}
cout << result << endl;
}
return 0;
}
|
[["-", 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;
doll tmp;
for (int i = 0; i < n; i++) {
cin >> h >> r;
tmp.h = h;
tmp.r = r;
v.push_back(tmp);
}
int m;
cin >> m;
for (int i = 0; i < m; i++) {
cin >> h >> r;
tmp.h = h;
tmp.r = r;
v.push_back(tmp);
}
sort(v.begin(), v.end());
cout << endl;
/*for(int i=0;i<n+m;i++){
cout << v[i].h << " " << v[i].r << endl;
}*/
int dp[1001] = {0};
for (int i = 0; i < n + m; i++) {
int dm = 0;
for (int j = 0; j < v[i].r; j++) {
dm = max(dm, dp[j]);
}
dp[v[i].r] = dm + 1;
}
int ans = 0;
for (int i = 0; i < 1001; i++) {
// cout << dp[i] << endl;
ans = max(dp[i], ans);
}
cout << ans << endl;
}
return 0;
}
|
#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;
doll tmp;
for (int i = 0; i < n; i++) {
cin >> h >> r;
tmp.h = h;
tmp.r = r;
v.push_back(tmp);
}
int m;
cin >> m;
for (int i = 0; i < m; i++) {
cin >> h >> r;
tmp.h = h;
tmp.r = r;
v.push_back(tmp);
}
sort(v.begin(), v.end());
/*for(int i=0;i<n+m;i++){
cout << v[i].h << " " << v[i].r << endl;
}*/
int dp[1001] = {0};
for (int i = 0; i < n + m; i++) {
int dm = 0;
for (int j = 0; j < v[i].r; j++) {
dm = max(dm, dp[j]);
}
dp[v[i].r] = dm + 1;
}
int ans = 0;
for (int i = 0; i < 1001; i++) {
// cout << dp[i] << endl;
ans = max(dp[i], ans);
}
cout << ans << endl;
}
return 0;
}
|
[["-", 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 (int i = 0; i < n + m; i++)
for (int j = i + 1; j < n + m; j++)
if (h[i] > h[j] || (h[i] == h[j] && r[i] > r[j])) {
swap(h[i], h[j]);
swap(r[i], r[j]);
}
int ans = 0;
for (int i = 1; i < n + m; i++)
dp[i] = 0;
dp[0] = 1;
for (int i = 1; i < n + m; i++) {
for (int j = 0; j < i; j++)
if (h[i] > h[j] && r[i] > r[j])
dp[i] = max(dp[i], dp[j] + 1);
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
}
|
#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 (int i = 0; i < n + m; i++)
for (int j = i + 1; j < n + m; j++)
if (h[i] > h[j] || (h[i] == h[j] && r[i] > r[j])) {
swap(h[i], h[j]);
swap(r[i], r[j]);
}
int ans = 0;
for (int i = 1; i < n + m; i++)
dp[i] = 1;
dp[0] = 1;
for (int i = 1; i < n + m; i++) {
for (int j = 0; j < i; j++)
if (h[i] > h[j] && r[i] > r[j])
dp[i] = max(dp[i], dp[j] + 1);
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
}
|
[["-", 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 >> dataH[0][i] >> dataR[0][i];
sizeH = max(sizeH, dataH[0][i]);
sizeR = max(sizeR, dataR[0][i]);
}
cin >> m;
for (int i = 0; i < m; ++i) {
cin >> dataH[1][i] >> dataR[1][i];
sizeH = max(sizeH, dataH[1][i]);
sizeR = max(sizeR, dataR[1][i]);
}
fill(dp[0], dp[MAX_SIZE], -1);
dp[0][0] = 0;
for (int i = 0; i < sizeH; ++i) {
for (int j = 0; j < sizeR; ++j) {
if (dp[i][j] == -1)
continue;
for (int k = 0; k < n; ++k) {
if (dataH[0][k] > i && dataR[0][k] > j)
dp[dataH[0][k]][dataR[0][k]] =
max(dp[dataH[0][k]][dataR[0][k]], dp[i][j] + 1);
}
for (int k = 0; k < m; ++k) {
if (dataH[1][k] > i && dataR[1][k] > j)
dp[dataH[1][k]][dataR[1][k]] =
max(dp[dataH[1][k]][dataR[1][k]], dp[i][j] + 1);
}
}
}
int ans = 0;
for (int i = 0; i < sizeH; ++i) {
for (int j = 0; j < sizeR; ++j) {
ans = max(ans, dp[i][j]);
}
}
cout << ans << endl;
}
return 0;
}
|
#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 >> dataH[0][i] >> dataR[0][i];
sizeH = max(sizeH, dataH[0][i]);
sizeR = max(sizeR, dataR[0][i]);
}
cin >> m;
for (int i = 0; i < m; ++i) {
cin >> dataH[1][i] >> dataR[1][i];
sizeH = max(sizeH, dataH[1][i]);
sizeR = max(sizeR, dataR[1][i]);
}
fill(dp[0], dp[MAX_SIZE], -1);
dp[0][0] = 0;
for (int i = 0; i <= sizeH; ++i) {
for (int j = 0; j <= sizeR; ++j) {
if (dp[i][j] == -1)
continue;
for (int k = 0; k < n; ++k) {
if (dataH[0][k] > i && dataR[0][k] > j)
dp[dataH[0][k]][dataR[0][k]] =
max(dp[dataH[0][k]][dataR[0][k]], dp[i][j] + 1);
}
for (int k = 0; k < m; ++k) {
if (dataH[1][k] > i && dataR[1][k] > j)
dp[dataH[1][k]][dataR[1][k]] =
max(dp[dataH[1][k]][dataR[1][k]], dp[i][j] + 1);
}
}
}
int ans = 0;
for (int i = 0; i <= sizeH; ++i) {
for (int j = 0; j <= sizeR; ++j) {
ans = max(ans, dp[i][j]);
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 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) : x(x), y(y){};
point operator+(point &p) { return point(x + p.x, y + p.y); }
point operator-(point &p) { return point(x - p.x, y - p.y); }
point operator*(point &p) {
return point(x * p.x - y * p.y, x * p.y + y * p.x);
}
point operator*(double a) { return point(x * a, y * a); }
point operator/(double a) { return point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
} point;
double abs(point a) { return a.abs(); }
double norm(point a) { return a.norm(); }
typedef struct circle {
point p;
double r;
} circle;
typedef complex<double> C;
typedef struct {
point s, e;
} line;
C convert(point a) { return C(a.x, a.y); }
point convert(C a) { return point(a.real(), a.imag()); }
double dot(point a, point b) { return a.x * b.x + a.y * b.y; } //内積 a・b
double cross(point a, point b) {
return a.x * b.y - a.y * b.x;
} //外積(z成分) a×b
point vec(line l) { return l.e - l.s; }
line make(point s, point e) {
line res;
res.s = s;
res.e = e;
return res;
}
circle make(point p, double r) {
circle c;
c.p = p;
c.r = r;
return c;
}
point make() {
double x, y;
cin >> x >> y;
return point(x, y);
}
line lmake() {
point p0 = make();
point p1 = make();
return make(p0, p1);
}
//直交
bool isorthogonal(point a, point b) { return equals(dot(a, b), 0.0); }
bool isorthogonal(line l1, line l2) { return isorthogonal(vec(l1), vec(l2)); }
//平行
bool isparallel(point a, point b) { return equals(cross(a, b), 0.0); }
bool isparallel(line l1, line l2) { return isparallel(vec(l1), vec(l2)); }
//射影
point project(line s, point p) {
point base = vec(s);
double r = dot(p - s.s, base) / base.norm();
base = base * r;
return s.s + base;
}
//反射
point reflect(line l, point p) {
point tmp = project(l, p) - p;
tmp = tmp * 2.0;
return p + tmp;
}
//交差判定
int ccw(point p0, point p1, point p2) {
point a = p1 - p0;
point b = p2 - p0;
if (cross(a, b) > EPS)
return 1; // counter_clockwise
if (cross(a, b) < -EPS)
return -1; // clockwise
if (dot(a, b) < -EPS)
return 2; // online_back
if (a.norm() < b.norm())
return -2; // online_front
return 0; // on_segment
}
// circle_versino
int ccw(circle c0, circle c1) {
double d = abs(c0.p - c1.p);
double r0 = c0.r, r1 = c1.r;
// c0in c1
if (d < r1 - r0)
return -2;
// c1 in c0
if (d < r0 - r1)
return 2;
// c0 cross c1
if (abs(r0 - r1) <= d && d <= r0 + r1)
return 1;
// c0 not cross c1
return 0;
}
// line p1-p2 line p3-p4
bool intersect(point p1, point p2, point p3, point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
// line l1,l2
bool intersect(line l1, line l2) { return intersect(l1.s, l1.e, l2.s, l2.e); }
//距離
// point-point
double distance(point a, point b) { return abs(a - b); }
// point-line(直線）
double distance2(line l, point p) {
return abs(cross(vec(l), p - l.s) / abs(l.e - l.s));
}
// point-line(線分)
double distance(line l, point p) {
if (dot(vec(l), p - l.s) < 0.0)
return abs(p - l.s);
if (dot(l.s - l.e, p - l.e) < 0.0)
return abs(p - l.e);
return distance2(l, p);
}
// line-line
double distance(line l1, line l2) {
if (intersect(l1, l2))
return 0.0;
return min(min(distance(l1, l2.s), distance(l1, l2.e)),
min(distance(l2, l1.s), distance(l2, l1.e)));
}
//交点
point crosspoint(line l1, line l2) {
point base = vec(l2);
double d1 = abs(cross(base, l1.s - l2.s));
double d2 = abs(cross(base, l1.e - l2.s));
double t = d1 / (d1 + d2);
point tmp = vec(l1) * t;
return l1.s + tmp;
}
//面積
double area(vector<point> p, int n) {
double ans = 0.0;
for (int i = 0; i < n - 2; i++) {
ans += cross(p[i + 2] - p[0], p[i + 1] - p[0]);
}
return abs(ans) / 2;
}
double area(vector<point> p) { return area(p, p.size()); }
//内包
int contains(vector<point> &g, point p) {
int n = g.size();
bool flag = false;
for (int i = 0; i < n; i++) {
point a = g[i] - p, b = g[(i + 1) % n] - p;
if (abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return 1;
if (a.y > b.y)
swap(a, b);
if (a.y < EPS && EPS < b.y && cross(a, b) > EPS)
flag = !flag;
}
return (flag ? 2 : 0);
}
//凸包
vector<point> andrewscan(vector<point> s) {
vector<point> u, l;
if (s.size() < 3)
return s;
sort(s.begin(), s.end());
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
for (int i = 2; i < s.size(); i++) {
//凸包の辺上を含めない場合
for (int n = u.size(); n >= 2 && ccw(u[n - 2], u[n - 1], s[i]) != CLOCKWISE;
n--)
//凸包の辺上を含める場合
// for(int n=u.size();n>=2&&ccw(u[n-2],u[n-1],s[i])==COUNTER_CLOCKWISE;n--)
{
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
//凸包の辺上を含めない場合
for (int n = l.size(); n >= 2 && ccw(l[n - 2], l[n - 1], s[i]) != CLOCKWISE;
n--)
//凸包の辺上を含める場合
// for(int n=l.size();n>=2&&ccw(l[n-2],l[n-1],s[i])==COUNTER_CLOCKWISE;n--)
{
l.pop_back();
}
l.push_back(s[i]);
}
reverse(l.begin(), l.end());
for (int i = u.size() - 2; i >= 1; i--)
l.push_back(u[i]);
return l;
}
//直径
double convex_diameter(vector<point> g) {
int n = g.size();
int is = 0, js = 0;
for (int i = 1; i < n; i++) {
if (g[is].y < g[i].y)
is = i;
if (g[i].y < g[js].y)
js = i;
}
double maxd = abs((g[is] - g[js]));
int i, mi, j, mj;
i = mi = is;
j = mj = js;
do {
if (cross(g[(i + 1) % n] - g[i], g[(j + 1) % n] - g[j]) >= 0)
j = (j + 1) % n;
else
i = (i + 1) % n;
if (abs(g[i] - g[j]) > maxd) {
// cerr<<i<<' '<<j<<' '<<norm(g[i]-g[j])<<endl;
maxd = abs(g[i] - g[j]);
mi = i;
mj = j;
}
} while (i != is || j != js);
return maxd;
}
int main() {
while (1) {
vector<point> tri(3);
tri[0] = make();
if (tri[0].x == 0 && tri[0].y == 0)
break;
tri[1] = make();
tri[2] = make();
vector<line> l(3);
l[0] = make(tri[0], tri[1]);
l[1] = make(tri[1], tri[2]);
l[2] = make(tri[2], tri[0]);
point p = make();
double r;
cin >> r;
circle c = make(p, r);
// circle in triangle
if (r <= distance(l[0], p) && r <= distance(l[1], p) &&
r <= distance(l[2], p) && contains(tri, p)) {
cout << 'a' << endl;
continue;
}
// triangle in circle
if (r >= distance(tri[0], p) && r >= distance(tri[1], p) &&
r >= distance(tri[2], p)) {
cout << 'b' << endl;
continue;
}
// cross
if (r >= distance(tri[0], p) || r >= distance(tri[1], p) ||
r >= distance(tri[2], p)) {
cout << 'c' << endl;
continue;
}
cout << 'd' << endl;
}
return 0;
}
|
#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) : x(x), y(y){};
point operator+(point &p) { return point(x + p.x, y + p.y); }
point operator-(point &p) { return point(x - p.x, y - p.y); }
point operator*(point &p) {
return point(x * p.x - y * p.y, x * p.y + y * p.x);
}
point operator*(double a) { return point(x * a, y * a); }
point operator/(double a) { return point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
} point;
double abs(point a) { return a.abs(); }
double norm(point a) { return a.norm(); }
typedef struct circle {
point p;
double r;
} circle;
typedef complex<double> C;
typedef struct {
point s, e;
} line;
C convert(point a) { return C(a.x, a.y); }
point convert(C a) { return point(a.real(), a.imag()); }
double dot(point a, point b) { return a.x * b.x + a.y * b.y; } //内積 a・b
double cross(point a, point b) {
return a.x * b.y - a.y * b.x;
} //外積(z成分) a×b
point vec(line l) { return l.e - l.s; }
line make(point s, point e) {
line res;
res.s = s;
res.e = e;
return res;
}
circle make(point p, double r) {
circle c;
c.p = p;
c.r = r;
return c;
}
point make() {
double x, y;
cin >> x >> y;
return point(x, y);
}
line lmake() {
point p0 = make();
point p1 = make();
return make(p0, p1);
}
//直交
bool isorthogonal(point a, point b) { return equals(dot(a, b), 0.0); }
bool isorthogonal(line l1, line l2) { return isorthogonal(vec(l1), vec(l2)); }
//平行
bool isparallel(point a, point b) { return equals(cross(a, b), 0.0); }
bool isparallel(line l1, line l2) { return isparallel(vec(l1), vec(l2)); }
//射影
point project(line s, point p) {
point base = vec(s);
double r = dot(p - s.s, base) / base.norm();
base = base * r;
return s.s + base;
}
//反射
point reflect(line l, point p) {
point tmp = project(l, p) - p;
tmp = tmp * 2.0;
return p + tmp;
}
//交差判定
int ccw(point p0, point p1, point p2) {
point a = p1 - p0;
point b = p2 - p0;
if (cross(a, b) > EPS)
return 1; // counter_clockwise
if (cross(a, b) < -EPS)
return -1; // clockwise
if (dot(a, b) < -EPS)
return 2; // online_back
if (a.norm() < b.norm())
return -2; // online_front
return 0; // on_segment
}
// circle_versino
int ccw(circle c0, circle c1) {
double d = abs(c0.p - c1.p);
double r0 = c0.r, r1 = c1.r;
// c0in c1
if (d < r1 - r0)
return -2;
// c1 in c0
if (d < r0 - r1)
return 2;
// c0 cross c1
if (abs(r0 - r1) <= d && d <= r0 + r1)
return 1;
// c0 not cross c1
return 0;
}
// line p1-p2 line p3-p4
bool intersect(point p1, point p2, point p3, point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
// line l1,l2
bool intersect(line l1, line l2) { return intersect(l1.s, l1.e, l2.s, l2.e); }
//距離
// point-point
double distance(point a, point b) { return abs(a - b); }
// point-line(直線）
double distance2(line l, point p) {
return abs(cross(vec(l), p - l.s) / abs(l.e - l.s));
}
// point-line(線分)
double distance(line l, point p) {
if (dot(vec(l), p - l.s) < 0.0)
return abs(p - l.s);
if (dot(l.s - l.e, p - l.e) < 0.0)
return abs(p - l.e);
return distance2(l, p);
}
// line-line
double distance(line l1, line l2) {
if (intersect(l1, l2))
return 0.0;
return min(min(distance(l1, l2.s), distance(l1, l2.e)),
min(distance(l2, l1.s), distance(l2, l1.e)));
}
//交点
point crosspoint(line l1, line l2) {
point base = vec(l2);
double d1 = abs(cross(base, l1.s - l2.s));
double d2 = abs(cross(base, l1.e - l2.s));
double t = d1 / (d1 + d2);
point tmp = vec(l1) * t;
return l1.s + tmp;
}
//面積
double area(vector<point> p, int n) {
double ans = 0.0;
for (int i = 0; i < n - 2; i++) {
ans += cross(p[i + 2] - p[0], p[i + 1] - p[0]);
}
return abs(ans) / 2;
}
double area(vector<point> p) { return area(p, p.size()); }
//内包
int contains(vector<point> &g, point p) {
int n = g.size();
bool flag = false;
for (int i = 0; i < n; i++) {
point a = g[i] - p, b = g[(i + 1) % n] - p;
if (abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return 1;
if (a.y > b.y)
swap(a, b);
if (a.y < EPS && EPS < b.y && cross(a, b) > EPS)
flag = !flag;
}
return (flag ? 2 : 0);
}
//凸包
vector<point> andrewscan(vector<point> s) {
vector<point> u, l;
if (s.size() < 3)
return s;
sort(s.begin(), s.end());
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
for (int i = 2; i < s.size(); i++) {
//凸包の辺上を含めない場合
for (int n = u.size(); n >= 2 && ccw(u[n - 2], u[n - 1], s[i]) != CLOCKWISE;
n--)
//凸包の辺上を含める場合
// for(int n=u.size();n>=2&&ccw(u[n-2],u[n-1],s[i])==COUNTER_CLOCKWISE;n--)
{
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
//凸包の辺上を含めない場合
for (int n = l.size(); n >= 2 && ccw(l[n - 2], l[n - 1], s[i]) != CLOCKWISE;
n--)
//凸包の辺上を含める場合
// for(int n=l.size();n>=2&&ccw(l[n-2],l[n-1],s[i])==COUNTER_CLOCKWISE;n--)
{
l.pop_back();
}
l.push_back(s[i]);
}
reverse(l.begin(), l.end());
for (int i = u.size() - 2; i >= 1; i--)
l.push_back(u[i]);
return l;
}
//直径
double convex_diameter(vector<point> g) {
int n = g.size();
int is = 0, js = 0;
for (int i = 1; i < n; i++) {
if (g[is].y < g[i].y)
is = i;
if (g[i].y < g[js].y)
js = i;
}
double maxd = abs((g[is] - g[js]));
int i, mi, j, mj;
i = mi = is;
j = mj = js;
do {
if (cross(g[(i + 1) % n] - g[i], g[(j + 1) % n] - g[j]) >= 0)
j = (j + 1) % n;
else
i = (i + 1) % n;
if (abs(g[i] - g[j]) > maxd) {
// cerr<<i<<' '<<j<<' '<<norm(g[i]-g[j])<<endl;
maxd = abs(g[i] - g[j]);
mi = i;
mj = j;
}
} while (i != is || j != js);
return maxd;
}
int main() {
while (1) {
vector<point> tri(3);
tri[0] = make();
if (tri[0].x == 0 && tri[0].y == 0)
break;
tri[1] = make();
tri[2] = make();
vector<line> l(3);
l[0] = make(tri[0], tri[1]);
l[1] = make(tri[1], tri[2]);
l[2] = make(tri[2], tri[0]);
point p = make();
double r;
cin >> r;
circle c = make(p, r);
// circle in triangle
if (r <= distance(l[0], p) && r <= distance(l[1], p) &&
r <= distance(l[2], p) && contains(tri, p)) {
cout << 'a' << endl;
continue;
}
// triangle in circle
if (r >= distance(tri[0], p) && r >= distance(tri[1], p) &&
r >= distance(tri[2], p)) {
cout << 'b' << endl;
continue;
}
// cross
if (r >= distance(l[0], p) || r >= distance(l[1], p) ||
r >= distance(l[2], p)) {
cout << 'c' << endl;
continue;
}
cout << 'd' << endl;
}
return 0;
}
|
[["-", 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), p2(p2) {}
};
struct Line {
Point p1, p2;
Line(const Point &p1 = Point(), const Point &p2 = Point()) : p1(p1), p2(p2) {}
};
struct Circle {
Point p;
double r;
Circle(const Point &p = Point(), double r = 0.0) : p(p), r(r) {}
};
// constants---------------------------------------------------------------
const double PI = acos(-1);
const double EPS = 1e-12;
const double INF = 1e16;
const int COUNTER_CLOCKWISE = 1;
const int CLOCKWISE = -1;
const int ONLINE_BACK = 2;
const int ONLINE_FRONT = -2;
const int ON_SEGMENT = 0;
const int IN = 2;
const int ON = 1;
const int OUT = 0;
// calculations------------------------------------------------------------
inline double square(double a) { return a * a; }
inline double norm(const Point &a) {
return square(a.real()) + square(a.imag());
}
inline double dot(const Point &a, const Point &b) {
return (conj(a) * b).real();
}
inline double cross(const Point &a, const Point &b) {
return (conj(a) * b).imag();
}
inline double toDeg(double t) { return t / PI * 180.0; }
inline double toRad(double t) { return t / 180.0 * t; }
inline double arg(Vector p) { return atan2(imag(p), real(p)); }
inline Vector polar(double a, double r) { return Vector(cos(r), sin(r)) * a; }
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define equalsv(a, b) (equals(real(a), real(b)) && equals(imag(a), imag(b)))
#define curr(P, i) P[(i) % P.size()]
#define next(P, i) P[(i + 1) % P.size()]
#define prev(P, i) P[(i - 1 + P.size()) % P.size()]
int ccw(Point p0, Point p1, Point p2) {
Vector a = p1 - p0;
Vector b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < EPS)
return ONLINE_BACK;
if (norm(a) < norm(b))
return ONLINE_FRONT;
return ON_SEGMENT;
}
// inputer-----------------------------------------------------------------
void inputPoint(Point &p) {
double x, y;
scanf("%lf%lf", &x, &y);
p = Point(x, y);
}
void inputSegment(Segment &s) {
inputPoint(s.p1);
inputPoint(s.p2);
}
void inputLine(Line &l) {
inputPoint(l.p1);
inputPoint(l.p2);
}
void inputCircle(Circle &c) {
inputPoint(c.p);
scanf("%lf", &c.r);
}
void inputPolygon(Polygon &g, int n) {
g.resize(n);
for (int i = 0; i < n; i++)
inputPoint(g[i]);
}
// orthogonal--------------------------------------------------------------
bool orthogonal(Vector a, Vector b) { return equals(dot(a, b), 0.0); }
bool orthogonal(Point a1, Point a2, Point b1, Point b2) {
return orthogonal(a1 - a2, b1 - b2);
}
bool orthogonal(Segment s1, Segment s2) {
return orthogonal(s1.p1 - s1.p2, s2.p1 - s2.p2);
}
bool orthogonal(Line l1, Line l2) {
return orthogonal(l1.p1 - l1.p2, l2.p1 - l2.p2);
}
// parallel----------------------------------------------------------------
bool parallel(Vector a, Vector b) { return equals(cross(a, b), 0.0); }
bool parallel(Point a1, Point a2, Point b1, Point b2) {
return parallel(a1 - a2, b1 - b2);
}
bool parallel(Segment s1, Segment s2) {
return parallel(s1.p1 - s1.p2, s2.p1 - s2.p2);
}
bool parallel(Line l1, Line l2) {
return parallel(l1.p1 - l1.p2, l2.p1 - l2.p2);
}
// project&reflect---------------------------------------------------------
Point project(Line s, Point p) {
Vector base = s.p2 - s.p1;
double r = dot(p - s.p1, base) / norm(base);
return s.p1 + base * r;
}
Point reflect(Line s, Point p) { return p + (project(s, p) - p) * 2.0; }
// distance----------------------------------------------------------------
double distancePP(Point a, Point b) { return abs(a - b); }
double distanceLP(Line l, Point p) {
return fabs(cross(l.p2 - l.p1, p - l.p1) / abs(l.p2 - l.p1));
}
double distanceLL(Line l, Line m) {
if (parallel(l, m))
return distanceLP(l, m.p1);
return 0.0;
}
double distanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return distancePP(p, s.p1);
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return distancePP(p, s.p2);
return distanceLP(Line(s.p1, s.p2), p);
}
double distanceSS(Segment s1, Segment s2) {
if (ccw(s1.p1, s1.p2, s2.p1) * ccw(s1.p1, s1.p2, s2.p2) <= 0 &&
ccw(s2.p1, s2.p2, s1.p1) * ccw(s2.p1, s2.p2, s1.p2) <= 0)
return 0;
return min(min(distanceSP(s1, s2.p1), distanceSP(s1, s2.p2)),
min(distanceSP(s2, s1.p1), distanceSP(s2, s1.p2)));
}
double distanceCS(Circle c, Segment s) { return distanceSP(s, c.p) - c.r; }
// intersect----------------------------------------------------------------
bool intersectSS(Point p1, Point p2, Point p3, Point p4) {
return ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0;
}
bool intersectSS(Segment s1, Segment s2) {
return intersectSS(s1.p1, s1.p2, s2.p1, s2.p2);
}
bool intersectCL(Circle c, Line l) {
return fabs(cross(l.p2 - l.p1, c.p - l.p1) / abs(l.p2 - l.p1)) <= c.r + EPS;
}
bool intersectCC(Circle c1, Circle c2) {
return abs(c1.p - c2.p) <= c1.r + c2.r + EPS;
}
bool intersectCS(Circle c, Segment s) {
return distanceSP(s, c.p) <= c.r + EPS;
}
// crossPoint--------------------------------------------------------------
Point crossPoint(Segment s1, Segment s2) {
double crs = cross(s1.p2 - s1.p1, s2.p2 - s2.p1);
return s2.p1 +
(s2.p2 - s2.p1) * cross(s1.p2 - s1.p1, s1.p2 - s2.p1) * (1.0 / crs);
}
pair<Point, Point> crossPoints(Circle c, Line l) {
assert(intersectCL(c, l));
Vector pr = project(l, c.p);
Vector e = (l.p2 - l.p1) / abs(l.p2 - l.p1);
double base = sqrt(square(c.r) - norm(pr - c.p));
return make_pair(pr + e * base, pr - e * base);
}
pair<Point, Point> crossPoints(Circle c1, Circle c2) {
assert(intersectCC(c1, c2));
double d = abs(c1.p - c2.p);
double a = acos((square(c1.r) + square(d) - square(c2.r)) / (2 * c1.r * d));
double t = arg(c2.p - c1.p);
return make_pair(c1.p + polar(c1.r, t + a), c1.p + polar(c1.r, t - a));
}
// polygon------------------------------------------------------------------
double area(Polygon &g) {
const int sz = g.size();
double res = cross(g[sz - 1], g[0]);
for (int i = 1; i < sz; i++)
res += cross(g[i - 1], g[i]);
return fabs(res) * 0.5;
}
bool convex(Polygon &g) {
for (int i = 0; i < g.size(); i++) {
if (ccw(prev(g, i), curr(g, i), next(g, i)) == CLOCKWISE)
return false;
}
return true;
}
// other-------------------------------------------------------------------
int contains(Circle c, Point p) {
double d = distancePP(c.p, p);
if (equals(d, c.r))
return ON;
return d < c.r ? IN : OUT;
}
int contains(Polygon g, Point p) {
int n = g.size();
bool x = false;
for (int i = 0; i < n; i++) {
Point a = g[i] - p, b = next(g, i) - p;
if (abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return ON;
if (imag(a) > imag(b))
swap(a, b);
if (imag(a) < EPS && EPS < imag(b) && cross(a, b) > EPS)
x = !x;
}
return x ? IN : OUT;
}
int contains(Circle c, Polygon g) {
for (int i = 0; i < g.size(); i++) {
if (!contains(c, g[0]))
return OUT;
}
return IN;
}
int contains(Polygon g, Circle c) {
if (contains(g, c.p) != IN)
return OUT;
for (int i = 0; i < g.size(); i++) {
if (distanceCS(c, Segment(g[i], next(g, i))) < -EPS)
return OUT;
}
return IN;
}
// end---------------------------------------------------------------------
int main() {
while (true) {
Polygon g(3);
Circle c;
inputPoint(g[0]);
if (real(g[0]) == 0 && imag(g[0]) == 0)
break;
inputPoint(g[1]);
inputPoint(g[2]);
inputCircle(c);
bool f = true;
if (contains(c, g)) {
puts("b");
continue;
}
f = true;
for (int i = 0; i < g.size(); i++) {
Segment s(g[i], next(g, i));
if (distanceCS(c, s) < -EPS)
f = false;
}
if (f && contains(g, c.p)) {
puts("a");
continue;
}
f = false;
for (int i = 0; i < g.size(); i++) {
Segment s(g[i], next(g, i));
if (intersectCS(c, s)) {
f = true;
}
}
if (f) {
puts("c");
} else
puts("d");
}
return 0;
}
|
#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), p2(p2) {}
};
struct Line {
Point p1, p2;
Line(const Point &p1 = Point(), const Point &p2 = Point()) : p1(p1), p2(p2) {}
};
struct Circle {
Point p;
double r;
Circle(const Point &p = Point(), double r = 0.0) : p(p), r(r) {}
};
// constants---------------------------------------------------------------
const double PI = acos(-1);
const double EPS = 1e-12;
const double INF = 1e16;
const int COUNTER_CLOCKWISE = 1;
const int CLOCKWISE = -1;
const int ONLINE_BACK = 2;
const int ONLINE_FRONT = -2;
const int ON_SEGMENT = 0;
const int IN = 2;
const int ON = 1;
const int OUT = 0;
// calculations------------------------------------------------------------
inline double square(double a) { return a * a; }
inline double norm(const Point &a) {
return square(a.real()) + square(a.imag());
}
inline double dot(const Point &a, const Point &b) {
return (conj(a) * b).real();
}
inline double cross(const Point &a, const Point &b) {
return (conj(a) * b).imag();
}
inline double toDeg(double t) { return t / PI * 180.0; }
inline double toRad(double t) { return t / 180.0 * t; }
inline double arg(Vector p) { return atan2(imag(p), real(p)); }
inline Vector polar(double a, double r) { return Vector(cos(r), sin(r)) * a; }
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define equalsv(a, b) (equals(real(a), real(b)) && equals(imag(a), imag(b)))
#define curr(P, i) P[(i) % P.size()]
#define next(P, i) P[(i + 1) % P.size()]
#define prev(P, i) P[(i - 1 + P.size()) % P.size()]
int ccw(Point p0, Point p1, Point p2) {
Vector a = p1 - p0;
Vector b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < EPS)
return ONLINE_BACK;
if (norm(a) < norm(b))
return ONLINE_FRONT;
return ON_SEGMENT;
}
// inputer-----------------------------------------------------------------
void inputPoint(Point &p) {
double x, y;
scanf("%lf%lf", &x, &y);
p = Point(x, y);
}
void inputSegment(Segment &s) {
inputPoint(s.p1);
inputPoint(s.p2);
}
void inputLine(Line &l) {
inputPoint(l.p1);
inputPoint(l.p2);
}
void inputCircle(Circle &c) {
inputPoint(c.p);
scanf("%lf", &c.r);
}
void inputPolygon(Polygon &g, int n) {
g.resize(n);
for (int i = 0; i < n; i++)
inputPoint(g[i]);
}
// orthogonal--------------------------------------------------------------
bool orthogonal(Vector a, Vector b) { return equals(dot(a, b), 0.0); }
bool orthogonal(Point a1, Point a2, Point b1, Point b2) {
return orthogonal(a1 - a2, b1 - b2);
}
bool orthogonal(Segment s1, Segment s2) {
return orthogonal(s1.p1 - s1.p2, s2.p1 - s2.p2);
}
bool orthogonal(Line l1, Line l2) {
return orthogonal(l1.p1 - l1.p2, l2.p1 - l2.p2);
}
// parallel----------------------------------------------------------------
bool parallel(Vector a, Vector b) { return equals(cross(a, b), 0.0); }
bool parallel(Point a1, Point a2, Point b1, Point b2) {
return parallel(a1 - a2, b1 - b2);
}
bool parallel(Segment s1, Segment s2) {
return parallel(s1.p1 - s1.p2, s2.p1 - s2.p2);
}
bool parallel(Line l1, Line l2) {
return parallel(l1.p1 - l1.p2, l2.p1 - l2.p2);
}
// project&reflect---------------------------------------------------------
Point project(Line s, Point p) {
Vector base = s.p2 - s.p1;
double r = dot(p - s.p1, base) / norm(base);
return s.p1 + base * r;
}
Point reflect(Line s, Point p) { return p + (project(s, p) - p) * 2.0; }
// distance----------------------------------------------------------------
double distancePP(Point a, Point b) { return abs(a - b); }
double distanceLP(Line l, Point p) {
return fabs(cross(l.p2 - l.p1, p - l.p1) / abs(l.p2 - l.p1));
}
double distanceLL(Line l, Line m) {
if (parallel(l, m))
return distanceLP(l, m.p1);
return 0.0;
}
double distanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return distancePP(p, s.p1);
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return distancePP(p, s.p2);
return distanceLP(Line(s.p1, s.p2), p);
}
double distanceSS(Segment s1, Segment s2) {
if (ccw(s1.p1, s1.p2, s2.p1) * ccw(s1.p1, s1.p2, s2.p2) <= 0 &&
ccw(s2.p1, s2.p2, s1.p1) * ccw(s2.p1, s2.p2, s1.p2) <= 0)
return 0;
return min(min(distanceSP(s1, s2.p1), distanceSP(s1, s2.p2)),
min(distanceSP(s2, s1.p1), distanceSP(s2, s1.p2)));
}
double distanceCS(Circle c, Segment s) { return distanceSP(s, c.p) - c.r; }
// intersect----------------------------------------------------------------
bool intersectSS(Point p1, Point p2, Point p3, Point p4) {
return ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0;
}
bool intersectSS(Segment s1, Segment s2) {
return intersectSS(s1.p1, s1.p2, s2.p1, s2.p2);
}
bool intersectCL(Circle c, Line l) {
return fabs(cross(l.p2 - l.p1, c.p - l.p1) / abs(l.p2 - l.p1)) <= c.r + EPS;
}
bool intersectCC(Circle c1, Circle c2) {
return abs(c1.p - c2.p) <= c1.r + c2.r + EPS;
}
bool intersectCS(Circle c, Segment s) {
return distanceSP(s, c.p) <= c.r + EPS;
}
// crossPoint--------------------------------------------------------------
Point crossPoint(Segment s1, Segment s2) {
double crs = cross(s1.p2 - s1.p1, s2.p2 - s2.p1);
return s2.p1 +
(s2.p2 - s2.p1) * cross(s1.p2 - s1.p1, s1.p2 - s2.p1) * (1.0 / crs);
}
pair<Point, Point> crossPoints(Circle c, Line l) {
assert(intersectCL(c, l));
Vector pr = project(l, c.p);
Vector e = (l.p2 - l.p1) / abs(l.p2 - l.p1);
double base = sqrt(square(c.r) - norm(pr - c.p));
return make_pair(pr + e * base, pr - e * base);
}
pair<Point, Point> crossPoints(Circle c1, Circle c2) {
assert(intersectCC(c1, c2));
double d = abs(c1.p - c2.p);
double a = acos((square(c1.r) + square(d) - square(c2.r)) / (2 * c1.r * d));
double t = arg(c2.p - c1.p);
return make_pair(c1.p + polar(c1.r, t + a), c1.p + polar(c1.r, t - a));
}
// polygon------------------------------------------------------------------
double area(Polygon &g) {
const int sz = g.size();
double res = cross(g[sz - 1], g[0]);
for (int i = 1; i < sz; i++)
res += cross(g[i - 1], g[i]);
return fabs(res) * 0.5;
}
bool convex(Polygon &g) {
for (int i = 0; i < g.size(); i++) {
if (ccw(prev(g, i), curr(g, i), next(g, i)) == CLOCKWISE)
return false;
}
return true;
}
// other-------------------------------------------------------------------
int contains(Circle c, Point p) {
double d = distancePP(c.p, p);
if (equals(d, c.r))
return ON;
return d < c.r ? IN : OUT;
}
int contains(Polygon g, Point p) {
int n = g.size();
bool x = false;
for (int i = 0; i < n; i++) {
Point a = g[i] - p, b = next(g, i) - p;
if (abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return ON;
if (imag(a) > imag(b))
swap(a, b);
if (imag(a) < EPS && EPS < imag(b) && cross(a, b) > EPS)
x = !x;
}
return x ? IN : OUT;
}
int contains(Circle c, Polygon g) {
for (int i = 0; i < g.size(); i++) {
if (!contains(c, g[i]))
return OUT;
}
return IN;
}
int contains(Polygon g, Circle c) {
if (contains(g, c.p) != IN)
return OUT;
for (int i = 0; i < g.size(); i++) {
if (distanceCS(c, Segment(g[i], next(g, i))) < -EPS)
return OUT;
}
return IN;
}
// end---------------------------------------------------------------------
int main() {
while (true) {
Polygon g(3);
Circle c;
inputPoint(g[0]);
if (real(g[0]) == 0 && imag(g[0]) == 0)
break;
inputPoint(g[1]);
inputPoint(g[2]);
inputCircle(c);
bool f = true;
if (contains(c, g)) {
puts("b");
continue;
}
f = true;
for (int i = 0; i < g.size(); i++) {
Segment s(g[i], next(g, i));
if (distanceCS(c, s) < -EPS)
f = false;
}
if (f && contains(g, c.p)) {
puts("a");
continue;
}
f = false;
for (int i = 0; i < g.size(); i++) {
Segment s(g[i], next(g, i));
if (intersectCS(c, s)) {
f = true;
}
}
if (f) {
puts("c");
} else
puts("d");
}
return 0;
}
|
[["-", 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(double a, double b) { return (fabs(a - b) < eps); }
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return (Point(x + p.x, y + p.y)); }
Point operator-(Point p) { return (Point(x - p.x, y - p.y)); }
Point operator*(double a) { return (Point(a * x, a * y)); }
Point operator/(double a) { return (Point(x / a, y / a)); }
double abs() { return (sqrt(norm())); }
double norm() { return (x * x + y * y); }
bool operator<(const Point &p) const {
return (x != p.x ? x < p.x : y < p.y);
}
bool operator==(const Point &p) const {
return (fabs(x - p.x) < eps && fabs(y - p.y) < eps);
}
};
typedef Point Vector;
struct Segment {
Point p1, p2;
Segment(Point p1, Point p2) : p1(p1), p2(p2){};
};
typedef Segment Line;
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
};
double dot(Vector a, Vector b) { return (a.x * b.x + a.y * b.y); }
double cross(Vector a, Vector b) { return (a.x * b.y - a.y * b.x); }
Point project(Segment s, Point p) {
Vector base = s.p2 - s.p1;
double r = dot(p - s.p1, base) / base.norm();
return (s.p1 + base * r);
}
Point reflect(Segment s, Point p) { return (p + (project(s, p) - p) * 2.0); }
bool isOrthogonal(Vector a, Vector b) { return (equals(dot(a, b), 0.0)); }
bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return (isOrthogonal(a1 - a2, b1 - b2));
}
bool isOrthogonal(Segment s1, Segment s2) {
return (equals(dot(s1.p2 - s2.p1, s2.p2 - s2.p1), 0.0));
}
bool isParallel(Vector a, Vector b) { return (equals(cross(a, b), 0.0)); }
bool isParallel(Point a1, Point a2, Point b1, Point b2) {
return (isParallel(a1 - a2, b1 - b2));
}
bool isParallel(Segment s1, Segment s2) {
return (equals(cross(s1.p1 - s1.p1, s2.p2 - s2.p1), 0.0));
}
int ccw(Point p0, Point p1, Point p2) {
Vector a = p1 - p0;
Vector b = p2 - p0;
if (cross(a, b) > eps) {
return (COUNTER_CLOCKWISE);
}
if (cross(a, b) < -eps) {
return (CLOCKWISE);
}
if (dot(a, b) < -eps) {
return (ONLINE_BACK);
}
if (a.norm() < b.norm()) {
return (ONLINE_FRONT);
}
return (ON_SEGMENT);
}
bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
bool intersect(Segment s1, Segment s2) {
return (intersect(s1.p1, s1.p2, s2.p1, s2.p2));
}
double getDistance(Point a, Point b) { return ((a - b).abs()); }
double getDistanceLP(Line l, Point p) {
return (abs((cross(l.p2 - l.p1, p - l.p1) / (l.p2 - l.p1).abs())));
}
double getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0) {
return ((p - s.p1).abs());
}
if (dot(s.p1 - s.p2, p - s.p2) < 0.0) {
return ((p - s.p2).abs());
}
return (getDistanceLP(s, p));
}
double getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2)) {
return (0.0);
}
return (min(min(getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2)),
min(getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2))));
}
Point getCrossPoint(Segment s1, Segment s2) {
Vector base = s2.p2 - s2.p1;
double d1 = abs(cross(base, s1.p1 - s2.p1));
double d2 = abs(cross(base, s1.p2 - s2.p1));
double t = d1 / (d1 + d2);
return (s1.p1 + (s1.p2 - s1.p1) * t);
}
double arg(Vector p) { return (atan2(p.y, p.x)); }
Vector polar(double a, double r) { return (Point(cos(r) * a, sin(r) * a)); }
pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs();
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return (make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a)));
}
pair<Point, Point> getCrossPoints(Circle c, Line l) {
Vector pr = project(l, c.c);
Vector e = (l.p2 - l.p1) / (l.p2 - l.p1).abs();
double base = sqrt(c.r * c.r - (pr - c.c).norm());
return (make_pair(pr - e * base, pr + e * base));
}
bool inc(Point p1, Point p2, Point p3, Point p4) {
Point e0 = p1 - p4;
Point e1 = p2 - p4;
Point e2 = p3 - p4;
long double d0 = cross(e0, e1);
long double d1 = cross(e1, e2);
long double d2 = cross(e2, e0);
if (d0 * d1 > 0 && d1 * d2 > 0 && d2 * d0 > 0) {
return (true);
}
return (false);
}
void solve() {
cin.tie(0);
ios::sync_with_stdio(false);
Point p1;
while (cin >> p1.x >> p1.y, p1.x || p1.y) {
Point p2, p3, p4;
int r;
cin >> p2.x >> p2.y >> p3.x >> p3.y >> p4.x >> p4.y >> r;
if (r - getDistance(p4, p1) > 0 && r - getDistance(p4, p2) > 0 &&
r - getDistance(p4, p3) > 0) {
cout << "b" << endl;
} else if (inc(p1, p2, p3, p4) &&
getDistanceSP(Segment(p1, p2), p4) - r >= 0 &&
getDistanceSP(Segment(p1, p3), p4) - r >= 0 &&
getDistanceSP(Segment(p2, p3), p4) - r >= 0) {
cout << "a" << endl;
} else if (inc(p1, p2, p3, p4) == false &&
getDistanceSP(Segment(p1, p2), p4) - r > 0 &&
getDistanceSP(Segment(p1, p3), p4) - r > 0 &&
getDistanceSP(Segment(p2, p3), p4) - r > 0) {
cout << "d" << endl;
} else {
cout << "c" << endl;
}
}
}
int main() {
solve();
return (0);
}
|
#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(double a, double b) { return (fabs(a - b) < eps); }
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return (Point(x + p.x, y + p.y)); }
Point operator-(Point p) { return (Point(x - p.x, y - p.y)); }
Point operator*(double a) { return (Point(a * x, a * y)); }
Point operator/(double a) { return (Point(x / a, y / a)); }
double abs() { return (sqrt(norm())); }
double norm() { return (x * x + y * y); }
bool operator<(const Point &p) const {
return (x != p.x ? x < p.x : y < p.y);
}
bool operator==(const Point &p) const {
return (fabs(x - p.x) < eps && fabs(y - p.y) < eps);
}
};
typedef Point Vector;
struct Segment {
Point p1, p2;
Segment(Point p1, Point p2) : p1(p1), p2(p2){};
};
typedef Segment Line;
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
};
double dot(Vector a, Vector b) { return (a.x * b.x + a.y * b.y); }
double cross(Vector a, Vector b) { return (a.x * b.y - a.y * b.x); }
Point project(Segment s, Point p) {
Vector base = s.p2 - s.p1;
double r = dot(p - s.p1, base) / base.norm();
return (s.p1 + base * r);
}
Point reflect(Segment s, Point p) { return (p + (project(s, p) - p) * 2.0); }
bool isOrthogonal(Vector a, Vector b) { return (equals(dot(a, b), 0.0)); }
bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return (isOrthogonal(a1 - a2, b1 - b2));
}
bool isOrthogonal(Segment s1, Segment s2) {
return (equals(dot(s1.p2 - s2.p1, s2.p2 - s2.p1), 0.0));
}
bool isParallel(Vector a, Vector b) { return (equals(cross(a, b), 0.0)); }
bool isParallel(Point a1, Point a2, Point b1, Point b2) {
return (isParallel(a1 - a2, b1 - b2));
}
bool isParallel(Segment s1, Segment s2) {
return (equals(cross(s1.p1 - s1.p1, s2.p2 - s2.p1), 0.0));
}
int ccw(Point p0, Point p1, Point p2) {
Vector a = p1 - p0;
Vector b = p2 - p0;
if (cross(a, b) > eps) {
return (COUNTER_CLOCKWISE);
}
if (cross(a, b) < -eps) {
return (CLOCKWISE);
}
if (dot(a, b) < -eps) {
return (ONLINE_BACK);
}
if (a.norm() < b.norm()) {
return (ONLINE_FRONT);
}
return (ON_SEGMENT);
}
bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
bool intersect(Segment s1, Segment s2) {
return (intersect(s1.p1, s1.p2, s2.p1, s2.p2));
}
double getDistance(Point a, Point b) { return ((a - b).abs()); }
double getDistanceLP(Line l, Point p) {
return (abs((cross(l.p2 - l.p1, p - l.p1) / (l.p2 - l.p1).abs())));
}
double getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0) {
return ((p - s.p1).abs());
}
if (dot(s.p1 - s.p2, p - s.p2) < 0.0) {
return ((p - s.p2).abs());
}
return (getDistanceLP(s, p));
}
double getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2)) {
return (0.0);
}
return (min(min(getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2)),
min(getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2))));
}
Point getCrossPoint(Segment s1, Segment s2) {
Vector base = s2.p2 - s2.p1;
double d1 = abs(cross(base, s1.p1 - s2.p1));
double d2 = abs(cross(base, s1.p2 - s2.p1));
double t = d1 / (d1 + d2);
return (s1.p1 + (s1.p2 - s1.p1) * t);
}
double arg(Vector p) { return (atan2(p.y, p.x)); }
Vector polar(double a, double r) { return (Point(cos(r) * a, sin(r) * a)); }
pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs();
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return (make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a)));
}
pair<Point, Point> getCrossPoints(Circle c, Line l) {
Vector pr = project(l, c.c);
Vector e = (l.p2 - l.p1) / (l.p2 - l.p1).abs();
double base = sqrt(c.r * c.r - (pr - c.c).norm());
return (make_pair(pr - e * base, pr + e * base));
}
bool inc(Point p1, Point p2, Point p3, Point p4) {
Point e0 = p1 - p4;
Point e1 = p2 - p4;
Point e2 = p3 - p4;
long double d0 = cross(e0, e1);
long double d1 = cross(e1, e2);
long double d2 = cross(e2, e0);
if (d0 * d1 > 0 && d1 * d2 > 0 && d2 * d0 > 0) {
return (true);
}
return (false);
}
void solve() {
cin.tie(0);
ios::sync_with_stdio(false);
Point p1;
while (cin >> p1.x >> p1.y, p1.x || p1.y) {
Point p2, p3, p4;
int r;
cin >> p2.x >> p2.y >> p3.x >> p3.y >> p4.x >> p4.y >> r;
if (r - getDistance(p4, p1) >= 0 && r - getDistance(p4, p2) >= 0 &&
r - getDistance(p4, p3) >= 0) {
cout << "b" << endl;
} else if (inc(p1, p2, p3, p4) &&
getDistanceSP(Segment(p1, p2), p4) - r >= 0 &&
getDistanceSP(Segment(p1, p3), p4) - r >= 0 &&
getDistanceSP(Segment(p2, p3), p4) - r >= 0) {
cout << "a" << endl;
} else if (inc(p1, p2, p3, p4) == false &&
getDistanceSP(Segment(p1, p2), p4) - r > 0 &&
getDistanceSP(Segment(p1, p3), p4) - r > 0 &&
getDistanceSP(Segment(p2, p3), p4) - r > 0) {
cout << "d" << endl;
} else {
cout << "c" << endl;
}
}
}
int main() {
solve();
return (0);
}
|
[["-", 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;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
typedef complex<double> P;
typedef long long ll;
const int MAX_SIZE = 10000;
// àÏ
double dot(P a, P b) { return (a.real() * b.real() + a.imag() * b.imag()); }
// OÏ
double cross(P a, P b) { return (a.real() * b.imag() - a.imag() * b.real()); }
// _cª¼üabãÉ é©È¢©
int is_point_on_line(P a, P b, P c) { return EQ(cross(b - a, c - a), 0.0); }
// 2¼ü̼s»è
int is_orthogonal(P a1, P a2, P b1, P b2) {
return EQ(dot(a1 - a2, b1 - b2), 0.0);
}
// 2¼ü̽s»è
int is_parallel(P a1, P a2, P b1, P b2) {
return EQ(cross(a1 - a2, b1 - b2), 0.0);
}
// _a,bðÊé¼üÆ_cÌÔÌ£
double distance_l_p(P a, P b, P c) {
return abs(cross(b - a, c - a)) / abs(b - a);
}
// _a,bð[_Æ·éüªÆ_cÆÌ£
double distance_ls_p(P a, P b, P c) {
if (dot(b - a, c - a) < EPS)
return abs(c - a);
if (dot(a - b, c - b) < EPS)
return abs(c - b);
return abs(cross(b - a, c - a)) / abs(b - a);
}
// a1,a2ð[_Æ·éüªÆb1,b2ð[_Æ·éüªÌð·»è
int is_intersected_ls(P a1, P a2, P b1, P b2) {
return (cross(a2 - a1, b1 - a1) * cross(a2 - a1, b2 - a1) < EPS) &&
(cross(b2 - b1, a1 - b1) * cross(b2 - b1, a2 - b1) < EPS);
}
// a1,a2ð[_Æ·éüªÆb1,b2ð[_Æ·éüªÌð_vZ
P intersection_ls(P a1, P a2, P b1, P b2) {
P b = b2 - b1;
double d1 = abs(cross(b, a1 - b1));
double d2 = abs(cross(b, a2 - b1));
double t = d1 / (d1 + d2);
return a1 + (a2 - a1) * t;
}
// a1,a2ðÊé¼üÆb1,b2ðÊé¼üÌð·»è
int is_intersected_l(P a1, P a2, P b1, P b2) {
return !EQ(cross(a1 - a2, b1 - b2), 0.0);
}
// a1,a2ðÊé¼üÆb1,b2ðÊé¼üÌð_vZ
P intersection_l(P a1, P a2, P b1, P b2) {
P a = a2 - a1;
P b = b2 - b1;
return a1 + a * cross(b, b1 - a1) / cross(b, a);
}
/*
~üÆüªÌð·»è
*/
bool isCircleCrossLine(P a, P b, P c, double r) {
double d1 = abs(a - c);
double d2 = abs(b - c);
if (d1 < r && d2 < r) {
return false;
}
double d = distance_ls_p(a, b, c);
if (EQ(d, r) || d < r) {
return true;
} else
return false;
}
// Op`ÌàÉ_ª é©Ç¤©
// OÏ̳ª·×į¶ÈçàÉ_ è
bool isInTriangle(P p1, P p2, P p3, P s) {
P a = p1 - s;
P b = p2 - s;
P c = p3 - s;
return ((((cross(a, b) > 0)) && (cross(b, c) > 0)) && (cross(c, a) > 0)) ||
(cross(a, b) < 0 && cross(b, c) < 0 && cross(c, a) < 0);
}
struct Circle {
double x, y, r;
};
struct Triangle {
complex<double> p[3];
};
int main() {
Circle c;
Triangle t;
while (1) {
bool f = false;
for (int i = 0; i < 3; i++) {
double x, y;
cin >> x >> y;
if (x == 0 && y == 0) {
f = true;
break;
}
t.p[i] = complex<double>(x, y);
}
if (f)
break;
cin >> c.x >> c.y >> c.r;
// vZ
// Op`ð\¬·éR_ªÆàÉ~ÌàÉ éÈçÎAOp`Í~ÉÜÜêé
if (((t.p[0].real() - c.x) * (t.p[0].real() - c.x) +
(t.p[0].imag() - c.y) * (t.p[0].imag() - c.y) <
c.r * c.r ||
EQ((t.p[0].real() - c.x) * (t.p[0].real() - c.x) +
(t.p[0].imag() - c.y) * (t.p[0].imag() - c.y),
c.r * c.r)) &&
((t.p[1].real() - c.x) * (t.p[1].real() - c.x) +
(t.p[1].imag() - c.y) * (t.p[1].imag() - c.y) <
c.r * c.r ||
EQ((t.p[1].real() - c.x) * (t.p[1].real() - c.x) +
(t.p[1].imag() - c.y) * (t.p[1].imag() - c.y),
c.r * c.r)) &&
((t.p[2].real() - c.x) * (t.p[2].real() - c.x) +
(t.p[2].imag() - c.y) * (t.p[2].imag() - c.y) <
c.r * c.r ||
EQ((t.p[2].real() - c.x) * (t.p[2].real() - c.x) +
(t.p[2].imag() - c.y) * (t.p[2].imag() - c.y),
c.r * c.r))) {
cout << "b" << endl;
}
// 3üªÆ~ÌSÌ£ªÇêàrÈãÅ èA©Â~Ì_ªOp`ÌàɶݷéÈçÎA~ÍOp`ÉÜÜêé
else if ((distance_ls_p(t.p[0], t.p[1], P(c.x, c.y)) > c.r ||
EQ(distance_ls_p(t.p[0], t.p[1], P(c.x, c.y)), c.r)) &&
(distance_ls_p(t.p[1], t.p[2], P(c.x, c.y)) > c.r ||
EQ(distance_ls_p(t.p[1], t.p[2], P(c.x, c.y)), c.r)) &&
(distance_ls_p(t.p[2], t.p[0], P(c.x, c.y)) > c.r ||
EQ(distance_ls_p(t.p[2], t.p[0], P(c.x, c.y)), c.r)) &&
isInTriangle(t.p[0], t.p[1], t.p[2], P(c.x, c.y))) {
cout << "a" << endl;
}
// OüªÆ~ÌSÌ£ªÇêàræ訨«A©ÂO_Æ~ÌSÌ£ªræèå«A©Â~Ì_ªOp`ÌàɶݵȢê
// ¤Êªðà½È¢
else if ((distance_ls_p(t.p[0], t.p[1], P(c.x, c.y)) > c.r ||
EQ(distance_ls_p(t.p[0], t.p[1], P(c.x, c.y)), c.r)) &&
(distance_ls_p(t.p[1], t.p[2], P(c.x, c.y)) > c.r ||
EQ(distance_ls_p(t.p[1], t.p[2], P(c.x, c.y)), c.r)) &&
(distance_ls_p(t.p[2], t.p[0], P(c.x, c.y)) > c.r ||
EQ(distance_ls_p(t.p[2], t.p[0], P(c.x, c.y)), c.r)) &&
(!isInTriangle(t.p[0], t.p[1], t.p[2], P(c.x, c.y)))) {
cout << "d" << endl;
}
// ~ªOp`ÉÜÜê¸A©ÂO_ÆàÉ~ÌOÉ éÈçÎAOp`Æ~̤ʪÍÈ¢
// else
// if((t.p[0].real()-c.x)*(t.p[0].real()-c.x)+(t.p[0].imag()-c.y)*(t.p[0].imag()-c.y)>c.r*c.r
// &&(t.p[1].real()-c.x)*(t.p[1].real()-c.x)+(t.p[1].imag()-c.y)*(t.p[1].imag()-c.y)>c.r*c.r
// &&(t.p[2].real()-c.x)*(t.p[2].real()-c.x)+(t.p[2].imag()-c.y)*(t.p[2].imag()-c.y)>c.r*c.r){
// cout<<"d"<<endl;
//}
else {
cout << "c" << endl;
}
}
return 0;
}
|
#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;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
typedef complex<double> P;
typedef long long ll;
const int MAX_SIZE = 10000;
// àÏ
double dot(P a, P b) { return (a.real() * b.real() + a.imag() * b.imag()); }
// OÏ
double cross(P a, P b) { return (a.real() * b.imag() - a.imag() * b.real()); }
// _cª¼üabãÉ é©È¢©
int is_point_on_line(P a, P b, P c) { return EQ(cross(b - a, c - a), 0.0); }
// 2¼ü̼s»è
int is_orthogonal(P a1, P a2, P b1, P b2) {
return EQ(dot(a1 - a2, b1 - b2), 0.0);
}
// 2¼ü̽s»è
int is_parallel(P a1, P a2, P b1, P b2) {
return EQ(cross(a1 - a2, b1 - b2), 0.0);
}
// _a,bðÊé¼üÆ_cÌÔÌ£
double distance_l_p(P a, P b, P c) {
return abs(cross(b - a, c - a)) / abs(b - a);
}
// _a,bð[_Æ·éüªÆ_cÆÌ£
double distance_ls_p(P a, P b, P c) {
if (dot(b - a, c - a) < EPS)
return abs(c - a);
if (dot(a - b, c - b) < EPS)
return abs(c - b);
return abs(cross(b - a, c - a)) / abs(b - a);
}
// a1,a2ð[_Æ·éüªÆb1,b2ð[_Æ·éüªÌð·»è
int is_intersected_ls(P a1, P a2, P b1, P b2) {
return (cross(a2 - a1, b1 - a1) * cross(a2 - a1, b2 - a1) < EPS) &&
(cross(b2 - b1, a1 - b1) * cross(b2 - b1, a2 - b1) < EPS);
}
// a1,a2ð[_Æ·éüªÆb1,b2ð[_Æ·éüªÌð_vZ
P intersection_ls(P a1, P a2, P b1, P b2) {
P b = b2 - b1;
double d1 = abs(cross(b, a1 - b1));
double d2 = abs(cross(b, a2 - b1));
double t = d1 / (d1 + d2);
return a1 + (a2 - a1) * t;
}
// a1,a2ðÊé¼üÆb1,b2ðÊé¼üÌð·»è
int is_intersected_l(P a1, P a2, P b1, P b2) {
return !EQ(cross(a1 - a2, b1 - b2), 0.0);
}
// a1,a2ðÊé¼üÆb1,b2ðÊé¼üÌð_vZ
P intersection_l(P a1, P a2, P b1, P b2) {
P a = a2 - a1;
P b = b2 - b1;
return a1 + a * cross(b, b1 - a1) / cross(b, a);
}
/*
~üÆüªÌð·»è
*/
bool isCircleCrossLine(P a, P b, P c, double r) {
double d1 = abs(a - c);
double d2 = abs(b - c);
if (d1 < r && d2 < r) {
return false;
}
double d = distance_ls_p(a, b, c);
if (EQ(d, r) || d < r) {
return true;
} else
return false;
}
// Op`ÌàÉ_ª é©Ç¤©
// OÏ̳ª·×į¶ÈçàÉ_ è
bool isInTriangle(P p1, P p2, P p3, P s) {
P a = p1 - s;
P b = p2 - s;
P c = p3 - s;
return ((((cross(a, b) > 0)) && (cross(b, c) > 0)) && (cross(c, a) > 0)) ||
(cross(a, b) < 0 && cross(b, c) < 0 && cross(c, a) < 0);
}
struct Circle {
double x, y, r;
};
struct Triangle {
complex<double> p[3];
};
int main() {
Circle c;
Triangle t;
while (1) {
bool f = false;
for (int i = 0; i < 3; i++) {
double x, y;
cin >> x >> y;
if (x == 0 && y == 0) {
f = true;
break;
}
t.p[i] = complex<double>(x, y);
}
if (f)
break;
cin >> c.x >> c.y >> c.r;
// vZ
// Op`ð\¬·éR_ªÆàÉ~ÌàÉ éÈçÎAOp`Í~ÉÜÜêé
if (((t.p[0].real() - c.x) * (t.p[0].real() - c.x) +
(t.p[0].imag() - c.y) * (t.p[0].imag() - c.y) <
c.r * c.r ||
EQ((t.p[0].real() - c.x) * (t.p[0].real() - c.x) +
(t.p[0].imag() - c.y) * (t.p[0].imag() - c.y),
c.r * c.r)) &&
((t.p[1].real() - c.x) * (t.p[1].real() - c.x) +
(t.p[1].imag() - c.y) * (t.p[1].imag() - c.y) <
c.r * c.r ||
EQ((t.p[1].real() - c.x) * (t.p[1].real() - c.x) +
(t.p[1].imag() - c.y) * (t.p[1].imag() - c.y),
c.r * c.r)) &&
((t.p[2].real() - c.x) * (t.p[2].real() - c.x) +
(t.p[2].imag() - c.y) * (t.p[2].imag() - c.y) <
c.r * c.r ||
EQ((t.p[2].real() - c.x) * (t.p[2].real() - c.x) +
(t.p[2].imag() - c.y) * (t.p[2].imag() - c.y),
c.r * c.r))) {
cout << "b" << endl;
}
// 3üªÆ~ÌSÌ£ªÇêàrÈãÅ èA©Â~Ì_ªOp`ÌàɶݷéÈçÎA~ÍOp`ÉÜÜêé
else if ((distance_ls_p(t.p[0], t.p[1], P(c.x, c.y)) > c.r ||
EQ(distance_ls_p(t.p[0], t.p[1], P(c.x, c.y)), c.r)) &&
(distance_ls_p(t.p[1], t.p[2], P(c.x, c.y)) > c.r ||
EQ(distance_ls_p(t.p[1], t.p[2], P(c.x, c.y)), c.r)) &&
(distance_ls_p(t.p[2], t.p[0], P(c.x, c.y)) > c.r ||
EQ(distance_ls_p(t.p[2], t.p[0], P(c.x, c.y)), c.r)) &&
isInTriangle(t.p[0], t.p[1], t.p[2], P(c.x, c.y))) {
cout << "a" << endl;
}
// OüªÆ~ÌSÌ£ªÇêàræ訨«A©ÂO_Æ~ÌSÌ£ªræèå«A©Â~Ì_ªOp`ÌàɶݵȢê
// ¤Êªðà½È¢
else if ((distance_ls_p(t.p[0], t.p[1], P(c.x, c.y)) > c.r &&
!EQ(distance_ls_p(t.p[0], t.p[1], P(c.x, c.y)), c.r)) &&
(distance_ls_p(t.p[1], t.p[2], P(c.x, c.y)) > c.r &&
!EQ(distance_ls_p(t.p[1], t.p[2], P(c.x, c.y)), c.r)) &&
(distance_ls_p(t.p[2], t.p[0], P(c.x, c.y)) > c.r &&
!EQ(distance_ls_p(t.p[2], t.p[0], P(c.x, c.y)), c.r)) &&
(!isInTriangle(t.p[0], t.p[1], t.p[2], P(c.x, c.y)))) {
cout << "d" << endl;
}
// ~ªOp`ÉÜÜê¸A©ÂO_ÆàÉ~ÌOÉ éÈçÎAOp`Æ~̤ʪÍÈ¢
// else
// if((t.p[0].real()-c.x)*(t.p[0].real()-c.x)+(t.p[0].imag()-c.y)*(t.p[0].imag()-c.y)>c.r*c.r
// &&(t.p[1].real()-c.x)*(t.p[1].real()-c.x)+(t.p[1].imag()-c.y)*(t.p[1].imag()-c.y)>c.r*c.r
// &&(t.p[2].real()-c.x)*(t.p[2].real()-c.x)+(t.p[2].imag()-c.y)*(t.p[2].imag()-c.y)>c.r*c.r){
// cout<<"d"<<endl;
//}
else {
cout << "c" << endl;
}
}
return 0;
}
|
[["-", 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, 106], ["+", 51, 16, 31, 16, 12, 23, 0, 16, 17, 98]]
| 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 <vector>
using namespace std;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<string> vstring;
typedef vector<pint> vpint;
typedef stringstream SS;
template <class T> void chmin(T &t, T f) {
if (t > f)
t = f;
}
template <class T> void chmax(T &t, T f) {
if (t < f)
t = f;
}
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repn(i, m, n) for (int i = (m); i < (n); ++i)
#define repd(i, n) for (int i = (n)-1; i >= 0; --i)
#define repnd(i, m, n) for (int i = (n)-1; i >= (m); --i)
#define rep0(i, n) for (i = 0; i < (n); ++i)
#define repn0(i, m, n) for (i = (m); i < (n); ++i)
#define repd0(i, n) for (i = (n)-1; i >= 0; --i)
#define repnd0(i, m, n) for (i = (n)-1; i >= (m); --i)
#define repc(i, n) for (int i = 0; i <= (n); ++i)
#define repcn(i, m, n) for (int i = (m); i <= (n); ++i)
#define repcd(i, n) for (int i = (n); i >= 0; --i)
#define repcnd(i, m, n) for (int i = (n); i >= (m); --i)
#define repc0(i, n) for (i = 0; i <= (n); ++i)
#define repcn0(i, m, n) for (i = (m); i <= (n); ++i)
#define repcd0(i, n) for (i = (n); i >= 0; --i)
#define repcnd0(i, m, n) for (i = (n); i >= (m); --i)
#define all(n) n.begin(), n.end()
#define sz(n) ((int)(n).size())
#define IL for (;;)
#define MP make_pair
#define PB push_back
#define X second
#define Y first
#define p_queue(n) priority_queue<n, vector<n>, greater<n>>
#define PUTLINE cout << "LINE:" << __LINE__ << endl;
const int INF = 2147483647 / 3;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1, 0};
const int dy[] = {0, 0, 1, -1, 1, -1, 1, -1, 0};
int sig(double r) { return r < -EPS ? -1 : r > EPS ? 1 : 0; }
struct P {
double x, y;
P() {}
P(double x, double y) : x(x), y(y) {}
P operator+(const P &a) const { return P(x + a.x, y + a.y); }
P operator-(const P &a) const { return P(x - a.x, y - a.y); }
P operator*(const P &a) const {
return P(x * a.x - y * a.y, x * a.y + y * a.x);
}
P operator-() const { return P(-x, -y); }
P operator*(const double &k) const { return P(x * k, y * k); }
P operator/(const double &k) const { return P(x / k, y / k); }
double abs2() const { return x * x + y * y; }
double abs() const { return sqrt(abs2()); }
double arg() const { return atan2(y, x); }
double dot(const P &a) const { return x * a.x + y * a.y; }
double det(const P &a) const { return x * a.y - y * a.x; }
P proj(const P &a) const {
double k = dot(a) / abs2();
return P(x * k, y * k);
}
bool operator<(const P &a) const { return x != a.x ? x < a.x : y < a.y; }
bool operator==(const P &a) const {
return sig(x - a.x) == 0 && sig(y - a.y) == 0;
}
};
ostream &operator<<(ostream &os, const P &a) {
os << "(" << a.x << ", " << a.y << ")";
return os;
}
double tri(P a, P b, P c) { return (b - a).det(c - a); }
struct L {
P a, b;
L() {}
L(P a, P b) : a(a), b(b) {}
P vec() const { return b - a; }
P proj(const P &p) const { return a + vec().proj(p - a); }
P refl(const P &p) const { return proj(p) * 2 - p; }
int iSP(const P &p) const {
int s = sig(vec().det(p - a));
if (s != 0)
return s;
if (sig(vec().dot(p - a)) < 0)
return -2;
if (sig(vec().dot(p - b)) < 0)
return 2;
return 0;
}
int iLL(const L &l) const {
if (sig(vec().det(l.vec())))
return 1;
if (sig(vec().det(l.a - a)))
return 0;
return -1;
}
bool iLS(const L &l) const {
return sig(tri(a, b, l.a)) * sig(tri(a, b, l.b)) <= 0;
}
bool iSS(const L &l) const { return iLS(l) && l.iLS(*this); }
P pLL(const L &l) const {
return a + vec() * (l.a - a).det(l.vec()) / b.det(l.vec());
}
double dLP(const P &p) const { return abs(tri(a, b, p)) / vec().abs(); }
double dSP(const P &p) const {
if (sig(vec().dot(p - a)) <= 0)
return (p - a).abs();
if (sig(vec().dot(p - b)) >= 0)
return (p - b).abs();
return dLP(p);
}
double dLL(const L &l) const { return iLL(l) ? 0 : dLP(l.a); }
double dLS(const L &l) const { return iLS(l) ? 0 : min(dLP(l.a), dLP(l.b)); }
double dSS(const L &l) const {
return iSS(l) ? 0 : min(min(dSP(l.a), dSP(l.b)), min(l.dSP(a), l.dSP(b)));
}
};
struct C {
P p;
double r;
C() {}
C(P p, double r) : p(p), r(r) {}
int iCC(C c) {
double d = (c.p - p).abs();
if (sig(d) == 0 && sig(r - c.r) == 0)
return -1;
if (sig(r - c.r - d) > 0)
return 2;
if (sig(c.r - r - d) > 0)
return -2;
return (sig(r + c.r - d) >= 0) ? 1 : 0;
}
bool iCS(L l) {
return (sig(r - l.dSP(p)) >= 0 &&
sig(r - max((l.a - p).abs(), (l.b - p).abs())) <= 0);
}
pair<P, P> pCC(C c) {
double d = (c.p - p).abs();
double x = (d * d + r * r - c.r * c.r) / (d * 2);
P e = (c.p - p) / d, w = e * P(0, 1) * sqrt(max(r * r - x * x, 0.0));
return make_pair(p + e * x - w, p + e * x + w);
}
pair<P, P> pCL(L l) {
P h = l.proj(p);
double d = (h - p).abs();
double y = sqrt(max(r * r - d * d, 0.0));
P e = (l.b - l.a) / (l.b - l.a).abs();
return make_pair(h - e * y, h + e * y);
}
pair<P, P> tCP(P p) {
double d2 = (p - this->p).abs2();
double x = sqrt(max(d2 - r * r, 0.0));
P h = this->p + (p - this->p) * (r * r / d2);
P w = (p - this->p) * P(0, 1) * (x * r / d2);
return make_pair(h - w, h + w);
}
double aCC(C c) {
double d = (p - c.p).abs();
if (sig(r - c.r - d) >= 0)
return c.r * c.r * PI;
if (sig(c.r - r - d) >= 0)
return r * r * PI;
if (sig(r + c.r - d) <= 0)
return 0;
double x = (d * d + r * r - c.r * c.r) / (d * 2);
double h = sqrt(r * r - x * x);
return r * r * atan2(h, x) + c.r * c.r * atan2(h, d - x) - d * h;
}
};
int main() {
int x[3], y[3];
int xx, yy, r;
P p[3], g;
L s[3];
C c;
IL {
cin >> x[0] >> y[0];
if (x[0] == 0 && y[0] == 0)
break;
cin >> x[1] >> y[1];
cin >> x[2] >> y[2];
cin >> xx >> yy;
cin >> r;
rep(i, 3) p[i] = P(x[i], y[i]);
g = (p[0] + p[1] + p[2]) / 3;
rep(i, 3) s[i] = L(p[i], p[(i + 1) % 3]);
c = C(P(xx, yy), r);
if (!(L(g, c.p)).iSS(s[0]) && !(L(g, c.p)).iSS(s[1]) &&
!(L(g, c.p)).iSS(s[2]) && sig(s[0].dSP(c.p) - c.r) > 0 &&
sig(s[1].dSP(c.p) - c.r) > 0 && sig(s[2].dSP(c.p) - c.r) > 0) {
cout << "a" << endl;
continue;
}
if (sig((c.p - p[0]).abs() - r) < 0 && sig((c.p - p[1]).abs() - r) < 0 &&
sig((c.p - p[2]).abs() - r) < 0) {
cout << "b" << endl;
continue;
}
if (sig(s[0].dSP(c.p) - c.r) <= 0 || sig(s[1].dSP(c.p) - c.r) <= 0 ||
sig(s[2].dSP(c.p) - c.r) <= 0) {
cout << "c" << endl;
continue;
}
cout << "d" << endl;
}
return 0;
}
|
#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 <vector>
using namespace std;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<string> vstring;
typedef vector<pint> vpint;
typedef stringstream SS;
template <class T> void chmin(T &t, T f) {
if (t > f)
t = f;
}
template <class T> void chmax(T &t, T f) {
if (t < f)
t = f;
}
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repn(i, m, n) for (int i = (m); i < (n); ++i)
#define repd(i, n) for (int i = (n)-1; i >= 0; --i)
#define repnd(i, m, n) for (int i = (n)-1; i >= (m); --i)
#define rep0(i, n) for (i = 0; i < (n); ++i)
#define repn0(i, m, n) for (i = (m); i < (n); ++i)
#define repd0(i, n) for (i = (n)-1; i >= 0; --i)
#define repnd0(i, m, n) for (i = (n)-1; i >= (m); --i)
#define repc(i, n) for (int i = 0; i <= (n); ++i)
#define repcn(i, m, n) for (int i = (m); i <= (n); ++i)
#define repcd(i, n) for (int i = (n); i >= 0; --i)
#define repcnd(i, m, n) for (int i = (n); i >= (m); --i)
#define repc0(i, n) for (i = 0; i <= (n); ++i)
#define repcn0(i, m, n) for (i = (m); i <= (n); ++i)
#define repcd0(i, n) for (i = (n); i >= 0; --i)
#define repcnd0(i, m, n) for (i = (n); i >= (m); --i)
#define all(n) n.begin(), n.end()
#define sz(n) ((int)(n).size())
#define IL for (;;)
#define MP make_pair
#define PB push_back
#define X second
#define Y first
#define p_queue(n) priority_queue<n, vector<n>, greater<n>>
#define PUTLINE cout << "LINE:" << __LINE__ << endl;
const int INF = 2147483647 / 3;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1, 0};
const int dy[] = {0, 0, 1, -1, 1, -1, 1, -1, 0};
int sig(double r) { return r < -EPS ? -1 : r > EPS ? 1 : 0; }
struct P {
double x, y;
P() {}
P(double x, double y) : x(x), y(y) {}
P operator+(const P &a) const { return P(x + a.x, y + a.y); }
P operator-(const P &a) const { return P(x - a.x, y - a.y); }
P operator*(const P &a) const {
return P(x * a.x - y * a.y, x * a.y + y * a.x);
}
P operator-() const { return P(-x, -y); }
P operator*(const double &k) const { return P(x * k, y * k); }
P operator/(const double &k) const { return P(x / k, y / k); }
double abs2() const { return x * x + y * y; }
double abs() const { return sqrt(abs2()); }
double arg() const { return atan2(y, x); }
double dot(const P &a) const { return x * a.x + y * a.y; }
double det(const P &a) const { return x * a.y - y * a.x; }
P proj(const P &a) const {
double k = dot(a) / abs2();
return P(x * k, y * k);
}
bool operator<(const P &a) const { return x != a.x ? x < a.x : y < a.y; }
bool operator==(const P &a) const {
return sig(x - a.x) == 0 && sig(y - a.y) == 0;
}
};
ostream &operator<<(ostream &os, const P &a) {
os << "(" << a.x << ", " << a.y << ")";
return os;
}
double tri(P a, P b, P c) { return (b - a).det(c - a); }
struct L {
P a, b;
L() {}
L(P a, P b) : a(a), b(b) {}
P vec() const { return b - a; }
P proj(const P &p) const { return a + vec().proj(p - a); }
P refl(const P &p) const { return proj(p) * 2 - p; }
int iSP(const P &p) const {
int s = sig(vec().det(p - a));
if (s != 0)
return s;
if (sig(vec().dot(p - a)) < 0)
return -2;
if (sig(vec().dot(p - b)) < 0)
return 2;
return 0;
}
int iLL(const L &l) const {
if (sig(vec().det(l.vec())))
return 1;
if (sig(vec().det(l.a - a)))
return 0;
return -1;
}
bool iLS(const L &l) const {
return sig(tri(a, b, l.a)) * sig(tri(a, b, l.b)) <= 0;
}
bool iSS(const L &l) const { return iLS(l) && l.iLS(*this); }
P pLL(const L &l) const {
return a + vec() * (l.a - a).det(l.vec()) / b.det(l.vec());
}
double dLP(const P &p) const { return abs(tri(a, b, p)) / vec().abs(); }
double dSP(const P &p) const {
if (sig(vec().dot(p - a)) <= 0)
return (p - a).abs();
if (sig(vec().dot(p - b)) >= 0)
return (p - b).abs();
return dLP(p);
}
double dLL(const L &l) const { return iLL(l) ? 0 : dLP(l.a); }
double dLS(const L &l) const { return iLS(l) ? 0 : min(dLP(l.a), dLP(l.b)); }
double dSS(const L &l) const {
return iSS(l) ? 0 : min(min(dSP(l.a), dSP(l.b)), min(l.dSP(a), l.dSP(b)));
}
};
struct C {
P p;
double r;
C() {}
C(P p, double r) : p(p), r(r) {}
int iCC(C c) {
double d = (c.p - p).abs();
if (sig(d) == 0 && sig(r - c.r) == 0)
return -1;
if (sig(r - c.r - d) > 0)
return 2;
if (sig(c.r - r - d) > 0)
return -2;
return (sig(r + c.r - d) >= 0) ? 1 : 0;
}
bool iCS(L l) {
return (sig(r - l.dSP(p)) >= 0 &&
sig(r - max((l.a - p).abs(), (l.b - p).abs())) <= 0);
}
pair<P, P> pCC(C c) {
double d = (c.p - p).abs();
double x = (d * d + r * r - c.r * c.r) / (d * 2);
P e = (c.p - p) / d, w = e * P(0, 1) * sqrt(max(r * r - x * x, 0.0));
return make_pair(p + e * x - w, p + e * x + w);
}
pair<P, P> pCL(L l) {
P h = l.proj(p);
double d = (h - p).abs();
double y = sqrt(max(r * r - d * d, 0.0));
P e = (l.b - l.a) / (l.b - l.a).abs();
return make_pair(h - e * y, h + e * y);
}
pair<P, P> tCP(P p) {
double d2 = (p - this->p).abs2();
double x = sqrt(max(d2 - r * r, 0.0));
P h = this->p + (p - this->p) * (r * r / d2);
P w = (p - this->p) * P(0, 1) * (x * r / d2);
return make_pair(h - w, h + w);
}
double aCC(C c) {
double d = (p - c.p).abs();
if (sig(r - c.r - d) >= 0)
return c.r * c.r * PI;
if (sig(c.r - r - d) >= 0)
return r * r * PI;
if (sig(r + c.r - d) <= 0)
return 0;
double x = (d * d + r * r - c.r * c.r) / (d * 2);
double h = sqrt(r * r - x * x);
return r * r * atan2(h, x) + c.r * c.r * atan2(h, d - x) - d * h;
}
};
int main() {
int x[3], y[3];
int xx, yy, r;
P p[3], g;
L s[3];
C c;
IL {
cin >> x[0] >> y[0];
if (x[0] == 0 && y[0] == 0)
break;
cin >> x[1] >> y[1];
cin >> x[2] >> y[2];
cin >> xx >> yy;
cin >> r;
rep(i, 3) p[i] = P(x[i], y[i]);
g = (p[0] + p[1] + p[2]) / 3;
rep(i, 3) s[i] = L(p[i], p[(i + 1) % 3]);
c = C(P(xx, yy), r);
if (!(L(g, c.p)).iSS(s[0]) && !(L(g, c.p)).iSS(s[1]) &&
!(L(g, c.p)).iSS(s[2]) && sig(s[0].dSP(c.p) - c.r) >= 0 &&
sig(s[1].dSP(c.p) - c.r) >= 0 && sig(s[2].dSP(c.p) - c.r) >= 0) {
cout << "a" << endl;
continue;
}
if (sig((c.p - p[0]).abs() - r) <= 0 && sig((c.p - p[1]).abs() - r) <= 0 &&
sig((c.p - p[2]).abs() - r) <= 0) {
cout << "b" << endl;
continue;
}
if (sig(s[0].dSP(c.p) - c.r) <= 0 || sig(s[1].dSP(c.p) - c.r) <= 0 ||
sig(s[2].dSP(c.p) - c.r) <= 0) {
cout << "c" << endl;
continue;
}
cout << "d" << endl;
}
return 0;
}
|
[["-", 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, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 19], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19]]
| 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:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(x * a, y * a); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
};
class Segment {
public:
Point p1, p2;
Segment(Point p1 = Point(0.0, 0.0), Point p2 = Point(0.0, 0.0))
: p1(p1), p2(p2) {}
double abs() { return sqrt(norm()); }
double norm() {
return (p2.x - p1.x) * (p2.x - p1.x) + (p2.y - p1.y) * (p2.y - p1.y);
}
};
typedef Segment Line;
typedef Point Vector;
typedef vector<Point> Polygon;
double norm(Vector a) { return a.x * a.x + a.y * a.y; }
double abs(Vector a) { return sqrt(norm(a)); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
double getDistance(Vector a, Vector b) { return abs(a - b); }
double dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
double cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }
bool isOrthogonal(Vector a, Vector b) { return equals(dot(a, b), 0.0); }
bool isOrthogonal(Segment s1, Segment s2) {
return equals(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool isParallel(Vector a, Vector b) { return equals(cross(a, b), 0.0); }
bool isParallel(Point a1, Point a2, Point b1, Point b2) {
return isParallel(a1 - a2, b1 - b2);
}
bool isParallel(Segment s1, Segment s2) {
return equals(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
Point project(Segment s, Point p) {
Vector base = s.p2 - s.p1;
double t = dot(p - s.p1, base) / norm(base);
return s.p1 + base * t;
}
Point reflect(Segment s, Point p) { return p + (project(s, p) - p) * 2.0; }
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;
// EPS can be 0
// need to check for 920, 833, 866
int ccw(Point p0, Point p1, Point p2) {
Vector a = p1 - p0;
Vector b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (norm(a) < norm(b))
return ONLINE_FRONT;
return ON_SEGMENT;
}
bool isIntersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
bool isIntersect(Segment s1, Segment s2) {
return isIntersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point getCrossPoint(Segment s1, Segment s2) {
assert(isIntersect(s1, s2));
Vector base = s2.p2 - s2.p1;
double d1 = abs(cross(base, s1.p1 - s2.p1));
double d2 = abs(cross(base, s1.p1 - s2.p1));
double t = d1 / (d1 + d2);
return s1.p1 + (s1.p2 - s1.p1) * t;
}
double getDistanceLP(Line s, Point p) {
return abs(cross(s.p2 - s.p1, p - s.p1) / abs(s.p2 - s.p1));
}
double getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return abs(p - s.p1);
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return abs(p - s.p2);
return getDistanceLP(s, p);
}
double getDistance(Segment s1, Segment s2) {
if (isIntersect(s1, s2))
return 0.0;
return min(min(getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2)),
min(getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)));
}
bool isConvex(Point P[4]) {
int c = ccw(P[0], P[1], P[2]);
for (int i = 1; i < 4; i++) {
if (c != ccw(P[i], P[(i + 1) % 4], P[(i + 2) % 4]))
return false;
}
return true;
}
bool isConvex(vector<Point> P) {
int c = ccw(P[0], P[1], P[2]);
for (int i = 1; i < 4; i++) {
if (c != ccw(P[i], P[(i + 1) % 4], P[(i + 2) % 4]))
return false;
}
return true;
}
Polygon andrewScan(Polygon s) {
Polygon u, l;
if (s.size() < 3)
return s;
sort(s.begin(), s.end());
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
// int n;
for (int i = 2; i < (int)s.size(); i++) {
for (int n = u.size(); n >= 2 && ccw(u[n - 2], u[n - 1], s[i]) != CLOCKWISE;
n--) {
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
for (int n = l.size(); n >= 2 && ccw(l[n - 2], l[n - 1], s[i]) != CLOCKWISE;
n--) {
l.pop_back();
}
l.push_back(s[i]);
}
reverse(l.begin(), l.end());
for (int i = u.size() - 2; i >= 1; i--)
l.push_back(u[i]);
return l;
}
double S3(double x1, double y1, double x2, double y2, double x3, double y3) {
double sum = 0;
sum = (x1 * y2 - x2 * y1) + (x2 * y3 - x3 * y2) + (x3 * y1 - x1 * y3);
sum = abs(sum);
sum /= 2;
return sum;
}
bool eq(double x, double y) {
double z = x - y;
if (z < 0.000000001)
return true;
else
return false;
}
int check(Point O, Point A, Point B, Point C) {
double a = S3(A.x, A.y, B.x, B.y, O.x, O.y);
double b = S3(B.x, B.y, C.x, C.y, O.x, O.y);
double c = S3(C.x, C.y, A.x, A.y, O.x, O.y);
double d = S3(A.x, A.y, B.x, B.y, C.x, C.y);
if (eq((a + b + c), d)) {
return 1;
} else {
return -1;
}
}
int main() {
Point a, b, c, o;
double r;
double A, B, C;
while (cin >> a.x >> a.y) {
if (a.x == 0.0 && a.y == 0.0)
break;
cin >> b.x >> b.y >> c.x >> c.y >> o.x >> o.y >> r;
A = getDistance(a, o);
B = getDistance(b, o);
C = getDistance(c, o);
if (A <= r && B <= r && C <= r) {
cout << "b" << endl;
continue;
}
A = getDistanceSP(Segment(a, b), o);
B = getDistanceSP(Segment(b, c), o);
C = getDistanceSP(Segment(c, a), o);
if (A >= r && B >= r && C >= r && check(o, a, b, c) == 1) {
cout << "a" << endl;
continue;
}
if (A >= r && B >= r && C >= r && check(o, a, b, c) == -1) {
cout << "d" << endl;
continue;
}
cout << "c" << endl;
}
return 0;
}
|
#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:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(x * a, y * a); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
};
class Segment {
public:
Point p1, p2;
Segment(Point p1 = Point(0.0, 0.0), Point p2 = Point(0.0, 0.0))
: p1(p1), p2(p2) {}
double abs() { return sqrt(norm()); }
double norm() {
return (p2.x - p1.x) * (p2.x - p1.x) + (p2.y - p1.y) * (p2.y - p1.y);
}
};
typedef Segment Line;
typedef Point Vector;
typedef vector<Point> Polygon;
double norm(Vector a) { return a.x * a.x + a.y * a.y; }
double abs(Vector a) { return sqrt(norm(a)); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
double getDistance(Vector a, Vector b) { return abs(a - b); }
double dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
double cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }
bool isOrthogonal(Vector a, Vector b) { return equals(dot(a, b), 0.0); }
bool isOrthogonal(Segment s1, Segment s2) {
return equals(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool isParallel(Vector a, Vector b) { return equals(cross(a, b), 0.0); }
bool isParallel(Point a1, Point a2, Point b1, Point b2) {
return isParallel(a1 - a2, b1 - b2);
}
bool isParallel(Segment s1, Segment s2) {
return equals(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
Point project(Segment s, Point p) {
Vector base = s.p2 - s.p1;
double t = dot(p - s.p1, base) / norm(base);
return s.p1 + base * t;
}
Point reflect(Segment s, Point p) { return p + (project(s, p) - p) * 2.0; }
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;
// EPS can be 0
// need to check for 920, 833, 866
int ccw(Point p0, Point p1, Point p2) {
Vector a = p1 - p0;
Vector b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (norm(a) < norm(b))
return ONLINE_FRONT;
return ON_SEGMENT;
}
bool isIntersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
bool isIntersect(Segment s1, Segment s2) {
return isIntersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point getCrossPoint(Segment s1, Segment s2) {
assert(isIntersect(s1, s2));
Vector base = s2.p2 - s2.p1;
double d1 = abs(cross(base, s1.p1 - s2.p1));
double d2 = abs(cross(base, s1.p1 - s2.p1));
double t = d1 / (d1 + d2);
return s1.p1 + (s1.p2 - s1.p1) * t;
}
double getDistanceLP(Line s, Point p) {
return abs(cross(s.p2 - s.p1, p - s.p1) / abs(s.p2 - s.p1));
}
double getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return abs(p - s.p1);
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return abs(p - s.p2);
return getDistanceLP(s, p);
}
double getDistance(Segment s1, Segment s2) {
if (isIntersect(s1, s2))
return 0.0;
return min(min(getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2)),
min(getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)));
}
bool isConvex(Point P[4]) {
int c = ccw(P[0], P[1], P[2]);
for (int i = 1; i < 4; i++) {
if (c != ccw(P[i], P[(i + 1) % 4], P[(i + 2) % 4]))
return false;
}
return true;
}
bool isConvex(vector<Point> P) {
int c = ccw(P[0], P[1], P[2]);
for (int i = 1; i < 4; i++) {
if (c != ccw(P[i], P[(i + 1) % 4], P[(i + 2) % 4]))
return false;
}
return true;
}
Polygon andrewScan(Polygon s) {
Polygon u, l;
if (s.size() < 3)
return s;
sort(s.begin(), s.end());
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
// int n;
for (int i = 2; i < (int)s.size(); i++) {
for (int n = u.size(); n >= 2 && ccw(u[n - 2], u[n - 1], s[i]) != CLOCKWISE;
n--) {
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
for (int n = l.size(); n >= 2 && ccw(l[n - 2], l[n - 1], s[i]) != CLOCKWISE;
n--) {
l.pop_back();
}
l.push_back(s[i]);
}
reverse(l.begin(), l.end());
for (int i = u.size() - 2; i >= 1; i--)
l.push_back(u[i]);
return l;
}
double S3(double x1, double y1, double x2, double y2, double x3, double y3) {
double sum = 0;
sum = (x1 * y2 - x2 * y1) + (x2 * y3 - x3 * y2) + (x3 * y1 - x1 * y3);
sum = abs(sum);
sum /= 2;
return sum;
}
bool eq(double x, double y) {
double z = x - y;
if (z < 0.000000001)
return true;
else
return false;
}
int check(Point O, Point A, Point B, Point C) {
double a = S3(A.x, A.y, B.x, B.y, O.x, O.y);
double b = S3(B.x, B.y, C.x, C.y, O.x, O.y);
double c = S3(C.x, C.y, A.x, A.y, O.x, O.y);
double d = S3(A.x, A.y, B.x, B.y, C.x, C.y);
if (eq((a + b + c), d)) {
return 1;
} else {
return -1;
}
}
int main() {
Point a, b, c, o;
double r;
double A, B, C;
while (cin >> a.x >> a.y) {
if (a.x == 0.0 && a.y == 0.0)
break;
cin >> b.x >> b.y >> c.x >> c.y >> o.x >> o.y >> r;
A = getDistance(a, o);
B = getDistance(b, o);
C = getDistance(c, o);
if (A <= r && B <= r && C <= r) {
cout << "b" << endl;
continue;
}
A = getDistanceSP(Segment(a, b), o);
B = getDistanceSP(Segment(b, c), o);
C = getDistanceSP(Segment(c, a), o);
if (A >= r && B >= r && C >= r && check(o, a, b, c) == 1) {
cout << "a" << endl;
continue;
}
if (A > r && B > r && C > r && check(o, a, b, c) == -1) {
cout << "d" << endl;
continue;
}
cout << "c" << endl;
}
return 0;
}
|
[["-", 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] = sc.nextInt();
b[i] = sc.nextInt();
}
int[][] p = new int[m + 1][1001];
p[0][0] = 1;
for (int i = 1; i <= m; i++) {
for (int k = 0; k < 1001; k++) {
for (int s = 0; s <= b[i]; s++) {
if (k - a[i] * s < 0)
break;
p[i][k] += p[i - 1][k - s * a[i]];
}
}
}
int g = sc.nextInt();
while (g-- != 0)
System.out.println(p[m][sc.nextInt()]);
}
}
}
|
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] = sc.nextInt();
b[i] = sc.nextInt();
}
int[][] p = new int[m + 1][1001];
p[0][0] = 1;
for (int i = 1; i <= m; i++) {
for (int k = 0; k < 1001; k++) {
for (int s = 0; s <= b[i]; s++) {
if (k - a[i] * s < 0)
break;
p[i][k] += p[i - 1][k - s * a[i]];
}
}
}
int g = sc.nextInt();
while (g-- != 0)
System.out.println(p[m][sc.nextInt()]);
}
}
}
|
[["-", 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 + 1, b, sum, count + card_value[a] * i);
}
}
}
int main() {
int g;
int m;
while (cin >> m) {
if (m == 0)
break;
for (int i = 0; i < m; i++) {
cin >> card_value[i] >> card_num[i];
}
for (int i = 0; i < 1001; i++) {
sum1[i] = 0;
sum2[i] = 0;
sum3[i] = 0;
}
get_sum(0, m / 2, sum1, 0);
get_sum(m / 2, m, sum2, 0);
for (int i = 0; i < 1001; i++) {
for (int j = 0; j < 1001 - i; j++) {
sum3[i + j] += sum1[i] + sum2[j];
}
}
cin >> g;
for (int i = 0; i < g; i++) {
int q;
cin >> q;
cout << sum3[q] << endl;
}
}
return 0;
}
|
#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 + 1, b, sum, count + card_value[a] * i);
}
}
}
int main() {
int g;
int m;
while (cin >> m) {
if (m == 0)
break;
for (int i = 0; i < m; i++) {
cin >> card_value[i] >> card_num[i];
}
for (int i = 0; i < 1001; i++) {
sum1[i] = 0;
sum2[i] = 0;
sum3[i] = 0;
}
get_sum(0, m / 2, sum1, 0);
get_sum(m / 2, m, sum2, 0);
for (int i = 0; i < 1001; i++) {
for (int j = 0; j < 1001 - i; j++) {
sum3[i + j] += sum1[i] * sum2[j];
}
}
cin >> g;
for (int i = 0; i < g; i++) {
int q;
cin >> q;
cout << sum3[q] << endl;
}
}
return 0;
}
|
[["-", 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][0] = 1;
for (int i = 0; i <= m; i++) {
for (int j = 0; j < 1000; j++) {
for (int k = 0; k <= b[i]; k++) {
if (j - k * a[i] < 1001)
dp[i + 1][j] += dp[i][j - k * a[i]];
}
}
}
cin >> g;
while (g--) {
cin >> n;
cout << dp[m + 1][n] << endl;
}
}
return 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] = 1;
for (int i = 0; i <= m; i++) {
for (int j = 0; j < 1001; j++) {
for (int k = 0; k <= b[i]; k++) {
if (j - k * a[i] >= 0)
dp[i + 1][j] += dp[i][j - k * a[i]];
}
}
}
cin >> g;
while (g--) {
cin >> n;
cout << dp[m + 1][n] << endl;
}
}
return 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, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]]
| 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, i) get<(i)>((t))
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, f, n) for (int i = (int)(f); i < (int)(n); i++)
#define each(a, b) for (auto &a : b)
#define int long long
const int inf = 1 << 25;
const ll INF = 1LL << 55;
struct edge {
int to;
double cost;
edge() {}
edge(int to, double cost) : to(to), cost(cost) {}
};
int n;
vector<vector<edge>> graph;
void dijkstra(int s, int g) {
typedef pair<double, int> Pd;
priority_queue<Pd, vector<Pd>, greater<Pd>> que;
vector<double> mincost(n, inf);
vector<int> prevv(n, -1);
que.push(Pd(0.0, s));
mincost[s] = 0.0;
while (!que.empty()) {
Pd p = que.top();
que.pop();
if (p.S == g)
break;
if (mincost[p.S] < p.F)
continue;
for (edge e : graph[p.S]) {
if (e.cost + p.F < mincost[e.to]) {
mincost[e.to] = e.cost + p.F;
prevv[e.to] = p.S;
que.push(Pd(mincost[e.to], e.to));
}
}
}
if (mincost[g] == INF) {
puts("NA");
return;
}
vector<int> ans;
for (int v = g; v != -1; v = prevv[v]) {
ans.push_back(v + 1);
}
reverse(all(ans));
for (int i = 0; i < ans.size(); i++) {
if (i)
cout << " ";
cout << ans[i];
}
cout << endl;
}
double dist(Pi a, Pi b) {
return sqrt((a.F - b.F) * (a.F - b.F) + (a.S - b.S) * (a.S - b.S));
}
signed main() {
while (cin >> n, n) {
vector<Pi> pos(n);
graph.clear();
graph.resize(n);
for (int i = 0; i < n; i++) {
int b;
cin >> b;
b--;
cin >> pos[b].F >> pos[b].S;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
double d;
if ((d = dist(pos[i], pos[j])) <= 50.0) {
graph[i].push_back(edge(j, d));
}
}
}
int m;
cin >> m;
while (m--) {
int s, g;
cin >> s >> g;
s--, g--;
dijkstra(s, g);
}
}
return 0;
}
|
#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, i) get<(i)>((t))
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, f, n) for (int i = (int)(f); i < (int)(n); i++)
#define each(a, b) for (auto &a : b)
#define int long long
const int inf = 1 << 25;
const ll INF = 1LL << 55;
struct edge {
int to;
double cost;
edge() {}
edge(int to, double cost) : to(to), cost(cost) {}
};
int n;
vector<vector<edge>> graph;
void dijkstra(int s, int g) {
typedef pair<double, int> Pd;
priority_queue<Pd, vector<Pd>, greater<Pd>> que;
vector<double> mincost(n, INF);
vector<int> prevv(n, -1);
que.push(Pd(0.0, s));
mincost[s] = 0.0;
while (!que.empty()) {
Pd p = que.top();
que.pop();
if (p.S == g)
break;
if (mincost[p.S] < p.F)
continue;
for (edge e : graph[p.S]) {
if (e.cost + p.F < mincost[e.to]) {
mincost[e.to] = e.cost + p.F;
prevv[e.to] = p.S;
que.push(Pd(mincost[e.to], e.to));
}
}
}
if (mincost[g] == INF) {
puts("NA");
return;
}
vector<int> ans;
for (int v = g; v != -1; v = prevv[v]) {
ans.push_back(v + 1);
}
reverse(all(ans));
for (int i = 0; i < ans.size(); i++) {
if (i)
cout << " ";
cout << ans[i];
}
cout << endl;
}
double dist(Pi a, Pi b) {
return sqrt((a.F - b.F) * (a.F - b.F) + (a.S - b.S) * (a.S - b.S));
}
signed main() {
while (cin >> n, n) {
vector<Pi> pos(n);
graph.clear();
graph.resize(n);
for (int i = 0; i < n; i++) {
int b;
cin >> b;
b--;
cin >> pos[b].F >> pos[b].S;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
double d;
if ((d = dist(pos[i], pos[j])) <= 50.0) {
graph[i].push_back(edge(j, d));
}
}
}
int m;
cin >> m;
while (m--) {
int s, g;
cin >> s >> g;
s--, g--;
dijkstra(s, g);
}
}
return 0;
}
|
[["-", 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.