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) {
cout << "OK" << endl;
} else {
cout << t - sum << endl;
}
}
return 0;
}
|
#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) {
cout << "OK" << endl;
} else {
cout << t - sum << endl;
}
}
return 0;
}
|
[["-", 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 >= sum) {
cout << "OK" << endl;
} else {
cout << t - sum << endl;
}
}
return 0;
}
|
#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 <= sum) {
cout << "OK" << endl;
} else {
cout << t - sum << endl;
}
}
return 0;
}
|
[["-", 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";
int tmp[4] = {0, 0, 0, 0};
for (int i = 0; n != 0; i++) {
tmp[i] = n % 10;
n /= 10;
}
for (int i = 0; i < 4; i++) {
res[i] = tmp[i] + '0';
}
sort(res.begin(), res.end());
return res;
}
int make_l(string s) {
int res = 0;
for (int i = 0; i < s.size(); i++) {
res += (s[i] - '0') * pow(double(10), i);
}
return res;
}
int make_s(string s) {
int res = 0;
for (int i = 0; i < s.size(); i++) {
res += (s[s.size() - 1 - i] - '0') * pow(double(10), i);
}
return res;
}
int main() {
int n;
int ans = 0;
while (cin >> n, n != 0) {
while (n != 6174) {
string tmp_n = toSortString(n);
if (allsame(tmp_n)) {
cout << "NA" << endl;
break;
}
ans++;
int l, s;
// cout<<tmp_n<<endl;
l = make_l(tmp_n);
s = make_s(tmp_n);
// cout<<l<<endl;
// cout<<s<<endl<<endl;
n = l - s;
// cout<<n<<endl;
assert(ans < 100);
}
if (n == 6174) {
cout << ans << endl;
}
}
}
|
#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";
int tmp[4] = {0, 0, 0, 0};
for (int i = 0; n != 0; i++) {
tmp[i] = n % 10;
n /= 10;
}
for (int i = 0; i < 4; i++) {
res[i] = tmp[i] + '0';
}
sort(res.begin(), res.end());
return res;
}
int make_l(string s) {
int res = 0;
for (int i = 0; i < s.size(); i++) {
res += (s[i] - '0') * pow(double(10), i);
}
return res;
}
int make_s(string s) {
int res = 0;
for (int i = 0; i < s.size(); i++) {
res += (s[s.size() - 1 - i] - '0') * pow(double(10), i);
}
return res;
}
int main() {
int n;
int ans = 0;
while (cin >> n, n != 0) {
ans = 0;
while (n != 6174) {
string tmp_n = toSortString(n);
if (allsame(tmp_n)) {
cout << "NA" << endl;
break;
}
ans++;
int l, s;
l = make_l(tmp_n);
s = make_s(tmp_n);
n = l - s;
assert(ans < 100);
}
if (n == 6174) {
cout << ans << endl;
}
}
}
|
[["+", 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();
}
int main(void) {
string n;
while (cin >> n && n != "0000") {
if (count(n.begin(), n.end(), n[0]) == 4) {
cout << "NA" << endl;
}
// assert(n != "0000");
int tmp = toInt(n);
char str[10];
sprintf(str, "%04d", tmp);
n = string(str);
int cnt = 0;
while (n != "6174") {
if (count(n.begin(), n.end(), n[0]) == 4) {
cout << "NA" << endl;
goto END;
}
string L = n;
sort(L.rbegin(), L.rend());
string S = n;
sort(S.begin(), S.end());
// cout << n << " " << L << " " << S << endl;
int tmp = toInt(L) - toInt(S);
char str[10];
sprintf(str, "%04d", tmp);
n = string(str);
cnt++;
}
cout << cnt << endl;
END:;
}
return 0;
}
|
#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();
}
int main(void) {
string n;
while (cin >> n && n != "0000") {
if (count(n.begin(), n.end(), n[0]) == 4) {
cout << "NA" << endl;
continue;
}
// assert(n != "0000");
int tmp = toInt(n);
char str[128];
sprintf(str, "%04d", tmp);
n = string(str);
int cnt = 0;
while (n != "6174") {
if (count(n.begin(), n.end(), n[0]) == 4) {
cout << "NA" << endl;
goto END;
}
string L = n;
sort(L.rbegin(), L.rend());
string S = n;
sort(S.begin(), S.end());
// cout << n << " " << L << " " << S << endl;
int tmp = toInt(L) - toInt(S);
char str[128];
sprintf(str, "%04d", tmp);
n = string(str);
cnt++;
}
cout << cnt << endl;
END:;
}
return 0;
}
|
[["+", 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]) {
cout << "NA/n";
continue;
}
for (int i = 0; i < 10; i++) {
if (N[0] == '6' && N[1] == '1' && N[2] == '7' && N[3] == '4') {
cout << i << endl;
break;
}
L = S = 0;
sort(N, N + 4);
for (int j = 0; j < 4; j++)
S += (N[j] - '0') * pow(10, 3 - j);
reverse(N, N + 4);
for (int j = 0; j < 4; j++)
L += (N[j] - '0') * pow(10, 3 - j);
d = L - S;
for (int j = 0; j < 4; j++) {
N[j] = (d / (int)pow(10, 3 - j)) + '0';
d -= (N[j] - '0') * (int)pow(10, 3 - j);
}
}
}
}
|
#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]) {
cout << "NA" << endl;
continue;
}
for (int i = 0; i < 10; i++) {
if (N[0] == '6' && N[1] == '1' && N[2] == '7' && N[3] == '4') {
cout << i << endl;
break;
}
L = S = 0;
sort(N, N + 4);
for (int j = 0; j < 4; j++)
S += (N[j] - '0') * pow(10, 3 - j);
reverse(N, N + 4);
for (int j = 0; j < 4; j++)
L += (N[j] - '0') * pow(10, 3 - j);
d = L - S;
for (int j = 0; j < 4; j++) {
N[j] = (d / (int)pow(10, 3 - j)) + '0';
d -= (N[j] - '0') * (int)pow(10, 3 - j);
}
}
}
}
|
[["-", 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))
n = n if len(n) >= 4 else n.zfill(4)
print(n)
cnt += 1
print(cnt)
|
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))
n = n if len(n) >= 4 else n.zfill(4)
cnt += 1
print(cnt)
|
[["-", 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
print(cnt)
|
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++) {
sum += sc.nextInt();
}
for (int i = 0; i < n - 1; i++) {
b[i] = sc.nextInt();
}
Arrays.sort(b);
long p = 0;
for (int i = 0; i < n; i++) {
c[i] = (sum + p) * (n - i);
if (i != n - 1)
p += b[n - 2];
}
Arrays.sort(c);
System.out.println(c[n - 1]);
}
}
}
|
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++) {
sum += sc.nextInt();
}
for (int i = 0; i < n - 1; i++) {
b[i] = sc.nextInt();
}
Arrays.sort(b);
long p = 0;
for (int i = 0; i < n; i++) {
c[i] = (sum + p) * (n - i);
if (i != n - 1)
p += b[n - 2 - i];
}
Arrays.sort(c);
System.out.println(c[n - 1]);
}
}
}
|
[["+", 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-- * s, i);
}
}
|
#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-- * s, i);
}
}
|
[["-", 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 >> v[j];
sum += v[j];
}
sort(v, v + n - 1);
int ptr = 0;
while (ptr++ < n) {
if (ptr * sum < (ptr + 1) * (sum - v[ptr - 1])) {
sum -= v[ptr - 1];
} else {
break;
}
}
cout << ptr * sum << endl;
}
return 0;
}
|
#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 >> v[j];
sum += v[j];
}
sort(v, v + n - 1);
int ptr = 0;
while (ptr++ < n - 1) {
if (ptr * sum < (ptr + 1) * (sum - v[ptr - 1])) {
sum -= v[ptr - 1];
} else {
break;
}
}
cout << ptr * sum << endl;
}
return 0;
}
|
[["+", 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("%lld", &p);
paipu += p;
}
for (i = 0; i < n - 1; i++)
scanf("%lld", &joi[i]);
sort(joi, joi + n - 1, greater<int>());
max = paipu * honsuu;
for (i = 0; i < n - 1; i++) {
paipu += joi[i];
honsuu--;
m = paipu * honsuu;
if (max < m)
max = m;
}
printf("%lld", max);
}
return 0;
}
|
#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("%lld", &p);
paipu += p;
}
for (i = 0; i < n - 1; i++)
scanf("%lld", &joi[i]);
sort(joi, joi + n - 1, greater<int>());
max = paipu * honsuu;
for (i = 0; i < n - 1; i++) {
paipu += joi[i];
honsuu--;
m = paipu * honsuu;
if (max < m)
max = m;
}
printf("%lld\n", max);
}
return 0;
}
|
[["+", 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(" %d", &joi[i]);
}
sort(joi, joi + n, greater<int>());
long long int ans = suml * n;
for (int i = 0; i < n - 1; i++) {
if (ans > (suml + joi[i]) * (n - (i + 1))) {
break;
}
suml += joi[i];
ans = suml * (n - (i + 1));
}
cout << ans;
}
return 0;
}
|
#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(" %d", &joi[i]);
}
sort(joi, joi + n, greater<int>());
long long int ans = suml * n;
for (int i = 0; i < n - 1; i++) {
if (ans > (suml + joi[i]) * (n - (i + 1))) {
break;
}
suml += joi[i];
ans = suml * (n - (i + 1));
}
cout << ans << endl;
}
return 0;
}
|
[["+", 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];
}
for (int i = 0; i < n - 1; ++i) {
scanf("%d", &j[i]);
}
sort(j, j + n - 1, greater<long>());
long res = sum * n;
for (int i = 0; i < n - 1; ++i) {
sum += j[i];
res = max(res, sum * (n - 1 - i));
}
printf("%d\n", res);
}
return 0;
}
|
#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];
}
for (int i = 0; i < n - 1; ++i) {
scanf("%ld", &j[i]);
}
sort(j, j + n - 1, greater<long>());
long res = sum * n;
for (int i = 0; i < n - 1; ++i) {
sum += j[i];
res = max(res, sum * (n - 1 - i));
}
printf("%ld\n", res);
}
return 0;
}
|
[["-", 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 = 6000;
break;
case 2:
kingaku = 4000;
break;
case 3:
kingaku = 3000;
break;
case 4:
kingaku = 2000;
break;
}
goukei[n] = syurui * maisuu;
}
}
public void hyouji() {
for (n = 0; n < 3; n++) {
System.out.println(goukei[n]);
}
}
public static void main(String[] args) {
Main m = new Main();
m.syurui();
m.hyouji();
}
}
|
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 = 6000;
break;
case 2:
kingaku = 4000;
break;
case 3:
kingaku = 3000;
break;
case 4:
kingaku = 2000;
break;
}
goukei[n] = kingaku * maisuu;
}
}
public void hyouji() {
for (n = 0; n <= 3; n++) {
System.out.println(goukei[n]);
}
}
public static void main(String[] args) {
Main m = new Main();
m.syurui();
m.hyouji();
}
}
|
[["-", 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;
break;
}
if (t == 1) {
printf("%d\n", iti);
} else if (t == 2) {
printf("%d\n", ni);
} else if (t == 3) {
printf("%d\n", san);
} else {
printf("%d\n", si);
}
}
return 0;
}
|
#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;
break;
}
if (t == 1) {
printf("%d\n", iti);
} else if (t == 2) {
printf("%d\n", ni);
} else if (t == 3) {
printf("%d\n", san);
} else {
printf("%d\n", si);
}
}
return 0;
}
|
[["-", 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);
} else if (t == 4) {
g = 2000 * n;
printf("%d", g);
}
}
return 0;
}
|
#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);
} else if (t == 4) {
g = 2000 * n;
printf("%d\n", g);
}
}
return 0;
}
|
[["+", 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);
}
return 0;
}
|
#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);
}
return 0;
}
|
[["-", 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] = a[d] * b[d];
printf("%d", c[d]);
}
return 0;
}
|
#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] = a[d] * b[d];
printf("%d\n", c[d]);
}
return 0;
}
|
[["+", 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 << (long long)b * 2000 << "\n";
}
}
return 0;
}
|
#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;
case 4:
cout << (long long)b * 2000 << "\n";
break;
}
}
return 0;
}
|
[["+", 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;
}
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)
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;
}
return 0;
}
|
[["-", 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:
printf("%d", b * 2000);
break;
}
}
return 0;
}
|
#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:
printf("%d\n", b * 2000);
break;
}
}
return 0;
}
|
[["+", 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();
}
}
for (int i = 0; i < N; i++) {
if (X[i][2] - 5 > 0) {
if (X[i][3] - 2 > 0) {
int ans = (int)((X[i][0] * X[i][2] + X[i][1] * X[i][3]) * 0.8);
System.out.println(ans);
} else {
if ((X[i][0] * X[i][2] + X[i][1] * 2) * 0.8 <
X[i][0] * X[i][2] + X[i][1] + X[i][3]) {
int ans = (int)((X[i][0] * X[i][2] + X[i][1] * 2) * 0.8);
System.out.println(ans);
} else {
System.out.println(X[i][0] * X[i][2] + X[i][1] * X[i][3]);
}
}
} else if (X[i][3] - 2 > 0) {
if ((X[i][0] * 5 + X[i][1] * X[i][3]) * 0.8 <
X[i][0] * X[i][2] + X[i][1] + X[i][3]) {
int ans = (int)((X[i][0] * 5 + X[i][1] * X[i][3]) * 0.8);
System.out.println(ans);
} else {
System.out.println(X[i][0] * X[i][2] + X[i][1] * X[i][3]);
}
} else {
if ((X[i][0] * 5 + X[i][1] * 2) * 0.8 <
X[i][0] * X[i][2] + X[i][1] + X[i][3]) {
int ans = (int)((X[i][0] * 5 + X[i][1] * 2) * 0.8);
System.out.println(ans);
} else {
System.out.println(X[i][0] * X[i][2] + X[i][1] * X[i][3]);
}
}
}
}
}
|
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();
}
}
for (int i = 0; i < N; i++) {
if (X[i][2] - 5 > 0) {
if (X[i][3] - 2 > 0) {
int ans = (int)((X[i][0] * X[i][2] + X[i][1] * X[i][3]) * 0.8);
System.out.println(ans);
} else {
if ((X[i][0] * X[i][2] + X[i][1] * 2) * 0.8 <
X[i][0] * X[i][2] + X[i][1] * X[i][3]) {
int ans = (int)((X[i][0] * X[i][2] + X[i][1] * 2) * 0.8);
System.out.println(ans);
} else {
System.out.println(X[i][0] * X[i][2] + X[i][1] * X[i][3]);
}
}
} else if (X[i][3] - 2 > 0) {
if ((X[i][0] * 5 + X[i][1] * X[i][3]) * 0.8 <
X[i][0] * X[i][2] + X[i][1] * X[i][3]) {
int ans = (int)((X[i][0] * 5 + X[i][1] * X[i][3]) * 0.8);
System.out.println(ans);
} else {
System.out.println(X[i][0] * X[i][2] + X[i][1] * X[i][3]);
}
} else {
if ((X[i][0] * 5 + X[i][1] * 2) * 0.8 <
X[i][0] * X[i][2] + X[i][1] * X[i][3]) {
int ans = (int)((X[i][0] * 5 + X[i][1] * 2) * 0.8);
System.out.println(ans);
} else {
System.out.println(X[i][0] * X[i][2] + X[i][1] * X[i][3]);
}
}
}
}
}
|
[["-", 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 * b + y * p;
if (b >= 5 && p >= 2) {
wari = kin * 4 / 5;
} else if (b < 5) {
b = 5;
} else if (p < 2) {
p = 2;
}
wari = (x * b + y * p) * 4 / 5;
if (kin > wari) {
kin = wari;
}
System.out.print(kin);
}
}
public static void main(String[] args) {
Main obj = new Main();
obj.solve();
}
}
|
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 * b + y * p;
if (b >= 5 && p >= 2) {
wari = kin * 4 / 5;
} else {
if (b < 5) {
b = 5;
}
if (p < 2) {
p = 2;
}
wari = (x * b + y * p) * 4 / 5;
}
if (kin > wari) {
kin = wari;
}
System.out.println(kin);
}
}
public static void main(String[] args) {
Main obj = new Main();
obj.solve();
}
}
|
[["+", 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.println((a * c + b * d) * 8 / 10);
} else {
System.out.println(Math.min(
a * c + b * d,
(a * (c < 5 ? 5 - c : c) + b * (d < 2 ? 2 - d : d)) * 8 / 10));
}
}
}
}
|
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.println((a * c + b * d) * 8 / 10);
} else {
System.out.println(
Math.min(a * c + b * d,
(a * (c < 5 ? 5 : c) + b * (d < 2 ? 2 : d)) * 8 / 10));
}
}
}
}
|
[["-", 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 ans1, ans2;
if (bathN >= 5 && poolN >= 2) {
System.out.println((int)((bath * bathN) + (pool * poolN)) * 0.8);
} else {
if (bathN >= 5 && poolN < 2) {
ans1 = (bath * bathN) + (pool * poolN);
poolN = 2;
ans2 = (int)(((bath * bathN) + (pool * poolN)) * 0.8);
System.out.println((int)Math.min(ans1, ans2));
} else if (bathN < 5 && poolN >= 2) {
ans1 = (bath * bathN) + (pool * poolN);
bathN = 5;
ans2 = (int)(((bath * bathN) + (pool * poolN)) * 0.8);
System.out.println((int)Math.min(ans1, ans2));
} else {
ans1 = (bath * bathN) + (pool * poolN);
bathN = 5;
poolN = 2;
ans2 = (int)(((bath * bathN) + (pool * poolN)) * 0.8);
System.out.println((int)Math.min(ans1, ans2));
}
}
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
new Main().doIt();
}
}
|
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 ans1, ans2;
if (bathN >= 5 && poolN >= 2) {
System.out.println((int)(((bath * bathN) + (pool * poolN)) * 0.8));
} else {
if (bathN >= 5 && poolN < 2) {
ans1 = (bath * bathN) + (pool * poolN);
poolN = 2;
ans2 = (int)(((bath * bathN) + (pool * poolN)) * 0.8);
System.out.println((int)Math.min(ans1, ans2));
} else if (bathN < 5 && poolN >= 2) {
ans1 = (bath * bathN) + (pool * poolN);
bathN = 5;
ans2 = (int)((((bath * bathN) + (pool * poolN)) * 0.8));
System.out.println((int)Math.min(ans1, ans2));
} else {
ans1 = (bath * bathN) + (pool * poolN);
bathN = 5;
poolN = 2;
ans2 = (int)((((bath * bathN) + (pool * poolN)) * 0.8));
System.out.println((int)Math.min(ans1, ans2));
}
}
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
new Main().doIt();
}
}
|
[["+", 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 {
if (x < 5) {
x = 5;
}
if (y < 2) {
y = 2;
}
if (sum_price > discount(x * b + y * p)) {
sum_price = discount(x * b + y * p);
}
}
printf("%d\n", sum_price);
}
return 0;
}
|
#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 {
if (b < 5) {
b = 5;
}
if (p < 2) {
p = 2;
}
if (sum_price > discount(x * b + y * p)) {
sum_price = discount(x * b + y * p);
}
}
printf("%d\n", sum_price);
}
return 0;
}
|
[["-", 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, 64, 9, 0, 1, 0, 11, 31, 22]]
| 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 && p < 2) {
fee2 = (x * b + y * 2) * 4 / 5;
if (fee1 < fee2) {
return (fee1);
}
return (fee2);
}
fee2 = (x * b + y * 2) * 4 / 5;
if (fee1 < fee2) {
return (fee1);
}
return (fee2);
}
int main(void) {
int N;
int x, y, b, p;
int i;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d%d%d%d", &x, &y, &b, &p);
printf("%d\n", fee(x, y, b, p));
}
return (0);
}
|
#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 && p < 2) {
fee2 = (x * b + y * 2) * 4 / 5;
if (fee1 < fee2) {
return (fee1);
}
return (fee2);
}
fee2 = (x * 5 + y * 2) * 4 / 5;
if (fee1 < fee2) {
return (fee1);
}
return (fee2);
}
int main(void) {
int N;
int x, y, b, p;
int i;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d%d%d%d", &x, &y, &b, &p);
printf("%d\n", fee(x, y, b, p));
}
return (0);
}
|
[["-", 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 + po * pm) * 0.8;
} else {
ryokin[i] = (nyu * nm + po * pm);
}
} else {
ryokin[i] = (nyu * nm + po * pm);
}
kari1 = (nyu * nm + po * 2) * 0.8;
kari2 = nyu * 5 + po * pm;
if (nm >= 5 && pm < 2) {
if (ryokin[i] > kari1) {
ryokin[i] = kari1;
}
}
if (nm < 5 && pm >= 2) {
if (ryokin[i] > kari2) {
ryokin[i] = kari2;
}
}
}
for (i = 0; i < n; i++) {
printf("%d\n", ryokin[i]);
}
return 0;
}
|
#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 + po * pm) * 0.8;
} else {
ryokin[i] = (nyu * nm + po * pm);
}
} else {
ryokin[i] = (nyu * nm + po * pm);
}
kari1 = (nyu * nm + po * 2) * 0.8;
kari2 = (nyu * 5 + po * pm) * 0.8;
if (nm >= 5 && pm < 2) {
if (ryokin[i] > kari1) {
ryokin[i] = kari1;
}
}
if (nm < 5 && pm >= 2) {
if (ryokin[i] > kari2) {
ryokin[i] = kari2;
}
}
}
for (i = 0; i < n; i++) {
printf("%d\n", ryokin[i]);
}
return 0;
}
|
[["+", 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;
} else if (b < 5 && p >= 2 && r > (x * 5 + y * p) * 0.8) {
r = (x * 5 + y * p) * 0.8;
} else if (b < 5 && b < 2 && r > (x * 5 + y * 2) * 0.8) {
r = (x * 5 + y * 2) * 0.8;
}
printf("%d\n", r);
}
return 0;
}
|
#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;
} else if (b < 5 && p >= 2 && r > (x * 5 + y * p) * 0.8) {
r = (x * 5 + y * p) * 0.8;
} else if (b < 5 && p < 2 && r > (x * 5 + y * 2) * 0.8) {
r = (x * 5 + y * 2) * 0.8;
}
printf("%d\n", r);
}
return 0;
}
|
[["-", 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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
//#include <boost/foreach.hpp>
//#include <boost/range/algorithm.hpp>
#define rep(i, j, k) for (int i = (int)j; i < (int)k; i++)
#define ll long long
#define Sort(v) sort(all(v))
#define INF 1e9
#define LINF 1e18
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define MP make_pair
#define MOD 1000000007LL
#define int long long
using namespace std;
int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
struct edge {
int to, cost;
};
// typedef pair<int,int> P;
bool isupper(char c) {
if ('A' <= c && c <= 'Z')
return 1;
return 0;
}
bool islower(char c) {
if ('a' <= c && c <= 'z')
return 1;
return 0;
}
bool isPrime(int x) {
if (x == 1)
return 0;
if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (int i = 3; i * i <= x; i++)
if (x % i == 0)
return 0;
return 1;
}
bool iskaibun(string s) {
for (int i = 0; i < s.size() / 2; i++)
if (s[i] != s[s.size() - i - 1])
return 0;
return 1;
}
bool isnumber(char c) { return ('0' <= c && c <= '9'); }
bool isalpha(char c) { return (isupper(c) && islower(c)); }
void printvi(vector<int> v) {
rep(i, 0, v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
void printvil(vector<int> v) {
rep(i, 0, v.size()) { cout << v[i] << endl; }
}
void printvvi(vector<vector<int>> v) {
rep(i, 0, v.size()) {
rep(j, 0, v[i].size()) {
if (j)
cout << " ";
cout << v[i][j];
}
cout << endl;
}
}
void printvstr(vector<string> v) {
rep(i, 0, v.size()) { cout << v[i] << endl; }
}
signed main() {
int n;
cin >> n;
rep(i, 0, n) {
int x, y, p, q, ans = 0;
cin >> x >> y >> p >> q;
if (p < 5 and q < 2)
ans = min(p * x + y * q, (int)((5 * x + y * 2) * 0.8));
else if (p >= 5 and q >= 2)
ans = (int)((p * x + y * q) * 0.8);
else if (p < 5 and q >= 2)
ans = min(p * x + q * y, (int)((x * 2 + q * y) * 0.8));
else if (p >= 5 and q < 2)
ans = min(p * x + q * y, (int)((p * x + 2 * y) * 0.8));
cout << ans << endl;
}
}
/*
普通に買う
p<5
q<2の時、普通に買うときと、いっそ5枚と2枚で買って割り引かれる方が安いかもしれない
p>=5, q>=2の時、自明に割り引かれた方が安い
p>=5, q<2 または p<5 , q>=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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
//#include <boost/foreach.hpp>
//#include <boost/range/algorithm.hpp>
#define rep(i, j, k) for (int i = (int)j; i < (int)k; i++)
#define ll long long
#define Sort(v) sort(all(v))
#define INF 1e9
#define LINF 1e18
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define MP make_pair
#define MOD 1000000007LL
#define int long long
using namespace std;
int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
struct edge {
int to, cost;
};
// typedef pair<int,int> P;
bool isupper(char c) {
if ('A' <= c && c <= 'Z')
return 1;
return 0;
}
bool islower(char c) {
if ('a' <= c && c <= 'z')
return 1;
return 0;
}
bool isPrime(int x) {
if (x == 1)
return 0;
if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (int i = 3; i * i <= x; i++)
if (x % i == 0)
return 0;
return 1;
}
bool iskaibun(string s) {
for (int i = 0; i < s.size() / 2; i++)
if (s[i] != s[s.size() - i - 1])
return 0;
return 1;
}
bool isnumber(char c) { return ('0' <= c && c <= '9'); }
bool isalpha(char c) { return (isupper(c) && islower(c)); }
void printvi(vector<int> v) {
rep(i, 0, v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
void printvil(vector<int> v) {
rep(i, 0, v.size()) { cout << v[i] << endl; }
}
void printvvi(vector<vector<int>> v) {
rep(i, 0, v.size()) {
rep(j, 0, v[i].size()) {
if (j)
cout << " ";
cout << v[i][j];
}
cout << endl;
}
}
void printvstr(vector<string> v) {
rep(i, 0, v.size()) { cout << v[i] << endl; }
}
signed main() {
int n;
cin >> n;
rep(i, 0, n) {
int x, y, p, q, ans = 0;
cin >> x >> y >> p >> q;
if (p < 5 and q < 2)
ans = min(p * x + y * q, (int)((5 * x + y * 2) * 0.8));
else if (p >= 5 and q >= 2)
ans = (int)((p * x + y * q) * 0.8);
else if (p < 5 and q >= 2)
ans = min(p * x + q * y, (int)((x * 5 + q * y) * 0.8));
else if (p >= 5 and q < 2)
ans = min(p * x + q * y, (int)((p * x + 2 * y) * 0.8));
cout << ans << endl;
}
}
/*
普通に買う
p<5
q<2の時、普通に買うときと、いっそ5枚と2枚で買って割り引かれる方が安いかもしれない
p>=5, q>=2の時、自明に割り引かれた方が安い
p>=5, q<2 または p<5 , q>=2の時、多めに買って割り引かれるか普通に買うか
*/
|
[["-", 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)
#define rep(i, n) reep((i), 0, (n))
#define ALL(v) (v).begin(), (v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair
static const double PI = 6 * asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
static const int INF = 1 << 24;
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
// v.erase(unique(v.begin(),v.end()),v.end());
int main() {
int n;
rep(i, n) {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans1 = 0, ans2 = 0;
ans1 = a * c + b * d;
if (c < 5)
c = 5;
if (d < 2)
d = 2;
ans2 = a * c + b * d;
ans2 = ans2 * 4 / 5;
cout << min(ans1, ans2) << endl;
}
}
|
#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)
#define rep(i, n) reep((i), 0, (n))
#define ALL(v) (v).begin(), (v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair
static const double PI = 6 * asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
static const int INF = 1 << 24;
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
// v.erase(unique(v.begin(),v.end()),v.end());
int main() {
int n;
cin >> n;
rep(i, n) {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans1 = 0, ans2 = 0;
ans1 = a * c + b * d;
if (c < 5)
c = 5;
if (d < 2)
d = 2;
ans2 = a * c + b * d;
ans2 = ans2 * 4 / 5;
cout << min(ans1, ans2) << endl;
}
}
|
[["+", 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 * p;
xbyp = xb + yp;
if (b < 5) {
b = 5;
}
if (p < 2) {
p = 2;
}
xb2 = x * b;
yp2 = y * p;
xbyp3 = (xb2 + yp2) * 8 / 10;
xbyp2 = (xb + yp) * 8 / 10;
if (xbyp3 < xbyp) {
printf("%d\n", xbyp3);
} else if (xbyp < xbyp3) {
printf("%d\n", xbyp);
}
else if (xbyp2 < xbyp) {
printf("%d\n", xbyp2);
}
}
return 0;
}
|
#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 * p;
xbyp = xb + yp;
if (b < 5) {
b = 5;
}
if (p < 2) {
p = 2;
}
xb2 = x * b;
yp2 = y * p;
xbyp3 = (xb2 + yp2) * 8 / 10;
xbyp2 = (xb + yp) * 8 / 10;
if (xbyp3 <= xbyp) {
printf("%d\n", xbyp3);
} else if (xbyp <= xbyp3) {
printf("%d\n", xbyp);
} else if (xbyp2 <= xbyp) {
printf("%d\n", xbyp2);
}
}
return 0;
}
|
[["-", 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);
printf("%d\n", min(ans, (int)(sum * 0.8)));
}
}
|
#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);
printf("%d\n", min(ans, (int)(sum * 0.8)));
}
}
|
[["-", 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 {
int a1 = b * x + p * y;
if (b >= 5) {
int a2 = (b * x + 2 * y) * 0.8;
ans = min(a1, a2);
} else if (p >= 2) {
int a3 = (5 * x + b * y) * 0.8;
ans = min(a1, a3);
} else {
int a4 = (5 * x + 2 * y) * 0.8;
ans = min(a1, a4);
}
}
cout << ans << endl;
}
return 0;
}
|
#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 {
int a1 = b * x + p * y;
if (b >= 5) {
int a2 = (b * x + 2 * y) * 0.8;
ans = min(a1, a2);
} else if (p >= 2) {
int a3 = (5 * x + p * y) * 0.8;
ans = min(a1, a3);
} else {
int a4 = (5 * x + 2 * y) * 0.8;
ans = min(a1, a4);
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 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;
}
}
if (b <= 5 && p >= 2) {
if (x * b + y * p > (x * 5 + y * p) * 0.8) {
a[i] = (x * 5 + y * p) * 0.8;
} else {
a[i] = x * b + y * p;
}
}
if (b <= 5 && p <= 2) {
if (x * b + y * p > (x * 5 + y * 2) * 0.8) {
a[i] = (x * 5 + y * 2) * 0.8;
} else {
a[i] = x * b + y * p;
}
}
if (b >= 5 && p >= 2) {
a[i] = (x * 5 + y * 2) * 0.8;
}
}
for (j = 0; j < n; j++) {
printf("%d\n", a[j]);
}
return 0;
}
|
#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;
}
}
if (b <= 5 && p >= 2) {
if (x * b + y * p > (x * 5 + y * p) * 0.8) {
a[i] = (x * 5 + y * p) * 0.8;
} else {
a[i] = x * b + y * p;
}
}
if (b <= 5 && p <= 2) {
if (x * b + y * p > (x * 5 + y * 2) * 0.8) {
a[i] = (x * 5 + y * 2) * 0.8;
} else {
a[i] = x * b + y * p;
}
}
if (b >= 5 && p >= 2) {
a[i] = (x * b + y * p) * 0.8;
}
}
for (j = 0; j < n; j++) {
printf("%d\n", a[j]);
}
return 0;
}
|
[["-", 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;
}
|
[["+", 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) << endl;
if (b < 5 && p >= 2)
cout << min(x * b + y * p, (x * 5 + y * p) * 4 / 5) << endl;
if (b < 5 && p < 2)
cout << min(x * b + y * p, (x * 5 + y * 2) * 4 / 5) << endl;
}
return 0;
}
|
#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 / 5) << endl;
if (b < 5 && p >= 2)
cout << min(x * b + y * p, (x * 5 + y * p) * 4 / 5) << endl;
if (b < 5 && p < 2)
cout << min(x * b + y * p, (x * 5 + y * 2) * 4 / 5) << endl;
}
return 0;
}
|
[["+", 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 <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
int main() {
int n;
cin >> n;
int ans = 0;
rep(_, n) {
int a, b, c, d;
cin >> a >> b >> c >> d;
int temp = 0;
if (c >= 5 && d >= 2)
temp = 0.8 * (a * c + b * d);
else {
temp = (a * c + b * d);
int t = c, u = d;
if (t < 5)
t = 5 - c;
if (u < 2)
u = 2;
cmin(temp, 0.8 * (a * t + b * u));
}
cout << temp << endl;
}
}
|
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define all(in) in.begin(), in.end()
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
int main() {
int n;
cin >> n;
int ans = 0;
rep(_, n) {
int a, b, c, d;
cin >> a >> b >> c >> d;
int temp = 0;
if (c >= 5 && d >= 2)
temp = 0.8 * (a * c + b * d);
else {
temp = (a * c + b * d);
int t = c, u = d;
if (t < 5)
t = 5;
if (u < 2)
u = 2;
cmin(temp, 0.8 * (a * t + b * u));
}
cout << temp << endl;
}
}
|
[["-", 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 MOD = 1000000000 + 7;
constexpr int INF = 2000000000;
int main() {
int n;
int x, y, b, p;
for (int i = 0; i < n; i++) {
cin >> x >> y >> b >> p;
cout << min({x * b + y * p, (max(b, 5) * x + max(p, 2) * y) * 4 / 5})
<< endl;
}
}
|
#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 MOD = 1000000000 + 7;
constexpr int INF = 2000000000;
int main() {
int n;
cin >> n;
int x, y, b, p;
for (int i = 0; i < n; i++) {
cin >> x >> y >> b >> p;
cout << min({x * b + y * p, (max(b, 5) * x + max(p, 2) * y) * 4 / 5})
<< endl;
}
}
|
[["+", 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 >= 5 && p < 2 && (int)((x * b + y * 2) * 0.8) < ans)
ans = (int)((x * b + y * 2) * 0.8);
if (b < 5 && p < 2 && (int)((x * 5 + y * 2) * 0.8) < ans)
ans = (int)((x * 5 + y * 2) * 0.8);
if (b >= 5 && p >= y && (int)((x * b + y * p) * 0.8) < ans)
ans = (int)((x * b + y * p) * 0.8);
printf("%d\n", ans);
}
return 0;
}
|
#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 >= 5 && p < 2 && (int)((x * b + y * 2) * 0.8) < ans)
ans = (int)((x * b + y * 2) * 0.8);
if (b < 5 && p < 2 && (int)((x * 5 + y * 2) * 0.8) < ans)
ans = (int)((x * 5 + y * 2) * 0.8);
if (b >= 5 && p >= 2 && (int)((x * b + y * p) * 0.8) < ans)
ans = (int)((x * b + y * p) * 0.8);
printf("%d\n", ans);
}
return 0;
}
|
[["-", 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 % 400 == 0))
d++;
d = (d + ms[b[1] - 1] + b[2] - 734858) % 1872000;
for (i = 0; i < 5; i++) {
k = d / g[i];
cout << k;
if (i != 4)
cout << '.';
d -= k * g[i];
}
cout << endl;
}
void bkym(int *b) {
int i, e, c, y, m, d, h;
for (i = d = 0; i < 5; i++)
d += g[i] * b[i];
d += 734858;
for (y = d / 366; y <= d / 365; y++) {
e = y * 365 + y / 4 - y / 100 + y / 400;
if (e + 1 > d)
break;
}
d -= (y - 1) * 365 + (y - 1) / 4 - (y - 1) / 100 + (y - 1) / 400;
for (m = 1, c = h = 0; m < 12; m++) {
if (m > 1 && ((y % 4 == 0 && y % 100 != 0) || y % 400 == 0))
c = 1;
if (d > h && d <= ms[m] + c)
break;
h = ms[m] + c;
}
d -= h;
cout << y << '.' << m << '.' << d << endl;
}
int main() {
int i, a, s, b[5];
char c[50];
while (true) {
cin >> c;
a = 0;
s = 0;
if (c[0] == '#')
break;
for (i = 0; c[i] != '\0'; i++, s *= 10) {
if (c[i] != '.')
s += c[i] - '0';
if (c[i + 1] == '.' || c[i + 1] == '\0') {
b[a++] = s;
s = 0;
}
}
if (a == 3)
ymbk(b);
else
bkym(b);
}
return 0;
}
|
#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 % 400 == 0))
d++;
d = (d + ms[b[1] - 1] + b[2] - 734858) % 1872000;
for (i = 0; i < 5; i++) {
k = d / g[i];
cout << k;
if (i != 4)
cout << '.';
d -= k * g[i];
}
cout << endl;
}
void bkym(int *b) {
int i, e, c, y, m, d, h;
for (i = d = 0; i < 5; i++)
d += g[i] * b[i];
d += 734858;
for (y = d / 366; y <= d / 365; y++) {
e = y * 365 + y / 4 - y / 100 + y / 400;
if (e + 1 > d)
break;
}
d -= (y - 1) * 365 + (y - 1) / 4 - (y - 1) / 100 + (y - 1) / 400;
for (m = 1, c = h = 0; m < 12; m++) {
if (m > 1 && ((y % 4 == 0 && y % 100 != 0) || y % 400 == 0))
c = 1;
if (d > h && d <= ms[m] + c)
break;
h = ms[m] + c;
}
d -= h;
cout << y << '.' << m << '.' << d << endl;
}
int main() {
int i, a, s, b[5];
char c[50];
while (true) {
cin >> c;
a = 0;
s = 0;
if (c[0] == '#')
break;
for (i = 0; c[i] != '\0'; i++, s *= 10) {
if (c[i] != '.')
s += c[i] - '0';
if (c[i + 1] == '.' || c[i + 1] == '\0') {
b[a++] = s;
s = 0;
}
}
if (a == 3)
ymbk(b);
else
bkym(b);
}
return 0;
}
|
[["-", 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 % 4 == 0) {
if (year % 100 == 0) {
if (year % 400 == 0) {
return true;
} else {
return false;
}
} else {
return true;
}
} else {
return false;
}
}
int main() {
long long int sum, tmp, year, month, day, b, ka, t, w, ki, NUMBER = 735224;
int count, status;
char buf[100];
while (true) {
scanf("%s", buf);
if (buf[0] == '#')
break;
count = 0;
for (int i = 0; buf[i] != '\0'; i++) {
if (buf[i] == '.')
count++;
}
sum = 0;
if (count == 2) { //?\?????????\??????????????´???
status = 0;
tmp = 0;
//???????????´???????????\?????????
for (int i = 0; buf[i] != '\0'; i++) {
if (buf[i] >= '0' && buf[i] <= '9') {
tmp = 10 * tmp + (buf[i] - '0');
if (buf[i + 1] == '\0') {
day = tmp;
}
} else {
if (status == 0) {
year = tmp;
} else {
month = tmp;
}
status++;
tmp = 0;
}
}
if (year == 2012) {
sum = day - 21;
} else {
sum += 10;
// 2013???year-1??´?????§?????\??°???????¨?
for (int i = 2013; i <= year - 1; i++) {
if (isLeapYear(i))
sum += 366;
else {
sum += 365;
}
}
for (int i = 1; i <= month - 1; i++) {
if (i == 2 && isLeapYear(year) == true) {
sum += 29;
} else {
sum += monthTable[i];
}
}
sum += day;
}
printf("%lld.", (sum / 144000) % 13);
sum %= 144000;
printf("%lld.", sum / 7200);
sum %= 7200;
printf("%lld.", sum / 360);
sum %= 360;
printf("%lld.", sum / 20);
sum %= 20;
printf("%lld\n", sum);
} else { //????????´?????\??????????????´???
status = 0;
tmp = 0;
for (int i = 0; buf[i] != '\0'; i++) {
if (buf[i] >= '0' && buf[i] <= '9') {
tmp = 10 * tmp + (buf[i] - '0');
if (buf[i + 1] == '\0') {
ki = tmp;
}
} else {
if (status == 0) {
b = tmp;
} else if (status == 1) {
ka = tmp;
} else if (status == 2) {
t = tmp;
} else if (status == 3) {
w = tmp;
}
status++;
tmp = 0;
}
}
sum = 144000 * b + 7200 * ka + 360 * t + 20 * w + ki + NUMBER;
year = 0, month = 1;
for (int i = 0; sum > 366; i++) {
if (isLeapYear(i)) {
sum -= 366;
} else {
sum -= 365;
}
year++;
}
if ((sum <= 365) || (sum == 366 && isLeapYear(year))) {
if (isLeapYear(year)) {
for (int i = 1; i <= 11 && sum > monthTable2[i + 1]; i++) {
sum -= monthTable2[i];
month++;
}
} else {
for (int i = 1; i <= 11 && sum > monthTable[i + 1]; i++) {
sum -= monthTable[i];
month++;
}
}
} else { //?????¨366??\??§??????year??????????????´??§??????
year++;
month = 1;
sum = 1;
}
printf("%lld.%lld.%lld\n", (year) % 10000001, month, sum);
}
}
return 0;
}
|
#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 % 4 == 0) {
if (year % 100 == 0) {
if (year % 400 == 0) {
return true;
} else {
return false;
}
} else {
return true;
}
} else {
return false;
}
}
int main() {
long long int sum, tmp, year, month, day, b, ka, t, w, ki, NUMBER = 735224;
int count, status;
char buf[100];
while (true) {
scanf("%s", buf);
if (buf[0] == '#')
break;
count = 0;
for (int i = 0; buf[i] != '\0'; i++) {
if (buf[i] == '.')
count++;
}
sum = 0;
if (count == 2) {
status = 0;
tmp = 0;
for (int i = 0; buf[i] != '\0'; i++) {
if (buf[i] >= '0' && buf[i] <= '9') {
tmp = 10 * tmp + (buf[i] - '0');
if (buf[i + 1] == '\0') {
day = tmp;
}
} else {
if (status == 0) {
year = tmp;
} else {
month = tmp;
}
status++;
tmp = 0;
}
}
if (year == 2012) {
sum = day - 21;
} else {
sum += 10;
for (int i = 2013; i <= year - 1; i++) {
if (isLeapYear(i))
sum += 366;
else {
sum += 365;
}
}
for (int i = 1; i <= month - 1; i++) {
if (i == 2 && isLeapYear(year) == true) {
sum += 29;
} else {
sum += monthTable[i];
}
}
sum += day;
}
printf("%lld.", (sum / 144000) % 13);
sum %= 144000;
printf("%lld.", sum / 7200);
sum %= 7200;
printf("%lld.", sum / 360);
sum %= 360;
printf("%lld.", sum / 20);
sum %= 20;
printf("%lld\n", sum);
} else { //????????´?????\??????????????´???
status = 0;
tmp = 0;
for (int i = 0; buf[i] != '\0'; i++) {
if (buf[i] >= '0' && buf[i] <= '9') {
tmp = 10 * tmp + (buf[i] - '0');
if (buf[i + 1] == '\0') {
ki = tmp;
}
} else {
if (status == 0) {
b = tmp;
} else if (status == 1) {
ka = tmp;
} else if (status == 2) {
t = tmp;
} else if (status == 3) {
w = tmp;
}
status++;
tmp = 0;
}
}
sum = 144000 * b + 7200 * ka + 360 * t + 20 * w + ki + NUMBER;
year = 0, month = 1;
for (int i = 0; sum > 366; i++) {
if (isLeapYear(i)) {
sum -= 366;
} else {
sum -= 365;
}
year++;
}
if ((sum <= 365) || (sum == 366 && isLeapYear(year))) {
if (isLeapYear(year)) {
for (int i = 1; i <= 12 && sum > monthTable2[i]; i++) {
sum -= monthTable2[i];
month++;
}
} else {
for (int i = 1; i <= 12 && sum > monthTable[i]; i++) {
sum -= monthTable[i];
month++;
}
}
} else {
year++;
month = 1;
sum = 1;
}
printf("%lld.%lld.%lld\n", (year) % 10000001, month, sum);
}
}
return 0;
}
|
[["-", 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 % 400 == 0); }
int mn[]{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int calc(int y, int m, int d) {
int res = 0;
for (int i = 1; i < y; i++) {
res += 365;
if (is_uruu(i))
res++;
}
for (int i = 1; i < m; i++) {
res += mn[i - 1];
if (is_uruu(y) && i == 2)
res++;
}
return res + d;
}
int tod(int y, int m, int d) { return calc(y, m, d) - base; }
void tom(int day) {
int b, ka, t, w, ki;
ki = day % 20;
day /= 20;
w = day % 18;
day /= 18;
t = day % 20;
day /= 20;
ka = day % 20;
day /= 20;
b = day % 13;
printf("%lld.%lld.%lld.%lld.%lld", b, ka, t, w, ki);
}
void tos(int day) {
int y, m;
for (y = 1; 365 + is_uruu(y) < day; y++)
day -= 365 + is_uruu(y);
for (m = 1; mn[m - 1] + (m == 2 && is_uruu(y)) < day; m++)
day -= mn[m - 1] + (m == 2 && is_uruu(y));
printf("%lld.%lld.%lld\n", y, m, day);
}
signed main() {
base = calc(2012, 12, 21);
string s;
while (cin >> s, s != "#") {
if (count(s.begin(), s.end(), '.') == 2) {
int a = s.find('.');
int y = stoi(s.substr(0, a));
int b = s.find('.', a + 1);
int m = stoi(s.substr(a + 1, b - a));
int d = stoi(s.substr(b + 1));
tom(tod(y, m, d));
} else {
int a = s.find('.');
int ba = stoi(s.substr(0, a));
int b = s.find('.', a + 1);
int ka = stoi(s.substr(a + 1, b - a));
int c = s.find('.', b + 1);
int t = stoi(s.substr(b + 1, c - b));
int d = s.find('.', c + 1);
int w = stoi(s.substr(c + 1, d - c));
int ki = stoi(s.substr(d + 1));
tos(tod(ba, ka, t, w, ki));
}
}
}
|
#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 % 400 == 0); }
int mn[]{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int calc(int y, int m, int d) {
int res = 0;
for (int i = 1; i < y; i++) {
res += 365;
if (is_uruu(i))
res++;
}
for (int i = 1; i < m; i++) {
res += mn[i - 1];
if (is_uruu(y) && i == 2)
res++;
}
return res + d;
}
int tod(int y, int m, int d) { return calc(y, m, d) - base; }
void tom(int day) {
int b, ka, t, w, ki;
ki = day % 20;
day /= 20;
w = day % 18;
day /= 18;
t = day % 20;
day /= 20;
ka = day % 20;
day /= 20;
b = day % 13;
printf("%lld.%lld.%lld.%lld.%lld\n", b, ka, t, w, ki);
}
void tos(int day) {
int y, m;
for (y = 1; 365 + is_uruu(y) < day; y++)
day -= 365 + is_uruu(y);
for (m = 1; mn[m - 1] + (m == 2 && is_uruu(y)) < day; m++)
day -= mn[m - 1] + (m == 2 && is_uruu(y));
printf("%lld.%lld.%lld\n", y, m, day);
}
signed main() {
base = calc(2012, 12, 21);
string s;
while (cin >> s, s != "#") {
if (count(s.begin(), s.end(), '.') == 2) {
int a = s.find('.');
int y = stoi(s.substr(0, a));
int b = s.find('.', a + 1);
int m = stoi(s.substr(a + 1, b - a));
int d = stoi(s.substr(b + 1));
tom(tod(y, m, d));
} else {
int a = s.find('.');
int ba = stoi(s.substr(0, a));
int b = s.find('.', a + 1);
int ka = stoi(s.substr(a + 1, b - a));
int c = s.find('.', b + 1);
int t = stoi(s.substr(b + 1, c - b));
int d = s.find('.', c + 1);
int w = stoi(s.substr(c + 1, d - c));
int ki = stoi(s.substr(d + 1));
tos(tod(ba, ka, t, w, ki));
}
}
}
|
[["+", 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 % 400 == 0); }
int mn[]{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int calc(int y, int m, int d) {
int res = (y - 1) * 365;
for (int i = 4; i < 4; i += 4) {
if (is_uruu(i))
res++;
}
for (int i = 1; i < m; i++) {
res += mn[i - 1];
if (is_uruu(y) && i == 2)
res++;
}
return res + d;
}
int tod(int y, int m, int d) { return calc(y, m, d) - base; }
void tom(int day) {
int b, ka, t, w, ki;
ki = day % 20;
day /= 20;
w = day % 18;
day /= 18;
t = day % 20;
day /= 20;
ka = day % 20;
day /= 20;
b = day % 13;
printf("%lld.%lld.%lld.%lld.%lld\n", b, ka, t, w, ki);
}
void tos(int day) {
int y, m;
for (y = 1; 365 + is_uruu(y) < day; y++)
day -= 365 + is_uruu(y);
for (m = 1; mn[m - 1] + (m == 2 && is_uruu(y)) < day; m++)
day -= mn[m - 1] + (m == 2 && is_uruu(y));
printf("%lld.%lld.%lld\n", y, m, day);
}
signed main() {
base = calc(2012, 12, 21);
string s;
while (cin >> s, s != "#") {
s += '.';
vector<int> v;
string t;
for (char c : s) {
if (c == '.')
v.push_back(stoi(t)), t = "";
else
t += c;
}
if (v.size() == 3)
tom(tod(v[0], v[1], v[2]));
else
tos(tod(v[0], v[1], v[2], v[3], v[4]));
}
}
|
#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 % 400 == 0); }
int mn[]{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int calc(int y, int m, int d) {
int res = (y - 1) * 365;
for (int i = 4; i < y; i += 4) {
if (is_uruu(i))
res++;
}
for (int i = 1; i < m; i++) {
res += mn[i - 1];
if (is_uruu(y) && i == 2)
res++;
}
return res + d;
}
int tod(int y, int m, int d) { return calc(y, m, d) - base; }
void tom(int day) {
int b, ka, t, w, ki;
ki = day % 20;
day /= 20;
w = day % 18;
day /= 18;
t = day % 20;
day /= 20;
ka = day % 20;
day /= 20;
b = day % 13;
printf("%lld.%lld.%lld.%lld.%lld\n", b, ka, t, w, ki);
}
void tos(int day) {
int y, m;
for (y = 1; 365 + is_uruu(y) < day; y++)
day -= 365 + is_uruu(y);
for (m = 1; mn[m - 1] + (m == 2 && is_uruu(y)) < day; m++)
day -= mn[m - 1] + (m == 2 && is_uruu(y));
printf("%lld.%lld.%lld\n", y, m, day);
}
signed main() {
base = calc(2012, 12, 21);
string s;
while (cin >> s, s != "#") {
s += '.';
vector<int> v;
string t;
for (char c : s) {
if (c == '.')
v.push_back(stoi(t)), t = "";
else
t += c;
}
if (v.size() == 3)
tom(tod(v[0], v[1], v[2]));
else
tos(tod(v[0], v[1], v[2], v[3], v[4]));
}
}
|
[["-", 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(); i++) {
if (!vi[G[v][i]])
ok(G[v][i]);
}
}
main() {
while (cin >> m, m) {
cin >> n;
for (int i = 0; i <= n + 1; i++)
G[i].clear(), R[i].clear(), vi[i] = u[i] = 0;
for (int i = 1; i <= n; i++)
cin >> d[i];
for (int i = 0; i <= n; i++) {
for (int j = 1; j <= m && i + j <= n + 1; j++) {
int k = i + j + d[i + j];
if (k > n + 1)
k = n + 1;
if (k < 0)
k = 0;
G[i].push_back(k);
R[k].push_back(i);
}
}
f(n + 1);
ok(0);
bool flag = 1;
for (int i = 0; i <= n + 1; i++)
if (vi[i] && !u[i])
flag = 0;
cout << (flag ? "OK" : "NG") << endl;
}
}
|
#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(); i++) {
if (!vi[G[v][i]])
ok(G[v][i]);
}
}
main() {
while (cin >> m, m) {
cin >> n;
for (int i = 0; i <= n + 1; i++)
G[i].clear(), R[i].clear(), d[i] = vi[i] = u[i] = 0;
for (int i = 1; i <= n; i++)
cin >> d[i];
for (int i = 0; i <= n; i++) {
for (int j = 1; j <= m && i + j <= n + 1; j++) {
int k = i + j + d[i + j];
if (k > n + 1)
k = n + 1;
if (k < 0)
k = 0;
G[i].push_back(k);
R[k].push_back(i);
}
}
f(n + 1);
ok(0);
bool flag = 1;
for (int i = 0; i <= n + 1; i++)
if (vi[i] && !u[i])
flag = 0;
cout << (flag ? "OK" : "NG") << endl;
}
}
|
[["+", 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 rep(i, j) for (int i = 0; i < (j); i++)
#define reps(i, j, k) for (int i = j; i < k; i++)
typedef long long ll;
typedef unsigned long long ull;
int main() {
int ma;
while (scanf("%d", &ma), ma) {
int n;
scanf("%d", &n);
int stage[256] = {0};
int D[300][300] = {{0}};
reps(i, 1, n + 1) scanf("%d", &stage[i]);
rep(i, n + 1) {
reps(j, 1, ma + 1) {
if (stage[i + j] == 0)
D[i][i + j] = 1;
else if (stage[i + j] >= 1)
D[i][min(i + j + stage[i + j], n + 1)];
else if (stage[i + j] <= -1)
D[i][max(0, i + j + stage[i + j])] = 1;
}
}
rep(k, n + 2) {
rep(i, n + 2) {
rep(j, n + 2) {
if (D[i][k] && D[k][j])
D[i][j] = 1;
}
}
}
bool f = true;
rep(i, n + 1) if (D[0][i] && D[i][n + 1]) f = false;
printf("%s\n", (!f) ? "OK" : "NG");
}
return 0;
}
|
#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 rep(i, j) for (int i = 0; i < (j); i++)
#define reps(i, j, k) for (int i = j; i < k; i++)
typedef long long ll;
typedef unsigned long long ull;
int main() {
int ma;
while (scanf("%d", &ma), ma) {
int n;
scanf("%d", &n);
int stage[256] = {0};
bool D[300][300] = {{0}};
reps(i, 1, n + 1) scanf("%d", &stage[i]);
rep(i, n + 1) {
reps(j, 1, ma + 1) {
/*行先i+j*/
if (stage[i + j] == 0)
D[i][i + j] = 1;
else if (stage[i + j] >= 1)
D[i][min(i + j + stage[i + j], n + 1)] = 1;
else if (stage[i + j] <= -1)
D[i][max(0, i + j + stage[i + j])] = 1;
}
}
/*WarshallFloyd*/
rep(k, n + 2) {
rep(i, n + 2) {
rep(j, n + 2) {
if (D[i][k] && D[k][j])
D[i][j] = 1;
}
}
}
bool f = true;
rep(i, n + 1) if (D[0][i] && !D[i][n + 1]) f = false;
printf("%s\n", (f) ? "OK" : "NG");
}
return 0;
}
|
[["-", 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"
typedef int Weight;
struct Edge {
int src, dst;
Weight weight;
Edge(int src, int dst, Weight weight) : src(src), dst(dst), weight(weight) {}
};
struct Dscc {
public:
// belongs,newedges
pair<vector<vector<int>>, vector<vector<int>>>
get(const vector<vector<int>> &edges) {
nums.resize(edges.size());
fill(nums.begin(), nums.end(), -1);
vector<vector<int>> revedges(edges.size());
for (int i = 0; i < edges.size(); ++i) {
for (auto j : edges[i]) {
revedges[j].push_back(i);
}
}
int num = 0;
for (int i = 0; i < edges.size(); ++i) {
dfs(i, num, edges);
}
vector<int> big(nums.size());
for (int i = 0; i < nums.size(); ++i) {
big[nums[i]] = i;
}
reverse(big.begin(), big.end());
unis.resize(edges.size());
fill(unis.begin(), unis.end(), -1);
num = 0;
for (int i = 0; i < big.size(); ++i) {
dfs2(big[i], num, revedges);
num++;
}
vector<int> nums;
for (int i = 0; i < unis.size(); ++i) {
nums.push_back(unis[i]);
}
sort(nums.begin(), nums.end());
nums.erase(unique(nums.begin(), nums.end()), nums.end());
map<int, int> mp;
for (int i = 0; i < nums.size(); ++i) {
mp[nums[i]] = i;
}
for (int i = 0; i < unis.size(); ++i) {
unis[i] = mp[unis[i]];
}
vector<vector<int>> belongs(nums.size());
for (int i = 0; i < unis.size(); ++i) {
belongs[unis[i]].push_back(i);
}
vector<vector<int>> newedges(nums.size());
for (int i = 0; i < edges.size(); ++i) {
for (auto j : edges[i]) {
if (unis[i] != unis[j]) {
newedges[unis[i]].push_back(unis[j]);
}
}
}
return make_pair(belongs, newedges);
}
// belongs,newedges
pair<vector<vector<int>>, vector<vector<Edge>>>
get(const vector<vector<Edge>> &edges) {
const int old_node_size = edges.size();
nums.resize(old_node_size);
fill(nums.begin(), nums.end(), -1);
vector<vector<Edge>> revedges(old_node_size);
for (const auto &e : edges) {
for (const auto &j : e) {
revedges[j.dst].push_back(Edge(j.dst, j.src, j.weight));
}
}
int num = 0;
for (int i = 0; i < old_node_size; ++i) {
dfs(i, num, edges);
}
vector<int> big(old_node_size);
for (int i = 0; i < old_node_size; ++i) {
big[nums[i]] = i;
}
reverse(big.begin(), big.end());
unis.resize(old_node_size);
fill(unis.begin(), unis.end(), -1);
num = 0;
for (int i = 0; i < old_node_size; ++i) {
dfs2(big[i], num, revedges);
num++;
}
vector<int> nums;
for (int i = 0; i < old_node_size; ++i) {
nums.push_back(unis[i]);
}
sort(nums.begin(), nums.end());
nums.erase(unique(nums.begin(), nums.end()), nums.end());
const int new_node_size = nums.size();
map<int, int> mp;
for (int i = 0; i < new_node_size; ++i) {
mp[nums[i]] = i;
}
for (int i = 0; i < old_node_size; ++i) {
unis[i] = mp[unis[i]];
}
vector<vector<int>> belongs(new_node_size);
for (int i = 0; i < old_node_size; ++i) {
belongs[unis[i]].push_back(i);
}
vector<vector<Edge>> newedges(new_node_size);
for (const auto &e : edges) {
for (const auto &j : e) {
if (unis[j.src] != unis[j.dst]) {
newedges[unis[j.src]].push_back(
Edge(unis[j.src], unis[j.dst], j.weight));
}
}
}
return make_pair(belongs, newedges);
}
private:
vector<int> nums;
vector<int> unis;
void dfs(const int id, int &num, const vector<vector<int>> &edges) {
if (nums[id] != -1)
return;
else {
nums[id] = -2;
for (auto i : edges[id]) {
dfs(i, num, edges);
}
}
nums[id] = num++;
return;
}
void dfs2(const int id, const int &num, const vector<vector<int>> &edges) {
if (unis[id] != -1)
return;
else {
unis[id] = -2;
for (auto i : edges[id])
dfs2(i, num, edges);
}
unis[id] = num;
return;
}
void dfs(const int id, int &num, const vector<vector<Edge>> &edges) {
if (nums[id] != -1)
return;
else {
nums[id] = -2;
for (auto i : edges[id]) {
dfs(i.dst, num, edges);
}
}
nums[id] = num++;
return;
}
void dfs2(const int id, const int &num, const vector<vector<Edge>> &edges) {
if (unis[id] != -1)
return;
else {
unis[id] = -2;
for (auto i : edges[id]) {
dfs2(i.dst, num, edges);
}
}
unis[id] = num;
return;
}
} dscc;
int come[300];
bool dfs(const int now, const vector<vector<int>> &edges, const int goal) {
assert(come[now] == false);
come[now] = true;
if (now == goal)
return true;
else {
if (edges[now].empty())
return false;
for (auto e : edges[now]) {
if (e == now)
assert(false);
if (!dfs(e, edges, goal))
return false;
}
return true;
}
}
int main() {
while (1) {
memset(come, false, sizeof(come));
int amax;
cin >> amax;
if (!amax)
break;
int N;
cin >> N;
const int goal = N + 1;
const int start = 0;
vector<int> ds(goal + 1);
for (int i = 0; i < N; ++i) {
cin >> ds[i + 1];
}
vector<vector<int>> edges(N + 2);
for (int i = 0; i < N + 1; ++i) {
for (int j = 1; j <= amax; ++j) {
int next;
if (i + j >= goal) {
next = goal;
} else {
if (i + j + ds[i + j] >= goal) {
next = goal;
} else if (i + j + ds[i + j] < 0) {
next = 0;
} else {
next = i + j + ds[i + j];
}
}
if (find(edges[i].begin(), edges[i].end(), next) == edges[i].end()) {
edges[i].push_back(next);
}
sort(edges[i].begin(), edges[i].end());
}
}
auto p = dscc.get(edges);
int newstart = -1;
int newgoal = -1;
for (int i = 0; i < p.first.size(); ++i) {
auto b = p.first[i];
if (find(b.begin(), b.end(), 0) != b.end()) {
newstart = i;
}
if (find(b.begin(), b.end(), goal) != b.end()) {
newgoal = i;
}
}
if (newstart == -1 || newgoal == -1)
cout << "ff";
auto newedges = p.second;
bool ans = dfs(newstart, newedges, newgoal);
if (ans) {
cout << "OK" << endl;
} else {
cout << "NG" << endl;
}
}
return 0;
}
|
#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"
typedef int Weight;
struct Edge {
int src, dst;
Weight weight;
Edge(int src, int dst, Weight weight) : src(src), dst(dst), weight(weight) {}
};
struct Dscc {
public:
// belongs,newedges
pair<vector<vector<int>>, vector<vector<int>>>
get(const vector<vector<int>> &edges) {
nums.resize(edges.size());
fill(nums.begin(), nums.end(), -1);
vector<vector<int>> revedges(edges.size());
for (int i = 0; i < edges.size(); ++i) {
for (auto j : edges[i]) {
revedges[j].push_back(i);
}
}
int num = 0;
for (int i = 0; i < edges.size(); ++i) {
dfs(i, num, edges);
}
vector<int> big(nums.size());
for (int i = 0; i < nums.size(); ++i) {
big[nums[i]] = i;
}
reverse(big.begin(), big.end());
unis.resize(edges.size());
fill(unis.begin(), unis.end(), -1);
num = 0;
for (int i = 0; i < big.size(); ++i) {
dfs2(big[i], num, revedges);
num++;
}
vector<int> nums;
for (int i = 0; i < unis.size(); ++i) {
nums.push_back(unis[i]);
}
sort(nums.begin(), nums.end());
nums.erase(unique(nums.begin(), nums.end()), nums.end());
map<int, int> mp;
for (int i = 0; i < nums.size(); ++i) {
mp[nums[i]] = i;
}
for (int i = 0; i < unis.size(); ++i) {
unis[i] = mp[unis[i]];
}
vector<vector<int>> belongs(nums.size());
for (int i = 0; i < unis.size(); ++i) {
belongs[unis[i]].push_back(i);
}
vector<vector<int>> newedges(nums.size());
for (int i = 0; i < edges.size(); ++i) {
for (auto j : edges[i]) {
if (unis[i] != unis[j]) {
newedges[unis[i]].push_back(unis[j]);
}
}
}
return make_pair(belongs, newedges);
}
// belongs,newedges
pair<vector<vector<int>>, vector<vector<Edge>>>
get(const vector<vector<Edge>> &edges) {
const int old_node_size = edges.size();
nums.resize(old_node_size);
fill(nums.begin(), nums.end(), -1);
vector<vector<Edge>> revedges(old_node_size);
for (const auto &e : edges) {
for (const auto &j : e) {
revedges[j.dst].push_back(Edge(j.dst, j.src, j.weight));
}
}
int num = 0;
for (int i = 0; i < old_node_size; ++i) {
dfs(i, num, edges);
}
vector<int> big(old_node_size);
for (int i = 0; i < old_node_size; ++i) {
big[nums[i]] = i;
}
reverse(big.begin(), big.end());
unis.resize(old_node_size);
fill(unis.begin(), unis.end(), -1);
num = 0;
for (int i = 0; i < old_node_size; ++i) {
dfs2(big[i], num, revedges);
num++;
}
vector<int> nums;
for (int i = 0; i < old_node_size; ++i) {
nums.push_back(unis[i]);
}
sort(nums.begin(), nums.end());
nums.erase(unique(nums.begin(), nums.end()), nums.end());
const int new_node_size = nums.size();
map<int, int> mp;
for (int i = 0; i < new_node_size; ++i) {
mp[nums[i]] = i;
}
for (int i = 0; i < old_node_size; ++i) {
unis[i] = mp[unis[i]];
}
vector<vector<int>> belongs(new_node_size);
for (int i = 0; i < old_node_size; ++i) {
belongs[unis[i]].push_back(i);
}
vector<vector<Edge>> newedges(new_node_size);
for (const auto &e : edges) {
for (const auto &j : e) {
if (unis[j.src] != unis[j.dst]) {
newedges[unis[j.src]].push_back(
Edge(unis[j.src], unis[j.dst], j.weight));
}
}
}
return make_pair(belongs, newedges);
}
private:
vector<int> nums;
vector<int> unis;
void dfs(const int id, int &num, const vector<vector<int>> &edges) {
if (nums[id] != -1)
return;
else {
nums[id] = -2;
for (auto i : edges[id]) {
dfs(i, num, edges);
}
}
nums[id] = num++;
return;
}
void dfs2(const int id, const int &num, const vector<vector<int>> &edges) {
if (unis[id] != -1)
return;
else {
unis[id] = -2;
for (auto i : edges[id])
dfs2(i, num, edges);
}
unis[id] = num;
return;
}
void dfs(const int id, int &num, const vector<vector<Edge>> &edges) {
if (nums[id] != -1)
return;
else {
nums[id] = -2;
for (auto i : edges[id]) {
dfs(i.dst, num, edges);
}
}
nums[id] = num++;
return;
}
void dfs2(const int id, const int &num, const vector<vector<Edge>> &edges) {
if (unis[id] != -1)
return;
else {
unis[id] = -2;
for (auto i : edges[id]) {
dfs2(i.dst, num, edges);
}
}
unis[id] = num;
return;
}
} dscc;
int come[300];
bool dfs(const int now, const vector<vector<int>> &edges, const int goal) {
if (come[now])
return true;
come[now] = true;
if (now == goal)
return true;
else {
if (edges[now].empty())
return false;
for (auto e : edges[now]) {
if (e == now)
assert(false);
if (!dfs(e, edges, goal))
return false;
}
return true;
}
}
int main() {
while (1) {
memset(come, false, sizeof(come));
int amax;
cin >> amax;
if (!amax)
break;
int N;
cin >> N;
const int goal = N + 1;
const int start = 0;
vector<int> ds(goal + 1);
for (int i = 0; i < N; ++i) {
cin >> ds[i + 1];
}
vector<vector<int>> edges(N + 2);
for (int i = 0; i < N + 1; ++i) {
for (int j = 1; j <= amax; ++j) {
int next;
if (i + j >= goal) {
next = goal;
} else {
if (i + j + ds[i + j] >= goal) {
next = goal;
} else if (i + j + ds[i + j] < 0) {
next = 0;
} else {
next = i + j + ds[i + j];
}
}
if (find(edges[i].begin(), edges[i].end(), next) == edges[i].end()) {
edges[i].push_back(next);
}
sort(edges[i].begin(), edges[i].end());
}
}
auto p = dscc.get(edges);
int newstart = -1;
int newgoal = -1;
for (int i = 0; i < p.first.size(); ++i) {
auto b = p.first[i];
if (find(b.begin(), b.end(), 0) != b.end()) {
newstart = i;
}
if (find(b.begin(), b.end(), goal) != b.end()) {
newgoal = i;
}
}
if (newstart == -1 || newgoal == -1)
cout << "ff";
auto newedges = p.second;
bool ans = dfs(newstart, newedges, newgoal);
if (ans) {
cout << "OK" << endl;
} else {
cout << "NG" << endl;
}
}
return 0;
}
|
[["-", 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, min(x + i, n + 1))], n + 1))].push_back(x);
}
}
void dfs2(int x) {
if (!mas[x])
return;
mas[x] = false;
// if(d[x] != 0) return;
for (int i = 0; i < G[x].size(); i++) {
dfs2(G[x][i]);
}
}
bool check() {
for (int i = 1; i <= n; i++) {
if (mas[i])
return false;
}
return true;
}
int main() {
while (cin >> maxi, maxi) {
cin >> n;
G.clear();
G.resize(n + 2);
memset(mas, false, sizeof(mas));
memset(d, 0, sizeof(d));
for (int i = 1; i <= n; i++)
cin >> d[i];
dfs1(0);
if (check() || !mas[n + 1])
cout << "NG" << endl;
else {
dfs2(n + 1);
cout << (check() ? "OK" : "NG") << endl;
}
}
return 0;
}
|
#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, min(x + i, n + 1))], n + 1))].push_back(x);
}
}
void dfs2(int x) {
if (!mas[x])
return;
mas[x] = false;
// if(d[x] != 0) return;
for (int i = 0; i < G[x].size(); i++) {
dfs2(G[x][i]);
}
}
bool check() {
for (int i = 1; i <= n; i++) {
if (mas[i])
return false;
}
return true;
}
int main() {
while (cin >> maxi, maxi) {
cin >> n;
G.clear();
G.resize(n + 2);
memset(mas, false, sizeof(mas));
memset(d, 0, sizeof(d));
for (int i = 1; i <= n; i++)
cin >> d[i];
dfs1(0);
if (check() && !mas[n + 1])
cout << "NG" << endl;
else {
dfs2(n + 1);
cout << (check() ? "OK" : "NG") << endl;
}
}
return 0;
}
|
[["-", 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) cerr << #x << " = " << x << endl;
#define mod 1000000007 // 1e9+7(prime number)
#define INF 1000000000 // 1e9
#define LLINF 2000000000000000000LL // 2e18
#define SIZE 650
void calc(int m) {
int n;
int d[SIZE];
scanf("%d", &n);
d[0] = 0;
d[n + 1] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", d + i);
}
queue<int> q;
q.push(0);
bool can_visit[SIZE] = {};
can_visit[0] = true;
while (q.size()) {
bool flag = false;
int st = q.front();
int visited[SIZE] = {};
q.pop();
queue<int> q2;
q2.push(st);
while (q2.size()) {
int now = q2.front();
q2.pop();
if (visited[now])
continue;
if (now == n + 1) {
flag = true;
break;
}
visited[now] = true;
if (can_visit[now] == false) {
can_visit[now] = true;
q.push(now);
}
for (int i = 1; i <= m; i++) {
int next = min(n + 1, now + i);
if (d[next] < 0) {
next = max(0, next + d[next]);
} else {
next = min(n + 1, next + d[next]);
}
q2.push(next);
}
}
if (flag == false) {
puts("NG");
return;
}
}
puts("OK");
}
int main() {
int m;
while (scanf("%d", &m) != EOF) {
if (m == 0)
break;
calc(m);
}
return 0;
}
|
#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) cerr << #x << " = " << x << endl;
#define mod 1000000007 // 1e9+7(prime number)
#define INF 1000000000 // 1e9
#define LLINF 2000000000000000000LL // 2e18
#define SIZE 650
void calc(int m) {
int n;
int d[SIZE];
scanf("%d", &n);
d[0] = 0;
d[n + 1] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", d + i);
}
queue<int> q;
q.push(0);
bool can_visit[SIZE] = {};
can_visit[0] = true;
while (q.size()) {
bool flag = false;
int st = q.front();
int visited[SIZE] = {};
q.pop();
queue<int> q2;
q2.push(st);
while (q2.size()) {
int now = q2.front();
q2.pop();
if (visited[now])
continue;
if (now == n + 1) {
flag = true;
}
visited[now] = true;
if (can_visit[now] == false) {
can_visit[now] = true;
q.push(now);
}
for (int i = 1; i <= m; i++) {
int next = min(n + 1, now + i);
if (d[next] < 0) {
next = max(0, next + d[next]);
} else {
next = min(n + 1, next + d[next]);
}
q2.push(next);
}
}
if (flag == false) {
puts("NG");
return;
}
}
puts("OK");
}
int main() {
int m;
while (scanf("%d", &m) != EOF) {
if (m == 0)
break;
calc(m);
}
return 0;
}
|
[["-", 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 vector<int> vi;
int m, n;
vi ok;
int dist[300][300];
int main() {
// freopen("test.txt", "r", stdin);
while (cin >> m, m) {
cin >> n;
vi d(n + 2, 0);
FOR(i, 1, n + 1) cin >> d[i];
rep(i, n + 2) {
d[i] += i;
if (d[i] < 0)
d[i] = 0;
if (d[i] > n)
d[i] = n + 1;
}
const int INF = 10000;
rep(i, n + 2) rep(j, n + 2) dist[i][j] = 9;
dist[0][0] = 0;
rep(i, n + 2) {
for (int j = 1; j <= m; j++) {
int dest = i + j;
if (dest > n)
dest = n + 1;
dist[i][d[dest]] = min(dist[i][d[dest]], 1);
}
}
rep(i, n + 2) rep(j, n + 2) rep(k, n + 2) dist[j][k] =
min(dist[j][k], dist[j][i] + dist[i][k]);
bool ok = true;
rep(i, n + 2) { ok &= (dist[0][i] == INF || dist[i][n + 1]); }
cout << (ok ? "OK" : "NG") << endl;
}
return 0;
}
|
#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 vector<int> vi;
int m, n;
vi ok;
int dist[300][300];
int main() {
// freopen("test.txt", "r", stdin);
while (cin >> m, m) {
cin >> n;
vi d(n + 2, 0);
FOR(i, 1, n + 1) cin >> d[i];
rep(i, n + 2) {
d[i] += i;
if (d[i] < 0)
d[i] = 0;
if (d[i] > n)
d[i] = n + 1;
}
const int INF = 10000;
rep(i, n + 2) rep(j, n + 2) dist[i][j] = INF;
dist[0][0] = 0;
rep(i, n + 2) {
for (int j = 1; j <= m; j++) {
int dest = i + j;
if (dest > n)
dest = n + 1;
dist[i][d[dest]] = min(dist[i][d[dest]], 1);
}
}
rep(i, n + 2) rep(j, n + 2) rep(k, n + 2) dist[j][k] =
min(dist[j][k], dist[j][i] + dist[i][k]);
bool ok = true;
rep(i, n + 2) { ok &= (dist[0][i] == INF || dist[i][n + 1] != INF); }
cout << (ok ? "OK" : "NG") << endl;
}
return 0;
}
|
[["-", 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)
break;
int[] a = new int[n];
int[] b = new int[c];
for (int i = 0; i < n; i++)
for (int j = 0; j < 16; j++)
a[i] |= (scanner.nextInt() << j);
for (int i = 0; i < c; i++)
for (int j = 0; j < 16; j++)
b[i] |= (scanner.nextInt() << j);
int[][] dp = new int[n + 1][1 << 16];
for (int i = 0; i <= n; i++)
Arrays.fill(dp[i], -1);
dp[0][0] = 0;
for (int i = 0; i < n; i++) {
for (int S = 0; S < 1 << 16; S++) {
if (dp[i][S] == -1)
continue;
int light = S + a[i];
for (int j = 0; j < c; j++) {
int pushed = light & b[j];
int point = Integer.bitCount(pushed);
int nx = light & ~b[j];
if (dp[i + 1][nx] < point + dp[i][S])
dp[i + 1][nx] = point + dp[i][S];
}
}
}
int max = 0;
for (int i = 0; i < 1 << 16; i++)
max = Math.max(max, dp[n][i]);
System.out.println(max);
}
}
}
|
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)
break;
int[] a = new int[n];
int[] b = new int[c];
for (int i = 0; i < n; i++)
for (int j = 0; j < 16; j++)
a[i] += (scanner.nextInt() << j);
for (int i = 0; i < c; i++)
for (int j = 0; j < 16; j++)
b[i] += (scanner.nextInt() << j);
int[][] dp = new int[n + 1][1 << 16];
for (int i = 0; i <= n; i++)
Arrays.fill(dp[i], -1);
dp[0][0] = 0;
for (int i = 0; i < n; i++) {
for (int S = 0; S < 1 << 16; S++) {
if (dp[i][S] == -1)
continue;
int light = S | a[i];
for (int j = 0; j < c; j++) {
int pushed = light & b[j];
int point = Integer.bitCount(pushed);
int nx = light & ~b[j];
if (dp[i + 1][nx] < point + dp[i][S])
dp[i + 1][nx] = point + dp[i][S];
}
}
}
int max = 0;
for (int i = 0; i < 1 << 16; i++)
max = Math.max(max, dp[n][i]);
System.out.println(max);
}
}
}
|
[["-", 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;
}
int[] a = new int[n + 1];
for (int i = 0; i < n; ++i) {
a[i] = 0;
for (int j = 0; j < 16; ++j) {
int v = ni();
a[i] |= v << j;
}
}
a[n] = 0;
int[] b = new int[n];
for (int i = 0; i < c; ++i) {
b[i] = 0;
for (int j = 0; j < 16; ++j) {
int v = ni();
b[i] |= v << j;
}
}
int[][] dp = new int[2][1 << 16];
for (int i = 0; i < 2; ++i) {
Arrays.fill(dp[i], -1);
}
dp[0][a[0]] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 1 << 16; ++j) {
if (dp[(i & 1)][j] == -1) {
continue;
}
for (int k = 0; k < c; ++k) {
int cnt = pop_count(b[k] & j);
int nbs = ((b[k] ^ j) & j) | a[i + 1];
dp[(i & 1) ^ 1][nbs] =
Math.max(dp[(i & 1) ^ 1][nbs], dp[(i & 1)][j] + cnt);
}
}
}
int ans = 0;
for (int i = 0; i < 1 << 16; ++i) {
ans = Math.max(ans, dp[n & 1][i]);
}
System.out.println(ans);
}
}
public static void main(String[] args) {
// new Main().test();
new Main().run();
}
void test() {
for (int i = 0; i < 1; ++i) {
System.out.println("30 30");
for (int j = 0; j < 30; ++j) {
for (int k = 0; k < 16; ++k) {
if (k > 0) {
System.out.print(" ");
}
System.out.print(Math.random() > 0.5 ? "1" : "0");
}
System.out.println();
}
for (int j = 0; j < 30; ++j) {
for (int k = 0; k < 16; ++k) {
if (k > 0) {
System.out.print(" ");
}
System.out.print(Math.random() > 0.5 ? "1" : "0");
}
System.out.println();
}
}
System.out.println("0 0");
}
Scanner sc;
Main() { sc = new Scanner(System.in); }
int ni() { return Integer.parseInt(sc.next()); }
void debug(Object... os) { System.err.println(Arrays.deepToString(os)); }
}
|
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;
}
int[] a = new int[n + 1];
for (int i = 0; i < n; ++i) {
a[i] = 0;
for (int j = 0; j < 16; ++j) {
int v = ni();
a[i] |= v << j;
}
}
a[n] = 0;
int[] b = new int[c];
for (int i = 0; i < c; ++i) {
b[i] = 0;
for (int j = 0; j < 16; ++j) {
int v = ni();
b[i] |= v << j;
}
}
int[][] dp = new int[2][1 << 16];
for (int i = 0; i < 2; ++i) {
Arrays.fill(dp[i], -1);
}
dp[0][a[0]] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 1 << 16; ++j) {
if (dp[(i & 1)][j] == -1) {
continue;
}
for (int k = 0; k < c; ++k) {
int cnt = pop_count(b[k] & j);
int nbs = ((b[k] ^ j) & j) | a[i + 1];
dp[(i & 1) ^ 1][nbs] =
Math.max(dp[(i & 1) ^ 1][nbs], dp[(i & 1)][j] + cnt);
}
}
}
int ans = 0;
for (int i = 0; i < 1 << 16; ++i) {
ans = Math.max(ans, dp[n & 1][i]);
}
System.out.println(ans);
}
}
public static void main(String[] args) {
// new Main().test();
new Main().run();
}
void test() {
for (int i = 0; i < 1; ++i) {
System.out.println("30 30");
for (int j = 0; j < 30; ++j) {
for (int k = 0; k < 16; ++k) {
if (k > 0) {
System.out.print(" ");
}
System.out.print(Math.random() > 0.5 ? "1" : "0");
}
System.out.println();
}
for (int j = 0; j < 30; ++j) {
for (int k = 0; k < 16; ++k) {
if (k > 0) {
System.out.print(" ");
}
System.out.print(Math.random() > 0.5 ? "1" : "0");
}
System.out.println();
}
}
System.out.println("0 0");
}
Scanner sc;
Main() { sc = new Scanner(System.in); }
int ni() { return Integer.parseInt(sc.next()); }
void debug(Object... os) { System.err.println(Arrays.deepToString(os)); }
}
|
[["-", 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++;
return res;
}
int main() {
int n, c;
while (cin >> n >> c && n) {
memset(st, 0, sizeof(st));
memset(dp, -1, sizeof(dp));
int light[31] = {}, push[31] = {}, tmp;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 16; j++) {
cin >> tmp;
light[i] *= 2;
light[i] += tmp;
}
light[i] = light[i] & ((1 << 16) - 1);
// printf("light[%d]:%d\n",i,light[i]);
}
for (int i = 0; i < c; i++) {
for (int j = 0; j < 16; j++) {
cin >> tmp;
push[i] *= 2;
push[i] += tmp;
}
for (int j = 0; j < (1 << 16); j++) {
st[i][j] = count(push[i] & j);
}
push[i] = push[i] & ((1 << 16) - 1);
// printf("push[%d]:%d\n",i,push[i]);
}
dp[0][0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < (1 << 16); j++) {
if (dp[i][j] < 0)
continue;
int nx = j | light[i];
// dp[i+1][nx]=max(dp[i+1][nx],dp[i][j]);
for (int k = 0; k < c; k++) {
int tx = nx - (nx & push[i]);
dp[i + 1][tx] = max(dp[i + 1][tx], dp[i][j] + st[k][nx]);
}
}
}
int ans = 0;
for (int i = 0; i < (1 << 16); i++)
ans = max(ans, dp[n][i]);
printf("%d\n", ans);
}
return 0;
}
|
#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++;
return res;
}
int main() {
int n, c;
while (cin >> n >> c && n) {
memset(st, 0, sizeof(st));
memset(dp, -1, sizeof(dp));
int light[31] = {}, push[31] = {}, tmp;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 16; j++) {
cin >> tmp;
light[i] *= 2;
light[i] += tmp;
}
light[i] = light[i] & ((1 << 16) - 1);
// printf("light[%d]:%d\n",i,light[i]);
}
for (int i = 0; i < c; i++) {
for (int j = 0; j < 16; j++) {
cin >> tmp;
push[i] *= 2;
push[i] += tmp;
}
for (int j = 0; j < (1 << 16); j++) {
st[i][j] = count(push[i] & j);
}
push[i] = push[i] & ((1 << 16) - 1);
// printf("push[%d]:%d\n",i,push[i]);
}
dp[0][0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < (1 << 16); j++) {
if (dp[i][j] < 0)
continue;
int nx = j | light[i];
// dp[i+1][nx]=max(dp[i+1][nx],dp[i][j]);
for (int k = 0; k < c; k++) {
int tx = (nx & ~push[k]);
dp[i + 1][tx] = max(dp[i + 1][tx], dp[i][j] + st[k][nx]);
}
}
}
int ans = 0;
for (int i = 0; i < (1 << 16); i++)
ans = max(ans, dp[n][i]);
printf("%d\n", ans);
}
return 0;
}
|
[["-", 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 <vector>
using namespace std;
inline int to_int(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string to_str(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
const int INF = 1 << 30;
typedef long long ll;
int main() {
int n, c;
int P[36];
int L[36];
while (cin >> n >> c) {
int dp[1 << 16][31];
if (n == 0 && c == 0) {
break;
}
// puts("run");
memset(dp, -1, sizeof(dp));
memset(P, 0, sizeof(P));
memset(L, 0, sizeof(L));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 16; j++) {
int a;
cin >> a;
P[i] |= (a << 15 - j);
}
}
for (int i = 0; i < c; i++) {
for (int j = 0; j < 16; j++) {
int a;
cin >> a;
L[i] |= (a << 15 - j);
}
}
dp[0][0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 1 << 16; j++) {
if (dp[j][i] < 0) {
continue;
}
int S = j bitor P[i];
for (int k = 0; k < c; k++) {
int push = S bitand L[k];
int T = S xor L[k];
dp[T][i + 1] = max(dp[T][i + 1], dp[j][i] + __builtin_popcount(push));
}
}
}
int res = 0;
for (int i = 0; i < 1 << 16; i++) {
res = max(res, dp[i][n]);
}
cout << res << endl;
}
}
|
#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 <vector>
using namespace std;
inline int to_int(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string to_str(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
const int INF = 1 << 30;
typedef long long ll;
int main() {
int n, c;
int P[36];
int L[36];
while (cin >> n >> c) {
int dp[1 << 16][31];
if (n == 0 && c == 0) {
break;
}
// puts("run");
memset(dp, -1, sizeof(dp));
memset(P, 0, sizeof(P));
memset(L, 0, sizeof(L));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 16; j++) {
int a;
cin >> a;
P[i] |= (a << 15 - j);
}
}
for (int i = 0; i < c; i++) {
for (int j = 0; j < 16; j++) {
int a;
cin >> a;
L[i] |= (a << 15 - j);
}
}
dp[0][0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 1 << 16; j++) {
if (dp[j][i] < 0) {
continue;
}
int S = j bitor P[i];
for (int k = 0; k < c; k++) {
int push = S bitand L[k];
int T = S xor push;
dp[T][i + 1] = max(dp[T][i + 1], dp[j][i] + __builtin_popcount(push));
}
}
}
int res = 0;
for (int i = 0; i < 1 << 16; i++) {
res = max(res, dp[i][n]);
}
cout << res << endl;
}
}
|
[["-", 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++;
} else if (su <= 1) {
one++;
}
}
if (some >= 2) {
System.out.println(one + some);
} else {
System.out.println("NA");
}
one = 0;
some = 1;
N = sc.nextInt();
}
}
public static void main(String[] args) {
Main obj = new Main();
obj.solve();
}
}
|
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++;
} else if (su == 1) {
one++;
}
}
if (some >= 2) {
System.out.println(one + some);
} else {
System.out.println("NA");
}
one = 0;
some = 1;
N = sc.nextInt();
}
}
public static void main(String[] args) {
Main obj = new Main();
obj.solve();
}
}
|
[["-", 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");
} else {
printf(N - j + 1);
}
scanf("%d", &N);
}
return 0;
}
|
#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");
} else {
printf("%d\n", N - j + 1);
}
scanf("%d", &N);
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 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++;
}
}
if (more_than_2 == 0) {
printf("NA\n");
} else {
printf("%d\n", not_zero + 1);
}
}
return 0;
}
|
#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++;
}
}
if (more_than_2 == 0) {
printf("NA\n");
} else {
printf("%d\n", not_zero + 1);
}
}
return 0;
}
|
[["-", 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;
rep(i, n) {
if (v[i] >= 2) {
flag = true;
break;
}
}
if (flag) {
int cnt = 0;
rep(i, n) {
if (v[i] == 0)
continue;
cnt++;
}
cout << cnt + 1 << endl;
} else
cout << "na" << endl;
}
return 0;
}
|
#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;
rep(i, n) {
if (v[i] >= 2) {
flag = true;
break;
}
}
if (flag) {
int cnt = 0;
rep(i, n) {
if (v[i] == 0)
continue;
cnt++;
}
cout << cnt + 1 << endl;
} else
cout << "NA" << endl;
}
return 0;
}
|
[["-", 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) {
printf("%d\n", n + 1);
} else {
printf("NA\n");
}
}
return 0;
}
|
#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;
}
}
if (flg == 1) {
printf("%d\n", s + 1);
} else {
printf("NA\n");
}
}
return 0;
}
|
[["+", 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, 31, 22]]
| 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" << endl;
else
cout << cnt + 1 << endl;
}
return 0;
}
|
#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" << endl;
else
cout << cnt + 1 << endl;
}
return 0;
}
|
[["-", 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) {
result++;
} else if (k[N] >= 2) {
flag = true;
result++;
}
}
if (result == 0 || !flag) {
cout << "NA" << endl;
} else {
cout << result + 1 << endl;
}
}
return 0;
}
|
#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) {
result++;
} else if (k[i] >= 2) {
flag = true;
result++;
}
}
if (result == 0 || !flag) {
cout << "NA" << endl;
} else {
cout << result + 1 << endl;
}
}
return 0;
}
|
[["-", 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 <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF ((int)(1 << 25))
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, n) REP(i, n)
#define TORAD 2.0 * M_PI / 360.0
#define INT(x) \
int x; \
cin >> x;
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define DEBUG(x) cout << #x << " :" << x << endl;
#define EPS 1e-12
template <class T> void debug(T a) {
for (auto iiiiiiiiii : a)
cout << iiiiiiiiii << endl;
}
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
signed main() {
int n;
while (cin >> n && n) {
int ans = 0;
bool ok = false;
FOR(i, n) {
INT(x);
if (x > 1)
ok = true;
ans++;
}
if (ok)
cout << ans + 1 << endl;
else
cout << "NA" << endl;
}
}
|
#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 <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF ((int)(1 << 25))
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, n) REP(i, n)
#define TORAD 2.0 * M_PI / 360.0
#define INT(x) \
int x; \
cin >> x;
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define DEBUG(x) cout << #x << " :" << x << endl;
#define EPS 1e-12
template <class T> void debug(T a) {
for (auto iiiiiiiiii : a)
cout << iiiiiiiiii << endl;
}
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
signed main() {
int n;
while (cin >> n && n) {
int ans = 0;
bool ok = false;
FOR(i, n) {
INT(x);
if (x > 1)
ok = true;
if (x)
ans++;
}
if (ok)
cout << ans + 1 << endl;
else
cout << "NA" << endl;
}
}
|
[["+", 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 == chk) {
printf("NA\n");
} else {
printf("%d\n", n - chk + 1);
}
}
return 0;
}
|
#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 == chk) {
printf("NA\n");
} else {
printf("%d\n", n - cnt + 1);
}
}
return 0;
}
|
[["-", 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 (index < vec.size() && vec[index] < 2) {
index++;
}
if (index == vec.size()) {
cout << "NA" << endl;
} else {
index = 0;
while (vec[index] == 0) {
index++;
}
if (index != 0) {
vec.erase(vec.begin(), vec.begin() + index - 1);
}
cout << vec.size() + 1 << endl;
}
}
return 0;
}
|
#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 (index < vec.size() && vec[index] < 2) {
index++;
}
if (index == vec.size()) {
cout << "NA" << endl;
} else {
index = 0;
while (vec[index] == 0) {
index++;
}
if (index != 0) {
vec.erase(vec.begin(), vec.begin() + index);
}
cout << vec.size() + 1 << endl;
}
}
return 0;
}
|
[["-", 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)
cout << "NA" << endl;
else
cout << N + 1 << endl;
}
return 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)
cout << "NA" << endl;
else
cout << OK + NO + 1 << endl;
}
return 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)
zeroc++;
}
if (na == 0) {
cout << "NA" << endl;
} else {
cout << n + 1 - zeroc << endl;
}
cin >> n;
}
return 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++;
}
if (na == 0) {
cout << "NA" << endl;
} else {
cout << n + 1 - zeroc << endl;
}
cin >> n;
}
return 0;
}
|
[["-", 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 = ''
for v in p:
result += '%d ' % v
result += str(ba)
print(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 = ''
for v in sorted(p):
result += '%d ' % v
result += str(ba)
print(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(*p)
|
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 += [s]
print(*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();
int N = scanner.nextInt();
int ans = 0;
int min = Math.min(C, Math.min(A, N));
C -= min;
A -= min;
N -= min;
ans += min;
int mi = Math.min(C * 2, A);
ans += mi;
C -= mi * 2;
ans += C / 3;
System.out.println(ans);
}
}
}
|
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();
int N = scanner.nextInt();
int ans = 0;
int min = Math.min(C, Math.min(A, N));
C -= min;
A -= min;
N -= min;
ans += min;
int mi = Math.min(C / 2, A);
ans += mi;
C -= mi * 2;
ans += C / 3;
System.out.println(ans);
}
}
}
|
[["-", 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) {
c -= 2;
a--;
s++;
}
if (c >= 3) {
c -= 3;
s++;
}
}
printf("%d\n", s);
}
return 0;
}
|
#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) {
c -= 2;
a--;
s++;
} else if (c >= 3) {
c -= 3;
s++;
}
}
printf("%d\n", s);
}
return 0;
}
|
[["+", 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++;
} else if (a >= 1 && c >= 2) {
count[i]++;
a--;
c -= 2;
m++;
} else if (c >= 3) {
count[i]++;
c -= 3;
m++;
}
}
}
for (i = 0; i < nen; i++) {
printf("%d\n", count[i]);
}
return 0;
}
|
#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--;
m++;
} else if (a >= 1 && c >= 2) {
count[i]++;
a--;
c -= 2;
m++;
} else if (c >= 3) {
count[i]++;
c -= 3;
m++;
}
}
}
for (i = 0; i < nen; i++) {
printf("%d\n", count[i]);
}
return 0;
}
|
[["+", 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;
a--;
s++;
} else if (c >= 3) {
c -= 3;
s++;
} else
break;
}
printf("%d\n", s);
}
return 0;
}
|
#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;
a--;
s++;
} else if (c >= 3) {
c -= 3;
s++;
} else
break;
}
printf("%d\n", s);
}
return 0;
}
|
[["-", 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.