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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (true) {
int t, n, s, f;
int sum = 0;
cin >> t;
if (t == 0)
break;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> f >> s;
sum += (f - s);
}
if (sum >= t) {
c... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (true) {
int t, n, s, f;
int sum = 0;
cin >> t;
if (t == 0)
break;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s >> f;
sum += (f - s);
}
if (sum >= t) {
c... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 112 | 4 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int t, n, s, f, sum;
int main() {
while (1) {
sum = 0;
cin >> t;
if (t == 0) {
break;
}
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s >> f;
sum += f - s;
}
if (t >= ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int t, n, s, f, sum;
int main() {
while (1) {
sum = 0;
cin >> t;
if (t == 0) {
break;
}
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s >> f;
sum += f - s;
}
if (t <= ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 115 | 2 |
#include <cstdio>
using namespace std;
int main() {
int i, a, b;
for (i = 0; i < 7; i++) {
scanf("%d %d", &a, &b);
printf("%d", a - b);
}
return 0;
} | #include <cstdio>
using namespace std;
int main() {
int i, a, b;
for (i = 0; i < 7; i++) {
scanf("%d %d", &a, &b);
printf("%d\n", a - b);
}
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 61 | 1 |
#include <iostream>
using namespace std;
int main() {
int a, b;
for (int i = 0; i < 7; i++) {
cin >> a >> b;
cout << a - b;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b;
for (int i = 0; i < 7; i++) {
cin >> a >> b;
cout << a - b << endl;
}
} | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 45 | 2 |
#include <stdio.h>
int main() {
int x, y;
for (int i = 0; i < 7; i++) {
scanf("%d %d", &x, &y);
printf("%d", (x - y));
}
return 0;
} | #include <stdio.h>
int main() {
int x, y;
for (int i = 0; i < 7; i++) {
scanf("%d %d", &x, &y);
printf("%d\n", (x - y));
}
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 58 | 1 |
#include <stdio.h>
int main(void) {
int a, b, s, i;
for (i = 0; i < 7; i++) {
scanf("%d %d", &a, &b);
s = a - b;
printf("%d", s);
}
return 0;
}
| #include <stdio.h>
int main(void) {
int a, b, s, i;
for (i = 0; i < 7; i++) {
scanf("%d %d", &a, &b);
s = a - b;
printf("%d\n", s);
}
return 0;
}
| [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 64 | 1 |
#include <iostream>
using namespace std;
int main() {
int a, b;
for (int i = 0; i < 10; i++) {
cin >> a >> b;
a -= b;
cout << a << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b;
for (int i = 0; i < 7; i++) {
cin >> a >> b;
a -= b;
cout << a << endl;
}
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 49 | 2 |
#include <iostream>
using namespace std;
int main() {
for (int i = 0; i < 7; i++) {
int x, y;
cin >> x >> y;
cout << x - y;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
for (int i = 0; i < 7; i++) {
int x, y;
cin >> x >> y;
cout << x - y << endl;
}
return 0;
} | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 48 | 2 |
#include <stdio.h>
int main() {
int i, a, b;
for (i = 0; i < 7; i++) {
scanf("%d%d", &a, &b);
printf("%d\n", a + b);
}
return 0;
} | #include <stdio.h>
int main() {
int i, a, b;
for (i = 0; i < 7; i++) {
scanf("%d%d", &a, &b);
printf("%d\n", a - b);
}
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33]] | 1 | 58 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a - b << "\n";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b)
cout << a - b << "\n";
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]] | 1 | 36 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
for (int i = 0; i < 7; i++) {
int a, b;
cin >> a, b;
cout << a - b << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
for (int i = 0; i < 7; i++) {
int a, b;
cin >> a >> b;
cout << a - b << endl;
}
return 0;
}
| [["-", 0, 7, 8, 9, 0, 1, 0, 34, 0, 21], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 152]] | 1 | 50 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
for (int i = 0; i < 7; i++) {
cin >> a >> b;
c = a - b;
cout << c;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
for (int i = 0; i < 7; i++) {
cin >> a >> b;
c = a - b;
cout << c << endl;
}
}
| [["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 51 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
bool allsame(string s) {
char c = s[0];
for (int i = 0; i < s.size(); i++) {
if (s[i] != c)
return 0;
}
return 1;
}
string toSortString(int n) {
string res = "0000... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
bool allsame(string s) {
char c = s[0];
for (int i = 0; i < s.size(); i++) {
if (s[i] != c)
return 0;
}
return 1;
}
string toSortString(int n) {
string res = "0000... | [["+", 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 | 415 | 4 |
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str... |
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.st... | [["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 35], ["-", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 304 | 6 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
using namespace std;
char N[4], n[4];
int L, S, d;
int main() {
while (true) {
cin >> N;
if (N[0] == '0' && N[1] == '0' && N[2] == '0' && N[3] == '0')
break;
if (N[0] == N[1] && N[1] == N[2] && N[2] == N[3])... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
using namespace std;
char N[4], n[4];
int L, S, d;
int main() {
while (true) {
cin >> N;
if (N[0] == '0' && N[1] == '0' && N[2] == '0' && N[3] == '0')
break;
if (N[0] == N[1] && N[1] == N[2] && N[2] == N[3])... | [["-", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 57, 64, 9, 0, 1, 0, 16, 12, 22]] | 1 | 362 | 4 |
from functools import reduce
while True:
n = input()
if n == "0000":
break
n = n if len(n) >= 4 else n.zfill(4)
if reduce(lambda x,y:x and y,[n[0] == i for i in n]):
print("NA")
else:
cnt = 0
while n != "6174":
s = ''.join(sorted(n))
l = ''.join(sorted(n,reverse = True))
n = str(int(l)-int(s))
... | from functools import reduce
while True:
n = input()
if n == "0000":
break
n = n if len(n) >= 4 else n.zfill(4)
if reduce(lambda x,y:x and y,[n[0] == i for i in n]):
print("NA")
else:
cnt = 0
while n != "6174":
s = ''.join(sorted(n))
l = ''.join(sorted(n,reverse = True))
n = str(int(l)-int(s))
... | [["-", 0, 52, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 151 | 4 |
while True:
n = eval(input())
if n == "0000":
break
if n.count(n[0]) == 4:
print("NA")
continue
cnt = 0
while n != "6174":
n, l = sorted(list(n)), sorted(list(n), reverse=True)
n = str(int("".join(l)) - int("".join(n))).zfill(4)
cnt += 1
prin... | while True:
n = input()
if n == "0000":
break
if n.count(n[0]) == 4:
print("NA")
continue
cnt = 0
while n != "6174":
n, l = sorted(list(n)), sorted(list(n), reverse=True)
n = str(int("".join(l)) - int("".join(n))).zfill(4)
cnt += 1
print(cnt) | [["-", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 110 | 3 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
int[] b = new int[n - 1];
long[] c = new long[n];
long sum = 0;
for (int i = 0; i < n; i... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
int[] b = new int[n - 1];
long[] c = new long[n];
long sum = 0;
for (int i = 0; i < n; i... | [["+", 64, 1, 0, 11, 12, 504, 71, 16, 17, 33], ["+", 64, 1, 0, 11, 12, 504, 71, 16, 12, 22]] | 3 | 223 | 2 |
#include <bits/stdc++.h>
using namespace std;
main() {
for (long long i, n, j[99999], s, a;; cout << a << endl) {
cin >> n;
if (!n)
break;
for (i = s = 0; i++ < n; s += a)
cin >> a;
for (i = n; i-- > 1; cin >> j[i])
;
for (sort(j + 1, j + n); n > 0; s += j[n])
i = max(n-- *... | #include <bits/stdc++.h>
using namespace std;
main() {
for (long long i, n, j[99999], s, a;; cout << i << endl) {
cin >> n;
if (!n)
break;
for (i = s = 0; i++ < n; s += a)
cin >> a;
for (i = n; i > 1; cin >> j[--i])
;
for (sort(j + 1, j + n); n > 0; s += j[n])
i = max(n-- *... | [["-", 8, 9, 0, 7, 26, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 7, 26, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 7, 15, 16, 31, 27, 17, 68], ["+", 26, 16, 12, 69, 341, 342, 0, 27, 17, 68]] | 1 | 124 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, t, v[65000], sum;
while (true) {
cin >> n;
if (n == 0) {
break;
}
sum = 0;
for (int i = 0; i < n; i++) {
cin >> t;
sum += t;
}
for (int j = 0; j < n - 1; j++) {
cin >> ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, t, v[65000], sum;
while (true) {
cin >> n;
if (n == 0) {
break;
}
sum = 0;
for (int i = 0; i < n; i++) {
cin >> t;
sum += t;
}
for (int j = 0; j < n - 1; j++) {
cin >> ... | [["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 182 | 2 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
using namespace std;
int main(void) {
long long int i, n, paipu, p, joi[65000], honsuu, max, m;
while (1) {
scanf("%lld", &n);
if (n == 0)
break;
honsuu = n;
paipu = 0;
for (i = 0; i < n; i++) {
scanf("%... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
using namespace std;
int main(void) {
long long int i, n, paipu, p, joi[65000], honsuu, max, m;
while (1) {
scanf("%lld", &n);
if (n == 0)
break;
honsuu = n;
paipu = 0;
for (i = 0; i < n; i++) {
scanf("%... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 209 | 1 |
#include <bits/stdc++.h>
using namespace std;
int joi[65000];
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int p;
long long int suml = 0;
for (int i = 0; i < n; i++) {
scanf(" %d", &p);
suml += p;
}
for (int i = 0; i < n - 1; i++) {
scanf... | #include <bits/stdc++.h>
using namespace std;
int joi[65000];
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
int p;
long long int suml = 0;
for (int i = 0; i < n; i++) {
scanf(" %d", &p);
suml += p;
}
for (int i = 0; i < n - 1; i++) {
scanf... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 208 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
using namespace std;
long n;
long p[65000];
long j[64999];
int main() {
while (1) {
scanf("%d", &n);
if (n == 0)
break;
long sum = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", &p[i]);
sum += p[i];
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
using namespace std;
long n;
long p[65000];
long j[64999];
int main() {
while (1) {
scanf("%ld", &n);
if (n == 0)
break;
long sum = 0;
for (int i = 0; i < n; ++i) {
scanf("%ld", &p[i]);
sum += p[i];
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 209 | 8 |
import sys
for s in sys.stdin:
a,b=list(map(int,input().split()))
print(a-b) | import sys
for s in sys.stdin:
a,b=list(map(int,s.split()))
print(a-b) | [["-", 3, 4, 0, 652, 63, 319, 500, 652, 63, 22], ["-", 0, 652, 63, 319, 500, 652, 3, 4, 0, 24], ["-", 0, 652, 63, 319, 500, 652, 3, 4, 0, 25], ["+", 0, 652, 3, 4, 0, 652, 63, 319, 500, 22]] | 5 | 34 | 4 |
for i in range(7):
a,b=map(int,input(),split())
print(a-b) | for i in range(7):
a,b=map(int,input().split())
print(a-b) | [["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 21], ["+", 12, 652, 3, 4, 0, 652, 63, 319, 0, 131]] | 5 | 30 | 2 |
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
int kingaku;
int[] goukei = new int[4];
int n;
public void syurui() {
for (n = 0; n <= 3; n++) {
int syurui = sc.nextInt();
int maisuu = sc.nextInt();
switch (syurui) {
case 1:
kingaku = 6... | import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
int kingaku;
int[] goukei = new int[4];
int n;
public void syurui() {
for (n = 0; n <= 3; n++) {
int syurui = sc.nextInt();
int maisuu = sc.nextInt();
switch (syurui) {
case 1:
kingaku = 6... | [["-", 8, 196, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 16, 31, 22], ["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 197 | 4 |
#include <stdio.h>
int main(void) {
int i, t, n, k;
for (i = 0; i > 4; i++) {
scanf("%d %d", &t, &n);
if (t == 1) {
k = 6000;
} else {
k = (6 - t) * 1000;
}
k *= n;
printf("%d\n", k);
}
return (0);
} | #include <stdio.h>
int main(void) {
int i, t, n, k;
for (i = 0; i < 4; i++) {
scanf("%d %d", &t, &n);
if (t == 1) {
k = 6000;
} else {
k = (6 - t) * 1000;
}
k *= n;
printf("%d\n", k);
}
return (0);
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 90 | 2 |
#include <stdio.h>
int main(void) {
int t, n, i, iti, ni, san, si;
for (i = 1; i < 5; i++) {
scanf("%d%d", &t, &n);
switch (t) {
case 1:
iti = 6000 * n;
break;
case 2:
ni = 3000 * n;
break;
case 3:
san = 3000 * n;
break;
case 4:
si = 2000 * n;
... | #include <stdio.h>
int main(void) {
int t, n, i, iti, ni, san, si;
for (i = 1; i < 5; i++) {
scanf("%d%d", &t, &n);
switch (t) {
case 1:
iti = 6000 * n;
break;
case 2:
ni = 4000 * n;
break;
case 3:
san = 3000 * n;
break;
case 4:
si = 2000 * n;
... | [["-", 0, 100, 0, 1, 0, 11, 12, 16, 31, 13], ["+", 0, 100, 0, 1, 0, 11, 12, 16, 31, 13]] | 0 | 174 | 2 |
// ?????? ??????
#include <stdio.h>
int main(void) {
int t, n, i, g;
for (i = 0; i < 4; i++) {
scanf("%d%d", &t, &n);
if (t == 1) {
g = 6000 * n;
printf("%d", g);
} else if (t == 2) {
g = 4000 * n;
printf("%d", g);
} else if (t == 3) {
g = 3000 * n;
printf("%d", g... | #include <stdio.h>
int main(void) {
int t, n, i, g;
for (i = 0; i < 4; i++) {
scanf("%d%d", &t, &n);
if (t == 1) {
g = 6000 * n;
printf("%d\n", g);
} else if (t == 2) {
g = 4000 * n;
printf("%d\n", g);
} else if (t == 3) {
g = 3000 * n;
printf("%d\n", g);
} el... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 145 | 4 |
a;
main(b) {
for (; a = ~scanf("%d%d", &a, &b);
printf("%d\n", (int)((6 - a) * 1.2) * 1000 * b))
;
} | z;
main(a, b) {
for (; z = ~scanf("%d%d", &a, &b);
printf("%d\n", (int)((6 - a) * 1.2) * 1000 * b))
;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 1, 0, 22], ["+", 36, 36, 36, 36, 36, 36, 0, 30, 0, 78], ["+", 0, 30, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 30, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 0, 14, 8, 9, 0, 7, 15, 11, 31, 22], ["+", 0, 30, 0, 9, 0, 7, 15, 11, 31, 22]] | 0 | 53 | 7 |
#include <cstdio>
using namespace std;
int main() {
int data[] = {6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++) {
int t, n;
scanf("%d %d", &t, &n);
printf("%d\n", data[t] * n);
}
return 0;
} | #include <cstdio>
using namespace std;
int main() {
int data[] = {0, 6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++) {
int t, n;
scanf("%d %d", &t, &n);
printf("%d\n", data[t] * n);
}
return 0;
} | [["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 21]] | 1 | 79 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
int main() {
int ticket[] = {6000, 4000, 3000, 2000};
for (int i = 0; i < 7; i++) {
int t, n;
cin >> t >> n;
cout << ticket[t - 1] * n << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
int main() {
int ticket[] = {6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++) {
int t, n;
cin >> t >> n;
cout << ticket[t - 1] * n << endl;
}
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 72 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b;
for (int i = 0; i < 7; ++i) {
cin >> a >> b;
if (a == 1)
b = b * 6000;
if (a == 2)
b = b * 4000;
if (a == 3)
b = b * 3000;
if (a == 4)
b = b * 2000;
cout << b << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
for (int i = 0; i < 4; ++i) {
cin >> a >> b;
if (a == 1)
b = b * 6000;
if (a == 2)
b = b * 4000;
if (a == 3)
b = b * 3000;
if (a == 4)
b = b * 2000;
cout << b << endl;
}
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 96 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
int ticket[4] = {6000, 4000, 3000, 2000};
for (int i = 0; i < 7; i++) {
cin >> a >> b;
cout << ticket[a - 1] * b << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
int ticket[4] = {6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++) {
cin >> a >> b;
cout << ticket[a - 1] * b << endl;
}
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 73 | 2 |
#include <iostream>
using namespace std;
int main() {
int ticket[] = {0, 2000, 3000, 4000, 6000};
int t, n;
while (cin >> t >> n)
cout << ticket[t] * n << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int ticket[] = {0, 6000, 4000, 3000, 2000};
int t, n;
while (cin >> t >> n)
cout << ticket[t] * n << endl;
return 0;
} | [["-", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["-", 8, 9, 0, 43, 49, 50, 51, 83, 0, 21], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 21]] | 1 | 56 | 8 |
#include <iostream>
int main() {
int cost[] = {6000, 4000, 3000, 2000};
int t, n;
for (int i = 0; i < 4; i++) {
std::cin >> t >> n;
std::cout << cost[t] * n << std::endl;
}
return 0;
} | #include <iostream>
int main() {
int cost[] = {0, 6000, 4000, 3000, 2000};
int t, n;
for (int i = 0; i < 4; i++) {
std::cin >> t >> n;
std::cout << cost[t] * n << std::endl;
}
return 0;
} | [["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 21]] | 1 | 70 | 2 |
#include <iostream>
using namespace std;
int main() {
int P[4] = {6000, 4000, 3000, 2000};
int t[4], n[4];
for (int i = 0; i < 4; i++) {
cin >> t[i] >> n[i];
}
for (int i = 0; i < 4; i++) {
cout << P[t[i]] * n[i] << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int P[4] = {6000, 4000, 3000, 2000};
int t[4], n[4];
for (int i = 0; i < 4; i++) {
cin >> t[i] >> n[i];
}
for (int i = 0; i < 4; i++) {
cout << P[t[i] - 1] * n[i] << endl;
}
return 0;
} | [["+", 12, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 103 | 2 |
#include <iostream>
using namespace std;
int main() {
int tick, n;
int temp[5] = {0, 6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++) {
cin >> tick >> n;
cout << temp[tick] * n;
}
} | #include <iostream>
using namespace std;
int main() {
int tick, n;
int temp[5] = {0, 6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++) {
cin >> tick >> n;
cout << temp[tick] * n << endl;
}
} | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 66 | 2 |
#include <stdio.h>
int main() {
int a, b, c, i;
for (i = 1; i <= 7; i++) {
scanf("%d %d", &a, &b);
if (a == 1) {
c = 6000 * b;
} else if (a == 2) {
c = 4000 * b;
} else if (a == 3) {
c = 3000 * b;
} else if (a == 4) {
c = 2000 * b;
}
printf("%d\n", c);
}
retur... | #include <stdio.h>
int main() {
int a, b, c, i;
for (i = 1; i <= 4; i++) {
scanf("%d %d", &a, &b);
if (a == 1) {
c = 6000 * b;
} else if (a == 2) {
c = 4000 * b;
} else if (a == 3) {
c = 3000 * b;
} else if (a == 4) {
c = 2000 * b;
}
printf("%d\n", c);
}
retur... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 117 | 2 |
#include <stdio.h>
int main(void) {
int a[4], b[4], c[4], d;
for (d = 1; d <= 4; d++) {
scanf("%d %d", &a[d], &b[d]);
if (a[d] == 1) {
a[d] = 6000;
} else if (a[d] == 2) {
a[d] = 4000;
} else if (a[d] == 3) {
a[d] = 3000;
} else if (a[d] == 4) {
a[d] = 2000;
}
c[d... | #include <stdio.h>
int main(void) {
int a[4], b[4], c[4], d;
for (d = 1; d <= 4; d++) {
scanf("%d %d", &a[d], &b[d]);
if (a[d] == 1) {
a[d] = 6000;
} else if (a[d] == 2) {
a[d] = 4000;
} else if (a[d] == 3) {
a[d] = 3000;
} else if (a[d] == 4) {
a[d] = 2000;
}
c[d... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 166 | 1 |
#include <iostream>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
switch (a) {
case 1:
cout << (long long)b * 6000 << "\n";
break;
case 2:
cout << (long long)b * 4000 << "\n";
case 3:
cout << (long long)b * 3000 << "\n";
case 4:
cout <<... | #include <iostream>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
switch (a) {
case 1:
cout << (long long)b * 6000 << "\n";
break;
case 2:
cout << (long long)b * 4000 << "\n";
break;
case 3:
cout << (long long)b * 3000 << "\n";
break;
... | [["+", 0, 99, 8, 9, 0, 100, 0, 93, 0, 94], ["+", 0, 99, 8, 9, 0, 100, 0, 93, 0, 35], ["+", 0, 99, 8, 9, 0, 100, 0, 1, 0, 35]] | 1 | 106 | 6 |
#include <iostream>
using namespace std;
int main() {
int pr[4] = {6000, 4000, 3000, 2000};
int a, b;
for (int i = 0; i < 7; i++) {
cin >> a >> b;
cout << pr[a - 1] * b << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int pr[4] = {6000, 4000, 3000, 2000};
int a, b;
for (int i = 0; i < 4; i++) {
cin >> a >> b;
cout << pr[a - 1] * b << endl;
}
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 68 | 2 |
#include <iostream>
using namespace std;
int main() {
int sum = 0, m, n;
int price[4] = {6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++) {
cin >> m >> n;
cout << price[m] * n << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int m, n;
int price[4] = {6000, 4000, 3000, 2000};
for (int i = 0; i < 4; i++) {
cin >> m >> n;
cout << price[m - 1] * n << endl;
}
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 73 | 6 |
#include <iostream>
using namespace std;
int main() {
int a, b;
for (int i = 0; i < 7; i++) {
cin >> a >> b;
if (a == 1)
cout << b * 6000 << endl;
if (a == 2)
cout << b * 4000 << endl;
;
if (a == 3)
cout << b * 3000 << endl;
if (a == 4)
cout << b * 2000 << endl;
}
... | #include <iostream>
using namespace std;
int main() {
int a, b;
for (int i = 0; i < 4; i++) {
cin >> a >> b;
if (a == 1)
cout << b * 6000 << endl;
if (a == 2)
cout << b * 4000 << endl;
;
if (a == 3)
cout << b * 3000 << endl;
if (a == 4)
cout << b * 2000 << endl;
}
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 99 | 2 |
#include <stdio.h>
int main() {
int a = 0, b = 0;
for (int i = 0; i < 4; i++) {
scanf("%d%d", &a, &b);
switch (a) {
case 1:
printf("%d", b * 6000);
break;
case 2:
printf("%d", b * 4000);
break;
case 3:
printf("%d", b * 3000);
break;
default:
print... | #include <stdio.h>
int main() {
int a = 0, b = 0;
for (int i = 0; i < 4; i++) {
scanf("%d%d", &a, &b);
switch (a) {
case 1:
printf("%d\n", b * 6000);
break;
case 2:
printf("%d\n", b * 4000);
break;
case 3:
printf("%d\n", b * 3000);
break;
default:
... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 118 | 4 |
T=[6000,4000,3000,2000]
puts$<.map{|e|a,b=gets.split.map(&:to_i);T[a-1]*b} | T=[6000,4000,3000,2000]
puts$<.map{|e|a,b=e.split.map(&:to_i);T[a-1]*b} | [["-", 8, 734, 0, 662, 12, 652, 486, 652, 486, 22], ["+", 8, 734, 0, 662, 12, 652, 486, 652, 486, 22]] | 4 | 42 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int N = stdIn.nextInt();
int[][] X = new int[N][4];
for (int i = 0; i < N; i++) {
for (int j = 0; j < 4; j++) {
X[i][j] = stdIn.nextInt();
}
}
f... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int N = stdIn.nextInt();
int[][] X = new int[N][4];
for (int i = 0; i < N; i++) {
for (int j = 0; j < 4; j++) {
X[i][j] = stdIn.nextInt();
}
}
f... | [["-", 0, 57, 15, 15, 0, 16, 12, 16, 17, 72], ["+", 15, 15, 0, 16, 12, 16, 12, 16, 17, 48]] | 3 | 683 | 6 |
import java.util.Scanner;
public class Main {
int kin, wari;
public void solve() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for (int i = 0; i < n; i++) {
int x = sc.nextInt();
int y = sc.nextInt();
int b = sc.nextInt();
int p = sc.nextInt();
kin = x * ... | import java.util.Scanner;
public class Main {
int a, kin, wari;
public void solve() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for (int i = 0; i < n; i++) {
int x = sc.nextInt();
int y = sc.nextInt();
int b = sc.nextInt();
int p = sc.nextInt();
kin = x... | [["+", 0, 235, 8, 498, 0, 124, 49, 200, 141, 22], ["+", 0, 493, 0, 235, 8, 498, 0, 124, 0, 21], ["+", 0, 7, 8, 196, 0, 57, 75, 196, 0, 45], ["-", 0, 7, 8, 196, 0, 57, 75, 57, 0, 95], ["+", 0, 7, 8, 196, 0, 57, 75, 196, 0, 46], ["-", 0, 7, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 492, 141, 22]] | 3 | 215 | 7 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
while (n-- > 0) {
int a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt(),
d = sc.nextInt();
if (c >= 5 && d >= 2) {
System.out.... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
while (n-- > 0) {
int a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt(),
d = sc.nextInt();
if (c >= 5 && d >= 2) {
System.out.... | [["-", 31, 16, 12, 23, 0, 510, 64, 16, 17, 33], ["-", 31, 16, 12, 23, 0, 510, 64, 16, 12, 22], ["-", 12, 16, 12, 23, 0, 510, 64, 16, 17, 33], ["-", 12, 16, 12, 23, 0, 510, 64, 16, 12, 22]] | 3 | 176 | 4 |
import java.util.Scanner;
public class Main {
void doIt() {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
for (int r = 0; r < n; r++) {
int bath = stdIn.nextInt();
int pool = stdIn.nextInt();
int bathN = stdIn.nextInt();
int poolN = stdIn.nextInt();
int an... | import java.util.Scanner;
public class Main {
void doIt() {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
for (int r = 0; r < n; r++) {
int bath = stdIn.nextInt();
int pool = stdIn.nextInt();
int bathN = stdIn.nextInt();
int poolN = stdIn.nextInt();
int an... | [["+", 0, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 64, 196, 0, 1, 0, 492, 3, 4, 0, 25], ["+", 0, 1, 0, 11, 12, 74, 51, 23, 0, 24], ["+", 0, 11, 12, 74, 51, 23, 0, 23, 0, 25]] | 3 | 370 | 6 |
#include <stdio.h>
#define discount(n) ((n)*8 / 10)
int main(void) {
int n;
scanf("%d", &n);
while (n-- > 0) {
int x, y, b, p;
int sum_price = 0;
scanf("%d %d %d %d", &x, &y, &b, &p);
sum_price = x * b + y * p;
if (x >= 5 && y >= 2) {
sum_price = discount(sum_price);
} else {
... | #include <stdio.h>
#define discount(n) ((n)*8 / 10)
int main(void) {
int n;
scanf("%d", &n);
while (n-- > 0) {
int x, y, b, p;
int sum_price = 0;
scanf("%d %d %d %d", &x, &y, &b, &p);
sum_price = x * b + y * p;
if (b >= 5 && p >= 2) {
sum_price = discount(sum_price);
} else {
... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 31, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["-", 0, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 0, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57... | 0 | 169 | 12 |
#include <stdio.h>
int fee(int x, int y, int b, int p) {
int fee1, fee2;
fee1 = x * b + y * p;
if (b >= 5 && p >= 2) {
return ((x * b + y * p) * 4 / 5);
}
if (b < 5 && p >= 2) {
fee2 = (x * 5 + y * p) * 4 / 5;
if (fee1 < fee2) {
return (fee1);
}
return (fee2);
}
if (b >= 5 &... | #include <stdio.h>
int fee(int x, int y, int b, int p) {
int fee1, fee2;
fee1 = x * b + y * p;
if (b >= 5 && p >= 2) {
return ((x * b + y * p) * 4 / 5);
}
if (b < 5 && p >= 2) {
fee2 = (x * 5 + y * p) * 4 / 5;
if (fee1 < fee2) {
return (fee1);
}
return (fee2);
}
if (b >= 5 &... | [["-", 31, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 12, 13]] | 0 | 279 | 2 |
#include <stdio.h>
int main() {
int n, nyu, po, nm, pm, summ, i, kari1, kari2, karir;
int ryokin[365];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &nyu, &po, &nm, &pm);
summ = nm + pm;
if (nm >= 5 || pm >= 2) {
if (nm >= 5 && pm >= 2) {
ryokin[i] = (nyu * nm + p... | #include <stdio.h>
int main() {
int n, nyu, po, nm, pm, summ, i, kari1, kari2, karir;
int ryokin[365];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &nyu, &po, &nm, &pm);
summ = nm + pm;
if (nm >= 5 || pm >= 2) {
if (nm >= 5 && pm >= 2) {
ryokin[i] = (nyu * nm + p... | [["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 25], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 0 | 277 | 4 |
#include <stdio.h>
int main(void) {
int n, x, y, b, p, i, r;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d%d%d", &x, &y, &b, &p);
r = x * b + y * p;
if (b >= 5 && p >= 2) {
r = r * 0.8;
} else if (b >= 5 && p < 2 && r > (x * b + y * 2) * 0.8) {
r = (x * b + y * 2) * 0.8;
}... | #include <stdio.h>
int main(void) {
int n, x, y, b, p, i, r;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d%d%d", &x, &y, &b, &p);
r = x * b + y * p;
if (b >= 5 && p >= 2) {
r = r * 0.8;
} else if (b >= 5 && p < 2 && r > (x * b + y * 2) * 0.8) {
r = (x * b + y * 2) * 0.8;
}... | [["-", 15, 23, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 15, 23, 0, 16, 31, 16, 12, 16, 31, 22]] | 0 | 232 | 2 |
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>... | #include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>... | [["-", 0, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 12, 13]] | 1 | 900 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reep(i, a, b) for (int i = (a); i < (b); ++i)
#defin... |
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reep(i, a, b) for (int i = (a); i < (b); ++i)
#defin... | [["+", 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 | 284 | 4 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int x, y, b, p;
for (int i = 0; i < N; ++i) {
cin >> x >> y >> b >> p;
int res = min(x * b + y * p, (min(b, 5) * x + min(p, 2) * y) * 4 / 5);
cout << res << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int x, y, b, p;
for (int i = 0; i < N; ++i) {
cin >> x >> y >> b >> p;
int res = min(x * b + y * p, (max(b, 5) * x + max(p, 2) * y) * 4 / 5);
cout << res << endl;
}
return 0;
} | [["-", 31, 23, 0, 16, 31, 16, 31, 2, 63, 22], ["+", 31, 23, 0, 16, 31, 16, 31, 2, 63, 22], ["-", 31, 23, 0, 16, 12, 16, 31, 2, 63, 22], ["+", 31, 23, 0, 16, 12, 16, 31, 2, 63, 22]] | 1 | 101 | 4 |
#include <stdio.h>
int main(void) {
int i, n;
int x, y, b, p;
int xb, yp, xbyp, xbyp2, xbyp3, xbyp4;
int b2, p2, xb2, yp2;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d %d %d %d", &x, &y, &b, &p);
if (b >= 5 && p >= 2) {
xbyp2 = (xb + yp) * 8 / 10;
}
xb = x * b;
yp = y * ... | #include <stdio.h>
int main(void) {
int i, n;
int x, y, b, p;
int xb, yp, xbyp, xbyp2, xbyp3, xbyp4;
int b2, p2, xb2, yp2;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d %d %d %d", &x, &y, &b, &p);
if (b >= 5 && p >= 2) {
xbyp2 = (xb + yp) * 8 / 10;
}
xb = x * b;
yp = y * ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 250 | 6 |
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int x, y, b, p, sum, ans;
scanf("%d %d %d %d", &x, &y, &b, &p);
ans = sum = x * b + y * p;
if (b < 5)
sum += x * (5 - b);
if (p < 5)
sum += y * (2 - p);
... | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int x, y, b, p, sum, ans;
scanf("%d %d %d %d", &x, &y, &b, &p);
ans = sum = x * b + y * p;
if (b < 5)
sum += x * (5 - b);
if (p < 2)
sum += y * (2 - p);
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 141 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int x, y, b, p;
cin >> x >> y >> b >> p;
int ans = 0;
if (b >= 5 && p >= 2) {
ans = (b * x + p * y) * 0.8;
} else {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int x, y, b, p;
cin >> x >> y >> b >> p;
int ans = 0;
if (b >= 5 && p >= 2) {
ans = (b * x + p * y) * 0.8;
} else {
... | [["-", 51, 16, 31, 23, 0, 16, 12, 16, 31, 22], ["+", 51, 16, 31, 23, 0, 16, 12, 16, 31, 22]] | 1 | 216 | 2 |
#include <stdio.h>
int main(void) {
int n, x, y, b, p, i, j, a[365];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &x, &y, &b, &p);
if (b >= 5 && p <= 2) {
if (x * b + y * p > (x * b + y * 2) * 0.8) {
a[i] = (x * b + y * 2) * 0.8;
} else {
a[i] = x * b + y * p... | #include <stdio.h>
int main(void) {
int n, x, y, b, p, i, j, a[365];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &x, &y, &b, &p);
if (b >= 5 && p <= 2) {
if (x * b + y * p > (x * b + y * 2) * 0.8) {
a[i] = (x * b + y * 2) * 0.8;
} else {
a[i] = x * b + y * p... | [["-", 12, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["+", 12, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["-", 12, 16, 31, 23, 0, 16, 12, 16, 12, 13], ["+", 12, 16, 31, 23, 0, 16, 12, 16, 12, 22]] | 1 | 340 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int x, y, b, p;
int p1, p2;
cin >> x >> y >> b >> p;
p1 = x * b + y * p;
p2 = x * max(5, b) + y * max(2, p);
p2 *= 0.8;
cout << min(p1, p2);
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int x, y, b, p;
int p1, p2;
cin >> x >> y >> b >> p;
p1 = x * b + y * p;
p2 = x * max(5, b) + y * max(2, p);
p2 *= 0.8;
cout << min(p1, p2) << endl;
}
return ... | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 107 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x, y, b, p;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y >> b >> p;
if (b >= 5 && p >= 2)
cout << (x * b + y * p) * 4 / 5;
if (b >= 5 && p < 2)
cout << min(x * b + y * p, (x * b + y * 2) * 4 / 5) <<... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, x, y, b, p;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y >> b >> p;
if (b >= 5 && p >= 2)
cout << (x * b + y * p) * 4 / 5 << endl;
if (b >= 5 && p < 2)
cout << min(x * b + y * p, (x * b + y * 2) * 4... | [["+", 8, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 12, 22]] | 1 | 201 | 2 |
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | [["-", 0, 57, 64, 1, 0, 11, 12, 16, 17, 33], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 12, 22]] | 1 | 340 | 2 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using LL = long long;
constexpr int MO... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using LL = long long;
constexpr int MO... | [["+", 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 | 137 | 4 |
#include <algorithm>
#include <cstdio>
int n, x, y, b, p;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int ans;
scanf("%d %d %d %d", &x, &y, &b, &p);
ans = x * b + y * p;
if (b < 5 && p >= 2 && (int)((x * 5 + y * p) * 0.8) < ans)
ans = (int)((x * 5 + y * p) * 0.8);
if (b ... | #include <algorithm>
#include <cstdio>
int n, x, y, b, p;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int ans;
scanf("%d %d %d %d", &x, &y, &b, &p);
ans = x * b + y * p;
if (b < 5 && p >= 2 && (int)((x * 5 + y * p) * 0.8) < ans)
ans = (int)((x * 5 + y * p) * 0.8);
if (b ... | [["-", 15, 339, 51, 16, 31, 16, 12, 16, 12, 22], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 12, 13]] | 1 | 284 | 2 |
#include <iostream>
using namespace std;
int ms[12] = {0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334},
g[5] = {144000, 7200, 360, 20, 1};
void ymbk(int *b) {
int i, k;
long long d, a;
a = b[0] - 1;
d = a * 365 + a / 4 - a / 100 + a / 400;
a++;
if (b[1] > 1 && ((a % 4 == 0 && a % 100 != 0) || a ... | #include <iostream>
using namespace std;
int ms[12] = {0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334},
g[5] = {144000, 7200, 360, 20, 1};
void ymbk(int *b) {
int i, k;
long long d, a;
a = b[0] - 1;
d = a * 365 + a / 4 - a / 100 + a / 400;
a++;
if (b[1] > 2 && ((a % 4 == 0 && a % 100 != 0) || a ... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 613 | 2 |
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
int monthTable[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int monthTable2[13] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool isLeapYear(int year) {
if (year... | #include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
int monthTable[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int monthTable2[13] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool isLeapYear(int year) {
if (year... | [["-", 64, 9, 0, 7, 15, 16, 31, 16, 12, 13], ["+", 64, 9, 0, 7, 15, 16, 31, 16, 12, 13], ["-", 12, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["-", 12, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 9, 0, 7, 15, 16, 31, 16, 12, 13], ["+", 0, 9, 0, 7, 15, 16, 31, 16, 12, 13]] | 1 | 927 | 8 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int base;
int tod(int b, int ka, int t, int w, int ki) {
ka += b * 20;
t += ka * 20;
w += 18 * t;
ki += 20 * w;
return base + ki;
}
bool is_uruu(int y) { return y % 4 == 0 && (y % 100 != 0 || y... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int base;
int tod(int b, int ka, int t, int w, int ki) {
ka += b * 20;
t += ka * 20;
w += 18 * t;
ki += 20 * w;
return base + ki;
}
bool is_uruu(int y) { return y % 4 == 0 && (y % 100 != 0 || y... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 746 | 1 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int base;
int tod(int b, int ka, int t, int w, int ki) {
ka += b * 20;
t += ka * 20;
w += 18 * t;
ki += 20 * w;
return base + ki;
}
bool is_uruu(int y) { return y % 4 == 0 && (y % 100 != 0 || y... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int base;
int tod(int b, int ka, int t, int w, int ki) {
ka += b * 20;
t += ka * 20;
w += 18 * t;
ki += 20 * w;
return base + ki;
}
bool is_uruu(int y) { return y % 4 == 0 && (y % 100 != 0 || y... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 585 | 2 |
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> G(252), R(252);
int n, m;
int d[552];
bool u[252];
void f(int v) {
u[v] = 1;
for (int i = 0; i < R[v].size(); i++) {
if (!u[R[v][i]])
f(R[v][i]);
}
}
bool vi[252];
void ok(int v) {
vi[v] = 1;
for (int i = 0; i < G[v].size... | #include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> G(252), R(252);
int n, m;
int d[552];
bool u[252];
void f(int v) {
u[v] = 1;
for (int i = 0; i < R[v].size(); i++) {
if (!u[R[v][i]])
f(R[v][i]);
}
}
bool vi[252];
void ok(int v) {
vi[v] = 1;
for (int i = 0; i < G[v].size... | [["+", 0, 34, 12, 34, 12, 11, 31, 69, 28, 22], ["+", 12, 34, 12, 11, 31, 69, 341, 342, 0, 70], ["+", 12, 34, 12, 11, 31, 69, 341, 342, 0, 22], ["+", 12, 34, 12, 11, 31, 69, 341, 342, 0, 73], ["+", 8, 1, 0, 34, 12, 34, 12, 11, 17, 32]] | 1 | 424 | 5 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
#define INF 999999
#define ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
#define INF 999999
#define ... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 91, 17, 111], ["-", 3, 4, 0, 41, 15, 23, 0, 91, 17, 111]] | 1 | 419 | 6 |
#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"
typede... | #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"
typede... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 60], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 147], ["+", 0, 14, 8, 9, 0, 57, 64, 37, 0, 38], ["+", 0, 14, 8, 9, 0, 57, 64, 37, 0, 146]] | 1 | 2,106 | 6 |
#include <bits/stdc++.h>
using namespace std;
int maxi, n;
int d[256];
bool mas[256];
vector<vector<int>> G(256);
void dfs1(int x) {
if (mas[x])
return;
mas[x] = true;
for (int i = 1; i <= maxi; i++) {
dfs1(max(0, min(x + i + d[max(0, min(x + i, n + 1))], n + 1)));
G[max(0, min(x + i + d[max(0, mi... | #include <bits/stdc++.h>
using namespace std;
int maxi, n;
int d[256];
bool mas[256];
vector<vector<int>> G(256);
void dfs1(int x) {
if (mas[x])
return;
mas[x] = true;
for (int i = 1; i <= maxi; i++) {
dfs1(max(0, min(x + i + d[max(0, min(x + i, n + 1))], n + 1)));
G[max(0, min(x + i + d[max(0, mi... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 389 | 2 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#define debug(x) c... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#define debug(x) c... | [["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 434 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define MP make_pair
#define all(s) (s).begin(), (s).end()
using namespace std;
typedef vect... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define MP make_pair
#define all(s) (s).begin(), (s).end()
using namespace std;
typedef vect... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 11, 12, 23, 0, 16, 12, 16, 17, 79], ["+", 0, 11, 12, 23, 0, 16, 12, 16, 12, 22]] | 1 | 406 | 4 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) { new Main().run(); }
private void run() {
Scanner scanner = new Scanner(System.in);
while (true) {
int n = scanner.nextInt();
int c = scanner.nextInt();
if ((n | c) == 0)
... |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) { new Main().run(); }
private void run() {
Scanner scanner = new Scanner(System.in);
while (true) {
int n = scanner.nextInt();
int c = scanner.nextInt();
if ((n | c) == 0)
... | [["-", 0, 7, 8, 7, 8, 1, 0, 11, 17, 160], ["+", 0, 7, 8, 7, 8, 1, 0, 11, 17, 107], ["-", 8, 196, 0, 503, 49, 200, 51, 16, 17, 72], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 17, 139]] | 3 | 454 | 6 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
int pop_count(int bs) {
int cnt = 0;
for (int i = 0; i < 16; ++i) {
cnt += (bs >> i) & 1;
}
return cnt;
}
void run() {
for (;;) {
int n = ni();
int c = ni();
if ((n | c) == 0) {
break;
... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
int pop_count(int bs) {
int cnt = 0;
for (int i = 0; i < 16; ++i) {
cnt += (bs >> i) & 1;
}
return cnt;
}
void run() {
for (;;) {
int n = ni();
int c = ni();
if ((n | c) == 0) {
break;
... | [["-", 0, 503, 49, 200, 51, 227, 497, 505, 0, 22], ["+", 0, 503, 49, 200, 51, 227, 497, 505, 0, 22]] | 3 | 797 | 2 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string.h>
#include <utility>
using namespace std;
typedef long long ll;
int st[31][1 << 16], dp[31][1 << 16];
int count(int num) {
int res = 0;
for (int i = 0; i < 16; i++)
if ((num >> i) & 1)
res++;... | #include <algorithm>
#include <functional>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string.h>
#include <utility>
using namespace std;
typedef long long ll;
int st[31][1 << 16], dp[31][1 << 16];
int count(int num) {
int res = 0;
for (int i = 0; i < 16; i++)
if ((num >> i) & 1)
res++;... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 31, 22], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 33], ["+", 49, 50, 51, 23, 0, 16, 12, 91, 17, 92], ["-", 12, 23, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 16, 12, 91, 28, 69, 341, 342, 0, 22]] | 1 | 524 | 5 |
#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, 43, 49, 50, 51, 16, 12, 69, 28, 22], ["-", 49, 50, 51, 16, 12, 69, 341, 342, 0, 70], ["-", 49, 50, 51, 16, 12, 69, 341, 342, 0, 22], ["-", 49, 50, 51, 16, 12, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22]] | 1 | 491 | 5 |
import java.util.Scanner;
public class Main {
public void solve() {
Scanner sc = new Scanner(System.in);
int N, su;
int one = 0;
int some = 1;
N = sc.nextInt();
while (N != 0) {
for (int i = 0; i < N; i++) {
su = sc.nextInt();
if (su >= 2) {
some++;
} ... | import java.util.Scanner;
public class Main {
public void solve() {
Scanner sc = new Scanner(System.in);
int N, su;
int one = 0;
int some = 1;
N = sc.nextInt();
while (N != 0) {
for (int i = 0; i < N; i++) {
su = sc.nextInt();
if (su >= 2) {
some++;
} ... | [["-", 0, 57, 75, 57, 15, 15, 0, 16, 17, 19], ["+", 0, 57, 75, 57, 15, 15, 0, 16, 17, 60]] | 3 | 183 | 2 |
#include <stdio.h>
int main(void) {
int N, k, m, j, i;
scanf("%d", &N);
while (N != 0) {
m = 0;
j = 0;
for (i = 0; i < N; i++) {
scanf("%d", &k);
if (k < 2) {
m = m + 1;
if (k == 0) {
j = j + 1;
}
}
}
if (m == N) {
printf("NA\n");
}... | #include <stdio.h>
int main(void) {
int N, k, m, j, i;
scanf("%d", &N);
while (N != 0) {
m = 0;
j = 0;
for (i = 0; i < N; i++) {
scanf("%d", &k);
if (k < 2) {
m = m + 1;
if (k == 0) {
j = j + 1;
}
}
}
if (m == N) {
printf("NA\n");
}... | [["+", 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], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 21]] | 0 | 140 | 5 |
#include <cstdio>
using namespace std;
int main() {
while (1) {
int n, a, more_than_2 = 0, not_zero = 0;
scanf("%d\n", &n);
if (n == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d ", &a);
if (a >= 2) {
more_than_2++;
} else if (n > 0) {
not_zero++;
}
... | #include <cstdio>
using namespace std;
int main() {
while (1) {
int n, a, more_than_2 = 0, not_zero = 0;
scanf("%d\n", &n);
if (n == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d ", &a);
if (a >= 2) {
more_than_2++;
}
if (a > 0) {
not_zero++;
}... | [["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 133 | 3 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
while (cin >> n && n) {
vector<int> v(n);
rep(i, n) cin >> v[i];
bool flag = false;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
while (cin >> n && n) {
vector<int> v(n);
rep(i, n) cin >> v[i];
bool flag = false;
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 155 | 2 |
#include <stdio.h>
int main(void) {
int s, n, k, t, i, flg;
while (1) {
flg = 0;
scanf("%d", &n);
if (n == 0)
break;
s = n;
for (i = 0; i < n; i++) {
scanf("%d", &k);
if (k == 0) {
t = s - 1;
}
if (k >= 2) {
flg = 1;
}
}
if (flg == 1) {... | #include <stdio.h>
int main(void) {
int h, s, n, k, i, flg;
while (1) {
flg = 0;
scanf("%d", &n);
if (n == 0)
break;
s = n;
for (i = 0; i < n; i++) {
scanf("%d", &k);
// printf("%d\n",k);
if (k == 0) {
s = s - 1;
}
if (k >= 2) {
flg = 1;
... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16... | 1 | 139 | 8 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, k;
while (cin >> N, N) {
int cnt = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
cin >> k;
if (k >= 1)
cnt++;
if (k >= 2)
flag = 1;
}
if (cnt == 0 || flag == 1)
cout << "NA"... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, k;
while (cin >> N, N) {
int cnt = 0;
int flag = 0;
for (int i = 0; i < N; i++) {
cin >> k;
if (k >= 1)
cnt++;
if (k >= 2)
flag = 1;
}
if (cnt == 0 || flag == 0)
cout << "NA"... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 108 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
while (cin >> N) {
if (N == 0) {
break;
}
vector<int> k(N);
int result = 0;
bool flag = false;
for (int i = 0; i < N; ++i) {
cin >> k[N];
}
for (int i = 0; i < N; ++i) {
if (k[N] == 1) {... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
while (cin >> N) {
if (N == 0) {
break;
}
vector<int> k(N);
int result = 0;
bool flag = false;
for (int i = 0; i < N; ++i) {
cin >> k[i];
}
for (int i = 0; i < N; ++i) {
if (k[i] == 1) {... | [["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22]] | 1 | 159 | 6 |
#define _CRT_SECUREj_NO_WARNINGS 1
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <... | #define _CRT_SECUREj_NO_WARNINGS 1
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <... | [["+", 8, 9, 0, 14, 8, 9, 0, 57, 0, 121], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 51, 22], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 25]] | 1 | 266 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, a, cnt;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
cnt = 0;
int chk = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a == 0)
cnt++;
if (a <= 1)
chk++;
}
if (n ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, a, cnt;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
cnt = 0;
int chk = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a == 0)
cnt++;
if (a <= 1)
chk++;
}
if (n ... | [["-", 0, 2, 3, 4, 0, 16, 31, 16, 12, 22], ["+", 0, 2, 3, 4, 0, 16, 31, 16, 12, 22]] | 1 | 135 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (n == 0) {
break;
}
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
int index = 0;
while... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (n == 0) {
break;
}
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
int index = 0;
while... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 198 | 2 |
#include <iostream>
using namespace std;
int main() {
while (1) {
int N;
cin >> N;
if (N == 0)
break;
int OK = 0;
int NO = 0;
for (int i = 0; i < N; i++) {
int k;
cin >> k;
if (k == 1)
NO++;
else if (k > 1)
OK++;
}
if (OK == 0)
... | #include <iostream>
using namespace std;
int main() {
while (1) {
int N;
cin >> N;
if (N == 0)
break;
int OK = 0;
int NO = 0;
for (int i = 0; i < N; i++) {
int k;
cin >> k;
if (k == 1)
NO++;
else if (k > 1)
OK++;
}
if (OK == 0)
... | [["-", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 31, 22], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 17, 72], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 22]] | 1 | 111 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
while (n != 0) {
int na = 0;
int zeroc = 0;
int k[n];
for (int i = 0; i < n; i++) {
cin >> k[i];
}
for (int i = 0; i < n; i++) {
if (k[i] >= 2) {
na++;
break;
}
if (k[i] == 0)
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
while (n != 0) {
int na = 0;
int zeroc = 0;
int k[n];
for (int i = 0; i < n; i++) {
cin >> k[i];
}
for (int i = 0; i < n; i++) {
if (k[i] >= 2) {
na++;
}
if (k[i] == 0)
zeroc++;
... | [["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 146 | 2 |
while 1:
ba = 0
p = [0 for i in range(int(input()))]
if len(p) == 0:break
for i,v in enumerate(list(input())):
p[i%len(p)] += 1
if v == 'L':
p[i%len(p)] += ba
ba = 0
elif v== 'S':
ba += p[i%len(p)]
p[i%len(p)] = 0
result = '... | while 1:
ba = 0
p = [0 for i in range(int(input()))]
if len(p) == 0:break
for i,v in enumerate(list(input())):
p[i%len(p)] += 1
if v == 'L':
p[i%len(p)] += ba
ba = 0
elif v== 'S':
ba += p[i%len(p)]
p[i%len(p)] = 0
result = '... | [["+", 0, 52, 8, 196, 0, 7, 12, 652, 63, 22], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 24], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 25]] | 5 | 134 | 3 |
while 1:
n = int(input())
if n == 0:break
p = [0] * n
s = 0
f = input()
for i in range(100):
if f[i] == "M":p[i % n] += 1
elif f[i] == "S":
s += p[i % n] + 1
p[i % n] = 0
else:
p[i % n] += s + 1
s = 0
p += [s]
print(... | while 1:
n = int(input())
if n == 0:break
p = [0] * n
s = 0
f = input()
for i in range(100):
if f[i] == "M":p[i % n] += 1
elif f[i] == "S":
s += p[i % n] + 1
p[i % n] = 0
else:
p[i % n] += s + 1
s = 0
p.sort()
p += [... | [["+", 8, 196, 0, 1, 0, 652, 63, 319, 0, 131], ["+", 8, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25], ["+", 0, 52, 8, 196, 0, 1, 0, 677, 31, 22]] | 5 | 111 | 5 |
while True:
n=eval(input())
if n==0:break
a,b,c=[0]*n,0,input()
for i in range(100):
if c[i]=="M":
a[i%n]+=1
elif c[i]=="S":
b+=1+a[i%n]
a[i%n]=0
else:
a[i%n]+=1+b
b=0
print(" ".join(map(str,a)),b) | while True:
n=eval(input())
if n==0:break
a,b,c=[0]*n,0,input()
for i in range(100):
if c[i]=="M":
a[i%n]+=1
elif c[i]=="S":
b+=1+a[i%n]
a[i%n]=0
else:
a[i%n]+=1+b
b=0
print(" ".join(map(str,sorted(a))),b) | [["+", 3, 4, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 121 | 3 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) { new Main().run(); }
private void run() {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
for (int i = 0; i < n; i++) {
int C = scanner.nextInt();
int A = scanner.nextInt();
i... |
import java.util.Scanner;
public class Main {
public static void main(String[] args) { new Main().run(); }
private void run() {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
for (int i = 0; i < n; i++) {
int C = scanner.nextInt();
int A = scanner.nextInt();
i... | [["-", 49, 200, 51, 492, 3, 4, 0, 16, 17, 48], ["+", 49, 200, 51, 492, 3, 4, 0, 16, 17, 85]] | 3 | 182 | 2 |
#include <stdio.h>
int main(void) {
int q, c, n, a, s, f;
scanf("%d", &q);
while (q--) {
scanf("%d %d %d", &c, &a, &n);
s = 0;
f = -1;
while (s != f) {
f = s;
if (c >= 1 && a >= 1 && n >= 1) {
c--;
n--;
a--;
s++;
}
if (c >= 2 && a >= 1) {
... | #include <stdio.h>
int main(void) {
int q, c, n, a, s, f;
scanf("%d", &q);
while (q--) {
scanf("%d %d %d", &c, &a, &n);
s = 0;
f = -1;
while (s != f) {
f = s;
if (c >= 1 && a >= 1 && n >= 1) {
c--;
n--;
a--;
s++;
} else if (c >= 2 && a >= 1) {
... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95]] | 0 | 153 | 2 |
#include <stdio.h>
int main() {
int c, a, n, i, nen, count[100], m;
scanf("%d", &nen);
for (i = 0; i < nen; i++) {
scanf("%d %d %d", &c, &a, &n);
count[i] = 0;
while (m != 0) {
m = 0;
if (n >= 1 && a >= 1 && c >= 1) {
count[i]++;
n--;
a--;
c--;
m++;... | #include <stdio.h>
int main() {
int c, a, n, i, nen, count[100], m;
scanf("%d", &nen);
for (i = 0; i < nen; i++) {
scanf("%d %d %d", &c, &a, &n);
count[i] = 0;
m = 1;
while (m != 0) {
m = 0;
if (n >= 1 && a >= 1 && c >= 1) {
count[i]++;
n--;
a--;
c--;
... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 0 | 202 | 4 |
#include <stdio.h>
int main(void) {
int q, i, c, a, n, s;
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d %d %d", &c, &a, &n);
s = 0;
while (1) {
if (c >= 1 && a >= a && n >= 1) {
c--;
a--;
n--;
s++;
} else if (c >= 2 && a >= 1) {
c -= 2;
... | #include <stdio.h>
int main(void) {
int q, i, c, a, n, s;
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d %d %d", &c, &a, &n);
s = 0;
while (1) {
if (c >= 1 && a >= 1 && n >= 1) {
c--;
a--;
n--;
s++;
} else if (c >= 2 && a >= 1) {
c -= 2;
... | [["-", 15, 23, 0, 16, 31, 16, 12, 16, 12, 22], ["+", 15, 23, 0, 16, 31, 16, 12, 16, 12, 13]] | 0 | 156 | 2 |
#define min(a, b) ((a) < (b) ? (a) : (b))
z, x, r;
main(c, a, n) {
for (gets(&c); z = ~scanf("%d%d%d", &c, &a, &n); printf("%d\n", r)) {
r = 0;
x = min(c, min(a, n));
c -= x, a -= x, n -= x, r += x;
x = min(c * 2, a);
c -= x * 2, a -= x, r += x;
r += c / 3;
}
} | #define min(a, b) ((a) < (b) ? (a) : (b))
z, x, r;
main(c, a, n) {
for (gets(&c); z = ~scanf("%d%d%d", &c, &a, &n); printf("%d\n", r)) {
r = 0;
x = min(c, min(a, n));
c -= x, a -= x, n -= x, r += x;
x = min(c / 2, a);
c -= x * 2, a -= x, r += x;
r += c / 3;
}
} | [["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 48], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 17, 85]] | 0 | 129 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.