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 <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int N, M;
vector<bool> issafe;
int main() {
cin >> N >> M;
issafe.assign(N + 1, true);
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
issafe[a] = false;
}
vector<int> dp(N + 1, 0);
dp[0] = 1;
if (issafe[1])... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int N, M;
vector<bool> issafe;
int main() {
cin >> N >> M;
issafe.assign(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
issafe[a] = false;
}
vector<int> dp(N + 1, 0);
dp[0] = 1;
if (issafe[1])... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 825,591 | 825,592 | u731665172 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
#define all(vec) vec.b... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
#define all(vec) vec.b... | [
"identifier.change",
"call.arguments.change"
] | 825,603 | 825,604 | u296160120 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
#define all(vec) vec.b... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
#define all(vec) vec.b... | [
"identifier.change",
"call.arguments.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 825,605 | 825,604 | u296160120 | cpp |
p03013 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 825,606 | 825,607 | u723550619 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
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] = 1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
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;
... | [
"expression.operation.binary.remove"
] | 825,611 | 825,612 | u726957641 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = 1000000007;
int n, m;
int main() {
cin >> n >> m;
// cout << var(n) << endl;
vector<int> ok(n + 1, 1);
for (int i = 0; i < m; i++) {
int p;
cin >> p;
ok[p] = 0;
}
/*
for(int i=0;i<=n;i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = 1000000007;
int n, m;
int main() {
cin >> n >> m;
// cout << var(n) << endl;
vector<int> ok(100050, 1);
for (int i = 0; i < m; i++) {
int p;
cin >> p;
ok[p] = 0;
}
vector<int> dp(100050... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 825,615 | 825,614 | u619382421 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = 1000000007;
int n, m;
int main() {
cin >> n >> m;
// cout << var(n) << endl;
vector<int> ok(n + 1, 1);
for (int i = 0; i < m; i++) {
int p;
cin >> p;
ok[p] = 0;
}
/*
for(int i=0;i<=n;i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = 1000000007;
int n, m;
int main() {
cin >> n >> m;
// cout << var(n) << endl;
vector<int> ok(100050, 1);
for (int i = 0; i < m; i++) {
int p;
cin >> p;
ok[p] = 0;
}
vector<int> dp(100050... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 825,616 | 825,614 | u619382421 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long int a[n + 1];
for (int i = 0; i < n + 1; i++)
a[i] = 1;
for (int i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = 0;
if (a[x - 1] == 0 || a[x + 1] == 0)
return cout << "0", 0;
}
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long int a[n + 1];
for (int i = 0; i < n + 1; i++)
a[i] = 1;
for (int i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = 0;
if (a[x - 1] == 0 || a[x + 1] == 0)
return cout << "0", 0;
}
for (int i =... | [
"assignment.change",
"expression.operation.binary.remove"
] | 825,634 | 825,635 | u313970998 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n + 1];
for (int i = 0; i < n + 1; i++)
a[i] = 1;
for (int i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = 0;
if (a[x - 1] == 0 || a[x + 1] == 0)
return cout << "0", 0;
}
for (int i = n - 2; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long int a[n + 1];
for (int i = 0; i < n + 1; i++)
a[i] = 1;
for (int i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = 0;
if (a[x - 1] == 0 || a[x + 1] == 0)
return cout << "0", 0;
}
for (int i =... | [
"assignment.change"
] | 825,636 | 825,635 | u313970998 | cpp |
p03013 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pp;
const int INF = 1e9;
const int MOD = 1000000007;
const double pi = 3.141592653589793238;
ll gcd(ll a, ll b) { return __gcd(a, b); } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最大公... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pp;
const int INF = 1e9;
const int MOD = 1000000007;
const double pi = 3.141592653589793238;
ll gcd(ll a, ll b) { return __gcd(a, b); } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最大公... | [
"assignment.change"
] | 825,656 | 825,657 | u251236092 | cpp |
p03013 | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
#define ll long long
constexpr long long int INFLL = 1001001001001001LL;
constexpr int INFI ... | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
#define ll long long
constexpr long long int INFLL = 1001001001001001LL;
constexpr int INFI ... | [
"assignment.change"
] | 825,663 | 825,664 | u550014122 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long n;
cin >> n;
vector<long long> k(n + 1, 1);
vector<int> u(n + 1, 0);
int m;
cin >> m;
rep(i, m) {
int a;
cin >> a;
u[a] = 1;
}
if (u[1] == 1)
k[1] = 0;
rep(i, n -... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long n;
cin >> n;
vector<long long> k(n + 1, 1);
vector<int> u(n + 1, 0);
int m;
cin >> m;
rep(i, m) {
int a;
cin >> a;
u[a] = 1;
}
if (u[1] == 1)
k[1] = 0;
rep(i, n -... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 825,690 | 825,691 | u525560003 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | [] | 825,709 | 825,710 | u068177169 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define repp(i, l, r, k) for (ll i = (l); i < (r); i += (k))
#define INF ((1LL << 62) - (1LL << 31))
#define MOD 1000000007
int main() {
int n, m;
cin >> n >> m;
bool ch[n];
rep(i, 0, n) ch[i] ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define repp(i, l, r, k) for (ll i = (l); i < (r); i += (k))
#define INF ((1LL << 62) - (1LL << 31))
#define MOD 1000000007
int main() {
int n, m;
cin >> n >> m;
bool ch[n + 1];
rep(i, 0, n + 1... | [
"assignment.change"
] | 825,713 | 825,714 | u200060866 | 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 = 1e9 + 7;
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, 0);
const int mod = 1e9 + 7;
dp[n] = 1;
for (int i = n - 1; i... | [
"call.arguments.add"
] | 825,719 | 825,720 | u764860452 | 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 = 1e9 + 7;
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 = 1e9 + 7;
dp[n] = 1;
for (int i = n - 1; i >=... | [] | 825,719 | 825,721 | u764860452 | cpp |
p03013 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); ++i)
using namespace std;
template <class A> void pr(A a) { cout << a << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
p(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
p(b, c... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); ++i)
using namespace std;
template <class A> void pr(A a) { cout << a << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
p(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
p(b, c... | [
"assignment.change"
] | 825,722 | 825,723 | u041781161 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = int(1e9);
typedef long long int ll;
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = int(1e9);
typedef long long int ll;
... | [
"assignment.change"
] | 825,732 | 825,733 | u275488634 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = int(1e9);
typedef long long int ll;
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = int(1e9);
typedef long long int ll;
... | [
"variable_declaration.type.change",
"assignment.change"
] | 825,734 | 825,733 | u275488634 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll arr[n + 10] = {0}, arr1[n] = {0};
arr1[0] = 1;
for (ll i = 0; i < m; ++i) {
ll tmp;
cin >> tmp;
arr[tmp] = -1;
}
for (ll i = 0; i < n; ++i) {
if (arr[i] == arr[i + 1] && arr[i] ==... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll arr[n + 10] = {0}, arr1[n] = {0};
arr1[0] = 1;
for (ll i = 0; i < m; ++i) {
ll tmp;
cin >> tmp;
arr[tmp] = -1;
}
for (ll i = 0; i < n; ++i) {
if (arr[i] == arr[i + 1] && arr[i] ==... | [
"control_flow.branch.if.condition.change"
] | 825,744 | 825,745 | u027630431 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> dp(N + 1, true);
int tmp;
for (int i = 0; i < M; ++i) {
cin >> tmp;
dp[tmp] = false;
}
for (int i = 3; i <= N; ++i) {
if (dp[i] == false)
continue;
dp[i] = dp[i - 1] + dp[i - 2];
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> dp(N + 1, true);
int tmp;
for (int i = 0; i < M; ++i) {
cin >> tmp;
dp[tmp] = false;
}
for (int i = 2; i <= N; ++i) {
if (dp[i] == false)
continue;
dp[i] = dp[i - 1] + dp[i - 2];
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 825,748 | 825,749 | u635358463 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class _T> inline bool chmax(_T &a, _T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class _T> inline bool chmin(_T &a, _T b) {
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class _T> inline bool chmax(_T &a, _T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class _T> inline bool chmin(_T &a, _T b) {
if (... | [
"assignment.change"
] | 825,754 | 825,755 | u807394250 | cpp |
p03013 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (... | [] | 825,758 | 825,759 | u118951811 | cpp |
p03013 | #include <float.h>
#include <limits.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#define NUM 100001
int step(int n, int i, int m, int *ans) {
if (i == -1)
return 0;
else if (i == 0)
return 1;
else if (ans[i] != -1)
return ans[i];
else
return ans[i] =
(step(n, i... | #include <float.h>
#include <limits.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#define NUM 100001
int step(int n, int i, int m, int *ans) {
if (i == -1)
return 0;
else if (i == 0)
return 1;
else if (ans[i] != -1)
return ans[i];
else
return ans[i] =
(step(n, i... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 825,762 | 825,761 | u870205469 | cpp |
p03013 | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <list> //list<???> a; a.push_back ,insert(追加したい要素),a.sort(),参照できない
#include <set>
#include <string>
#include <vector> //vector<???> a; a.push_back,sort(a.begin(),a.end());a[i]
//配列 int a[N];a[i]=追加したい要素;sort(a,a+N);a[i]
using namespace std;
typedef... | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <list> //list<???> a; a.push_back ,insert(追加したい要素),a.sort(),参照できない
#include <set>
#include <string>
#include <vector> //vector<???> a; a.push_back,sort(a.begin(),a.end());a[i]
//配列 int a[N];a[i]=追加したい要素;sort(a,a+N);a[i]
using namespace std;
typedef... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 825,763 | 825,764 | u235376569 | cpp |
p03013 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
vector<bool> a(n, true);
for (int i = 0; i < m; i++) {
int x;
cin >> x;
a[x] == false;
}
vector<unsigned long long int> dp(... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
vector<bool> a(n, true);
for (int i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = false;
}
vector<unsigned long long int> dp(n... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 825,768 | 825,769 | u489302942 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long k;
bool ng[n + 1];
for (long long i = 0; i < n; i++) {
ng[i] = false;
}
for (long long i = 0; i < m; i++) {
cin >> k;
ng[k] = true;
}
long long ans[n + 1];
ans[0] = 0;
ans[1] = 1;
ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long k;
bool ng[n + 1];
for (long long i = 0; i < n + 1; i++) {
ng[i] = false;
}
for (long long i = 0; i < m; i++) {
cin >> k;
ng[k] = true;
}
long long ans[n + 1];
ans[0] = 0;
ans[1] = 1;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 825,776 | 825,777 | u371051907 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
const int MOD = 1000000007;
int N, M;
cin >> N >> M;
vector<int> dp(N + 1);
vector<bool> ko(N + 1, false);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
ko[a] = true;
}
dp[0] = 1;
if (ko[1])
dp[1] = 0;
else
dp[0] = 1;... | #include <bits/stdc++.h>
using namespace std;
int main() {
const int MOD = 1000000007;
int N, M;
cin >> N >> M;
vector<int> dp(N + 1);
vector<bool> ko(N + 1, false);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
ko[a] = true;
}
dp[0] = 1;
if (ko[1])
dp[1] = 0;
else
dp[1] = 1;... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 825,781 | 825,782 | u814663076 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;
using vll = vector<long long>;
using vpii = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
using vvc = vector<vect... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;
using vll = vector<long long>;
using vpii = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
using vvc = vector<vect... | [
"variable_declaration.name.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change",
"control_flow.branch.if.condition.change"
] | 825,786 | 825,787 | u009414205 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#de... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#de... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 825,809 | 825,810 | u430494842 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define mod (1000000007)
void solve() {
int n, m;
cin >> n >> m;
vector<bool> a(n, 0);
REP(i, m) {
int x;
cin >> x;
a[x] = 1;
}
int dp[n];
dp[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define mod (1000000007)
void solve() {
int n, m;
cin >> n >> m;
n++;
vector<bool> a(n, 0);
REP(i, m) {
int x;
cin >> x;
a[x] = 1;
}
int dp[n]... | [
"expression.unary.arithmetic.add"
] | 825,811 | 825,812 | u973991908 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define SORT(c) sort((c).begin(), (c).end())
#define MOD 1000000007
// S.size() 配列名.Length()
using namespace std;
typedef unsigned long long ll;
int main(void) {
int n, m;
cin >> n >> m;
vector<bool> broken(n + 1);
rep(i, m) {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define SORT(c) sort((c).begin(), (c).end())
#define MOD 1000000007 // S.size() 配列名.Length()
using namespace std;
typedef unsigned long long ll;
int main(void) {
int n, m;
cin >> n >> m;
vector<bool> broken(n + 1);
rep(i, m) {
i... | [
"assignment.change"
] | 825,817 | 825,818 | u174509352 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<ll> n(N);
vector<bool> m(N + 5);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
m.at(a) = true;
}
for (int i = 0; i < N; i++) {
if (i == 0) {
if (m.at(1))
n.at(0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<ll> n(N);
vector<bool> m(N + 5);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
m.at(a) = true;
}
for (int i = 0; i < N; i++) {
if (i == 0) {
if (m.at(1))
n.at(0... | [
"literal.number.change",
"assignment.value.change"
] | 825,824 | 825,825 | u842939260 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(item) cout << (item) << endl;
#define PRINT_VEC(V) \
for (auto v : (V)) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(item) cout << (item) << endl;
#define PRINT_VEC(V) \
for (auto v : (V)) ... | [
"literal.number.change",
"assignment.value.change"
] | 825,830 | 825,831 | u223960644 | cpp |
p03013 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> oks(N + 1, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
oks[a] = false;
}
vector<long long int> dp(N + 1);
dp[0] = 1;
f... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> oks(N + 1, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
oks[a] = false;
}
vector<long long int> dp(N + 1);
dp[0] = 1;
f... | [
"control_flow.loop.for.condition.change"
] | 825,842 | 825,843 | u745267317 | cpp |
p03013 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> oks(N + 1, true);
for (int i = 0; i < M; i++) {
int a = 0;
cin >> a;
oks[a] = false;
}
vector<long long int> dp(N + 1);
dp[0] = 1;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> oks(N + 1, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
oks[a] = false;
}
vector<long long int> dp(N + 1);
dp[0] = 1;
f... | [
"control_flow.loop.for.condition.change"
] | 825,844 | 825,843 | u745267317 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
int main() {
ll a, b;
cin >> a >> b;
vector<ll> A(a);
vint B(a);
rep(i, b) {
int c;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
int main() {
ll a, b;
cin >> a >> b;
vector<ll> A(a);
vint B(a);
rep(i, b) {
int c;
... | [
"assignment.change"
] | 825,845 | 825,846 | u613960672 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
int main() {
ll a, b;
cin >> a >> b;
vector<ll> A(a);
vint B(a);
rep(i, b) {
int c;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
int main() {
ll a, b;
cin >> a >> b;
vector<ll> A(a);
vint B(a);
rep(i, b) {
int c;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 825,847 | 825,846 | u613960672 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
int main() {
ll a, b;
cin >> a >> b;
vector<ll> A(a);
vint B(a);
rep(i, b) {
int c;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
int main() {
ll a, b;
cin >> a >> b;
vector<ll> A(a);
vint B(a);
rep(i, b) {
int c;
... | [
"assignment.change"
] | 825,848 | 825,846 | u613960672 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
const long long MOD = (long long)1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> ok(N + 1, true);
for (int i = 0; i < M; ++i) {
int tmp;
cin >> tmp;
ok[tmp] = false;
}
vector<long long> dp(N + 1, 0);
dp[0] = 1;
for (int... | #include <iostream>
#include <vector>
using namespace std;
const long long MOD = (long long)1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> ok(N + 1, true);
for (int i = 0; i < M; ++i) {
int tmp;
cin >> tmp;
ok[tmp] = false;
}
vector<long long> dp(N + 1, 0);
dp[0] = 1;
for (int... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 825,851 | 825,852 | u854831509 | cpp |
p03013 | #include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <unordered_map>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi fir... | #include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <unordered_map>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi fir... | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 825,859 | 825,860 | u978260507 | cpp |
p03013 | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <iomanip> //stw(数字)で空白による桁揃え
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<bool> oks(M, true);
for (int i = 0; i < M; i++) {
... | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <iomanip> //stw(数字)で空白による桁揃え
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<bool> oks(N + 1, true);
for (int i = 0; i < M; i++) ... | [
"assignment.change"
] | 825,876 | 825,877 | u022890424 | cpp |
p03013 |
// C - Typical Stairs
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
const int MOD = 1e9 + 7;
ll dp[100001];
int main() {
int N, M;
cin >> N >> M;
int a;
for (int i = 0; i < M; i++) {
cin >> a;
dp[a] = -1;
... |
// C - Typical Stairs
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
const int MOD = 1e9 + 7;
ll dp[100001];
int main() {
int N, M;
cin >> N >> M;
int a;
for (int i = 0; i < M; i++) {
cin >> a;
dp[a] = -1;
... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 825,897 | 825,898 | u790272146 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int dfs(vector<int> &a, int N, int i) {
int res;
if (i > N || a[i] == 0)
return 0;
if (i == N)
return 1;
if (a[i] != -1)
return a[i];
res = dfs(a, N, i + 1) % mod + dfs(a, N, i + 2) % mod;
return a[i] = res;
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int dfs(vector<int> &a, int N, int i) {
int res;
if (i > N || a[i] == 0)
return 0;
if (i == N)
return 1;
if (a[i] != -1)
return a[i];
res = (dfs(a, N, i + 1) % mod + dfs(a, N, i + 2) % mod) % mod;
return a[i] = res;
}
int mai... | [
"assignment.change"
] | 825,905 | 825,906 | u743714647 | cpp |
p03013 | #include <bits/stdc++.h>
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] = 1;
}
vector<int> dp(n + 2);
dp[n] = 1;
int x = 1000000007;
for (int i = n - 1; i >= 0; i--) {
if (broken[i... | #include <bits/stdc++.h>
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(n + 2);
dp[n] = 1;
int x = 1000000007;
for (int i = n - 1; i >= 0; i--) {
if (broken[i] ==... | [
"expression.operation.binary.remove"
] | 825,915 | 825,916 | u931071094 | cpp |
p03013 | #include <bits/stdc++.h>
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 = 0;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 1);
dp[n] = 1;
int x = 1000000007;
for (int i = n - 1; i >= 0; i--) {
if (broken[i... | #include <bits/stdc++.h>
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(n + 2);
dp[n] = 1;
int x = 1000000007;
for (int i = n - 1; i >= 0; i--) {
if (broken[i] ==... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 825,917 | 825,916 | u931071094 | cpp |
p03013 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
... | [
"assignment.change"
] | 825,930 | 825,931 | u787696070 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define l long long
const l e = 1e9 + 7;
int main() {
int n, m, d;
cin >> n >> m;
int a[m + 1] = {0};
for (int i = 0; i < m; i++) {
cin >> d;
a[d] = 1;
}
l dp[n + 1] = {0};
dp[0] = 1;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= min(n, ... | #include <bits/stdc++.h>
using namespace std;
#define l long long
const l e = 1e9 + 7;
int main() {
int n, m, d;
cin >> n >> m;
int a[n + 1] = {0};
for (int i = 0; i < m; i++) {
cin >> d;
a[d] = 1;
}
l dp[n + 1] = {0};
dp[0] = 1;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= min(n, ... | [
"identifier.change",
"expression.operation.binary.change"
] | 825,940 | 825,941 | u269804852 | cpp |
p03013 | #include <bits/stdc++.h>
#define fst first
#define snd second
#define rep(n) for (lint I = 0; (I) < (lint)(n); ++(I))
#define repeat(i, n) for (lint i = 0; (i) < (lint)(n); ++(i))
#define repeat_to(i, n) for (lint i = 0; (i) <= (lint)(n); ++(i))
#define repeat_from(i, m, n) for (lint i = (m); (i) < (lint)(n); ++(i))
#d... | #include <bits/stdc++.h>
#define fst first
#define snd second
#define rep(n) for (lint I = 0; (I) < (lint)(n); ++(I))
#define repeat(i, n) for (lint i = 0; (i) < (lint)(n); ++(i))
#define repeat_to(i, n) for (lint i = 0; (i) <= (lint)(n); ++(i))
#define repeat_from(i, m, n) for (lint i = (m); (i) < (lint)(n); ++(i))
#d... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 825,947 | 825,948 | u674342364 | cpp |
p03013 | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> flag(N + 1, true);
vector<ll> dp(N + 1, 0);
for (int i = 0; i < M; i++) {
int index;
cin >> index;
flag[index] = false;
}
dp[0] = 1;
if (flag[1]) {
dp[1] = dp[0];
... | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> flag(N + 1, true);
vector<ll> dp(N + 1, 0);
for (int i = 0; i < M; i++) {
int index;
cin >> index;
flag[index] = false;
}
dp[0] = 1;
if (flag[1]) {
dp[1] = dp[0];
... | [
"assignment.change"
] | 825,967 | 825,968 | u569272329 | cpp |
p03013 | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> flag(N + 1, true);
vector<ll> dp(N + 1, 0);
for (int i = 0; i < M; i++) {
int index;
cin >> index;
flag[index] = false;
}
dp[0] = 1;
if (flag[0]) {
dp[1] = dp[0];
... | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> flag(N + 1, true);
vector<ll> dp(N + 1, 0);
for (int i = 0; i < M; i++) {
int index;
cin >> index;
flag[index] = false;
}
dp[0] = 1;
if (flag[1]) {
dp[1] = dp[0];
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 825,969 | 825,968 | u569272329 | cpp |
p03013 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i ... | [
"literal.number.change",
"call.arguments.change"
] | 825,972 | 825,973 | u502772848 | cpp |
p03013 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long ll;
const ll LL_MAX(1LL << 60);
#define rep(i, s, e) for (ll i = (s); i < (e); i++)
using namespace std... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long ll;
const ll LL_MAX(1LL << 60);
#define rep(i, s, e) for (ll i = (s); i < (e); i++)
using namespace std... | [
"literal.number.change",
"call.arguments.change"
] | 825,974 | 825,975 | u778668639 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)); i > 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define REVSORT(c) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)); i > 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define REVSORT(c) ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 825,978 | 825,979 | u615258936 | cpp |
p03013 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long int int64;
const int64 MOD = 1000000007;
class CTypicalStairs {
public:
void solve(std::istre... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long int64;
const int64 MOD = 1000000007;
class CTypicalStairs {
public:
void solve(std::istream &... | [
"variable_declaration.type.narrow.change"
] | 825,998 | 825,999 | u635804867 | cpp |
p03013 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long int64;
const int64 MOD = 1000000007;
class CTypicalStairs {
public:
void solve(std::istream &... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long int64;
const int64 MOD = 1000000007;
class CTypicalStairs {
public:
void solve(std::istream &... | [
"call.arguments.change"
] | 826,000 | 825,999 | u635804867 | cpp |
p03013 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long int64;
const int64 MOD = 1000000007;
class CTypicalStairs {
public:
void solve(std::istream &... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long int64;
const int64 MOD = 1000000007;
class CTypicalStairs {
public:
void solve(std::istream &... | [] | 826,001 | 825,999 | u635804867 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<bool> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(n + 1);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<bool> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,004 | 826,005 | u362068529 | 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 + 1);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; 0 ... | #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; 0 ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,009 | 826,010 | u142082997 | cpp |
p03013 | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, a, b) for (signed i = a; i < (b); ++i)
#define erep(i, a, b) for (signed i = a; i <= (b); ++i)
#define per(i, a, b) for (signed i = (a); i > (b); --i)
#define eper(i, a, b) for (signed i = (a); i >= b; --i)
#define fore(i, x, a) for (aut... | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, a, b) for (signed i = a; i < (b); ++i)
#define erep(i, a, b) for (signed i = a; i <= (b); ++i)
#define per(i, a, b) for (signed i = (a); i > (b); --i)
#define eper(i, a, b) for (signed i = (a); i >= b; --i)
#define fore(i, x, a) for (aut... | [
"identifier.change",
"call.arguments.change"
] | 826,011 | 826,012 | u394919721 | 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(M);
rep(i, M) {
int w;
cin >> w;
broken[w] = 1;
}
vector<int> a(N + 2);
a[N] = 1;
for (int i = N - 1; i >= 0; i--) {
... | #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 w;
cin >> w;
broken[w] = 1;
}
vector<int> a(N + 2);
a[N] = 1;
for (int i = N - 1; i >= 0; i--) {
... | [] | 826,047 | 826,048 | u021755470 | 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<bool> broken(M);
rep(i, M) {
int w;
cin >> w;
broken[w] = true;
}
vector<int> a(N + 2);
a[N] = 1;
for (int i = N - 1; i >= 0; i--)... | #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 w;
cin >> w;
broken[w] = 1;
}
vector<int> a(N + 2);
a[N] = 1;
for (int i = N - 1; i >= 0; i--) {
... | [
"variable_declaration.type.primitive.change",
"assignment.value.change"
] | 826,049 | 826,048 | u021755470 | 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(M);
rep(i, M) {
int w;
cin >> w;
broken[w] = 1;
}
vector<int> a(N + 2);
a[N] = 1;
for (int i = N - 1; i >= 0; i--) {
... | #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 + 1);
rep(i, M) {
int w;
cin >> w;
broken[w] = 1;
}
vector<int> a(N + 2);
a[N] = 1;
for (int i = N - 1; i >= 0; i--)... | [
"assignment.change"
] | 826,047 | 826,050 | u021755470 | 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<bool> broken(M);
rep(i, M) {
int w;
cin >> w;
broken[w] = true;
}
vector<int> a(N + 2);
a[N] = 1;
for (int i = N - 1; i >= 0; i--)... | #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 + 1);
rep(i, M) {
int w;
cin >> w;
broken[w] = 1;
}
vector<int> a(N + 2);
a[N] = 1;
for (int i = N - 1; i >= 0; i--)... | [
"variable_declaration.type.primitive.change",
"assignment.value.change"
] | 826,049 | 826,050 | u021755470 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
const int mod = 1e9 + 7; // 1,000,000,007
int main() {
int N, M;
cin >> N >> M;
vector<bool> isStep(N, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
// a段目は壊れている
isStep[a] = false;
}
// 動的計画法を用いる
// 上記のテーブル
vector<in... | #include <iostream>
#include <vector>
using namespace std;
const int mod = 1e9 + 7; // 1,000,000,007
int main() {
int N, M;
cin >> N >> M;
vector<bool> isStep(N, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
// a段目は壊れている
isStep[a] = false;
}
// 動的計画法を用いる
// 上記のテーブル
vector<in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 826,076 | 826,077 | u865500049 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll dp[100010]; // ans
ll mm[100010]; // unsafe points
bool vis[100010];
ll rec(ll n) {
if (vis[n])
return dp[n];
vis[n] = true;
if (mm[n])
return dp[n] = 0;
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll dp[100010]; // ans
ll mm[100010]; // unsafe points
bool vis[100010];
ll rec(ll n) {
if (vis[n])
return dp[n];
vis[n] = true;
if (mm[n])
return dp[n] = 0;
i... | [
"assignment.change"
] | 826,078 | 826,079 | u862412671 | cpp |
p03013 | // _/ _/ _/_/_/ _/
//_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
// _/ _/ _/ _/ _/ _/ _/_/_/ _/
//_/ _/ _/ _/ _/ _/ _/ _/ _/
// _/_/ _/_/ _/_/ _/_/ _/_/ _/
#include <algorithm>
#include <cmath>
#include <iomanip>
#in... | // _/ _/ _/_/_/ _/
//_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
// _/ _/ _/ _/ _/ _/ _/_/_/ _/
//_/ _/ _/ _/ _/ _/ _/ _/ _/
// _/_/ _/_/ _/_/ _/_/ _/_/ _/
#include <algorithm>
#include <cmath>
#include <iomanip>
#in... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 826,082 | 826,083 | u401900157 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60, MOD = 1e9 + 7;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) REP(i, 0,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60, MOD = 1e9 + 7;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) REP(i, 0,... | [
"assignment.change"
] | 826,105 | 826,106 | u950046716 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll mod = 1e9 + 7;
int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll mod = 1e9 + 7;
int... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 826,116 | 826,117 | u504800764 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
const ll mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n + 1, true);
ll dp[n + 1];
rep(i, m) {
int q;
cin >> q;
a[q] = false;
}
//////
dp[0] = 1;
for (i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
const ll mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n + 1, true);
vector<ll> dp(n + 1);
rep(i, m) {
int q;
cin >> q;
a[q] = false;
}
//////
dp[0] = 1;
... | [] | 826,136 | 826,137 | u981304949 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(n + 2);
vector<int> broken(n);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken[a] = 1;
}
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i <= 0; i--) {
if (broken[i] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(n + 2);
vector<int> broken(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken[a] = 1;
}
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
if (broken... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 826,145 | 826,146 | u147556624 | cpp |
p03013 | #include <iostream>
#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(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<int> broken(N + 1);
for (int i = 0; i < M; i++) {
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 >= 0; i--) {
... | [] | 826,147 | 826,148 | u147556624 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> broken(N);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(N + 1);
const int mod = 1000000007;
dp[N] = 1;
for (int i = N - 1; i >= 0; i--) {
if... | #include <iostream>
#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(N + 2);
const int mod = 1000000007;
dp[N] = 1;
for (int i = N - 1; i >= 0; i--) {
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,149 | 826,148 | u147556624 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> broken(N);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(N + 1);
const int mod = 1000000007;
dp[N] = 1;
for (int i = N - 1; N >= 0; i--) {
if... | #include <iostream>
#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(N + 2);
const int mod = 1000000007;
dp[N] = 1;
for (int i = N - 1; i >= 0; i--) {
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 826,151 | 826,148 | u147556624 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<bool> a(N + 1, true);
for (int i = 0; i < M; i++) {
int x;
cin >> x;
a[x] = false;
}
vector<long long> d(N);
d[0] = 1;
for (int i = 0; i < N; i++) {
for (int j = i + 1; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<bool> a(N + 1, true);
for (int i = 0; i < M; i++) {
int x;
cin >> x;
a[x] = false;
}
vector<long long> d(N + 1);
d[0] = 1;
for (int i = 0; i < N; i++) {
for (int j = i +... | [
"assignment.change"
] | 826,152 | 826,153 | u584139221 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> as(N + 1, true);
rep(i, M) {
int a;
cin >> a;
as[a] = false;
}
vector<int> dp(N + 1);
dp[N] = 1;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> as(N + 1, true);
rep(i, M) {
int a;
cin >> a;
as[a] = false;
}
vector<int> dp(N + 1);
dp[N] = 1;
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 826,158 | 826,159 | u646792990 | cpp |
p03013 | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
static const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> oks(n + 1, true);
for (int i = 0; i < m; ++i) {
int a;
cin >> a;
oks[a] = false;
}
vector<ll> dp(n + 1);
dp[0] = 1;
for (int now = 0; ... | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
static const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> oks(n + 1, true);
for (int i = 0; i < m; ++i) {
int a;
cin >> a;
oks[a] = false;
}
vector<ll> dp(n + 1);
dp[0] = 1;
for (int now = 0; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 826,165 | 826,166 | u616461826 | cpp |
p03013 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for... | [
"assignment.value.change"
] | 826,210 | 826,211 | u834415466 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> is_safe(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
is_safe[a] = false;
}
vector<int> dp(N + 1, 0);
dp[0] = 1;
for (int i = 0; i < N; ... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> is_safe(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
is_safe[a] = false;
}
vector<int> dp(N + 2, 0);
dp[0] = 1;
for (int i = 0; i < N; ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 826,215 | 826,216 | u912025537 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> is_safe(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
is_safe[a] = false;
}
vector<long long> dp(N + 1, 0);
dp[0] = 1;
for (int i = 0; i... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> is_safe(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
is_safe[a] = false;
}
vector<int> dp(N + 2, 0);
dp[0] = 1;
for (int i = 0; i < N; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,217 | 826,216 | u912025537 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> is_safe(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
is_safe[a] = false;
}
vector<int> dp(N + 1, 0);
dp[0] = 1;
for (int i = 0; i <= N;... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> is_safe(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
is_safe[a] = false;
}
vector<int> dp(N + 2, 0);
dp[0] = 1;
for (int i = 0; i < N; ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 826,218 | 826,216 | u912025537 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> is_safe(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
is_safe[a] = false;
}
vector<int> dp(N + 1, 0);
dp[0] = 1;
for (int i = 0; i < N; ... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> is_safe(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
is_safe[a] = false;
}
vector<int> dp(N + 2, 0);
dp[0] = 1;
for (int i = 0; i < N; ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,219 | 826,216 | u912025537 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> is_safe(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
is_safe[a] = false;
}
vector<int> dp(N + 1, 0);
dp[0] = 1;
for (int i = 0; i < N; ... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> is_safe(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
is_safe[a] = false;
}
vector<int> dp(N + 2, 0);
dp[0] = 1;
for (int i = 0; i < N; ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,220 | 826,221 | u912025537 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i;
cin >> n >> m;
vector<int> broken(n + 1);
for (i = 0; i < m; ++i) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 100000007;
dp[n] = 1;
for (i = n - 1; i >= 0; --i) {
if (broken[i]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i;
cin >> n >> m;
vector<int> broken(n + 1);
for (i = 0; i < m; ++i) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (i = n - 1; i >= 0; --i) {
if (broken[i]) {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 826,245 | 826,246 | u144029820 | cpp |
p03013 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, M, tmp, _max = 0, count = 0;
long long result = 1;
//入力
scanf("%d%d", &N, &M);
vector<int> A(N, 1);
vector<int> q;
for (int i = 0; i < M; i++) {
scanf("%d", &tmp);
A[tmp - 1... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, M, tmp, _max = 0, count = 0;
long long result = 1;
//入力
scanf("%d%d", &N, &M);
vector<int> A(N, 1);
vector<int> q;
for (int i = 0; i < M; i++) {
scanf("%d", &tmp);
A[tmp - 1... | [
"assignment.change"
] | 826,263 | 826,264 | u405010758 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
;
long long dp[n + 1];
vector<bool> s(n + 1, true);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
s[a] = false;
}
for (int i = 0; i < n + 1; i++)
dp[i] = 0;
dp[0] = 1;
for (int i = 0; i < n + 1; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
;
long long dp[n + 1];
vector<bool> s(n + 1, true);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
s[a] = false;
}
for (int i = 0; i < n + 1; i++)
dp[i] = 0;
dp[0] = 1;
for (int i = 0; i < n + 1; i++... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 826,267 | 826,268 | u877494916 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<bool> forbidden(n + 1, false);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
forbidden[a] = true;
}
long long mod = 1e9 + 7;
vector<long long> count(n, 0);
count[0] = 1;
for (int i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<bool> forbidden(n + 1, false);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
forbidden[a] = true;
}
long long mod = 1e9 + 7;
vector<long long> count(n + 1, 0);
count[0] = 1;
for (int i = 0; i < n; i... | [
"assignment.change"
] | 826,269 | 826,270 | u526708273 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
long long mod = 1e9 + 7;
cin >> n >> m;
vector<bool> hole(m + 1, 0);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
hole[a] = true;
}
vector<long long int> count(n + 1, 0);
count[0] = 1;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
long long mod = 1e9 + 7;
cin >> n >> m;
vector<bool> hole(n + 1, 0);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
hole[a] = true;
}
vector<long long int> count(n + 1, 0);
count[0] = 1;
for (int i = 0; i < n; i++) {
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 826,271 | 826,272 | u526708273 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
long long mod = 1e9 + 7;
cin >> n >> m;
vector<bool> hole(m + 1, 0);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
hole[a] = true;
}
vector<long long> count(n + 1, 0);
count[0] = 1;
for (int i = 0; i < n; i++) {
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
long long mod = 1e9 + 7;
cin >> n >> m;
vector<bool> hole(n + 1, 0);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
hole[a] = true;
}
vector<long long int> count(n + 1, 0);
count[0] = 1;
for (int i = 0; i < n; i++) {
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.type.widen.change"
] | 826,273 | 826,272 | u526708273 | cpp |
p03013 | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(100001, 0);
vector<int> broken(100001, 0);
dp[0] = 1;
for (int i = 0; i < m + 1; i++) {
int... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(100001, 0);
vector<int> broken(100001, 0);
dp[0] = 1;
for (int i = 0; i < m; i++) {
int tmp... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 826,288 | 826,289 | u145078501 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
#define all(a) (a).begin(), (a).end()
#define rep(i, n) reps(i, 0, n)
#define reps(i, m, n) for (int i = (m); i < (n); i++)
int main() {
ll n, m;
cin >> n >> m;
vector<bool> b(n + 1, false);
vector<ll... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
#define all(a) (a).begin(), (a).end()
#define rep(i, n) reps(i, 0, n)
#define reps(i, m, n) for (int i = (m); i < (n); i++)
int main() {
ll n, m;
cin >> n >> m;
vector<bool> b(n + 1, false);
vector<ll... | [
"expression.operation.binary.remove"
] | 826,302 | 826,303 | u987476436 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (i... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (i... | [
"assignment.change"
] | 826,326 | 826,327 | u365512540 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ppb pop_back
#define INF 1e18
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
int n, m;
cin >> n >> m;
vector<bool> a(n);
rep(i, n + 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ppb pop_back
#define INF 1e18
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
int n, m;
cin >> n >> m;
vector<bool> a(n + 1);
rep(i, n... | [
"assignment.change"
] | 826,332 | 826,333 | u732817215 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<bool> broken(n);
rep(i, m) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(n);
dp[n] = 1;
// ll ans... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<bool> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = true;
}
vector<int> dp(n + 2);
dp[n] = 1;
f... | [
"assignment.change"
] | 826,342 | 826,343 | u506858457 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> issafe;
issafe.assign(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
issafe[a] = false;
}
vector<int> dp(N + 1, 0);
dp[0] = 1;
if (issafe[... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<bool> issafe;
issafe.assign(N + 1, true);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
issafe[a] = false;
}
vector<int> dp(N + 1, 0);
dp[0] = 1;
if (issafe[... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 826,344 | 826,345 | u506858457 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> dp(n + 1, 0);
long long t;
for (long long i = 0; i < m; i++) {
cin >> t;
dp[t] = -1;
}
dp[n] = 1;
for (long long i = n - 1; i >= 0; i--) {
if (dp[i] != -1) {
if (dp[i + 1] !=... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> dp(n + 2, 0);
long long t;
for (long long i = 0; i < m; i++) {
cin >> t;
dp[t] = -1;
}
dp[n] += 1;
for (long long i = n - 1; i >= 0; i--) {
if (dp[i] != -1) {
if (dp[i + 1] !... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 826,346 | 826,347 | u261237205 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
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<long long> count(n + 1, 0LL);
count[0] = 1LL;
count[... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
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<long long> count(n + 1, 0LL);
count[0] = 1LL;
count[... | [] | 826,370 | 826,371 | u813181182 | cpp |
p03013 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MAX 100000
typedef long long ll;
typedef pair<ll, int> P;
int check[110000];
ll dp[110000];
int main() {
int N, M, temp;
cin >> N... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MAX 100000
typedef long long ll;
typedef pair<ll, int> P;
int check[110000];
ll dp[110000];
int main() {
int N, M, temp;
cin >> N... | [
"assignment.change"
] | 826,375 | 826,376 | u591914971 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(vec) vec.begin(), vec.end()
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = (1e9 + 7);
ll dp[100010];
ll gcd(ll x, ll y) { return y == 0 ? x : gcd(y, x % y); }
ll lcg(ll x, ll y) { return x * y ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(vec) vec.begin(), vec.end()
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = (1e9 + 7);
ll dp[100010];
ll gcd(ll x, ll y) { return y == 0 ? x : gcd(y, x % y); }
ll lcg(ll x, ll y) { return x * y ... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 826,386 | 826,387 | u165267345 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pi \
3.1415926535897932384626433832795028841971693993751058209749445923078164062
#define ll long long
#define pb push_back
#define pf push_front
#define mp make_pair
#defin... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pi \
3.1415926535897932384626433832795028841971693993751058209749445923078164062
#define ll long long
#define pb push_back
#define pf push_front
#define mp make_pair
#defin... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 826,388 | 826,389 | u186089447 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.