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 <iostream>
#include <string>
using namespace std;
int main() {
string sa;
getline(cin, sa);
int z = sa.size();
for (int i = 0; i < z - 4; i++) {
string sb = sa.substr(i, 7);
if (sb == "apple") {
sa.replace(i, 5, "peach");
}
if (sb == "peach") {
sa.replace(i, 5, "apple");
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string sa;
getline(cin, sa);
int z = sa.size();
for (int i = 0; i < z - 4; i++) {
string sb = sa.substr(i, 5);
if (sb == "apple") {
sa.replace(i, 5, "peach");
}
if (sb == "peach") {
sa.replace(... | [["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13]] | 1 | 118 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string apple = "apple", peach = "peach";
int n = 0;
string str[1000];
while (cin >> str[n]) {
for (int i = 0; i < str[n].size(); i++) {
if (str[n].substr(i, 5) == apple) {
for (int j = 0; j < apple.size(); j++) {
str[n][i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string apple = "apple", peach = "peach";
int n = 0;
string str[1000];
while (cin >> str[n]) {
for (int i = 0; i < str[n].size(); i++) {
if (str[n].substr(i, 5) == apple) {
for (int j = 0; j < peach.size(); j++) {
str[n][i ... | [["-", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22]] | 1 | 223 | 8 |
#include <iostream>
#include <string>
using namespace std;
main() {
char data[2000];
int size;
for (int i = 0; i < 2000; i++) {
scanf("%c", &data[i]);
if (data[i] == '\n') {
int size = i;
break;
}
}
for (int i = 4; i < size; i++) {
if (data[i - 4] == 'a' && data[i - 3] == 'p' && ... | #include <iostream>
#include <string>
using namespace std;
main() {
char data[2000];
int size;
for (int i = 0; i < 2000; i++) {
scanf("%c", &data[i]);
if (data[i] == '\n') {
size = i;
break;
}
}
for (int i = 4; i < size; i++) {
if (data[i - 4] == 'a' && data[i - 3] == 'p' && data... | [["-", 8, 9, 0, 57, 64, 9, 0, 43, 39, 40], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13]] | 1 | 363 | 3 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
char map[2][6] = {"apple", "peach"};
char c[10000] = {0};
for (int i = 0; i < 1000; i++) {
c[i] = getchar();
if (c[i] == '\n')
break;
}
for (int i = 0; i < 1000; i++) {
if (c[i] =... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
char map[2][6] = {"apple", "peach"};
char c[10000] = {0};
for (int i = 0; i < 1000; i++) {
c[i] = getchar();
if (c[i] == '\n')
break;
}
for (int i = 0; i < 1000; i++) {
if (c[i] =... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 233 | 1 |
#include <cctype>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
char cc[1000];
cin.getline(cc, 1000);
for (int i = 0; i < strlen(cc); i++) {
if (cc[i] == 'a' && cc[i + 1] == 'p' && cc[i + 2] == 'p' &&
cc[i + 3] == 'l' && cc[i + 4] == 'e') {
cc[i] = 'p';
cc[i + 1]... | #include <cctype>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
char cc[1000];
cin.getline(cc, 1000);
for (int i = 0; i < strlen(cc); i++) {
if (cc[i] == 'a' && cc[i + 1] == 'p' && cc[i + 2] == 'p' &&
cc[i + 3] == 'l' && cc[i + 4] == 'e') {
cc[i] = 'p';
cc[i + 1]... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 284 | 1 |
import java.util.*;
class Main {
public static void main(String[] z) {
int i = 0, e = 2, t = 10000;
int[] p = new int[t];
for (; i < t; i++) {
for (; f(p, e) < 1; e++)
;
p[i] = e++;
}
for (i = 0; i < t; ++i)
p[i] += p[i - 1];
for (Scanner s = new Scanner(System.in); (... | import java.util.*;
class Main {
public static void main(String[] z) {
int i = 0, e = 2, t = 10000;
int[] p = new int[t];
for (; i < t; i++) {
for (; f(p, e) < 1; e++)
;
p[i] = e++;
}
for (i = 1; i < t; ++i)
p[i] += p[i - 1];
for (Scanner s = new Scanner(System.in); (... | [["-", 0, 195, 8, 196, 0, 7, 502, 11, 12, 499], ["+", 0, 195, 8, 196, 0, 7, 502, 11, 12, 499]] | 3 | 191 | 2 |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Calendar;
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
public static void main(String[] args) { new Main().AOJ0053(); }
void AOJ0053() {
ArrayList<Integer> primes = primeTable(100);
while (true) {... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Calendar;
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
public static void main(String[] args) { new Main().AOJ0053(); }
void AOJ0053() {
ArrayList<Integer> primes = primeTable(1000000);
while (tru... | [["-", 0, 503, 49, 200, 51, 492, 3, 4, 0, 499], ["+", 0, 503, 49, 200, 51, 492, 3, 4, 0, 499]] | 3 | 309 | 2 |
#include <stdio.h>
int prime[10000], ptr = 0;
void prime_number(void) {
int i, j, flag;
prime[ptr++] = 2;
prime[ptr++] = 3;
for (i = 5; i <= 1119; i += 2) {
flag = 0;
for (j = 1; prime[j] * prime[j] <= i; j++) {
if (i % prime[j] == 0) {
flag = 1;
break;
}
}
if (!flag)... | #include <stdio.h>
int prime[11111], ptr = 0;
void prime_number(void) {
int i, j, flag;
prime[ptr++] = 2;
prime[ptr++] = 3;
for (i = 5; ptr <= 10474; i += 2) {
flag = 0;
for (j = 1; prime[j] * prime[j] <= i; j++) {
if (i % prime[j] == 0) {
flag = 1;
break;
}
}
if (!fl... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 0 | 208 | 6 |
#include <stdio.h>
#define MAX 10000000
int main(int argc, const char *argv[]) {
int t[MAX], n, i, j, k, sum = 0, count = 0;
for (i = 0; i < MAX; i++) {
t[i] = 1;
}
t[0] = t[1] = 0;
for (i = 2; i * i < MAX; i++) {
if (t[i] == 1) {
for (j = i * i; j < MAX; j += i) {
t[j] = 0;
}
... | #include <stdio.h>
#define MAX 1000000
int main(int argc, const char *argv[]) {
int t[MAX], n, i, j, k, sum = 0, count = 0;
for (i = 0; i < MAX; i++) {
t[i] = 1;
}
t[0] = t[1] = 0;
for (i = 2; i * i < MAX; i++) {
if (t[i] == 1) {
for (j = i * i; j < MAX; j += i) {
t[j] = 0;
}
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 215 | 2 |
#include <stdio.h>
int p[10000], n = 2, i, j;
int main() {
*p = 2;
for (; i < 10000;)
for (;;) {
a:
n++;
for (j = 0; p[j] * p[j] <= n; j++)
if (n % p[j] == 0)
goto a;
p[++i] = n;
break;
}
for (i = 1; i < 10000; i++)
p[i] += p[i - 1];
for (;;) {
scan... | #include <stdio.h>
int p[10000], n = 2, i, j;
int main() {
*p = 2;
for (; i < 10000;)
for (;;) {
a:
n++;
for (j = 0; p[j] * p[j] <= n; j++)
if (n % p[j] == 0)
goto a;
p[++i] = n;
break;
}
for (i = 1; i < 10000; i++)
p[i] += p[i - 1];
for (;;) {
scan... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 158 | 1 |
#include <stdio.h>
#define DATA 1000000
int prime[DATA];
void judge() {
int i, j;
for (i = 0; i < DATA; i++)
prime[i] = 0;
prime[0] = prime[1] = 1;
for (i = 2; i * i < DATA; i++) {
if (prime[i] == 0) {
for (j = 2 * i; j < DATA; j++) {
prime[j] = 1;
}
}
}
}
int main(void) ... | #include <stdio.h>
#define DATA 1000000
int prime[DATA];
void judge() {
int i, j;
for (i = 0; i < DATA; i++)
prime[i] = 0;
prime[0] = prime[1] = 1;
for (i = 2; i * i < DATA; i++) {
if (prime[i] == 0) {
for (j = 2 * i; j < DATA; j += i) {
prime[j] = 1;
}
}
}
}
int main(voi... | [["-", 0, 57, 64, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 57, 64, 9, 0, 7, 26, 11, 17, 107], ["+", 0, 57, 64, 9, 0, 7, 26, 11, 12, 22]] | 0 | 199 | 3 |
#include <stdio.h>
int main() {
int i, j, n, prime[2000000] = {}, c;
long long int sum;
prime[0] = prime[1] = 1;
for (i = 2; i < 40; i++) {
if (prime[i] != 1) {
for (j = 2 * i; j < 50000; j += i) {
prime[j] = 1;
}
}
}
while (scanf("%d", &n) && n) {
c = 0;
sum = 0;
f... | #include <stdio.h>
int main() {
int i, j, n, prime[200000] = {}, c;
long long int sum;
prime[0] = prime[1] = 1;
for (i = 2; i < 200000; i++) {
if (prime[i] != 1) {
for (j = 2 * i; j < 200000; j += i) {
prime[j] = 1;
}
}
}
while (scanf("%d", &n) && n) {
c = 0;
sum = 0;
... | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, ... | 0 | 171 | 8 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count, n;
while (sc.hasNext()) {
n = sc.nextInt();
count = 0;
if (n == 0)
break;
while (5 < n) {
n /= 5;
count += n;
}
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count, n;
while (true) {
n = sc.nextInt();
count = 0;
if (n == 0)
break;
while (4 < n) {
n /= 5;
count += n;
}
System.... | [["-", 8, 196, 0, 52, 15, 15, 0, 492, 500, 22], ["-", 8, 196, 0, 52, 15, 15, 0, 492, 0, 131], ["-", 8, 196, 0, 52, 15, 15, 0, 492, 141, 22], ["-", 0, 52, 15, 15, 0, 492, 3, 4, 0, 24], ["-", 0, 52, 15, 15, 0, 492, 3, 4, 0, 25], ["+", 0, 195, 8, 196, 0, 52, 15, 15, 0, 146], ["-", 8, 196, 0, 52, 15, 15, 0, 16, 31, 499], [... | 3 | 95 | 8 |
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
while (true) {
int n = in.nextInt();
if (n == 0)
break;
int sum = 0;
for (int i = 5; i < n; i *= 5)
sum += n / i;
System.out.println(sum);
... | import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
while (true) {
int n = in.nextInt();
if (n == 0)
break;
int sum = 0;
for (int i = 5; i <= n; i *= 5)
sum += n / i;
System.out.println(sum);
... | [["-", 0, 52, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 93 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
long long int n, t, i;
while (0 <= scanf("%lld", &n)) {
if (n == 0)
break;
t = 0;
for (i = 1; (long long int)pow(5, i) < n; i++) {
if (n / (long long int)pow(5, i) >= 1) {
t += (long long int)(n / ((long long int)pow(5, i)));
... | #include <math.h>
#include <stdio.h>
int main() {
long long int n, t, i;
while (0 <= scanf("%lld%*c", &n)) {
if (n == 0)
break;
t = 0;
for (i = 1; (long long int)pow(5, i) <= n; i++) {
if (n / (long long int)pow(5, i) >= 1) {
t += (long long int)(n / ((long long int)pow(5, i)));
... | [["-", 0, 16, 12, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 16, 12, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 130 | 4 |
c, n;
main(r) {
for (; r = scanf("%d", &n), n; printf("%d\n", c))
for (c = 0; n /= 5; c += n % 5 * r / 4)
r *= 5;
return 0;
} | c, n;
main(r) {
for (; r = scanf("%d", &n), n; printf("%d\n", c))
for (c = 0; n /= 5; c += n % 5 * (r / 4))
r *= 5;
return 0;
} | [["+", 8, 7, 26, 11, 12, 16, 12, 23, 0, 24], ["+", 8, 7, 26, 11, 12, 16, 12, 23, 0, 25]] | 0 | 64 | 2 |
#include <stdio.h>
int main(void) {
long n;
long divisor, multiple;
while (1) {
scanf("%ld", &n);
if (n == 0)
return 0;
divisor = 5;
multiple = 0;
while (divisor < n) {
multiple += n / divisor;
divisor = divisor * 5;
}
printf("%ld\n", multiple);
}
return... | #include <stdio.h>
int main(void) {
long n;
long divisor, multiple;
while (1) {
scanf("%ld", &n);
if (n == 0)
return 0;
divisor = 5;
multiple = 0;
while (divisor <= n) {
multiple += n / divisor;
divisor = divisor * 5;
}
printf("%ld\n", multiple);
}
retur... | [["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 19]] | 0 | 83 | 2 |
#include <stdio.h>
#include <string.h>
int main() {
int i, five, ans;
do {
scanf("%d", &i);
if (i == 0)
break;
for (five = 5, ans = 0; five < i; five *= 5)
ans += i / five;
printf("%d\n", ans);
} while (1);
return 0;
} | #include <stdio.h>
#include <string.h>
int main() {
int i, five, ans;
do {
scanf("%d", &i);
if (i == 0)
break;
for (five = 5, ans = 0; five <= i; five *= 5)
ans += i / five;
printf("%d\n", ans);
} while (1);
return 0;
} | [["-", 0, 82, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 82, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 80 | 2 |
#include <stdio.h>
int main() {
int input;
int i, ans, power5;
while (1) {
scanf("%d", &input);
if (input == 0)
break;
ans = 0;
power5 = 1;
for (i = 1; (power5 *= 5) <= input; i++) {
ans += input / power5;
}
printf("%d", ans);
}
return 0;
} | #include <stdio.h>
int main() {
int input;
int i, ans, power5;
while (1) {
scanf("%d", &input);
if (input == 0)
break;
ans = 0;
power5 = 1;
for (i = 1; (power5 *= 5) <= input; i++) {
ans += input / power5;
}
printf("%d\n", ans);
}
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 87 | 1 |
#include <iostream>
using namespace std;
int main() {
int t;
while (cin >> t) {
int res = 0;
for (int i = 5; i <= t; i *= 5) {
res += t / i;
}
cout << res << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int t;
while (cin >> t, t) {
int res = 0;
for (int i = 5; i <= t; i *= 5) {
res += t / i;
}
cout << res << endl;
}
return 0;
} | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 60 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (n == 0)
break;
int cnt = 0;
for (int i = 5; i < n; i *= 5) {
cnt += n / i;
}
cou... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (n == 0)
break;
int cnt = 0;
for (int i = 5; i <= n; i *= 5) {
cnt += n / i;
}
co... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 79 | 2 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = ... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 152 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define PUSH(n, v) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define PUSH(n, v) ... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 145 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
int co = 0;
while (cin >> n) {
while (n > 4) {
n /= 5;
co += n;
}
cout << co << endl;
co = 0;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
int co = 0;
while (cin >> n && n != 0) {
while (n > 4) {
n /= 5;
co += n;
}
cout << co << endl;
co = 0;
}
return 0;
} | [["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 57 | 4 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#def... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#def... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 292 | 2 |
#include <stdio.h>
int max(int a, int b) {
if (a > b)
return a;
return b;
}
int main() {
int n, a, b, temp;
while (1) {
scanf("%d", &n);
if (n == 0)
return 0;
a = b = 0;
for (int i = 2; i < n; i++) {
temp = i;
while (temp % 2 == 0) {
temp /= 2;
a++;
}
... | #include <stdio.h>
int min(int a, int b) {
if (a < b)
return a;
return b;
}
int main() {
int n, a, b, temp;
while (1) {
scanf("%d", &n);
if (n == 0)
return 0;
a = b = 0;
for (int i = 2; i <= n; i++) {
temp = i;
while (temp % 2 == 0) {
temp /= 2;
a++;
}... | [["-", 36, 36, 0, 30, 0, 14, 49, 53, 49, 22], ["+", 36, 36, 0, 30, 0, 14, 49, 53, 49, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 1, 0, 2... | 1 | 140 | 8 |
#include <iostream>
using namespace std;
int main() {
int n, m, a, i;
while (cin >> n) {
for (a = i = 0, m = 5; i < 13; i++, m *= 5) {
a += n / m;
}
cout << a << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n, m, a, i;
while (cin >> n, n) {
for (a = i = 0, m = 5; i < 13; i++, m *= 5) {
a += n / m;
}
cout << a << endl;
}
} | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 66 | 2 |
#include <iostream>
using namespace std;
int judge(int num) {
int count = 0;
int n = 5;
while (n < num) {
count += num / n;
n = n * 5;
}
return count;
}
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
cout << judge(n) << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int judge(int num) {
int count = 0;
int n = 5;
while (n <= num) {
count += num / n;
n = n * 5;
}
return count;
}
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
cout << judge(n) << endl;
}
return 0;
} | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19]] | 1 | 84 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
while (cin >> n) {
if (n <= 4)
cout << 0 << endl;
else {
int sum = 0;
for (ll i = 5; i <= n; i *= 5) {
sum += n / i;
}
cout << sum << endl;
}... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
while (cin >> n && n != 0) {
if (n <= 4)
cout << 0 << endl;
else {
int sum = 0;
for (ll i = 5; i <= n; i *= 5) {
sum += n / i;
}
cout << sum << e... | [["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 84 | 4 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
scanf("%d\n", &n);
if (n == 0)
... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
scanf("%d\n", &n);
if (n == 0)
... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20]] | 1 | 96 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
while (true) {
int n, m, c2 = 0, c5 = 0;
cin >> n;
if (cin.eof())
break;
for (int i = 1; i <= n; i++) {
m = i;
while (m % 2 == 0) {
m /= 2;
c2++;
}
while (m % 5 == 0) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
while (true) {
int n, m, c2 = 0, c5 = 0;
cin >> n;
if (n == 0)
break;
for (int i = 1; i <= n; i++) {
m = i;
while (m % 2 == 0) {
m /= 2;
c2++;
}
while (m % 5 == 0) {
m... | [["-", 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 | 116 | 8 |
#include <iostream>
using namespace std;
long long int fact5(long long int n) { return (n == 1) ? 5 : 5 * fact5(n - 1); }
int main() {
long long int n;
while (cin >> n) {
if (n == 0)
break;
int ans = 0;
for (int i = 1; fact5(i) < n; i++) {
ans += (n / fact5(i));
}
cout << ans << end... | #include <iostream>
using namespace std;
long long int fact5(long long int n) { return (n == 1) ? 5 : 5 * fact5(n - 1); }
int main() {
long long int n;
while (cin >> n) {
if (n == 0)
break;
int ans = 0;
for (int i = 1; fact5(i) <= n; i++) {
ans += (n / fact5(i));
}
cout << ans << en... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 107 | 2 |
#include <iostream>
int main() {
int n;
while (1) {
std::cin >> n;
if (!n)
break;
int ans = 0;
while (n > 5) {
ans += n / 5;
n /= 5;
}
std::cout << ans << std::endl;
}
return 0;
} | #include <iostream>
int main() {
int n;
while (1) {
std::cin >> n;
if (!n)
break;
int ans = 0;
while (n >= 5) {
ans += n / 5;
n /= 5;
}
std::cout << ans << std::endl;
}
return 0;
} | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20]] | 1 | 66 | 2 |
#include <iostream>
#include <vector>
using namespace std;
void solve() {
int num;
while (cin >> num) {
if (num == 0) {
break;
}
int multipleOfFive = 5;
vector<int> Vec;
while (num > multipleOfFive) {
Vec.push_back(multipleOfFive);
multipleOfFive *= 5;
}
int ans = 0;
... | #include <iostream>
#include <vector>
using namespace std;
void solve() {
int num;
while (cin >> num) {
if (num == 0) {
break;
}
int multipleOfFive = 5;
vector<int> Vec;
while (num >= multipleOfFive) {
Vec.push_back(multipleOfFive);
multipleOfFive *= 5;
}
int ans = 0;... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20]] | 1 | 120 | 2 |
#include <iostream>
using namespace std;
int main() {
int in;
while (cin >> in, !cin.eof()) {
int ans = 0, buf = in;
while (buf >= 5) {
buf /= 5;
ans += buf;
}
cout << ans << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int in;
while (cin >> in, in != 0) {
int ans = 0, buf = in;
while (buf >= 5) {
buf /= 5;
ans += buf;
}
cout << ans << endl;
}
return 0;
} | [["-", 0, 52, 15, 339, 51, 34, 12, 91, 17, 111], ["-", 51, 34, 12, 91, 28, 2, 63, 118, 28, 22], ["-", 51, 34, 12, 91, 28, 2, 63, 118, 17, 131], ["-", 51, 34, 12, 91, 28, 2, 63, 118, 119, 120], ["-", 51, 34, 12, 91, 28, 2, 3, 4, 0, 24], ["-", 51, 34, 12, 91, 28, 2, 3, 4, 0, 25], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 31,... | 1 | 64 | 9 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
vector<int> zeronum;
zeronum.push_back(0);
int count = 0;
for (int i = 1; i <= 10000; i++) {
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
vector<int> zeronum;
zeronum.push_back(0);
int count = 0;
for (int i = 1; i <= 20000; i++) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 122 | 2 |
#include <iostream>
using namespace std;
int main(void) {
long long int n;
while (cin >> n, n) {
long long int ans = 0;
for (long long int i = 5; i < n; i *= 5)
ans += n / i;
cout << ans << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long long int n;
while (cin >> n, n) {
long long int ans = 0;
for (long long int i = 5; i <= n; i *= 5)
ans += n / i;
cout << ans << endl;
}
return 0;
} | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 67 | 2 |
#include <iostream>
using namespace std;
int main() {
long get;
int sum = 0;
while (cin >> get) {
if (get == 0)
break;
int tmp = 0;
for (int i = 5; i < get; i *= 5) {
tmp = get % i;
sum += ((get - tmp) / i);
}
cout << sum << endl;
sum = 0;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
long get;
int sum = 0;
while (cin >> get) {
if (get == 0)
break;
int tmp = 0;
for (int i = 5; i <= get; i *= 5) {
tmp = get % i;
sum += ((get - tmp) / i);
}
cout << sum << endl;
sum = 0;
}
return 0;
} | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 89 | 2 |
#include <iostream>
using namespace std;
int main() {
long get;
while (cin >> get) {
if (get == 0)
break;
int sum = 0;
for (int i = 5; i < get; i *= 5) {
sum += (get / i);
}
cout << sum << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
long get;
while (cin >> get) {
if (get == 0)
break;
int sum = 0;
for (int i = 5; i <= get; i *= 5) {
sum += (get / i);
}
cout << sum << endl;
}
return 0;
} | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 70 | 2 |
// include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef pair<int, int> pii;
typedef ... | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef pair<int, int> pii;
typedef ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 418 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string in;
getline(cin, in);
for (int i = 0; i < in.size() - 4; i++) {
if (in[i] == 'a' && in[i + 1] == 'p' && in[i + 2] == 'p' &&
in[i + 3] == 'l' && in[i + 4] == 'e') {
in[i] = 'p';
in[i + 1] = 'e';
in[i + 2]... | #include <iostream>
#include <string>
using namespace std;
int main() {
string in;
getline(cin, in);
for (int i = 0; i < in.size() - 4; i++) {
if (in[i] == 'a' && in[i + 1] == 'p' && in[i + 2] == 'p' &&
in[i + 3] == 'l' && in[i + 4] == 'e') {
in[i] = 'p';
in[i + 1] = 'e';
in[i + 2]... | [["-", 0, 57, 64, 9, 0, 1, 0, 16, 17, 60], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32]] | 1 | 276 | 2 |
ap, pa, a, p = 'apple', 'pech', 'a' * 10000, 'p' * 10000
puts gets.sub(ap, a).sub(pa, p).sub(a, pa).sub(p, ap) | ap, pa, a, p = 'apple', 'peach', 'a' * 10000, 'p' * 10000
puts gets.gsub(ap, a).gsub(pa, p).gsub(a, pa).gsub(p, ap) | [["-", 0, 493, 0, 662, 12, 762, 0, 557, 0, 6], ["+", 0, 493, 0, 662, 12, 762, 0, 557, 0, 6], ["-", 0, 652, 486, 652, 486, 652, 486, 652, 735, 22], ["+", 0, 652, 486, 652, 486, 652, 486, 652, 735, 22], ["-", 3, 4, 0, 652, 486, 652, 486, 652, 735, 22], ["+", 3, 4, 0, 652, 486, 652, 486, 652, 735, 22], ["-", 0, 652, 3, 4,... | 4 | 57 | 10 |
text = gets.chomp
offset = 0
loop do
a = text.index("apple", offset)
b = text.index("peach", offset)
if a && b
if a < b
offset = a + 1
text[a,5] = "peach"
else
offset = b + 1
text[a,5] = "apple"
end
elsif a
text[a,5] = "peach"
offset = a + 1
elsif b
text[b,5] ... | text = gets.chomp
offset = 0
loop do
a = text.index("apple", offset)
b = text.index("peach", offset)
if a && b
if a < b
offset = a + 1
text[a,5] = "peach"
else
offset = b + 1
text[b,5] = "apple"
end
elsif a
text[a,5] = "peach"
offset = a + 1
elsif b
text[b,5] ... | [["-", 0, 121, 75, 95, 0, 662, 31, 742, 0, 22], ["+", 0, 121, 75, 95, 0, 662, 31, 742, 0, 22]] | 4 | 114 | 2 |
string=input()
print(string)
string1=string.replace('peach','tmp')
string2=string1.replace('apple','peach')
string3=string2.replace('tmp','apple')
print(string3) | string=input()
string1=string.replace('peach','tmp')
string2=string1.replace('apple','peach')
string3=string2.replace('tmp','apple')
print(string3) | [["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 55 | 4 |
ans = []
for word in input().split():
if "apple" in word:
ans.append(word.replace("apple", "peach"))
elif "peach" in word:
ans.append(word.replace("peach", "apple"))
else:
ans.append(word)
print(*word) | ans = []
for word in input().split():
if "apple" in word:
ans.append(word.replace("apple", "peach"))
elif "peach" in word:
ans.append(word.replace("peach", "apple"))
else:
ans.append(word)
print(*ans) | [["-", 0, 1, 0, 652, 3, 4, 0, 661, 0, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 661, 0, 22]] | 5 | 76 | 2 |
s = input().split()
ss = []
for w in s:
a = w.find('apple')
p = w.find('peach')
if a != -1:
w = w.replace('apple','peach')
elif p != -1:
w = w.replace('peach','apple')
ss.append(word)
print(' '.join(ss)) | s = input().split()
ss = []
for w in s:
a = w.find('apple')
p = w.find('peach')
if a != -1:
w = w.replace('apple','peach')
elif p != -1:
w = w.replace('peach','apple')
ss.append(w)
print(' '.join(ss)) | [["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 95 | 2 |
inp = input()
tmp = inp.replace("apple", "XXX")
tmp = tmp.replace("pearch", "apple")
print(tmp.replace("XXX", "peach"))
| inp = input()
tmp = inp.replace("apple", "XXX")
tmp = tmp.replace("peach", "apple")
print(tmp.replace("XXX", "peach"))
| [["-", 0, 662, 12, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 662, 12, 652, 3, 4, 0, 557, 0, 6]] | 5 | 48 | 2 |
a="apple"
b="peach"
s=input()[:-1].replace(a,"X").replace(b,a).replace("X",b)
print(s) | a="apple"
b="peach"
s=input().replace(a,"X").replace(b,a).replace("X",b)
print(s) | [["-", 63, 319, 500, 652, 63, 319, 500, 206, 0, 70], ["-", 500, 652, 63, 319, 500, 206, 206, 663, 0, 102], ["-", 63, 319, 500, 206, 206, 663, 0, 664, 17, 33], ["-", 63, 319, 500, 206, 206, 663, 0, 664, 28, 612], ["-", 63, 319, 500, 652, 63, 319, 500, 206, 0, 73]] | 5 | 49 | 5 |
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = (input.trim()).split("\n");
var AL = Arr.shift();
for (var i = 0; i < AL; i++) {
var arr = Arr[i].split("").map(Number);
arr.sort(function(a, b) { return b - a; });
var a = arr.join("");
arr.sort(function(a, b) { return a - b; });
var b =... | var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = (input.trim()).split("\n");
var AL = Arr.shift();
for (var i = 0; i < AL; i++) {
var arr = Arr[i].split("").map(Number);
arr.sort(function(a, b) { return b - a; });
var a = arr.join("");
arr.sort(function(a, b) { return a - b; });
var b =... | [["-", 0, 2, 3, 3, 0, 2, 3, 3, 0, 25], ["+", 3, 3, 0, 16, 31, 2, 3, 3, 0, 555], ["+", 3, 3, 0, 16, 31, 2, 3, 3, 0, 25], ["+", 0, 1, 0, 2, 3, 3, 0, 16, 17, 33], ["+", 3, 3, 0, 16, 12, 2, 3, 3, 0, 21], ["+", 3, 3, 0, 16, 12, 2, 3, 3, 0, 555]] | 2 | 158 | 6 |
import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = null;
try {
sc = new Scanner(System.in);
int dataSet = 0;
char[] num = new char[8];
Integer max = 0;
Integer min = 0;
Integer result = 0;
while ... | import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = null;
try {
sc = new Scanner(System.in);
int dataSet = 0;
char[] num = new char[8];
Integer max = 0;
Integer min = 0;
Integer result = 0;
while ... | [["-", 0, 52, 8, 196, 0, 7, 8, 196, 0, 46], ["+", 0, 52, 8, 196, 0, 7, 8, 196, 0, 46]] | 3 | 276 | 2 |
import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = null;
try {
sc = new Scanner(System.in);
while (sc.hasNextInt()) {
int dataSetRows = sc.nextInt();
for (int i = 0; i < dataSetRows; i++) {
String origin... | import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = null;
try {
sc = new Scanner(System.in);
while (sc.hasNextInt()) {
int dataSetRows = sc.nextInt();
for (int i = 0; i < dataSetRows; i++) {
String origin... | [["-", 8, 196, 0, 503, 49, 200, 51, 16, 31, 22], ["-", 8, 196, 0, 503, 49, 200, 51, 16, 17, 33], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 17, 33], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 12, 22]] | 3 | 257 | 4 |
import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int num[] = new int[8];
for (int i = 0; i < n; i++) {
int max = 0, min = 0;
String str = sc.next();
for (int j = 0; j < ... | import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int num[] = new int[8];
for (int i = 0; i < n; i++) {
int max = 0, min = 0;
String str = sc.next();
for (int j = 0; j < ... | [["-", 12, 16, 12, 492, 3, 4, 0, 16, 17, 72], ["-", 12, 16, 12, 492, 3, 4, 0, 16, 12, 499], ["-", 12, 16, 12, 492, 3, 4, 0, 16, 31, 499], ["+", 12, 16, 12, 492, 3, 4, 0, 16, 31, 499], ["-", 0, 492, 3, 4, 0, 11, 12, 16, 17, 85], ["-", 0, 492, 3, 4, 0, 11, 12, 16, 12, 499]] | 3 | 205 | 6 |
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
String out = "";
for (int ii = 0; ii < n; ii++) {
String str = scanner.next();
List<String> ascs = new ArrayList<String>();
List<String> des... | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
String out = "";
for (int ii = 0; ii < n; ii++) {
String str = scanner.next();
List<String> ascs = new ArrayList<String>();
List<String> des... | [["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 25], ["+", 8, 196, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 1, 0, 11, 12, 16, 12, 5, 0, 62], ["+", 0, 1, 0, 11, 12, 16, 12, 5, 0, 44]] | 3 | 250 | 6 |
#include <stdio.h>
int main() {
int n, h, i, j, tmp, max, min;
int num[8];
scanf("%d", &n);
for (h = 0; h < n; h++) {
for (i = 0; i < 8; i++) {
num[i] = 0;
scanf("%1d", &num[i]);
}
for (i = 0; i < 7; i++) {
for (j = 7; j > i; j--) {
if (num[j] > num[j - 1]) {
t... | #include <stdio.h>
int main() {
int n, h, i, j, tmp, max, min;
int num[8];
scanf("%d", &n);
for (h = 0; h < n; h++) {
for (i = 0; i < 8; i++) {
num[i] = 0;
scanf("%1d", &num[i]);
}
for (i = 0; i < 7; i++) {
for (j = 7; j > i; j--) {
if (num[j] > num[j - 1]) {
t... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 252 | 2 |
#include <stdio.h>
int main() {
int count[10], n, i, j, x, y, max, min;
char ch;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < 10; j++)
count[j] = 0;
max = 0;
min = 0;
x = 10000000;
y = 1;
for (j = 0; j < 8; j++) {
scanf("%c", &ch);
count[ch - '0']++;
... | #include <stdio.h>
int main() {
int count[10], n, i, j, x, y, max, min;
char ch;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < 10; j++)
count[j] = 0;
max = 0;
min = 0;
x = 10000000;
y = 1;
for (j = 0; j <= 8; j++) {
scanf("%c", &ch);
count[ch - '0']++;
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 196 | 2 |
#include <stdio.h>
int convert(char *s) {
int n = 10000000;
int i, num = 0;
for (i = 0; i < 8; i++) {
num += (int)(*(s + i) - '0') * n;
n /= 10;
}
return num;
}
void sort(char *data, int muki) {
int i, j;
char tmp;
for (i = 0; i < 7; i++) {
for (j = i + 1; j > 0; j--) {
if (muki == ... | #include <stdio.h>
int convert(char *s) {
int n = 10000000;
int i, num = 0;
for (i = 0; i < 8; i++) {
num += (int)(*(s + i) - '0') * n;
n /= 10;
}
return num;
}
void sort(char *data, int muki) {
int i, j;
char tmp;
for (i = 0; i < 7; i++) {
for (j = i + 1; j > 0; j--) {
if (muki == ... | [["-", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 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, 22]] | 0 | 350 | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
vector<int> a;
for (int j = 0; j < s.size(); j++)
a.push_back(s[i] - '0');
sort(a.begin(), a.end());
int mi = 0, ma = 0;
for (int j = 0; j < s.size(); j+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
vector<int> a;
for (int j = 0; j < s.size(); j++)
a.push_back(s[j] - '0');
sort(a.begin(), a.end());
int mi = 0, ma = 0;
for (int j = 0; j < s.size(); j+... | [["-", 3, 4, 0, 16, 31, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 31, 69, 341, 342, 0, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 11, 12, 69, 341, 342, 0, 16, 12, 22], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 12, 22], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1... | 1 | 165 | 10 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int ret[8];
cin >> n;
while (n-- > 0) {
string s;
cin >> s;
for (int i = 0; i < 8; i++)
ret[i] = s[i - '0'];
int Min = 0, Max = 0;
sort(ret, ret + 8);
for (int i = ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int ret[8];
cin >> n;
while (n-- > 0) {
string s;
cin >> s;
for (int i = 0; i < 8; i++)
ret[i] = s[i] - '0';
int Min = 0, Max = 0;
sort(ret, ret + 8);
for (int i = ... | [["+", 0, 11, 12, 16, 31, 69, 341, 342, 0, 73], ["-", 8, 1, 0, 11, 12, 69, 341, 342, 0, 73]] | 1 | 171 | 2 |
#include <stdio.h>
#define N 8
int main(void) {
int dt[N];
char str[N];
long max, min;
int n, tmp;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
max = min = 0;
// input
scanf("%s", str);
for (int j = 0; j < N; j++)
dt[j] = str[j] - '0';
// sort
for (int j = 0; j < N; j++) {... | #include <stdio.h>
#define N 8
int main(void) {
int dt[N];
char str[N];
long max, min;
int n, tmp;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
max = min = 0;
// input
scanf("%s", str);
for (int j = 0; j < N; j++)
dt[j] = str[j] - '0';
// sort
for (int j = 0; j < N; j++) {... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 240 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
scanf("%d ", &N);
for (int i = 0; i < N; i++) {
char num[8];
for (int j = 0; j < 8; j++) {
scanf("%c", &num[j]);
num[j] = num[j] - '0';
}
vector<int> v(8);
for (in... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
scanf("%d ", &N);
for (int i = 0; i < N; i++) {
char num[8];
for (int j = 0; j < 8; j++) {
scanf("%c ", &num[j]);
num[j] = num[j] - '0';
}
vector<int> v(8);
for (i... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 50, ... | 1 | 226 | 8 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int n, i;
char c[9], mx[9] = "", mn[9] = "";
while (cin >> n) {
if (cin.eof())
return 0;
for (i = 0; i < n; i++) {
scanf("%s", &c);
strcpy(mx, c);
s... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int n, i;
char c[9], mx[9] = "", mn[9] = "";
while (cin >> n) {
if (cin.eof())
return 0;
for (i = 0; i < n; i++) {
scanf("%s", &c);
strcpy(mx, c);
s... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 150 | 1 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <sstream>
#include <vector>
using namespace std;
int main() {
vector<int> Num;
int Max, Min;
int n, i, l, num, z;
cin >> n;
for (i = 0; i < n; i++) {
cin >> num;
while (num > 0) {
z = num - (... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <sstream>
#include <vector>
using namespace std;
int main() {
vector<int> Num;
int Max, Min;
int n, i, l, num, z;
cin >> n;
for (i = 0; i < n; i++) {
cin >> num;
while (num > 0) {
z = num - (... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 283 | 6 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string s;
int a, b;
while (n--) {
cin >> s;
sort(s.begin(), s.end());
a = atoi(s.c_str());
reverse(s.begin(), s.end());
b = atoi(s.c_str());
cout << b - a << endl;
}
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string s;
int a, b;
cin >> n;
while (n--) {
cin >> s;
sort(s.begin(), s.end());
a = atoi(s.c_str());
reverse(s.begin(), s.end());
b = atoi(s.c_str());
cout << b - a <<... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 103 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 184 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <sstream>
#include <vector>
#define INF 999999
using namespace std;
int main() {
stringstream ss;
int N;
cin >> N;
while (N--) {
int NUM1, NUM2;
char C[15];
cin >> NUM1;
ss << NUM1;
ss >> C;
sort(C, C ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <sstream>
#include <vector>
#define INF 999999
using namespace std;
int main() {
int N;
cin >> N;
while (N--) {
stringstream ss;
int NUM1, NUM2;
char C[15];
cin >> NUM1;
ss << NUM1;
ss >> C;
sort(C, ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 78], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 49, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35]] | 1 | 132 | 6 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
for (int t = 0; t < n; t++) {
// priority_queue<int, vector<int> > max;
// priority_queue<int, vector<int>, greater<int> > min;
string num... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
for (int t = 0; t < n; t++) {
// priority_queue<int, vector<int> > max;
// priority_queue<int, vector<int>, greater<int> > min;
string num... | [["+", 3, 4, 0, 74, 51, 23, 0, 16, 17, 33], ["+", 3, 4, 0, 74, 51, 23, 0, 16, 12, 13]] | 1 | 218 | 2 |
for i in 1..gets.to_i
s=gets.split(//).map(&:to_i)
min=s.sort!
max=s.reverse
puts max.join.to_i-min.join.to_i
end | for i in 1..gets.to_i
s=gets.chomp.split(//).map(&:to_i)
min=s.sort!
max=s.reverse
puts max.join.to_i-min.join.to_i
end | [["+", 0, 662, 12, 652, 486, 652, 486, 652, 735, 22], ["+", 8, 170, 0, 662, 12, 652, 486, 652, 17, 131]] | 4 | 46 | 2 |
i = int(input())
while (i):
i -= 1
st = []
n = input()
for s in n:
st.append(s)
st.sort()
a = int("".join())
b = int("".join(st[::-1]))
print(b - a) | i = int(input())
while (i):
i -= 1
st = []
n = input()
for s in n:
st.append(s)
st.sort()
a = int("".join(st))
b = int("".join(st[::-1]))
print(b - a) | [["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22]] | 5 | 76 | 1 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
static int[] ints = new int[10];
public static void main2(String[] args) throws IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
while (true) {
... |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
static int[] ints = new int[10];
public static void main2(String[] args) throws IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
while (true) {
... | [["-", 0, 52, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 267 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
StringBuilder builde... |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
StringBuilder builde... | [["-", 0, 52, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 130 | 2 |
<?php
while ($first = trim(fgets(STDIN))) {
seq_sum($first);
}
function seq_sum($first) {
$sum = $first;
$prev = $first;
for ($i = 2; $i <= 10; $i++) {
if ($i % 2 == 0) {
$prev *= 2;
} else {
$prev /= 3;
}
$sum += $prev;
}
echo $prev . "\n";
} | <?php
while ($first = trim(fgets(STDIN))) {
seq_sum($first);
}
function seq_sum($first) {
$sum = $first;
$prev = $first;
for ($i = 2; $i <= 10; $i++) {
if ($i % 2 == 0) {
$prev *= 2;
} else {
$prev /= 3;
}
$sum += $prev;
}
echo $sum . "\n";
} | [["-", 8, 9, 0, 608, 0, 16, 31, 606, 0, 141], ["+", 8, 9, 0, 608, 0, 16, 31, 606, 0, 141]] | 6 | 98 | 2 |
import java.util.Scanner;
public class Main {
static Scanner sc = new java.util.Scanner(System.in);
public static void main(String[] args) {
while (sc.hasNext()) {
double a = sc.nextInt();
double a2 = a * 2;
double a3 = a2 / 3;
double a4 = a3 * 2;
double a5 = a4 / 3;
dou... | import java.util.Scanner;
public class Main {
static Scanner sc = new java.util.Scanner(System.in);
public static void main(String[] args) {
while (sc.hasNext()) {
double a = sc.nextDouble();
double a2 = a * 2;
double a3 = a2 / 3;
double a4 = a3 * 2;
double a5 = a4 / 3;
... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 154 | 2 |
import java.util.Scanner;
public class Main {
private Scanner sc;
public static void main(String[] args) { new Main(); }
public Main() {
sc = new Scanner(System.in);
while (sc.hasNextLine()) {
double d = Double.parseDouble(sc.nextLine());
double sum = d;
for (int i = 0; i < 4; i++) ... | import java.util.Scanner;
public class Main {
private Scanner sc;
public static void main(String[] args) { new Main(); }
public Main() {
sc = new Scanner(System.in);
while (sc.hasNextLine()) {
double d = Double.parseDouble(sc.nextLine());
double sum = d;
for (int i = 0; i < 4; i++) ... | [["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 139 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
double n = sc.nextDouble();
double[] a = new double[11];
a[0] = n;
double sum = n;
for (int i = 2; i <= 10; i++) {
if (i % 2... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
double n = sc.nextDouble();
double[] a = new double[11];
a[1] = n;
double sum = n;
for (int i = 2; i <= 10; i++) {
if (i % 2... | [["-", 8, 196, 0, 1, 0, 11, 31, 504, 71, 499], ["+", 8, 196, 0, 1, 0, 11, 31, 504, 71, 499]] | 3 | 150 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
double a;
while (scanf("%lf", &a) != -1) {
printf("%.7lf\n", a * 9 * (1 - 32 / 243));
}
return 0;
} | #include <math.h>
#include <stdio.h>
int main() {
double a;
while (scanf("%lf", &a) != -1) {
printf("%.7lf\n", a * 9 * (1 - 32.0 / 243));
}
return 0;
} | [["-", 0, 16, 12, 23, 0, 16, 12, 16, 31, 13], ["+", 0, 16, 12, 23, 0, 16, 12, 16, 31, 13]] | 0 | 52 | 2 |
#include <stdio.h>
int main(void) {
float num, sum = 0;
int i;
while (scanf("%f", &num) != EOF) {
sum = num;
sum += (num *= 2);
for (i = 0; i < 4; i++) {
sum += (num /= 3);
sum += (num *= 2);
}
printf("%f", sum);
}
return 0;
} | #include <stdio.h>
int main(void) {
double num, sum = 0;
int i;
while (scanf("%lf", &num) != EOF) {
sum = num;
sum += (num *= 2);
for (i = 0; i < 4; i++) {
sum += (num /= 3);
sum += (num *= 2);
}
printf("%.8lf\n", sum);
}
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 90 | 7 |
#include <stdio.h>
int main(void) {
long double a;
while (scanf("%lf", &a) != EOF) {
printf("%lf\n", a * 211 / 27);
}
return 0;
} | #include <stdio.h>
int main(void) {
double a;
while (scanf("%lf", &a) != EOF) {
printf("%.8lf\n", a * 211 / 27);
}
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 46 | 3 |
#include <stdio.h>
int main() {
double a;
scanf("%lf", &a);
printf("%.8lf\n", a * 211 / 27);
return 0;
} | #include <stdio.h>
int main() {
double a;
while (scanf("%lf", &a) != EOF)
printf("%.8lf\n", a * 211 / 27);
return 0;
} | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 23, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 79], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 52, 15, 23, 0, 25]] | 0 | 38 | 6 |
#include <stdio.h>
int main() {
float x;
while (scanf("%lf", &x) != EOF) {
printf("%12.f", 211 * x / 27);
}
return 0;
} | #include <stdio.h>
int main() {
double x;
while (scanf("%lf", &x) != EOF) {
printf("%f\n", 211 * x / 27);
}
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 43 | 5 |
main() {
float x;
while (scanf("%lf", &x) != -1) {
printf("%f\n", 211 * x / 27);
}
return 0;
} | main() {
double x;
while (scanf("%lf", &x) != -1) {
printf("%f\n", 211 * x / 27);
}
return 0;
} | [["-", 36, 36, 0, 30, 0, 9, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 9, 0, 43, 39, 40]] | 0 | 41 | 2 |
#include <stdio.h>
int main() {
long double a;
while (scanf("%lf", &a) != EOF) {
printf("%.8f\n", a * 211 / 27);
}
return 0;
} | #include <stdio.h>
int main() {
double a;
while (scanf("%lf", &a) != EOF) {
printf("%.8f\n", a * 211 / 27);
}
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 45 | 1 |
#include <algorithm>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#define INF 114514810
using namespace std;
long double num[10];
int main() {
while (cin) {
cin >> num[0];
long double sum = num[0];
int i;
for (... | #include <algorithm>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#define INF 114514810
using namespace std;
long double num[10];
int main() {
while (cin >> num[0]) {
long double sum = num[0];
int i;
for (i = 1; i... | [["-", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 8, 9, 0, 52, 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]] | 1 | 146 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <vector>
#define INF 100000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
typedef long long ll;
int main() {
int f;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <vector>
#define INF 100000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
typedef long long ll;
int main() {
double ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 158 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double a;
while (cin >> a) {
double S = a;
for (int i = 0; i < 9; i++) {
a = ((i & 1) ? a / 3 : a * 2);
S += a;
}
cout << S << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double a;
while (cin >> a) {
double S = a;
for (int i = 0; i < 9; i++) {
a = ((i & 1) ? a / 3 : a * 2);
S += a;
}
cout << setprecision(8) << S << endl;
}
return 0;
} | [["+", 0, 16, 31, 16, 31, 16, 12, 2, 63, 22], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 75 | 5 |
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
double a;
double s;
while (cin >> a) {
s = a;
for (int i = 0; i < 10; i++) {
if (i % 2 == 0)
a = a * 2;
else
a = a / 3;
s += a;
}
printf(... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
double a, b;
double s;
while (cin >> a) {
s = a;
for (int i = 2; i <= 10; i++) {
if (i % 2 == 0)
a = a * 2;
else
a = a / 3;
s += a;
}
pri... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 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 | 89 | 6 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
double a, s;
cin >> a;
s = a;
for (int i = 0; i < 9; i++) {
if (i % 2 == 0)
a *= 2;
else
a /= 3;
s += a;
}
printf("%.10f\n", s);
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
double a, s;
while (cin >> a) {
s = a;
for (int i = 0; i < 9; i++) {
if (i % 2 == 0)
a *= 2;
else
a /= 3;
s += a;
}
printf("%.10f\n", s);
}
return 0;
} | [["+", 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 | 77 | 6 |
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
double s[10], res;
cin >> s[0];
res = s[0];
for (int i = 1; i < 10; i++) {
if (i % 2 == 0) {
s[i] = s[i - 1] / 3;
} else {
s[i] = s[i - 1] * 2;
}
res += s[i];
}
cout << setprecision(10) << res << endl;
... | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double s[10], res;
while (cin >> s[0]) {
res = s[0];
for (int i = 1; i < 10; i++) {
if (i % 2 == 0) {
s[i] = s[i - 1] / 3;
} else {
s[i] = s[i - 1] * 2;
}
res += s[i];
}
cout << setprec... | [["+", 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 | 116 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double n;
while (cin >> n) {
cin >> n;
double now = n, sum = n;
for (int j = 0; j < 9; j++) {
if (j % 2 == 0) {
now = now * 2;
sum += now;
} else if (j % 2 == 1) {
now = now / 3;
sum += now;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
double n;
while (cin >> n) {
double now = n, sum = n;
for (int j = 0; j < 9; j++) {
if (j % 2 == 0) {
now = now * 2;
sum += now;
} else if (j % 2 == 1) {
now = now / 3;
sum += now;
}
}
printf... | [["-", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 17, 152], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 106 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
double s[11];
while (cin >> s[1]) {
for (int i = 2; i < 11; i++)
s[i] = ((i % 2 == 0) ? (s[i - 1] * 2) : (s[i - 1] / 3));
double sum = 0;
for (int i = 1; i < 11; i++)
sum += s[i];
printf("%.8lf", sum);
}
ret... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
double s[11];
while (cin >> s[1]) {
for (int i = 2; i < 11; i++)
s[i] = ((i % 2 == 0) ? (s[i - 1] * 2) : (s[i - 1] / 3));
double sum = 0;
for (int i = 1; i < 11; i++)
sum += s[i];
printf("%.8lf\n", sum);
}
r... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 121 | 1 |
#include <bitset>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double a;
while (scanf("%lf ", &a) == 1) {
int cur = a;
double sum = a;
for (int i = 0; i < 10; i++) {
if (i % 2 == 0) {
sum += cur * 2;
cur *= 2;
} else {
su... | #include <bitset>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double a;
while (scanf("%lf ", &a) == 1) {
double cur = a;
double sum = a;
for (int i = 0; i < 9; i++) {
if (i % 2 == 0) {
sum += cur * 2;
cur *= 2;
} else {
... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 109 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 170 | 3 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
double a;
while (cin >> a) {
double ans = 0;
ans += a;
for (int i = 2; i <= 10; i++) {
if (i % 2 == 0)
a *= 2;
else
a /= 3;
ans += a;
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
double a;
while (cin >> a) {
double ans = 0;
ans += a;
for (int i = 2; i <= 10; i++) {
if (i % 2 == 0)
a *= 2;
else
a /= 3;
ans += a;
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 91 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
double n, tmp, sum = 0;
while (scanf("%lf", &n) != EOF) {
sum = 0;
tmp = n;
for (int i = 0; i < 10; i++) {
if (i == 0) {
} else if (i % 2 == 1) {
tmp *= 2;
} else {
tmp /= 3;
}
sum += tm... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
double n, tmp, sum = 0;
while (scanf("%lf", &n) != EOF) {
sum = 0;
tmp = n;
for (int i = 1; i <= 10; i++) {
if (i == 1) {
} else if (i % 2 == 0) {
tmp *= 2;
} else {
tmp /= 3;
}
sum += t... | [["-", 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], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76... | 1 | 109 | 9 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 1)
cout << n * 2 << endl;
else
cout << (1 + n) * (n / 2) + 1 << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
double n;
while (cin >> n) {
if (n == 1)
cout << n * 2 << endl;
else
cout << (int)((1 + n) * (n / 2) + 1) << endl;
}
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 16, 31, 16, 12, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 16, 31, 16, 12, 74, 0, 25], ["+", 0, 16, 31, 16, 12, 74, 51, 23, 0, 24], ["+", 51, 23, 0, 16, 31, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 16, 12, 74, 51, 23, 0, 25]] | 1 | 59 | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << ((N + 1) * N / 2 + 1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N) {
cout << ((N + 1) * N / 2 + 1) << endl;
}
return 0;
} | [["+", 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 | 40 | 6 |
#include <stdio.h>
int main() {
int N;
int s = 1;
while (scanf("%d", &N) != EOF) {
for (int i = 0; i < N; i++)
s += i;
printf("%d\n", s);
s = 1;
}
return 0;
} | #include <stdio.h>
int main() {
int N;
int s = 1;
while (scanf("%d", &N) != EOF) {
for (int i = 0; i <= N; i++)
s += i;
printf("%d\n", s);
s = 1;
}
return 0;
} | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 67 | 2 |
#include <iostream>
using namespace std;
int a;
int main() {
while (cin >> a) {
cout << a * (a + 1) + 1 << endl;
}
} | #include <iostream>
using namespace std;
int a;
int main() {
while (cin >> a) {
cout << a * (a + 1) / 2 + 1 << endl;
}
} | [["+", 0, 16, 31, 16, 12, 16, 31, 16, 17, 85], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 13]] | 1 | 37 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
long int ans = 0;
for (int i = 0; i <= n; i++) {
ans += i;
}
cout << ans << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
long int ans = 1;
for (int i = 0; i <= n; i++) {
ans += i;
}
cout << ans << endl;
}
return 0;
} | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 58 | 2 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
vector<ll> vec;
vec[0] = 1;
for (int i = 1; i <= 10000; i++) {
vec[i] = vec[i - 1] + i;
}
int n;
while (cin >> n) {
cout << vec[n] << endl;
}
return 0;
}
// int main(){
// int n;
// while(c... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
vector<ll> vec(10001);
vec[0] = 1;
for (int i = 1; i <= 10000; i++) {
vec[i] = vec[i - 1] + i;
}
int n;
while (cin >> n) {
cout << vec[n] << endl;
}
return 0;
}
// int main(){
// int n;
// ... | [["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 24], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 25]] | 1 | 92 | 3 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
// int main(){
// vector<ll> vec(10001);
// vec.push_back(1);
// for(int i=1;i<=10000;i++){
// vec[i] = vec[i-1] + i;
// }
// int n;
// while(cin >> n){
// cout << vec[n] << endl;
// }
// return 0;
/... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
// int main(){
// vector<ll> vec(10001);
// vec[0] = 1;
// for(int i=1;i<=10000;i++){
// vec[i] = vec[i-1] + i;
// }
// int n;
// while(cin >> n){
// cout << vec[n] << endl;
// }
// return... | [["-", 31, 16, 31, 16, 12, 23, 0, 16, 17, 33], ["+", 31, 16, 31, 16, 12, 23, 0, 16, 17, 72]] | 1 | 61 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.