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 |
|---|---|---|---|---|---|---|---|
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans;
vector<int> t(N + 1);
for (int i = 0; i < N; i++) {
cin >> t[i];
}
int S1 = 0, S2 = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 0; j < i + 1; j++) {
S1 = S1 + t[j];
}
for (int k = i + 1;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans;
vector<int> t(N + 1);
for (int i = 0; i < N; i++) {
cin >> t[i];
}
int S1 = 0, S2 = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 0; j < i + 1; j++) {
S1 = S1 + t[j];
}
for (int k = i + 1;... | [] | 824,750 | 824,751 | u249546633 | cpp |
p03012 | #include <algorithm>
#include <array>
#include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
array<int, 100> w;
int n, s1, s2, ans;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> w.at(i);
}
ans = 10000;
int i;
for (i = 1; i < n; i++) {
s1 = 0;
s2 = 0;
for (int j = 1; j... | #include <algorithm>
#include <array>
#include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
array<int, 100> w;
int n, s1, s2, ans;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> w.at(i);
}
ans = 10000;
int i;
for (i = 1; i < n; i++) {
s1 = 0;
s2 = 0;
for (int j = 0; j... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 824,754 | 824,755 | u822685707 | cpp |
p03012 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define mp make_pair
#define IOS ios_base::sync_with_stdio(false), cin.tie(0);
using namespace std;
typedef long long ll;
ll a, b, k, n, sum;
const ll maxn = 105;
ll num[maxn];
int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define mp make_pair
#define IOS ios_base::sync_with_stdio(false), cin.tie(0);
using namespace std;
typedef long long ll;
ll a, b, k, n, sum;
const ll maxn = 105;
ll num[maxn];
int... | [
"assignment.change"
] | 824,756 | 824,757 | u856205835 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int n, ans = 1e9, a[10005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 0; i <= 101; i++) {
int sa = 0, sb = 0;
for (int j = 1; j <= n; j++)
if (a[j] <= i)
sa += a[j];
else
sb += a[j];
ans =... | #include <bits/stdc++.h>
using namespace std;
int n, ans = 1e9, a[10005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
int sa = 0, sb = 0;
for (int j = 1; j <= n; j++)
if (j <= i)
sa += a[j];
else
sb += a[j];
ans = min(... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.cha... | 824,764 | 824,765 | u447610671 | cpp |
p03012 | #include <iostream>
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
int main() {
int N;
int W[100];
int ans = 100000000;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> W[i];
}
for (int T = 0; T < N - 1; T++) {
int S1 = 0, S2 = 0;
for (int i = 0; i... | #include <iostream>
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
int main() {
int N;
int W[100];
int ans = 100000000;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> W[i];
}
for (int T = 0; T < N - 1; T++) {
int S1 = 0, S2 = 0;
for (int i = 0; i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 824,780 | 824,781 | u711582524 | cpp |
p03012 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
const int MAXN = 105;
int n, a[MAXN];
long long A, r, ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], A += a[i];
ans = A;
for (int i = 0; i < n; i++) {
r += a[i];
ans = min(ans, abs(A - (A - r)));
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
const int MAXN = 105;
int n, a[MAXN];
long long A, r, ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], A += a[i];
ans = A;
for (int i = 0; i < n; i++) {
r += a[i];
ans = min(ans, abs(r - (A - r)));
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 824,782 | 824,783 | u494617175 | cpp |
p03012 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"control_flow.branch.if.condition.change"
] | 824,784 | 824,785 | u900727536 | cpp |
p03012 | #include <bits/stdc++.h>
#define LL long long
#define INF 0x7FFFFFFF
using namespace std;
int nums[100 + 5];
int main() {
int n;
cin >> n;
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> nums[i];
sum = sum + nums[i];
}
int now = 0;
int ans = INF;
for (int i = 0; i < n; ++i) {
now = now + ... | #include <bits/stdc++.h>
#define LL long long
#define INF 0x7FFFFFFF
using namespace std;
int nums[100 + 5];
int main() {
int n;
cin >> n;
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> nums[i];
sum = sum + nums[i];
}
int now = 0;
int ans = INF;
for (int i = 0; i < n; ++i) {
now = now + ... | [
"call.add",
"call.arguments.change"
] | 824,790 | 824,791 | u368384385 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5, 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;
bool sum[N];
char s[N];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5, 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;
bool sum[N];
char s[N];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ... | [
"assignment.add"
] | 824,794 | 824,795 | u318875010 | cpp |
p03012 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change"
] | 824,798 | 824,799 | u930898631 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, n) for (int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for (int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(), (x).end()
#define MOD 100000000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, n) for (int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for (int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(), (x).end()
#define MOD 100000000... | [
"control_flow.branch.if.condition.change"
] | 824,800 | 824,801 | u405923605 | cpp |
p03012 | // Last Change: 06/10/2019 18:34:40.
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vect... | // Last Change: 06/10/2019 18:36:19.
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vect... | [
"call.add",
"call.arguments.add"
] | 824,804 | 824,805 | u915934642 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second
typedef long long ll;
typedef long double ld;
int main() {
fast;
int n;
cin >> n;
int a[n + 1], p[n + 1];
p[0]... | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second
typedef long long ll;
typedef long double ld;
int main() {
fast;
int n;
cin >> n;
int a[n + 1], p[n + 1];
p[0]... | [
"expression.operation.binary.remove"
] | 824,809 | 824,810 | u670919462 | cpp |
p03012 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
signed main() {
int n;
cin >> n;
vector<int> w(n);
vector<int> cumul(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> w[i];
sum += w[i];
}
cumul[0] = w[0];
for (int i = 1; i < n; i++) {
cumul[i] = (cumul[... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
signed main() {
int n;
cin >> n;
vector<int> w(n);
vector<int> cumul(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> w[i];
sum += w[i];
}
cumul[0] = w[0];
for (int i = 1; i < n; i++) {
cumul[i] = (cumul[... | [
"variable_declaration.value.change"
] | 824,825 | 824,826 | u539199630 | cpp |
p03012 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 824,837 | 824,838 | u614497125 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
int ans = 1e9;
for (int i = 1; i < n; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++)
l += w[j];
for (int j = i; j < n; j++)
r += w[j];
ans =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
int ans = 1e9;
for (int i = 1; i < n; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++)
l += w[j];
for (int j = i; j < n; j++)
r += w[j... | [] | 824,841 | 824,842 | u457283867 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int W[N];
for (int i = 0; i < N; i++) {
cin >> W[i];
}
int min = 1000000;
for (int j = 0; j < N - 1; j++) {
int suma = 0, sumb = 0;
for (int a = 0; a <= j; a++) {
suma += W[a];
}
for (int b = j; b < ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int W[N];
for (int i = 0; i < N; i++) {
cin >> W[i];
}
int min = 1000000;
for (int j = 0; j < N - 1; j++) {
int suma = 0, sumb = 0;
for (int a = 0; a <= j; a++) {
suma += W[a];
}
for (int b = j + 1; ... | [
"control_flow.loop.for.initializer.change"
] | 824,855 | 824,856 | u335770593 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int W[N];
for (int i = 0; i < N; i++) {
cin >> W[i];
}
int min = 1000000;
for (int j = 1; j < N - 1; j++) {
int suma = 0, sumb = 0;
for (int a = 0; a < j; a++) {
suma += W[a];
}
for (int b = j; b < N... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int W[N];
for (int i = 0; i < N; i++) {
cin >> W[i];
}
int min = 1000000;
for (int j = 0; j < N - 1; j++) {
int suma = 0, sumb = 0;
for (int a = 0; a <= j; a++) {
suma += W[a];
}
for (int b = j + 1; ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 824,857 | 824,856 | u335770593 | cpp |
p03012 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int l, i = 0, j = 0, w[100], min, N;
int left = 0, right = 0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> w[i];
}
for (i = 0; i < N; i++) {
for (j = 0; j <= i; j++) {
left += w[j];
}
for (j = i + 1; j < N; j++) {
... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int l, i = 0, j = 0, w[100], min, N;
int left = 0, right = 0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> w[i];
}
for (i = 0; i < N; i++) {
for (j = 0; j <= i; j++) {
left += w[j];
}
for (j = i + 1; j < N; j++) {
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 824,858 | 824,859 | u346818994 | cpp |
p03012 | #include "iostream"
using namespace std;
int main() {
/* code */
int n, s1 = 0, s2 = 0, s3, ans;
int w1[100], w2[100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> w1[i];
s1 += w1[i];
}
s3 = s1 - w1[0];
if (w1[0] - s3 > 0) {
w2[1] = w1[0] - s3;
ans = w1[0] - s3;
} else {
w2[1] ... | #include "iostream"
using namespace std;
int main() {
/* code */
int n, s1 = 0, s2 = 0, s3, ans;
int w1[100], w2[100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> w1[i];
s1 += w1[i];
}
s3 = s1 - w1[0];
if (w1[0] - s3 > 0) {
w2[1] = w1[0] - s3;
ans = w1[0] - s3;
} else {
w2[1] ... | [
"assignment.add"
] | 824,870 | 824,871 | u338369716 | 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 int INF = 1001001001;
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<bool> v(n, false);
vector<ll> dp(n, 0);
rep(i, m) {
int a;
cin >> a;
a--;
v.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<bool> v(n, false);
vector<ll> dp(n, 0);
rep(i, m) {
int a;
cin >> a;
a--;
v.... | [
"control_flow.branch.if.condition.change"
] | 824,895 | 824,896 | u928286416 | 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>;
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 = 1... | #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>;
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... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 824,897 | 824,898 | u052656528 | cpp |
p03013 | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 824,899 | 824,900 | u434874161 | cpp |
p03013 | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change"
] | 824,901 | 824,900 | u434874161 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.... | [
"function.return_value.change"
] | 824,902 | 824,903 | u021108615 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"function.return_value.change"
] | 824,904 | 824,903 | u021108615 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll N, M;
cin >> N >> M;
vector<bool> vec(110000, true);
vector<ll> dp(110000, 0);
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
vec[a] = false;
}
dp[0] = 1;
for (int i = 1; i <= N; i++) {
if (i == 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll N, M;
cin >> N >> M;
vector<bool> vec(110000, true);
vector<ll> dp(110000, 0);
for (int i = 0; i < M; i++) {
ll a;
cin >> a;
vec[a] = false;
}
dp[0] = 1;
for (int i = 1; i <= N; i++) {
if (i == 1... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 824,905 | 824,906 | u883680855 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0);
ty... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0);
ty... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 824,928 | 824,929 | u089230684 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> oks(N + 1);
for (int i = 0; i < M; ++i) {
int a;
cin >> a;
oks[a] = false;
}
vector<long long int> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; ++now) {
f... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> 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;
for (int now = 0; now < N; ++now) ... | [
"variable_declaration.type.primitive.change",
"call.arguments.add"
] | 824,936 | 824,937 | u264265458 | cpp |
p03013 | #include <bits/stdc++.h>
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;
for (int now = 0; now < N; ++now) {
... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<bool> 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;
for (int now = 0; now < N; ++now) ... | [
"variable_declaration.type.primitive.change"
] | 824,938 | 824,937 | u264265458 | cpp |
p03013 | #include <bits/stdc++.h>
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;
for (int now = 0; now < N; ++now) {
... | #include <bits/stdc++.h>
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;
for (int now = 0; now < N; ++now) {... | [] | 824,938 | 824,939 | u264265458 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod) {
... | [] | 824,963 | 824,964 | u804049891 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod) {
... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 824,965 | 824,964 | u804049891 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef... | [
"assignment.change"
] | 824,966 | 824,967 | u828388155 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n, m;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n, m;
... | [
"assignment.change"
] | 824,968 | 824,969 | u828388155 | cpp |
p03013 | #include <algorithm>
#include <iostream>
#include <string>
#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);
const int mod =... | #include <algorithm>
#include <iostream>
#include <string>
#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);
const int mod =... | [] | 824,970 | 824,971 | u828388155 | cpp |
p03013 | //#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
#define irep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define irrep(i, n) for (int i = (int)(n - 1); i > -1; i--)
#define irrep2(i, n, a) for (int i = (int... | //#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
#define irep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define irrep(i, n) for (int i = (int)(n - 1); i > -1; i--)
#define irrep2(i, n, a) for (int i = (int... | [
"assignment.change"
] | 824,979 | 824,980 | u829260400 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> broken(n);
vector<ll> dp(n + 2, 0);
dp.at(n + 1) = 0;
dp[n] = 1;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken.at(a) = 1;
}
f... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> broken(n);
vector<ll> dp(n + 2, 0);
dp.at(n + 1) = 0;
dp[n] = 1;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken.at(a) = 1;
}
f... | [
"expression.operation.binary.add"
] | 824,981 | 824,982 | u657208344 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n, m;
cin >> n >> m;
V<int> b(n + 1);
for (int i = 0; i < m; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n, m;
cin >> n >> m;
V<int> b(n + 1);
for (int i = 0; i < m; i++) {
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 824,985 | 824,986 | u651235280 | cpp |
p03013 | /*
ABC026 高橋君の給料 DFS
int dfs(int n,vector<vector<int>> G){
int mi = 1000000000;
int ma = 0;
int w,v;
for(int i=0;i<G[n].size();i++){
v = G[n][i];
if(G[v].size() == 0)w = 1;
else w = dfs(v,G);
mi = min(mi,w);
ma = max(ma,w);
}
return mi + ma + 1;
}
int main() {
int n;
cin >> n;
Gra... | /*
ABC026 高橋君の給料 DFS
int dfs(int n,vector<vector<int>> G){
int mi = 1000000000;
int ma = 0;
int w,v;
for(int i=0;i<G[n].size();i++){
v = G[n][i];
if(G[v].size() == 0)w = 1;
else w = dfs(v,G);
mi = min(mi,w);
ma = max(ma,w);
}
return mi + ma + 1;
}
int main() {
int n;
cin >> n;
Gra... | [
"assignment.add"
] | 824,998 | 824,999 | u037563046 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define np next_permutation
typedef long long ll;
int dp__[100];
//最大公約数
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
//最小公倍数
ll lcm... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define np next_permutation
typedef long long ll;
int dp__[100];
//最大公約数
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
//最小公倍数
ll lcm... | [
"assignment.change"
] | 825,002 | 825,003 | u363936720 | cpp |
p03013 | #include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> broken(n + 1);
for (int i = 0; i < n + 1; i++) {
int a;
std::cin >> a;
broken[a] = 1;
}
std::vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) ... | #include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> broken(n + 1);
for (int i = 0; i < m; i++) {
int a;
std::cin >> a;
broken[a] = 1;
}
std::vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 825,004 | 825,005 | u477343425 | cpp |
p03013 | #include <cstdio>
#include <iostream>
#include <vector>
int main(void) {
int n, m;
std::cin >> n >> m;
std::vector<int> broken(n + 1);
for (int i = 0; i < n; i++) {
int a;
std::cin >> a;
broken.at(a) = 1;
}
std::vector<int> dp(n + 2);
const int mod = 1000000007;
dp.at(n) = 1;
for (int ... | #include <cstdio>
#include <iostream>
#include <vector>
int main(void) {
int n, m;
std::cin >> n >> m;
std::vector<int> broken(n + 1);
for (int i = 0; i < m; i++) {
int a;
std::cin >> a;
broken.at(a) = 1;
}
std::vector<int> dp(n + 2);
const int mod = 1000000007;
dp.at(n) = 1;
for (int ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 825,007 | 825,008 | u477343425 | cpp |
p03013 | #include <cstdio>
#include <iostream>
#include <vector>
int main(void) {
int n, m;
std::cin >> n >> m;
std::vector<int> broken(n + 1);
for (int i = 0; i < n; i++) {
int a;
std::cin >> a;
broken.at(a) = 1;
}
std::vector<int> dp(n + 2);
const int mod = 1e9 + 7;
dp.at(n) = 1;
for (int i =... | #include <cstdio>
#include <iostream>
#include <vector>
int main(void) {
int n, m;
std::cin >> n >> m;
std::vector<int> broken(n + 1);
for (int i = 0; i < m; i++) {
int a;
std::cin >> a;
broken.at(a) = 1;
}
std::vector<int> dp(n + 2);
const int mod = 1000000007;
dp.at(n) = 1;
for (int ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 825,009 | 825,008 | u477343425 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 825,015 | 825,016 | u852862907 | 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>;
ll dp[100100];
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int a;
cin >> a;
dp[a] = -1;
}
dp[0] = 1;
for (int i = 1; i... | #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>;
ll dp[100100];
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int a;
cin >> a;
dp[a] = -1;
}
dp[0] = 1;
for (int i = 1; i... | [
"expression.operation.binary.add"
] | 825,021 | 825,022 | u337734014 | 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>;
ll dp[100100];
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int a;
cin >> a;
dp[a] = -1;
}
dp[0] = 1;
for (int i = 1; i... | #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>;
ll dp[100100];
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int a;
cin >> a;
dp[a] = -1;
}
dp[0] = 1;
for (int i = 1; i... | [
"assignment.change"
] | 825,023 | 825,022 | u337734014 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<bool> ng(m);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
ng[a] = true;
}
const ll mod = 1e9 + 7;
vector<ll> memo(n + 1, -1)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<bool> ng(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
ng[a] = true;
}
const ll mod = 1e9 + 7;
vector<ll> memo(n + 1,... | [
"assignment.change"
] | 825,037 | 825,038 | u642276346 | 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>;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a + 1] = 1;
}
vector<int> dp(n + 2);
const int mod... | #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>;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 2);
rep(i, m) {
int a;
cin >> a;
broken[a + 1] = 1;
}
vector<int> dp(n + 2);
const int mod... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 825,045 | 825,046 | u171400122 | cpp |
p03013 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int n, m, temp;
cin >> n >> m;
vector<bool> broken(m);
vector<ll> d... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int n, m, temp;
cin >> n >> m;
vector<bool> broken(n + 1);
vector<l... | [
"assignment.change"
] | 825,059 | 825,060 | u075296067 | cpp |
p03013 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 825,088 | 825,089 | u511096055 | cpp |
p03013 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 825,092 | 825,093 | u116523315 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
typedef long long ll;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <cla... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
typedef long long ll;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <cla... | [] | 825,102 | 825,103 | u931191237 | cpp |
p03013 | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
ll gcd(ll x, ll y);
int fac(ll n, vector<int> num);
const int INF = 1001001001;
// mint�p�̒萔 (10��9��)
const int mod = 1000000007;
struct mint {... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
ll gcd(ll x, ll y);
int fac(ll n, vector<int> num);
const int INF = 1001001001;
// mint�p�̒萔 (10��9��)
const int mod = 1000000007;
struct mint {... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 825,109 | 825,110 | u616794313 | 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 INF = 10e9;
const ll mod = 10e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(n + 1, -1);
dp[0] = 1;
dp[1] = 1;
rep(i, m) {
int a;
cin >> a;
dp[a] = 0;
}
fo... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
const ll INF = 10e9;
const ll mod = 10e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<ll> dp(n + 1, -1);
dp[0] = 1;
dp[1] = 1;
rep(i, m) {
int a;
cin >> a;
dp[a] = 0;
}
for... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 825,117 | 825,118 | u166553470 | cpp |
p03013 | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array) / sizeof(array[0]))
using ll = long long;
using namespace std;
using Graph = vector<vector<int>>;
using Field = vector<vector<int>>;
template <class T> inline bool chmin(T &a, T b) {
... | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array) / sizeof(array[0]))
using ll = long long;
using namespace std;
using Graph = vector<vector<int>>;
using Field = vector<vector<int>>;
template <class T> inline bool chmin(T &a, T b) {
... | [
"assignment.change"
] | 825,133 | 825,134 | u527105447 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll mod = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
vector<bool> a(n + 1, true);
rep(i, n) {
ll x;
cin >> x;
a[x] = false;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll mod = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
vector<bool> a(n + 1, true);
rep(i, m) {
ll x;
cin >> x;
a[x] = false;
... | [] | 825,138 | 825,139 | u622070196 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
bool ch[100010];
ll ans[100010];
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 0; i < k; i++) {
ll x;
cin >> x;
ch[x] = true;
}
ans[0] = 1;
for (ll i = 0; i <= n; i++) {
ans[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
bool ch[100010];
ll ans[100010];
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 0; i < k; i++) {
ll x;
cin >> x;
ch[x] = true;
}
ans[0] = 1;
for (ll i = 0; i <= n; i++) {
ans[i... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 825,140 | 825,141 | u166378830 | cpp |
p03013 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 825,160 | 825,161 | u835805357 | cpp |
p03013 | #include <iostream>
#include <vector>
using namespace std;
int N, M;
int a[100000];
vector<bool> a_d(100001, false);
long long num[100001];
const long long dv = 1e9 + 7;
void solve() {
num[0] = 1;
if (!a_d[1])
num[0] = 1;
for (int i = 2; i <= N; i++) {
if (!a_d[i]) {
num[i] = (num[i - 2] + num[i - ... | #include <iostream>
#include <vector>
using namespace std;
int N, M;
int a[100000];
vector<bool> a_d(100001, false);
long long num[100001];
const long long dv = 1e9 + 7;
void solve() {
num[0] = 1;
if (!a_d[1])
num[1] = 1;
for (int i = 2; i <= N; i++) {
if (!a_d[i]) {
num[i] = (num[i - 2] + num[i - ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 825,171 | 825,172 | u748577909 | cpp |
p03013 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ma... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int ma... | [
"assignment.change",
"expression.operation.binary.remove"
] | 825,177 | 825,178 | u651314218 | cpp |
p03013 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
oset;
#define sim template <class c
#defi... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
oset;
#define sim template <class c
#defi... | [
"literal.number.change",
"assignment.value.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 825,187 | 825,188 | u306697932 | cpp |
p03013 | #include <iostream>
#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);
const int mod = 1000000007;
dp[n] = 1;
for (in... | #include <iostream>
#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);
const int mod = 1000000007;
dp[n] = 1;
for (in... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 825,197 | 825,198 | u651197500 | cpp |
p03013 | #include <iostream>
#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);
const int mod = 1000000007;
dp[n] = 1;
for (in... | #include <iostream>
#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);
const int mod = 1000000007;
dp[n] = 1;
for (in... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 825,199 | 825,198 | u651197500 | cpp |
p03013 | #include <bits/stdc++.h>
#define ll long long
#define EPS (ll)1e-9
#define N (ll)(2 * 1e5)
#define M (ll)(1e9 + 7)
using namespace std;
bitset<100001> trap;
ll dp[N];
ll solve(ll n) {
dp[0] = 1;
dp[1] = trap[1] ? 0 : 1;
for (ll i = 2; i <= n; i++) {
if (trap[i])
dp[i] = 0;
else
dp[i] = dp... | #include <bits/stdc++.h>
#define ll long long
#define EPS (ll)1e-9
#define N (ll)(2 * 1e5)
#define M (ll)(1e9 + 7)
using namespace std;
bitset<100010> trap;
ll dp[N];
ll solve(ll n) {
dp[0] = 1;
dp[1] = trap[1] ? 0 : 1;
for (ll i = 2; i <= n; i++) {
if (trap[i])
dp[i] = 0;
else
dp[i] = (d... | [
"literal.number.change",
"assignment.change"
] | 825,200 | 825,201 | u863370423 | cpp |
p03013 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int64_t mod = 1000000007;
int main() {
int64_t n, m;
cin >> n >> m;
vector<bool> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken.at(a) = true;
}
vector<int64_t> dp(n + 2);
dp.at(n) =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int64_t mod = 1000000007;
int main() {
int64_t n, m;
cin >> n >> m;
vector<bool> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken.at(a) = true;
}
vector<int64_t> dp(n + 2);
dp.at(n) =... | [] | 825,207 | 825,208 | u370865069 | cpp |
p03013 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespa... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespa... | [
"literal.number.change",
"io.output.change"
] | 825,209 | 825,210 | u275934251 | cpp |
p03013 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int INF = 1e9;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> oks(N + 1, true);... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int INF = 1e9;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> oks(N + 1, true);... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 825,257 | 825,258 | u110653681 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
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)... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
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)... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 825,261 | 825,262 | u145483532 | 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);
dp[n] = 1;
const int mod = 1000000007;
for (int i = n; i >= 0; i--) {
if (broken[i]... | #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);
dp[n] = 1;
const int mod = 1000000007;
for (int i = n - 1; i >= 0; i--) {
if (broke... | [
"control_flow.loop.for.initializer.change"
] | 825,285 | 825,286 | u834753207 | 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);
dp[n] = 1;
int mod = 1000000007;
for (int i = n; i >= 0; i--) {
if (broken[i]) {
... | #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);
dp[n] = 1;
const int mod = 1000000007;
for (int i = n - 1; i >= 0; i--) {
if (broke... | [
"control_flow.loop.for.initializer.change",
"assignment.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 825,287 | 825,286 | u834753207 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#d... | [
"call.arguments.change"
] | 825,290 | 825,291 | u038027079 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 100005
ll broken[mx] = {0};
ll dp[mx] = {0};
#define mod 1000000007
int main() {
ios_base::sync_with_stdio(0);
ll n, m, a;
cin >> n;
cin >> m;
for (int i = 1; i <= n; i++) {
cin >> a;
broken[a] = 1;
}
dp[0] = 1;
for (i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 100005
ll broken[mx] = {0};
ll dp[mx] = {0};
#define mod 1000000007
int main() {
ios_base::sync_with_stdio(0);
ll n, m, a;
cin >> n;
cin >> m;
for (int i = 1; i <= m; i++) {
cin >> a;
broken[a] = 1;
}
dp[0] = 1;
for (i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 825,295 | 825,296 | u701914155 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n, m, k;
cin >> n >> m;
set<int> drop;
rep(i, m) {
cin >> k;
drop.insert(k);
}
vector<int> dp(n + 1);
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
if (drop.c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n, m, k;
cin >> n >> m;
set<int> drop;
rep(i, m) {
cin >> k;
drop.insert(k);
}
vector<int> dp(n + 2);
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
if (drop.c... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 825,297 | 825,298 | u436733497 | 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>;
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 = 1... | #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>;
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 = 1... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 825,310 | 825,311 | u108108663 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 100... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 100... | [
"assignment.change"
] | 825,333 | 825,334 | u443971699 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 100... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 100... | [
"assignment.change"
] | 825,335 | 825,336 | u023958502 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 100... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 100... | [
"assignment.change"
] | 825,337 | 825,336 | u023958502 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 100... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 100... | [
"assignment.change"
] | 825,338 | 825,336 | u023958502 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 100... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 100... | [
"assignment.change"
] | 825,337 | 825,342 | u023958502 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 100... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 100... | [
"expression.operation.binary.remove"
] | 825,338 | 825,342 | u023958502 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
// std::sort(v.begin(), v.end(), std::greater<Type>());
ll n, m;
vector<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
// std::sort(v.begin(), v.end(), std::greater<Type>());
ll n, m;
vector<... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 825,386 | 825,387 | u229427161 | cpp |
p03013 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define DEBUG
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) \
show(__VA_ARGS__); ... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define DEBUG
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) \
show(__VA_ARGS__); ... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 825,390 | 825,391 | u304829684 | cpp |
p03013 | #include <iostream>
#include <vector>
typedef long long int ll;
const ll mod = 1e9 + 7;
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> a(n + 1, true);
for (int i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = false;
}
vector<ll> dp(n + 1);
dp[n] = 1;
dp[n - 1... | #include <iostream>
#include <vector>
typedef long long int ll;
const ll mod = 1e9 + 7;
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> a(n + 1, true);
for (int i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = false;
}
vector<ll> dp(n + 2);
dp[n] = 1;
dp[n - 1... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 825,392 | 825,393 | u749089333 | cpp |
p03013 | #include <iostream>
#include <vector>
typedef long long int ll;
const ll mod = 1e9 + 7;
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> a(n + 1, true);
for (int i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = false;
}
vector<ll> dp(n + 1);
dp[n] = 1;
dp[n - 1... | #include <iostream>
#include <vector>
typedef long long int ll;
const ll mod = 1e9 + 7;
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> a(n + 1, true);
for (int i = 0; i < m; i++) {
int x;
cin >> x;
a[x] = false;
}
vector<ll> dp(n + 2);
dp[n] = 1;
dp[n - 1... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 825,392 | 825,394 | u749089333 | 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 repe(i, a, b) for (ll i = (a); i <= (b); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll INF = 1LL << 60;
ll dp[100... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define repe(i, a, b) for (ll i = (a); i <= (b); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll INF = 1LL << 60;
ll dp[100... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 825,400 | 825,401 | u873269440 | cpp |
p03013 | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 31;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=13... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 31;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=13... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 825,402 | 825,403 | u730499268 | cpp |
p03013 | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 31;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=13... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 31;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=13... | [] | 825,404 | 825,403 | u730499268 | cpp |
p03013 | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 31;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=13... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 31;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=13... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 825,405 | 825,403 | u730499268 | cpp |
p03013 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 31;
const int mod = 1e9 + 7;
int main() {
int n, m, a = 0;
ll dp[100010];
vector<bool> broken(100010, true);
cin >> ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 31;
const int mod = 1e9 + 7;
int main() {
int n, m, a = 0;
ll dp[100010];
vector<bool> broken(100010, true);
cin >> ... | [] | 825,406 | 825,407 | u730499268 | cpp |
p03013 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 31;
const int mod = 1e9 + 7;
int main() {
int n, m, a = 0;
ll dp[100010];
vector<bool> broken(100010, true);
cin >> ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 31;
const int mod = 1e9 + 7;
int main() {
int n, m, a = 0;
ll dp[100010];
vector<bool> broken(100010, true);
cin >> ... | [
"assignment.value.change"
] | 825,408 | 825,407 | u730499268 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
// 0だとOK １だと壊れてる
int a[N + 1] = {0};
for (int i = 0; i < M; i++) {
int temp;
cin >> temp;
a[temp] = 1;
}
long long int s[N + 1];
s[0] = 1;
if (a[1] == 1)
s[1] = 0;
else
s[1] = 1;
long lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
// 0だとOK １だと壊れてる
int a[N + 1] = {0};
for (int i = 0; i < M; i++) {
int temp;
cin >> temp;
a[temp] = 1;
}
long long int s[N + 1];
s[0] = 1;
if (a[1] == 1)
s[1] = 0;
else
s[1] = 1;
long lon... | [
"assignment.change"
] | 825,409 | 825,410 | u759510609 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m; i > n; i--)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m; i > n; i--)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n... | [
"assignment.change"
] | 825,442 | 825,443 | u618604643 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#include <iostream>
#include <vector>
using namespace std;
//重複順列
vector<ll> buf;
void permutation(ll i, const ll size, const ll range_start,
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#include <iostream>
#include <vector>
using namespace std;
//重複順列
vector<ll> buf;
void permutation(ll i, const ll size, const ll range_start,
... | [] | 825,448 | 825,449 | u761994361 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, m;
ll p = 100000007;
cin >> n >> m;
ll dp[n + 1];
dp[0] = 1;
ll num;
for (ll i = 1; i <= m; i++) {
cin >> num;
dp[num] = -1;
}
if (dp[1] == -1) {
dp[1]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, m;
ll p = 1000000007;
cin >> n >> m;
ll dp[n + 1];
dp[0] = 1;
ll num;
for (ll i = 1; i <= m; i++) {
cin >> num;
dp[num] = -1;
}
if (dp[1] == -1) {
dp[1... | [
"literal.number.change",
"variable_declaration.value.change"
] | 825,474 | 825,475 | u781076291 | cpp |
p03013 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ... | [] | 825,489 | 825,490 | u879674287 | cpp |
p03013 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 825,499 | 825,500 | u489823438 | cpp |
p03013 | #include <algorithm> // std::unique
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
/*
D - Multiple of 2019
*/
int main(void) {
int stairNum;
int brokenNum;
cin >> stairNum >> brokenNum;
vector<bool> isSafeStep;
isSafeStep.assign(stairNum + 1, true);
for (int ... | #include <algorithm> // std::unique
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
/*
D - Multiple of 2019
*/
int main(void) {
int stairNum;
int brokenNum;
cin >> stairNum >> brokenNum;
vector<bool> isSafeStep;
isSafeStep.assign(stairNum + 1, true);
for (int ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 825,535 | 825,536 | u368138550 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
ll mod = 1e9 + 7;
cin >> N >> M;
vector<ll> hole(N, 0);
for (ll i = 0; i < M; ++i) {
ll a;
cin >> a;
hole[a] = 1;
}
ll dp[N + 10];
fill(dp, dp + N + 10, 0);
dp[0] = 1;
for (ll i = 0; i < N + 5; i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
ll mod = 1e9 + 7;
cin >> N >> M;
vector<ll> hole(N + 10, 0);
for (ll i = 0; i < M; ++i) {
ll a;
cin >> a;
hole[a] = 1;
}
ll dp[N + 10];
fill(dp, dp + N + 10, 0);
dp[0] = 1;
for (ll i = 0; i < N + 5... | [
"assignment.change"
] | 825,565 | 825,566 | u883725898 | cpp |
p03013 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define _(x) \
... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define _(x) \
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 825,578 | 825,579 | u150070357 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.