problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03013 | // 復習
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<bool> safe(n + 1, true);
for (int i = 0; i < m; ++i) {
int a;
cin >> a;
safe[a] = false;
}
vector<... | // 復習
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<bool> safe(n + 1, true);
for (int i = 0; i < m; ++i) {
int a;
cin >> a;
safe[a] = false;
}
vector<... | [
"assignment.change"
] | 826,409 | 826,410 | u436741428 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
long x = 1000000007;
long n, m;
cin >> n >> m;
vector<bool> a(n + 1);
for (long i = 0; i < m; i++) {
int k;
cin >> k;
a.at(k) = true;
}
vector<long> p(n + 1, 0);
p.at(0) = !a.at(0);
if (n > 1)
p.at(1) = !a.at(1);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long x = 1000000007;
long n, m;
cin >> n >> m;
vector<bool> a(n + 1);
for (long i = 0; i < m; i++) {
int k;
cin >> k;
a.at(k) = true;
}
vector<long> p(n + 1, 0);
p.at(0) = !a.at(0);
p.at(1) = !a.at(1);
for (int i = 2; i < n + 1;... | [] | 826,443 | 826,444 | u813174766 | cpp |
p03013 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define T = 1000000007
using namespace std;
long long *a;
const long long mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
a = new long long[n + 2];
a[0] = 1;
a[1] = 1;
for (int i = 1; i < n + 2; i++) {
a[i] = -1;
}
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define T = 1000000007
using namespace std;
long long *a;
const long long mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
a = new long long[n + 1];
a[0] = 1;
a[1] = 1;
for (int i = 2; i < n + 1; i++) {
a[i] = -1;
}
... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 826,462 | 826,463 | u020230257 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
bool z[100011];
int ans[100011];
int n, m;
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
z[a] = true;
}
z[0] = 1;
z[1] = (int)(!z[1]) * 1;
for (int i = 2; i <= n; i++)
if (!z[i])
ans[i] = (ans[i - 1] + ans[i - 2... | #include <bits/stdc++.h>
using namespace std;
bool z[100011];
int ans[100011];
int n, m;
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
z[a] = true;
}
ans[0] = 1;
ans[1] = (int)(!z[1]) * 1;
for (int i = 2; i <= n; i++)
if (!z[i])
ans[i] = (ans[i - 1] + ans[i... | [
"assignment.variable.change",
"identifier.change"
] | 826,466 | 826,467 | u514602572 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
bool z[100011];
int ans[100011];
int n, m;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
z[a] = true;
}
z[0] = 1;
z[1] = (int)(!z[1]) * 1;
for (int i = 2; i <= n; i++)
if (!z[i])
ans[i] = (ans[i - 1] + ans[i - 2... | #include <bits/stdc++.h>
using namespace std;
bool z[100011];
int ans[100011];
int n, m;
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
z[a] = true;
}
ans[0] = 1;
ans[1] = (int)(!z[1]) * 1;
for (int i = 2; i <= n; i++)
if (!z[i])
ans[i] = (ans[i - 1] + ans[i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 826,468 | 826,467 | u514602572 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll a[n + 7] = {0};
a[0] = 1;
int m;
cin >> m;
for (int i = 0; i < m; i++) {
int t;
cin >> t;
a[t] = -1;
}
if (a[1] != -1)
a[1] = 1;
else
a[1] = 0;
for (int i = 2; i < n + 1; i++)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll a[n + 7] = {0};
a[0] = 1;
int m;
cin >> m;
for (int i = 0; i < m; i++) {
int t;
cin >> t;
a[t] = -1;
}
if (a[1] != -1)
a[1] = 1;
else
a[1] = 0;
for (int i = 2; i < n + 1; i++)... | [
"assignment.change"
] | 826,478 | 826,479 | u466568754 | cpp |
p03013 | #include "bits/stdc++.h"
using namespace std;
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
#define OUT(P) cout << (P) << endl
#define OUT2(P1, P2) cout << (P1) << " " << (P2) << endl
#define PRINT_ARRAY(P) \
for (int i = 0; i < P.size(); i++) ... | #include "bits/stdc++.h"
using namespace std;
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
#define OUT(P) cout << (P) << endl
#define OUT2(P1, P2) cout << (P1) << " " << (P2) << endl
#define PRINT_ARRAY(P) \
for (int i = 0; i < P.size(); i++) ... | [
"assignment.change"
] | 826,491 | 826,492 | u026686258 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m, false);
for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n + 1, false);
for... | [
"assignment.change"
] | 826,515 | 826,516 | u167755809 | cpp |
p03013 | // dp(n) = dp(n-1) + dp(n-2) で, a の値によって分岐する.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = (1 << 30) - 1;
const ll MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
// 段数と一致させたいので N+1 個を true で初期化
vector<int> oks(N + 1, true);
for (int i = 0; i < M; i++) {
int... | // dp(n) = dp(n-1) + dp(n-2) で, a の値によって分岐する.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = (1 << 30) - 1;
const ll MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
// 0 ~ N 段目を考えるので N+1
vector<int> oks(N + 1, true);
for (int i = 0; i < M; i++) {
int a;
ci... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,521 | 826,522 | u933685059 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#defin... | [
"expression.operator.compare.change",
"preprocessor.define.value.change",
"variable_declaration.type.change",
"expression.operation.binary.change"
] | 826,527 | 826,528 | u995997203 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<bool> broken(n, false);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<ll> fib(n);
int j = 0;
fib[0] = 1;
... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<bool> broken(n + 1, false);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<ll> fib(n + 1);
int j = 0;
fib[0]... | [
"assignment.change"
] | 826,533 | 826,534 | u240685518 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll sum = 0;
int main() {
ll N, M;
ll waru = 1000000007;
cin >> ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll sum = 0;
int main() {
ll N, M;
ll waru = 1000000007;
cin >> ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,541 | 826,542 | u048791623 | cpp |
p03013 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define ll long long
#define MOD 1000000007
#define ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define ll long long
#define MOD 1000000007
#define ... | [
"literal.number.change",
"assignment.value.change"
] | 826,554 | 826,555 | u702496216 | cpp |
p03013 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define ll long long
#define MOD 1000000007
#define ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define ll long long
#define MOD 1000000007
#define ... | [
"literal.number.change",
"assignment.value.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 826,556 | 826,555 | u702496216 | cpp |
p03013 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define ll long long
#define MOD 1000000007
#define ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define ll long long
#define MOD 1000000007
#define ... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 826,557 | 826,555 | u702496216 | cpp |
p03013 | #include "bits/stdc++.h"
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> check(N + 1, true);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
check[a] = false;
}
vector<long long int> dp(N + 1);
dp[0] = 1;
for (int i = 0; i < N; i++) {
... | #include "bits/stdc++.h"
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> check(N + 1, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
check[a] = false;
}
vector<long long int> dp(N + 1);
dp[0] = 1;
for (int i = 0; i < N; i++) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 826,574 | 826,575 | u887207211 | cpp |
p03013 | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++i)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++i)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | [
"expression.operation.binary.add"
] | 826,577 | 826,578 | u535810324 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<bool> b(n, true);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
b[a] = false;
}
vector<long long> dp(n + 1, 0);
dp[0] = 1;
for (int i = 0; i < n; i++) {
... | #include <iostream>
#include <vector>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<bool> b(n, true);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
b[a] = false;
}
vector<long long> dp(n + 1, 0);
dp[0] = 1;
for (int i = 0; i < n; i++) {
... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 826,605 | 826,606 | u513736711 | cpp |
p03013 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
const int mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> a(N, true);
for ... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
const int mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> a(N + 1, true);
... | [
"assignment.change"
] | 826,610 | 826,611 | u547844563 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
stati... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
stati... | [
"literal.number.change"
] | 826,635 | 826,636 | u747087681 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
long long md = 1000000007;
int main() {
int n;
int m;
cin >> n >> m;
vector<int> a(n + 1, 0);
for (int i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = -1;
}
vector<long long> dp(n + 1);
dp[0] = 1;
if (a[1] == -1)
dp[1] = 0;
else... | #include <iostream>
#include <vector>
using namespace std;
long long md = 1000000007;
int main() {
int n;
int m;
cin >> n >> m;
vector<int> a(n + 1, 0);
for (int i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = -1;
}
vector<long long> dp(n + 1);
dp[0] = 1;
if (a[1] == -1)
dp[1] = 0;
else... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 826,637 | 826,638 | u435266469 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> broken(N, 0);
rep(i, M) {
int x;
cin >> x;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> broken(N, 0);
rep(i, M) {
int x;
cin >> x;
... | [
"assignment.change"
] | 826,652 | 826,653 | u356539385 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 826,659 | 826,660 | u592686932 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"variable_declaration.type.change"
] | 826,661 | 826,660 | u592686932 | cpp |
p03013 | #include <algorithm>
#include <assert.h>
#include <complex>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered... | #include <algorithm>
#include <assert.h>
#include <complex>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 826,670 | 826,671 | u018828540 | cpp |
p03013 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
const int mod = 1000000007;
vector<int> dp(n + 2);
dp... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
const int mod = 1000000007;
vector<int> dp(n + 2);
dp... | [] | 826,680 | 826,681 | u765789766 | cpp |
p03013 | #include <algorithm>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#ifdef DEBUG
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif... | #include <algorithm>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#ifdef DEBUG
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif... | [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 826,691 | 826,692 | u842192201 | cpp |
p03013 | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 826,711 | 826,712 | u757738907 | cpp |
p03013 | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 826,713 | 826,712 | u757738907 | cpp |
p03013 | /*input
9
*/
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long
#define mod 1000000007
#define inf 1000000000000000001
#define all(c) c.begin(), c.end()
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define sz(a) int((a).size())
#define pb push_back
#define tr(c, i)... | /*input
9
*/
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long
#define mod 1000000007
#define inf 1000000000000000001
#define all(c) c.begin(), c.end()
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define sz(a) int((a).size())
#define pb push_back
#define tr(c, i)... | [
"literal.number.change",
"assignment.value.change"
] | 826,725 | 826,726 | u297921353 | cpp |
p03013 | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
#define int long long
int stairs[100005];
set<int> s;
const int mod = 1000000007;
int32_t main() {
stairs[0] = 1;
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x;
cin >> x;
s.insert(x);
}
if (!(*s.lower_bou... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
#define int long long
int stairs[100005];
set<int> s;
const int mod = 1000000007;
int32_t main() {
stairs[0] = 1;
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x;
cin >> x;
s.insert(x);
}
if (!(*s.lower_bou... | [
"control_flow.branch.else.remove"
] | 826,736 | 826,737 | u488087935 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, m... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,746 | 826,747 | u703214333 | cpp |
p03013 | // abca29c.cpp : Typical Stairs
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
#define rp(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<bool> ok(n + 1, true);
rp(i, n) {
int a;
cin >> a;
ok[a] = false;
}
vector<ll>... | // abca29c.cpp : Typical Stairs
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
#define rp(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<bool> ok(n + 1, true);
rp(i, m) {
int a;
cin >> a;
ok[a] = false;
}
vector<ll>... | [] | 826,750 | 826,751 | u525065967 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1, 0);
vector<long> dp(n + 1, 0);
const int mod = 1000000007;
for (int i = 0; i < m; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1, 0);
vector<long long> dp(n + 2, 0);
const int mod = 1000000007;
for (int i = 0; i < m; i++) {... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,752 | 826,753 | u100919930 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1, 0);
vector<int> dp(n + 1, 0);
const int mod = 1000000007;
for (int i = 0; i < m; i++) {
i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1, 0);
vector<long long> dp(n + 2, 0);
const int mod = 1000000007;
for (int i = 0; i < m; i++) {... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,754 | 826,753 | u100919930 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define INF 1e9
typedef long long LL;
const LL mod = 1e9 + 7;
int main() {
LL N, M;
cin >> N >> M;
vector<LL> a(N + 1);
rep(i, M) {
int num;
cin >> num;
a[num] = 1;
}
vector<LL> dp(N);
dp[0] = 1;
if... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define INF 1e9
typedef long long LL;
const LL mod = 1e9 + 7;
int main() {
LL N, M;
cin >> N >> M;
vector<LL> a(N + 1);
rep(i, M) {
int num;
cin >> num;
a[num] = 1;
}
vector<LL> dp(N + 1);
dp[0] = 1;
... | [
"assignment.change"
] | 826,764 | 826,765 | u293072892 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> ok(N + 1, true);
int a;
for (int i = 0; i < N; i++) {
cin >> a;
ok[a] = false;
}
vector<int> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
for (int... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> ok(N + 1, true);
int a;
for (int i = 0; i < M; i++) {
cin >> a;
ok[a] = false;
}
vector<int> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
for (int... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 826,766 | 826,767 | u863841238 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> ok(N + 1, true);
int a;
for (int i = 0; i < M; i++) {
cin >> a;
ok[i] = false;
}
vector<long long> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
fo... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> ok(N + 1, true);
int a;
for (int i = 0; i < M; i++) {
cin >> a;
ok[a] = false;
}
vector<int> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
for (int... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 826,768 | 826,767 | u863841238 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9;
int main() {
int N, M;
cin >> N >> M;
vector<bool> ok(N + 1, true);
int a;
for (int i = 0; i < M; i++) {
cin >> a;
ok[i] = false;
}
vector<long long> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
for (i... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> ok(N + 1, true);
int a;
for (int i = 0; i < M; i++) {
cin >> a;
ok[a] = false;
}
vector<int> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
for (int... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 826,769 | 826,767 | u863841238 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> ok(N + 1, true);
int a;
for (int i = 0; i < M; i++) {
cin >> a;
ok[i] = false;
}
vector<long long> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
fo... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> ok(N + 1, true);
int a;
for (int i = 0; i < M; i++) {
cin >> a;
ok[a] = false;
}
vector<long long> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
fo... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 826,768 | 826,770 | u863841238 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9;
int main() {
int N, M;
cin >> N >> M;
vector<bool> ok(N + 1, true);
int a;
for (int i = 0; i < M; i++) {
cin >> a;
ok[i] = false;
}
vector<long long> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
for (i... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> ok(N + 1, true);
int a;
for (int i = 0; i < M; i++) {
cin >> a;
ok[a] = false;
}
vector<long long> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
fo... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 826,769 | 826,770 | u863841238 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(... | [] | 826,771 | 826,772 | u023473244 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n);
rep(i, n) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
fo... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
fo... | [] | 826,778 | 826,779 | u653482689 | cpp |
p03013 | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
// fatorial.cpp depend on this.
#ifndef MOD_INT
#define MOD_INT
template <int mod> struct ModInt {
private:
int x;
p... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
// fatorial.cpp depend on this.
#ifndef MOD_INT
#define MOD_INT
template <int mod> struct ModInt {
private:
int x;
p... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,784 | 826,785 | u660834360 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<bool> x(n + 1, true);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
x.at(a) = false;
}
vector<long long> v(n + 1);
v.at(0) = 1;
if (x.at(1))
v.at(1) = 1;
else
v.at(1) = 0;
for (int i = 2;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<bool> x(n + 1, true);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
x.at(a) = false;
}
vector<long long> v(n + 1);
v.at(0) = 1;
if (x.at(1))
v.at(1) = 1;
else
v.at(1) = 0;
for (int i = 2;... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 826,788 | 826,789 | u422633119 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<bool> boroken(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
boroken[a] = true;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<bool> boroken(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
boroken[a] = true;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) ... | [
"assignment.change",
"expression.operation.binary.remove"
] | 826,809 | 826,810 | u927804708 | cpp |
p03013 | #include <iostream>
#include <vector>
typedef long long ll;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
signed main() {
int n, m;
cin >> n >> m;
vector<int> broken(n);
rep(i, n) {
int a;
cin >> a;
broken[a] = 1; // 1 ~= true
}
vector<int> dp(n + 2... | #include <iostream>
#include <vector>
typedef long long ll;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
signed main() {
int n, m;
cin >> n >> m;
vector<int> broken(n);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1; // 1 ~= true
}
vector<int> dp(n + 2... | [] | 826,817 | 826,818 | u539199630 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 826,830 | 826,831 | u509680664 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 826,832 | 826,831 | u509680664 | cpp |
p03013 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
... | [
"assignment.change"
] | 826,840 | 826,841 | u032189172 | cpp |
p03013 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
... | [
"assignment.change"
] | 826,842 | 826,841 | u032189172 | cpp |
p03013 | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 1);
... | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,857 | 826,858 | u640827947 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
lli mod = 1000000007;
int main() {
lli n, m;
cin >> n >> m;
lli temp;
set<lli> forbidden;
for (lli i = 0; i < m; i++) {
cin >> temp;
forbidden.insert(temp - 1);
}
if (n == 1) {
cout << 1 << endl;
return 0;
}
vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
lli mod = 1000000007;
int main() {
lli n, m;
cin >> n >> m;
lli temp;
set<lli> forbidden;
for (lli i = 0; i < m; i++) {
cin >> temp;
forbidden.insert(temp - 1);
}
if (n == 1) {
cout << 1 << endl;
return 0;
}
vec... | [
"expression.operation.binary.add"
] | 826,859 | 826,860 | u354354727 | cpp |
p03013 | #include <algorithm>
#include <iostream>
#include <vector>
int n, m;
long long ans = 0;
std::vector<int> brokenList(1, 0);
int main() {
std::cin >> n >> m;
for (int idx = 0; idx < m; ++idx) {
int num;
std::cin >> num;
brokenList.push_back(num);
}
std::sort(brokenList.begin(), brokenList.end());
... | #include <algorithm>
#include <iostream>
#include <vector>
int n, m;
long long ans = 0;
std::vector<int> brokenList(1, -1);
int main() {
std::cin >> n >> m;
for (int idx = 0; idx < m; ++idx) {
int num;
std::cin >> num;
brokenList.push_back(num);
}
std::sort(brokenList.begin(), brokenList.end());
... | [
"literal.number.change",
"call.arguments.change"
] | 826,873 | 826,874 | u934073187 | cpp |
p03013 | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end() // 昇順ソート 例：sort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend() // 降順ソート 例:sort(DESC(vec));
#define rep(i, n) for (i = 0; i < n; i++)
#define Rep(i, n) for (i = 1; i < n; i++)
#define Ans(s) cout << s << endl;
const int inf = ... | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end() // 昇順ソート 例：sort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend() // 降順ソート 例:sort(DESC(vec));
#define rep(i, n) for (i = 0; i < n; i++)
#define Rep(i, n) for (i = 1; i < n; i++)
#define Ans(s) cout << s << endl;
const int inf = ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 826,880 | 826,881 | u666683460 | cpp |
p03013 | #include <iostream>
using namespace std;
const int maxN = 100000;
int N, M;
bool isBroken[maxN + 1];
int dp[maxN + 1];
int rec(int dan) {
if (dan == N) {
return 1;
}
if (dan > N)
return 0;
int res = 0;
if (!isBroken[dan + 1]) {
int c;
if (dp[dan + 1] != -1) {
c = dp[dan + 1];
} ... | #include <iostream>
using namespace std;
const int maxN = 100000;
int N, M;
bool isBroken[maxN + 1];
int dp[maxN + 1];
int rec(int dan) {
if (dan == N) {
return 1;
}
if (dan > N)
return 0;
int res = 0;
if (!isBroken[dan + 1]) {
int c;
if (dp[dan + 1] != -1) {
c = dp[dan + 1];
} ... | [
"assignment.add"
] | 826,900 | 826,901 | u657541767 | cpp |
p03013 | #include <iostream>
using namespace std;
#define MOD 1000000000 + 7
int N, M;
long long A[10 + 10];
long long dp[10 + 10];
int main(void) {
cin >> N >> M;
for (int i = 0; i < M; i++) {
long long temp;
cin >> temp;
A[temp] = 1;
}
dp[0] = 1;
for (int n = 1; n <= N; n++) {
if (A[n] == 1) {
... | #include <iostream>
using namespace std;
#define MOD 1000000000 + 7
int N, M;
long long A[100000 + 10];
long long dp[100000 + 10];
int main(void) {
cin >> N >> M;
for (int i = 0; i < M; i++) {
long long temp;
cin >> temp;
A[temp] = 1;
}
dp[0] = 1;
for (int n = 1; n <= N; n++) {
if (A[n] =... | [
"literal.number.change",
"expression.operation.binary.change"
] | 826,904 | 826,905 | u614314290 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> broken(N + 1);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(N + 2);
const int mod = 1000000007;
dp[N] = 1;
for (int j = N - 1; j >= 0; j--) {
if (bro... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> broken(N + 1);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(N + 2);
const int mod = 1e9 + 7;
dp[N] = 1;
for (int j = N - 1; j >= 0; j--) {
if (broken... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change"
] | 826,910 | 826,911 | u464527162 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> broken(N + 1);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(N + 2);
const int mod = 1e9 + 7;
dp[N] = 1;
for (int j = N - 1; j >= 0; j--) {
if (broken... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> broken(N + 1);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(N + 2);
const int mod = 1e9 + 7;
dp[N] = 1;
for (int j = N - 1; j >= 0; j--) {
if (broken... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 826,912 | 826,911 | u464527162 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> broken(N + 1);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(N + 2);
const long long mod = 1e9 + 7;
dp[N] = 1;
for (int j = N - 1; j >= 0; j--) {
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> broken(N + 1);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(N + 2);
const int mod = 1e9 + 7;
dp[N] = 1;
for (int j = N - 1; j >= 0; j--) {
if (broken... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 826,913 | 826,911 | u464527162 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> broken(N + 1);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(N + 2);
const long long mod = 1e9 + 7;
dp[N] = 1;
for (int j = N - 1; j >= 0; j--) {
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> broken(N + 1);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(N + 2);
const int mod = 1e9 + 7;
dp[N] = 1;
for (int j = N - 1; j >= 0; j--) {
if (broken... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 826,914 | 826,911 | u464527162 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> broken(N + 1);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(N + 2);
const long long mod = 1e9 + 7;
dp[0] = 1;
for (int j = N - 1; j >= 0; j--) {
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> broken(N + 1);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(N + 2);
const int mod = 1e9 + 7;
dp[N] = 1;
for (int j = N - 1; j >= 0; j--) {
if (broken... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 826,915 | 826,911 | u464527162 | cpp |
p03013 | #include <cstring>
#include <fstream>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
ll N, M, res;
cin >> N >> M;
ll dp[N + 1];
std::... | #include <cstring>
#include <fstream>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
ll N, M, res;
cin >> N >> M;
ll dp[N + 1];
std::... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 826,931 | 826,932 | u485731913 | cpp |
p03013 | #include <cstring>
#include <fstream>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
ll N, M, res;
cin >> N >> M;
ll dp[N + 1];
std::... | #include <cstring>
#include <fstream>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
ll N, M, res;
cin >> N >> M;
ll dp[N + 1];
std::... | [
"identifier.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 826,933 | 826,934 | u485731913 | cpp |
p03013 | #include <cstring>
#include <fstream>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
ll N, M, res;
cin >> N >> M;
ll dp[N + 1];
std::... | #include <cstring>
#include <fstream>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
ll N, M, res;
cin >> N >> M;
ll dp[N + 1];
std::... | [
"identifier.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 826,935 | 826,934 | u485731913 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
/*const int INF = 50;
typedef pair<int,int> P;
char field[52][52];
int d[51][51];
int r,c;
int sx,sy;
int gx,gy;
int dx[4]={1,0,-1,0};... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
/*const int INF = 50;
typedef pair<int,int> P;
char field[52][52];
int d[51][51];
int r,c;
int sx,sy;
int gx,gy;
int dx[4]={1,0,-1,0};... | [
"literal.number.change",
"assignment.value.change"
] | 826,939 | 826,940 | u622585907 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
/*const int INF = 50;
typedef pair<int,int> P;
char field[52][52];
int d[51][51];
int r,c;
int sx,sy;
int gx,gy;
int dx[4]={1,0,-1,0};... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
/*const int INF = 50;
typedef pair<int,int> P;
char field[52][52];
int d[51][51];
int r,c;
int sx,sy;
int gx,gy;
int dx[4]={1,0,-1,0};... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"assignment.value.change"
] | 826,941 | 826,940 | u622585907 | cpp |
p03013 | // {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | // {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [
"expression.operation.binary.remove"
] | 826,955 | 826,956 | u186294233 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
const long long MAX = 1000000007;
int main() {
long long n, m;
cin >> n >> m;
long long allspace[n + 1];
long long a[n];
long long x;
for (long long i = 0; i < n; i++) {
a[i] = 0;
}
for (long long i = 0... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
const long long MAX = 1000000007;
int main() {
long long n, m;
cin >> n >> m;
long long allspace[n + 1];
long long a[n];
long long x;
for (long long i = 0; i < n; i++) {
a[i] = 0;
}
for (long long i = 0... | [
"assignment.change"
] | 826,975 | 826,976 | u276796245 | cpp |
p03013 | #define _CRT_SECURE_NO_WARNINGS
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, m, a[(int)1e+5] = {}, ans = 0, ans_1 = 1, ans_2 = 1, t, t2;
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d", &t);
a[t] = 1;
}
for (int i = 2; i <= n; i+... | #define _CRT_SECURE_NO_WARNINGS
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n, m, a[(int)1e+5] = {}, ans = 1, ans_1 = 1, ans_2 = 1, t;
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d", &t);
a[t] = 1;
}
for (int i = 2; i <= n; i++) {... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.remove"
] | 826,986 | 826,987 | u858766837 | cpp |
p03013 | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("file.1", "r", stdin);... | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("file.1", "r", stdin);... | [
"assignment.change"
] | 827,011 | 827,012 | u147305315 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
ll a[n + 1];
int temp;
for (int i = 0; i < n + 1; i++) {
a[i] = -1;
}
for (int i = 0; i < m; i++) {
cin >> temp;
a[temp] = 0;
}
a[0] = 1;
if (a[1] != 0)
a[1] = 1;
// if(a[2]!=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
ll a[n + 1];
int temp;
for (int i = 0; i < n + 1; i++) {
a[i] = -1;
}
for (int i = 0; i < m; i++) {
cin >> temp;
a[temp] = 0;
}
a[0] = 1;
if (a[1] != 0)
a[1] = 1;
// if(a[2]!=... | [
"assignment.change"
] | 827,013 | 827,014 | u639032323 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
const long int mod = 1e9 + 7;
long long int n, m, a;
cin >> n >> m;
long long int dp[n + 1];
vector<bool> bl(n, true);
for (long int i = 0; i < m; i++) {
cin >> a;
bl[a] = false;
}
dp[0] = 1;
dp[1] = 1;
for (long int i = 0; i < n -... | #include <bits/stdc++.h>
using namespace std;
int main() {
const long int mod = 1e9 + 7;
long long int n, m, a;
cin >> n >> m;
long long int dp[n + 1];
vector<bool> bl(n, true);
for (long int i = 0; i < m; i++) {
cin >> a;
bl[a] = false;
}
dp[0] = 1;
dp[1] = 1;
for (long int i = 0; i < n -... | [
"assignment.change"
] | 827,099 | 827,100 | u528388170 | cpp |
p03013 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
// const int INF = 1e8;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
queue<P> que;
int main() {
int n;
cin >> n;
int m;
cin >> m;
bool a[n];
for (int i = 0; ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
// const int INF = 1e8;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
queue<P> que;
int main() {
int n;
cin >> n;
int m;
cin >> m;
bool a[n];
for (int i = 0; ... | [] | 827,103 | 827,104 | u974214237 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
long long n, m;
long long a[100010];
int main() {
cin >> n >> m;
a[0] = 1;
for (long long i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = -1;
}
for (long long i = 1; i <= n; i++) {
if (a[i] != -1) {
if (a[i - 1] != -1)
a[i] += a[i - 1];
... | #include <bits/stdc++.h>
using namespace std;
long long n, m;
long long a[100010];
int main() {
cin >> n >> m;
a[0] = 1;
for (long long i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = -1;
}
for (long long i = 1; i <= n; i++) {
if (a[i] != -1) {
if (a[i - 1] != -1)
a[i] += a[i - 1] %... | [
"assignment.change"
] | 827,116 | 827,117 | u077698875 | cpp |
p03013 | #include <stdio.h>
int n, m, a[100001], d[100001], t;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d", &t);
a[t - 1] = 1;
}
if (a[0]) {
putchar('0');
return 0;
}
d[0] = 1;
if (!a[1])
d[1] = 1;
for (int i = 2; i <= n; i++)
if (!a[i])
d[i] = (d[... | #include <stdio.h>
int n, m, a[100001], d[100001], t;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d", &t);
a[t] = 1;
}
if (a[0]) {
putchar('0');
return 0;
}
d[0] = 1;
if (!a[1])
d[1] = 1;
for (int i = 2; i <= n; i++)
if (!a[i])
d[i] = (d[i - ... | [
"expression.operation.binary.remove"
] | 827,131 | 827,132 | u073586914 | cpp |
p03013 | #include <stdio.h>
int n, m, a[100001], d[100001], t;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d", &t);
a[t - 1] = 1;
}
if (a[0]) {
putchar('0');
return 0;
}
d[0] = 1;
if (!a[1])
d[1] = 1;
for (int i = 2; i <= n; i++)
if (!a[i])
d[i] = d[i... | #include <stdio.h>
int n, m, a[100001], d[100001], t;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d", &t);
a[t] = 1;
}
if (a[0]) {
putchar('0');
return 0;
}
d[0] = 1;
if (!a[1])
d[1] = 1;
for (int i = 2; i <= n; i++)
if (!a[i])
d[i] = (d[i - ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 827,133 | 827,132 | u073586914 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
const int b = 1e9 + 7;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> dp(N + 10, 0); //余裕持たせる
vector<bool> flag(N + 10, true); //これも余裕を持たせる
for (ll i = 0; i < M; i++) {
ll a;
cin >> a;
flag[a] = false;
}... | #include <iostream>
#include <vector>
using namespace std;
const int b = 1e9 + 7;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> dp(N + 10, 0); //余裕持たせる
vector<bool> flag(N + 10, true); //これも余裕を持たせる
for (ll i = 0; i < M; i++) {
ll a;
cin >> a;
flag[a] = false;
}... | [
"assignment.variable.change",
"identifier.change"
] | 827,138 | 827,139 | u904123392 | cpp |
p03013 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, a) repi(i, 0, a)
#define rrep(i, a) for (ll i = a - 1; i >= 0; i--)
#define MOD 1000000007
i... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, a) repi(i, 0, a)
#define rrep(i, a) for (ll i = a - 1; i >= 0; i--)
#define MOD 1000000007
i... | [
"assignment.change"
] | 827,143 | 827,144 | u336721073 | cpp |
p03013 | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <iostream>
#include <unordered_set>
#include <vector>
using namespace std;
int main(int, char **) {
int N, M;
cin >> N >> M;
unordered_set<int> a;
for (int i = 0; i < M; ++i) {
int tmp;
cin >> tmp;
a.insert(tmp);
}
... | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <iostream>
#include <unordered_set>
#include <vector>
using namespace std;
int main(int, char **) {
int N, M;
cin >> N >> M;
unordered_set<int> a;
for (int i = 0; i < M; ++i) {
int tmp;
cin >> tmp;
a.insert(tmp);
}
... | [] | 827,177 | 827,178 | u298497862 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define vec vector<ll>
#define ms multiset<ll>
#define f(i, x, n) for (int i = x; i < n; i++)
#define int long long
#define mod 1000000007
#define endl "\n"
void fastio() {
ios_base::syn... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define vec vector<ll>
#define ms multiset<ll>
#define f(i, x, n) for (int i = x; i < n; i++)
#define int long long
#define mod 1000000007
#define endl "\n"
void fastio() {
ios_base::syn... | [
"identifier.change",
"call.arguments.change"
] | 827,207 | 827,208 | u966690395 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = (1e+9) + 7;
int main() {
int n, m, a;
cin >> n >> m;
vector<bool> br(m);
vector<ll> dp(n + 1, 0);
for (int i = 0; i < m; i++) {
cin >> a;
br[a] = true;
}
dp[0] = 1;
for (int i = 0; i < n; i++) {
if (i + 1 <= n... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = (1e+9) + 7;
int main() {
int n, m, a;
cin >> n >> m;
vector<bool> br(n + 1, false);
vector<ll> dp(n + 1, 0);
for (int i = 0; i < m; i++) {
cin >> a;
br[a] = true;
}
dp[0] = 1;
for (int i = 0; i < n; i++) {
if ... | [
"call.arguments.add"
] | 827,232 | 827,233 | u798086274 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
const int md = 1e9 + 7;
int main(void) {
ios_base::sync_with_stdio(0);
int n, k;
cin >> n >> k;
vector<bool> a(n, false);
for (int i = 0; i < k; i++) {
int x;
cin >> x;
a[x] = true;
}
long long x = 1, y = 0, z;
if (!a[1])
y++;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
const int md = 1e9 + 7;
int main(void) {
ios_base::sync_with_stdio(0);
int n, k;
cin >> n >> k;
vector<bool> a(n, false);
for (int i = 0; i < k; i++) {
int x;
cin >> x;
a[x] = true;
}
long long x = 1, y = 0, z = 1;
if (!a[1])
y++;
for (in... | [
"variable_declaration.value.change"
] | 827,234 | 827,235 | u192159607 | cpp |
p03013 | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
int main() {
int N, M;
scanf("%d %d", &N, &M);
int *b = new int[N + 1];
for (int i = 0; i < N + 1; i++) {
b[i] = 1;
}
for (int i = 0; i < M; i++) {
int a;
scanf("%d", &a);
b[a] = 0;
}
long long *n = new long lon... | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
int main() {
int N, M;
scanf("%d %d", &N, &M);
int *b = new int[N + 1];
for (int i = 0; i < N + 1; i++) {
b[i] = 1;
}
for (int i = 0; i < M; i++) {
int a;
scanf("%d", &a);
b[a] = 0;
}
long long *n = new long lon... | [
"assignment.change"
] | 827,238 | 827,239 | u617987447 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e6 + 7;
const int maxm = 2e6 + 7;
const ll mod = 1e9 + 7;
int n, m, ar[maxn];
int l[maxn], r[maxn];
int main() {
set<int> s;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
s.insert(x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e6 + 7;
const int maxm = 2e6 + 7;
const ll mod = 1e9 + 7;
int n, m, ar[maxn];
int l[maxn], r[maxn];
int main() {
set<int> s;
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
int x;
scanf("%d", &x);
s.insert(x)... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,247 | 827,248 | u662513110 | cpp |
p03013 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#inc... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#inc... | [
"assignment.change"
] | 827,249 | 827,250 | u848736574 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, MOD = 998244353;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
typedef long long ll;
int u, v, p, d, n, tc, q, k, l, r, c, m, b[N], cnt, curr, a[N], ans;
ll calc[N];
bool sum[N], bad[N];
char s[N];
bool ok(int x) { return (x >= 0 && !... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, MOD = 1e9 + 7;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
typedef long long ll;
int u, v, p, d, n, tc, q, k, l, r, c, m, b[N], cnt, curr, a[N], ans;
ll calc[N];
bool sum[N], bad[N];
char s[N];
bool ok(int x) { return (x >= 0 && !bad... | [
"literal.number.change"
] | 827,256 | 827,257 | u318875010 | cpp |
p03013 | #include <bits/stdc++.h>
#define LL long long
#define INF 0x7FFFFFFF
#define mod 1000000007
using namespace std;
int dp[100000 + 5];
int vis[100000 + 5];
int main() {
int n, nu, m;
cin >> n >> m;
memset(vis, 0, sizeof vis);
for (int i = 0; i < m; ++i) {
cin >> nu;
vis[nu] = 1;
}
dp[0] = 1;
dp[1] ... | #include <bits/stdc++.h>
#define LL long long
#define INF 0x7FFFFFFF
#define mod 1000000007
using namespace std;
int dp[100000 + 5];
int vis[100000 + 5];
int main() {
int n, nu, m;
cin >> n >> m;
memset(vis, 0, sizeof vis);
for (int i = 0; i < m; ++i) {
cin >> nu;
vis[nu] = 1;
}
dp[0] = 1;
dp[1] ... | [] | 827,258 | 827,259 | u368384385 | cpp |
p03013 | #include <bits/stdc++.h>
#define LL long long
#define INF 0x7FFFFFFF
#define mod 1000000007
using namespace std;
int dp[100000 + 5];
int vis[100000 + 5];
int main() {
int n, nu, m;
cin >> n >> m;
memset(vis, 0, sizeof vis);
for (int i = 0; i < m; ++i) {
cin >> nu;
vis[nu] = 1;
}
dp[0] = 0;
dp[1] ... | #include <bits/stdc++.h>
#define LL long long
#define INF 0x7FFFFFFF
#define mod 1000000007
using namespace std;
int dp[100000 + 5];
int vis[100000 + 5];
int main() {
int n, nu, m;
cin >> n >> m;
memset(vis, 0, sizeof vis);
for (int i = 0; i < m; ++i) {
cin >> nu;
vis[nu] = 1;
}
dp[0] = 1;
dp[1] ... | [
"literal.number.change",
"assignment.value.change"
] | 827,260 | 827,259 | u368384385 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
#define MOD 1000000007
int main(void) {
i64 n, m;
cin >> n >> m;
vector<bool> a(m, false);
vector<i64> dp(n + 1, 0);
for (i64 i = 0; i < m; i++) {
i64 x;
cin >> x;
a[x] = true;
}
dp[0] = 1;
for (i64 i = 1; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
#define MOD 1000000007
int main(void) {
i64 n, m;
cin >> n >> m;
vector<bool> a(n, false);
vector<i64> dp(n + 1, 0);
for (i64 i = 0; i < m; i++) {
i64 x;
cin >> x;
a[x] = true;
}
dp[0] = 1;
for (i64 i = 1; i <= n; i++) {
... | [] | 827,274 | 827,275 | u477678256 | cpp |
p03013 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | [
"assignment.change",
"expression.operation.binary.remove"
] | 827,276 | 827,277 | u202928696 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int M = 1e7;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> l(h, vector<in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int M = 1e7;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> l(h, vector<in... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 827,282 | 827,283 | u106342872 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int M = 1e7;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> l(h, vector<in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int M = 1e7;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> l(h, vector<in... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.change",
"expression.operation.binary.remove"
] | 827,285 | 827,283 | u106342872 | cpp |
p03014 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <st... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <st... | [
"assignment.change"
] | 827,288 | 827,289 | u631558039 | cpp |
p03014 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x =... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x =... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 827,290 | 827,291 | u631558039 | cpp |
p03014 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x =... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x =... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 827,292 | 827,291 | u631558039 | cpp |
p03014 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x =... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x =... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"assignment.value.change"
] | 827,293 | 827,291 | u631558039 | cpp |
p03014 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x =... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x =... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 827,294 | 827,291 | u631558039 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n, m;
int a[100000];
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n, m;
int a[100000];
cin >>... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 827,316 | 827,317 | u218759384 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >=... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >=... | [] | 827,335 | 827,336 | u457283867 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.