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 <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#define INF (1e+9)
#define LLINF (1e+18)
#define LL long long
using namespace std;
typedef struct info {
int nx;
int ny;
int cost;
int target;
info(int a, int b, int c, int d) {
nx = a;
ny = b;
cost = c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#define INF (1e+9)
#define LLINF (1e+18)
#define LL long long
using namespace std;
typedef struct info {
int nx;
int ny;
int cost;
int target;
info(int a, int b, int c, int d) {
nx = a;
ny = b;
cost = c... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 846 | 6 |
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define INF (1 << 26)
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int H, W, N;
cin >> H >> W >> N;
vector<string> D(H);
for (int i = 0; i < H; i++)
cin >> D[i];
int rout... | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define INF (1 << 26)
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int H, W, N;
cin >> H >> W >> N;
vector<string> D(H);
for (int i = 0; i < H; i++)
cin >> D[i];
int rout... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32]] | 1 | 526 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<pair<int, pair<string, int>>> v;
for (int i = 0; i < n; i++) {
char pName[8];
int num;
scanf("%s %d", pName, num);
v.push_back(make_p... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<pair<int, pair<string, int>>> v;
for (int i = 0; i < n; i++) {
char pName[8];
int num;
scanf("%s %d", pName, &num);
v.push_back(make_... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 244 | 1 |
o={}
for _ in range(int(input())):p,m=input().split();o[p]=o.get(p,0)+int(m)
k=sorted([(len(x),x) for x in list(o.keys())])
for i,j in k:print(i,o[j]) | o={}
for _ in range(int(input())):p,m=input().split();o[p]=o.get(p,0)+int(m)
k=sorted([(len(x),x) for x in list(o.keys())])
for _,i in k:print(i,o[i]) | [["-", 36, 36, 0, 656, 0, 7, 31, 684, 0, 22], ["+", 36, 36, 0, 656, 0, 7, 31, 684, 0, 22], ["-", 0, 1, 0, 652, 3, 4, 0, 206, 206, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 206, 206, 22]] | 5 | 89 | 6 |
from collections import Counter
order = Counter()
N = int(input())
for i in range(N):
A = input().split()
name,quantity = A[0],int(A[1])
order[name] += quantity
po = sorted(order.items(),key=lambda x:len(x[0]))
pu = sorted(po,key=lambda x:x[0])
for j,k in pu:
print(j,k) | from collections import Counter
order = Counter()
N = int(input())
for i in range(N):
A = input().split()
name,quantity = A[0],int(A[1])
order[name] += quantity
po = sorted(order.items(),key=lambda x:x[0])
pu = sorted(po,key=lambda x:len(x[0]))
for j,k in pu:
print(j,k) | [["-", 3, 4, 0, 653, 51, 670, 8, 652, 63, 22], ["-", 0, 653, 51, 670, 8, 652, 3, 4, 0, 24], ["-", 0, 653, 51, 670, 8, 652, 3, 4, 0, 25], ["+", 3, 4, 0, 653, 51, 670, 8, 652, 63, 22], ["+", 0, 653, 51, 670, 8, 652, 3, 4, 0, 24], ["+", 0, 653, 51, 670, 8, 652, 3, 4, 0, 25]] | 5 | 108 | 6 |
#include <cmath>
#include <iostream>
using namespace std;
bool is_room(int S) {
for (int i = 1; 4 * i * i + i + 1 <= S; i++)
if ((S - i) % (2 * i + 1) == 0)
return true;
return false;
}
int main(void) {
int n, S, cnt = 0;
cin >> n;
while (n--) {
cin >> S;
if (!is_room(S))
cnt++;
... | #include <cmath>
#include <iostream>
using namespace std;
bool is_room(int S) {
for (int i = 1; i * i <= S; i++)
if ((S - i) % (2 * i + 1) == 0)
return true;
return false;
}
int main(void) {
int n, S, cnt = 0;
cin >> n;
while (n--) {
cin >> S;
if (!is_room(S))
cnt++;
}
cout <... | [["-", 31, 16, 31, 16, 31, 16, 31, 16, 31, 13], ["-", 31, 16, 31, 16, 31, 16, 31, 16, 17, 48], ["-", 15, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 0, 7, 15, 16, 31, 16, 31, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13]] | 1 | 113 | 6 |
#include <iostream>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
while (cin >> n) {
bool ok = false;
for (int y = 1; y * y < n; y++) {
if ((n - y) % (2 * y + 1))
continue;
ok = true;
break;
}
ans += ok;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
while (cin >> n) {
bool ok = false;
for (int y = 1; y * y < n; y++) {
if ((n - y) % (2 * y + 1))
continue;
ok = true;
break;
}
ans += !ok;
}
cout << ans << endl;
} | [["+", 8, 9, 0, 1, 0, 11, 12, 91, 17, 111]] | 1 | 88 | 1 |
#include <iostream>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, b) loop(i, 0, b)
int main(void) {
int n, S, ans = 0;
cin >> n;
while (n--) {
cin >> S;
bool ok = false;
for (int i = 1; i * i <= S; i++) {
if ((S - i) % (2 * i + 1) == 0) {
... | #include <iostream>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, b) loop(i, 0, b)
int main(void) {
int n, S, ans = 0;
cin >> n;
while (n--) {
cin >> S;
bool ok = true;
for (int i = 1; i * i <= S; i++) {
if ((S - i) % (2 * i + 1) == 0) {
... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 147], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 146], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 146], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 147]] | 1 | 117 | 4 |
n=gets.to_i
c=0
n.times{
s=gets.to_i
f=true
x=1
while 2*x*x+x*x<=s
if (s-x)%(2*x+1)==0
f=false
break
end
x+=1
end
c+=1 if f
}
puts c
| n=gets.to_i
c=0
n.times{
s=gets.to_i
f=true
x=1
while 2*x*x+x+x<=s
if (s-x)%(2*x+1)==0
f=false
break
end
x+=1
end
c+=1 if f
}
puts c
| [["-", 0, 89, 15, 738, 31, 738, 12, 738, 17, 48], ["+", 8, 734, 0, 89, 15, 738, 31, 738, 17, 72]] | 4 | 68 | 2 |
import java.math.BigInteger;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n, m, r;
n = sc.nextInt();
m = sc.nextInt();
r = sc.nextInt();
if (r - n * m < 0) {
System.out.println("0");
}
BigInteger ... | import java.math.BigInteger;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n, m, r;
n = sc.nextInt();
m = sc.nextInt();
r = sc.nextInt();
if (r - n * m < 0) {
System.out.println("0");
return;
}
... | [["+", 8, 196, 0, 57, 64, 196, 0, 37, 0, 38], ["+", 8, 196, 0, 57, 64, 196, 0, 37, 0, 35]] | 3 | 242 | 2 |
def fact(c)
ret=1
for i in 2..c do
ret*=i
end
return ret
end
a,b,r=gets.split.map(&:to_i)
r=r-a*b;
if r<0 then
puts "0"
else
p fact(n+r-1)/fact(r)/fact(n-1)
end | def fact(c)
ret=1
for i in 2..c do
ret*=i
end
return ret
end
a,b,r=gets.split.map(&:to_i)
r=r-a*b
m=0
if r<0 then
puts "0"
else
p fact(a+r-1)/fact(r)/fact(a-1)
end | [["-", 36, 36, 36, 36, 36, 36, 0, 493, 0, 35], ["+", 36, 36, 36, 36, 0, 493, 0, 662, 31, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 662, 0, 32], ["+", 36, 36, 36, 36, 0, 493, 0, 662, 12, 612], ["-", 31, 652, 3, 4, 0, 738, 31, 738, 31, 22], ["+", 31, 652, 3, 4, 0, 738, 31, 738, 31, 22], ["-", 0, 738, 12, 652, 3, 4, 0, 738, 3... | 4 | 77 | 8 |
n,m,r=map(int,input().split())
r-=n*m
if r<0:print(0);exit(0);
from math import *
print(factorial(n+r-1//factorial(r))//factorial(n-1)) | n,m,r=map(int,input().split())
r-=n*m
if r<0:print(0);exit(0);
from math import *
print(factorial(n+r-1)//factorial(r)//factorial(n-1)) | [["+", 0, 657, 31, 657, 31, 652, 3, 4, 0, 25], ["-", 0, 657, 12, 657, 12, 652, 3, 4, 0, 25]] | 5 | 65 | 2 |
def foo(infile, outfile):
import math
n, m, r=infile.readline().split()
n=int(n)
m=int(m)
r=int(r)
print(0)
if r-n*m >= 0:
print(math.factorial(r-n*m+n-1)/math.factorial(r-n*m)/math.factorial(n-1))
else :
print(0)
if __name__ == "__main__":
import sys
foo(sys.std... | def foo(infile, outfile):
import math
n, m, r=infile.readline().split()
n=int(n)
m=int(m)
r=int(r)
if r-n*m >= 0:
print(math.factorial(r-n*m+n-1)/math.factorial(r-n*m)/math.factorial(n-1))
else :
print(0)
if __name__ == "__main__":
import sys
foo(sys.stdin, sys.stdou... | [["-", 0, 14, 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, 612], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 118 | 4 |
#include <math.h>
#include <stdio.h>
int main() {
int data[5], sum = 0, i, ave;
for (i = 0; i < 5; i++) {
scanf("%d", &data[i]);
if (data[i] < 40) {
data[i] = 40;
}
sum = sum + data[i];
}
ave = sum / 5;
printf("%d\n%d\n", sum, ave);
return 0;
} | #include <math.h>
#include <stdio.h>
int main() {
int data[5], sum = 0, i, ave;
for (i = 0; i < 5; i++) {
scanf("%d", &data[i]);
if (data[i] < 40) {
data[i] = 40;
}
sum = sum + data[i];
}
ave = sum / 5;
printf("%d\n", ave);
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 102 | 4 |
#include <stdio.h>
int main() {
int a[5], sum = 0, i, ans;
for (i = 0; i < 5; i++) {
scanf("%d", &a[i]);
if (a[i] < 40)
a[i] = 40;
sum += a[i];
}
ans = sum / 5.0;
printf("%lf\n", ans);
return 0;
} | #include <stdio.h>
int main() {
int a[5], sum = 0, i, ans;
for (i = 0; i < 5; i++) {
scanf("%d", &a[i]);
if (a[i] < 40)
a[i] = 40;
sum += a[i];
}
ans = sum / 5.0;
printf("%d\n", ans);
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 92 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int ze(int a) {
if (a < 0)
return -a;
return a;
}
int main() {
int a;
cin >> a >> a >> a;
int b, c;
cin >> b >> c;
int s = 0;
for (int d = 0; d < a - 1; d++) {
int e, f;
cin >> e >> f;
if (... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int ze(int a) {
if (a < 0)
return -a;
return a;
}
int main() {
int a;
cin >> a >> a >> a;
int b, c;
cin >> b >> c;
int s = 0;
for (int d = 0; d < a - 1; d++) {
int e, f;
cin >> e >> f;
if (... | [["-", 51, 16, 12, 23, 0, 16, 12, 16, 31, 22], ["+", 51, 16, 12, 23, 0, 16, 12, 16, 31, 22], ["-", 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, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22]] | 1 | 167 | 6 |
/*
#include<iostream>
#include<queue>
#include<utility>
using namespace std;
int bfs();
const int INF = 100000000;
typedef pair<int, int> P;
int N, M;
int sx, sy;
int gx, gy;
int d[100][101];
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int main() {
cin >> N >> M;
int res = bfs();
printf("%d\... | /*
#include<iostream>
#include<queue>
#include<utility>
using namespace std;
int bfs();
const int INF = 100000000;
typedef pair<int, int> P;
int N, M;
int sx, sy;
int gx, gy;
int d[100][101];
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int main() {
cin >> N >> M;
int res = bfs();
printf("%d\... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 627 | 2 |
int a, z, u, i, j, k, d[1999][9];
main() {
scanf("%d ", &a);
d[0][2] = 1;
for (i = 0; i < a; i++) {
u = getchar() % 4 - 1;
for (j = 8; j--;) {
for (k = 8; k--;)
if (j & k && j >> u & 1)
d[i + 1][j] += d[i][k] % 10007;
u += d[a][j];
}
}
printf("%d\n", z % 10007);
} | a, z, u, i, j, k, d[1999][9];
main() {
scanf("%d ", &a);
d[0][2] = 1;
for (i = 0; i < a; i++) {
u = getchar() % 4 - 1;
for (j = 8; j--;) {
for (k = 8; k--;)
if (j & k && j >> u & 1)
d[i + 1][j] += d[i][k] % 10007;
z += d[a][j];
}
}
a = !printf("%d\n", z % 10007);
} | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 30, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 30, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 9, 0, 1, 0, 11, 12, 91, 17, 111]] | 0 | 148 | 6 |
#include <iostream>
// j=前の日,1=J,11=JO,111=JOI,100=I
using namespace std;
int n, ho[1002] = {}, memo[112][1001][112];
char a[1002];
int sh(int j, int day, int ij) {
int A = 0;
A = j - ho[day];
if (A == 99 || A == 9 || A == 109 || A == 90 || A == 91 || A == -9 ||
A == -99 || A == -90 || A == -89)
return ... | #include <iostream>
// j=前の日,1=J,11=JO,111=JOI,100=I
using namespace std;
int n, ho[1202] = {}, memo[112][1001][112];
char a[1202];
int sh(int j, int day, int ij) {
int A = 0;
A = j - ho[day];
if (A == 99 || A == 9 || A == 109 || A == 90 || A == 91 || A == -9 ||
A == -99 || A == -90 || A == -89)
return ... | [["-", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8,... | 1 | 602 | 10 |
#include <iostream>
#include <string>
using namespace std;
int n, a[1009], dp[1009][8];
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'O')
a[i] = 1;
if (s[i] == 'I')
a[i] = 2;
}
for (int i = 0; i < 8; i++) {
if (i & (1 << a[0]))
dp[0][i] = 1;
}
... | #include <iostream>
#include <string>
using namespace std;
int n, a[1009], dp[1009][8];
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'O')
a[i] = 1;
if (s[i] == 'I')
a[i] = 2;
}
for (int i = 1; i < 8; i += 2) {
if (i & (1 << a[0]))
dp[0][i] = 1;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 7, 26, 11, 17, 107], ["+", 0, 14, 8, 9, 0, 7, 26, 11, 12, 13], ["-", 0, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 274 | 9 |
#include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define X real()
#define Y imag()
#define value(x, y, w, h) (x >= 0 && x < w && y >= 0 && y < h)
#define all(r) (r).begin(), (r).end()
#define gsort(st, en) sort((st), (en), greater<int>())
#define vmax(ary) *ma... | #include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define X real()
#define Y imag()
#define value(x, y, w, h) (x >= 0 && x < w && y >= 0 && y < h)
#define all(r) (r).begin(), (r).end()
#define gsort(st, en) sort((st), (en), greater<int>())
#define vmax(ary) *ma... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 676 | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3L + 11;
const int mod = 1e4L + 7;
int dp[N][8];
int a[N];
int main() {
ios ::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
s = '0' + s;
for (int i = 1; i <= n; i++)
a[i] = (s[i] == 'J') ? 1 : (s[i] == 'O') ? 2 : 4;
for ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e3L + 11;
const int mod = 1e4L + 7;
int dp[N][8];
int a[N];
int main() {
ios ::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
s = '0' + s;
for (int i = 1; i <= n; i++)
a[i] = (s[i] == 'J') ? 1 : (s[i] == 'O') ? 2 : 4;
for ... | [["-", 31, 23, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 31, 23, 0, 16, 12, 69, 341, 342, 0, 13]] | 1 | 268 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define MAX 100000000
#define J 100
int a[1010][2][2][2];
int main() {
int n, x, y, z;
string str;
cin >> n >> str;
if (str[0] == 'J')
for (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define MAX 100000000
#define J 100
int a[1010][2][2][2];
int main() {
int n, x, y, z;
string str;
cin >> n >> str;
if (str[0] == 'J')
for (... | [["-", 0, 91, 28, 91, 28, 23, 0, 16, 17, 109], ["+", 0, 91, 28, 91, 28, 23, 0, 16, 17, 67]] | 1 | 792 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | [["+", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111], ["-", 0, 57, 15, 339, 51, 16, 31, 23, 0, 25], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 91, 28, 23, 0, 25]] | 1 | 410 | 5 |
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define F first
#define S second
const int INF = 1000000000;
... | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define F first
#define S second
const int INF = 1000000000;
... | [["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25]] | 1 | 343 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
reverse(begin(s), end(s));
int lb = 0, ub = s.size() / 3 + 10;
while (ub - lb > 1) {
int md = (lb + ub) / 2;
int ci = 0, cio = 0, cioi = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'I') {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
reverse(begin(s), end(s));
int lb = 0, ub = s.size() / 3 + 10;
while (ub - lb > 1) {
int md = (lb + ub) / 2;
int ci = 0, cio = 0, cioi = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'I') {
... | [["+", 64, 9, 0, 57, 75, 76, 0, 57, 0, 121], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 24], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 25]] | 1 | 211 | 6 |
#include <iostream>
#include <string>
using namespace std;
int n;
string str;
bool check(int num) {
int a = 0, b = 0, c = 0;
for (int i = n - 1; i > -1; --i) {
if (str[i] == 'I') {
if (a < num)
++a;
else if (c < b)
++c;
} else if (str[i] == 'O' && b < a) {
++b;
} else i... | #include <iostream>
#include <string>
using namespace std;
int n;
string str;
bool check(int num) {
int a = 0, b = 0, c = 0;
for (int i = n - 1; i > -1; --i) {
if (str[i] == 'I') {
if (a < num)
++a;
else if (c < b)
++c;
} else if (str[i] == 'O') {
if (b < a) {
++b;
... | [["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 25], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 45], ["+", 75, 76, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 46], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, ... | 1 | 206 | 8 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
signed main() {
int a;
string b;
scanf("%d", &a);
cin >> b;
reverse(b.begin(), b.end()); // IOI???IOJ?????????
int s = 0, g = a / 3 + 1; //(s,g]
while (g - s > 1) {
int k = (s + g) /... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
signed main() {
int a;
string b;
scanf("%d", &a);
cin >> b;
reverse(b.begin(), b.end()); // IOI???IOJ?????????
int s = 0, g = a / 3 + 1; //(s,g]
while (g - s > 1) {
int k = (s + g) /... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 64, 9, 0, 1,... | 1 | 392 | 10 |
#include <stdio.h>
int main(void) {
int a, b, c, d;
int p;
int x, y;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &p);
x = a * p;
y = b;
if (y > c) {
y += (y - c) * d;
}
if (x < y) {
printf("%d\n", x);
} else {
printf("%d\n", y);
}
retu... | #include <stdio.h>
int main(void) {
int a, b, c, d;
int p;
int x, y;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &p);
x = a * p;
y = b;
if (p > c) {
y += (p - c) * d;
}
if (x < y) {
printf("%d\n", x);
} else {
printf("%d\n", y);
}
retu... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["-", 0, 11, 12, 16, 31, 23, 0, 16, 31, 22], ["+", 0, 11, 12, 16, 31, 23, 0, 16, 31, 22]] | 0 | 140 | 4 |
#include <stdio.h>
int main() {
int a, b, c, d, p, sum1 = 0, sum2 = 0;
scanf("%d %d %d %d %d", a, b, c, d, p);
sum1 = a * p;
if (p > c) {
sum2 = b + (p - c) * d;
} else {
sum2 = b;
}
if (sum1 < sum2) {
printf("%d\n", sum1);
} else {
printf("%d\n", sum2);
}
return 0;
} | #include <stdio.h>
int main() {
int a, b, c, d, p, sum1 = 0, sum2 = 0;
scanf("%d %d %d %d %d", &a, &b, &c, &d, &p);
sum1 = a * p;
if (p > c) {
sum2 = b + (p - c) * d;
} else {
sum2 = b;
}
if (sum1 < sum2) {
printf("%d\n", sum1);
} else {
printf("%d\n", sum2);
}
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 111 | 5 |
#include <math.h>
#include <stdio.h>
int main() {
int A, B, C, D, P, R;
scanf("%d%d%d%d%d", &A, &B, &C, &D, &P);
// printf("\n%d%d%d%d%d",A,B,C,D,P);
if (P > C) {
B = B + D * (P - C);
}
printf("%d\n%d\n%d", (int)fmin(B, A * P));
return 0;
} | #include <math.h>
#include <stdio.h>
int main() {
int A, B, C, D, P, R;
scanf("%d%d%d%d%d", &A, &B, &C, &D, &P);
// printf("\n%d%d%d%d%d",A,B,C,D,P);
if (P > C) {
B = B + D * (P - C);
}
printf("%d\n", (int)fmin(B, A * P));
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 92 | 3 |
#include <stdio.h>
int main() {
int i, a, b, c, d, p, x, y, result;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &p);
x = a * p;
if (p < c) {
y = b * p;
} else {
y = c + d * (p - c);
}
if (x < y) {
result = x;
} else {
result = y;
}
printf(... | #include <stdio.h>
int main() {
int i, a, b, c, d, p, x, y, result;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &p);
x = a * p;
if (p < c) {
y = b;
} else {
y = b + d * (p - c);
}
if (x < y) {
result = x;
} else {
result = y;
}
printf("%d\... | [["-", 64, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["-", 0, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 0, 9, 0, 1, 0, 11, 12, 16, 31, 22]] | 0 | 144 | 4 |
#include <stdio.h>
int main(void) {
int A, B, C, D, P, X = 0, Y = 0, result;
scanf("%d %d %d %d %d", &A, &B, &C, &D, &P);
X = A * P;
if (P > C)
Y = B + D * (P - C);
else
Y = B;
if (A < B)
result = Y;
else
result = X;
printf("%d\n", result);
return 0;
} | #include <stdio.h>
int main(void) {
int A, B, C, D, P, X = 0, Y = 0, result;
scanf("%d %d %d %d %d", &A, &B, &C, &D, &P);
X = A * P;
if (P > C)
Y = B + D * (P - C);
else
Y = B;
if (X > Y)
result = Y;
else
result = X;
printf("%d\n", result);
return 0;
} | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22]] | 0 | 109 | 6 |
#include <stdio.h>
int main() {
int a, b, c, d, p, x, y;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &p);
x = p * a;
if (c > p) {
y = b;
} else if (c > p) {
y = b + (p - c) * d;
}
if (x > y) {
printf("%d\n", y);
} else {
printf("%d\n", x);
}
... | #include <stdio.h>
int main() {
int a, b, c, d, p, x, y;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &p);
x = p * a;
if (c > p) {
y = b;
} else if (c < p) {
y = b + (p - c) * d;
}
if (x > y) {
printf("%d\n", y);
} else {
printf("%d\n", x);
}
... | [["-", 75, 76, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 75, 76, 0, 57, 15, 23, 0, 16, 17, 18]] | 0 | 146 | 2 |
a;
main(b, c, d, e) {
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
a = !printf("%d\n", a * e < b + (e > c ? e : c) * d
? a * e
: b + (e > c ? e : c) * d);
} | a;
main(b, c, d, e) {
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
a = !printf("%d\n", a * e < b + (e > c ? e - c : 0) * d
? a * e
: b + (e > c ? e - c : 0) * d);
} | [["-", 12, 16, 12, 16, 31, 23, 0, 41, 0, 102], ["+", 12, 16, 31, 23, 0, 41, 64, 16, 17, 33], ["+", 12, 16, 12, 16, 31, 23, 0, 41, 0, 102], ["+", 12, 16, 12, 16, 31, 23, 0, 41, 75, 13], ["-", 75, 16, 12, 16, 31, 23, 0, 41, 0, 102], ["+", 75, 16, 12, 16, 31, 23, 0, 41, 0, 102], ["+", 75, 16, 12, 16, 31, 23, 0, 41, 75, 13... | 0 | 84 | 8 |
a;
main(b, c, d, e) {
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
e = e > c ? e - c : 0;
a = !printf("%d\n", a * e < b + e * d ? a * e : b + e * d);
} | a;
main(b, c, d, e) {
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
c = e > c ? e - c : 0;
a = !printf("%d\n", a * e < b + c * d ? a * e : b + c * d);
} | [["-", 0, 30, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 30, 0, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 41, 15, 16, 12, 16, 12, 16, 31, 22], ["+", 0, 41, 15, 16, 12, 16, 12, 16, 31, 22], ["-", 3, 4, 0, 41, 75, 16, 12, 16, 31, 22], ["+", 3, 4, 0, 41, 75, 16, 12, 16, 31, 22]] | 0 | 80 | 16 |
#include <stdio.h>
int main(void) {
int a, b, c, d, p;
int ma1, ma2;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &p);
if (p > c) {
ma1 = b + p * d;
} else {
ma1 = b;
}
ma2 = a * p;
if (ma1 < ma2) {
printf("%d\n", ma1);
} else {
printf("%d... | #include <stdio.h>
int main(void) {
int a, b, c, d, p;
int ma1, ma2;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &p);
if (p > c) {
ma1 = b + (p - c) * d;
} else {
ma1 = b;
}
ma2 = a * p;
if (ma1 < ma2) {
printf("%d\n", ma1);
} else {
prin... | [["+", 0, 11, 12, 16, 12, 16, 31, 23, 0, 24], ["+", 12, 16, 12, 16, 31, 23, 0, 16, 17, 33], ["+", 12, 16, 12, 16, 31, 23, 0, 16, 12, 22], ["+", 0, 11, 12, 16, 12, 16, 31, 23, 0, 25]] | 0 | 138 | 4 |
#include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
int A, B, C, D, P;
cin >> A >> B >> C >> D >> P;
int X = A * P;
int Y = B + D * max(0, C - B);
cout << min(X, Y) << endl;
}
| #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
int A, B, C, D, P;
cin >> A >> B >> C >> D >> P;
int X = A * P;
int Y = B + D * max(0, P - C);
cout << min(X, Y) << endl;
}
| [["-", 12, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["-", 12, 16, 12, 2, 3, 4, 0, 16, 12, 22], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 12, 22]] | 1 | 74 | 4 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, p, n;
cin >> a >> b >> c >> d >> p;
n = b;
if (p > c)
n += (p - c) * d;
cout << min(a, n) << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, p, n;
cin >> a >> b >> c >> d >> p;
n = b;
if (p > c)
n += (p - c) * d;
cout << min(a * p, n) << endl;
} | [["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 48], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 22]] | 1 | 68 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, p, q, x, y;
cin >> a >> b >> c >> d >> p;
x = p * a;
if (p <= c) {
y = b;
} else {
y = b + (d - c) * d;
}
cout << (x < y ? x : y) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, p, q, x, y;
cin >> a >> b >> c >> d >> p;
x = p * a;
if (p <= c) {
y = b;
} else {
y = b + (p - c) * d;
}
cout << (x < y ? x : y) << endl;
return 0;
} | [["-", 12, 16, 12, 16, 31, 23, 0, 16, 31, 22], ["+", 12, 16, 12, 16, 31, 23, 0, 16, 31, 22]] | 1 | 91 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, p;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> p;
if (p <= c) {
if (a * p < b) {
cout << a * p << endl;
} else {
cout << b << endl;
}
} else {
if (a * p < b + (p - c) * d) {
cout << a * p << endl;
... | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, p;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> p;
if (p <= c) {
if (a * p < b) {
cout << a * p << endl;
} else {
cout << b << endl;
}
} else {
if (a * p < b + (p - c) * d) {
cout << a * p << endl;
... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72]] | 1 | 125 | 2 |
#include <iostream>
int main() {
int a, b, c, d, p;
int x = 0;
int y = 0;
std::cin >> a >> b >> c >> d >> p;
x += a * p;
y += b;
if (c < p)
y += (p - c) * d;
if (x > y)
std::cout << x << std::endl;
else
std::cout << y << std::endl;
} | #include <iostream>
int main() {
int a, b, c, d, p;
int x = 0;
int y = 0;
std::cin >> a >> b >> c >> d >> p;
x += a * p;
y += b;
if (c < p)
y += (p - c) * d;
if (x > y)
std::cout << y << std::endl;
else
std::cout << x << std::endl;
} | [["-", 0, 57, 64, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 57, 64, 1, 0, 16, 31, 16, 12, 22], ["-", 75, 76, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 75, 76, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 96 | 4 |
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d, p, x, y;
main() {
cin >> a >> b >> c >> d >> p;
x = a * p;
y = max(b, (p - c) * d + b);
cout << max(x, y) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int a, b, c, d, p, x, y;
main() {
cin >> a >> b >> c >> d >> p;
x = a * p;
y = max(b, (p - c) * d + b);
cout << min(x, y) << endl;
} | [["-", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22]] | 1 | 72 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C, D, P, X, Y;
cin >> A >> B >> C >> D >> P;
X = A * P;
Y = min(B, B + D * (P - C));
cout << min(X, Y) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C, D, P, X, Y;
cin >> A >> B >> C >> D >> P;
X = A * P;
Y = max(B, B + D * (P - C));
cout << min(X, Y) << endl;
return 0;
} | [["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22]] | 1 | 78 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
int p;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &p);
if (p <= c) {
printf("%d\n", min(p * a, b));
} else {
printf("%d\n", min(p * a, b + (c - p) * d));
}
return (0);
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
int p;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &p);
if (p <= c) {
printf("%d\n", min(p * a, b));
} else {
printf("%d\n", min(p * a, b + (p - c) * d));
}
return (0);
} | [["-", 0, 16, 12, 16, 31, 23, 0, 16, 31, 22], ["-", 0, 16, 12, 16, 31, 23, 0, 16, 17, 33], ["+", 0, 16, 12, 16, 31, 23, 0, 16, 17, 33], ["+", 0, 16, 12, 16, 31, 23, 0, 16, 12, 22]] | 1 | 108 | 4 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int a, b, c, d, p;
int x, y;
int main() {
cin >> a >> b >> c >> d >> p;
x = a * p;
if (c <= p) {
y = b;
} else {
y = b + (p - c) * d;
}
cout << min(x, y) << endl;
return 0;
} | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int a, b, c, d, p;
int x, y;
int main() {
cin >> a >> b >> c >> d >> p;
x = a * p;
if (p <= c) {
y = b;
} else {
y = b + (p - c) * d;
}
cout << min(x, y) << endl;
return 0;
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 91 | 4 |
#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"
int m... | #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"
int m... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 120 | 2 |
#include <iostream>
int main() {
int a, b, c, d, e;
std::cin >> a;
std::cin >> b;
std::cin >> c;
std::cin >> d;
std::cin >> e;
int cost_a, cost_b;
cost_a = a * e;
if (c < e) {
cost_b = b * c + (e - c) * d;
} else {
cost_b = b * e;
}
if (cost_a < cost_b) {
std::cout << cost_a <<... | #include <iostream>
int main() {
int a, b, c, d, e;
std::cin >> a;
std::cin >> b;
std::cin >> c;
std::cin >> d;
std::cin >> e;
int cost_a, cost_b;
cost_a = a * e;
if (c < e) {
cost_b = b + (e - c) * d;
} else {
cost_b = b;
}
if (cost_a < cost_b) {
std::cout << cost_a << std::en... | [["-", 0, 1, 0, 11, 12, 16, 31, 16, 17, 48], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["-", 0, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["-", 0, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 125 | 4 |
#include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
typedef pair<int, int> pii;
#define ITR(v, c) for (auto v = begin(c); v != end(c); v++)
#define FOR(v, a, n) for (int v = a; v < (int)(n); v++)
#define FORE(x, arr) for (auto &x : arr)
#define REP(v, n) FOR(v, 0, n)
#define RRE... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
typedef pair<int, int> pii;
#define ITR(v, c) for (auto v = begin(c); v != end(c); v++)
#define FOR(v, a, n) for (int v = a; v < (int)(n); v++)
#define FORE(x, arr) for (auto &x : arr)
#define REP(v, n) FOR(v, 0, n)
#define RRE... | [["-", 0, 16, 12, 16, 31, 23, 0, 16, 12, 22], ["+", 0, 16, 12, 16, 31, 23, 0, 16, 12, 22]] | 1 | 297 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, p, x, y;
cin >> a >> b >> c >> d >> p;
x = a * p;
if (c <= p) {
y = b;
} else {
p - c;
y = d * (p - c) + b;
}
if (y < x) {
cout << y << endl;
} else {
cout << x << endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, p, x, y;
cin >> a >> b >> c >> d >> p;
x = a * p;
if (p <= c) {
y = b;
} else {
p - c;
y = d * (p - c) + b;
}
if (y < x) {
cout << y << endl;
} else {
cout << x << endl;
}
return 0;
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 104 | 4 |
#include <iostream>
using namespace std;
int main() {
int x, y1, y2, y3, joi;
int resx, resy;
cin >> x;
cin >> y1;
cin >> y2;
cin >> y3;
cin >> joi;
resx = x * joi;
resy = y1 + (joi > y2 ? y2 - joi : 0) * y3;
cout << (resx < resy ? resx : resy) << endl;
} | #include <iostream>
using namespace std;
int main() {
int x, y1, y2, y3, joi;
int resx, resy;
cin >> x;
cin >> y1;
cin >> y2;
cin >> y3;
cin >> joi;
resx = x * joi;
resy = y1 + (joi > y2 ? joi - y2 : 0) * y3;
cout << (resx < resy ? resx : resy) << endl;
} | [["-", 12, 16, 31, 23, 0, 41, 64, 16, 31, 22], ["-", 12, 16, 31, 23, 0, 41, 64, 16, 17, 33], ["+", 12, 16, 31, 23, 0, 41, 64, 16, 17, 33], ["+", 12, 16, 31, 23, 0, 41, 64, 16, 12, 22]] | 1 | 86 | 4 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, p;
int x, y;
cin >> a >> b >> c >> d >> p;
x = a * p;
if (p > c) {
y = b * p + d * (p - c);
} else {
y = b * p;
}
if (x > y) {
cout << y << endl;
} else {
cout << x << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, p;
int x, y;
cin >> a >> b >> c >> d >> p;
x = a * p;
if (p > c) {
y = b + d * (p - c);
} else {
y = b;
}
if (x > y) {
cout << y << endl;
} else {
cout << x << endl;
}
return 0;
} | [["-", 0, 1, 0, 11, 12, 16, 31, 16, 17, 48], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["-", 0, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["-", 0, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 103 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#def... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#def... | [["+", 31, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["-", 3, 4, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72]] | 1 | 170 | 4 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, x, y = 0;
cin >> a >> b >> c >> d >> e;
if (e * a <= c)
x = b;
else {
y = e - c;
x = y * d + b;
}
if (e * a < x)
cout << y;
else
cout << x;
cout << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, x, y = 0;
cin >> a >> b >> c >> d >> e;
if (e <= c)
x = b;
else {
y = e - c;
x = y * d + b;
}
if (e * a < x)
cout << e * a;
else
cout << x;
cout << endl;
} | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 57, 64, 1, 0, 16, 12, 22], ["+", 0, 57, 64, 1, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 64, 1, 0, 16, 12, 16, 17, 48], ["+", 0, 57, 64, 1, 0, 16, 12, 16, 12, 22]] | 1 | 91 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, p;
int x, y;
cin >> a >> b >> c >> d >> p;
x = a * p;
if (c >= p)
y = b;
else
y = b + d * p;
cout << min(x, y) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, p;
int x, y;
cin >> a >> b >> c >> d >> p;
x = a * p;
if (c >= p)
y = b;
else
y = b + d * (p - c);
cout << min(x, y) << endl;
}
| [["+", 0, 11, 12, 16, 12, 16, 12, 23, 0, 24], ["+", 12, 16, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 12, 16, 12, 16, 12, 23, 0, 16, 12, 22], ["+", 0, 11, 12, 16, 12, 16, 12, 23, 0, 25]] | 1 | 76 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, m, reason;
cin >> n >> m;
int tag[m], table[n] = {0};
for (int i = 0; i < m; i++) {
cin >> tag[i];
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
cin >> reason;
if (reason == tag[i]) {
table[j]++;
... | #include <iostream>
using namespace std;
int main() {
int n, m, reason;
cin >> n >> m;
int tag[m], table[n] = {0};
for (int i = 0; i < m; i++) {
cin >> tag[i];
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
cin >> reason;
if (reason == tag[i]) {
table[j]++;
... | [["+", 0, 27, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 156 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int A[M + 1];
int answer[N + 1];
int B[M + 1][N + 1];
for (int i = 1; i < N; i++)
answer[i] = 0;
for (int i = 1; i <= M; i++)
cin >> A[i];
for (int i = 1; i <= M; i++) {
for (int j = 1; j <= N; j++) {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int A[M + 1];
int answer[N + 1];
int B[M + 1][N + 1];
for (int i = 1; i <= N; i++)
answer[i] = 0;
for (int i = 1; i <= M; i++)
cin >> A[i];
for (int i = 1; i <= M; i++) {
for (int j = 1; j <= N; j++) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 197 | 2 |
N = gets.to_i
M = gets.to_i
A = gets.split.map(&:to_i).map{|i|i-1}
sum = Array.new(N){0}
M.times do |round|
gets.split.map(&:to_i).map{|i|i-1}.each.with_index do |b, i|
case A[round]
when i
sum[i] += 1
when b
sum[i] += 1
else
sum[A[round]] += 1
end
end
end
p sum | N = gets.to_i
M = gets.to_i
A = gets.split.map(&:to_i).map{|i|i-1}
sum = Array.new(N){0}
M.times do |round|
gets.split.map(&:to_i).map{|i|i-1}.each.with_index do |b, i|
case A[round]
when i
sum[i] += 1
when b
sum[i] += 1
else
sum[A[round]] += 1
end
end
end
puts sum | [["-", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]] | 4 | 114 | 2 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int H = sc.nextInt();
int W = sc.nextInt();
char[][] weater = new char[H][W];
int[][] area = new int[H][W];
int i, j, time;
for (i = 0; i < H; i++)
weater[i] = sc.n... |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int H = sc.nextInt();
int W = sc.nextInt();
char[][] weater = new char[H][W];
int[][] area = new int[H][W];
int i, j, time;
for (i = 0; i < H; i++)
weater[i] = sc.n... | [["-", 8, 196, 0, 57, 75, 1, 0, 492, 141, 22], ["+", 8, 196, 0, 57, 75, 1, 0, 492, 141, 22]] | 3 | 298 | 2 |
import java.util.*;
class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int H = sc.nextInt();
int W = sc.nextInt();
for (int i = 0; i < H; i++) {
String line = sc.next();
int x = -1;
for (int j = 1; j < W; j++) {
if (line.charAt(j) == '... | import java.util.*;
class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int H = sc.nextInt();
int W = sc.nextInt();
for (int i = 0; i < H; i++) {
String line = sc.next();
int x = -1;
for (int j = 0; j < W; j++) {
if (line.charAt(j) == '... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["-", 8, 196, 0, 57, 15, 15, 0, 16, 31, 22], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 31, 22]] | 3 | 165 | 4 |
#include <iostream>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
char a[h][w];
int b[h][w];
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
cin >> a[i][j];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
int d = 0;
for (int k = j; k >= 0; k--) {
... | #include <iostream>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
char a[h][w];
int b[h][w];
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
cin >> a[i][j];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
int d = 0;
for (int k = j; k >= 0; k--) {
... | [["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 242 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
char S[100][101];
int Calc[100][101];
fill_n(*Calc, 100 * 101, -1);
cin >> H >> W;
for (int i = 0; i < H; i++) {
cin >> S[i];
}
for (int i = 0; i < H; i++) {
for (int j = 1; j < W; j++) {
if (S[i][j - 1] == 'c')
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
char S[100][101];
int Calc[100][101];
fill_n(*Calc, 100 * 101, -1);
cin >> H >> W;
for (int i = 0; i < H; i++) {
cin >> S[i];
}
for (int i = 0; i < H; i++) {
for (int j = 1; j <= W; j++) {
if (S[i][j - 1] == 'c')
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 243 | 2 |
#include <iostream>
using namespace std;
int main() {
int h, w;
string s[110];
int map[110][110] = {};
cin >> h >> w;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
map[i][j] = -1;
}
}
for (int i = 0; i < h; i++) {
cin >> s[i];
}
for (int i = 0; i < h; i++) {
for... | #include <iostream>
using namespace std;
int main() {
int h, w;
string s[110];
int map[110][110] = {};
cin >> h >> w;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
map[i][j] = -1;
}
}
for (int i = 0; i < h; i++) {
cin >> s[i];
}
for (int i = 0; i < h; i++) {
for... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 312 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, flag;
char ch;
cin >> a >> b;
for (int i = 0; i < a; i++) {
flag = -1;
for (int j = 0; j < b; j++) {
scanf("%c", &ch);
if (ch == 'c') {
cout << '0';
flag = 0;
} else {
if (flag == -1)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, flag;
char ch;
cin >> a >> b;
for (int i = 0; i < a; i++) {
flag = -1;
for (int j = 0; j < b; j++) {
scanf(" %c", &ch);
if (ch == 'c') {
cout << '0';
flag = 0;
} else {
if (flag == -1)
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 131 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#def... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#def... | [["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 360 | 1 |
#include <iostream>
using namespace std;
#define loop(i, n) for (int i = 1; i <= n; i++)
char res[102];
int main() {
int h, w;
char p;
cin >> h >> w;
loop(i, h) {
res[0] = -1;
loop(j, w) {
cin >> p;
if (p == 'c')
res[j] = 0;
else if (res[j - 1] == -1)
res[j] = -1;
... | #include <iostream>
using namespace std;
#define loop(i, n) for (int i = 1; i <= n; i++)
int res[102];
int main() {
int h, w;
char p;
cin >> h >> w;
loop(i, h) {
res[0] = -1;
loop(j, w) {
cin >> p;
if (p == 'c')
res[j] = 0;
else if (res[j - 1] == -1)
res[j] = -1;
... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40]] | 1 | 143 | 2 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
int p[100][100];
int main() {
memset(p, -1, sizeof(p));
int i, j, n, m, w, h;
string s;
cin >> h >> w;
for (i = 0; i < h; i++) {
cin >> s;
for (j = 0; j < w; j++) {
if (s[j] == 'c')
p[i][j] ... | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
int p[100][100];
int main() {
memset(p, -1, sizeof(p));
int i, j, n, m, w, h;
string s;
cin >> h >> w;
for (i = 0; i < h; i++) {
cin >> s;
for (j = 0; j < w; j++) {
if (s[j] == 'c')
p[i][j] ... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22]] | 1 | 225 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int H, W;
string instr;
int temp;
cin >> H >> W;
for (int i = 0; i < H; ++i) {
cin >> instr;
temp = (instr[i] == '.' ? -1 : 0);
cout << temp;
for (int j = 1; j < W; ++j) {
if (instr[j] == 'c') {
temp = 0;... | #include <iostream>
#include <string>
using namespace std;
int main() {
int H, W;
string instr;
int temp;
cin >> H >> W;
for (int i = 0; i < H; ++i) {
cin >> instr;
temp = (instr[0] == '.' ? -1 : 0);
cout << temp;
for (int j = 1; j < W; ++j) {
if (instr[j] == 'c') {
temp = 0;... | [["-", 0, 41, 15, 16, 31, 69, 341, 342, 0, 22], ["+", 0, 41, 15, 16, 31, 69, 341, 342, 0, 13]] | 1 | 142 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, p;
cin >> a >> b >> c >> d >> p;
if (p > c) {
b += d * (p - c);
}
a = a * p > b ? a * p : b;
cout << a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, p;
cin >> a >> b >> c >> d >> p;
if (p > c) {
b += d * (p - c);
}
a = a * p < b ? a * p : b;
cout << a << endl;
return 0;
} | [["-", 0, 1, 0, 11, 12, 41, 15, 16, 17, 47], ["+", 0, 1, 0, 11, 12, 41, 15, 16, 17, 18]] | 1 | 76 | 2 |
#include <stdio.h>
int main() {
int a, b, c, d, p, x, y, r;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &p);
if (c < p) {
y = b;
} else {
y = b + (c - p) * d;
}
x = a * p;
if (y < x) {
r = y;
} else {
r = x;
}
printf("%d\n", r);
return 0;
} | #include <stdio.h>
int main() {
int a, b, c, d, p, x, y, r;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &p);
if (c > p) {
y = b;
} else {
y = b + (p - c) * d;
}
x = a * p;
if (y < x) {
r = y;
} else {
r = x;
}
printf("%d\n", r);
return 0;
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 12, 16, 12, 16, 31, 23, 0, 16, 31, 22], ["-", 12, 16, 12, 16, 31, 23, 0, 16, 17, 33], ["+", 12, 16, 12, 16, 31, 23, 0, 16, 17, 33], ["+", 12, 16, 12, 16, 31, 23, 0, 16, 12, 22]] | 1 | 112 | 6 |
#include <iostream>
using namespace std;
int main() {
int a;
int b, c, d;
int p;
int x_moni;
int y_moni;
int moni;
cin >> a >> b >> c >> d >> p;
x_moni = p * a;
y_moni = b;
if (p > c) {
p -= c;
y_moni += d * p;
}
moni = max(x_moni, y_moni);
cout << moni << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
int b, c, d;
int p;
int x_moni;
int y_moni;
int moni;
cin >> a >> b >> c >> d >> p;
x_moni = p * a;
y_moni = b;
if (p > c) {
p -= c;
y_moni += d * p;
}
moni = min(x_moni, y_moni);
cout << moni << endl;
return 0;
} | [["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22]] | 1 | 92 | 2 |
#include <algorithm>
#include <iostream>
int main() {
int a, b, c, d, p, A, B;
std::cin >> a >> b >> c >> d >> p;
A = a * p;
if (p <= c) {
B = c;
} else {
B = b + ((p - c) * d);
}
std::cout << std::min(A, B) << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
int main() {
int a, b, c, d, p, A, B;
std::cin >> a >> b >> c >> d >> p;
A = a * p;
if (p <= c) {
B = b;
} else {
B = b + ((p - c) * d);
}
std::cout << std::min(A, B) << std::endl;
return 0;
} | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 1 | 94 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C, D, P;
int X, Y;
cin >> A;
cin >> B;
cin >> C;
cin >> D;
cin >> P;
X = A * P;
if (P < C) {
Y = B;
} else if (C < P) {
Y = (P - C) * D;
}
cout << min(X, Y) << endl;
return (0);
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C, D, P;
int X, Y;
cin >> A;
cin >> B;
cin >> C;
cin >> D;
cin >> P;
X = A * P;
if (P < C) {
Y = B;
} else if (C < P) {
Y = ((P - C) * D) + B;
}
cout << min(X, Y) << endl;
return (0);
} | [["+", 12, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 25], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 103 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define llong long long
#define inf 999999999
#define mp make_pair
#define pb push_back
#define fn fill_n
typedef pair<int, int> P;
typedef pair<P, int> PP;
typedef pair<PP, int> PPP;
typedef struct data {
int now;
int cost;
} data;
int nh[4] = {1, 0, -1, 0};
int nw[4]... | #include <bits/stdc++.h>
using namespace std;
#define llong long long
#define inf 999999999
#define mp make_pair
#define pb push_back
#define fn fill_n
typedef pair<int, int> P;
typedef pair<P, int> PP;
typedef pair<PP, int> PPP;
typedef struct data {
int now;
int cost;
} data;
int nh[4] = {1, 0, -1, 0};
int nw[4]... | [["-", 31, 16, 12, 2, 3, 4, 0, 16, 12, 22], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 22], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 31, 22]] | 1 | 149 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, p;
int sum = 0, sum_a = 0, sum_b = 0;
cin >> a >> b >> c >> d >> p;
sum_a = a * p;
if (p <= c)
sum_b = b;
else if (p > c)
sum_b = b + (b - c) * d;
sum = min({sum_a, sum_b});
cout << sum << endl;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, p;
int sum = 0, sum_a = 0, sum_b = 0;
cin >> a >> b >> c >> d >> p;
sum_a = a * p;
if (p <= c)
sum_b = b;
else if (p > c)
sum_b = b + (p - c) * d;
sum = min({sum_a, sum_b});
cout << sum << endl;
... | [["-", 12, 16, 12, 16, 31, 23, 0, 16, 31, 22], ["+", 12, 16, 12, 16, 31, 23, 0, 16, 31, 22]] | 1 | 105 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | [["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 48], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 22]] | 1 | 128 | 2 |
A = int(input())
B = int(input())
C = int(input())
D = int(input())
P = int(input())
print(min(P*A, B if C <= P else B+(P-C)*D)) | A = int(input())
B = int(input())
C = int(input())
D = int(input())
P = int(input())
print(min(P*A, B if C >= P else B+(P-C)*D)) | [["-", 0, 652, 3, 4, 0, 41, 0, 666, 667, 19], ["+", 0, 652, 3, 4, 0, 41, 0, 666, 667, 20]] | 5 | 65 | 2 |
import java.io.*;
import java.util.StringTokenizer;
class Main {
static final PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = "";
while ((line = br.readLi... | import java.io.*;
import java.util.StringTokenizer;
class Main {
static final PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = "";
while ((line = br.readLi... | [["+", 0, 1, 0, 11, 31, 504, 71, 16, 17, 33], ["+", 0, 1, 0, 11, 31, 504, 71, 16, 12, 499]] | 3 | 361 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO ?????????????????????????????????????????????
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[] fpoint = new int[n];
int[] tage = new int[m];
int[][] who = n... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO ?????????????????????????????????????????????
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[] fpoint = new int[n];
int[] tage = new int[m];
int[][] who = n... | [["+", 0, 27, 0, 504, 71, 16, 31, 504, 516, 22], ["+", 0, 27, 0, 504, 71, 16, 31, 504, 0, 70], ["+", 0, 27, 0, 504, 71, 16, 31, 504, 0, 73], ["+", 0, 1, 0, 27, 0, 504, 71, 16, 17, 33], ["+", 0, 1, 0, 27, 0, 504, 71, 16, 12, 499]] | 3 | 268 | 5 |
#include <stdio.h>
int main() {
int i, k, n, m, target[100], point[100], game[100][100];
scanf("%d %d", &n, &m);
for (i = 0; i < m; i++)
scanf("%d", &target[i]);
for (i = 0; i < n; i++)
point[i] = 0;
for (i = 0; i < m; i++) {
for (k = 0; k < n; k++) {
scanf("%d", &game[i][k]);
}
}
/... | #include <stdio.h>
int main() {
int i, k, n, m, target[100], point[100], game[100][100];
scanf("%d %d", &n, &m);
for (i = 0; i < m; i++)
scanf("%d", &target[i]);
for (i = 0; i < n; i++)
point[i] = 0;
for (i = 0; i < m; i++) {
for (k = 0; k < n; k++) {
scanf("%d", &game[i][k]);
}
}
/... | [["+", 0, 27, 28, 69, 71, 16, 31, 69, 28, 22], ["+", 0, 27, 28, 69, 71, 16, 31, 69, 0, 70], ["+", 0, 27, 28, 69, 71, 16, 31, 69, 0, 73], ["+", 0, 1, 0, 27, 28, 69, 71, 16, 17, 33], ["+", 0, 1, 0, 27, 28, 69, 71, 16, 12, 13]] | 0 | 232 | 5 |
#include <stdio.h>
int main(void) {
int n, m, x, t;
int f[101] = {}, tar[101] = {}, score[101] = {};
int i, j;
scanf("%d", &n);
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &t);
tar[i] = t;
}
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &f[j]);
... | #include <stdio.h>
int main(void) {
int n, m, t;
int f[101] = {}, tar[101] = {}, score[101] = {};
int i, j;
scanf("%d", &n);
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &t);
tar[i] = t;
}
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &f[j]);
if ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 27, 28, 69, 71, 16, 31, 69, 0, 73], ["-", 0, 1, 0, 27, 28, 69, 71, 69, 0, 73]] | 0 | 202 | 4 |
#include <iostream>
using namespace std;
int n, m;
int a[101], b[101][101], p[101];
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> a[i];
}
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
cin >> b[i][j];
}
}
for (int i = 1; i <= m; i++) {
for (int j = 1;... | #include <iostream>
using namespace std;
int n, m;
int a[101], b[101][101], p[101];
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> a[i];
}
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
cin >> b[i][j];
}
}
for (int i = 1; i <= m; i++) {
for (int j = 1;... | [["-", 31, 69, 341, 342, 0, 69, 341, 342, 0, 22], ["+", 31, 69, 341, 342, 0, 69, 341, 342, 0, 22]] | 1 | 204 | 2 |
#include <iostream>
using namespace std;
int p[1000], a[1000], b, c, n, m;
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++)
cin >> a[i];
for (int i = 0; i < m; i++) {
c = 0;
for (int j = 1; j <= n; j++) {
cin >> b;
if (a[i] == b)
p[j]++;
if (a[i] != b)
c++;
... | #include <iostream>
using namespace std;
int p[1000], a[1000], b, c, n, m;
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++)
cin >> a[i];
for (int i = 0; i < m; i++) {
c = 0;
for (int j = 1; j <= n; j++) {
cin >> b;
if (a[i] == b)
p[j]++;
if (a[i] != b)
c++;
... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 31, 13], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72]] | 1 | 163 | 2 |
#include <iostream>
using namespace std;
int main() {
int *a_heap;
int *temp;
int *target;
int n = 0;
int m = 0;
int j = 0;
int i = 0;
// cout << "?????°?????\????????????????????? : ";
cin >> m;
// cout << "?????°?????\????????????????????? : ";
cin >> n;
a_heap = new int[n + 1];
temp = ne... | #include <iostream>
using namespace std;
int main() {
int *a_heap;
int *temp;
int *target;
int n = 0;
int m = 0;
int j = 0;
int i = 0;
cin >> n;
// cout << "?????°?????\????????????????????? : ";
cin >> m;
// cout << "?????°?????\????????????????????? : ";
a_heap = new int[n + 1];
temp = ne... | [["-", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 273 | 4 |
#include <stdio.h>
int main(void) {
int N; // num
int M; // kaisuu
int hito[100][100];
int target[100];
int point[100] = {0};
scanf("%d", &N);
scanf("%d", &M);
for (int i = 0; i < M; i++) {
scanf("%d", &target[i]);
}
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
scanf("%d... | #include <stdio.h>
int main(void) {
int N; // num
int M; // kaisuu
int hito[100][100];
int target[100];
int point[100] = {0};
scanf("%d", &N);
scanf("%d", &M);
for (int i = 0; i < M; i++) {
scanf("%d", &target[i]);
}
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
scanf("%d... | [["+", 28, 69, 341, 342, 0, 16, 31, 69, 28, 22], ["+", 341, 342, 0, 16, 31, 69, 341, 342, 0, 70], ["+", 341, 342, 0, 16, 31, 69, 341, 342, 0, 73], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 203 | 5 |
#include <iostream>
using namespace std;
int main() {
int n, m, a[100];
int f[100][100];
int cnt[100]{0};
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
cin >> f[i][j];
}
}
for (int i = 0; i < m; i++) {
for... | #include <iostream>
using namespace std;
int main() {
int n, m, a[100];
int f[100][100];
int cnt[100]{0};
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
cin >> f[i][j];
}
}
for (int i = 0; i < m; i++) {
for... | [["+", 28, 69, 341, 342, 0, 16, 31, 69, 28, 22], ["+", 341, 342, 0, 16, 31, 69, 341, 342, 0, 70], ["+", 341, 342, 0, 16, 31, 69, 341, 342, 0, 73], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 203 | 5 |
#include <iostream>
using namespace std;
int main() {
int N, M, i, j;
int target[100], cnt[100], data[100][100];
cin >> N;
cin >> M;
for (i = 0; i < M; i++) {
cin >> target[i];
--target[i];
}
for (i = 0; i < M; i++) {
for (j = 0; j < N; j++) {
cin >> data[i][j];
--data[i][j];
... |
#include <iostream>
using namespace std;
int main() {
int N, M, i, j;
int target[100], cnt[100], data[100][100];
cin >> N;
cin >> M;
for (i = 0; i < M; i++) {
cin >> target[i];
--target[i];
}
for (i = 0; i < M; i++) {
for (j = 0; j < N; j++) {
cin >> data[i][j];
--data[i][j];
... | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 219 | 2 |
#include <iostream>
int main(int argc, char **argv) {
int n, m;
int score[100] = {};
int target[100];
std::cin >> n >> m;
for (int i = 0; i < m; i++) {
std::cin >> target[i];
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
int input;
std::cin >> input;
/*if(j == ta... | #include <iostream>
int main(int argc, char **argv) {
int n, m;
int score[100] = {};
int target[100];
std::cin >> n >> m;
for (int i = 0; i < m; i++) {
std::cin >> target[i];
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
int input;
std::cin >> input;
if (input ==... | [["+", 0, 27, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 171 | 2 |
#include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int h, w, c;
char t;
scanf("%d %d", &h, &w);
for (int j = 0; j < h; ++j) {
getchar();
c = -2;
for (int i = 0; i < w; ++i) {
scanf("%c", &t);
if (t == 'c')
c = -1;
if (c == -2)... | #include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int h, w, c;
char t;
scanf("%d %d", &h, &w);
for (int j = 0; j < h; ++j) {
getchar();
c = -2;
for (int i = 0; i < w; ++i) {
scanf("%c", &t);
if (t == 'c')
c = -1;
if (c == -2)... | [["-", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 182 | 7 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int H, W;
cin >> H >> W;
cin.ignore();
char grid[H][W];
int ans[H][W];
for (int y = 0; y < H; ++y) {
s... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int H, W;
cin >> H >> W;
cin.ignore();
char grid[H][W];
int ans[H][W];
for (int y = 0; y < H; ++y) {
s... | [["-", 51, 16, 12, 16, 31, 69, 28, 69, 28, 22], ["+", 51, 16, 12, 16, 31, 69, 28, 69, 28, 22]] | 1 | 371 | 2 |
import java.util.*;
class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int n = scan.nextInt();
int m = scan.nextInt();
int[] dist = new int[n];
int[] weather = new int[m];
int[][] dp = new int[n + 1][m + 1];
for (int i = 0; i < n; i++) {
... | import java.util.*;
class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int n = scan.nextInt();
int m = scan.nextInt();
int[] dist = new int[n];
int[] weather = new int[m];
int[][] dp = new int[n + 1][m + 1];
for (int i = 0; i < n; i++) {
... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 414 | 2 |
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef queue<P> Q;
#define _CRT_SECURE_NO... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef queue<P> Q;
#define _CRT_SECURE_NO... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 12, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["-", 12, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 336 | 4 |
#include <iostream>
#include <vector>
using namespace std;
int n, m, an = 1e9;
int d[1002];
int c[1002];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> d[i];
for (int i = 0; i < m; i++)
cin >> c[i];
vector<vector<int>> vec(m + 2, vector<int>(n + 1e9));
vec[0][0] = 0;
for (int i = 0;... | #include <iostream>
#include <vector>
using namespace std;
int n, m, an = 1e9;
int d[1002];
int c[1002];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> d[i];
for (int i = 0; i < m; i++)
cin >> c[i];
vector<vector<int>> vec(m + 2, vector<int>(n + 2, 1e9));
vec[0][0] = 0;
for (int i =... | [["+", 51, 4, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 49, 50, 51, 4, 0, 2, 3, 4, 0, 21]] | 1 | 260 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, m, a = 1e9;
int d[1000];
int c[1000];
int dp[1002][1002];
cin >> n >> m;
for (int i = 0; i <= m; i++)
for (int j = 0; j <= n; j++)
dp[i][j] = 1e9;
for (int i = 0; i <= m; i++)
dp[i][0] = 0;
for (int i = 0; i < n; i++)
cin >>... | #include <iostream>
using namespace std;
int main() {
int n, m, a = 1e9;
int d[1000];
int c[1000];
int dp[1002][1002];
cin >> n >> m;
for (int i = 0; i <= m; i++)
for (int j = 0; j <= n; j++)
dp[i][j] = 1e9;
for (int i = 0; i <= m; i++)
dp[i][0] = 0;
for (int i = 0; i < n; i++)
cin >>... | [["-", 0, 16, 12, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 16, 12, 16, 12, 69, 341, 342, 0, 22]] | 1 | 295 | 2 |
#include <iostream>
using namespace std;
#define re(i, n) for (int i = 0; i < n; i++)
#define m(a, b) a = min(a, b)
int main() {
int n, m, a = 1e9, c[1000], d[1000], dp[1002][1002];
cin >> n >> m;
re(i, m + 1) re(j, n + 1) dp[i][j] = 1e9;
dp[0][0] = 0;
re(i, n) cin >> d[i];
re(i, m) cin >> c[i];
re(i, m... | #include <iostream>
using namespace std;
#define re(i, n) for (int i = 0; i < n; i++)
#define m(a, b) a = min(a, b)
int main() {
int n, m, a = 1e9, c[1000], d[1000], dp[1002][1002];
cin >> n >> m;
re(i, m + 1) re(j, n + 1) dp[i][j] = 1e9;
dp[0][0] = 0;
re(i, n) cin >> d[i];
re(i, m) cin >> c[i];
re(i, m... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 222 | 2 |
#include <algorithm>
#include <stdio.h>
using namespace std;
#define max 10000000
int main() {
int m, n;
int dp[10000][10000], dis[10000], weather[10000];
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &dis[i]);
}
for (int j = 1; j <= m; j++) {
scanf("%d", &weather[j]);
}
for... | #include <algorithm>
#include <stdio.h>
using namespace std;
#define max 1000000000
int main() {
int m, n;
int dp[1100][1100], dis[1100], weather[1100];
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &dis[i]);
}
for (int j = 1; j <= m; j++) {
scanf("%d", &weather[j]);
}
for (... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 302 | 10 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define MAX_N 3000
#define MAX_M 3000
int main() {
int dp[MAX_N + 1][MAX_M + 1];
int n, m, s, x[MAX_N], y[MAX_M];
memset(dp, 127, sizeof(dp));
memset(x, 127, sizeof(x));
memset(y, 127, sizeof(y));
cin >> m >> n;
for (int i ... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define MAX_N 1100
#define MAX_M 1100
int main() {
int dp[MAX_N + 1][MAX_M + 1];
int n, m, s, x[MAX_N], y[MAX_M];
memset(dp, 127, sizeof(dp));
memset(x, 127, sizeof(x));
memset(y, 127, sizeof(y));
cin >> m >> n;
for (int i ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 277 | 4 |
#include <cstdio>
#define k 1024
#define r(a) for (int i = 0; i < a; i++)
#define s(a) scanf("%d", &a);
#define m(a, b) a < b ? a : b
int w, n, m, c[k], d[k], p[k];
main() {
s(n) s(m) r(n) s(d[i]) r(m) s(c[i]) r(n + 1) p[i] = 1e9;
r(m * n) w = n - i % n, p[w] = m(p[w], p[w - 1] + c[i / n] * d[w - 1]);
printf("%d\... | #include <cstdio>
#define k 1024
#define r(a) for (int i = 0; i < a; i++)
#define s(a) scanf("%d", &a);
#define m(a, b) a < b ? a : b
int w, n, m, c[k], d[k], p[k];
main() {
s(n) s(m) r(n) s(d[i]) r(m) s(c[i]) r(n) p[i + 1] = 1e9;
r(m * n) w = n - i % n, p[w] = m(p[w], p[w - 1] + c[i / n] * d[w - 1]);
printf("%d\... | [["-", 0, 42, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 42, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 156 | 4 |
#include <cstdio>
#define k 1024
#define r(a) for (int i = 0; ++i < a;)
#define s(a) scanf("%d", a);
#define m(a, b) a < b ? a : b
int w, n, m, c[k], d[k], p[k];
main() {
s(&n) s(&m) r(n) s(d + i) r(m) s(c + i) r(n) p[i + 1] = 1e9;
r(m * n) w = n - i % n, p[w] = m(p[w], p[w - 1] + c[i / n] * d[w - 1]);
printf("%d... | #import <cstdio>
#define k 1024
#define r(a) for (int i = 0; i < a; i++)
#define s(a) scanf("%d", a);
#define m(a, b) a < b ? a : b
int w, n, m, c[k], d[k], p[k];
main() {
s(&n) s(&m) r(n) s(d + i) r(m) s(c + i) r(n) p[i + 1] = 1e9;
r(m * n) w = n - i % n, p[w] = m(p[w], p[w - 1] + c[i / n] * d[w - 1]);
printf("%... | [["-", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 36, 36, 36, 36, 0, 30, 0, 181, 182, 183], ["-", 36, 36, 36, 36, 0, 30, 0, 112, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 112, 51, 59]] | 1 | 156 | 4 |
#import <cstdio>
#define r(a) for (int i = 0; i < a; i++)
#define s scanf("%d", &w), w;
#define c(a, b) a = a < b ? a : b
int w, n, m, d[999], p[999];
main() {
n = s m = s r(n) d[i] = s r(n) p[i] = 1e9;
r(m) { s r(n) c(p[i], p[i + 1] + w * d[n - i - 1]); }
printf("%d\n", *p);
} | #import <cstdio>
#define r(a) for (int i = 0; i < a; i++)
#define s (scanf("%d", &w), w);
#define c(a, b) a = a < b ? a : b
int w, n, m, d[999], p[999];
main() {
n = s m = s r(n) d[i] = s r(n) p[i] = 1e9;
r(m) { s r(n) c(p[i], p[i + 1] + w * d[n - i - 1]); }
printf("%d\n", *p);
} | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 116 | 19 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.