buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#import <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], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 14, 8, 9, 0, 35], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 116 | 19 |
#import <cstdio>
#define r(a) for (int i = 0; i < a; i++)
#define s(a) scanf("%d", &a);
#define c(a, b) a = a < b ? a : b
int w, n, m, d[999], *p;
main() {
s(n) s(m) r(n) s(d[i]) r(n) p[i] = 1e9;
r(m) { s(w) 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(n) scanf("%d", &n);
#define c(a, b) a = a < b ? a : b
int w, n, m, d[999], p[999];
main() {
s(n) s(m) r(n) s(d[i]) r(n) p[i] = 1e9;
r(m) { s(w) r(n) c(p[i], p[i + 1] + w * d[n - i - 1]); }
printf("%d\n", *p);
} | [["-", 36, 36, 0, 30, 0, 112, 54, 158, 0, 22], ["+", 36, 36, 0, 30, 0, 112, 54, 158, 0, 22], ["-", 36, 36, 36, 36, 0, 30, 0, 112, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 112, 51, 59], ["-", 36, 36, 0, 30, 0, 43, 49, 84, 0, 48], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 0, 70], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["... | 1 | 123 | 8 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
long long int fie[1001][1001];
int main() {
int N, M;
cin >> N >> M;
int city[1001], weather[1001];
for (int i = 0; i < N; i++)
cin >> city[i];
for (int i = 0; i < M; i++)
cin >> weather[i];
for (int i =... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
long long int fie[1001][1001];
int main() {
int N, M;
cin >> N >> M;
int city[1001], weather[1001];
for (int i = 0; i < N; i++)
cin >> city[i];
for (int i = 0; i < M; i++)
cin >> weather[i];
for (int i =... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 291 | 4 |
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
const int MAX_N = 1000;
const int MAX_M = 1000;
const int INF = 1000000000000;
int dp[MAX_M][MAX_N];
int dis[MAX_N];
int wea[MAX_M];
int n, m;
int rec(int i, int j) {
if (j == n) {
return 0;
}
if (i == m) {
return INF;
}
... | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
const int MAX_N = 1000;
const int MAX_M = 1000;
const int INF = 1000000000;
int dp[MAX_M][MAX_N];
int dis[MAX_N];
int wea[MAX_M];
int n, m;
int rec(int i, int j) {
if (j == n) {
return 0;
}
if (i == m) {
return INF;
}
if ... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 259 | 2 |
#include <stdio.h>
long long int dp[1001][1001];
int main(void) {
long long int min, a[1001], b[1001], n, m, i, j;
min = 9223372036854775806;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (j = 0; j < m; j++)
scanf("%d", &b[j]);
for (i = 0; i <= m; i++) {
for (j = 0; j <=... | #include <stdio.h>
long long int dp[1001][1001];
int main(void) {
long long int min, a[1001], b[1001], n, m, i, j;
min = 9223372036854775806;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++)
scanf("%lld", &a[i]);
for (j = 0; j < m; j++)
scanf("%lld", &b[j]);
for (i = 0; i <= m; i++) {
for (j = 0; ... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 357 | 6 |
#include <iostream>
using namespace std;
int main() {
int a[1000], b[1000], n, m, i, j;
cin >> n >> m;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < m; i++)
cin >> b[i];
int small[1000][1000] = {a[0] * b[0]};
for (i = 1; i < n; i++)
small[i][i] = small[i - 1][j - 1] + a[i] * b[j];
for (... | #include <iostream>
using namespace std;
int main() {
int a[1000], b[1000], n, m, i, j;
cin >> n >> m;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < m; i++)
cin >> b[i];
int small[1000][1000] = {a[0] * b[0]};
for (i = 1; i < n; i++)
small[i][i] = small[i - 1][i - 1] + a[i] * b[i];
for (... | [["-", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["-", 12, 16, 12, 16, 12, 69, 341, 342, 0, 22], ["+", 12, 16, 12, 16, 12, 69, 341, 342, 0, 22]] | 1 | 275 | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3L + 11;
int a[N], b[N], f[N][N];
void upd(int &x, int y) {
if (x > y)
x = y;
}
int main() {
ios ::sync_with_stdio(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= m; i++)
cin >> b[i];
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e3L + 11;
int a[N], b[N], f[N][N];
void upd(int &x, int y) {
if (x > y)
x = y;
}
int main() {
ios ::sync_with_stdio(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= m; i++)
cin >> b[i];
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 7, 8, 9, 0, 57, 0, 121], ["+", 8, 7, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 8, 7, 8, 9, 0, 57, 15, 339, 51, 22], ["+", 8, 7, 8, 9, 0, 57, 15, 339, 0, 25]] | 1 | 249 | 6 |
#include <bits/stdc++.h>
#define INF (int)1e8
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> d(n, 0);
vector<int> c(m, 0);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
for (int i = 0; i < m; i++) {
cin >> c[i];
}
vector<int> prev(m, 0);
vector<int> now(m, INF);
... | #include <bits/stdc++.h>
#define INF (int)1e8
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> d(n, 0);
vector<int> c(m, 0);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
for (int i = 0; i < m; i++) {
cin >> c[i];
}
vector<int> prev(m, 0);
vector<int> now(m, INF);
... | [["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25]] | 1 | 256 | 2 |
n, m = gets.split.map(&:to_i)
d = []
h = []
n.times{ d << gets.to_i }
m.times{ h << gets.to_i }
dp = Array.new(2){ Array.new(m, 1<<31) }
table = Array.new(n){ Array.new(m) }
n.times do |i|
m.times do |j|
table[i][j] = d[i] * h[j]
end
end
m.times{ |i| dp[0][i] = table[0][i] }
(0...n-1).each do |j|
(j+1..m-n+j+... | n, m = gets.split.map(&:to_i)
d = []
h = []
n.times{ d << gets.to_i }
m.times{ h << gets.to_i }
dp = Array.new(2){ Array.new(m, 1<<31) }
table = Array.new(n){ Array.new(m) }
n.times do |i|
m.times do |j|
table[i][j] = d[i] * h[j]
end
end
m.times{ |i| dp[0][i] = table[0][i] }
(0...n-1).each do |j|
(j..m-n+j+1)... | [["-", 0, 652, 486, 739, 0, 475, 756, 738, 17, 72], ["-", 0, 652, 486, 739, 0, 475, 756, 738, 12, 612]] | 4 | 266 | 2 |
N = int(input())
C = input()
S = list(C)
dp = [[0 for i in range(8)] for j in range(N + 1)]
dp[0][1] = 1
for i in range(N):
if C[i] == "J":
dp[i + 1][1] = dp[i][1] + dp[i][2] + dp[i][3] + dp[i][4];
dp[i + 1][2] = dp[i][1] + dp[i][2] + dp[i][3] + dp[i][4] + dp[i][5] + dp[i][6];
dp[i... | N = int(input())
C = input()
S = list(C)
dp = [[0 for i in range(8)] for j in range(N + 1)]
dp[0][1] = 1
for i in range(N):
if C[i] == "J":
dp[i + 1][1] = dp[i][1] + dp[i][2] + dp[i][3] + dp[i][4];
dp[i + 1][2] = dp[i][1] + dp[i][2] + dp[i][3] + dp[i][4] + dp[i][5] + dp[i][6];
dp[i + 1]... | [["-", 8, 196, 0, 57, 15, 666, 0, 557, 0, 654], ["+", 8, 196, 0, 57, 15, 666, 0, 557, 0, 654], ["-", 8, 196, 0, 57, 15, 666, 0, 557, 0, 655], ["+", 8, 196, 0, 57, 15, 666, 0, 557, 0, 655], ["-", 12, 657, 12, 206, 51, 206, 206, 657, 17, 33], ["-", 12, 657, 12, 206, 51, 206, 206, 657, 12, 612]] | 5 | 933 | 6 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define F first
#define S second
const int INF = 1 << 31, MAX_N = 5000;
typedef pair<int, int> P;
void dijkstra();
void bfs(int s, int dis, int cost);
int n, k;
vector<int... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define F first
#define S second
const int INF = 1 << 31, MAX_N = 5000;
typedef pair<int, int> P;
void dijkstra();
void bfs(int s, int dis, int cost);
int n, k;
vector<int... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 550 | 4 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
typedef pair<int, int> P;
static const int INF = 2e9;
struct Edge {
int to;
int cost;
};
vector<Edge> G1[5001];
vector<Edge> G2[5001];
int d[5001];
bool isUs... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
typedef pair<int, int> P;
static const int INF = 2e9;
struct Edge {
int to;
int cost;
};
vector<Edge> G1[5001];
vector<Edge> G2[5001];
int d[5001];
bool isUs... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 622 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3fffffff
int N;
int M;
int C[114514];
int R[114514];
int D[5145][5145];
int mind[5145];
bool used[5145];
vector<int> es[114514];
void Bfs(int s) {
queue<int> q;
fill(mind, mind + N, INF);
q.push(s);
mind[s] = 0;
while (!q.empty()) {
int v = q... | #include <bits/stdc++.h>
using namespace std;
#define INF 0x3fffffff
int N;
int M;
int C[114514];
int R[114514];
int D[5145][5145];
int mind[5145];
bool used[5145];
vector<int> es[114514];
void Bfs(int s) {
queue<int> q;
fill(mind, mind + N, INF);
q.push(s);
mind[s] = 0;
while (!q.empty()) {
int v = q... | [["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22]] | 1 | 576 | 4 |
from collections import deque
import heapq
def dijkstra(s,g,m):
color=[0]*n
dis=[float('inf')]*n
dis[s]=0
heapq.heappush(pq,[0,s])
while len(pq)!=0:
t,u=heapq.heappop(pq)
color[u]=2
if dis[u]<t:
continue
for v in g[u]:
if color[v]!=2:
... | from collections import deque
import heapq
def dijkstra(s,g,m):
color=[0]*n
dis=[float('inf')]*n
dis[s]=0
heapq.heappush(pq,[0,s])
while len(pq)!=0:
t,u=heapq.heappop(pq)
color[u]=2
if dis[u]<t:
continue
for v in g[u]:
if color[v]!=2:
... | [["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 501 | 4 |
from heapq import heappop as pop
from heapq import heappush as push
INF = 10 ** 20
n, k = map(int, input().split())
clst = []
rlst = []
for i in range(n):
c, r = map(int, input().split())
clst.append(c)
rlst.append(r)
edges = [[0] * n for i in range(n)]
for i in range(k):
a, b = map(int, input().split())
... | from heapq import heappop as pop
from heapq import heappush as push
INF = 10 ** 20
n, k = map(int, input().split())
clst = []
rlst = []
for i in range(n):
c, r = map(int, input().split())
clst.append(c)
rlst.append(r)
edges = [[0] * n for i in range(n)]
for i in range(k):
a, b = map(int, input().split())
... | [["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 382 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int n, m;
char c[1080][1080];
int cnt[1080][1080];
char ans[2][2];
int anss, res;
int main() {
cin >> m >> n;
for (int i = 1; i <= m; i++)
for (int j = 1; j <= n; j++)
cin >> c[i][j];
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j... | #include <algorithm>
#include <iostream>
using namespace std;
int n, m;
char c[1080][1080];
int cnt[1080][1080];
char ans[2][2];
int anss, res;
int main() {
cin >> m >> n;
for (int i = 1; i <= m; i++)
for (int j = 1; j <= n; j++)
cin >> c[i][j];
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j... | [["-", 8, 9, 0, 7, 8, 7, 15, 16, 17, 47], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 17, 18]] | 1 | 703 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
#define PPB pop_back
typedef pair<int, int> pii;
static const int INF = 1LL << 61;
int grid[1005][1005], m, n, mo[2][2], dx[] = {0, 1, 1, 0}, dy[] = {0, 0, 1, 1};
inline int get(char t) {
switch (t) {
case 'J':
return 1... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
#define PPB pop_back
typedef pair<int, int> pii;
static const int INF = 1LL << 61;
int grid[1005][1005], m, n, mo[2][2], dx[] = {0, 1, 1, 0}, dy[] = {0, 0, 1, 1};
inline int get(char t) {
switch (t) {
case 'J':
return 1... | [["-", 12, 69, 28, 69, 341, 342, 0, 16, 31, 13], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 12, 16, 12, 69, 341, 342, 0, 16, 31, 13], ["-", 12, 16, 12, 69, 341, 342, 0, 16, 17, 72]] | 1 | 570 | 4 |
#include <bits/stdc++.h>
using namespace std;
char mp[1000][1000];
char e[2][2];
int dx[4] = {-1, 0, -1, 0}, dy[4] = {-1, -1, 0, 0};
char a[3] = {'J', 'O', 'I'};
int main() {
int h, w;
scanf("%d %d", &h, &w);
for (int i = 0; i < h; ++i)
scanf("%s", mp[i]);
for (int i = 0; i < 2; ++i)
scanf("%s", m... | #include <bits/stdc++.h>
using namespace std;
char mp[1000][1000];
char e[2][2];
int dx[4] = {-1, 0, -1, 0}, dy[4] = {-1, -1, 0, 0};
char a[3] = {'J', 'O', 'I'};
int main() {
int h, w;
scanf("%d %d", &h, &w);
for (int i = 0; i < h; ++i)
scanf("%s", mp[i]);
for (int i = 0; i < 2; ++i)
scanf("%s", e... | [["-", 8, 1, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 8, 1, 0, 2, 3, 4, 0, 69, 28, 22]] | 1 | 681 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int H, W;
int ans = 0, maxans = 0;
string fie[1002], ansfie[2];
cin >> H >> W;
for (int i = 0; i < H; i++)
cin >> fie[i];
for (int i = 0; i < 2; i++)
cin >> ansfie[i];
for (int i = 0; i < ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int H, W;
int ans = 0, maxans = 0;
string fie[1002], ansfie[2];
cin >> H >> W;
for (int i = 0; i < H; i++)
cin >> fie[i];
for (int i = 0; i < 2; i++)
cin >> ansfie[i];
for (int i = 0; i < ... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 976 | 6 |
#include <iostream>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional> //sort(A,A.end(),greater<int>());???????????????
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INF 10 << 10
int n, m;
char flag[1002][1002];
char co... | #include <iostream>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INF 10 << 10
int n, m;
char flag[1002][1002];
char coa[3][3]; //?´???? Coat of arms
int over[100... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 725 | 8 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3L + 11;
char c[N][N];
char a[2][2];
bool f(int i, int j) {
for (int s : {0, 1})
for (int t : {0, 1})
if (c[i + s][j + t] != a[s][t])
return 0;
return 1;
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e3L + 11;
char c[N][N];
char a[2][2];
bool f(int i, int j) {
for (int s : {0, 1})
for (int t : {0, 1})
if (c[i + s][j + t] != a[s][t])
return 0;
return 1;
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ... | [["-", 0, 43, 49, 50, 51, 69, 28, 69, 28, 22], ["+", 0, 43, 49, 50, 51, 69, 28, 69, 28, 22]] | 1 | 392 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
string s[1001], t[3];
int h, w, sum, ans = 0;
int dx[] = {0, 0, -1, -1};
int dy[] = {0, -1, 0, -1};
int gx[] = {0, 0, 1, 1};
int gy[] = {0, 1, 0, 1};
char c[] = {'J', 'O', 'I'};
bool used[1001][1001];
void get_sum() {
r(i, h - 1... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
string s[1001], t[3];
int h, w, sum, ans = 0;
int dx[] = {0, 0, -1, -1};
int dy[] = {0, -1, 0, -1};
int gx[] = {0, 0, 1, 1};
int gy[] = {0, 1, 0, 1};
char c[] = {'J', 'O', 'I'};
bool used[1001][1001];
void get_sum() {
r(i, h - 1... | [["-", 0, 9, 0, 57, 64, 1, 0, 27, 28, 22], ["+", 0, 9, 0, 57, 64, 1, 0, 27, 28, 22]] | 1 | 629 | 2 |
m, n = gets.split.map &:to_i
f = (1..m).map { gets.chomp }
e = gets.chomp.split("") + gets.chomp.split("")
hash = {}
count = 0
(0..m-2).each{|i|
(0..n-2).each{|j|
a = [
f[i][j] == e[0],
f[i][j+1] == e[1],
f[i+1][j] == e[2],
f[i+1][j+1] == e[3],
]
case a.count{|b| b}
when 4
count += 1
[[i,j]... | m, n = gets.split.map &:to_i
f = (1..m).map { gets.chomp }
e = gets.chomp.split("") + gets.chomp.split("")
hash = {}
count = 0
(0..m-2).each{|i|
(0..n-2).each{|j|
a = [
f[i][j] == e[0],
f[i][j+1] == e[1],
f[i+1][j] == e[2],
f[i+1][j+1] == e[3],
]
case a.count{|b| b}
when 4
count += 1
[[i,j]... | [["+", 12, 652, 196, 196, 8, 734, 0, 748, 17, 111], ["+", 0, 738, 12, 652, 486, 516, 0, 738, 17, 106], ["+", 0, 738, 12, 652, 486, 516, 0, 738, 12, 612]] | 4 | 327 | 3 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define WHITE 0LL
#define GRAY 1LL
#define BLACK 2LL
#define MAX_N 500000LL
#define INF 1145141145141919810LL
long long color[MAX_N], X, n, m, h[MAX_N], s, t, u;
vector<pair<long long, long long>> x[... | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define WHITE 0LL
#define GRAY 1LL
#define BLACK 2LL
#define MAX_N 500000LL
#define INF 1145141145141919810LL
long long color[MAX_N], X, n, m, h[MAX_N], s, t, u;
vector<pair<long long, long long>> x[... | [["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13]] | 1 | 669 | 2 |
#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"
struc... | #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"
struc... | [["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33]] | 1 | 659 | 2 |
#pragma comment(linker, "/STACK:36777216")
//#pragma GCC optimize ("O2")
#define LOCAL
//#include "testlib.h"
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
//#include <tr1/unordered_set>
//#include <tr1/unordered_map>
//#include <array>
using namespace std;
#define REP(i... | #pragma comment(linker, "/STACK:36777216")
//#pragma GCC optimize ("O2")
#define LOCAL
//#include "testlib.h"
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
//#include <tr1/unordered_set>
//#include <tr1/unordered_map>
//#include <array>
using namespace std;
#define REP(i... | [["-", 0, 43, 49, 50, 51, 66, 28, 27, 17, 29], ["-", 28, 27, 28, 2, 3, 4, 0, 16, 17, 33], ["-", 28, 27, 28, 2, 3, 4, 0, 16, 12, 13]] | 1 | 6,216 | 3 |
import math
class seg_tree:
def __init__(self, n):
self.depth = math.ceil(math.log(n, 2))
self.size = 1 << self.depth
self.bit = [0] * 2 * self.size
self.renew = [0] * 2 * self.size
def add(self, p, v):
p += self.size;
while p:
self.bit[p] += v
... | import math
class seg_tree:
def __init__(self, n):
self.depth = math.ceil(math.log(n, 2))
self.size = 1 << self.depth
self.bit = [0] * 2 * self.size
self.renew = [0] * 2 * self.size
def add(self, p, v):
p += self.size;
while p:
self.bit[p] += v
... | [["-", 36, 36, 0, 656, 0, 692, 0, 693, 0, 549], ["-", 36, 36, 0, 656, 0, 692, 0, 693, 0, 22]] | 5 | 1,156 | 2 |
/*#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
using namespace std;
int main(){
int i,j,m,n,ans=0,l;
static int r[2001][2001][2]={0};
char s[4001],t[4001];
scanf("%d%d",&m,&n);
scanf("%s",s);
scanf("%s",t);
for(i=0;i<=m;i++){
for(j=0;j<=n;j++){
for(l=0;l<2;l++){
if(l==0){
if(s[i]=='I')
r[... | /*#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
using namespace std;
int main(){
int i,j,m,n,ans=0,l;
static int r[2001][2001][2]={0};
char s[4001],t[4001];
scanf("%d%d",&m,&n);
scanf("%s",s);
scanf("%s",t);
for(i=0;i<=m;i++){
for(j=0;j<=n;j++){
for(l=0;l<2;l++){
if(l==0){
if(s[i]=='I')
r[... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19]] | 1 | 198 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 100005
int n, ans = 1;
int t[MAX];
int L[MAX], R[MAX];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &t[i]);
L[0] = 1;
for (int i = 1; i < n; i++) {
L[i] = (t[i] == t[i - 1] ? 1 : L[i - 1] + 1);
ans = max(ans, L[i]);
... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100005
int n, ans = 1;
int t[MAX];
int L[MAX], R[MAX];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &t[i]);
L[0] = 1;
for (int i = 1; i < n; i++) {
L[i] = (t[i] == t[i - 1] ? 1 : L[i - 1] + 1);
ans = max(ans, L[i]);... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 0, 7, 8, 9, 0, 57, 64, 116, 0, 117], ["-", 0, 7, 8, 9, 0, 57, 64, 116, 0, 35], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, ... | 1 | 310 | 8 |
#include <algorithm>
#include <iostream>
using namespace std;
int n, a[100000], color, chain[100000], cnt, maxn, recently;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
color = a[0];
cnt = 0;
chain[0] = 1;
for (int i = 1; i < n; i++) {
if (color == a[i]) {
cnt++;
... | #include <algorithm>
#include <iostream>
using namespace std;
int n, a[100000], color, chain[100000], cnt, maxn, recently;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
color = a[0];
cnt = 0;
chain[0] = 1;
for (int i = 1; i < n; i++) {
if (color == a[i]) {
cnt++;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 207 | 4 |
#include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FORR(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define pb(a) push_back(a)
#define mp(x, y) make_pair(x, y)
#define ALL(a) a.begin(), a.end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, -1, sizeof(a))
#d... | #include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FORR(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define pb(a) push_back(a)
#define mp(x, y) make_pair(x, y)
#define ALL(a) a.begin(), a.end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, -1, sizeof(a))
#d... | [["+", 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 | 271 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX_N = 100000;
int N, a[MAX_N];
signed main() {
cin >> N;
int ans = 0;
int cnt[MAX_N] = {};
for (int i = 0; i < N; i++) {
cin >> a[i];
}
cnt[N - 1] = 1;
for (int i = N - 2; i >= 0; i--) {
if (a[i] != a[i + 1])
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX_N = 100000;
int N, a[MAX_N];
signed main() {
cin >> N;
int ans = 0;
int cnt[MAX_N] = {};
for (int i = 0; i < N; i++) {
cin >> a[i];
}
cnt[N - 1] = 1;
for (int i = N - 2; i >= 0; i--) {
if (a[i] != a[i + 1])
... | [["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 205 | 2 |
#include <iostream>
#include <stdio.h>
#define MAX_N 100000
int N;
int a[MAX_N]; //??¶???
int p[MAX_N]; //?????????, a[i] = a[i + 1]??????i???????´?
int p_tail; // p????????????????´?
int main() {
scanf("%d", &N);
p[0] = -1;
p_tail = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
if (i > 0 && ... | #include <iostream>
#include <stdio.h>
#define MAX_N 100000
int N;
int a[MAX_N]; //??¶???
int p[MAX_N]; //?????????, a[i] = a[i + 1]??????i???????´?
int p_tail; // p????????????????´?
int main() {
scanf("%d", &N);
p[0] = -1;
p_tail = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
if (i > 0 && ... | [["-", 15, 339, 51, 16, 12, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 16, 31, 69, 28, 22], ["-", 15, 339, 51, 16, 12, 16, 12, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 16, 12, 69, 28, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 69, 28, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 69, 28, 22], ["-", 0, 1, 0, 11, 12, 16, 12, 69, 28, ... | 1 | 222 | 8 |
//============================================================================
// Name : AOJ.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | //============================================================================
// Name : AOJ.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | [["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22]] | 1 | 191 | 17 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
u... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
u... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 222 | 2 |
#include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 100005;
int a[MAX_N];
int n;
vector<int> v;
int main() {
scanf("%d", &n);
rep(i, n) { scanf("%d", &a[i]); }
... | #include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 100005;
int a[MAX_N];
int n;
vector<int> v;
int main() {
scanf("%d", &n);
rep(i, n) { scanf("%d", &a[i]); }
... | [["-", 0, 9, 0, 52, 15, 339, 51, 16, 12, 22], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 28, 22], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 17, 131], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 119, 120], ["+", 15, 339, 51, 16, 12, 2, 3, 4, 0, 24], ["+", 15, 339, 51, 16, 12, 2, 3, 4, 0, 25]] | 1 | 259 | 6 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<double, int> pdbi;
typedef pair<int, pii> pipii;
typedef vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<double, int> pdbi;
typedef pair<int, pii> pipii;
typedef vec... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 519 | 2 |
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
char s[2001], t[2001];
int dp[2001][2001][2];
int m, n;
int main() {
scanf("%d %d", &m, &n);
scanf("%s", s);
scanf("%s", t);
int ans = 0;
memset(dp, 0, sizeof(dp));
for (int i = m; i >= 0; --i) {
for (int j = n; j >= 0... |
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
char s[2001], t[2001];
int dp[2001][2001][2];
int m, n;
int main() {
scanf("%d %d", &m, &n);
scanf("%s", s);
scanf("%s", t);
int ans = 0;
memset(dp, 0, sizeof(dp));
for (int i = m; i >= 0; --i) {
for (int j = n; j >= 0... | [["-", 51, 16, 12, 16, 31, 69, 341, 342, 0, 22], ["+", 51, 16, 12, 16, 31, 69, 341, 342, 0, 22]] | 1 | 389 | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
string s, t;
int dp[2020][2020][2];
int main() {
cin >> m >> n;
cin >> s >> t;
int ans = -1;
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= n; j++) {
if (i) {
if (s[i - 1] == 'I') {
dp[i][j][1] = dp[i - 1][j][0] + 1;
... | #include <bits/stdc++.h>
using namespace std;
int n, m;
string s, t;
int dp[2020][2020][2];
int main() {
cin >> m >> n;
cin >> s >> t;
int ans = 0;
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= n; j++) {
if (i) {
if (s[i - 1] == 'I') {
dp[i][j][1] = dp[i - 1][j][0] + 1;
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 335 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
//#define int long long
#define inf 1145141919ll
#define oku 1000000007ll
using namespace std;
int a, b, c, d;
int dx[] = {0... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
//#define int long long
#define inf 1145141919ll
#define oku 1000000007ll
using namespace std;
int a, b, c, d;
int dx[] = {0... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 510 | 2 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int dp[2000][2000][2]; // a???n??????b???m????????§?????????(1,0)=(I,O)
int a, b;
string c, d;
int main() {
cin >> a >> b >> c >> d;
c += " ";
d += " ";
for (... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int dp[2005][2005][2]; // a???n??????b???m????????§?????????(1,0)=(I,O)
int a, b;
string c, d;
int main() {
cin >> a >> b >> c >> d;
c += " ";
d += " ";
for (... | [["-", 0, 43, 49, 80, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 80, 49, 80, 49, 80, 81, 13], ["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 25]] | 1 | 381 | 6 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
int tl[2001][2001][2];
bool s[2001], t[2001];
int main() {
int n, m;
int i, j;
int ma;
char a;
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> a;
if (a == 'I')
s[i] = true;
else
s[i] = false;
}
for (... | #include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
int tl[2001][2001][2];
bool s[2001], t[2001];
int main() {
int n, m;
int i, j;
int ma;
char a;
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> a;
if (a == 'I')
s[i] = true;
else
s[i] = false;
}
for (... | [["-", 15, 339, 51, 16, 31, 16, 31, 16, 31, 22], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 31, 22]] | 1 | 457 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define MAX 10001
#define B 100
#define dmp make_pair
#define dpb push_back
#define fi first
#define se second
#define P pair<int, int>
typedef long long... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define MAX 10001
#define B 100
#define dmp make_pair
#define dpb push_back
#define fi first
#define se second
#define P pair<int, int>
typedef long long... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 458 | 4 |
#include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int n, m, k;
typedef pair<long long int, int> P;
vector<P> x[100010], y[100010];
vector<P> g[400010];
long long int INF = 1e18;
bool f;
long long int d[400010];
priority_queue<P, vector<P>, greater<P>> q;
int main() {
sca... | #include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int n, m, k;
typedef pair<long long int, int> P;
vector<P> x[100010], y[100010];
vector<P> g[400010];
long long int INF = 1e18;
bool f;
long long int d[400010];
priority_queue<P, vector<P>, greater<P>> q;
int main() {
sca... | [["+", 0, 30, 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], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 1,039 | 6 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using nam... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using nam... | [["+", 31, 16, 31, 16, 31, 69, 341, 342, 0, 13], ["+", 31, 16, 31, 16, 31, 69, 341, 342, 0, 73], ["+", 31, 16, 12, 16, 31, 16, 31, 16, 17, 72], ["+", 12, 16, 31, 16, 31, 16, 12, 69, 28, 22], ["+", 31, 16, 31, 16, 12, 69, 341, 342, 0, 70]] | 1 | 358 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[6];
for (int i = 0; i < 6; i++) {
cin >> a[i];
}
sort(a, a + 4);
sort(a + 5, a + 6);
cout << a[1] + a[2] + a[3] + a[5] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[6];
for (int i = 0; i < 6; i++) {
cin >> a[i];
}
sort(a, a + 4);
sort(a + 4, a + 6);
cout << a[1] + a[2] + a[3] + a[5] << endl;
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 90 | 2 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a) for (int i = 0; i < a; i++)
int main() {
int a[4];
int b[2];
FOR(i, 4) { cin >> a[i]; }
FOR(i, 2) { c... | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a) for (int i = 0; i < a; i++)
int main() {
int a[4];
int b[2];
FOR(i, 4) { cin >> a[i]; }
FOR(i, 2) { c... | [["+", 31, 16, 12, 16, 31, 16, 12, 69, 28, 22], ["+", 12, 16, 31, 16, 12, 69, 341, 342, 0, 70], ["+", 12, 16, 31, 16, 12, 69, 341, 342, 0, 13], ["+", 12, 16, 31, 16, 12, 69, 341, 342, 0, 73], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72]] | 1 | 131 | 5 |
#include <iostream>
using namespace std;
int main() {
int score[6];
for (int i = 0; i < 6; i++) {
cin >> score[i];
}
int sum = 0;
for (int i = 0; i < 6; i++) {
sum += score[i];
}
int mini;
mini = score[0];
for (int i = 0; i < 3; i++) {
if (score[i] < mini)
mini = score[i];
}
s... | #include <iostream>
using namespace std;
int main() {
int score[6];
for (int i = 0; i < 6; i++) {
cin >> score[i];
}
int sum = 0;
for (int i = 0; i < 6; i++) {
sum += score[i];
}
int mini;
mini = score[0];
for (int i = 0; i <= 3; i++) {
if (score[i] < mini)
mini = score[i];
}
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 155 | 2 |
//============================================================================
// Name : AOL.cpp
// Author : Akari Fujii
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#in... | //============================================================================
// Name : AOL.cpp
// Author : Akari Fujii
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#in... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 124 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
int main() {
int a[10];
int m;
for (int i = 0; i <= 5; i++) {
std::cin >> a[i];
}
std::sort(a, a + 3);
m = std::max(a[4], a[5]);
std::cout << a[3] + a[2] + a[1] + m << std::endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
int main() {
int a[10];
int m;
for (int i = 0; i <= 5; i++) {
std::cin >> a[i];
}
std::sort(a, a + 4);
m = std::max(a[4], a[5]);
std::cout << a[3] + a[2] + a[1] + m << std::endl;
return 0;
}
| [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 102 | 2 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vecto... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vecto... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22]] | 1 | 199 | 2 |
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())
F = int(input())
print(sum(sorted([A, B, C, D])[:3]) + max(E, F))
| A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())
F = int(input())
print(sum(sorted([A, B, C, D], reverse=True)[:3]) + max(E, F))
| [["+", 3, 4, 0, 206, 51, 652, 3, 4, 0, 21], ["+", 0, 206, 51, 652, 3, 4, 0, 653, 141, 22], ["+", 0, 206, 51, 652, 3, 4, 0, 653, 0, 32], ["+", 0, 206, 51, 652, 3, 4, 0, 653, 51, 146]] | 5 | 77 | 4 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
for (int k = 1; k < M + 1; ++k) {
for (int a = 0; a < N; ++a) {
if (1 <= a && a < N - 1) {
if (A[a] % k > A[a + 1] % k) {
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
for (int k = 1; k < M + 1; ++k) {
for (int a = 0; a < N; ++a) {
if (0 <= a && a < N - 1) {
if (A[a] % k > A[a + 1] % k) {
... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 13]] | 1 | 187 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, m, i, a[100], j, v, r, t;
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 1; i <= m; i++) {
for (j = 1; j < n - 1; j++) {
if (j <= n) {
v = a[j] % i;
r = a[j + 1] % i;
if (v > r) {
t =... | #include <iostream>
using namespace std;
int main() {
int n, m, i, a[100], j, v, r, t;
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 1; i <= m; i++) {
for (j = 0; j < n - 1; j++) {
if (j <= n) {
v = a[j] % i;
r = a[j + 1] % i;
if (v > r) {
t =... | [["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13]] | 1 | 183 | 2 |
// 0620
#include <stdio.h>
int main(void) {
int a[101], n, m, i, b, t;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i <= m; i++) {
b = 1;
while (b != n) {
if (a[b] % i > a[b + 1] % i) {
t = a[b];
a[b] = a[b + 1];
a[b + 1] = t;
... | // 0620
#include <stdio.h>
int main(void) {
int a[101], n, m, i, b, t;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i <= m; i++) {
b = 1;
while (b != n) {
if (a[b] % i > a[b + 1] % i) {
t = a[b];
a[b] = a[b + 1];
a[b + 1] = t;
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 176 | 4 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int a, b, ans = 0, W = 0, B = 0, R = 0;
int tansaku(int iti, int ryo, vector<string> c) {
int kariAns = 0;
for (int i = 0; i < b; i++) {
for (int j = 0; j < ryo; j++) {
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int a, b, ans = 0, W = 0, B = 0, R = 0;
int tansaku(int iti, int ryo, vector<string> c) {
int kariAns = 0;
for (int i = 0; i < b; i++) {
for (int j = 0; j < ryo; j++) {
... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22]] | 1 | 346 | 2 |
#include <bits/stdc++.h>
using namespace std;
int russia[52][52];
int main() {
int n, m;
cin >> n >> m;
int c = n * m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> russia[i][j];
}
}
int d = 0;
for (int i = 1; i < n - 1; i++) {
for (int j = 1; j < n - i; j++) {
... | #include <bits/stdc++.h>
using namespace std;
char russia[52][52];
int main() {
int n, m;
cin >> n >> m;
int c = n * m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> russia[i][j];
}
}
int d = 0;
for (int i = 1; i < n - 1; i++) {
for (int j = 1; j < n - i; j++) {
... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40]] | 1 | 304 | 2 |
#include <algorithm>
#include <deque>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
const long long mod = 1000000007;
const long long inf = mod * mod;
const long long d2 = 500000004;
ch... | #include <algorithm>
#include <deque>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
const long long mod = 1000000007;
const long long inf = mod * mod;
const long long d2 = 500000004;
ch... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 345 | 2 |
#include <bits/stdc++.h>
using namespace std;
int kou, sou = 114514810, H, W;
int main() {
cin >> H >> W;
char HW[H][W];
for (int i = 0; i < H; i++) {
for (int o = 0; o < W; o++) {
scanf(" %c", &HW[i][o]);
}
}
for (int i = 1; i < H - 2; i++) {
for (int j = 1; j < H - 2; j++) {
kou = 0;... | #include <bits/stdc++.h>
using namespace std;
int kou, sou = 114514810, H, W;
int main() {
cin >> H >> W;
char HW[H][W];
for (int i = 0; i < H; i++) {
for (int o = 0; o < W; o++) {
scanf(" %c", &HW[i][o]);
}
}
for (int i = 1; i < H - 1; i++) {
for (int j = 1; j < H - i; j++) {
kou = 0;... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22]] | 1 | 301 | 19 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int kos[550], ned[550], man[11000];
int data[10050];
cin >> m >> n;
for (int i = 0; i < m; i++)
cin >> man[i];
for (int i = 0; i < n; i++)
cin >> kos[i] >> ned[i];
sort(man, man + n);
reverse(man, man + n);
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int kos[550], ned[550], man[11000];
int data[10050];
cin >> m >> n;
for (int i = 0; i < m; i++)
cin >> man[i];
for (int i = 0; i < n; i++)
cin >> kos[i] >> ned[i];
sort(man, man + m);
reverse(man, man + m);
for (int i = 0; i ... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 278 | 10 |
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1 << 30;
const long long LINF = 1e18;
const int EPS = 1e-8;
#define PB push_back
#define mk make_pair
#define fr first
#define sc second
#define ll long long
#define ... | #include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1 << 30;
const long long LINF = 1e18;
const int EPS = 1e-8;
#define PB push_back
#define mk make_pair
#define fr first
#define sc second
#define ll long long
#define ... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 484 | 3 |
#include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
#define INF 1000000000
int man[10010], kaz[510], ned[510], dp[2][10010];
int main() {
int M, N, sum, a, b, cnt, hog;
cin >> M >> N;
for (int i = 0; i < M; i++)
cin >> man[i];
for (int i = 0; i < N; i++)
cin >> kaz[i] >>... | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
#define INF 1000000000
int man[10010], kaz[510], ned[510], dp[2][10010];
int main() {
int M, N, sum, a, b, cnt, hog;
cin >> M >> N;
for (int i = 0; i < M; i++)
cin >> man[i];
for (int i = 0; i < N; i++)
cin >> kaz[i] >>... | [["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22]] | 1 | 348 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef double db;
#define fr first
#define sc second
#define pb push_back
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef double db;
#define fr first
#define sc second
#define pb push_back
... | [["-", 0, 2, 3, 4, 0, 16, 31, 16, 12, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 324 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 707 | 6 |
def lower_bound(arr, v)
l = -1; r = arr.size
while l + 1 < r
m = (l + r) / 2
if arr[m] <= v then l = m
else r = m
end
end
l
end
n = gets.to_i
arr = []
n.times{ arr << gets.to_i }
sum = Array.new(2*n+1, 0)
(2*n).times{ |i| sum[i+1] += sum[i] + arr[i%n] }
l = 0; r = sum[n] / 3
while l + 1 < r
m ... | def lower_bound(arr, v)
l = -1; r = arr.size
while l + 1 < r
m = (l + r) / 2
if arr[m] <= v then l = m
else r = m
end
end
l
end
n = gets.to_i
arr = []
n.times{ arr << gets.to_i }
sum = Array.new(2*n+1, 0)
(2*n).times{ |i| sum[i+1] += sum[i] + arr[i%n] }
l = 0; r = sum[n] / 3 + 1
while l + 1 < r
... | [["+", 36, 36, 0, 493, 0, 662, 12, 738, 17, 72], ["+", 36, 36, 0, 493, 0, 662, 12, 738, 12, 612], ["+", 31, 738, 31, 652, 3, 4, 0, 738, 17, 33], ["+", 31, 738, 31, 652, 3, 4, 0, 738, 12, 612]] | 4 | 241 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 421 | 6 |
#include <iostream>
#define int long long
using namespace std;
signed main() {
int n, a[2000];
int dp[2000][2000] = {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (n % 2)
dp[i][i] = a[i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < n; j++) {
if ((n - i) % 2)
... | #include <iostream>
#define int long long
using namespace std;
signed main() {
int n, a[2000];
static int dp[2000][2000] = {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (n % 2)
dp[i][i] = a[i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < n; j++) {
if ((n - i) %... | [["+", 0, 14, 8, 9, 0, 43, 0, 114, 0, 115]] | 1 | 335 | 1 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
long long int DP[3000][3000];
long long int A[3000];
long long int INF = 100000000000000LL;
int main() {
int N;
cin >> N;
for (int i = 0; i < 2100; i++) {
for (int j = 0; j ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
long long int DP[3000][3000];
long long int A[3000];
long long int INF = 100000000000000LL;
int main() {
int N;
cin >> N;
for (int i = 0; i < 2100; i++) {
for (int j = 0; j ... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 453 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
ll a[2002];
ll dp[2002][2002][2];
int n;
ll dfs(int l, int r, bool t) {
if (l == r)
return dp[l][r][t] = a[l... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
ll a[2002];
ll dp[2002][2002][2];
int n;
ll dfs(int l, int r, bool t) {
if (l == r)
return dp[l][r][t] = (t ... | [["+", 0, 57, 64, 37, 0, 11, 12, 23, 0, 24], ["+", 64, 37, 0, 11, 12, 23, 0, 41, 15, 22], ["+", 64, 37, 0, 11, 12, 23, 0, 41, 0, 101], ["+", 64, 37, 0, 11, 12, 23, 0, 41, 64, 13], ["+", 64, 37, 0, 11, 12, 23, 0, 41, 0, 102], ["+", 0, 57, 64, 37, 0, 11, 12, 23, 0, 25]] | 1 | 352 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int N;
int A[6000];
int dp[4000][6000];
int dfs(int l, int r) {
if (~dp[l][r])
return dp[l][r];
int res;
int cnt = r - l - 1;
if (cnt == N)
res = 0;
else if (cnt & 1) {
if (A[l] >... | #include <bits/stdc++.h>
using namespace std;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define int long long
int N;
int A[6000];
int dp[4000][6000];
int dfs(int l, int r) {
if (~dp[l][r])
return dp[l][r];
int res;
int cnt = r - l - 1;
if (cnt == N)
res = 0;
else if (cnt... | [["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 156]] | 1 | 302 | 5 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MAX_N 300000
#define TEISU 1000000
#define BLACK 2
#define GRAY 1
#define WHITE 0
#define INF 1145141919810LL
long long n, m, c, minx = (1LL << 49), E, F, G;
vector<long lo... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MAX_N 300000
#define TEISU 1000000
#define BLACK 2
#define GRAY 1
#define WHITE 0
#define INF 1145141919810LL
long long n, m, c, minx = (1LL << 49), E, F, G;
vector<long lo... | [["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96]] | 1 | 758 | 6 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <tuple>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
int N, M, C, A, B, E;
long long sum;
vector<long long> P;
vector<tuple<int, int, int>> edges;
vector<vector<pair<int, int>>> G;
int main() {
sc... | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <tuple>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
int N, M, C, A, B, E;
long long sum;
vector<long long> P;
vector<tuple<int, int, int>> edges;
vector<vector<pair<int, int>>> G;
int main() {
sc... | [["-", 8, 9, 0, 43, 49, 53, 54, 55, 0, 24], ["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 8, 9, 0, 43, 49, 53, 54, 55, 0, 25], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 714 | 7 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define MAX 100001
#define B 100
#define dpb push_back
#define fi first
#define se second
typedef pair<int, int> P;
typedef long lon... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define MAX 100001
#define B 100
#define dpb push_back
#define fi first
#define se second
typedef pair<int, int> P;
typedef long lon... | [["+", 3, 4, 0, 16, 12, 16, 31, 74, 0, 24], ["+", 0, 16, 12, 16, 31, 74, 39, 77, 39, 78], ["+", 3, 4, 0, 16, 12, 16, 31, 74, 0, 25]] | 1 | 583 | 3 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
vector<pint> vp[500001];
ll d[100001];
ll INF = 1000100010001000;
int n;
int dijkstra(int st) {
priority_queue<p... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<ll, ll> pint;
vector<pint> vp[100001];
ll d[100001];
ll INF = 1000100010001000;
int n;
int dijkstra(int st) {
priority_queue<pin... | [["-", 0, 134, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 134, 39, 344, 3, 347, 0, 77, 39, 78], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13]] | 1 | 447 | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int INF = 0x3f3f3f3f;
int n, m, id, a[N], b[N];
int sz[N], f[N * 2][2], nxt[N * 2][3];
vector<int> val;
void dfs(int u, int x, int cnt) {
if (u <= n) {
if (b[u]) {
bool t = (b[u] >= n);
f[u][t] = t;
} else
f[u][0] =... | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int INF = 0x3f3f3f3f;
int n, m, id, a[N], b[N];
int sz[N * 2], f[N * 2][2], nxt[N * 2][3];
vector<int> val;
void dfs(int u, int x, int cnt) {
if (u <= n) {
if (b[u]) {
bool t = (b[u] >= x);
f[u][t] = t;
} else
f[u][... | [["+", 0, 30, 0, 43, 49, 80, 81, 16, 17, 48], ["+", 0, 30, 0, 43, 49, 80, 81, 16, 12, 13], ["-", 0, 43, 49, 50, 51, 23, 0, 16, 12, 22], ["+", 0, 43, 49, 50, 51, 23, 0, 16, 12, 22]] | 1 | 809 | 4 |
#include <cstdio>
int N, M, p, d, val[100009], a[100009], dp[150009];
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < M; i++)
scanf("%d %d", &p, &d), val[p - 1] = d;
for (int i = 0; i < N - M; i++)
scanf("%d", &a[i]);
int l = 0, r = 1000000009;
while (r - l > 1) {
int m = (l + r) >> 1;
... | #include <cstdio>
int N, M, p, d, val[100009], a[100009], dp[150009];
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < M; i++)
scanf("%d %d", &d, &p), val[p - 1] = d;
for (int i = 0; i < N - M; i++)
scanf("%d", &a[i]);
int l = 0, r = 1000000009;
while (r - l > 1) {
int m = (l + r) >> 1;
... | [["-", 0, 34, 31, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 34, 31, 2, 3, 4, 0, 66, 28, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["-", 0, 57, 75, 76, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 75, 7... | 1 | 340 | 12 |
#include <stdio.h>
int main() {
int phy, cem, bio, tigaku, hys, tiri, x;
scanf("%d", &phy);
scanf("%d", &cem);
scanf("%d", &bio);
scanf("%d", &tigaku);
scanf("%d", &hys);
scanf("%d", tiri);
if (phy < cem) {
x = cem;
cem = phy;
phy = x;
}
if (cem < bio) {
x = bio;
bio = cem;
... | #include <stdio.h>
int main() {
int phy, cem, bio, tigaku, hys, tiri, x;
scanf("%d", &phy);
scanf("%d", &cem);
scanf("%d", &bio);
scanf("%d", &tigaku);
scanf("%d", &hys);
scanf("%d", &tiri);
if (phy < cem) {
x = cem;
cem = phy;
phy = x;
}
if (cem < bio) {
x = bio;
bio = cem;
... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 181 | 1 |
#include <stdio.h>
int main(void) {
int A, B, C, D, E, F, S;
scanf("%d %d %d %d %d %d", &A, &B, &C, &D, &E, &F);
S = A + B + C;
if (S < B + C + D)
S = B + C + D;
else if (S < C + D + A)
S = C + D + A;
else if (S < D + A + B)
S = D + A + B;
if (E > F)
printf("%d\n", S + E);
else
print... | #include <stdio.h>
int main(void) {
int A, B, C, D, E, F, S;
scanf("%d %d %d %d %d %d", &A, &B, &C, &D, &E, &F);
S = A + B + C;
if (S < B + C + D)
S = B + C + D;
if (S < C + D + A)
S = C + D + A;
if (S < D + A + B)
S = D + A + B;
if (E > F)
printf("%d\n", S + E);
else
printf("%d\n", ... | [["-", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95]] | 0 | 147 | 2 |
#include <stdio.h>
int main() {
int a[6], i, an = 0, c, d, e;
for (i = 0; i < 6; i++) {
scanf("%d\n", &a[i]);
an += a[i];
}
if (a[4] > a[5])
c = a[5];
else
c = a[4];
if (a[1] > a[0])
d = a[0];
else
d = a[1];
if (a[3] > a[2])
e = a[2];
else
e = a[3];
if (e < d)
... | #include <stdio.h>
int main() {
int a[6], i, an = 0, c, d, e;
for (i = 0; i < 6; i++) {
scanf("%d\n", &a[i]);
an += a[i];
}
if (a[4] > a[5])
c = a[5];
else
c = a[4];
if (a[1] > a[0])
d = a[0];
else
d = a[1];
if (a[3] > a[2])
e = a[2];
else
e = a[3];
if (e < d)
... | [["-", 0, 14, 8, 9, 0, 57, 64, 1, 0, 35], ["-", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95]] | 0 | 172 | 2 |
#include <stdio.h>
int main() {
int a = 0, i = 0, sum = 0, n = 0, m = 100;
for (i = 0; i < 4; i++) {
scanf("%d", &a);
sum += a;
if (a < m) {
m = a;
}
}
sum -= m;
m = 0;
for (i = 0; i < 2; i++) {
scanf("%d", &a);
sum += a;
if (a < m) {
m = a;
}
}
sum -= m;
pr... | #include <stdio.h>
int main() {
int a = 0, i = 0, sum = 0, n = 0, m = 100;
for (i = 0; i < 4; i++) {
scanf("%d", &a);
sum += a;
if (a < m) {
m = a;
}
}
sum -= m;
m = 100;
for (i = 0; i < 2; i++) {
scanf("%d", &a);
sum += a;
if (a < m) {
m = a;
}
}
sum -= m;
... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 136 | 2 |
#include <stdio.h>
int main(void) {
int e, f, x, y[4], z, i, j;
scanf("%d %d %d %d %d %d", y[0], y[1], y[2], y[3], &e, &f);
for (i = 0; i < 3; i++) {
for (j = i + 1; j < 4; j++) {
if (y[i] < y[j]) {
z = y[i];
y[i] = y[j];
y[j] = z;
}
}
}
x = y[0] + y[1] + y[2];
if... | #include <stdio.h>
int main(void) {
int e, f, x, y[4], z, i, j;
scanf("%d %d %d %d %d %d", &y[0], &y[1], &y[2], &y[3], &e, &f);
for (i = 0; i < 3; i++) {
for (j = i + 1; j < 4; j++) {
if (y[i] < y[j]) {
z = y[i];
y[i] = y[j];
y[j] = z;
}
}
}
x = y[0] + y[1] + y[2];
... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 193 | 4 |
// Selecting Subjects
#include <iostream>
using namespace std;
int main() {
int Scores[6];
for (int i = 0; i < 6; i++)
cin >> Scores[i];
int s = 0, minv = 101;
for (int i = 0; i < 4; i++) {
s += Scores[i];
minv = min(minv, Scores[i]);
}
s -= minv;
for (int i = 4; i < 6; i++) {
s += Scor... | // Selecting Subjects
#include <iostream>
using namespace std;
int main() {
int Scores[6];
for (int i = 0; i < 6; i++)
cin >> Scores[i];
int s = 0, minv = 101;
for (int i = 0; i < 4; i++) {
s += Scores[i];
minv = min(minv, Scores[i]);
}
s -= minv;
minv = 101;
for (int i = 4; i < 6; i++) {... | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 133 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> science(4);
vector<int> social(2);
cin >> science[0] >> science[1] >> science[2] >> science[3] >> social[0] >>
... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> science(4);
vector<int> social(2);
cin >> science[0] >> science[1] >> science[2] >> science[3] >> social[0] >>
... | [["-", 12, 16, 31, 16, 12, 69, 341, 342, 0, 13], ["+", 12, 16, 31, 16, 12, 69, 341, 342, 0, 13]] | 1 | 130 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[6];
for (int i = 0; i < 6; i++)
cin >> a[i];
sort(a, a + 4);
sort(a + 5, a + 6, greater<int>());
int ans = 0;
for (int i = 1; i < 5; i++)
ans += a[i];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[6];
for (int i = 0; i < 6; i++)
cin >> a[i];
sort(a, a + 4);
sort(a + 4, a + 6, greater<int>());
int ans = 0;
for (int i = 1; i < 5; i++)
ans += a[i];
cout << ans << endl;
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 101 | 2 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static final Scanner s = new Scanner(System.in);
static int getInt() { return Integer.parseInt(s.next()); }
public static void main(String[] $) {
int n = getInt(), m = getInt(), p[] = new int[m];
for (int i = 0; i < m; i++) {
p[i... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
static final Scanner s = new Scanner(System.in);
static int getInt() { return Integer.parseInt(s.next()); }
public static void main(String[] $) {
int n = getInt(), m = getInt(), p[] = new int[m];
for (int i = 0; i < m; i++) {
p[i... | [["+", 3, 4, 0, 492, 500, 492, 500, 492, 141, 22], ["+", 0, 492, 500, 492, 500, 492, 3, 4, 0, 24], ["+", 0, 492, 500, 492, 500, 492, 3, 4, 0, 25], ["+", 0, 492, 3, 4, 0, 492, 500, 492, 0, 131]] | 3 | 158 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
//合計時間
int N, M;
cin >> N >> M;
int a;
int A[5000];
int b = 0;
int x = 0;
for (int i = 0; i < 2 * M; i++) {
cin >> a;
if (a < N) {
A[x] = a;
x++;
} else {
b++;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
//合計時間
int N, M;
cin >> N >> M;
int a;
int A[5000];
int b = 0;
int x = 0;
for (int i = 0; i < M; i++) {
cin >> a;
if (a < N) {
A[x] = a;
x++;
} else {
b++;
}... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 31, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 48]] | 1 | 177 | 2 |
inputed_str = input()
str_list = inputed_str.split(' ')
data = [int(i) for i in str_list]
target = data[0]
def how_much(a, b):
sumnum = 0
summoney = 0
while sumnum < target:
sumnum += a
summoney += b
return summoney
x = how_much(data[1], data[2])
y = how_much(data[3], data[4])
print(ma... | inputed_str = input()
str_list = inputed_str.split(' ')
data = [int(i) for i in str_list]
target = data[0]
def how_much(a, b):
sumnum = 0
summoney = 0
while sumnum < target:
sumnum += a
summoney += b
return summoney
x = how_much(data[1], data[2])
y = how_much(data[3], data[4])
print(mi... | [["-", 0, 1, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 652, 63, 22]] | 5 | 97 | 2 |
n,a,b,c,d = map(int,input().split())
print(max(((n-1)//a+1)*b,((n-1)//c+1)*d))
| n,a,b,c,d = map(int,input().split())
print(min(((n-1)//a+1)*b,((n-1)//c+1)*d))
| [["-", 0, 1, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 652, 63, 22]] | 5 | 55 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) throws IOException {
String mojiretu = "";
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] moji;
mojiretu = br.readLine(... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) throws IOException {
String mojiretu = "";
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] moji;
mojiretu = br.readLine(... | [["+", 75, 57, 64, 196, 0, 1, 0, 11, 31, 22], ["+", 75, 57, 64, 196, 0, 1, 0, 11, 17, 32], ["+", 75, 57, 64, 196, 0, 1, 0, 11, 12, 499], ["+", 75, 57, 75, 57, 64, 196, 0, 1, 0, 35]] | 3 | 298 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, d;
cin >> n >> m >> d;
string s[n];
int a[n][m];
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
if (s[i][j] == '.')
a[i][j] = 0;
else
a[i]... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, d;
cin >> n >> m >> d;
string s[n];
int a[n][m];
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
if (s[i][j] == '.')
a[i][j] = 0;
else
a[i]... | [["+", 8, 7, 15, 16, 12, 16, 31, 16, 31, 13], ["+", 8, 7, 15, 16, 12, 16, 31, 16, 17, 72], ["+", 0, 7, 15, 16, 12, 16, 31, 16, 31, 13], ["+", 0, 7, 15, 16, 12, 16, 31, 16, 17, 72]] | 1 | 298 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
int N, M;
int ans = 1 << 30;
int C[21][100010];
int num[21];
int NU[100010];
int DP[1 << 21][21];
int ac[1 << 21];
int main() {
std::cin >> N >> M;
for (int i = 1; i <= N; i++) {
std::cin >> NU[i];
num[NU[i]]++;
}
for (int i = 1; i <= M; i++) {... | #include <algorithm>
#include <iostream>
#include <vector>
int N, M;
int ans = 1 << 30;
int C[21][100010];
int num[21];
int NU[100010];
int DP[1 << 21][21];
int ac[1 << 21];
int main() {
std::cin >> N >> M;
for (int i = 1; i <= N; i++) {
std::cin >> NU[i];
num[NU[i]]++;
}
for (int i = 1; i <= M; i++) {... | [["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 506 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
r(i, n) cin >> a[i];
a[n - 1] = 0;
int sum = 0;
r(i, n) {
if (a[i] == 1) {
int pre = i;
while (a[i])
i++;
sum = max(sum, i - pre);
}
}
... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
r(i, n) cin >> a[i];
a[n] = 0;
int sum = 0;
r(i, n) {
if (a[i] == 1) {
int pre = i;
while (a[i])
i++;
sum = max(sum, i - pre);
}
}
cou... | [["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 116 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, N, A[110], s = 0, a = 0;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> A[i];
}
for (i = 1; i <= N; i++) {
if (A[i] == 1) {
s++;
} else {
if (s > a)
a = s;
s = 0;
}
}
cout << a + 1 << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, N, A[110] = {}, s = 0, a = 0;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> A[i];
}
for (i = 1; i <= N + 1; i++) {
if (A[i] == 1) {
s++;
} else {
if (s > a)
a = s;
s = 0;
}
}
cout << a + 1 << end... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 115 | 5 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int j = 1;
int m = 1;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a = 1) {
j++;
m = max(m, j);
} else {
j = 1;
}
}
cout << m << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int j = 1;
int m = 1;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a == 1) {
j++;
m = max(m, j);
} else {
j = 1;
}
}
cout << m << endl;
return 0;
}
| [["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 88 | 2 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
double eps = 1e-8;
ll mod = 1e9 + 7;
ll inf = 1e9;
priority_queue<P, vector<P>, greater<P>> pq;
template <typename T> int Count(const vector<T> &v, T l, T r) {
// counting [l,r]
auto L = low... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
double eps = 1e-8;
ll mod = 1e9 + 7;
ll inf = 1e9;
priority_queue<P, vector<P>, greater<P>> pq;
template <typename T> int Count(const vector<T> &v, T l, T r) {
// counting [l,r]
auto L = low... | [["-", 12, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 12, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 11, 12, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 16, 12, 69, 341, 342, 0, 22]] | 1 | 306 | 4 |
def check(y,x):
if 0<=y<=h-1 and 0<=x<=w-1:
return True
return False
h,w=list(map(int,input().split()))
g=[list(map(int,input().split())) for _ in range(h)]
pos=[-1]*(h*w)
for i in range(h):
for j in range(w):
pos[g[i][j]-1]=[i,j]
dy=(1,0,-1,0)
dx=(0,1,0,-1)
stop=[set() for _ in range(h*w)... | def check(y,x):
if 0<=y<=h-1 and 0<=x<=w-1:
return True
return False
h,w=list(map(int,input().split()))
g=[list(map(int,input().split())) for _ in range(h)]
pos=[-1]*(h*w)
for i in range(h):
for j in range(w):
pos[g[i][j]-1]=[i,j]
dy=(1,0,-1,0)
dx=(0,1,0,-1)
stop=[set() for _ in range(h*w)... | [["+", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 290 | 4 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) begin(v), end(v)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const int inf = 1 << 25; // 1LL << 55;
const int mod = 1e9 + 7;
struct edge {
int to, cost;
e... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) begin(v), end(v)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const int inf = 1 << 25; // 1LL << 55;
const int mod = 1e9 + 7;
struct edge {
int to, cost;
e... | [["-", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22]] | 1 | 608 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[200001], sa[200001], ans[200001];
int main(void) {
ll n, q, s, t, l, r, x, pl, mi, i, j;
cin >> n >> q >> s >> t;
for (i = 0; i <= n; i++)
cin >> a[i];
pl = 0;
mi = 0;
for (i = 1; i <= n; i++) {
sa[i] = a[i] - a[i - 1];
if (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[200001], sa[200001], ans[200001];
int main(void) {
ll n, q, s, t, l, r, x, pl, mi, i, j;
cin >> n >> q >> s >> t;
for (i = 0; i <= n; i++)
cin >> a[i];
pl = 0;
mi = 0;
for (i = 1; i <= n; i++) {
sa[i] = a[i] - a[i - 1];
if (... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 489 | 4 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
// -90????????¢
vector<vector<int>> rotate(auto A) {
auto H = A.size(), W = A.front().size();
vector<vector<int>> res(W, vector<int>(H));
for (auto i = 0; i < H; ++i)
for (auto j = 0; j < W; ++j)
res[j][H - 1 - i] = A[i][j];
return r... | #include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
// -90????????¢
vector<vector<int>> rotate(auto A) {
auto H = A.size(), W = A.front().size();
vector<vector<int>> res(W, vector<int>(H));
for (auto i = 0; i < H; ++i)
for (auto j = 0; j < W; ++j)
res[j][H - 1 - i] = A[i][j];
return r... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 448 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
int a[2001][2001], a2[2001][2001];
int b[2001][2001];
int h, w, mx, mn;
bool test(int d) {
rep(i, h) rep(j, w) {... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
int a[2001][2001], a2[2001][2001];
int b[2001][2001];
int h, w, mx, mn;
bool test(int d) {
rep(i, h) rep(j, w) {... | [["-", 75, 76, 0, 57, 75, 76, 0, 37, 0, 146], ["+", 75, 76, 0, 57, 75, 76, 0, 37, 0, 147]] | 1 | 567 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.