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
|
|---|---|---|---|---|
#include <iostream>
using namespace std;
int a, sum;
main() {
for (int i = 0; i < 4; i++) {
cin >> a;
sum += a;
}
cout << a / 60 << endl << a % 60 << endl;
}
|
#include <iostream>
using namespace std;
int a, s;
main() {
for (int i = 0; i < 4; i++) {
cin >> a;
s += a;
}
cout << s / 60 << endl << s % 60 << endl;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 31, 16, 31, 16, 31, 16, 12, 16, 31, 22], ["+", 31, 16, 31, 16, 31, 16, 12, 16, 31, 22], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22]]
| 1
| 54
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n) {
vector<vector<bool>> relation(n, vector<bool>(n));
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
relation[a][b] = relation[b][a] = true;
}
vector<bool> friends(n);
for (int i = 0; i < n; ++i) {
if (relation[0][i]) {
friends[i] = true;
for (int j = 0; j < n; ++j) {
if (relation[i][j]) {
friends[j] = true;
}
}
}
}
friends[0] = false;
cout << count(friends.begin(), friends.end(), true) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n) {
vector<vector<bool>> relation(n, vector<bool>(n));
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
relation[a][b] = relation[b][a] = true;
}
vector<bool> friends(n);
for (int i = 0; i < n; ++i) {
if (relation[0][i]) {
friends[i] = true;
for (int j = 0; j < n; ++j) {
if (relation[i][j]) {
friends[j] = true;
}
}
}
}
friends[0] = false;
cout << count(friends.begin(), friends.end(), true) << endl;
}
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22]]
| 1
| 207
|
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
#define REP(i, a, b) for (i = a; i < b; ++i)
#define rep(i, n) REP(i, 0, n)
int graph[500][500], dist[500];
int main() {
int n, m, i, j, k, a, b;
for (;;) {
scanf("%d", &n);
scanf("%d", &m);
if (!n)
break;
memset(graph, 0, sizeof(graph));
memset(dist, 0, sizeof(dist));
rep(i, m) {
scanf("%d %d", &a, &b);
graph[a - 1][b - 1] = graph[a - 1][b - 1] = 1;
}
queue<int> Q;
int ans = 0;
dist[0] = 1;
Q.push(0);
while (!Q.empty()) {
int now = Q.front();
Q.pop();
ans++;
if (dist[now] >= 3)
continue;
rep(i, n) {
if (dist[i] != 0 || graph[now][i] == 0)
continue;
dist[i] = dist[now] + 1;
Q.push(i);
}
}
printf("%d\n", ans - 1);
}
}
|
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
#define REP(i, a, b) for (i = a; i < b; ++i)
#define rep(i, n) REP(i, 0, n)
int graph[500][500], dist[500];
int main() {
int n, m, i, j, k, a, b;
for (;;) {
scanf("%d", &n);
scanf("%d", &m);
if (!n)
break;
memset(graph, 0, sizeof(graph));
memset(dist, 0, sizeof(dist));
rep(i, m) {
scanf("%d %d", &a, &b);
graph[a - 1][b - 1] = graph[b - 1][a - 1] = 1;
}
queue<int> Q;
int ans = 0;
dist[0] = 1;
Q.push(0);
while (!Q.empty()) {
int now = Q.front();
Q.pop();
ans++;
if (dist[now] >= 3)
continue;
rep(i, n) {
if (dist[i] != 0 || graph[now][i] == 0)
continue;
dist[i] = dist[now] + 1;
Q.push(i);
}
}
printf("%d\n", ans - 1);
}
}
|
[["-", 31, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["-", 12, 11, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 12, 11, 31, 69, 341, 342, 0, 16, 31, 22]]
| 1
| 293
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define mp make_pair
template <class T> void pv(T a, T b) {
for (T i = a; i != b; ++i)
cout << *i << " ";
cout << endl;
}
template <class T> void chmin(T &t, T f) {
if (t > f)
t = f;
}
template <class T> void chmax(T &t, T f) {
if (t < f)
t = f;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
vector<pint> fr;
int dis[1000];
int main() {
int n, m;
while (cin >> n >> m, n) {
fr.clear();
int i;
pint f;
for (i = 0; i < m; i++) {
cin >> f.first >> f.second;
fr.push_back(f);
}
memset(dis, 0, sizeof(dis));
dis[1] = 1;
bool update = true;
while (update) {
update = false;
for (i = 0; i < m; i++) {
if (dis[fr[i].first] == 1 || dis[fr[i].first] == 2) {
if (dis[fr[i].second] == 0 ||
dis[fr[i].second] > dis[fr[i].first] + 1) {
dis[fr[i].second] = dis[fr[i].first] + 1;
update = true;
}
} else if (dis[fr[i].second] == 1 || dis[fr[i].second] == 2) {
if (dis[fr[i].first] == 0 ||
dis[fr[i].first] > dis[fr[i].second] + 1) {
dis[fr[i].first] = dis[fr[i].second] + 1;
update = true;
}
}
}
}
int res = 0;
for (i = 2; i < n; i++) {
if (dis[i] != 0)
res++;
}
cout << res << endl;
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define mp make_pair
template <class T> void pv(T a, T b) {
for (T i = a; i != b; ++i)
cout << *i << " ";
cout << endl;
}
template <class T> void chmin(T &t, T f) {
if (t > f)
t = f;
}
template <class T> void chmax(T &t, T f) {
if (t < f)
t = f;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
vector<pint> fr;
int dis[1000];
int main() {
int n, m;
while (cin >> n >> m, n) {
fr.clear();
int i;
pint f;
for (i = 0; i < m; i++) {
cin >> f.first >> f.second;
fr.push_back(f);
}
memset(dis, 0, sizeof(dis));
dis[1] = 1;
bool update = true;
while (update) {
update = false;
for (i = 0; i < m; i++) {
if (dis[fr[i].first] == 1 || dis[fr[i].first] == 2) {
if (dis[fr[i].second] == 0 ||
dis[fr[i].second] > dis[fr[i].first] + 1) {
dis[fr[i].second] = dis[fr[i].first] + 1;
update = true;
}
} else if (dis[fr[i].second] == 1 || dis[fr[i].second] == 2) {
if (dis[fr[i].first] == 0 ||
dis[fr[i].first] > dis[fr[i].second] + 1) {
dis[fr[i].first] = dis[fr[i].second] + 1;
update = true;
}
}
}
}
int res = 0;
for (i = 2; i <= n; i++) {
// cout<<i<<" "<<dis[i]<<endl;
if (dis[i] != 0)
res++;
}
cout << res << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 535
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
while (cin >> N >> M, N || M) {
vector<int> v[500];
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
v[a - 1].push_back(b - 1);
v[b - 1].push_back(a - 1);
}
bool f[500] = {0};
for (int i = 0; i < v[0].size(); i++) {
f[v[0][i]] = 1;
for (int j = 0; j < v[i].size(); j++) {
f[v[v[0][i]][j]] = 1;
}
}
int ans = 0;
for (int i = 1; i < N; i++) {
if (f[i])
ans++;
}
cout << ans << endl;
}
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
while (cin >> N >> M, N || M) {
vector<int> v[500];
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
v[a - 1].push_back(b - 1);
v[b - 1].push_back(a - 1);
}
bool f[500] = {0};
for (int i = 0; i < v[0].size(); i++) {
f[v[0][i]] = 1;
for (int j = 0; j < v[v[0][i]].size(); j++) {
f[v[v[0][i]][j]] = 1;
}
}
int ans = 0;
for (int i = 1; i < N; i++) {
if (f[i])
ans++;
}
cout << ans << endl;
}
}
|
[["+", 28, 69, 341, 342, 0, 69, 28, 69, 28, 22], ["+", 341, 342, 0, 69, 28, 69, 341, 342, 0, 70], ["+", 341, 342, 0, 69, 28, 69, 341, 342, 0, 13], ["+", 341, 342, 0, 69, 28, 69, 341, 342, 0, 73], ["+", 28, 69, 341, 342, 0, 69, 341, 342, 0, 70], ["+", 28, 69, 341, 342, 0, 69, 341, 342, 0, 73]]
| 1
| 222
|
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
int main() {
int n, m;
P p;
while (cin >> n >> m && n && m) {
int ans = 0;
bool matrix[n + 2][n + 2];
for (int i = 0; i < n + 2; i++)
for (int j = 0; j < n + 2; j++)
matrix[i][j] = false;
for (int i = 0; i < m; i++) {
cin >> p.F >> p.S;
matrix[p.F][p.S] = matrix[p.S][p.F] = true;
}
int here;
map<int, bool> cnt;
for (int i = 0; i < m; i++) {
if (matrix[1][i]) {
here = i;
cnt[here] = true;
for (int j = 0; j < m; j++) {
if (i == j)
continue;
if (matrix[here][j]) {
cnt[j] = true;
}
}
}
}
map<int, bool>::iterator it = cnt.begin();
while (it != cnt.end()) {
if ((*it).F != 1)
ans++;
it++;
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
int main() {
int n, m;
P p;
while (cin >> n >> m && n && m) {
int ans = 0;
bool matrix[n + 2][n + 2];
for (int i = 0; i < n + 2; i++)
for (int j = 0; j < n + 2; j++)
matrix[i][j] = false;
for (int i = 0; i < m; i++) {
cin >> p.F >> p.S;
matrix[p.F][p.S] = matrix[p.S][p.F] = true;
}
int here;
map<int, bool> cnt;
for (int i = 1; i <= n; i++) {
if (matrix[1][i]) {
here = i;
cnt[here] = true;
for (int j = 1; j <= n; j++) {
if (i == j)
continue;
if (matrix[here][j]) {
cnt[j] = true;
}
}
}
}
map<int, bool>::iterator it = cnt.begin();
while (it != cnt.end()) {
if ((*it).F != 1)
ans++;
it++;
}
cout << ans << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 64, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 64, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22]]
| 1
| 314
|
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
bool invite[500];
bool are_friend[500][500];
int main() {
int n, m;
while (cin >> n >> m, n || m) {
memset(invite, false, sizeof(invite));
memset(are_friend, false, sizeof(are_friend));
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
are_friend[a][b] = are_friend[b][a] = true;
}
for (int i = 1; i < m; i++) {
if (are_friend[0][i]) {
invite[i] = true;
for (int j = 1; j < m; j++) {
if (are_friend[i][j]) {
invite[j] = true;
}
}
}
}
cout << count(invite, invite + n, true) << endl;
}
return 0;
}
|
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
bool invite[500];
bool are_friend[500][500];
int main() {
int n, m;
while (cin >> n >> m, n || m) {
memset(invite, false, sizeof(invite));
memset(are_friend, false, sizeof(are_friend));
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
are_friend[a][b] = are_friend[b][a] = true;
}
for (int i = 1; i < n; i++) {
if (are_friend[0][i]) {
invite[i] = true;
for (int j = 1; j < n; j++) {
if (are_friend[i][j]) {
invite[j] = true;
}
}
}
}
cout << count(invite, invite + n, true) << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22]]
| 1
| 213
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, m;
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
bool a[501][501] = {{0}};
bool mem[501] = {0};
bool mem1[501] = {0};
for (int i = 0; i < m; i++) {
int f, t;
scanf("%d%d", &f, &t);
a[f][t] = true;
a[t][f] = true;
}
for (int i = 2; i <= n; i++) {
if (a[1][i] || a[i][1])
mem[i] = 1;
}
for (int i = 2; i <= n; i++) {
for (int j = 2; j <= n; j++) {
if (mem[i] && (a[i][j] || a[j][i])) {
mem1[j] = 1;
}
}
}
int cnt = 0;
for (int i = 2; i <= n; i++) {
if (mem1[i])
cnt++;
}
printf("%d\n", cnt);
}
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, m;
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
bool a[501][501] = {{0}};
bool mem[501] = {0};
bool mem1[501] = {0};
for (int i = 0; i < m; i++) {
int f, t;
scanf("%d%d", &f, &t);
a[f][t] = true;
a[t][f] = true;
}
for (int i = 2; i <= n; i++) {
if (a[1][i] || a[i][1])
mem[i] = 1;
}
for (int i = 2; i <= n; i++) {
for (int j = 2; j <= n; j++) {
if (mem[i] && (a[i][j] || a[j][i])) {
mem1[j] = 1;
}
}
}
int cnt = 0;
for (int i = 2; i <= n; i++) {
if (mem1[i] || mem[i])
cnt++;
}
printf("%d\n", cnt);
}
return 0;
}
|
[["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 73]]
| 1
| 290
|
#include <iostream>
using namespace std;
int main() {
int n, m;
int in[10010][2];
bool a[10010];
bool b[10010];
while (cin >> n >> m, n | m) {
for (int i = 0; i < 10010; i++) {
a[i] = false;
b[i] = false;
}
for (int i = 0; i < m; i++) {
cin >> in[i][0] >> in[i][1];
}
for (int i = 0; i < m; i++) {
if (in[i][0] == 1) {
a[in[i][1]] = true;
} else if (in[i][1] == 1) {
a[in[i][0]] = true;
}
}
for (int i = 0; i < n; i++) {
if (a[i]) {
b[i] = true;
for (int j = 0; j < m; j++) {
if (in[j][0] == i) {
b[in[j][1]] = true;
} else if (in[j][1] == i) {
b[in[j][0]] = true;
}
}
}
}
int ans = 0;
for (int i = 2; i < n; i++) {
if (b[i]) {
ans++;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, m;
int in[10010][2];
bool a[10010];
bool b[10010];
while (cin >> n >> m, n | m) {
for (int i = 0; i < 10010; i++) {
a[i] = false;
b[i] = false;
}
for (int i = 0; i < m; i++) {
cin >> in[i][0] >> in[i][1];
}
for (int i = 0; i < m; i++) {
if (in[i][0] == 1) {
a[in[i][1]] = true;
} else if (in[i][1] == 1) {
a[in[i][0]] = true;
}
}
for (int i = 0; i <= n; i++) {
if (a[i]) {
b[i] = true;
for (int j = 0; j < m; j++) {
if (in[j][0] == i) {
b[in[j][1]] = true;
} else if (in[j][1] == i) {
b[in[j][0]] = true;
}
}
}
}
int ans = 0;
for (int i = 2; i <= n; i++) {
if (b[i]) {
ans++;
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 332
|
#include <algorithm>
#include <cstdio>
#include <cstring>
int fr[501];
int c[10001], d[10001];
using namespace std;
int main(void) {
int n, m;
int a, b;
while (scanf("%d%d", &n, &m)) {
if (n == 0 && m == 0)
break;
for (int i = 0; i < 501; i++)
fr[i] = 0, c[i] = 0, d[i] = 0;
int j = 0;
for (int i = 0; i < m; i++) {
scanf("%d%d", &a, &b);
if (a == 1)
fr[b] = 1;
else if (b == 1)
fr[a] = 1;
else {
c[j] = a, d[j] = b;
j++;
}
}
for (int i = 0; i < j; i++) {
if (fr[c[i]] == 1 && fr[d[i]] != 1)
fr[d[i]] = 2;
else if (fr[d[i]] == 1 && fr[c[i]] != 1)
fr[c[i]] = 2;
}
int cnt = 0;
for (int i = 0; i < n; i++)
if (fr[i] != 0)
cnt++;
printf("%d\n", cnt);
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
int fr[501];
int c[10001], d[10001];
using namespace std;
int main(void) {
int n, m;
int a, b;
while (scanf("%d%d", &n, &m)) {
if (n == 0 && m == 0)
break;
for (int i = 0; i < 501; i++)
fr[i] = 0, c[i] = 0, d[i] = 0;
int j = 0;
for (int i = 0; i < m; i++) {
scanf("%d%d", &a, &b);
if (a == 1)
fr[b] = 1;
else if (b == 1)
fr[a] = 1;
else {
c[j] = a, d[j] = b;
j++;
}
}
for (int i = 0; i < j; i++) {
if (fr[c[i]] == 1 && fr[d[i]] != 1)
fr[d[i]] = 2;
else if (fr[d[i]] == 1 && fr[c[i]] != 1)
fr[c[i]] = 2;
}
int cnt = 0;
for (int i = 0; i < 501; i++)
if (fr[i] != 0)
cnt++;
printf("%d\n", cnt);
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 314
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, m;
cin >> n;
if (n == 0)
break;
cin >> m;
bool t[502][502];
for (int i = 1; i <= n; i++) {
fill(t[i] + 1, t[i] + n + 1, false);
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
t[a][b] = t[b][a] = true;
}
int ans = 0;
for (int i = 2; i <= n; i++) {
//友達
if (t[i][1]) {
ans++;
continue;
}
//友達の友達
for (int j = 2; j <= n; j++) {
if (i == j)
continue;
if (t[i][j] && t[j][1]) {
ans++;
}
}
}
cout << ans << endl;
}
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, m;
cin >> n;
if (n == 0)
break;
cin >> m;
bool t[502][502];
for (int i = 1; i <= n; i++) {
fill(t[i] + 1, t[i] + n + 1, false);
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
t[a][b] = t[b][a] = true;
}
int ans = 0;
for (int i = 2; i <= n; i++) {
//友達
if (t[i][1]) {
ans++;
continue;
}
//友達の友達
for (int j = 2; j <= n; j++) {
if (i == j)
continue;
if (t[i][j] && t[j][1]) {
ans++;
break;
}
}
}
cout << ans << endl;
}
}
|
[["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]]
| 1
| 225
|
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toStr(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
const double EPS = 1e-12;
const double PI = acos(-1.0);
const int INF = INT_MAX / 10;
int main() {
int n, m;
while (cin >> n, n) {
vvi isFriend(n, vi(n));
cin >> m;
REP(i, m) {
int a, b;
cin >> a >> b;
isFriend[a - 1][b - 1] = isFriend[b - 1][a - 1] = 1;
}
vi visited(n, 0);
visited[0] = 1;
queue<pii> Q;
Q.push(pii(1, 0));
int ans = 0;
while (!Q.empty()) {
pii p = Q.front();
Q.pop();
if (p.second == 2) {
break;
}
REP(i, n) {
if (!visited[i] && isFriend[p.first][i]) {
ans++;
visited[i] = 1;
Q.push(pii(i, p.second + 1));
}
}
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toStr(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
const double EPS = 1e-12;
const double PI = acos(-1.0);
const int INF = INT_MAX / 10;
int main() {
int n, m;
while (cin >> n, n) {
vvi isFriend(n, vi(n));
cin >> m;
REP(i, m) {
int a, b;
cin >> a >> b;
isFriend[a - 1][b - 1] = isFriend[b - 1][a - 1] = 1;
}
vi visited(n, 0);
visited[0] = 1;
queue<pii> Q;
Q.push(pii(0, 0));
int ans = 0;
while (!Q.empty()) {
pii p = Q.front();
Q.pop();
if (p.second == 2) {
break;
}
REP(i, n) {
if (!visited[i] && isFriend[p.first][i]) {
ans++;
visited[i] = 1;
Q.push(pii(i, p.second + 1));
}
}
}
cout << ans << endl;
}
return 0;
}
|
[["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13]]
| 1
| 403
|
while True:
n = int(input())
m = int(input())
if n==0: break
tab = [[] for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
tab[a].append(b)
tab[b].append(a)
ans = set(tab[0])
foff = set()
for i in ans:
foff = foff | set(tab[i])
print(len((ans|foff)-{1}))
|
while True:
n = int(input())
m = int(input())
if n==0: break
tab = [[] for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
tab[a].append(b)
tab[b].append(a)
ans = set(tab[0])
foff = set()
for i in ans:
foff = foff | set(tab[i])
print(len((ans|foff)-{0}))
|
[["-", 0, 652, 3, 4, 0, 657, 12, 282, 0, 612], ["+", 0, 652, 3, 4, 0, 657, 12, 282, 0, 612]]
| 5
| 131
|
while True:
n = int(input()); m = int(input());
if n==0 and m==0: break
e = [[0 for i in range(501)] for j in range(501)]
u = [0]*501; ans = 0;
for i in range(m):
f,t = list(map(int, input().split()))
e[f][t] = e[t][f] = 1
for i in range(2,n):
if e[1][i]==1:
if u[i]==0: ans+=1
u[i] = 1
for j in range(2,n):
if e[i][j]==1 and u[j]==0:
ans+=1; u[j] = 1;
print(str(ans))
|
while True:
n = int(input()); m = int(input());
if n==0 and m==0: break
e = [[0 for i in range(501)] for j in range(501)]
u = [0]*501; ans = 0;
for i in range(m):
f,t = list(map(int, input().split()))
e[f][t] = e[t][f] = 1
for i in range(2,n+1):
if e[1][i]==1:
if u[i]==0: ans+=1
u[i] = 1
for j in range(2,n+1):
if e[i][j]==1 and u[j]==0:
ans+=1; u[j] = 1;
print(str(ans))
|
[["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]]
| 5
| 192
|
import sys
import itertools
readline = sys.stdin.readline
while True:
N = int(readline())
M = int(readline())
if N == 0 and M == 0:
break
pairs = set()
for _ in range(M):
a, b = tuple(int(x) for x in readline().split())
pairs.add((a, b))
pairs.add((b, a))
cnt = 0
for i in range(2, N + 1):
if (1, i) in pairs:
cnt += 1
else:
for j in range(2, N + 1):
if (1, j) in pairs and (j, i) in pairs:
cnt += 1
print(cnt)
|
import sys
import itertools
readline = sys.stdin.readline
while True:
N = int(readline())
M = int(readline())
if N == 0 and M == 0:
break
pairs = set()
for _ in range(M):
a, b = tuple(int(x) for x in readline().split())
pairs.add((a, b))
pairs.add((b, a))
cnt = 0
for i in range(2, N + 1):
if (1, i) in pairs:
cnt += 1
else:
for j in range(2, N + 1):
if (1, j) in pairs and (j, i) in pairs:
cnt += 1
break
print(cnt)
|
[["+", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94]]
| 5
| 159
|
#include <stdio.h>
#include <string.h>
void addcard(char[], char[], char[], int[], int, int, int, int *);
int main(void) {
char cards[10 * 6000];
char nowcard[10];
char cardkouho[3 * 10];
int cardmaisuu;
int sentakumaisuu;
int cardnokori[10];
int i;
int result;
while (1) {
scanf("%d", &cardmaisuu);
scanf("%d", &sentakumaisuu);
if (cardmaisuu == 0 && sentakumaisuu == 0)
break;
for (i = 0; i < cardmaisuu; i++) {
scanf("%s", &cardkouho[3 * i]);
}
for (i = 0; i < cardmaisuu; i++) {
cardnokori[i] = 1;
}
for (i = 0; i < 60000; i++) {
cards[i] = 0;
}
for (i = 0; i < 10; i++) {
nowcard[i] = 0;
}
result = 0;
addcard(cards, nowcard, cardkouho, cardnokori, 1, sentakumaisuu, cardmaisuu,
&result);
printf("%d", result);
}
return 0;
}
void addcard(char cards[], char nowcard[], char cardkouho[], int cardnokori[],
int nowmaime, int max, int cardkouhomaisuu, int *cardmaisuu) {
int i;
int ii;
int ng;
int cardlen;
for (i = 0; i < cardkouhomaisuu; i++) {
if (cardnokori[i] == 1) {
cardnokori[i] = 0;
cardlen = strlen(nowcard);
strcat(nowcard, &cardkouho[3 * i]);
if (nowmaime < max) {
addcard(cards, nowcard, cardkouho, cardnokori, nowmaime + 1, max,
cardkouhomaisuu, cardmaisuu);
} else {
ng = 0;
for (ii = 0; ii < (*cardmaisuu); ii++) {
if (strcmp(nowcard, &cards[10 * ii]) == 0) {
ng = 1;
break;
}
}
if (ng == 0) {
strcpy(&cards[10 * (*cardmaisuu)], nowcard);
(*cardmaisuu)++;
}
}
nowcard[cardlen] = 0;
cardnokori[i] = 1;
}
}
}
|
#include <stdio.h>
#include <string.h>
void addcard(char[], char[], char[], int[], int, int, int, int *);
int main(void) {
char cards[10 * 6000];
char nowcard[10];
char cardkouho[3 * 10];
int cardmaisuu;
int sentakumaisuu;
int cardnokori[10];
int i;
int result;
while (1) {
scanf("%d", &cardmaisuu);
scanf("%d", &sentakumaisuu);
if (cardmaisuu == 0 && sentakumaisuu == 0)
break;
for (i = 0; i < cardmaisuu; i++) {
scanf("%s", &cardkouho[3 * i]);
}
for (i = 0; i < cardmaisuu; i++) {
cardnokori[i] = 1;
}
for (i = 0; i < 60000; i++) {
cards[i] = 0;
}
for (i = 0; i < 10; i++) {
nowcard[i] = 0;
}
result = 0;
addcard(cards, nowcard, cardkouho, cardnokori, 1, sentakumaisuu, cardmaisuu,
&result);
printf("%d\n", result);
}
return 0;
}
void addcard(char cards[], char nowcard[], char cardkouho[], int cardnokori[],
int nowmaime, int max, int cardkouhomaisuu, int *cardmaisuu) {
int i;
int ii;
int ng;
int cardlen;
for (i = 0; i < cardkouhomaisuu; i++) {
if (cardnokori[i] == 1) {
cardnokori[i] = 0;
cardlen = strlen(nowcard);
strcat(nowcard, &cardkouho[3 * i]);
if (nowmaime < max) {
addcard(cards, nowcard, cardkouho, cardnokori, nowmaime + 1, max,
cardkouhomaisuu, cardmaisuu);
} else {
ng = 0;
for (ii = 0; ii < (*cardmaisuu); ii++) {
if (strcmp(nowcard, &cards[10 * ii]) == 0) {
ng = 1;
break;
}
}
if (ng == 0) {
strcpy(&cards[10 * (*cardmaisuu)], nowcard);
(*cardmaisuu)++;
}
}
nowcard[cardlen] = 0;
cardnokori[i] = 1;
}
}
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 476
|
#include <bits/stdc++.h>
#define LL long long
static const LL INF = 1 << 50;
using namespace std;
int n, k, ans = 1;
vector<string> s;
string num[11];
int t = 0;
void cal(string sum, int depth, int bit) {
if (depth == k) {
s.push_back(sum);
return;
}
for (int i = 1; i <= n; ++i) {
int b = 1 << i;
if (bit & b) {
int k = bit - b;
cal(sum + num[i], depth + 1, k);
}
}
}
int main() {
while (1) {
int p = 1;
t = 0;
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 1; i <= n; ++i) {
p += pow(2, i);
cin >> num[i];
}
cal("", 0, p);
sort(s.begin(), s.end());
for (int i = 1; i < s.size(); ++i) {
if (s[i] != s[i - 1]) {
ans++;
}
}
cout << ans << endl;
ans = 0;
s.clear();
}
}
|
#include <bits/stdc++.h>
#define LL long long
static const LL INF = 1 << 50;
using namespace std;
int n, k, ans = 1;
vector<string> s;
string num[11];
int t = 0;
void cal(string sum, int depth, int bit) {
if (depth == k) {
s.push_back(sum);
return;
}
for (int i = 1; i <= n; ++i) {
int b = 1 << i;
if (bit & b) {
int k = bit - b;
cal(sum + num[i], depth + 1, k);
}
}
}
int main() {
while (1) {
int p = 1;
t = 0;
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 1; i <= n; ++i) {
p += pow(2, i);
cin >> num[i];
}
cal("", 0, p);
sort(s.begin(), s.end());
for (int i = 1; i < s.size(); ++i) {
if (s[i] != s[i - 1]) {
ans++;
}
}
cout << ans << endl;
ans = 1;
s.clear();
}
}
|
[["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13]]
| 1
| 280
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, sum;
cin >> a >> b >> c >> d;
sum = a + b + c + d;
int m = sum / 60;
int s = sum % 60;
cout << m << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, sum;
cin >> a >> b >> c >> d;
sum = a + b + c + d;
int m = sum / 60;
int s = sum % 60;
cout << m << endl;
cout << s << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]]
| 1
| 68
|
#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 <vector>
#define INF 2000000000
using namespace std;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
#define ll long long
#define PL pair<long long, long long>
#define P pair<int, int>
#define mk make_pair
#define en endl;
#define WHITE 0
#define BLACK 2
#define GRAY 1
#define RE return 0;
#define HERE \
cout << " " \
<< "HERE" << en
int main() {
int sum = 0;
for (int i = 0; i < 4; i++) {
int s;
cin >> s;
sum += s;
}
int x = sum / 60;
sum %= 60;
int y = sum;
cout << x << y << en
}
|
#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 <vector>
#define INF 2000000000
using namespace std;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
#define ll long long
#define PL pair<long long, long long>
#define P pair<int, int>
#define mk make_pair
#define en endl;
#define WHITE 0
#define BLACK 2
#define GRAY 1
#define RE return 0;
#define HERE \
cout << " " \
<< "HERE" << en
int main() {
int sum = 0;
for (int i = 0; i < 4; i++) {
int s;
cin >> s;
sum += s;
}
int x = sum / 60;
sum %= 60;
int y = sum;
cout << x << endl << y << en
}
|
[["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]]
| 1
| 167
|
#include <cstdio>
int a, b, c, d;
main() {
scanf("%d%d%d%d", &a, &b, &c, &d);
printf("%d %d\n", (a + b + c + d) / 60, (a + b + c + d) % 60);
}
|
#include <cstdio>
int a, b, c, d;
main() {
scanf("%d%d%d%d", &a, &b, &c, &d);
printf("%d\n%d\n", (a + b + c + d) / 60, (a + b + c + d) % 60);
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 67
|
#include <iostream>
using namespace std;
int main() {
int n;
int sum = 0;
while (cin >> n)
sum += n;
cout << sum / 60 << " " << sum % 60 << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
int sum = 0;
while (cin >> n)
sum += n;
cout << sum / 60 << endl << sum % 60 << endl;
return 0;
}
|
[["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22]]
| 1
| 49
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
int c;
cin >> c;
int d;
cin >> d;
int e;
e = a + b + c + d;
int f;
f = 0;
while (e >= 60) {
f = f + 1;
e = e - 60;
}
cout << e << endl;
cout << f << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
int c;
cin >> c;
int d;
cin >> d;
int e;
e = a + b + c + d;
int f;
f = 0;
while (e >= 60) {
f = f + 1;
e = e - 60;
}
cout << f << endl;
cout << e << endl;
}
|
[["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]]
| 1
| 94
|
#include <cstdio>
int main() {
int sum = 0;
for (int i = 0; i < 4; ++i) {
int t;
scanf("%d", &t);
sum += t;
}
printf("%d %d\n", sum / 60, sum % 60);
return 0;
}
|
#include <cstdio>
int main() {
int sum = 0;
for (int i = 0; i < 4; ++i) {
int t;
scanf("%d", &t);
sum += t;
}
printf("%d\n%d\n", sum / 60, sum % 60);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 65
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a = 0, b, c;
for (int i = 0; i < 4; i++) {
cin >> b;
a += b;
}
printf("%d\n", a / 60);
a -= a / 60;
printf("%d\n", a / 60);
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a = 0, b, c;
for (int i = 0; i < 4; i++) {
cin >> b;
a += b;
}
printf("%d\n", a / 60);
a -= a / 60 * 60;
printf("%d\n", a);
return 0;
}
|
[["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 85], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 84
|
#include <cctype>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
using namespace std;
int main(int argc, char const *argv[]) {
int time = 0;
int tmp;
for (int i = 0; i < 4; i++) {
cin >> tmp;
time += time;
}
cout << time / 60 << endl;
cout << time % 60 << endl;
return 0;
}
|
#include <cctype>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
using namespace std;
int main(int argc, char const *argv[]) {
int time = 0;
int tmp;
for (int i = 0; i < 4; i++) {
cin >> tmp;
time += tmp;
}
cout << time / 60 << endl;
cout << time % 60 << endl;
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22]]
| 1
| 80
|
#include <stdio.h>
int main(void) {
int x, y, sum;
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
sum = a + b + c + d;
x = 0;
while (sum > 60) {
sum = sum - 60;
x++;
}
y = sum;
printf("%d\n%d\n", x, y);
return 0;
}
|
#include <stdio.h>
int main(void) {
int x, y, sum;
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
sum = a + b + c + d;
x = 0;
while (sum >= 60) {
sum = sum - 60;
x++;
}
y = sum;
printf("%d\n%d\n", x, y);
return 0;
}
|
[["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20]]
| 1
| 96
|
#include <iostream>
using namespace std;
int main() {
int n = 0, m;
for (int i = 0; i < 4; i++) {
cin >> m;
n += m;
}
cout << n / 60 << n % 60 << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n = 0, m;
for (int i = 0; i < 4; i++) {
cin >> m;
n += m;
}
cout << n / 60 << endl << n % 60 << endl;
return 0;
}
|
[["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]]
| 1
| 58
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, ans = 0;
for (int i = 0; i < 4; i++) {
cin >> a;
ans += a;
}
cout << ans / 60 << ans - (ans / 60 * 60) << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, ans = 0;
for (int i = 0; i < 4; i++) {
cin >> a;
ans += a;
}
cout << ans / 60 << endl << ans - (ans / 60 * 60) << endl;
return 0;
}
|
[["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]]
| 1
| 66
|
#include <stdio.h>
#include <string.h>
int main() {
char ch[21];
char ring[21];
int n, i, j, count = 0;
scanf("%s\n%d\n", &ch, &n);
for (i = 0; i < n; i++) {
scanf("%s\n", &ring);
for (j = 0; j < 10; j++) {
ring[10 + j] = ring[j];
}
ring[10 + j] = '\0';
if (strstr(ch, ring))
count++;
}
printf("%d\n", count);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main() {
char ch[21];
char ring[21];
int n, i, j, count = 0;
scanf("%s\n%d\n", &ch, &n);
for (i = 0; i < n; i++) {
scanf("%s\n", &ring);
for (j = 0; j < 10; j++) {
ring[10 + j] = ring[j];
}
ring[10 + j] = '\0';
if (strstr(ring, ch))
count++;
}
printf("%d\n", count);
return 0;
}
|
[["-", 0, 57, 15, 23, 0, 2, 3, 4, 0, 22], ["-", 0, 57, 15, 23, 0, 2, 3, 4, 0, 21], ["+", 0, 57, 15, 23, 0, 2, 3, 4, 0, 21], ["+", 0, 57, 15, 23, 0, 2, 3, 4, 0, 22]]
| 0
| 138
|
#include <stdio.h>
#include <string.h>
int main() {
int n, i, j, k, res = 0;
char search[20], ring[20];
scanf("%s", search);
scanf("%d\n", &n);
res = n;
for (i = 0; i < n; i++) {
scanf("%s", ring);
int found = 0;
for (j = 0; j < 10 && found == 0; j++) {
found = 1;
for (k = 0; k < strlen(search); k++) {
if (search[k] != ring[(j + k) % 10]) {
found = 0;
break;
}
}
}
if (found == 1)
res++;
}
printf("%d\n", res);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main() {
int n, i, j, k, res = 0;
char search[20], ring[20];
scanf("%s", search);
scanf("%d\n", &n);
res = 0;
for (i = 0; i < n; i++) {
scanf("%s", ring);
int found = 0;
for (j = 0; j < 10 && found == 0; j++) {
found = 1;
for (k = 0; k < strlen(search); k++) {
if (search[k] != ring[(j + k) % 10]) {
found = 0;
break;
}
}
}
if (found == 1)
res++;
}
printf("%d\n", res);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]]
| 0
| 176
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n;
cin >> n;
int co = 0;
int c = 0;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
str += str;
for (int j = 0; j < 10; j++) {
string a;
a.assign(str, j, (int)s.size());
if (a == s)
co++;
}
if (co != 0)
c++;
}
cout << c << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n;
cin >> n;
int co = 0;
int c = 0;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
str += str;
for (int j = 0; j < 10; j++) {
string a;
a.assign(str, j, (int)s.size());
if (a == s)
co++;
}
if (co != 0)
c++;
co = 0;
}
cout << c << endl;
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]]
| 1
| 129
|
#include <stdio.h>
#include <string.h>
int main(void) {
int n, i, j;
int cnt;
char a[10], m[20], b[10];
cnt = 0;
scanf("%s %d", a, &n);
for (i = 0; i < n; i++) {
scanf("%s", m);
strcpy(b, m);
strcat(m, b);
if (strstr(m, a)) {
cnt++;
}
printf("%d\n", cnt);
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main(void) {
int n, i, j;
int cnt;
char a[11], m[21], b[11];
cnt = 0;
scanf("%s %d", a, &n);
for (i = 0; i < n; i++) {
scanf("%s", m);
strcpy(b, m);
strcat(m, b);
if (strstr(m, a)) {
cnt++;
}
}
printf("%d\n", cnt);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 118
|
#include <iostream>
#include <string>
#pragma warning(disable : 4996)
using namespace std;
int main() {
string s1, s2;
int n, cnt = 0;
cin >> s1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s2;
s2 += s2;
for (int j = 0; j < s2.size() / 2; j++) {
if (s2.substr(j, s1.size()) == s1) {
cnt++;
}
}
}
cout << cnt << endl;
return 0;
}
|
#include <iostream>
#include <string>
#pragma warning(disable : 4996)
using namespace std;
int main() {
string s1, s2;
int n, cnt = 0;
cin >> s1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s2;
s2 += s2;
for (int j = 0; j < s2.size() / 2; j++) {
if (s2.substr(j, s1.size()) == s1) {
cnt++;
break;
}
}
}
cout << cnt << endl;
return 0;
}
|
[["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]]
| 1
| 113
|
#include <iostream>
using namespace std;
int main() {
string x;
int n, y = 0;
cin >> x >> n;
for (int i = 2; i < (n + 2); i++) {
string s;
cin >> s;
if (s.find(x) <= 10) {
y++;
}
}
cout << y << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
string x;
int n, y = 0;
cin >> x >> n;
for (int i = 2; i < (n + 2); i++) {
string s;
cin >> s;
s = s + s;
if (s.find(x) <= 10) {
y++;
}
}
cout << y << endl;
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]]
| 1
| 80
|
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
#define INF (1 << 29)
using namespace std;
typedef long long ll;
int main() {
string s;
int n;
int cnt = 0;
cin >> s;
cin >> n;
REP(i, n) {
string t;
cin >> t;
t += t;
REP(i, t.size() - s.size()) {
if (t[i] == s[0]) {
bool f = true;
REP(j, s.size()) {
if (t[i + j] != s[j])
f = false;
}
if (f)
cnt++;
}
}
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
#define INF (1 << 29)
using namespace std;
typedef long long ll;
int main() {
string s;
int n;
int cnt = 0;
cin >> s;
cin >> n;
REP(i, n) {
string t;
cin >> t;
t += t;
REP(i, t.size() - s.size()) {
if (t[i] == s[0]) {
bool f = true;
REP(j, s.size()) {
if (t[i + j] != s[j])
f = false;
}
if (f) {
cnt++;
break;
}
}
}
}
cout << cnt << endl;
}
|
[["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["+", 64, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 64, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 154
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
int main() {
int n, a, cut = 0;
string ring, f;
cin >> f >> n;
for (int i = 0; i < n; i++) {
a = 0;
cin >> ring;
int a = ring.find(f);
if (a >= 0)
cut++;
}
cout << cut << endl;
return 0;
}
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
int main() {
int n, a, cut = 0;
string ring, f;
cin >> f >> n;
for (int i = 0; i < n; i++) {
a = 0;
cin >> ring;
ring += ring;
int a = ring.find(f);
if (a >= 0)
cut++;
}
cout << cut << endl;
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]]
| 1
| 96
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0, l, jud = 0;
string s;
cin >> s;
cin >> n;
l = s.size();
for (int i = 1; i <= n; i++) {
string t;
cin >> t;
t += t;
int a = 0;
for (int k = 0; k <= t.size(); k++) {
if (s[0] == t[k]) {
for (int b = 1; b <= l - 1; b++) {
if (s[b] != t[k + b]) {
jud = -1;
break;
}
}
}
if (jud == 0) {
count++;
break;
}
jud = 0;
}
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0, l, jud = 0;
string s;
cin >> s;
cin >> n;
l = s.size();
for (int i = 1; i <= n; i++) {
string t;
cin >> t;
t += t;
int a = 0;
for (int k = 0; k <= t.size(); k++) {
if (s[0] == t[k]) {
for (int b = 1; b <= l - 1; b++) {
if (s[b] != t[k + b]) {
jud = -1;
break;
}
}
if (jud == 0) {
count++;
break;
}
jud = 0;
}
}
}
cout << count << endl;
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 176
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string A, S, T;
int P = 0;
int n;
cin >> A;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S;
T = S + S;
for (int j = 0; j < n; j++) {
if (T.substr(j, A.length()) == A) {
P++;
break;
}
}
}
cout << P << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string A, S, T;
int P = 0;
int n;
cin >> A;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S;
T = S + S;
for (int j = 0; j < 10; j++) {
if (T.substr(j, A.length()) == A) {
P++;
break;
}
}
}
cout << P << endl;
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 112
|
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
int main(void) {
char str[11], ring[100][11];
int number, str_len;
scanf("%s", str);
str_len = strlen(str);
scanf("%d", &number);
for (int i = 0; i < number; i++) {
scanf("%s", ring[i]);
}
int ring_count = 0, ring_len;
for (int i = 0; i < number; i++) {
ring_len = strlen(ring[i]);
for (int j = 0; j < ring_len; j++) {
if (ring[i][j] == str[0]) {
bool success = true;
int point = 0;
for (int k = 1; k < str_len; k++) {
if (j + k < ring_len) {
if (ring[i][j + k] != str[k]) {
success = false;
break;
}
} else {
if (ring[i][point] != str[k]) {
success = false;
break;
}
}
point++;
}
if (success == true) {
ring_count++;
break;
}
}
}
}
printf("%d\n", ring_count);
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
int main(void) {
char str[11], ring[100][11];
int number, str_len;
scanf("%s", str);
str_len = strlen(str);
scanf("%d", &number);
for (int i = 0; i < number; i++) {
scanf("%s", ring[i]);
}
int ring_count = 0, ring_len;
for (int i = 0; i < number; i++) {
ring_len = strlen(ring[i]);
for (int j = 0; j < ring_len; j++) {
if (ring[i][j] == str[0]) {
bool success = true;
int point = 0;
for (int k = 1; k < str_len; k++) {
if (j + k < ring_len) {
if (ring[i][j + k] != str[k]) {
success = false;
break;
}
} else {
if (ring[i][point] != str[k]) {
success = false;
break;
}
point++;
}
}
if (success == true) {
ring_count++;
break;
}
}
}
}
printf("%d\n", ring_count);
return 0;
}
|
[["-", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]]
| 1
| 268
|
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int ringCount = 0;
int findCount = 0;
char targetStr[11];
char tempRing[11];
int targetStringLength;
int tempStringLength;
bool isSame = true;
cin >> targetStr >> ringCount;
targetStringLength = strlen(targetStr);
for (int i = 0; i < ringCount; i++) {
cin >> tempRing;
tempStringLength = strlen(tempRing);
isSame = true;
for (int j = 0; j < tempStringLength; j++) {
for (int k = 0; k < targetStringLength; k++) {
if (targetStr[k] != tempRing[(j + k) % tempStringLength]) {
isSame = false;
break;
}
}
if (isSame) {
findCount++;
break;
}
}
}
cout << findCount << '\n';
return 0;
}
|
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int ringCount = 0;
int findCount = 0;
char targetStr[11];
char tempRing[11];
int targetStringLength;
int tempStringLength;
bool isSame = true;
cin >> targetStr >> ringCount;
targetStringLength = strlen(targetStr);
for (int i = 0; i < ringCount; i++) {
cin >> tempRing;
tempStringLength = strlen(tempRing);
isSame = true;
for (int j = 0; j < tempStringLength; j++) {
isSame = true;
for (int k = 0; k < targetStringLength; k++) {
if (targetStr[k] != tempRing[(j + k) % tempStringLength]) {
isSame = false;
break;
}
}
if (isSame) {
findCount++;
break;
}
}
}
cout << findCount << '\n';
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 146], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]]
| 1
| 171
|
#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 main() {
string st;
cin >> st;
int N;
cin >> N;
int ans = 0;
for (int i = 0; i < N; ++i) {
string ring;
cin >> ring;
if (ring.find(st) != string::npos)
ans++;
}
cout << ans << endl;
return 0;
}
|
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt"
int main() {
string st;
cin >> st;
int N;
cin >> N;
int ans = 0;
for (int i = 0; i < N; ++i) {
string ring;
cin >> ring;
ring += ring;
if (ring.find(st) != string::npos)
ans++;
}
cout << ans << endl;
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]]
| 1
| 117
|
#include <bits/stdc++.h>
using namespace std;
#define Rep(i, N) for (int i = 0; i < N; i++)
int main() {
string w, s;
int N;
cin >> N;
int cnt = 0;
Rep(i, N) {
cin >> s;
s += s;
cnt += s.find(w) != string::npos;
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define Rep(i, N) for (int i = 0; i < N; i++)
int main() {
string w, s;
int N;
cin >> w >> N;
int cnt = 0;
Rep(i, N) {
cin >> s;
s += s;
cnt += s.find(w) != string::npos;
}
cout << cnt << endl;
return 0;
}
|
[["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152]]
| 1
| 75
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s, t;
int n, c = 0;
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> t;
if ((s + s).find(t) != string::npos)
c++;
}
cout << c << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s, t;
int n, c = 0;
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> t;
if ((t + t).find(s) != string::npos)
c++;
}
cout << c << endl;
return 0;
}
|
[["-", 31, 2, 63, 118, 28, 23, 0, 16, 31, 22], ["+", 31, 2, 63, 118, 28, 23, 0, 16, 31, 22], ["-", 31, 2, 63, 118, 28, 23, 0, 16, 12, 22], ["+", 31, 2, 63, 118, 28, 23, 0, 16, 12, 22], ["-", 15, 339, 51, 16, 31, 2, 3, 4, 0, 22], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 22]]
| 1
| 81
|
#include <stdio.h>
#include <string.h>
int main() {
char a[100], b[100], str[100];
int i, j, cnt = 0, n;
scanf("%s", str);
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", a);
strcpy(a, a);
if (strstr(b, str) != 0) {
cnt++;
}
}
printf("%d\n", cnt);
}
|
#include <stdio.h>
#include <string.h>
int main() {
char a[100], b[100], str[100];
int i, j, cnt = 0, n;
scanf("%s", str);
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", a);
strcat(a, a);
if (strstr(a, str) != 0) {
cnt++;
}
}
printf("%d\n", cnt);
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 15, 339, 51, 16, 31, 2, 3, 4, 0, 22], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 22]]
| 1
| 113
|
#include <iostream>
using namespace std;
#include <string.h>
int main() {
int c = 0, i, n;
char a[10], b[10], z[100];
cin >> a >> n;
for (i = 0; i <= n; i++) {
cin >> b;
strcpy(z, b);
strcat(z, b);
if (strstr(z, a))
c++;
}
cout << c << endl;
return 0;
}
|
#include <iostream>
using namespace std;
#include <string.h>
int main() {
int c = 0, i, n;
char a[10], b[10], z[100];
cin >> a >> n;
for (i = 0; i < n; i++) {
cin >> b;
strcpy(z, b);
strcat(z, b);
if (strstr(z, a))
c++;
}
cout << c << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]]
| 1
| 99
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, f;
int n;
cin >> s >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> f;
f += f;
for (int j = 0; j < f.size() - s.size(); j++) {
if (f.substr(j, s.size()) == s) {
ans++;
}
}
}
cout << ans << endl;
}
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, f;
int n;
cin >> s >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> f;
f += f;
for (int j = 0; j < f.size() - s.size(); j++) {
if (f.substr(j, s.size()) == s) {
ans++;
break;
}
}
}
cout << ans << endl;
}
|
[["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]]
| 1
| 121
|
#include <stdio.h>
#include <string.h>
int main() {
char t[11], s[11], b[11];
int n, r;
scanf("%s%d", t, &n);
for (int i = 0; i < n; i++) {
scanf("%s", s);
for (int j = 0; j < 10; j++) {
b[0] = s[9];
for (int k = 0; k < 9; k++) {
b[k + 1] = s[k];
}
strcpy(s, b);
if (strncmp(s, t, strlen(t)) == 0) {
r++;
}
}
}
printf("%d\n", r);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main() {
char t[11], s[11], b[11];
int n, r = 0;
scanf("%s%d", t, &n);
for (int i = 0; i < n; i++) {
scanf("%s", s);
for (int j = 0; j < 10; j++) {
b[0] = s[9];
for (int k = 0; k < 9; k++) {
b[k + 1] = s[k];
}
strcpy(s, b);
if (strncmp(s, t, strlen(t)) == 0) {
r++;
break;
}
}
}
printf("%d\n", r);
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]]
| 1
| 163
|
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
char S[15], T[15];
cin >> S;
int n, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
char TS[30];
cin >> TS;
strcpy(T, TS);
strcat(TS, T);
if ((strstr(S, TS) == NULL)) {
sum++;
}
}
cout << sum << endl;
}
|
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
char S[15], T[15];
cin >> S;
int n, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
char TS[30];
cin >> TS;
strcpy(T, TS);
strcat(TS, T);
if (!(strstr(TS, S) == NULL)) {
sum++;
}
}
cout << sum << endl;
}
|
[["+", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111], ["-", 51, 23, 0, 16, 31, 2, 3, 4, 0, 22], ["-", 51, 23, 0, 16, 31, 2, 3, 4, 0, 21], ["+", 28, 23, 0, 16, 31, 2, 3, 4, 0, 21], ["+", 28, 23, 0, 16, 31, 2, 3, 4, 0, 22]]
| 1
| 106
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string findStr;
int n;
cin >> findStr;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
// ツ開ツ始ツ地ツ点ツづーツづつアツづ可つキツづゥツつゥ
for (int j = 0; j < str.size(); j++) {
// ツ各ツ閉カツ篠堋づ可づつつ「ツづづ敖づつ「ツつュ
bool f = false;
for (int k = 0; k < findStr.size(); k++) {
if (findStr[k] != str[(k + j) % str.size()]) {
f = true;
break;
}
}
if (!f) {
cnt++;
}
}
}
cout << cnt << endl;
int x;
cin >> x;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string findStr;
int n;
cin >> findStr;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
// ツ開ツ始ツ地ツ点ツづーツづつアツづ可つキツづゥツつゥ
for (int j = 0; j < str.size(); j++) {
// ツ各ツ閉カツ篠堋づ可づつつ「ツづづ敖づつ「ツつュ
bool f = false;
for (int k = 0; k < findStr.size(); k++) {
if (findStr[k] != str[(k + j) % str.size()]) {
f = true;
break;
}
}
if (!f) {
cnt++;
break;
}
}
}
cout << cnt << endl;
int x;
cin >> x;
return 0;
}
|
[["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]]
| 1
| 163
|
#include <iostream>
#include <string>
typedef unsigned long long ull;
const ull B = 100000007;
using namespace std;
int RabinKarp(string, string);
int main(void) {
string a, b;
int n, count = 0;
getline(cin, a);
cin >> n;
cin.ignore();
for (int i = 0; i < n; i++) {
getline(cin, b);
count += RabinKarp(a, b);
}
cout << count << endl;
return 0;
}
int RabinKarp(string a, string b) {
int al = a.size(), bl = b.size();
ull t = 1;
for (int i = 0; i < al; i++)
t *= B;
ull ah = 0, bh = 0;
for (int i = 0; i < al; i++) {
ah = ah * B + a[i];
bh = bh * B + b[i];
}
for (int i = 0; i + al <= bl; i++) {
if (ah == bh)
return 1;
if (i + al < bl)
bh = bh * B + b[i + al] - b[i] * t;
}
return 0;
}
|
#include <iostream>
#include <string>
typedef unsigned long long ull;
const ull B = 100000007;
using namespace std;
int RabinKarp(string, string);
int main(void) {
string a, b;
int n, count = 0;
getline(cin, a);
cin >> n;
cin.ignore();
for (int i = 0; i < n; i++) {
getline(cin, b);
b += b;
count += RabinKarp(a, b);
}
cout << count << endl;
return 0;
}
int RabinKarp(string a, string b) {
int al = a.size(), bl = b.size();
ull t = 1;
for (int i = 0; i < al; i++)
t *= B;
ull ah = 0, bh = 0;
for (int i = 0; i < al; i++) {
ah = ah * B + a[i];
bh = bh * B + b[i];
}
for (int i = 0; i + al <= bl; i++) {
if (ah == bh)
return 1;
if (i + al < bl)
bh = bh * B + b[i + al] - b[i] * t;
}
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]]
| 1
| 261
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string lookingfor;
string ring;
int ans = 0;
int n;
cin >> lookingfor;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ring;
if (ring.find(lookingfor, 0) != string::npos)
ans++;
}
cout << ans << endl;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string lookingfor;
string ring;
int ans = 0;
int n;
cin >> lookingfor;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ring;
ring += ring;
if (ring.find(lookingfor, 0) != string::npos)
ans++;
}
cout << ans << endl;
}
|
[["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]]
| 1
| 80
|
str=gets.chomp
n=gets.chomp.to_i
count=0
n.times do
str2=gets.chomp
if str2.include?(str)
count+=1
end
end
p count
|
str=gets.chomp
n=gets.chomp.to_i
count=0
n.times do
str2=gets.chomp
if (str2+str2).include?(str)
count+=1
end
end
p count
|
[["+", 8, 736, 0, 121, 15, 652, 486, 739, 0, 24], ["+", 0, 121, 15, 652, 486, 739, 0, 738, 31, 22], ["+", 0, 121, 15, 652, 486, 739, 0, 738, 17, 72], ["+", 8, 736, 0, 121, 15, 652, 486, 739, 0, 25]]
| 4
| 38
|
target_str = gets.strip.to_s
N = gets.to_i
count = 0
N.times do |i|
str = gets..strip.to_s
if (str+str).index(target_str)
count += 1
end
end
p count
|
target_str = gets.strip.to_s
N = gets.to_i
count = 0
N.times do |i|
str = gets.strip.to_s
if (str+str).index(target_str)
count += 1
end
end
p count
|
[["-", 196, 737, 8, 736, 0, 662, 12, 475, 17, 757], ["+", 8, 736, 0, 662, 12, 652, 486, 652, 17, 131]]
| 4
| 47
|
s = input()
n = eval(input())
ans = 0
for i in range(n):
t = input()
t2 = t+t
for j in range(len(t)):
if s==t[j:j+len(s)]:
ans += 1
break
print(ans)
|
s = input()
n = eval(input())
ans = 0
for i in range(n):
t = input()
t2 = t+t
for j in range(len(t)):
if s==t2[j:j+len(s)]:
ans += 1
break
print(ans)
|
[["-", 8, 196, 0, 57, 15, 666, 0, 206, 51, 22], ["+", 8, 196, 0, 57, 15, 666, 0, 206, 51, 22]]
| 5
| 68
|
s=input()
print(sum(len(2*input().split(s))>1 for _ in range(int(input()))))
|
s=input()
print(sum(len((2*input()).split(s))>1 for _ in range(int(input()))))
|
[["+", 3, 4, 0, 652, 63, 319, 500, 23, 0, 24], ["+", 500, 23, 0, 657, 12, 652, 3, 4, 0, 25]]
| 5
| 38
|
import sys
R = lambda:list(map(int,input().split()))
s = input()
l = len(s)
#print s, l
n = int(input())
neko = 0
for i in range(n):
ring = input()
#print ring
rings = ring + ring
#print rings
for i in range(len(ring)):
cc = []
for j in range(l):
cc.append(rings[i+j])
zgok = "".join(cc)
#print zgok
if zgok == s:
neko += 1
print(neko)
|
import sys
R = lambda:list(map(int,input().split()))
s = input()
l = len(s)
#print s, l
n = int(input())
neko = 0
for i in range(n):
ring = input()
#print ring
rings = ring + ring
#print rings
for i in range(len(ring)):
cc = []
for j in range(l):
cc.append(rings[i+j])
zgok = "".join(cc)
#print zgok
if zgok == s:
neko += 1
break
print(neko)
|
[["+", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94]]
| 5
| 120
|
#!/usr/bin/ruby
while(n=gets.to_i)>0
k=gets.to_i
h={}
n.times.map{gets.chomp}.permutation(k){|a|h[a]=1}
p h.size
end
|
while(n=gets.to_i)>0
k=gets.to_i
h={}
n.times.map{gets.chomp}.permutation(k){|a|h[a*'']=1}
p h.size
end
|
[["+", 8, 734, 0, 662, 31, 742, 0, 738, 17, 48], ["+", 0, 662, 31, 742, 0, 738, 12, 557, 0, 62]]
| 4
| 51
|
from itertools import permutations as P
import sys
r=sys.stdin.readline
for e in iter(r,'0\n'):
n,k=int(e),int(r())
C=[r()for _ in[0]*n]
print(len(set(''.join(s)for s in P(C,k))))
|
from itertools import permutations as P
import sys
r=sys.stdin.readline
for e in iter(r,'0\n'):
n,k=int(e),int(r())
C=[r()[:-1]for _ in[0]*n]
print(len(set(''.join(s)for s in P(C,k))))
|
[["+", 0, 1, 0, 662, 12, 658, 8, 206, 0, 70], ["+", 0, 662, 12, 658, 8, 206, 206, 663, 0, 102], ["+", 12, 658, 8, 206, 206, 663, 0, 664, 17, 33], ["+", 12, 658, 8, 206, 206, 663, 0, 664, 28, 612], ["+", 0, 1, 0, 662, 12, 658, 8, 206, 0, 73]]
| 5
| 83
|
#include <stdio.h>
int nx, ny, mem0[101][101], mem1[101][101];
int b(int, int, int);
int b(int x, int y, int xy) {
if (xy == 0 && mem0[x][y] != 0)
return mem0[x][y];
else if (xy == 1 && mem1[x][y] != 0)
return mem1[x][y];
if (x == nx && y == ny)
return 1;
else if (x > nx || y > ny)
return 0;
int res = 0;
if (x == 1 && y == 1) {
res += b(x + 1, y, 0) + b(x, y + 1, 1);
} else if (xy == 0) {
if (x == nx && y + 1 == ny)
return 1;
res += b(x + 1, y, 0) + b(x, y + 2, 1);
} else if (xy == 1) {
if (x + 1 == nx && y == ny)
return 1;
res += b(x + 2, y, 0) + b(x, y + 1, 1);
} else
printf(" [e]\n");
if (xy == 0)
return mem0[x][y] = res % 100000;
else if (xy == 1)
return mem1[x][y] = res % 100000;
}
int main() {
int p, k;
nx = 15, ny = 15;
while (1) {
scanf("%d%d", &nx, &ny);
if (!(nx + ny))
break;
for (p = 0; p < 103; p++) {
for (k = 0; k < 103; k++) {
mem0[p][k] = 0;
mem1[p][k] = 0;
}
}
printf("%d\n", b(1, 1, 0) % 100000);
}
return 0;
}
|
#include <stdio.h>
int nx, ny, mem0[101][101], mem1[101][101];
int b(int, int, int);
int b(int x, int y, int xy) {
if (xy == 0 && mem0[x][y] != 0)
return mem0[x][y];
else if (xy == 1 && mem1[x][y] != 0)
return mem1[x][y];
if (x == nx && y == ny)
return 1;
else if (x > nx || y > ny)
return 0;
int res = 0;
if (x == 1 && y == 1) {
res += b(x + 1, y, 0) + b(x, y + 1, 1);
} else if (xy == 0) {
if (x == nx && y + 1 == ny)
return 1;
res += b(x + 1, y, 0) + b(x, y + 2, 1);
} else if (xy == 1) {
if (x + 1 == nx && y == ny)
return 1;
res += b(x + 2, y, 0) + b(x, y + 1, 1);
} else
printf(" [e]\n");
if (xy == 0)
return mem0[x][y] = res % 100000;
else if (xy == 1)
return mem1[x][y] = res % 100000;
}
int main() {
int p, k;
nx = 15, ny = 15;
while (1) {
scanf("%d%d", &nx, &ny);
if (!(nx + ny))
break;
for (p = 0; p < 101; p++) {
for (k = 0; k < 101; k++) {
mem0[p][k] = 0;
mem1[p][k] = 0;
}
}
printf("%d\n", b(1, 1, 0) % 100000);
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 431
|
#include <stdio.h>
#define MOD 100000
struct DP {
int up, right, tup, tright, way;
} dp[100][100];
int main() {
int i, j = 0;
for (i = 0; i <= 100; i++) {
for (j = 0; j <= 100; j++) {
if (i == 0 || j == 0) {
dp[i][j].up = 0;
dp[i][j].right = 0;
dp[i][j].tup = 0;
dp[i][j].tright = 0;
dp[i][j].way = 0;
} else if (i == 1 && j == 1) {
dp[i][j].up = 1;
dp[i][j].right = 1;
dp[i][j].tup = 0;
dp[i][j].tright = 0;
dp[i][j].way = 1;
} else {
dp[i][j].right = (dp[i - 1][j].tright + dp[i - 1][j].right) % MOD;
dp[i][j].up = (dp[i][j - 1].tup + dp[i][j - 1].up) % MOD;
dp[i][j].tright = (dp[i][j - 1].up) % MOD;
dp[i][j].tup = (dp[i - 1][j].right) % MOD;
dp[i][j].way = (dp[i][j].right + dp[i][j].up) % MOD;
}
}
}
while (1) {
scanf("%d%d", &i, &j);
if (i == 0 && j == 0)
return 0;
printf("%d\n", dp[i][j].way);
}
}
|
#include <stdio.h>
#define MOD 100000
struct DP {
int up, right, tup, tright, way;
} dp[101][101];
int main() {
int i, j = 0;
for (i = 0; i <= 100; i++) {
for (j = 0; j <= 100; j++) {
if (i == 0 || j == 0) {
dp[i][j].up = 0;
dp[i][j].right = 0;
dp[i][j].tup = 0;
dp[i][j].tright = 0;
dp[i][j].way = 0;
} else if (i == 1 && j == 1) {
dp[i][j].up = 1;
dp[i][j].right = 1;
dp[i][j].tup = 0;
dp[i][j].tright = 0;
dp[i][j].way = 1;
} else {
dp[i][j].right = (dp[i - 1][j].tright + dp[i - 1][j].right) % MOD;
dp[i][j].up = (dp[i][j - 1].tup + dp[i][j - 1].up) % MOD;
dp[i][j].tright = (dp[i][j - 1].up) % MOD;
dp[i][j].tup = (dp[i - 1][j].right) % MOD;
dp[i][j].way = (dp[i][j].right + dp[i][j].up) % MOD;
}
}
}
while (1) {
scanf("%d%d", &i, &j);
if (i == 0 && j == 0)
return 0;
printf("%d\n", dp[i][j].way);
}
}
|
[["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 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
| 431
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 100000;
int main() {
int w, h;
while (cin >> w >> h, w) {
int dp[110][110][4] = {};
dp[1][0][2] = dp[0][1][3] = 1;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (i > 0) {
(dp[i][j][0] += dp[i - 1][j][0] + dp[i - 1][j][2]) %= mod;
(dp[i][j][2] += dp[i - 1][j][1]) %= mod;
}
if (j > 0) {
(dp[i][j][1] += dp[i][j - 1][1] + dp[i][j - 1][3]) %= mod;
(dp[i][j][3] += dp[i][j - 1][0]) %= mod;
}
}
}
int ans = 0;
for (int i = 0; i < 4; i++)
(ans += dp[h - 1][w - 1][i]) %= mod;
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 100000;
int main() {
int w, h;
while (cin >> w >> h, w) {
int dp[110][110][4] = {};
dp[1][0][0] = dp[0][1][1] = 1;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (i > 0) {
(dp[i][j][0] += dp[i - 1][j][0] + dp[i - 1][j][2]) %= mod;
(dp[i][j][2] += dp[i - 1][j][1]) %= mod;
}
if (j > 0) {
(dp[i][j][1] += dp[i][j - 1][1] + dp[i][j - 1][3]) %= mod;
(dp[i][j][3] += dp[i][j - 1][0]) %= mod;
}
}
}
int ans = 0;
for (int k = 0; k < 4; k++)
(ans += dp[h - 1][w - 1][k]) %= mod;
cout << ans << endl;
}
}
|
[["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["-", 0, 11, 12, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 11, 12, 11, 31, 69, 341, 342, 0, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 28, 22], ["-", 0, 11, 31, 23, 0, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 23, 0, 69, 341, 342, 0, 22]]
| 1
| 306
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define LL long long
static const LL INF = 1 << 24;
static const LL LL_INF = 1 << 60;
static const int mod = 1e+5;
static const int MAX_N = 200;
int dx[] = {0, 1};
int dy[] = {1, 0};
using namespace std;
int w, h;
LL mem[MAX_N][MAX_N][3][3][3][3];
LL cal(int x, int y, int px, int py, int ppx, int ppy) {
LL res = 0;
if (mem[x][y][px][py][ppx][ppy] != 0)
return mem[x][y][px][py][ppx][ppy];
if (x >= w || y >= h)
return 0;
if (x == w - 1 && y == h - 1)
return 1;
FOR(i, 0, 1) {
if (x == 0 && y == 0)
res += cal(x + dx[i], y + dy[i], dx[i], dy[i], px, py);
else {
if (px != ppx && py != ppy && px != dx[i] && py != dy[i])
continue;
res += cal(x + dx[i], y + dy[i], dx[i], dy[i], px, py) % mod;
}
}
return mem[x][y][px][py][ppx][ppy] = res % mod;
}
int main() {
while (1) {
memset(mem, 0, sizeof(mem));
cin >> w >> h;
if (w == 0 && h == 0)
break;
cout << cal(0, 0, 0, 0, 0, 0);
}
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define LL long long
static const LL INF = 1 << 24;
static const LL LL_INF = 1 << 60;
static const int mod = 1e+5;
static const int MAX_N = 200;
int dx[] = {0, 1};
int dy[] = {1, 0};
using namespace std;
int w, h;
LL mem[MAX_N][MAX_N][3][3][3][3];
LL cal(int x, int y, int px, int py, int ppx, int ppy) {
LL res = 0;
if (mem[x][y][px][py][ppx][ppy] != 0)
return mem[x][y][px][py][ppx][ppy];
if (x >= w || y >= h)
return 0;
if (x == w - 1 && y == h - 1)
return 1;
FOR(i, 0, 1) {
if (x == 0 && y == 0)
res += cal(x + dx[i], y + dy[i], dx[i], dy[i], px, py);
else {
if (px != ppx && py != ppy && px != dx[i] && py != dy[i])
continue;
res += cal(x + dx[i], y + dy[i], dx[i], dy[i], px, py) % mod;
}
}
return mem[x][y][px][py][ppx][ppy] = res % mod;
}
int main() {
while (1) {
memset(mem, 0, sizeof(mem));
cin >> w >> h;
if (w == 0 && h == 0)
break;
cout << cal(0, 0, 0, 0, 0, 0) << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 407
|
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int a[101][101][4], h, w;
main() {
while (cin >> h >> w, h) {
int ans = 0;
memset(a, 0, sizeof(a));
r(i, 101) a[0][i][3] = 1;
r(i, 101) a[i][0][2] = 1;
for (int i = 1; i < h; i++)
for (int j = 1; j < w; j++) {
a[i][j][0] = a[i - 1][j][3];
a[i][j][1] = a[i][j - 1][2];
a[i][j][2] = a[i - 1][j][0] + a[i - 1][j][2];
a[i][j][3] = a[i][j - 1][3] + a[i][j - 1][1];
r(k, 4) a[i][j][k] %= 100000;
}
r(i, 4) ans += a[h - 1][w - 1][i];
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int a[101][101][4], h, w;
main() {
while (cin >> h >> w, h) {
int ans = 0;
memset(a, 0, sizeof(a));
r(i, 101) a[0][i][3] = 1;
r(i, 101) a[i][0][2] = 1;
for (int i = 1; i < h; i++)
for (int j = 1; j < w; j++) {
a[i][j][0] = a[i - 1][j][3];
a[i][j][1] = a[i][j - 1][2];
a[i][j][2] = a[i - 1][j][0] + a[i - 1][j][2];
a[i][j][3] = a[i][j - 1][3] + a[i][j - 1][1];
r(k, 4) a[i][j][k] %= 100000;
}
r(i, 4) ans += a[h - 1][w - 1][i];
cout << ans % 100000 << endl;
}
}
|
[["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 109], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]]
| 1
| 302
|
#include <algorithm>
#include <iostream>
using namespace std;
const int MOD = 100000;
int main() {
int w, h;
while (cin >> w >> h, w | h) {
int dp[101][101][5] = {0};
for (int i = 1; i <= h; i++)
dp[i][1][1] = 1;
for (int i = 1; i <= w; i++)
dp[1][i][3] = 1;
for (int y = 2; y <= h; y++) {
for (int x = 2; x <= w; x++) {
dp[y][x][1] += (dp[y - 1][x][1] + dp[y - 1][x][2]) % MOD;
dp[y][x][2] += dp[y - 1][x][3] % MOD;
dp[y][x][3] += (dp[y][x - 1][3] + dp[y][x - 1][4]) % MOD;
dp[y][x][4] += dp[y][x - 1][1] % MOD;
}
}
int ans = 0;
for (int t = 1; t < 5; t++) {
ans += dp[h][w][t];
}
cout << ans << endl;
}
}
|
#include <algorithm>
#include <iostream>
using namespace std;
const int MOD = 100000;
int main() {
int w, h;
while (cin >> w >> h, w | h) {
int dp[101][101][5] = {0};
for (int i = 1; i <= h; i++)
dp[i][1][1] = 1;
for (int i = 1; i <= w; i++)
dp[1][i][3] = 1;
for (int y = 2; y <= h; y++) {
for (int x = 2; x <= w; x++) {
dp[y][x][1] += (dp[y - 1][x][1] + dp[y - 1][x][2]) % MOD;
dp[y][x][2] += dp[y - 1][x][3] % MOD;
dp[y][x][3] += (dp[y][x - 1][3] + dp[y][x - 1][4]) % MOD;
dp[y][x][4] += dp[y][x - 1][1] % MOD;
}
}
int ans = 0;
for (int t = 1; t < 5; t++) {
ans += dp[h][w][t];
}
cout << ans % MOD << endl;
}
}
|
[["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 109], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 22]]
| 1
| 315
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(c) (c).begin(), (c).end()
#define mp make_pair
#define pb push_back
#define rp(i, c) rep(i, (c).size())
#define fr(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define dbg(x) cerr << #x << " = " << (x) << endl
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = 1 << 28;
const double INF = 1e12, EPS = 1e-9;
const int MOD = 100000;
int w, h;
int dp[100][100][4];
void func(int &a, int b) { a = (a + b) % MOD; }
int main() {
while (cin >> w >> h, w) {
rep(i, 4) rep(j, h) rep(k, w) dp[i][j][k] = 0;
dp[0][0][1] = dp[0][0][3] = 1;
rep(i, h) rep(j, w) {
if (i + 1 < h) {
func(dp[i + 1][j][0], dp[i][j][0] + dp[i][j][1]);
func(dp[i + 1][j][1], dp[i][j][2]);
}
if (j + 1 < w) {
func(dp[i][j + 1][2], dp[i][j][2] + dp[i][j][3]);
func(dp[i][j + 1][3], dp[i][j][0]);
}
}
int ans = accumulate(dp[h - 1][w - 1], dp[h - 1][w - 1] + 4, 0) % MOD;
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(c) (c).begin(), (c).end()
#define mp make_pair
#define pb push_back
#define rp(i, c) rep(i, (c).size())
#define fr(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define dbg(x) cerr << #x << " = " << (x) << endl
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = 1 << 28;
const double INF = 1e12, EPS = 1e-9;
const int MOD = 100000;
int w, h;
int dp[100][100][4];
void func(int &a, int b) { a = (a + b) % MOD; }
int main() {
while (cin >> w >> h, w) {
rep(i, h) rep(j, w) rep(k, 4) dp[i][j][k] = 0;
dp[0][0][1] = dp[0][0][3] = 1;
rep(i, h) rep(j, w) {
if (i + 1 < h) {
func(dp[i + 1][j][0], dp[i][j][0] + dp[i][j][1]);
func(dp[i + 1][j][1], dp[i][j][2]);
}
if (j + 1 < w) {
func(dp[i][j + 1][2], dp[i][j][2] + dp[i][j][3]);
func(dp[i][j + 1][3], dp[i][j][0]);
}
}
int ans = accumulate(dp[h - 1][w - 1], dp[h - 1][w - 1] + 4, 0) % MOD;
cout << ans << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 42, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 42, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 42, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 42, 0, 2, 3, 4, 0, 13]]
| 1
| 439
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr) / sizeof(value), (value))
template <typename T> void FILL_(void *ptr, size_t size, T value) {
std::fill((T *)ptr, (T *)ptr + size, value);
}
// 4方向ベクトル→↑←↓
int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};
int w, h;
int main() {
while (cin >> w >> h, w || h) {
int dp[101][101][2]; // 0で横向き1で縦向き
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= 100; i++) {
dp[i][1][0] = dp[1][i][0] = dp[i][1][1] = dp[1][i][1] = 1;
}
for (int i = 2; i <= h; i++) {
for (int j = 2; j <= w; j++) {
dp[i][j][0] = (dp[i][j - 1][0] + dp[i - 2][j][1]);
dp[i][j][1] = (dp[i - 1][j][1] + dp[i][j - 2][0]);
}
}
cout << (dp[h][w - 1][0] + dp[h - 1][w][1]) % 100000 << endl;
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr) / sizeof(value), (value))
template <typename T> void FILL_(void *ptr, size_t size, T value) {
std::fill((T *)ptr, (T *)ptr + size, value);
}
// 4方向ベクトル→↑←↓
int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};
int w, h;
int main() {
while (cin >> w >> h, w || h) {
unsigned int dp[101][101][2]; // 0で横向き1で縦向き
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= 100; i++) {
dp[i][1][0] = dp[1][i][0] = dp[i][1][1] = dp[1][i][1] = 1;
}
for (int i = 2; i <= h; i++) {
for (int j = 2; j <= w; j++) {
dp[i][j][0] = (dp[i][j - 1][0] + dp[i - 2][j][1]) % 100000;
dp[i][j][1] = (dp[i - 1][j][1] + dp[i][j - 2][0]) % 100000;
}
}
cout << (dp[h][w - 1][0] + dp[h - 1][w][1]) % 100000 << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 109], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]]
| 1
| 417
|
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a, b, x, y, ans;
int half = n - n / 2;
for (int i = 0; i < k; i++) {
cin >> a >> b;
if (a > half) {
if (a == n) {
x = 1;
} else {
x = half - a % half;
if (half % 2 == 0) {
x += 1;
}
}
} else {
x = a;
}
if (b > half) {
if (b == n) {
x = 1;
} else {
y = half - b % half;
if (half % 2 == 0) {
y += 1;
}
}
} else {
y = b;
}
if (x > y) {
ans = y % 3;
} else {
ans = x % 3;
}
if (ans) {
cout << ans << endl;
} else {
cout << 3 << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a, b, x, y, ans;
int half = n - n / 2;
for (int i = 0; i < k; i++) {
cin >> a >> b;
if (a > half) {
if (a == n) {
x = 1;
} else {
x = half - a % half;
if (n % 2 == 0) {
x += 1;
}
}
} else {
x = a;
}
if (b > half) {
if (b == n) {
x = 1;
} else {
y = half - b % half;
if (n % 2 == 0) {
y += 1;
}
}
} else {
y = b;
}
if (x > y) {
ans = y % 3;
} else {
ans = x % 3;
}
if (ans) {
cout << ans << endl;
} else {
cout << 3 << endl;
}
}
return 0;
}
|
[["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22]]
| 1
| 216
|
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, a, b, c, x[1000], y[1000];
cin >> n;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> x[i] >> y[i];
b = min(x[i], n + 1 - x[i]);
b = min(b, y[i]);
b = min(b, n + 1 - y[i]);
if (b % 3 == 0) {
c = 3;
} else {
c = b % 3;
}
cout << b << endl;
}
return 0;
}
|
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, a, b, c, x[1000], y[1000];
cin >> n;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> x[i] >> y[i];
b = min(x[i], n + 1 - x[i]);
b = min(b, y[i]);
b = min(b, n + 1 - y[i]);
if (b % 3 == 0) {
c = 3;
} else {
c = b % 3;
}
cout << c << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]]
| 1
| 148
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
int a, b;
cin >> a >> b;
int mini = min(min(a, n - a + 1), min(b, n - b + 1));
cout << (mini % 3 ? mini : 3) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
int a, b;
cin >> a >> b;
int mini = min(min(a, n - a + 1), min(b, n - b + 1)) % 3;
cout << (mini ? mini : 3) << endl;
}
}
|
[["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 109], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["-", 31, 16, 12, 23, 0, 41, 15, 16, 17, 109], ["-", 31, 16, 12, 23, 0, 41, 15, 16, 12, 13]]
| 1
| 92
|
#include <iostream>
#include <vector>
int main() {
int N, n;
std::cin >> N >> n;
N -= 1;
std::vector<int> x(n), y(n), ans(n);
for (int i = 0; i < n; i += 1) {
std::cin >> x[i] >> y[i];
x[i] -= 1, y[i] -= 1;
if (x[i] < y[i]) {
if (x[i] + y[i] > N)
ans[i] = (N - y[i]) % 3 + 1;
else
ans[i] = x[i] % 3 + 1;
} else {
if (x[i] + y[i] > N)
ans[i] = N - x[i] % 3 + 1;
else
ans[i] = y[i] % 3 + 1;
}
}
for (int i = 0; i < n; i += 1)
std::cout << ans[i] << std::endl;
return 0;
}
|
#include <iostream>
#include <vector>
int main() {
int N, n;
std::cin >> N >> n;
N -= 1;
std::vector<int> x(n), y(n), ans(n);
for (int i = 0; i < n; i += 1) {
std::cin >> x[i] >> y[i];
x[i] -= 1, y[i] -= 1;
if (x[i] < y[i]) {
if (x[i] + y[i] > N)
ans[i] = (N - y[i]) % 3 + 1;
else
ans[i] = x[i] % 3 + 1;
} else {
if (x[i] + y[i] > N)
ans[i] = (N - x[i]) % 3 + 1;
else
ans[i] = y[i] % 3 + 1;
}
}
for (int i = 0; i < n; i += 1)
std::cout << ans[i] << std::endl;
return 0;
}
|
[["+", 0, 11, 12, 16, 31, 16, 31, 23, 0, 24], ["+", 0, 11, 12, 16, 31, 16, 31, 23, 0, 25]]
| 1
| 233
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
ll N;
cin >> N;
int K;
cin >> K;
FOR(i, 0, K) {
ll x, y;
cin >> x >> y;
x = min(x, N - x + 1);
y = min(y, N - y + 1);
cout << (min(x, y) % 3 == 0 ? 3 : min(x, y)) << '\n';
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
ll N;
cin >> N;
int K;
cin >> K;
FOR(i, 0, K) {
ll x, y;
cin >> x >> y;
x = min(x, N - x + 1);
y = min(y, N - y + 1);
cout << (min(x, y) % 3 == 0 ? 3 : min(x, y) % 3) << '\n';
}
return 0;
}
|
[["+", 31, 16, 12, 23, 0, 41, 75, 16, 17, 109], ["+", 31, 16, 12, 23, 0, 41, 75, 16, 12, 13]]
| 1
| 154
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
long long n, k, i, j, x, y, m, s;
cin >> n >> k;
for (i = 0; i < k; i++) {
cin >> x >> y;
if (x > n / 2)
x = n - x;
if (y > n / 2)
y = n - y;
m = min(x, y);
s = m % 3;
if (s == 0)
s = 3;
cout << s << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
long long n, k, i, j, x, y, m, s;
cin >> n >> k;
for (i = 0; i < k; i++) {
cin >> x >> y;
if (x > n / 2)
x = n - x + 1;
if (y > n / 2)
y = n - y + 1;
m = min(x, y);
s = m % 3;
if (s == 0)
s = 3;
cout << s << endl;
}
return 0;
}
|
[["+", 0, 57, 64, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 12, 13]]
| 1
| 125
|
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < k; ++i) {
int a, b;
scanf("%d%d", &a, &b);
a = min(a, n + 1 - a);
b = min(b, n + 1 - b);
int x = min(a, b);
printf("%d\n", x % 3 + 1);
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < k; ++i) {
int a, b;
scanf("%d%d", &a, &b);
a = min(a, n + 1 - a);
b = min(b, n + 1 - b);
int x = min(a, b);
printf("%d\n", (x - 1) % 3 + 1);
}
return 0;
}
|
[["+", 3, 4, 0, 16, 31, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 3, 4, 0, 16, 31, 16, 31, 23, 0, 25]]
| 1
| 119
|
#include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "queue"
#include "set"
#include "stack"
#include "string"
using namespace std;
const long long int MOD = 1000000007;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
vector<int> num(N - 1);
for (int i = 0; i < N - 1; i++) {
cin >> num[i];
}
vector<vector<vector<int>>> dp(
2, vector<vector<int>>(N, vector<int>(2, 100000001)));
dp[0][0][0] = 0;
dp[0][1][1] = 0;
for (int i = 1; i < N; i++) {
dp[i % 2][0][0] = dp[(i + 1) % 2][0][0];
for (int j = 1; j <= min(i, (int)N / 2); j++) {
dp[i % 2][j][0] =
min(dp[(i + 1) % 2][j][0], dp[(i + 1) % 2][j][1] + num[i - 1]);
dp[i % 2][j][1] = min(dp[(i + 1) % 2][j - 1][1],
dp[(i + 1) % 2][j - 1][0] + num[i - 1]);
}
}
cout << min(dp[0][N / 2][1], dp[0][N / 2][0]) << endl;
return 0;
}
|
#include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "queue"
#include "set"
#include "stack"
#include "string"
using namespace std;
const long long int MOD = 1000000007;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
vector<int> num(N - 1);
for (int i = 0; i < N - 1; i++) {
cin >> num[i];
}
vector<vector<vector<int>>> dp(
2, vector<vector<int>>(N, vector<int>(2, 100000001)));
dp[0][0][0] = 0;
dp[0][1][1] = 0;
for (int i = 1; i < N; i++) {
dp[i % 2][0][0] = dp[(i + 1) % 2][0][0];
for (int j = 1; j <= min(i, (int)N / 2); j++) {
dp[i % 2][j][0] =
min(dp[(i + 1) % 2][j][0], dp[(i + 1) % 2][j][1] + num[i - 1]);
dp[i % 2][j][1] = min(dp[(i + 1) % 2][j - 1][1],
dp[(i + 1) % 2][j - 1][0] + num[i - 1]);
}
}
cout << min(dp[1][N / 2][1], dp[1][N / 2][0]) << endl;
return 0;
}
|
[["-", 0, 69, 28, 69, 28, 69, 341, 342, 0, 13], ["+", 0, 69, 28, 69, 28, 69, 341, 342, 0, 13]]
| 1
| 421
|
#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 ll long long
#define dmp make_pair
#define dpb push_back
#define P pair<int, int>
#define fi first
#define se second
using namespace std;
//__gcd(a,b), __builtin_popcount(a);
const int inf = 1e9;
const ll INF = 1e18;
#define B 100
int a[MAX], dp[2][MAX][2];
int main() {
int n, t1, t2;
scanf("%d", &n);
rep(i, 2) rep(j, MAX) rep(k, 2) dp[i][j][k] = inf;
for (int i = 2; i <= n; i++)
scanf("%d", &a[i]);
dp[0][0][0] = dp[0][0][1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i / 2 + 1; j++) {
dp[i % 2][j][0] =
min(dp[(i - 1) % 2][j - 1][0], dp[(i - 1) % 2][j - 1][1] + a[i]);
dp[i % 2][j][1] =
min(dp[(i - 1) % 2][j][1], dp[(i - 1) % 2][j][0] + a[i]);
}
rep(j, n) rep(k, 2) dp[(i - 1) % 2][j][k] = inf;
}
printf("%d\n", min(dp[n % 2][n / 2][0], dp[n % 2][n / 2][1]));
return 0;
}
|
#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 ll long long
#define dmp make_pair
#define dpb push_back
#define P pair<int, int>
#define fi first
#define se second
using namespace std;
//__gcd(a,b), __builtin_popcount(a);
const int inf = 1e9;
const ll INF = 1e18;
#define B 100
int a[MAX], dp[2][MAX][2];
int main() {
int n, t1, t2;
scanf("%d", &n);
rep(i, 2) rep(j, MAX) rep(k, 2) dp[i][j][k] = inf;
for (int i = 2; i <= n; i++)
scanf("%d", &a[i]);
dp[0][0][0] = dp[0][0][1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n / 2 + 1; j++) {
dp[i % 2][j][0] =
min(dp[(i - 1) % 2][j - 1][0], dp[(i - 1) % 2][j - 1][1] + a[i]);
dp[i % 2][j][1] =
min(dp[(i - 1) % 2][j][1], dp[(i - 1) % 2][j][0] + a[i]);
}
rep(j, n) rep(k, 2) dp[(i - 1) % 2][j][k] = inf;
}
printf("%d\n", min(dp[n % 2][n / 2][0], dp[n % 2][n / 2][1]));
return 0;
}
|
[["-", 0, 7, 15, 16, 12, 16, 31, 16, 31, 22], ["+", 0, 7, 15, 16, 12, 16, 31, 16, 31, 22]]
| 1
| 418
|
#include <algorithm>
#include <iostream>
using namespace std;
const int INF = 200000000;
int dp[2][2][5002];
int n;
int cost[10000];
main() {
cin >> n;
for (int i = 0; i < n - 1; ++i) {
cin >> cost[i];
}
fill(dp[0][0], dp[2][0], INF);
dp[0][1][0] = 0;
dp[0][0][0] = 0;
for (int i = 0; i < n - 1; ++i) {
int now = i % 2;
int next = (i + 1) % 2;
for (int j = 0; j <= n / 2; ++j)
dp[next][0][j] = dp[next][1][j] = INF;
for (int j = 0; j <= n / 2; ++j) {
dp[next][1][j + 1] =
min(dp[next][1][j + 1], min(dp[now][1][j], dp[now][0][j] + cost[i]));
dp[next][0][j] =
min(dp[next][0][j], min(dp[now][0][j], dp[now][1][j] + cost[i]));
}
}
cout << min(dp[1][0][n / 2], dp[1][1][n / 2]) + 1 << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
const int INF = 200000000;
int dp[2][2][5002];
int n;
int cost[10000];
main() {
cin >> n;
for (int i = 0; i < n - 1; ++i) {
cin >> cost[i];
}
fill(dp[0][0], dp[2][0], INF);
dp[0][1][1] = 0;
dp[0][0][0] = 0;
for (int i = 0; i < n - 1; ++i) {
int now = i % 2;
int next = (i + 1) % 2;
for (int j = 0; j <= n / 2; ++j)
dp[next][0][j] = dp[next][1][j] = INF;
for (int j = 0; j <= n / 2; ++j) {
dp[next][1][j + 1] =
min(dp[next][1][j + 1], min(dp[now][1][j], dp[now][0][j] + cost[i]));
dp[next][0][j] =
min(dp[next][0][j], min(dp[now][0][j], dp[now][1][j] + cost[i]));
}
}
cout << min(dp[1][0][n / 2], dp[1][1][n / 2]) << endl;
return 0;
}
|
[["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]]
| 1
| 362
|
#include <algorithm>
#include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int INF = 1 << 29;
int main() {
int n;
scanf("%d", &n);
int cost[9999];
rep(i, n) scanf("%d", cost + i);
int dp[2][5001][2];
rep(j, n / 2 + 1) rep(k, 2) dp[0][j][k] = INF;
dp[0][1][0] = 0;
rep(i, n - 1) {
int i1 = i & 1, i2 = 1 - i1;
rep(k, 2) dp[i2][0][k] = INF;
for (int j = 1; j <= i / 2 + 1; j++) {
dp[i2][j][0] = min(dp[i1][j - 1][0], dp[i1][j - 1][1] + cost[i]);
dp[i2][j][1] = min(dp[i1][j][1], dp[i1][j][0] + cost[i]);
}
}
printf("%d\n", min(dp[(n - 1) & 1][n / 2][0], dp[(n - 1) & 1][n / 2][1]));
return 0;
}
|
#include <algorithm>
#include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int INF = 1 << 29;
int main() {
int n;
scanf("%d", &n);
int cost[9999];
rep(i, n - 1) scanf("%d", cost + i);
int dp[2][5001][2];
rep(j, n / 2 + 1) rep(k, 2) dp[0][j][k] = INF;
dp[0][1][0] = 0;
rep(i, n - 1) {
int i1 = i & 1, i2 = 1 - i1;
rep(k, 2) dp[i2][0][k] = INF;
for (int j = 1; j <= n / 2; j++) {
dp[i2][j][0] = min(dp[i1][j - 1][0], dp[i1][j - 1][1] + cost[i]);
dp[i2][j][1] = min(dp[i1][j][1], dp[i1][j][0] + cost[i]);
}
}
printf("%d\n", min(dp[(n - 1) & 1][n / 2][0], dp[(n - 1) & 1][n / 2][1]));
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 7, 15, 16, 12, 16, 31, 16, 31, 22], ["+", 0, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["-", 0, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 0, 9, 0, 7, 15, 16, 12, 16, 12, 13]]
| 1
| 323
|
// Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
typedef long long ll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 2000000000
#define s(x) scanf("%d", &x)
#define rep(i, x) for (int i = 0; i < x; i++)
int dp[5005][2][2];
int main() {
int n;
int v[10005];
scanf("%d", &n);
for (int i = 1; i < n; i++) {
scanf("%d", &v[i]);
}
for (int i = 0; i < 5005; i++)
for (int j = 0; j < 2; j++)
for (int k = 0; k < 2; k++)
dp[i][j][k] = INF;
dp[1][0][0] = 0;
int cur = 0, nex = 1;
for (int i = 1; i < n; i++) {
for (int i = 0; i < 5005; i++)
for (int j = 0; j < 2; j++)
dp[i][j][nex] = INF;
for (int j = min(n / 2 - 1, i); j >= max(0, i - n / 2); j--) {
dp[j + 1][0][nex] = min(dp[j + 1][0][nex], dp[j][0][cur]);
dp[j][1][nex] = min(dp[j][1][nex], dp[j][0][cur] + v[i]);
dp[j][1][nex] = min(dp[j][1][nex], dp[j][1][cur]);
dp[j + 1][0][nex] = min(dp[j + 1][0][nex], dp[j][1][cur] + v[i]);
}
cur = 1 - cur;
nex = 1 - nex;
}
printf("%d\n", min(dp[n / 2][0][cur], dp[n / 2][1][cur]));
}
|
// Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
typedef long long ll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 2000000000
#define s(x) scanf("%d", &x)
#define rep(i, x) for (int i = 0; i < x; i++)
int dp[5005][2][2];
int main() {
int n;
int v[10005];
scanf("%d", &n);
for (int i = 1; i < n; i++) {
scanf("%d", &v[i]);
}
for (int i = 0; i < 5005; i++)
for (int j = 0; j < 2; j++)
for (int k = 0; k < 2; k++)
dp[i][j][k] = INF;
dp[1][0][0] = 0;
int cur = 0, nex = 1;
for (int i = 1; i < n; i++) {
for (int i = 0; i < 5005; i++)
for (int j = 0; j < 2; j++)
dp[i][j][nex] = INF;
for (int j = min(n / 2, i); j >= max(0, i - n / 2); j--) {
dp[j + 1][0][nex] = min(dp[j + 1][0][nex], dp[j][0][cur]);
dp[j][1][nex] = min(dp[j][1][nex], dp[j][0][cur] + v[i]);
dp[j][1][nex] = min(dp[j][1][nex], dp[j][1][cur]);
dp[j + 1][0][nex] = min(dp[j + 1][0][nex], dp[j][1][cur] + v[i]);
}
cur = 1 - cur;
nex = 1 - nex;
}
printf("%d\n", min(dp[n / 2][0][cur], dp[n / 2][1][cur]));
}
|
[["-", 49, 50, 51, 2, 3, 4, 0, 16, 17, 33], ["-", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 538
|
#include <cstdio>
#include <cstring>
#define min(a, b) ((a) > (b) ? (b) : (a))
int k[10000];
short dp[2][5001][2];
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < (N - 1); i++) {
scanf("%d", &k[i]);
}
memset(dp, 0x7f, sizeof(dp));
dp[0][0][0] = 0;
for (int i = 0; i < N; i++) {
int m = min(i, N / 2);
for (int j = 0; j <= m; j++) {
dp[(i + 1) & 1][j + 1][0] = min(dp[i & 1][j][0], dp[i & 1][j][1] + k[i]);
dp[(i + 1) & 1][j][1] = min(dp[i & 1][j][1], dp[i & 1][j][0] + k[j]);
}
dp[i & 1][0][0] = 0x7f7f;
}
printf("%d\n", dp[0][N / 2][0]);
}
|
#include <cstdio>
#include <cstring>
#define min(a, b) ((a) > (b) ? (b) : (a))
int k[10000];
short dp[2][5001][2];
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < (N - 1); i++) {
scanf("%d", &k[i]);
}
memset(dp, 0x7f, sizeof(dp));
dp[0][0][0] = 0;
for (int i = 0; i < N; i++) {
int m = min(i, N / 2);
for (int j = 0; j <= m; j++) {
dp[(i + 1) & 1][j + 1][0] = min(dp[i & 1][j][0], dp[i & 1][j][1] + k[i]);
dp[(i + 1) & 1][j][1] = min(dp[i & 1][j][1], dp[i & 1][j][0] + k[i]);
}
dp[i & 1][0][0] = 0x7f7f;
}
printf("%d\n", dp[0][N / 2][0]);
}
|
[["-", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22]]
| 1
| 291
|
#include <iostream>
using namespace std;
#define N 10000
#define INF 1000000007
#define min(a, b) (a > b ? b : a)
int main() {
int dp[2][N][2], n, cost;
cin >> n;
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < n; ++j) {
dp[i][j][0] = dp[i][j][1] = INF;
}
}
dp[0][1][0] = dp[0][0][1] = 0;
for (int i = 0; i < n - 1; ++i) {
cin >> cost;
for (int j = 1; j <= n / 2; ++j) {
dp[(i + 1) % 2][j][0] =
min(dp[i % 2][j - 1][0], dp[i % 2][j - 1][1] + cost);
dp[(i + 1) % 2][j][1] = min(dp[i % 2][j][0] + cost, dp[i % 2][j][1]);
// cout << j << " " << dp[(i+1)%2][j][0] << " " << dp[(i+1)%2][j][1] <<
// endl;
}
}
cout << min(dp[0][n / 2][0], dp[0][n / 2][1]) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
#define N 10000
#define INF 1000000007
#define min(a, b) (a > b ? b : a)
int main() {
int dp[2][N][2], n, cost;
cin >> n;
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < n; ++j) {
dp[i][j][0] = dp[i][j][1] = INF;
}
}
dp[0][1][0] = dp[0][0][1] = 0;
for (int i = 0; i < n - 1; ++i) {
cin >> cost;
for (int j = 1; j <= n / 2 + 1; ++j) {
dp[(i + 1) % 2][j][0] =
min(dp[i % 2][j - 1][0], dp[i % 2][j - 1][1] + cost);
dp[(i + 1) % 2][j][1] = min(dp[i % 2][j][0] + cost, dp[i % 2][j][1]);
// cout << j << " " << dp[(i+1)%2][j][0] << " " << dp[(i+1)%2][j][1] <<
// endl;
}
}
cout << min(dp[1][n / 2][0], dp[1][n / 2][1]) << endl;
return 0;
}
|
[["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 69, 28, 69, 28, 69, 341, 342, 0, 13], ["+", 0, 69, 28, 69, 28, 69, 341, 342, 0, 13]]
| 1
| 304
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct {
int time;
int len;
int no;
} ICICLE;
int mymax(int a, int b) {
if (a > b) {
return (a);
}
return (b);
}
int comp(const void *a, const void *b) {
ICICLE *x, *y;
x = (ICICLE *)a;
y = (ICICLE *)b;
return ((y->len) - (x->len));
}
int main(void) {
static ICICLE t[100001], m[100001];
int mlen;
int n, r;
int i, j;
int ans;
scanf("%d%d", &n, &mlen);
for (i = 0; i < n; i++) {
scanf("%d", &t[i].len);
t[i].no = i;
}
memcpy(m, t, sizeof(t));
qsort(t, n, sizeof(ICICLE), comp);
r = n;
ans = 0;
while (r) {
for (i = 0; i < n; i++) {
if (t[i].no != 0 && t[i].no != n - 1) {
if (t[i].time == 0 &&
(m[t[i].no - 1].len < t[i].len || m[t[i].no - 1].time != 0) &&
(m[t[i].no + 1].len < t[i].len || m[t[i].no + 1].time != 0)) {
t[i].time = (mlen - t[i].len) +
mymax(m[t[i].no - 1].time, m[t[i].no + 1].time);
ans = mymax(ans, t[i].time);
m[t[i].no].time = t[i].time;
r--;
}
} else if (i == 0) {
if (t[i].time == 0 &&
(m[t[i].no + 1].len < t[i].len || m[t[i].no + 1].time != 0)) {
t[i].time = (mlen - t[i].len) + m[t[i].no + 1].time;
ans = mymax(ans, t[i].time);
m[t[i].no].time = t[i].time;
r--;
}
} else {
if (t[i].time == 0 &&
(m[t[i].no - 1].len < t[i].len || m[t[i].no - 1].time != 0)) {
t[i].time = (mlen - t[i].len) + m[t[i].no - 1].time;
ans = mymax(ans, t[i].time);
m[t[i].no].time = t[i].time;
r--;
}
}
}
}
printf("%d\n", ans);
return (0);
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct {
int time;
int len;
int no;
} ICICLE;
int mymax(int a, int b) {
if (a > b) {
return (a);
}
return (b);
}
int comp(const void *a, const void *b) {
ICICLE *x, *y;
x = (ICICLE *)a;
y = (ICICLE *)b;
return ((y->len) - (x->len));
}
int main(void) {
static ICICLE t[100001], m[100001];
int mlen;
int n, r;
int i, j;
int ans;
scanf("%d%d", &n, &mlen);
for (i = 0; i < n; i++) {
scanf("%d", &t[i].len);
t[i].no = i;
}
memcpy(m, t, sizeof(t));
qsort(t, n, sizeof(ICICLE), comp);
r = n;
ans = 0;
while (r) {
for (i = 0; i < n; i++) {
if (t[i].no != 0 && t[i].no != n - 1) {
if (t[i].time == 0 &&
(m[t[i].no - 1].len < t[i].len || m[t[i].no - 1].time != 0) &&
(m[t[i].no + 1].len < t[i].len || m[t[i].no + 1].time != 0)) {
t[i].time = (mlen - t[i].len) +
mymax(m[t[i].no - 1].time, m[t[i].no + 1].time);
ans = mymax(ans, t[i].time);
m[t[i].no].time = t[i].time;
r--;
}
} else if (t[i].no == 0) {
if (t[i].time == 0 &&
(m[t[i].no + 1].len < t[i].len || m[t[i].no + 1].time != 0)) {
t[i].time = (mlen - t[i].len) + m[t[i].no + 1].time;
ans = mymax(ans, t[i].time);
m[t[i].no].time = t[i].time;
r--;
}
} else {
if (t[i].time == 0 &&
(m[t[i].no - 1].len < t[i].len || m[t[i].no - 1].time != 0)) {
t[i].time = (mlen - t[i].len) + m[t[i].no - 1].time;
ans = mymax(ans, t[i].time);
m[t[i].no].time = t[i].time;
r--;
}
}
}
}
printf("%d\n", ans);
return (0);
}
|
[["+", 15, 23, 0, 16, 31, 118, 28, 69, 28, 22], ["+", 15, 23, 0, 16, 31, 118, 28, 69, 0, 70], ["+", 15, 23, 0, 16, 31, 118, 28, 69, 0, 73], ["+", 0, 57, 15, 23, 0, 16, 31, 118, 17, 131], ["+", 0, 57, 15, 23, 0, 16, 31, 118, 119, 120]]
| 0
| 712
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#define MAX_N 100000
using namespace std;
int dp[MAX_N + 2];
int field[MAX_N + 2];
int ans;
int N;
int L;
bool shape(int i) {
if (field[i] > field[i - 1] && field[i] > field[i + 1]) {
return true;
}
return false;
}
void search(int now, int cost, int mode) {
int ncost = cost + L - field[now];
dp[now] = max(dp[now], ncost);
if (mode != 2) {
if (field[now - 1] == 0)
;
else if (field[now] > field[now - 1]) {
search(now - 1, ncost, 1);
}
}
if (mode != 1) {
if (field[now + 1] == 0)
;
else if (field[now] > field[now + 1]) {
search(now + 1, ncost, 2);
}
}
return;
}
void solve() {
for (int i = 1; i <= N; i++) {
if (shape(i)) {
search(i, 0, 0);
}
}
ans = 0;
for (int i = 1; i <= dp[i]; i++) {
ans = max(ans, dp[i]);
}
return;
}
int main() {
scanf("%d%d", &N, &L);
for (int i = 1; i <= N; i++) {
scanf("%d", field + i);
}
solve();
printf("%d\n", ans);
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#define MAX_N 100000
using namespace std;
int dp[MAX_N + 2];
int field[MAX_N + 2];
int ans;
int N;
int L;
bool shape(int i) {
if (field[i] > field[i - 1] && field[i] > field[i + 1]) {
return true;
}
return false;
}
void search(int now, int cost, int mode) {
int ncost = cost + L - field[now];
dp[now] = max(dp[now], ncost);
if (mode != 2) {
if (field[now - 1] == 0)
;
else if (field[now] > field[now - 1]) {
search(now - 1, ncost, 1);
}
}
if (mode != 1) {
if (field[now + 1] == 0)
;
else if (field[now] > field[now + 1]) {
search(now + 1, ncost, 2);
}
}
return;
}
void solve() {
for (int i = 1; i <= N; i++) {
if (shape(i)) {
search(i, 0, 0);
}
}
ans = 0;
for (int i = 1; i <= N; i++) {
ans = max(ans, dp[i]);
}
return;
}
int main() {
scanf("%d%d", &N, &L);
for (int i = 1; i <= N; i++) {
scanf("%d", field + i);
}
solve();
printf("%d\n", ans);
return 0;
}
|
[["-", 8, 9, 0, 7, 15, 16, 12, 69, 28, 22], ["-", 0, 7, 15, 16, 12, 69, 341, 342, 0, 70], ["-", 0, 7, 15, 16, 12, 69, 341, 342, 0, 22], ["-", 0, 7, 15, 16, 12, 69, 341, 342, 0, 73], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]]
| 1
| 359
|
#include <algorithm>
#include <cstdio>
#include <math.h>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 1001001001;
pair<int, int> map[100002];
int time[100002];
int main() {
int N, L;
scanf("%d %d", &N, &L);
rep(i, N) {
int a;
scanf("%d", &a);
map[i] = make_pair(a, i);
}
sort(map, map + N, greater<pair<int, int>>());
int ans = 0;
rep(i, N) {
int sans = 0;
int yokomax = 0;
if (map[i].second != 0) {
yokomax = max(time[map[i].second + 1], yokomax);
}
if (map[i].second != N - 1) {
yokomax = max(time[map[i].second - 1], yokomax);
}
sans = yokomax + L - map[i].first;
time[map[i].second] = sans;
ans = max(ans, sans);
}
printf("%d\n", ans);
}
|
#include <algorithm>
#include <cstdio>
#include <math.h>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 1001001001;
pair<int, int> map[100002];
int time[100002];
int main() {
int N, L;
scanf("%d %d", &N, &L);
rep(i, N) {
int a;
scanf("%d", &a);
map[i] = make_pair(a, i);
}
sort(map, map + N, greater<pair<int, int>>());
int ans = 0;
rep(i, N) {
int sans = 0;
int yokomax = 0;
if (map[i].second != 0) {
yokomax = max(time[map[i].second - 1], yokomax);
}
if (map[i].second != N - 1) {
yokomax = max(time[map[i].second + 1], yokomax);
}
sans = yokomax + L - map[i].first;
time[map[i].second] = sans;
ans = max(ans, sans);
}
printf("%d\n", ans);
}
|
[["-", 3, 4, 0, 69, 341, 342, 0, 16, 17, 72], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 17, 33], ["-", 3, 4, 0, 69, 341, 342, 0, 16, 17, 33], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 17, 72]]
| 1
| 258
|
#include <algorithm>
#include <cstdio>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
int N, L, a[100009], dp[100009];
vector<int> x[50009];
int main() {
scanf("%d%d", &N, &L);
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
x[a[i]].push_back(i + 1);
}
for (int i = L - 1; i >= 1; i--) {
for (int j : x[i]) {
dp[j] = max(dp[j - 1], dp[j + 1]) + a[j - 1];
}
}
printf("%d\n", *max_element(dp, dp + N + 1));
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
int N, L, a[100009], dp[100009];
vector<int> x[50009];
int main() {
scanf("%d%d", &N, &L);
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
x[a[i]].push_back(i + 1);
}
for (int i = L - 1; i >= 1; i--) {
for (int j : x[i]) {
dp[j] = max(dp[j - 1], dp[j + 1]) + (L - a[j - 1]);
}
}
printf("%d\n", *max_element(dp, dp + N + 1));
return 0;
}
|
[["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 31, 22], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25]]
| 1
| 181
|
#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 len(a) sizeof(a)
#define ll long long
#define pii pair<int, int>
#define INF 1 << 29
#define MAX 101010
using namespace std;
int n, l, a[MAX], dp[MAX];
int dfs(int now) {
if (dp[now])
return dp[now];
if (a[now] > a[now - 1] && a[now] > a[now + 1])
return dp[now] = l - a[now];
int ma = 0;
if (a[now] <= a[now - 1])
ma = dfs(now - 1);
if (a[now] <= a[now + 1])
ma = max(ma, dfs(now + 1));
return dp[now] = ma + l - dp[now];
}
void solve() {
cin >> n >> l;
a[0] = a[n + 1] = 0;
FOR(i, n) cin >> a[i + 1];
ZERO(dp);
int ma = 0;
FOR(i, n) ma = max(ma, dfs(i + 1));
cout << ma << endl;
}
int main() {
solve();
return 0;
}
|
#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 len(a) sizeof(a)
#define ll long long
#define pii pair<int, int>
#define INF 1 << 29
#define MAX 101010
using namespace std;
int n, l, a[MAX], dp[MAX];
int dfs(int now) {
if (dp[now])
return dp[now];
if (a[now] > a[now - 1] && a[now] > a[now + 1])
return dp[now] = l - a[now];
int ma = 0;
if (a[now] <= a[now - 1])
ma = dfs(now - 1);
if (a[now] <= a[now + 1])
ma = max(ma, dfs(now + 1));
return dp[now] = ma + l - a[now];
}
void solve() {
cin >> n >> l;
a[0] = a[n + 1] = 0;
FOR(i, n) cin >> a[i + 1];
ZERO(dp);
int ma = 0;
FOR(i, n) ma = max(ma, dfs(i + 1));
cout << ma << endl;
}
int main() {
solve();
return 0;
}
|
[["-", 0, 37, 0, 11, 12, 16, 12, 69, 28, 22], ["+", 0, 37, 0, 11, 12, 16, 12, 69, 28, 22]]
| 1
| 305
|
#include <bits/stdc++.h>
using namespace std;
#define MAX 123456
typedef pair<int, int> pii;
int main() {
int N, L, x;
cin >> N >> L;
priority_queue<pii> pq;
for (int i = 0; i < N; i++) {
cin >> x;
pq.push(pii(x, i + 1));
}
int dp[MAX] = {};
while (!pq.empty()) {
pii p = pq.top();
pq.pop();
int f = p.first, s = p.second;
dp[s] = max(dp[s - 1], dp[s + 1] + (L - f));
}
cout << *max_element(dp + 1, dp + N + 1) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MAX 123456
typedef pair<int, int> pii;
int main() {
int N, L, x;
cin >> N >> L;
priority_queue<pii> pq;
for (int i = 0; i < N; i++) {
cin >> x;
pq.push(pii(x, i + 1));
}
int dp[MAX] = {};
while (!pq.empty()) {
pii p = pq.top();
pq.pop();
int f = p.first, s = p.second;
dp[s] = max(dp[s - 1], dp[s + 1]) + (L - f);
}
cout << *max_element(dp + 1, dp + N + 1) << endl;
return 0;
}
|
[["+", 0, 11, 12, 16, 31, 2, 3, 4, 0, 25], ["-", 12, 2, 3, 4, 0, 16, 12, 23, 0, 25]]
| 1
| 174
|
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#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++)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<int, PII> PPII;
typedef pair<int, PPII> PPPII;
class Union_find {
private:
vector<int> par;
vector<int> rank;
int n;
public:
Union_find(int a) {
n = a;
for (int i = 0; i < n; i++) {
par.push_back(i);
rank.push_back(0);
}
}
int find(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
} else {
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
};
int main(void) {
int N, L;
int tura[100010] = {};
ll res[100010] = {};
ll plus[100010] = {};
cin >> N >> L;
REP(i, N) { cin >> tura[i + 1]; }
int cnt = 1;
while (cnt) {
cnt = 0;
FOR(i, 1, N + 1) {
if (tura[i - 1] < tura[i] && tura[i + 1] < tura[i]) {
if (tura[i - 1])
plus[i - 1] = max(plus[i - 1], L - tura[i] + plus[i]);
if (tura[i + 1])
plus[i + 1] = max(plus[i + 1], L - tura[i] + plus[i]);
res[i] += plus[i] + L - tura[i];
plus[i] = 0;
tura[i] = 0;
cnt++;
}
}
}
ll ans = 0;
REP(i, N) { ans = max(ans, res[i]); }
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#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++)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<int, PII> PPII;
typedef pair<int, PPII> PPPII;
class Union_find {
private:
vector<int> par;
vector<int> rank;
int n;
public:
Union_find(int a) {
n = a;
for (int i = 0; i < n; i++) {
par.push_back(i);
rank.push_back(0);
}
}
int find(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
} else {
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
};
int main(void) {
int N, L;
int tura[100010] = {};
ll res[100010] = {};
ll plus[100010] = {};
cin >> N >> L;
REP(i, N) { cin >> tura[i + 1]; }
int cnt = 1;
while (cnt) {
cnt = 0;
FOR(i, 1, N + 1) {
if (tura[i - 1] < tura[i] && tura[i + 1] < tura[i]) {
if (tura[i - 1])
plus[i - 1] = max(plus[i - 1], L - tura[i] + plus[i]);
if (tura[i + 1])
plus[i + 1] = max(plus[i + 1], L - tura[i] + plus[i]);
res[i] += plus[i] + L - tura[i];
plus[i] = 0;
tura[i] = 0;
cnt++;
}
}
}
ll ans = 0;
REP(i, N + 1) { ans = max(ans, res[i]); }
cout << ans << endl;
return 0;
}
|
[["+", 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
| 560
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define INF 1000000000
int main() {
int n, T;
cin >> n >> T;
int trr[110000] = {0};
rep(i, n) cin >> trr[i];
int ans = 0;
int sum = trr[0];
for (int i = 1; i <= n; i++) {
if (trr[i - 1] > trr[i] || i == n) {
ans = max(ans, sum);
sum = T - trr[i];
} else {
sum += T - trr[i];
}
}
sum = trr[0];
for (int i = 1; i <= n; i++) {
if (trr[i - 1] < trr[i] || i == n) {
ans = max(ans, sum);
sum = T - trr[i];
} else {
sum += T - trr[i];
}
}
printf("%d\n", ans);
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define INF 1000000000
int main() {
int n, T;
cin >> n >> T;
int trr[110000] = {0};
rep(i, n) cin >> trr[i];
int ans = 0;
int sum = T - trr[0];
for (int i = 1; i <= n; i++) {
if (trr[i - 1] > trr[i] || i == n) {
ans = max(ans, sum);
sum = T - trr[i];
} else {
sum += T - trr[i];
}
}
sum = T - trr[0];
for (int i = 1; i <= n; i++) {
if (trr[i - 1] < trr[i] || i == n) {
ans = max(ans, sum);
sum = T - trr[i];
} else {
sum += T - trr[i];
}
}
printf("%d\n", ans);
}
|
[["+", 8, 9, 0, 43, 49, 50, 51, 16, 31, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33]]
| 1
| 236
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
const ll INF = 1000000000000LL;
int main() {
int n, l;
cin >> n >> l;
ll a[100001];
bool used[100001];
fill(used, used + 100001, false);
for (int i = 0; i < n; i++)
cin >> a[i];
priority_queue<P> pq;
for (int i = 0; i < n; i++) {
if (i == 0) {
if (a[i + 1] < a[i]) {
pq.push(P(a[i], i));
used[i] = true;
}
} else if (i == n - 1) {
if (a[i] > a[i - 1]) {
pq.push(P(a[i], i));
used[i] = true;
}
} else {
if (a[i] > a[i - 1] && a[i] > a[i + 1]) {
used[i] = true;
pq.push(P(a[i], i));
}
}
}
ll diff = 0;
while (pq.size()) {
// ÅÉàÁÆàå«¢àÌðæèo·
ll length = 0;
vector<int> nums;
while (pq.size()) {
if (length == 0 || length == pq.top().first) {
if (length == 0)
diff += l - pq.top().first;
l = pq.top().first;
length = l;
// Ôði[
nums.push_back(pq.top().second);
a[pq.top().second] = -INF;
pq.pop();
} else
break;
}
// æèoµ½àÌ̶EÉ évfªðð½·æ¤ÉÈÁ½©²×é
for (int i = 0; i < nums.size(); i++) {
// ¶EÌvfð`FbN
int left = nums[i] - 1;
int right = nums[i] + 1;
// ðð½µ½çA élªZµ½àÌð}ü
if (left >= 0 && !used[left]) {
if (left == 0) {
if (a[left + 1] < a[left]) {
pq.push(P(a[left], left));
used[left] = true;
}
} else if (left == n - 1) {
if (a[left] > a[left - 1]) {
pq.push(P(a[left] - diff, left));
used[left] = true;
}
} else {
if (a[left] > a[left - 1] && a[left] > a[left + 1]) {
used[left] = true;
pq.push(P(a[left] - diff, left));
}
}
}
if (right < n && !used[right]) {
if (right == 0) {
if (a[right + 1] < a[right]) {
pq.push(P(a[right], right));
used[right] = true;
}
} else if (right == n - 1) {
if (a[right] > a[right - 1]) {
pq.push(P(a[right] - diff, right));
used[right] = true;
}
} else {
if (a[right] > a[right - 1] && a[right] > a[right + 1]) {
used[right] = true;
pq.push(P(a[right] - diff, right));
}
}
}
}
}
cout << diff << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
const ll INF = 1000000000000LL;
int main() {
int n, l;
cin >> n >> l;
ll a[100001];
bool used[100001];
fill(used, used + 100001, false);
for (int i = 0; i < n; i++)
cin >> a[i];
priority_queue<P> pq;
for (int i = 0; i < n; i++) {
if (i == 0) {
if (a[i + 1] < a[i]) {
pq.push(P(a[i], i));
used[i] = true;
}
} else if (i == n - 1) {
if (a[i] > a[i - 1]) {
pq.push(P(a[i], i));
used[i] = true;
}
} else {
if (a[i] > a[i - 1] && a[i] > a[i + 1]) {
used[i] = true;
pq.push(P(a[i], i));
}
}
}
ll diff = 0;
while (pq.size()) {
// ÅÉàÁÆàå«¢àÌðæèo·
ll length = 0;
vector<int> nums;
while (pq.size()) {
if (length == 0 || length == pq.top().first) {
if (length == 0)
diff += l - pq.top().first;
l = pq.top().first;
length = l;
// Ôði[
nums.push_back(pq.top().second);
a[pq.top().second] = -INF;
pq.pop();
} else
break;
}
// æèoµ½àÌ̶EÉ évfªðð½·æ¤ÉÈÁ½©²×é
for (int i = 0; i < nums.size(); i++) {
// ¶EÌvfð`FbN
int left = nums[i] - 1;
int right = nums[i] + 1;
// ðð½µ½çA élªZµ½àÌð}ü
if (left >= 0 && !used[left]) {
if (left == 0) {
if (a[left + 1] < a[left]) {
pq.push(P(a[left] - diff, left));
used[left] = true;
}
} else if (left == n - 1) {
if (a[left] > a[left - 1]) {
pq.push(P(a[left] - diff, left));
used[left] = true;
}
} else {
if (a[left] > a[left - 1] && a[left] > a[left + 1]) {
used[left] = true;
pq.push(P(a[left] - diff, left));
}
}
}
if (right < n && !used[right]) {
if (right == 0) {
if (a[right + 1] < a[right]) {
pq.push(P(a[right] - diff, right));
used[right] = true;
}
} else if (right == n - 1) {
if (a[right] > a[right - 1]) {
pq.push(P(a[right] - diff, right));
used[right] = true;
}
} else {
if (a[right] > a[right - 1] && a[right] > a[right + 1]) {
used[right] = true;
pq.push(P(a[right] - diff, right));
}
}
}
}
}
cout << diff << endl;
return 0;
}
|
[["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 22]]
| 1
| 771
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <vector>
using namespace std;
long long qw[100000], dp[100000], a, b;
long long solve(long long k) {
if (dp[k] > 0)
return dp[k];
if ((k == 0 && qw[k] > qw[k + 1]) || (k == a - 1 && qw[k] > qw[k - 1]) ||
(qw[k] > qw[k - 1] && qw[k] > qw[k + 1])) {
return dp[k] = b - qw[k];
}
if (k == 0)
return dp[k] = solve(1) + b - qw[k];
if (k == a - 1)
return dp[k] = solve(a - 2) + b - qw[k];
if (qw[k] < qw[k - 1])
dp[k] = max(dp[k], solve(k - 1) + b - qw[k]);
if (qw[k] < qw[k + 1])
dp[k] = max(dp[k], solve(k + 1) + b - qw[k]);
}
int main() {
scanf("%lld %lld", &a, &b);
for (int i = 0; i < a; i++) {
scanf("%lld", qw[i]);
}
for (int i = 0; i < a; i++)
int ru = solve(i);
printf("%d\n", *max_element(dp, dp + a));
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <vector>
using namespace std;
long long qw[100000], dp[100000], a, b;
long long solve(long long k) {
if (dp[k] > 0)
return dp[k];
if ((k == 0 && qw[k] > qw[k + 1]) || (k == a - 1 && qw[k] > qw[k - 1]) ||
(qw[k] > qw[k - 1] && qw[k] > qw[k + 1])) {
return dp[k] = b - qw[k];
}
if (k == 0)
return dp[k] = solve(1) + b - qw[k];
if (k == a - 1)
return dp[k] = solve(a - 2) + b - qw[k];
if (qw[k] < qw[k - 1])
dp[k] = max(dp[k], solve(k - 1) + b - qw[k]);
if (qw[k] < qw[k + 1])
dp[k] = max(dp[k], solve(k + 1) + b - qw[k]);
}
int main() {
scanf("%lld %lld", &a, &b);
for (int i = 0; i < a; i++) {
scanf("%lld", &qw[i]);
}
for (int i = 0; i < a; i++) {
int ru = solve(i);
}
printf("%d\n", *max_element(dp, dp + a));
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 360
|
#include <algorithm>
#include <cstdio>
#include <functional>
#include <queue>
using namespace std;
#define MN (100000)
int N, L;
int I[MN];
typedef pair<int, int> P;
int main() {
int cnt = 0;
int ctime = 0;
scanf("%d %d", &N, &L);
for (int i = 0; i < N; i++) {
scanf("%d", &I[i]);
}
priority_queue<P, vector<P>> Q;
for (int i = 0; i < N; i++) {
if ((i == 0 && I[i] > I[i + 1]) || (i == N - 1 && I[i] > I[i - 1]) ||
(I[i] > I[i + 1] && I[i] > I[i - 1])) {
Q.push(P(L - I[i], i));
}
}
while (!Q.empty()) {
P p = Q.top();
Q.pop();
ctime = p.first;
I[p.second] = 0;
int i = p.second - 1;
int j = p.second + 1;
if ((0 <= i && i < N) &&
((i == 0 && I[i] > I[i + 1]) || (i == N - 1 && I[i] > I[i - 1]) ||
(I[i] > I[i + 1] && I[i] > I[i - 1]))) {
Q.push(P(L - I[i] + ctime, i));
}
if ((0 <= j && j < N) &&
((j == 0 && I[j] > I[j + 1]) || (j == N - 1 && I[j] > I[j - 1]) ||
(I[j] > I[j + 1] && I[j] > I[j - 1]))) {
Q.push(P(L - I[j] + ctime, j));
I[j] = 0;
}
}
printf("%d\n", ctime);
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <functional>
#include <queue>
using namespace std;
#define MN (100000)
int N, L;
int I[MN];
typedef pair<int, int> P;
int main() {
int cnt = 0;
int ctime = 0;
scanf("%d %d", &N, &L);
for (int i = 0; i < N; i++) {
scanf("%d", &I[i]);
}
priority_queue<P, vector<P>, greater<P>> Q;
for (int i = 0; i < N; i++) {
if ((i == 0 && I[i] > I[i + 1]) || (i == N - 1 && I[i] > I[i - 1]) ||
(I[i] > I[i + 1] && I[i] > I[i - 1])) {
Q.push(P(L - I[i], i));
}
}
while (!Q.empty()) {
P p = Q.top();
Q.pop();
ctime = p.first;
// printf("\t%d\n", ctime);
I[p.second] = 0;
int i = p.second - 1;
int j = p.second + 1;
if ((0 <= i && i < N) &&
((i == 0 && I[i] > I[i + 1]) || (i == N - 1 && I[i] > I[i - 1]) ||
(I[i] > I[i + 1] && I[i] > I[i - 1]))) {
Q.push(P(L - I[i] + ctime, i));
}
if ((0 <= j && j < N) &&
((j == 0 && I[j] > I[j + 1]) || (j == N - 1 && I[j] > I[j - 1]) ||
(I[j] > I[j + 1] && I[j] > I[j - 1]))) {
Q.push(P(L - I[j] + ctime, j));
I[j] = 0;
}
}
printf("%d\n", ctime);
return 0;
}
|
[["+", 8, 9, 0, 43, 39, 344, 3, 347, 0, 21], ["+", 39, 344, 3, 347, 0, 77, 39, 344, 141, 78], ["+", 3, 347, 0, 77, 39, 344, 3, 347, 0, 18], ["+", 0, 77, 39, 344, 3, 347, 0, 77, 39, 78], ["+", 3, 347, 0, 77, 39, 344, 3, 347, 0, 47]]
| 1
| 482
|
#include <cstdio>
#include <queue>
#include <utility>
using namespace std;
#define max(a, b) ((a) >= (b) ? (a) : (b))
typedef pair<int, int> P;
int T[100002];
int main() {
priority_queue<P> Q;
int N, L;
scanf("%d %d", &N, &L);
for (int i = 1; i <= N; i++) {
int a;
scanf("%d", &a);
Q.push(P(a, i));
}
while (!Q.empty()) {
P p = Q.top();
Q.pop();
T[p.second] = max(T[p.second - 1], T[p.second + 1]) + (L - p.first);
}
int ans = 0;
for (int i = 0; i < N; i++)
ans = max(ans, T[i]);
printf("%d\n", ans);
}
|
#include <cstdio>
#include <queue>
#include <utility>
using namespace std;
#define max(a, b) ((a) >= (b) ? (a) : (b))
typedef pair<int, int> P;
int T[100002];
int main() {
priority_queue<P> Q;
int N, L;
scanf("%d %d", &N, &L);
for (int i = 1; i <= N; i++) {
int a;
scanf("%d", &a);
Q.push(P(a, i));
}
while (!Q.empty()) {
P p = Q.top();
Q.pop();
T[p.second] = max(T[p.second - 1], T[p.second + 1]) + (L - p.first);
}
int ans = 0;
for (int i = 1; i <= N; i++)
ans = max(ans, T[i]);
printf("%d\n", ans);
}
|
[["-", 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, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 207
|
#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 make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, b, n) for (int i = b; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
const int INF = 1 << 29;
const double EPS = 1e-9;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const int MAX_N = 100010;
int dp[MAX_N]; // i番目のつららが折れる時刻。つまりi!=0ならば既に折れている
pii len[MAX_N];
int n, L;
int main() {
cin >> n >> L;
for (int i = 1; i <= n; i++) {
cin >> len[i].first;
len[i].second = i;
}
len[0].first = 0;
len[0].second = 0;
/*rep(i,n+2){
cout <<len[i].first<<endl;
}*/
sort(len + 1, len + n, greater<pii>());
memset(dp, 0, sizeof(dp));
int ans = 0;
for (int i = 1; i <= n; i++) {
int id = len[i].second;
dp[id] = L - len[i].first + max(dp[id - 1], dp[id + 1]);
ans = max(ans, dp[id]);
}
cout << ans << endl;
}
|
#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 make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, b, n) for (int i = b; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
const int INF = 1 << 29;
const double EPS = 1e-9;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const int MAX_N = 100010;
int dp[MAX_N]; // i番目のつららが折れる時刻。つまりi!=0ならば既に折れている
pii len[MAX_N];
int n, L;
int main() {
cin >> n >> L;
for (int i = 1; i <= n; i++) {
cin >> len[i].first;
len[i].second = i;
}
len[0].first = 0;
len[0].second = 0;
/*rep(i,n+2){
cout <<len[i].first<<endl;
}*/
sort(len + 1, len + n + 1, greater<pii>());
memset(dp, 0, sizeof(dp));
int ans = 0;
for (int i = 1; i <= n; i++) {
int id = len[i].second;
dp[id] = L - len[i].first + max(dp[id - 1], dp[id + 1]);
ans = max(ans, dp[id]);
}
cout << ans << endl;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 359
|
n, L = list(map(int, input().split()))
dp = [0] * (n+2)
l = [0]
for i in range(n):
l += [eval(input())]
dp[i+1] = L - l[i+1]
l += [0]
for i in range(1,n):
if l[i] < l[i-1]: dp[i] = dp[i-1] + (L - l[i])
ans = 0
for i in range(n,0,-1):
if l[i] < l[i+1]:
dp[i] = max(dp[i], dp[i+1] + (L - l[i]))
ans = max(ans, dp[i])
print(ans)
|
n, L = list(map(int, input().split()))
dp = [0] * (n+2)
l = [0]
for i in range(n):
l += [eval(input())]
dp[i+1] = L - l[i+1]
l += [0]
for i in range(1,n+1):
if l[i] < l[i-1]: dp[i] = dp[i-1] + (L - l[i])
ans = 0
for i in range(n,0,-1):
if l[i] < l[i+1]:
dp[i] = max(dp[i], dp[i+1] + (L - l[i]))
ans = max(ans, dp[i])
print(ans)
|
[["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]]
| 5
| 188
|
def orderN(N,L,ices):
upPeak = L - ices[0]
downPeak = L - ices[0]
peaks = []
for i in range(len(ices)):
if i < N-1:
if ices[i] < ices[i+1]:
peaks.append(downPeak)
downPeak = L - ices[i+1]
upPeak += L - ices[i+1]
else:
peaks.append(upPeak)
upPeak = L - ices[i+1]
downPeak += L - ices[i+1]
else:
peaks.append(upPeak)
peaks.append(downPeak)
print((max(peaks)))
N,L = list(map(int,rawinput().strip().split()))
ices = []
while True:
ice = int(rawinput().strip())
ices.append(ice)
if len(ices) == N:
break
orderN(N,L,ices)
|
def orderN(N,L,ices):
upPeak = L - ices[0]
downPeak = L - ices[0]
peaks = []
for i in range(len(ices)):
if i < N-1:
if ices[i] < ices[i+1]:
peaks.append(downPeak)
downPeak = L - ices[i+1]
upPeak += L - ices[i+1]
else:
peaks.append(upPeak)
upPeak = L - ices[i+1]
downPeak += L - ices[i+1]
else:
peaks.append(upPeak)
peaks.append(downPeak)
print((max(peaks)))
N,L = list(map(int,input().strip().split()))
ices = []
while True:
ice = int(input().strip())
ices.append(ice)
if len(ices) == N:
break
orderN(N,L,ices)
|
[["-", 63, 319, 500, 652, 63, 319, 500, 652, 63, 22], ["+", 63, 319, 500, 652, 63, 319, 500, 652, 63, 22], ["-", 3, 4, 0, 652, 63, 319, 500, 652, 63, 22], ["+", 3, 4, 0, 652, 63, 319, 500, 652, 63, 22]]
| 5
| 203
|
def solve():
n,l = map(int,input().split())
length = [int(input()) for i in range(n)]
pare = [(length[i], i) for i in range(n)]
pare.sort(reverse=True)
dp = [0] * (n + 1)
for p in pare:
i = p[0]
if i == 0:
dp[i] = dp[i + 1] + (l - length[i])
else:
dp[i] = max(dp[i - 1], dp[i + 1]) + (l - length[i])
print(max(dp))
solve()
|
def solve():
n,l = map(int,input().split())
length = [int(input()) for i in range(n)]
pare = [(length[i], i) for i in range(n)]
pare.sort(reverse=True)
dp = [0] * (n + 1)
for p in pare:
i = p[1]
if i == 0:
dp[i] = dp[i + 1] + (l - length[i])
else:
dp[i] = max(dp[i - 1], dp[i + 1]) + (l - length[i])
print(max(dp))
solve()
|
[["-", 8, 196, 0, 1, 0, 662, 12, 206, 206, 612], ["+", 8, 196, 0, 1, 0, 662, 12, 206, 206, 612]]
| 5
| 154
|
#include <algorithm>
#include <cstdio>
using namespace std;
#define R for (i = 0; i < n; ++i)
int a[1 << 17], b[1 << 17], amn = 1e7, amx = -1e7, bmn = 1e7, bmx = -1e7, n, c,
d, ow = -1e7, oh = 1e7, i;
int main() {
scanf("%d", &n);
R {
scanf("%d %d", &c, &d);
a[i] = c + d;
b[i] = c - d;
amn = min(amn, a[i]);
amx = max(amx, a[i]);
bmn = min(bmn, b[i]);
bmx = max(bmx, b[i]);
}
R {
ow = max(ow, min(max(a[i] - amn, b[i] - bmn), max(amx - a[i], bmx - b[i])));
oh = max(oh, min(max(a[i] - amn, bmx - b[i]), max(amx - a[i], b[i] - bmn)));
}
printf("%d\n", min(ow, oh));
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
#define R for (i = 0; i < n; ++i)
int a[1 << 17], b[1 << 17], amn = 1e7, amx = -1e7, bmn = 1e7, bmx = -1e7, n, c,
d, ow = -1e7, oh = -1e7, i;
int main() {
scanf("%d", &n);
R {
scanf("%d %d", &c, &d);
a[i] = c + d;
b[i] = c - d;
amn = min(amn, a[i]);
amx = max(amx, a[i]);
bmn = min(bmn, b[i]);
bmx = max(bmx, b[i]);
}
R {
ow = max(ow, min(max(a[i] - amn, b[i] - bmn), max(amx - a[i], bmx - b[i])));
oh = max(oh, min(max(a[i] - amn, bmx - b[i]), max(amx - a[i], b[i] - bmn)));
}
printf("%d\n", min(ow, oh));
}
|
[["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]]
| 1
| 264
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define INF (2 << 28)
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<int, int> iP;
ll llabs(ll a, ll b) { return (a < b ? b - a : a - b); }
int main() {
int n;
ll a[111111], b[111111], amax, amin, bmax, bmin;
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a[i] = x + y;
b[i] = x - y;
}
amax = *max_element(a, a + n);
amin = *min_element(a, a + n);
bmax = *max_element(b, b + n);
bmin = *min_element(b, b + n);
ll aaa = 0, bbb = 0;
for (int i = 0; i < n; i++) {
aaa = max(aaa, min(max(llabs(amax - a[i]), llabs(bmax - b[i])),
max(llabs(amin - a[i]), llabs(bmin - b[i]))));
bbb = max(aaa, min(max(llabs(amax - a[i]), llabs(bmin - b[i])),
max(llabs(amin - a[i]), llabs(bmax - b[i]))));
}
cout << min(aaa, bbb) << endl;
}
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define INF (2 << 28)
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<int, int> iP;
ll llabs(ll a, ll b) { return (a < b ? b - a : a - b); }
int main() {
int n;
ll a[111111], b[111111], amax, amin, bmax, bmin;
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a[i] = x + y;
b[i] = x - y;
}
amax = *max_element(a, a + n);
amin = *min_element(a, a + n);
bmax = *max_element(b, b + n);
bmin = *min_element(b, b + n);
ll aaa = 0, bbb = 0;
for (int i = 0; i < n; i++) {
aaa = max(aaa, min(max(llabs(amax - a[i]), llabs(bmax - b[i])),
max(llabs(amin - a[i]), llabs(bmin - b[i]))));
bbb = max(bbb, min(max(llabs(amax - a[i]), llabs(bmin - b[i])),
max(llabs(amin - a[i]), llabs(bmax - b[i]))));
}
cout << min(aaa, bbb) << endl;
}
|
[["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]]
| 1
| 356
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int MAX = 10000000;
int main() {
int n, a, b, xmin = MAX, ymin = MAX, xmax = 0, ymax = 0, ans = 0, ans2 = 0, c,
d;
vector<int> X, Y;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
X.push_back(a + b);
Y.push_back(a - b);
xmin = min(xmin, a + b);
ymin = min(ymin, a - b);
xmax = max(xmax, a + b);
ymax = max(ymax, a - b);
}
for (int i = 0; i < n; i++) {
c = max(xmax - X[i], Y[i] - ymin);
d = max(X[i] - xmin, ymax - Y[i]);
ans = max(ans, min(c, d));
}
for (int i = 0; i < n; i++) {
c = max(xmax - X[i], ymax - Y[i]);
d = max(X[i] - xmin, Y[i] - ymin);
ans2 = max(ans, min(c, d));
}
printf("%d\n", min(ans, ans2));
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int MAX = 10000000;
int main() {
int n, a, b, xmin = MAX, ymin = MAX, xmax = 0, ymax = 0, ans = 0, ans2 = 0, c,
d;
vector<int> X, Y;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
X.push_back(a + b);
Y.push_back(a - b);
xmin = min(xmin, a + b);
ymin = min(ymin, a - b);
xmax = max(xmax, a + b);
ymax = max(ymax, a - b);
}
for (int i = 0; i < n; i++) {
c = max(xmax - X[i], Y[i] - ymin);
d = max(X[i] - xmin, ymax - Y[i]);
ans = max(ans, min(c, d));
}
for (int i = 0; i < n; i++) {
c = max(xmax - X[i], ymax - Y[i]);
d = max(X[i] - xmin, Y[i] - ymin);
ans2 = max(ans2, min(c, d));
}
printf("%d\n", min(ans, ans2));
return 0;
}
|
[["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]]
| 1
| 336
|
#include <algorithm>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define int long long
using namespace std;
int x[100000], y[100000];
signed main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
x[i] = a + b, y[i] = a - b;
}
int minx = *min_element(x, x + n);
int maxx = *max_element(x, x + n);
int miny = *min_element(y, y + n);
int maxy = *max_element(y, y + n);
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
a = max(a,
min(max(x[i] - minx, y[i] - miny), max(maxx - x[i], maxy - y[i])));
b = max(a,
min(max(x[i] - minx, maxy - y[i]), max(maxx - x[i], y[i] - miny)));
}
cout << min(a, b) << endl;
}
|
#include <algorithm>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define int long long
using namespace std;
int x[100000], y[100000];
signed main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
x[i] = a + b, y[i] = a - b;
}
int minx = *min_element(x, x + n);
int maxx = *max_element(x, x + n);
int miny = *min_element(y, y + n);
int maxy = *max_element(y, y + n);
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
a = max(a,
min(max(x[i] - minx, y[i] - miny), max(maxx - x[i], maxy - y[i])));
b = max(b,
min(max(x[i] - minx, maxy - y[i]), max(maxx - x[i], y[i] - miny)));
}
cout << min(a, b) << endl;
}
|
[["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]]
| 1
| 284
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.