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 |
|---|---|---|---|---|---|
import sys
lc=lambda n:int((n**2+n+2)/2)
[print(i) for i in [lc(int(j)) for j in sts.stdin]]
| import sys
lc=lambda n:int((n**2+n+2)/2)
[print(i) for i in [lc(int(j)) for j in sys.stdin]]
| [["-", 0, 659, 12, 658, 0, 659, 12, 319, 500, 22], ["+", 0, 659, 12, 658, 0, 659, 12, 319, 500, 22]] | 5 | 45 | 2 |
while True:
try:
n = int(input())
print((a**2+a+2)/2)
except EOFError: break | while True:
try:
a = int(input())
print((a**2+a+2)/2)
except EOFError: break | [["-", 0, 246, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 246, 8, 196, 0, 1, 0, 662, 31, 22]] | 5 | 31 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line;
while ((line = br.readLine()) != null) {
Stri... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line;
while ((line = br.readLine()) != null) {
Stri... | [["+", 0, 57, 15, 15, 0, 16, 31, 492, 500, 22], ["+", 0, 57, 15, 15, 0, 16, 31, 492, 0, 131], ["+", 0, 57, 15, 15, 0, 16, 31, 492, 141, 22], ["+", 3, 4, 0, 16, 31, 16, 31, 23, 0, 24], ["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 19], ["+", 15, 15, 0, 16, 31, 492, 3, 4, 0, 25], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18]] | 3 | 209 | 7 |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
try {
System.setIn(new FileInputStream("src/aoj0058/input.txt"));
System.setOut(
new PrintStream(new FileOutputStream("src/ao... | import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
try {
System.setIn(new FileInputStream("src/aoj0058/input.txt"));
System.setOut(
new PrintStream(new FileOutputStream("src/ao... | [["+", 0, 503, 49, 200, 51, 16, 31, 492, 141, 22], ["-", 8, 196, 0, 503, 49, 200, 51, 16, 12, 515], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 12, 515]] | 3 | 293 | 3 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
double n, ans;
cin >> n;
ans = n;
for (int i = 2; i <= 10; i++) {
if (i % 2 == 1) {
n = n / 3.0;
ans += n;
} else {
n *= 2.0;
ans += n;
}
}
printf("%.6f\n", ans);
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
double n, ans;
while (cin >> n) {
ans = n;
for (int i = 2; i <= 10; i++) {
if (i % 2 == 1) {
n = n / 3.0;
ans += n;
} else {
n *= 2.0;
ans += n;
}
}
printf("%.6f\n", ans);
}
} | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 84 | 6 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
double n;
while (cin >> n) {
double ans = n;
for (int i = 2; i <= 10; i++) {
if (i % 2 == 0) {
n *= 2;
ans += n;
} else {
n /= 3;
ans += n;
}
}
printf("%.8f", ans);
}
... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
double n;
while (cin >> n) {
double ans = n;
for (int i = 2; i <= 10; i++) {
if (i % 2 == 0) {
n *= 2;
ans += n;
} else {
n /= 3;
ans += n;
}
}
printf("%.8f\n", ans);
}... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 88 | 1 |
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
double a;
double sum;
while (cin >> a) {
sum = 0;
for (int i = 2; i <= 10; i++) {
sum += a;
if (i % 2 == 0) {
a *= 2;
} else {
a /= 3;
}
cout << setprecision(10);
}
cout << sum <... | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double a;
double sum;
while (cin >> a) {
sum = 0;
for (int i = 1; i <= 10; i++) {
sum += a;
if (i % 2 == 0) {
a /= 3;
} else {
a *= 2;
}
cout << setprecision(10);
}
cout << sum <... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 108], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 90], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["-", 75, 76, 0, 9, 0, 1, 0, 11, 17, 90], ["-", 75, 76, 0, 9, 0,... | 1 | 89 | 10 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
long double a, before, sum;
while (cin >> a) {
before = a;
sum = before;
for (int i = 2; i <= 10; i++) {
if (i % 2 == 0)
before *= 2;
else
before /= 3;
sum += before;
}
printf("%.8f\... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
double a, before, sum;
while (cin >> a) {
before = a;
sum = before;
for (int i = 2; i <= 10; i++) {
if (i % 2 == 0)
before *= 2;
else
before /= 3;
sum += before;
}
printf("%.8f\n", s... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 89 | 1 |
while gets
sum = $_.to_f
9.times do |i|
i % 2 == 0 ? a *= 2 : a /= 3
sum += a
end
puts sum
end | while gets
a, sum = $_.to_f
sum = a
9.times do |i|
i % 2 == 0 ? a *= 2 : a /= 3
sum += a
end
puts sum
end | [["+", 0, 89, 8, 170, 0, 662, 31, 761, 0, 22], ["+", 0, 89, 8, 170, 0, 662, 31, 761, 0, 21], ["+", 0, 493, 0, 89, 8, 170, 0, 662, 31, 22], ["+", 0, 493, 0, 89, 8, 170, 0, 662, 0, 32], ["+", 0, 493, 0, 89, 8, 170, 0, 662, 12, 22]] | 4 | 34 | 2 |
while gets
sum = $_.to_f
9.times do |i|
i % 2 == 0 ? a *= 2 : a /= 3
sum += a
end
puts sum
end | while gets
sum = a = $_.to_f
9.times do |i|
i % 2 == 0 ? a *= 2 : a /= 3
sum += a
end
puts sum
end | [["+", 0, 89, 8, 170, 0, 662, 12, 662, 31, 22], ["+", 0, 89, 8, 170, 0, 662, 12, 662, 0, 32]] | 4 | 34 | 2 |
import sys
for e in sys.stdin:
t=[a,
a*2,
a*2/3,
a*2/3*2,
a*2/3*2/3,
a*2/3*2/3*2,
a*2/3*2/3*2/3,
a*2/3*2/3*2/3*2,
a*2/3*2/3*2/3*2/3,
a*2/3*2/3*2/3*2/3*2]
print(sum(t))
| import sys
for e in sys.stdin:
a=float(e)
t=[a,
a*2,
a*2/3,
a*2/3*2,
a*2/3*2/3,
a*2/3*2/3*2,
a*2/3*2/3*2/3,
a*2/3*2/3*2/3*2,
a*2/3*2/3*2/3*2/3,
a*2/3*2/3*2/3*2/3*2]
print(sum(t))
| [["+", 0, 7, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25]] | 5 | 129 | 6 |
import sys
for x in sys.stdin.readlines():
a=float(x.rstrip())
s=[0.0]*10
for i in range(1,10):
if i%2 != 0: s[i]=s[i-1]*2.0
else: s[i]=s[i-1]/3.0
print(sum(s)) | import sys
for x in sys.stdin.readlines():
a=float(x.rstrip())
s=[0.0]*10
s[0]=a
for i in range(1,10):
if i%2 != 0: s[i]=s[i-1]*2.0
else: s[i]=s[i-1]/3.0
print(sum(s)) | [["+", 8, 196, 0, 1, 0, 662, 31, 206, 51, 22], ["+", 8, 196, 0, 1, 0, 662, 31, 206, 0, 70], ["+", 8, 196, 0, 1, 0, 662, 31, 206, 206, 612], ["+", 8, 196, 0, 1, 0, 662, 31, 206, 0, 73], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 12, 22]] | 5 | 82 | 6 |
import java.util.*;
class Main {
Scanner sc = new Scanner(System.in);
public void run() {
HashSet<Integer> primes = new HashSet<Integer>();
for (int i = 2; i < 50000; i++) {
boolean isprime = true;
for (int prime : primes) {
if (i % prime == 0) {
isprime = false;
br... | import java.util.*;
class Main {
Scanner sc = new Scanner(System.in);
public void run() {
LinkedList<Integer> primes = new LinkedList<Integer>();
for (int i = 2; i <= 50000; i++) {
boolean isprime = true;
for (int prime : primes) {
if (i % prime == 0) {
isprime = false;
... | [["-", 0, 195, 8, 196, 0, 503, 39, 513, 0, 78], ["+", 0, 195, 8, 196, 0, 503, 39, 513, 0, 78], ["-", 0, 503, 49, 200, 51, 230, 39, 513, 0, 78], ["+", 0, 503, 49, 200, 51, 230, 39, 513, 0, 78], ["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19], ["-", 0, 503, 49, 200, 51, 227, 497, ... | 3 | 295 | 10 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
static Main main = new Main();
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
S... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
static Main main = new Main();
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
S... | [["-", 8, 196, 0, 503, 39, 224, 468, 506, 0, 507], ["-", 8, 196, 0, 503, 39, 224, 497, 497, 0, 70], ["-", 8, 196, 0, 503, 39, 224, 497, 497, 0, 73], ["-", 8, 196, 0, 7, 15, 16, 12, 509, 500, 22], ["-", 8, 196, 0, 7, 15, 16, 12, 509, 0, 131], ["-", 8, 196, 0, 7, 15, 16, 12, 509, 119, 22], ["+", 8, 196, 0, 7, 15, 16, 12,... | 3 | 364 | 9 |
#include <math.h>
#include <stdio.h>
#include <string.h>
char prime[50001];
void eratosthenes() {
int i, l, j, d;
memset(prime, 1, sizeof(prime));
prime[0] = prime[1] = 0;
for (i = 3, l = (int)sqrt(50000) + 1; i < l; i++) {
if (prime[i] == 1) {
for (d = i * 2, j = i + d; j <= 50000; j += d) {
... | #include <math.h>
#include <stdio.h>
#include <string.h>
char prime[50001];
void eratosthenes() {
int i, l, j, d;
memset(prime, 1, sizeof(prime));
prime[0] = prime[1] = 0;
for (i = 3, l = (int)sqrt(50000) + 1; i < l; i++) {
if (prime[i] == 1) {
for (d = i * 2, j = i + d; j <= 50000; j += d) {
... | [["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 106], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 250 | 4 |
#include <stdio.h>
int a[100000];
int main(void) {
int n;
int i, j, sum;
for (i = 2; i <= 50000; i++)
a[i] = 1;
for (i = 2; i * i <= 50000; i++) {
if (a[i] == 1) {
for (j = i * i; j * j <= 50000; j += i)
a[j] = 0;
}
}
// for (i = 0; i <= 100; i++)printf("a[%d]=%d\n", i, a[i]);... | #include <stdio.h>
int a[100000];
int main(void) {
int n;
int i, j, sum;
for (i = 2; i <= 50000; i++)
a[i] = 1;
for (i = 2; i * i <= 50000; i++) {
if (a[i] == 1) {
for (j = i * i; j <= 50000; j += i)
a[j] = 0;
}
}
// for (i = 0; i <= 100; i++)printf("a[%d]=%d\n", i, a[i]);
w... | [["-", 64, 9, 0, 7, 15, 16, 31, 16, 17, 48], ["-", 64, 9, 0, 7, 15, 16, 31, 16, 12, 22]] | 0 | 186 | 2 |
#include <stdio.h>
int main(void) {
int n, a, b;
int p[50001];
int ans;
for (int i = 0; i < 2; i++) {
p[i] = 0;
}
for (int i = 2; i <= 50000; i++) {
p[i] = 2;
}
for (int i = 2; i <= 50000; i++) {
if (p[i] != 0) {
p[i] = 1;
for (int j = i + 1; j <= 50000; j++) {
if (j % i ... | #include <stdio.h>
int main(void) {
int n, a, b;
int p[50001];
int ans;
for (int i = 0; i < 2; i++) {
p[i] = 0;
}
for (int i = 2; i <= 50000; i++) {
p[i] = 2;
}
for (int i = 2; i <= 50000; i++) {
if (p[i] != 0) {
p[i] = 1;
for (int j = i + 1; j <= 50000; j++) {
if (j % i ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 238 | 2 |
#include <math.h>
#include <stdio.h>
#define SIZE 50000
char primes[SIZE];
int main() {
int i, j, sq, ne, n;
sq = sqrt(SIZE) + 1;
for (i = 1; i <= 25000; i++)
primes[i * 2 - 1] = 1;
for (i = 3; i < sq; i += 2) {
ne = SIZE / i + 1;
for (j = 2; j <= ne; j++) {
primes[j * i - 1] = 1;
}
}
... | #include <math.h>
#include <stdio.h>
#define SIZE 50000
char primes[SIZE];
int main() {
int i, j, sq, ne, n;
sq = sqrt(SIZE) + 1;
for (i = 2; i <= 25000; i++)
primes[i * 2 - 1] = 1;
for (i = 3; i <= sq; i += 2) {
ne = SIZE / i + 1;
for (j = 2; j <= ne; j++) {
primes[j * i - 1] = 1;
}
}
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 7, 10, 34, 31, 11, 12, 13], ["+", 8, 9, 0, 7, 10, 34, 31, 11, 12, 13]] | 0 | 200 | 6 |
#include <math.h>
#include <stdio.h>
#define N 50000
int main() {
int i, j, n;
int prime[N];
for (i = 0; i < N; i++) {
prime[i] = 1;
}
prime[0] = 0;
for (i = 1; i < (int)sqrt(N); i++) {
if (prime[i] == 1) {
for (j = i + 1; (i + 1) * j <= N; j++) {
prime[(i + 1) * j - 1] = 0;
}
... | #include <math.h>
#include <stdio.h>
#define N 50000
int main() {
int i, j, n;
int prime[N];
for (i = 0; i < N; i++) {
prime[i] = 1;
}
prime[0] = 0;
for (i = 1; i < (int)sqrt(N); i++) {
if (prime[i] == 1) {
for (j = i + 1; (i + 1) * j <= N; j++) {
prime[(i + 1) * j - 1] = 0;
}
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20]] | 0 | 217 | 2 |
#include <iostream>
using namespace std;
bool isp[1 << 17];
int n;
main() {
isp[0] = isp[1] = 1;
for (int i = 2; i <= 5e4; i++) {
if (!isp[i]) {
for (int j = i + i; j <= 5e4; j += i)
isp[j] = 1;
}
}
while (cin >> n, n) {
int c = 0;
for (int i = 2; i + 2 <= n; i++)
if (!isp[i]... | #include <iostream>
using namespace std;
bool isp[1 << 17];
int n;
main() {
isp[0] = isp[1] = 1;
for (int i = 2; i <= 5e4; i++) {
if (!isp[i]) {
for (int j = i + i; j <= 5e4; j += i)
isp[j] = 1;
}
}
while (cin >> n, n) {
int c = 0;
for (int i = 2; i <= n / 2; i++)
if (!isp[i]... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 140 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef vector<int> vi;
#define sz(c) int((c).size())
vector<bool> primes(50100, true);
void build() {
primes[0] = false;
primes[1] = false;
for (int i = 2; 2 * i < sz(primes); i++) {
primes[2 * i] = false;
}
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef vector<int> vi;
#define sz(c) int((c).size())
vector<bool> primes(50100, true);
void build() {
primes[0] = false;
primes[1] = false;
for (int i = 2; 2 * i < sz(primes); i++) {
primes[2 * i] = false;
}
... | [["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 70]] | 1 | 253 | 5 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<bool> L(50000);
for (int i = 0; i < 50000; i++)
L[i] = true;
L[0] = L[1] = false;
for (int i = 2; i < 50000; i++) {
if (L[i]) {
for (int j = i * 2; j < 50000; j += i)
L[j] = false;
}
}
int n;
while (ci... | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<bool> L(50000);
for (int i = 0; i < 50000; i++)
L[i] = true;
L[0] = L[1] = false;
for (int i = 2; i < 50000; i++) {
if (L[i]) {
for (int j = i * 2; j < 50000; j += i)
L[j] = false;
}
}
int n;
while (ci... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 185 | 2 |
#include <iostream>
using namespace std;
bool so[50000] = {};
int main() {
so[0] = 1;
so[1] = 1;
for (int i = 2; i * i < 50000; i++)
if (so[i] == 0)
for (int j = 2; j * i < 50000; j++)
so[i * j] = 1;
int n;
while (cin >> n && n) {
int co = 0;
for (int i = 2; i <= n / 2 + 1; i++)
... | #include <iostream>
using namespace std;
bool so[50001] = {};
int main() {
so[0] = 1;
so[1] = 1;
for (int i = 2; i * i <= 50000; i++)
if (so[i] == 0)
for (int j = 2; j * i <= 50000; j++)
so[i * j] = 1;
int n;
while (cin >> n && n) {
int co = 0;
for (int i = 2; i <= n / 2; i++)
... | [["-", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 57, 64, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 57, 64, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7... | 1 | 151 | 8 |
#include <bits/stdc++.h>
#define rep(i, l, n) for (int i = l; i < n; i++)
#define rer(i, l, n) for (int i = l; i <= n; i++)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define pb(a) push_back(a)
#define mk(a, b) make_pair(a, b)
#define fi first
#define se second
using namespace std;
typedef long lo... | #include <bits/stdc++.h>
#define rep(i, l, n) for (int i = l; i < n; i++)
#define rer(i, l, n) for (int i = l; i <= n; i++)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define pb(a) push_back(a)
#define mk(a, b) make_pair(a, b)
#define fi first
#define se second
using namespace std;
typedef long lo... | [["-", 0, 57, 15, 339, 51, 2, 63, 118, 28, 22], ["-", 0, 57, 15, 339, 51, 2, 63, 118, 17, 131], ["-", 0, 57, 15, 339, 51, 2, 63, 118, 119, 120], ["-", 0, 57, 15, 339, 51, 2, 3, 4, 0, 24], ["-", 0, 57, 15, 339, 51, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60],... | 1 | 306 | 8 |
#include <cmath>
#include <iostream>
using namespace std;
int x[100000], y[100000], n, sum;
int main() {
for (int i = 2; i < 100000; i++) {
for (int j = 2; j <= sqrt(i); j++) {
if (i % j == 0) {
goto E;
}
}
x[i] = 1;
E:;
}
while (true) {
cin >> n;
sum = 0;
if (!n) {
... | #include <cmath>
#include <iostream>
using namespace std;
int x[100000], y[100000], n, sum;
int main() {
for (int i = 2; i < 100000; i++) {
for (int j = 2; j <= sqrt(i); j++) {
if (i % j == 0) {
goto E;
}
}
x[i] = 1;
E:;
}
while (true) {
cin >> n;
sum = 0;
if (!n) {
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 155 | 4 |
#include <iostream>
using namespace std;
bool flag[50001];
int prime[50001];
int main() {
int n = 0;
int i, j;
flag[0] = flag[1] = true;
for (i = 2; i * i <= 50000; i++) {
if (flag[i] != true) {
for (j = i * i; j <= 50000; j += i) {
flag[j] = true;
}
}
}
j = 0;
for (i = 0; ... | #include <iostream>
using namespace std;
bool flag[50001];
int prime[50001];
int main() {
int n = 0;
int i, j;
flag[0] = flag[1] = true;
for (i = 2; i * i <= 50000; i++) {
if (flag[i] != true) {
for (j = i * i; j <= 50000; j += i) {
flag[j] = true;
}
}
}
j = 0;
for (i = 0; ... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 199 | 2 |
#include <bits/stdc++.h>
using namespace std;
vector<int> p(0);
void Prime(int n) {
bool flg[50000];
int indx = 2;
flg[0] = flg[1] = 0;
for (int i = 0; i < n; i++)
flg[i] = 0;
while (indx < n) {
flg[indx] = 1;
p.push_back(indx);
for (int i = 2; i * indx < n; i++) {
flg[indx * i] = 1... | #include <bits/stdc++.h>
using namespace std;
vector<int> p(0);
void Prime(int n) {
bool flg[50000];
int indx = 2;
flg[0] = flg[1] = 0;
for (int i = 0; i < n; i++)
flg[i] = 0;
while (indx < n) {
flg[indx] = 1;
p.push_back(indx);
for (int i = 2; i * indx < n; i++) {
flg[indx * i] = 1... | [["+", 51, 16, 31, 2, 3, 4, 0, 16, 17, 72], ["+", 51, 16, 31, 2, 3, 4, 0, 16, 12, 22]] | 1 | 237 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool a[60000]{};
int main() {
for (int b = 2; b < 60000; b++) {
if (!(a[b])) {
for (int c = b * 2; c <= 150000; c += b)
a[c] = true;
}
}
int e;
while (cin >> e, e) {
int... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool a[60000]{};
int main() {
for (int b = 2; b < 60000; b++) {
if (!(a[b])) {
for (int c = b * 2; c < 60000; c += b)
a[c] = true;
}
}
int e;
while (cin >> e, e) {
int s... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13]] | 1 | 141 | 4 |
#include <iostream>
using namespace std;
int main() {
bool p[100000];
p[0] = p[1] = false;
for (int i = 2; i < 100000; i++) {
p[i] = true;
}
for (int i = 2; i * i < 100000; i++) {
if (p[i])
for (int j = i * i; j < 100000; j += i) {
p[j] = false;
}
}
while (1) {
int count ... | #include <iostream>
using namespace std;
int main() {
bool p[100000];
p[0] = p[1] = false;
for (int i = 2; i < 100000; i++) {
p[i] = true;
}
for (int i = 2; i * i < 100000; i++) {
if (p[i])
for (int j = i * i; j < 100000; j += i) {
p[j] = false;
}
}
while (1) {
int count ... | [["+", 0, 7, 15, 16, 12, 16, 31, 23, 0, 24], ["+", 0, 7, 15, 16, 12, 16, 31, 23, 0, 25], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 174 | 4 |
#include <iostream>
using namespace std;
int main() {
bool is_prime[50000];
is_prime[0] = is_prime[1] = false;
for (int i = 2; i < 50000; i++) {
is_prime[i] = true;
}
for (int i = 2; i * i < 50000; i++) {
if (is_prime[i]) {
for (int j = i * i; j < 50000; j += i) {
is_prime[j] = false;... | #include <iostream>
using namespace std;
int main() {
bool is_prime[50000];
is_prime[0] = is_prime[1] = false;
for (int i = 2; i < 50000; i++) {
is_prime[i] = true;
}
for (int i = 2; i * i < 50000; i++) {
if (is_prime[i]) {
for (int j = i * i; j < 50000; j += i) {
is_prime[j] = false;... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 26, 11, 17, 32], ["-", 8, 9, 0, 7, 26, 11, 12, 16, 31, 22], ["-", 8, 9, 0, 7, 26, 11, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 26, 11, 12, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 17, 29]] | 1 | 181 | 7 |
#include <iostream>
using namespace std;
int main() {
bool is_prime[50000];
is_prime[0] = is_prime[1] = false;
for (int i = 2; i < 50000; i++) {
is_prime[i] = true;
}
for (int i = 2; i * i < 50000; i++) {
if (is_prime[i]) {
for (int j = i * i; j < 50000; j += i) {
is_prime[j] = false... | #include <iostream>
using namespace std;
int main() {
bool is_prime[50000];
is_prime[0] = is_prime[1] = false;
for (int i = 2; i < 50000; i++) {
is_prime[i] = true;
}
for (int i = 2; i * i < 50000; i++) {
if (is_prime[i]) {
for (int j = i * i; j < 50000; j += i) {
is_prime[j] = false... | [["-", 0, 57, 15, 339, 51, 2, 63, 118, 28, 22], ["-", 0, 57, 15, 339, 51, 2, 63, 118, 17, 131], ["-", 0, 57, 15, 339, 51, 2, 63, 118, 119, 120], ["-", 0, 57, 15, 339, 51, 2, 3, 4, 0, 24], ["-", 0, 57, 15, 339, 51, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60],... | 1 | 182 | 8 |
#include <bits/stdc++.h>
using namespace std;
#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 PII pair<int, int>
#define VS vec... | #include <bits/stdc++.h>
using namespace std;
#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 PII pair<int, int>
#define VS vec... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 109], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18]] | 1 | 296 | 6 |
#include <stdio.h>
#define max 50010
int main(void) {
long long i, j, k, n;
bool prime[max];
for (i = 0; i < max; ++i)
prime[i] = true;
prime[0] = prime[1] = false;
for (i = 2; i < 250; ++i)
if (prime[i])
for (j = 2; i * j < max; ++j)
prime[i * j] = false;
while (1) {
int ans = 0;... | #include <stdio.h>
#define max 50010
int main(void) {
long long i, j, k, n;
bool prime[max];
for (i = 0; i < max; ++i)
prime[i] = true;
prime[0] = prime[1] = false;
for (i = 2; i < 250; ++i)
if (prime[i])
for (j = 2; i * j < max; ++j)
prime[i * j] = false;
while (1) {
int ans = 0;... | [["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13]] | 1 | 177 | 2 |
#include <iostream>
using namespace std;
int main() {
bool is_prime[50001];
is_prime[0] = is_prime[1] = false;
for (int i = 2; i < 50001; i++) {
is_prime[i] = true;
}
for (int i = 2; i * i < 50001; i++) {
if (is_prime[i]) {
for (int j = i * i; j < 50001; j = j + i) {
is_prime[j] = fal... | #include <iostream>
using namespace std;
int main() {
bool is_prime[50001];
is_prime[0] = is_prime[1] = false;
for (int i = 2; i < 50001; i++) {
is_prime[i] = true;
}
for (int i = 2; i * i < 50001; i++) {
if (is_prime[i]) {
for (int j = i * i; j < 50001; j = j + i) {
is_prime[j] = fal... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 26, 11, 17, 32], ["-", 8, 9, 0, 7, 26, 11, 12, 16, 31, 22], ["-", 8, 9, 0, 7, 26, 11, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 26, 11, 12, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 17, 29]] | 1 | 183 | 7 |
#include <iostream>
using namespace std;
int main() {
bool is_prime[1000000];
is_prime[0] = is_prime[1] = false;
for (int i = 2; i < 1000000; i++) {
is_prime[i] = true;
}
for (int i = 2; i * i < 1000000; i++) {
if (is_prime[i]) {
for (int j = i * i; j < 1000000; j += i) {
is_prime[j] ... | #include <iostream>
using namespace std;
int main() {
bool is_prime[1000000];
is_prime[0] = is_prime[1] = false;
for (int i = 2; i < 1000000; i++) {
is_prime[i] = true;
}
for (int i = 2; i * i < 1000000; i++) {
if (is_prime[i]) {
for (int j = i * i; j < 1000000; j += i) {
is_prime[j] ... | [["-", 0, 57, 15, 339, 51, 2, 63, 118, 28, 22], ["-", 0, 57, 15, 339, 51, 2, 63, 118, 17, 131], ["-", 0, 57, 15, 339, 51, 2, 63, 118, 119, 120], ["-", 0, 57, 15, 339, 51, 2, 3, 4, 0, 24], ["-", 0, 57, 15, 339, 51, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60],... | 1 | 187 | 8 |
#include <cstdio>
#include <cstring>
#define N 50
using namespace std;
int main(void) {
int p[N + 1] = {0};
int n, ans;
for (int i = 2; i < N; i++) {
if (p[i] == -1)
continue;
p[i] = 1;
for (int j = i * 2; j < N; j += i) {
p[j] = -1;
}
}
while (scanf("%d", &n), n) {
ans = 0... | #include <cstdio>
#include <cstring>
#define N 50000
using namespace std;
int main(void) {
int p[N + 1] = {0};
int n, ans;
for (int i = 2; i < N; i++) {
if (p[i] == -1)
continue;
p[i] = 1;
for (int j = i * 2; j < N; j += i) {
p[j] = -1;
}
}
while (scanf("%d", &n), n) {
ans ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 169 | 2 |
#include <stdio.h>
int main(void) {
int a, b, n;
int i;
int ans;
while (scanf("%d %d %d", &a, &b, &n) != EOF) {
ans = 0;
a %= b;
for (i = 0; i < n; i++) {
ans = a * 10 / b;
a = a * 10 % b;
}
printf("%d\n", ans);
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, n;
int i;
int ans;
while (scanf("%d %d %d", &a, &b, &n) != EOF) {
ans = 0;
a %= b;
for (i = 0; i < n; i++) {
ans += a * 10 / b;
a = a * 10 % b;
}
printf("%d\n", ans);
}
return 0;
} | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107]] | 0 | 96 | 2 |
#include <stdio.h>
int main() {
int i;
int a, b, n, sum;
while (scanf("%d%d%d", &a, &b, &n) != -1) {
a %= b;
sum = 0;
for (i = 0; i < n; i++) {
sum += a * 10 / b;
a = a * 10 / b;
}
printf("%d\n", sum);
}
return 0;
} | #include <stdio.h>
int main() {
int i;
int a, b, n, sum;
while (scanf("%d%d%d", &a, &b, &n) != -1) {
a %= b;
sum = 0;
for (i = 0; i < n; i++) {
sum += a * 10 / b;
a = a * 10 % b;
}
printf("%d\n", sum);
}
return 0;
} | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 85], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 109]] | 0 | 94 | 2 |
#include <stdio.h>
#include <string.h>
int main(void) {
int i, j, n, a, b, sum;
while (scanf("%d %d %d", &a, &b, &n) != EOF) {
sum = 0;
a %= b;
while (n--) {
a *= 10;
sum += a / b;
a %= b;
printf("a");
}
printf("%d\n", sum);
}
return 0;
} | #include <stdio.h>
#include <string.h>
int main(void) {
int i, j, n, a, b, sum;
while (scanf("%d %d %d", &a, &b, &n) != EOF) {
sum = 0;
a %= b;
while (n--) {
a *= 10;
sum += a / b;
a %= b;
}
printf("%d\n", sum);
}
return 0;
} | [["-", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 0 | 95 | 7 |
#include <stdio.h>
int main() {
int a, b, n;
int x, i;
int sum;
while (scanf("%d %d %d", &a, &b, &n) != EOF) {
sum = 0;
if (a > b)
a = a % b;
for (i = 0; i < n; i++) {
a = a * 10;
sum += a / b;
a = a % b;
if (a == 0)
break;
}
printf("%d\n", sum);
}... | #include <stdio.h>
int main() {
int a, b, n;
int x, i;
int sum;
while (scanf("%d %d %d", &a, &b, &n) != EOF) {
sum = 0;
a = a % b;
for (i = 0; i < n; i++) {
a = a * 10;
sum += a / b;
a = a % b;
if (a == 0)
break;
}
printf("%d\n", sum);
}
return 0;
}
| [["-", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["-", 0, 52, 8, 9, 0, 57, 15, 23, 0, 24], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["-", 0, 52, 8, 9, 0, 57, 15, 23, 0, 25]] | 0 | 115 | 6 |
#include <iostream>
using namespace std;
long a, b, n, s;
main() {
while (cin >> a >> b >> n) {
s = 0;
for (; n--; a = a * 10 % b)
s += a * 10 / b;
cout << s << endl;
}
}
| #include <iostream>
using namespace std;
long a, b, n, s;
main() {
while (cin >> a >> b >> n) {
a %= b;
s = 0;
for (; n--; a = a * 10 % b)
s += a * 10 / b;
cout << s << endl;
}
}
| [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 132], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 64 | 4 |
#include <cstdio>
#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 a, b, n;
while (scanf("%d %d %d", &a, &b, &n) != EOF) {
int r = 0;
a = a % b;
a *= 10;
rep(i, n) {
rep(j, 10) {
... | #include <cstdio>
#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 a, b, n;
while (scanf("%d %d %d", &a, &b, &n) != EOF) {
int r = 0;
a = a % b;
a *= 10;
rep(i, n) {
rep(j, 11) {
... | [["-", 8, 9, 0, 42, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 42, 0, 2, 3, 4, 0, 13]] | 1 | 133 | 2 |
#include <bits/stdc++.h>
#define rep(i, l, n) for (int i = l; i < n; i++)
#define rer(i, l, n) for (int i = l; i <= n; i++)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define pb(a) push_back(a)
#define mk(a, b) make_pair(a, b)
#define fi first
#define se second
using namespace std;
typedef long lo... | #include <bits/stdc++.h>
#define rep(i, l, n) for (int i = l; i < n; i++)
#define rer(i, l, n) for (int i = l; i <= n; i++)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define pb(a) push_back(a)
#define mk(a, b) make_pair(a, b)
#define fi first
#define se second
using namespace std;
typedef long lo... | [["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 90], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 132], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 173 | 4 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, s, a, b;
while (cin >> a >> b >> n) {
s = 0;
for (int i = 1; i <= n; i++) {
a *= 10;
s += a / b;
a %= b;
}
cout << s << endl;
}
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, s, a, b;
while (cin >> a >> b >> n) {
s = 0;
a %= b;
for (int i = 1; i <= n; i++) {
a *= 10;
s += a / b;
a %= b;
}
cout << s << endl;
}
return 0;
} | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 132], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 78 | 4 |
#include <iostream>
using namespace std;
int main() {
int a, b, n;
while (cin >> a >> b >> n) {
int sum = 0;
a %= 10;
for (int i = 0; i < n; ++i) {
a *= 10;
sum += (a / b) % 10;
a %= b;
}
cout << sum << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, n;
while (cin >> a >> b >> n) {
int sum = 0;
a %= b;
for (int i = 0; i < n; ++i) {
a *= 10;
sum += (a / b) % 10;
a %= b;
}
cout << sum << endl;
}
} | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 22]] | 1 | 80 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b, n;
while (cin >> a >> b >> n) {
if (a > b)
a %= b;
int sum = 0;
for (int i = 0; i < n; i++) {
a *= 10;
sum += a / b;
a %= b;
}
cout << sum << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, n;
while (cin >> a >> b >> n) {
if (a >= b)
a %= b;
int sum = 0;
for (int i = 0; i < n; i++) {
a *= 10;
sum += a / b;
a %= b;
}
cout << sum << endl;
}
return 0;
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 85 | 2 |
#!ruby -alp
a,b,n=$F.map &:hex
$_=0
n.times{a=a%b*10
$_+=a/b} | #!ruby -alp
a,b,n=$F.map &:to_i
$_=0
n.times{a=a%b*10
$_+=a/b} | [["-", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753], ["+", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753]] | 4 | 32 | 2 |
while True:
try:
a, b, n = map(int, input().split())
except:
break
s = str(a/b)
sum = 0
x = s.index(".")+1
for i in s[x:2+x]:
sum += int(i)
print(sum) | while True:
try:
a, b, n = map(int, input().split())
except:
break
s = str(a/b)
sum = 0
x = s.index(".")+1
for i in s[x:x+n]:
sum += int(i)
print(sum) | [["-", 0, 7, 12, 206, 206, 663, 0, 657, 31, 612], ["-", 0, 7, 12, 206, 206, 663, 0, 657, 17, 72], ["+", 0, 7, 12, 206, 206, 663, 0, 657, 17, 72], ["+", 0, 7, 12, 206, 206, 663, 0, 657, 12, 22]] | 5 | 71 | 4 |
import re
while True:
try:
a,b,n = map(int, input().strip().split())
u = '%.100f' % (float(a)/b)
v = list(re.sub(r'[^\.]*\.', '', u))[:n]
w = sum(map(int,v))
print(w)
except EOFError:
break | import re
while True:
try:
a,b,n = map(int, input().strip().split())
u = str((float(a)/b))
v = list(re.sub(r'[^\.]*\.', '', u))[:n]
w = sum(map(int,v))
print(w)
except EOFError:
break | [["-", 0, 1, 0, 662, 12, 657, 31, 557, 0, 654], ["-", 0, 1, 0, 662, 12, 657, 31, 557, 0, 6], ["-", 0, 1, 0, 662, 12, 657, 31, 557, 0, 655], ["-", 8, 196, 0, 1, 0, 662, 12, 657, 17, 109], ["+", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 662, 12, 652, 3, 4, 0, 23, 0, 24], ["+", 0, 662, 12, 652, 3, 4, 0, 23, 0, 25]] | 5 | 84 | 7 |
import sys
for a, b, n in (map(int, l.split()) for l in sys.stdin.readlines()):
if a >= b:
a -= b
a *= 10
ans = 0
for _ in [0]*n:
d, m = divmod(a, b)
ans += d
a = m*10
print(ans)
| import sys
for a, b, n in (map(int, l.split()) for l in sys.stdin.readlines()):
if a >= b:
a %= b
a *= 10
ans = 0
for _ in [0]*n:
d, m = divmod(a, b)
ans += d
a = m*10
print(ans)
| [["-", 0, 57, 64, 196, 0, 1, 0, 677, 17, 110], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 17, 132]] | 5 | 77 | 2 |
#include <stdio.h>
int main(void) {
char card[11];
int a, b, c, below;
int i;
double percent;
while (scanf("%d%d%d", &a, &b, &c) != EOF) {
for (i = 1; i <= 10; i++) {
card[i] = 0;
}
card[a] = card[b] = card[c] = 0;
below = 0;
for (i = 1; i <= 10; i++) {
if (card[i] == 0 && ... | #include <stdio.h>
int main(void) {
char card[11];
int a, b, c, below;
int i;
double percent;
while (scanf("%d%d%d", &a, &b, &c) != EOF) {
for (i = 1; i <= 10; i++) {
card[i] = 0;
}
card[a] = card[b] = card[c] = 1;
below = 0;
for (i = 1; i <= 10; i++) {
if (card[i] == 0 && ... | [["-", 0, 1, 0, 11, 12, 11, 12, 11, 12, 13], ["+", 0, 1, 0, 11, 12, 11, 12, 11, 12, 13], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 13], ["+", 0, 11, 12, 16, 31, 23, 0, 16, 12, 13], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 25]] | 0 | 172 | 6 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int a, b, c, p, sum;
while (scanf("%d %d %d", &a, &b, &c) != EOF) {
sum = a + b;
p = 0;
for (int i = 1; i <= 10; i++... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int a, b, c, p, sum;
while (scanf("%d %d %d", &a, &b, &c) != EOF) {
sum = a + b;
p = 0;
for (int i = 1; i <= 10; i++... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 140 | 2 |
#include <iostream>
#include <string>
using namespace std;
string solve(int c1, int c2, int c3) {
int bunbo = 7; // not 6
int mysum = c1 + c2;
int okCount = 0;
double kakuritu;
for (int i = 1; i <= 10; i++) {
if (i == c1 || i == c2 || i == c3)
continue;
else {
if (mysum + i <= 20)
... | #include <iostream>
#include <string>
using namespace std;
string solve(int c1, int c2, int c3) {
int bunbo = 7; // not 6. if6 -> (in)8 9 10 (out)YES.
int mysum = c1 + c2;
int okCount = 0;
double kakuritu;
for (int i = 1; i <= 10; i++) {
if (i == c1 || i == c2 || i == c3)
continue;
else {
... | [["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22]] | 1 | 165 | 2 |
#include <iostream>
using namespace std;
int main() {
int c[3];
while (cin >> c[0]) {
for (int i = 1; i < 3; i++)
cin >> c[i];
int s = 0;
double p = 0;
for (int i = 1; i <= 10; i++) {
if (i != c[0] || i != c[1] || i != c[2]) {
if (i + c[1] + c[2] <= 20)
s++;
}
... | #include <iostream>
using namespace std;
int main() {
int c[3];
while (cin >> c[0]) {
for (int i = 1; i < 3; i++)
cin >> c[i];
int s = 0;
double p = 0;
for (int i = 1; i <= 10; i++) {
if (i != c[0] || i != c[1] || i != c[2]) {
if (i + c[0] + c[1] <= 20)
s++;
}
... | [["-", 31, 16, 31, 16, 12, 69, 341, 342, 0, 13], ["+", 31, 16, 31, 16, 12, 69, 341, 342, 0, 13], ["-", 51, 16, 31, 16, 12, 69, 341, 342, 0, 13], ["+", 51, 16, 31, 16, 12, 69, 341, 342, 0, 13]] | 1 | 151 | 4 |
#include <cstdio>
using namespace std;
int main() {
int c[3];
int cnt;
int i;
while (scanf("%d %d %d", &c[0], &c[1], &c[2]) != EOF) {
cnt = 0;
for (i = 1; i <= 10; i++) {
if (i != c[0] && i != c[1] && i != c[2]) {
if (c[0] + c[1] + c[2] + i <= 20) {
cnt++;
}
}
... | #include <cstdio>
using namespace std;
int main() {
int c[3];
int cnt;
int i;
while (scanf("%d %d %d", &c[0], &c[1], &c[2]) != EOF) {
cnt = 0;
for (i = 1; i <= 10; i++) {
if (i != c[0] && i != c[1] && i != c[2]) {
if (c[0] + c[1] + i <= 20) {
cnt++;
}
}
}
... | [["-", 51, 16, 31, 16, 31, 16, 12, 69, 28, 22], ["-", 31, 16, 31, 16, 12, 69, 341, 342, 0, 70], ["-", 31, 16, 31, 16, 12, 69, 341, 342, 0, 13], ["-", 31, 16, 31, 16, 12, 69, 341, 342, 0, 73], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72]] | 1 | 157 | 5 |
#include <fstream>
int main() {
int C1, C2, C3, counter;
while (scanf("%d %d %d", &C1, &C2, &C3) != EOF) {
counter = 0;
for (int i = 1; i < 11; i++) {
if ((i != C1 && i != C2 && i != C3) && (C1 + C2 + i <= 20)) {
counter++;
}
}
if (counter < 4) {
printf("No\n");
} else... | #include <fstream>
int main() {
int C1, C2, C3, counter;
while (scanf("%d %d %d", &C1, &C2, &C3) != EOF) {
counter = 0;
for (int i = 1; i < 11; i++) {
if ((i != C1 && i != C2 && i != C3) && (C1 + C2 + i <= 20)) {
counter++;
}
}
if (counter < 4) {
printf("NO\n");
} else... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 120 | 4 |
#include <algorithm>
#include <cctype>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using n... | #include <algorithm>
#include <cctype>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using n... | [["-", 15, 339, 51, 16, 12, 23, 0, 16, 17, 18], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 196 | 6 |
#include <cstdio>
int main() {
int c1, c2, c3;
bool mem[11];
while (scanf("%d%d%d", &c1, &c2, &c3) != EOF) {
for (int i = 0; i < 11; i++)
mem[i] = false;
mem[c1] = mem[c2] = mem[c3] = true;
int ok = 0;
for (int i = 1; i <= 10; i++) {
if (!mem[i] && c1 + c2 + i <= 20) {
ok++;
... | #include <cstdio>
int main() {
int c1, c2, c3;
bool mem[11];
while (scanf("%d%d%d", &c1, &c2, &c3) != EOF) {
for (int i = 0; i < 11; i++)
mem[i] = false;
mem[c1] = mem[c2] = mem[c3] = true;
int ok = 0;
for (int i = 1; i <= 10; i++) {
if (!mem[i] && c1 + c2 + i <= 20) {
ok++;
... | [["-", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["-", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6]] | 1 | 146 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int c1, c2, c3, cnt = 0;
while (cin >> c1 >> c2 >> c3) {
cnt = 0;
for (int i = 0; i < 10; i++) {
if (i != c1 && i != c2 && i != c3 && i + c1 + c2 < 21)
cnt++;
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int c1, c2, c3, cnt = 0;
while (cin >> c1 >> c2 >> c3) {
cnt = 0;
for (int i = 1; i <= 10; i++) {
if (i != c1 && i != c2 && i != c3 && i + c1 + c2 < 21)
cnt++;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 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]] | 1 | 115 | 4 |
#include <cstdio>
using namespace std;
int main() {
int a, b, c;
while (scanf("%d%d%d", &a, &b, &c) == 3) {
int t[11] = {};
t[a] = t[b] = t[c] = 1;
int u = 0;
for (int i = 1; i <= 10; ++i) {
if (!t[i] && a + b + i <= 20) {
++u;
}
}
puts(u > 3 ? "Yes" : "No");
}
} | #include <cstdio>
using namespace std;
int main() {
int a, b, c;
while (scanf("%d%d%d", &a, &b, &c) == 3) {
int t[11] = {};
t[a] = t[b] = t[c] = 1;
int u = 0;
for (int i = 1; i <= 10; ++i) {
if (!t[i] && a + b + i <= 20) {
++u;
}
}
puts(u > 3 ? "YES" : "NO");
}
} | [["-", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["-", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6]] | 1 | 124 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
long a, b, c, i, j[11], k;
while (cin >> a) {
cin >> b >> c;
for (i = 1; i <= 10; i++)
j[i] = 0;
j[a] = j[b] = j[c] = 1;
for (k = 0, i = 1; i <= 10; i++) {
k += j[i];
if (k == 4)
break;
}
if (a ... | #include <iostream>
#include <string>
using namespace std;
int main() {
long a, b, c, i, j[11], k;
while (cin >> a) {
cin >> b >> c;
for (i = 1; i <= 10; i++)
j[i] = 1;
j[a] = j[b] = j[c] = 0;
for (k = 0, i = 1; i <= 10; i++) {
k += j[i];
if (k == 4)
break;
}
if (a ... | [["-", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13], ["-", 0, 1, 0, 11, 12, 11, 12, 11, 12, 13], ["+", 0, 1, 0, 11, 12, 11, 12, 11, 12, 13]] | 1 | 145 | 4 |
cards = Array.new(11,1)
a,b,c = gets.split.map &:to_i
cards[a] = 0
cards[b] = 0
cards[c] = 0
r = 20 - a - b
count = 0
r = 10 if r > 10
r.times { |i|
count += cards[i + 1]
}
puts ["NO", "YES"][count/4] | while t = gets
cards = Array.new(11,1)
a,b,c = t.split.map &:to_i
cards[a] = 0
cards[b] = 0
cards[c] = 0
r = 20 - a - b
count = 0
r = 10 if r > 10
r.times { |i|
count += cards[i + 1]
}
puts ["NO", "YES"][count/4]
end | [["+", 36, 36, 36, 36, 0, 493, 0, 89, 0, 89], ["+", 36, 36, 0, 493, 0, 89, 15, 662, 31, 22], ["+", 36, 36, 0, 493, 0, 89, 15, 662, 0, 32], ["+", 36, 36, 0, 493, 0, 89, 15, 662, 12, 22], ["-", 0, 493, 0, 662, 12, 652, 486, 652, 486, 22], ["+", 8, 170, 0, 662, 12, 652, 486, 652, 486, 22], ["+", 36, 36, 0, 493, 0, 89, 8, ... | 4 | 89 | 7 |
while l = gets do
c1,c2,c3 = l.split.map(&:to_i)
cards = (1..10).to_a
cards.delete(c1)
cards.delete(c2)
cards.delete(c3)
p cards
rest = 20-(c1+c2)
puts cards.select{|x| x>rest}.size > 3 ? "NO" : "YES"
end | while l = gets do
c1,c2,c3 = l.split.map(&:to_i)
cards = (1..10).to_a
cards.delete(c1)
cards.delete(c2)
cards.delete(c3)
rest = 20-(c1+c2)
puts cards.select{|x| x>rest}.size > 3 ? "NO" : "YES"
end | [["-", 0, 493, 0, 89, 8, 170, 0, 652, 735, 22], ["-", 0, 89, 8, 170, 0, 652, 3, 4, 0, 22]] | 4 | 83 | 2 |
while True:
try:
a, b, c = map(int, input().split())
except:
break
l=[True] * 11
l[a] = l[b] = l[c] = False
sum = a + b
over = 0
for i in range(1,11):
if l[i]:
if sum + i > 20:
print(i)
over += 1
if over / 7 <= 0.5:
... | while True:
try:
a, b, c = map(int, input().split())
except:
break
l=[True] * 11
l[a] = l[b] = l[c] = False
sum = a + b
over = 0
for i in range(1,11):
if l[i]:
if sum + i > 20:
over += 1
if over / 7 < 0.5:
print("YES")
el... | [["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 25], ["-", 0, 52, 8, 196, 0, 57, 15, 666, 667, 19], ["+", 0, 52, 8, 196, 0, 57, 15, 666, 667, 18]] | 5 | 108 | 6 |
while 1:
a=[i+1 for i in range(10)]
try:b=list(map(int,input().split()))
except:break
for i in b:a.remove(b)
print('YES' if sum([1 for i in a if i<=20-sum(b[:2])])/7>=0.5 else 'NO') | while 1:
a=[i+1 for i in range(10)]
try:b=list(map(int,input().split()))
except:break
for i in b:a.remove(i)
print('YES' if sum([1 for i in a if i<=20-sum(b[:2])])/7>=0.5 else 'NO') | [["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 88 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = "";
while ((line = br.readLine()) != null) ... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = "";
while ((line = br.readLine()) != null) ... | [["+", 75, 57, 15, 15, 0, 16, 31, 16, 17, 48], ["+", 15, 15, 0, 16, 31, 16, 12, 91, 17, 33], ["+", 15, 15, 0, 16, 31, 16, 12, 91, 439, 499]] | 3 | 305 | 3 |
main() {
float a, b, c, d, e, f, g, h;
while (~scanf("%f%f%f%f%f%f%f%f", &a, &b, &c, &d, &e, &f, &g, &h)) {
puts("%s\n", (c - a) * (g - e) + (d - b) * (h - f) ? "NO" : "YES");
}
exit(0);
} | main() {
float a, b, c, d, e, f, g, h;
while (~scanf("%f%f%f%f%f%f%f%f", &a, &b, &c, &d, &e, &f, &g, &h)) {
puts((c - a) * (g - e) + (d - b) * (h - f) ? "NO" : "YES");
}
exit(0);
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21]] | 0 | 103 | 5 |
#include <stdio.h>
int main(void) {
float xa, ya, xb, yb, xc, yc, xd, yd;
double a1, a2;
double s, l, t, u;
while (scanf("%lf", &xa) != EOF) {
scanf("%f%f%f%f%f%f%f", &ya, &xb, &yb, &xc, &yc, &xd, &yd);
s = xb - xa;
l = yb - ya;
t = xd - xc;
u = yd - yc;
/*a1 = (double)((yb -ya) / (xb -... | #include <stdio.h>
int main(void) {
float xa, ya, xb, yb, xc, yc, xd, yd;
double a1, a2;
double s, l, t, u;
while (scanf("%f", &xa) != EOF) {
scanf("%f%f%f%f%f%f%f", &ya, &xb, &yb, &xc, &yc, &xd, &yd);
s = xb - xa;
l = yb - ya;
t = xd - xc;
u = yd - yc;
/*a1 = (double)((yb -ya) / (xb - ... | [["-", 0, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 16, 31, 2, 3, 4, 0, 5, 0, 6]] | 0 | 145 | 2 |
#include <stdio.h>
int main(void) {
float xa, ya, xb, yb, xc, yc, xd, yd;
double a1, a2;
double s, l, t, u;
while (scanf("%lf", &xa) != EOF) {
scanf("%f%f%f%f%f%f%f", &ya, &xb, &yb, &xc, &yc, &xd, &yd);
if (xa == xb && yd == yc) {
printf("YES\n");
continue;
}
if (xd == xc && yb == ya... | #include <stdio.h>
int main(void) {
float xa, ya, xb, yb, xc, yc, xd, yd;
double a1, a2;
double s, l, t, u;
while (scanf("%f", &xa) != EOF) {
scanf("%f%f%f%f%f%f%f", &ya, &xb, &yb, &xc, &yc, &xd, &yd);
if (xa == xb && yd == yc) {
printf("YES\n");
continue;
}
if (xd == xc && yb == ya)... | [["-", 0, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 16, 31, 2, 3, 4, 0, 5, 0, 6]] | 0 | 211 | 2 |
#include <stdio.h>
int main(void) {
double xA, yA, xB, yB, xC, yC, xD, yD;
double dAi, dC;
while (scanf("%lf%lf%lf%lf%lf%lf%lf%lf", &xA, &yA, &xB, &yB, &xC, &yC, &xD,
&yD) != EOF) {
if (yB == yA) {
puts(xD == xC ? "YES" : "NO");
} else if (xD == xC) {
puts(yB == yA ? "YES" : "N... | #include <stdio.h>
int main(void) {
double xA, yA, xB, yB, xC, yC, xD, yD;
double dAi, dC;
while (scanf("%lf%lf%lf%lf%lf%lf%lf%lf", &xA, &yA, &xB, &yB, &xC, &yC, &xD,
&yD) != EOF) {
if (yB == yA) {
puts(xD == xC ? "YES" : "NO");
} else if (xD == xC) {
puts(yB == yA ? "YES" : "N... | [["-", 75, 76, 0, 57, 75, 76, 0, 9, 0, 46], ["+", 75, 76, 0, 57, 75, 76, 0, 9, 0, 46]] | 0 | 164 | 2 |
#include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
const int MOD = 1000000007;
... | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
const int MOD = 1000000007;
... | [["+", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 24], ["+", 31, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 1,953 | 3 |
/*include*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#def... | /*include*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#def... | [["+", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22]] | 1 | 2,525 | 1 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class t> using table = vector<vector<t>>;
const ld eps = 1e-9;
// < "d:\d_download\visual studio
// 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class t> using table = vector<vector<t>>;
const ld eps = 1e-9;
// < "d:\d_download\visual studio
// 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 85], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 5,429 | 6 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22], ["+", 51, 16, 31, 2, 3, 4, 0, 23, 0, 24], ["+", 51, 16, 31, 2, 3, 4, 0, 23, 0, 25]] | 1 | 195 | 5 |
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
double EPS = 1e-10;
void q58() {
double ax, ay, bx, by, cx, cy, dx, dy;
for (; cin >> ax >> ay >> bx >> by >> cx >> cy >> dx >> dy;) {
if (abs((ay - by) * (cy - dy) + ... | #define _USE_MATH_DEFINES
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
double EPS = 1e-10;
void q58() {
double ax, ay, bx, by, cx, cy, dx, dy;
for (; cin >> ax >> ay >> bx >> by >> cx >> cy >> dx >> dy;) {
if (abs((ay - by) * (cy - dy) + ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 133 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defin... | [["+", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 24], ["+", 31, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 294 | 3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defin... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 0, 122, 8, 123, 0, 124, 39, 86, 0, 96], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 294 | 7 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int inf = 1e9;
int main() {
vector<double> x(4);
vector<d... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int inf = 1e9;
int main() {
vector<double> x(4);
vector<d... | [["+", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 24], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 25]] | 1 | 192 | 3 |
#include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath> // require fabs
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit atof atoi
#include <cstring> // requir... | #include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath> // require fabs
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit atof atoi
#include <cstring> // requir... | [["+", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 24], ["+", 31, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 2,916 | 3 |
#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;
class Point ... | #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;
class Point ... | [["-", 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, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 227 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include ... | [["+", 12, 23, 0, 41, 15, 16, 31, 2, 63, 22], ["+", 3, 4, 0, 16, 31, 16, 31, 23, 0, 24], ["+", 3, 4, 0, 16, 12, 16, 12, 23, 0, 25]] | 1 | 305 | 3 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
int main() {
d... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
int main() {
d... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 158 | 4 |
#include <cmath>
#include <iostream>
using namespace std;
namespace geo {
const double EPS = 1e-10;
class Point {
public:
double x, y;
Point(double _x = 0.0, double _y = 0.0) : x(_x), y(_y) {}
inline double abs() const { return sqrt(x * x + y * y); }
// 内積
inline double dot(const Point &p) const { return... | #include <cmath>
#include <iostream>
using namespace std;
namespace geo {
const double EPS = 1e-10;
class Point {
public:
double x, y;
Point(double _x = 0.0, double _y = 0.0) : x(_x), y(_y) {}
inline double abs() const { return sqrt(x * x + y * y); }
// 内積
inline double dot(const Point &p) const { return... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 400 | 4 |
#include <iostream>
using namespace std;
struct P {
double x;
double y;
};
int main() {
P a, b, c, d;
while (cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y >> d.x >> d.y) {
P v, w;
v.x = a.x - b.x;
v.y = a.y - b.y;
w.x = c.x - d.x;
w.y = c.y - d.y;
if (v.x * w.x + w.x * w.y == 0)
co... | #include <iostream>
using namespace std;
struct P {
double x;
double y;
};
int main() {
P a, b, c, d;
while (cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y >> d.x >> d.y) {
P v, w;
v.x = a.x - b.x;
v.y = a.y - b.y;
w.x = c.x - d.x;
w.y = c.y - d.y;
if (v.x * w.x + v.y * w.y == 0)
co... | [["-", 51, 16, 31, 16, 12, 16, 31, 118, 28, 22], ["+", 51, 16, 31, 16, 12, 16, 31, 118, 28, 22], ["-", 51, 16, 31, 16, 12, 16, 31, 118, 119, 120], ["+", 51, 16, 31, 16, 12, 16, 31, 118, 119, 120]] | 1 | 163 | 4 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = 1e-8;
const double INF = 1e10;
struct Point {
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
double distance(const Point &o) const {
return sqrt((x - o.x) * (x - o.x) + (y - o.y) * (y - o.y));
}... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = 1e-8;
const double INF = 1e10;
struct Point {
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
double distance(const Point &o) const {
return sqrt((x - o.x) * (x - o.x) + (y - o.y) * (y - o.y));
}... | [["+", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 24], ["+", 31, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 439 | 3 |
#include <iostream>
using namespace std;
typedef struct Point {
double x, y;
};
int main() {
Point p[4];
double x[2], y[2];
while (cin >> p[0].x) {
cin >> p[0].y;
for (int i = 1; i < 4; i++) {
cin >> p[i].x;
cin >> p[i].y;
}
x[0] = p[0].x - p[1].x;
x[1] = p[2].x - p[3].x;
... | #include <iostream>
using namespace std;
typedef struct Point {
double x, y;
};
int main() {
Point p[4];
double x[2], y[2];
while (cin >> p[0].x) {
cin >> p[0].y;
for (int i = 1; i < 4; i++) {
cin >> p[i].x;
cin >> p[i].y;
}
x[0] = p[0].x - p[1].x;
x[1] = p[2].x - p[3].x;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 222 | 4 |
#include <cmath>
#include <iostream>
using namespace std;
typedef pair<double, double> P;
void solve() {
P p[4];
while (cin >> p[0].first >> p[0].second) {
for (int i = 1; i < 4; ++i) {
cin >> p[i].first >> p[i].second;
}
if ((p[1].first - p[0].first) * (p[3].first - p[2].first) +
(p... | #include <cmath>
#include <iostream>
using namespace std;
typedef pair<double, double> P;
void solve() {
P p[4];
while (cin >> p[0].first >> p[0].second) {
for (int i = 1; i < 4; ++i) {
cin >> p[i].first >> p[i].second;
}
if (fabs((p[1].first - p[0].first) * (p[3].first - p[2].first) +
... | [["+", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22], ["+", 3, 4, 0, 16, 31, 16, 31, 23, 0, 24], ["+", 3, 4, 0, 16, 12, 16, 12, 23, 0, 25]] | 1 | 185 | 3 |
#include <iostream>
using namespace std;
double xa, ya, xb, yb, xc, yc, xd, yd;
int main() {
while (cin >> xa >> ya >> xb >> yb >> xc >> yc >> xd >> yd) {
((xb - xa) * (xd - xc) + (yb - ya) * (yd - yc)) ? cout << "YES" << endl
: cout << "NO" << endl;
}
} | #include <iostream>
using namespace std;
double xa, ya, xb, yb, xc, yc, xd, yd;
int main() {
while (cin >> xa >> ya >> xb >> yb >> xc >> yc >> xd >> yd) {
!((xb - xa) * (xd - xc) + (yb - ya) * (yd - yc)) ? cout << "YES" << endl
: cout << "NO" << endl;
}
} | [["+", 8, 9, 0, 1, 0, 41, 15, 91, 17, 111]] | 1 | 93 | 1 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 311 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 24], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 25]] | 1 | 229 | 5 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
/... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
/... | [["+", 8, 9, 0, 37, 0, 16, 31, 2, 63, 22], ["+", 0, 37, 0, 16, 31, 2, 3, 4, 0, 24], ["+", 31, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 625 | 3 |
#!ruby -n
l=$_.split.map(&:to_f)
puts ((l[3]-l[1])*(l[7]-l[5])+(l[2]-l[0])*(l[6]-l[4])<1e-8)? 'YES': 'NO' | #!ruby -n
l=$_.split.map(&:to_f)
puts ((l[3]-l[1])*(l[7]-l[5])+(l[2]-l[0])*(l[6]-l[4])).abs<1e-12? 'YES': 'NO' | [["-", 3, 4, 0, 754, 15, 739, 0, 738, 17, 18], ["-", 3, 4, 0, 754, 15, 739, 0, 738, 12, 531], ["+", 3, 4, 0, 754, 15, 738, 31, 652, 17, 131], ["+", 3, 4, 0, 754, 15, 738, 31, 652, 735, 22], ["+", 0, 652, 3, 4, 0, 754, 15, 738, 17, 18], ["+", 0, 652, 3, 4, 0, 754, 15, 738, 12, 531]] | 4 | 72 | 6 |
while str = STDIN.gets
if str == -1 then break end
a = str.split(' ');
eps = 1e-12;
for i in 0...8 do
a[i] = a[i].to_i
end
if ((a[0]-a[2])*(a[4]-a[6])+(a[1]-a[3])*(a[5]-a[7])).abs <= eps then
puts "YES\n"
else
puts "NO\n"
end
end | while str = STDIN.gets
if str == -1 then break end
a = str.split(' ');
eps = 1e-12;
for i in 0...8 do
a[i] = a[i].to_f
end
if ((a[0]-a[2])*(a[4]-a[6])+(a[1]-a[3])*(a[5]-a[7])).abs <= eps then
puts "YES\n"
else
puts "NO\n"
end
end | [["-", 0, 88, 8, 170, 0, 662, 12, 652, 735, 22], ["+", 0, 88, 8, 170, 0, 662, 12, 652, 735, 22]] | 4 | 116 | 2 |
while True:
try:
xa, ya, xb, yb, xc, yc, xd, yd = map(float, input().split())
except:
break
if (ya - yb) * (yc - yd) + (xa - xb) * (xc - xd) < 1.e-10:
print('YES')
else:
print('NO') | while True:
try:
xa, ya, xb, yb, xc, yc, xd, yd = map(float, input().split())
except:
break
if abs((ya - yb) * (yc - yd) + (xa - xb) * (xc - xd)) < 1.e-10:
print('YES')
else:
print('NO') | [["+", 8, 196, 0, 57, 15, 666, 0, 652, 63, 22], ["+", 3, 4, 0, 657, 31, 657, 31, 23, 0, 24], ["+", 3, 4, 0, 657, 12, 657, 12, 23, 0, 25]] | 5 | 77 | 3 |
def choco(xa,ya,xb,yb,xc,yc,xd,yd): return 1 if abs((yb-ya)*(yd-yc)+(xb-xa)*(xd-xc))<1 else 0
while True:
try:
xa,ya,xb,yb,xc,yc,xd,yd=list(map(float,input().split()))
print('YES' if choco(xa,ya,xb,yb,xc,yc,xd,yd) else 'NO')
except:
break | def choco(xa,ya,xb,yb,xc,yc,xd,yd): return 1 if abs((yb-ya)*(yd-yc)+(xb-xa)*(xd-xc))<1.e-10 else 0
while True:
try:
xa,ya,xb,yb,xc,yc,xd,yd=list(map(float,input().split()))
print('YES' if choco(xa,ya,xb,yb,xc,yc,xd,yd) else 'NO')
except:
break | [["-", 8, 196, 0, 37, 0, 41, 0, 666, 0, 612], ["+", 8, 196, 0, 37, 0, 41, 0, 666, 0, 531]] | 5 | 121 | 2 |
while True:
try:
x_a, y_a, x_b, y_b, x_c, y_c, x_d, y_d = map(float, input().split())
ab_x, ab_y = x_b - x_a, y_b - y_a
cd_x, cd_y = x_d - x_c, y_d - y_c
dp = ab_x*cd_x + ab_y*cd_y
if dp > 1e-10:
print("NO")
else:
print("YES")
except:
... | while True:
try:
x_a, y_a, x_b, y_b, x_c, y_c, x_d, y_d = map(float, input().split())
ab_x, ab_y = x_b - x_a, y_b - y_a
cd_x, cd_y = x_d - x_c, y_d - y_c
dp = ab_x*cd_x + ab_y*cd_y
if abs(dp) > 1e-10:
print("NO")
else:
print("YES")
except:
... | [["+", 8, 196, 0, 57, 15, 666, 0, 652, 63, 22], ["+", 0, 57, 15, 666, 0, 652, 3, 4, 0, 24], ["+", 0, 57, 15, 666, 0, 652, 3, 4, 0, 25]] | 5 | 86 | 3 |
while True:
try:
xa,ya,xb,yb,xc,yc,xd,yd=map(float,input().split())
except EOFError:
break
if (ya-yb)*(yc-yd)+(xa-xb)*(xc-xd)<=1e-10:
print("YES")
else:
print("NO")
| while True:
try:
xa,ya,xb,yb,xc,yc,xd,yd=map(float,input().split())
except EOFError:
break
if abs((ya-yb)*(yc-yd)+(xa-xb)*(xc-xd))<=1e-10:
print("YES")
else:
print("NO")
| [["+", 8, 196, 0, 57, 15, 666, 0, 652, 63, 22], ["+", 3, 4, 0, 657, 31, 657, 31, 23, 0, 24], ["+", 3, 4, 0, 657, 12, 657, 12, 23, 0, 25]] | 5 | 78 | 3 |
#include <stdio.h>
int main(void) {
int rank[100][3] = {0}, num, point, i, j, temp, n = 0;
while (1) {
scanf("%d,%d", &num, &point);
if (num == 0 && point == 0)
break;
rank[n][0] = num;
rank[n][1] = point;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n - i - 1; j++) {
if (rank[j][... | #include <stdio.h>
int main(void) {
int rank[100][3] = {0}, num, point, i, j, temp, n = 0;
while (1) {
scanf("%d,%d", &num, &point);
if (num == 0 && point == 0)
break;
rank[n][0] = num;
rank[n][1] = point;
n++;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n - i - 1; j++) {
if ... | [["+", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 0 | 383 | 3 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
map<int, int> M;
vector<pair<int, int>> V;
int a, b;
while (scanf("%d,%d", &a, &b), a && b) {
V.push_back(make_pair(b, a));
}
sort(V.begin(), V.end());
reverse(V.begin(), V.end... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
map<int, int> M;
vector<pair<int, int>> V;
int a, b;
while (scanf("%d,%d", &a, &b), a || b) {
V.push_back(make_pair(b, a));
}
sort(V.begin(), V.end());
reverse(V.begin(), V.end... | [["-", 0, 52, 15, 339, 51, 34, 12, 16, 17, 98], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 106]] | 1 | 235 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define np string::npos
#define all(r)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define np string::npos
#define all(r)... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 424 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.