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 |
|---|---|---|---|---|---|---|---|
p02927 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n, num = 0;
cin >> m >> n;
for (int i = 2; i <= 10; i++) {
for (int j = 2; j <= 10; j++) {
if (i * 10 + j <= n && i * j <= m) {
num++;
}
}
}
cout << num;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n, num = 0;
cin >> m >> n;
for (int i = 2; i < 10; i++) {
for (int j = 2; j < 10; j++) {
if (i * 10 + j <= n && i * j <= m) {
num++;
}
}
}
cout << num;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 730,606 | 730,607 | u931613131 | cpp |
p02927 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#includ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#includ... | [
"literal.number.change",
"call.arguments.change"
] | 730,618 | 730,619 | u279196402 | cpp |
p02927 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 730,626 | 730,627 | u268571052 | cpp |
p02927 |
/*
LANG:C++
PROB:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x)... |
/*
LANG:C++
PROB:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x)... | [
"identifier.change"
] | 730,628 | 730,629 | u114047445 | cpp |
p02927 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int m, d;
cin >> m >> d;
int ans = 0;
for (int i = 4; i <= m; i++) {
for (int j = 22; j < d; j++) {
int d1 = j % 10;
int d10 = j / 10;
if (d1 >= 2 && d10 >= 2 && d1 * d10 =... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int m, d;
cin >> m >> d;
int ans = 0;
for (int i = 4; i <= m; i++) {
for (int j = 22; j <= d; j++) {
int d1 = j % 10;
int d10 = j / 10;
if (d1 >= 2 && d10 >= 2 && d1 * d10 ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 730,630 | 730,631 | u735236707 | cpp |
p02927 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, d, ans, t, o;
cin >> m >> d;
ans = 0;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= d; j++) {
t = j / 10;
o = j % 10;
if (j >= 2 && i >= 2 && t * o == i) {
ans++;
}
}
}
cout << ans << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, d, ans, t, o;
cin >> m >> d;
ans = 0;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= d; j++) {
t = j / 10;
o = j % 10;
if (t >= 2 && o >= 2 && t * o == i) {
// cout << i << ' ' << j << endl;
ans++;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 730,634 | 730,635 | u026950523 | cpp |
p02927 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, d, ans, t, o;
cin >> m >> d;
ans = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < d; j++) {
t = j / 10;
o = j % 10;
if (j >= 2 && i >= 2 && t * o == i) {
ans++;
}
}
}
cout << ans << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, d, ans, t, o;
cin >> m >> d;
ans = 0;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= d; j++) {
t = j / 10;
o = j % 10;
if (t >= 2 && o >= 2 && t * o == i) {
// cout << i << ' ' << j << endl;
ans++;
... | [
"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",
"identifier.change",
"control_flow.branch.if.condit... | 730,636 | 730,635 | u026950523 | cpp |
p02927 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_in(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef int64_t ll;
int main() {
int m, d;
cin >> m >> d;
int out = 0;
rep(i, d) {
if (i % 10 >= 2 && i / 10 >= 2 && (i / 10) * (i % 10) <= m)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_in(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef int64_t ll;
int main() {
int m, d;
cin >> m >> d;
int out = 0;
rep(i, d + 1) {
if (i % 10 >= 2 && i / 10 >= 2 && (i / 10) * (i % 10) <= m)... | [
"expression.operation.binary.add"
] | 730,639 | 730,640 | u737252485 | cpp |
p02927 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int... | [
"call.arguments.add"
] | 730,643 | 730,644 | u050865477 | cpp |
p02927 | #include <algorithm> // sort
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map> // pair
#include <numeric> // accumulate(begin,end,初期値)
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n")... | #include <algorithm> // sort
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map> // pair
#include <numeric> // accumulate(begin,end,初期値)
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n")... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 730,649 | 730,650 | u184572586 | cpp |
p02927 | #include <iostream>
using namespace std;
int main() {
int m, d;
cin >> m >> d;
int cnt = 0;
for (int i = 4; i <= m; ++i) {
for (int j = 2; j * 10 <= d; ++j) {
if (i % j == 0) {
int k = i / j;
if (k != 1) {
if (j * 10 + k <= d) {
// cout << "i:" << i << " j:" << j ... | #include <iostream>
using namespace std;
int main() {
int m, d;
cin >> m >> d;
int cnt = 0;
for (int i = 4; i <= m; ++i) {
for (int j = 2; j * 10 <= d; ++j) {
if (i % j == 0) {
int k = i / j;
if (k >= 2 && k < 10) {
if (j * 10 + k <= d) {
// cout << "i:" << i << "... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 730,655 | 730,656 | u685650671 | cpp |
p02927 | #include <bits/stdc++.h>
using namespace std;
#define ls rt << 1
#define rs (rt << 1) + 1
#define PI acos(-1)
#define eps 1e-8
#define ll long long
#define fuck(x) cout << #x << " " << x << endl;
typedef pair<int, int> pii;
const int inf = 2e9;
const int maxn = 1e6 + 10;
int d[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};
//... | #include <bits/stdc++.h>
using namespace std;
#define ls rt << 1
#define rs (rt << 1) + 1
#define PI acos(-1)
#define eps 1e-8
#define ll long long
#define fuck(x) cout << #x << " " << x << endl;
typedef pair<int, int> pii;
const int inf = 2e9;
const int maxn = 1e6 + 10;
int d[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};
//... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 730,665 | 730,666 | u492330079 | cpp |
p02927 | #include <bits/stdc++.h>
using namespace std;
#define ls rt << 1
#define rs (rt << 1) + 1
#define PI acos(-1)
#define eps 1e-8
#define ll long long
#define fuck(x) cout << #x << " " << x << endl;
typedef pair<int, int> pii;
const int inf = 2e9;
const int maxn = 1e6 + 10;
int d[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};
//... | #include <bits/stdc++.h>
using namespace std;
#define ls rt << 1
#define rs (rt << 1) + 1
#define PI acos(-1)
#define eps 1e-8
#define ll long long
#define fuck(x) cout << #x << " " << x << endl;
typedef pair<int, int> pii;
const int inf = 2e9;
const int maxn = 1e6 + 10;
int d[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};
//... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 730,667 | 730,666 | u492330079 | cpp |
p02927 | #include <bits/stdc++.h>
using namespace std;
int main() {
int M, D;
cin >> M >> D;
int ans = 0;
for (int m = 1; m <= M; m++) {
for (int d10 = 2; d10 <= 9; d10++) {
for (int d1 = 2; d1 <= 9; d1++) {
if (10 * d10 + d1 >= D)
goto OUT;
if (m == d1 * d10)
ans++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int M, D;
cin >> M >> D;
int ans = 0;
for (int m = 1; m <= M; m++) {
for (int d10 = 2; d10 <= 9; d10++) {
for (int d1 = 2; d1 <= 9; d1++) {
if (10 * d10 + d1 > D)
goto OUT;
if (m == d1 * d10)
ans++;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 730,668 | 730,669 | u320241053 | cpp |
p02927 | #include <bits/stdc++.h>
using namespace std;
int main() {
int M, D;
cin >> M >> D;
int ans = 0;
for (int i = 1; i <= M; i++) {
for (int j = 12; j <= D; j++) {
if (j / 10 == 1) {
continue;
} else if (j % 10 == 1) {
continue;
}
if (M == (j / 10) * (j % 10)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int M, D;
cin >> M >> D;
int ans = 0;
for (int i = 1; i <= M; i++) {
for (int j = 12; j <= D; j++) {
if (j / 10 == 1) {
continue;
} else if (j % 10 == 1) {
continue;
}
if (i == (j / 10) * (j % 10)) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 730,672 | 730,673 | u454081619 | cpp |
p02927 | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define pb push_back
#define sz(x) (int)x.size()
#define f first
#define s second
int main() ... | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define pb push_back
#define sz(x) (int)x.size()
#define f first
#define s second
int main() ... | [
"expression.operation.binary.add"
] | 730,676 | 730,677 | u855138664 | cpp |
p02927 | #include <bits/stdc++.h>
using namespace std;
int n, d;
int main() {
cin >> n >> d;
int ile = 0;
for (int m = 4; m <= n; ++m)
for (int i = 2; i <= 9; ++i) {
if (m % i)
continue;
if (10 * i + (m / i) <= d && m / i > 1)
++ile;
}
cout << ile;
}
| #include <bits/stdc++.h>
using namespace std;
int n, d;
int main() {
cin >> n >> d;
int ile = 0;
for (int m = 4; m <= n; ++m)
for (int i = 2; i <= 9; ++i) {
if (m % i || m / i > 9)
continue;
if (10 * i + (m / i) <= d && m / i > 1)
++ile;
}
cout << ile;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 730,678 | 730,679 | u038050360 | cpp |
p02927 | /*
* shubhamg931 - Shubham Gupta (B.Tech - IT, 2016-2020 batch)
*/
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define MAXN 500005
#define PI 3.14159265
#define pb push_back
#define eb emplace_back
#define FAST \
ios_base::... | /*
* shubhamg931 - Shubham Gupta (B.Tech - IT, 2016-2020 batch)
*/
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define MAXN 500005
#define PI 3.14159265
#define pb push_back
#define eb emplace_back
#define FAST \
ios_base::... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 730,680 | 730,681 | u863053903 | cpp |
p02927 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MOD 1000000007
#define MAX 1000000007
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ub upper_bound
#define lb lower_bound
#define zoom ... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MOD 1000000007
#define MAX 1000000007
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ub upper_bound
#define lb lower_bound
#define zoom ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 730,686 | 730,687 | u172458874 | cpp |
p02927 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int M, D, count = 0;
cin >> M >> D;
for (int i = 2; i < D / 10; i++) {
for (int j = 2; j < 9; j++) {
for (int k = 4; k <= M; k++) {
if (k == i * j)
count++;
}
}
}
if (D > 20) {
for (int j = 2; j <= D % 10... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int M, D, count = 0;
cin >> M >> D;
for (int i = 2; i < D / 10; i++) {
for (int j = 2; j < 10; j++) {
for (int k = 4; k <= M; k++) {
if (k == i * j)
count++;
}
}
}
if (D > 20) {
for (int j = 2; j <= D % 1... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 730,696 | 730,697 | u164448353 | cpp |
p02927 | #include <bits/stdc++.h>
int32_t main() {
int m, d;
scanf("%d%d", &m, &d);
int ans = 0;
for (int i = 10; i < d; i++) {
int d1 = i / 10;
int d10 = i % 10;
if (d1 * d10 <= m && d1 >= 2 && d10 >= 2) {
ans++;
}
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
int32_t main() {
int m, d;
scanf("%d%d", &m, &d);
int ans = 0;
for (int i = 22; i <= d; i++) {
int d1 = i / 10;
int d10 = i % 10;
if (d1 * d10 <= m && d1 >= 2 && d10 >= 2) {
ans++;
}
}
printf("%d\n", ans);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 730,702 | 730,703 | u030489681 | cpp |
p02927 | #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 m, d, ans;
cin >> m >> d;
ans = 0;
for (int i = 22; i < d; i++) {
string i_s = to_string(i);
if (((i_s[0] - '0') < 2) || ((i_s[1] - '0') < 2))
continue;
int p =... | #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 m, d, ans;
cin >> m >> d;
ans = 0;
for (int i = 22; i <= d; i++) {
string i_s = to_string(i);
if (((i_s[0] - '0') < 2) || ((i_s[1] - '0') < 2))
continue;
int p ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 730,704 | 730,705 | u238786149 | cpp |
p02927 | #include <bits/stdc++.h>
#define ll long long
#define rep(X, N) for (int X = 0; X < (N); X++)
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ceilint(A, B) ((A) + (B - 1)) / (B)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
int main() {
int m, d;
cin >> m >> d;
int... | #include <bits/stdc++.h>
#define ll long long
#define rep(X, N) for (int X = 0; X < (N); X++)
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ceilint(A, B) ((A) + (B - 1)) / (B)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
int main() {
int m, d;
cin >> m >> d;
int... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 730,706 | 730,707 | u145078501 | cpp |
p02927 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int M, D;
cin >> M >> D;
int ans = 0;
for (int i = 1; i <= M; i++) {
for (int j = 22; j < D; j++) {
if (j % 1... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int M, D;
cin >> M >> D;
int ans = 0;
for (int i = 1; i <= M; i++) {
for (int j = 22; j <= D; j++) {
if (j % ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 730,712 | 730,713 | u808593466 | cpp |
p02927 | #include <iostream>
using namespace std;
int main() {
int m, d;
cin >> m >> d;
int ans = 0;
for (int i = 1; m >= i; i++) {
for (int j = 1; d >= j; j++) {
int d1 = d % 10;
int d10 = d / 10;
if (d1 > 2 && d10 >= 2 && d1 * d10 == m)
ans++;
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int m, d;
cin >> m >> d;
int ans = 0;
for (int i = 1; m >= i; i++) {
for (int j = 1; d >= j; j++) {
int d1 = j % 10;
int d10 = j / 10;
if (d1 >= 2 && d10 >= 2 && d1 * d10 == i)
ans++;
}
}
cout << ans << endl;
} | [
"identifier.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 730,714 | 730,715 | u466161487 | cpp |
p02927 | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, s, N) for (ll i{s}; i < (N); i++)
#define rem(i, N, s) for (ll i{N}; i > (s); i--)
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugp(i) cerr << "(" << i.first << ", " << i.second << ")\n"
#define... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, s, N) for (ll i{s}; i < (N); i++)
#define rem(i, N, s) for (ll i{N}; i > (s); i--)
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugp(i) cerr << "(" << i.first << ", " << i.second << ")\n"
#define... | [
"expression.operation.binary.add"
] | 730,716 | 730,717 | u936790121 | cpp |
p02927 | #include <chrono>
#include <iostream>
#include <random>
#include <vector>
std::mt19937
rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
int m, d;
std::cin >> m >> d;
int ans = 0;
for (int i = 2; i * 11 <= d &... | #include <chrono>
#include <iostream>
#include <random>
#include <vector>
std::mt19937
rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
int m, d;
std::cin >> m >> d;
int ans = 0;
for (int i = 2; i * 10 <= d &... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 730,718 | 730,719 | u296475749 | cpp |
p02927 | #include <bits/stdc++.h>
#define loop(n) \
for (int ngtkana_is_genius = 0; ngtkana_is_genius < int(n); \
ngtkana_is_genius++)
#define rep(i, begin, end) for (int i = int(begin); i < int(end); i++)
#define lint long long
auto cmn = ... | #include <bits/stdc++.h>
#define loop(n) \
for (int ngtkana_is_genius = 0; ngtkana_is_genius < int(n); \
ngtkana_is_genius++)
#define rep(i, begin, end) for (int i = int(begin); i < int(end); i++)
#define lint long long
auto cmn = ... | [
"expression.operation.binary.add"
] | 730,720 | 730,721 | u846041485 | cpp |
p02927 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#inc... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#inc... | [
"expression.operation.binary.add"
] | 730,722 | 730,723 | u579875569 | cpp |
p02927 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, d;
cin >> m >> d;
int ans = 0;
for (int i = 2; i <= 9; i++) {
for (int j = 2; j <= 9; j++) {
int cur = i * 10 + j;
if (cur > d)
continue;
int curm = i * j;
if (curm <= m)
ans++;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, d;
cin >> m >> d;
int ans = 0;
for (int i = 2; i <= 9; i++) {
for (int j = 2; j <= 9; j++) {
int cur = i * 10 + j;
if (cur > d)
continue;
int curm = i * j;
if (curm <= m)
ans++;
}
}
cout << ans... | [] | 730,726 | 730,727 | u901862155 | cpp |
p02927 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(998244353)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(998244353)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 730,728 | 730,729 | u055148700 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
long long MOD = 1000000007;
int main() {
long long N, K;
cin >> N >> K;
long long A[N];
rep(i, N) cin >> A[i];
// 入力終了
long long ans = 0;
// 自分自身の中にある転倒数の数
lo... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
long long MOD = 1000000007;
int main() {
long long N, K;
cin >> N >> K;
long long A[N];
rep(i, N) cin >> A[i];
// 入力終了
long long ans = 0;
// 自分自身の中にある転倒数の数
lo... | [] | 730,730 | 730,731 | u537852947 | cpp |
p02928 | #include <bits/stdc++.h>
using ll = long long;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define ALL(x) x.begin(), x.end()
#define INF (ll)1e9 // 10^9:∞
#define LLINF (ll)1e12
#define MOD (ll)(1e9 + 7) // 10^9+7:合同式の法
#define PI 3.141592653589
#define PB push... | #include <bits/stdc++.h>
using ll = long long;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define ALL(x) x.begin(), x.end()
#define INF (ll)1e9 // 10^9:∞
#define LLINF (ll)1e12
#define MOD (ll)(1e9 + 7) // 10^9+7:合同式の法
#define PI 3.141592653589
#define PB push... | [
"expression.operation.binary.remove",
"assignment.change"
] | 730,732 | 730,733 | u345693891 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] == a[j])
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] == a[j])
... | [
"variable_declaration.type.change"
] | 730,760 | 730,761 | u813174766 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int, int>
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
ll ans = 0;
for (int i = 0; i < n; i++) {
ll big... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int, int>
const ll MOD = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
ll ans = 0;
for (int i = 0; i < n; i++) {
ll big =... | [
"variable_declaration.type.change"
] | 730,762 | 730,763 | u692550512 | cpp |
p02928 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 730,764 | 730,765 | u991713078 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long O = 1000000007;
long long N, K;
cin >> N >> K;
vector<int> A(N);
vector<int> B(N * 2);
for (int X = 0; X < N; X++) {
cin >> A[X];
B[X] = A[X];
B[N + X] = A[X];
}
long long M = 0;
for (int X = 0; X < N - 1; X++) {
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long O = 1000000007;
long long N, K;
cin >> N >> K;
vector<int> A(N);
vector<int> B(N * 2);
for (int X = 0; X < N; X++) {
cin >> A[X];
B[X] = A[X];
B[N + X] = A[X];
}
long long M = 0;
for (int X = 0; X < N - 1; X++) {
for... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 730,766 | 730,767 | u740002394 | cpp |
p02928 | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
template <typename T> void print(T t) { cout << t << en... | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
template <typename T> void print(T t) { cout << t << en... | [] | 730,770 | 730,771 | u991692050 | cpp |
p02928 | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
template <typename T> void print(T t) { cout << t << en... | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
template <typename T> void print(T t) { cout << t << en... | [] | 730,772 | 730,771 | u991692050 | cpp |
p02928 | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | [] | 730,777 | 730,778 | u931901821 | cpp |
p02928 | // #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#ifdef BOI
#include "debug.h"
#else
#define debug(args...)
#endif
#define endl '\n'
using ll = long long;
using namespace std;
const ll mod... | // #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#ifdef BOI
#include "debug.h"
#else
#define debug(args...)
#endif
#define endl '\n'
using ll = long long;
using namespace std;
const ll mod... | [] | 730,779 | 730,780 | u514461570 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 10010... | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 10010... | [
"assignment.change"
] | 730,783 | 730,784 | u209457657 | cpp |
p02928 | #include "bits/stdc++.h"
#include <random>
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | #include "bits/stdc++.h"
#include <random>
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | [
"assignment.change",
"expression.operation.binary.remove"
] | 730,800 | 730,801 | u554988565 | cpp |
p02928 | #include "bits/stdc++.h"
#include <random>
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | #include "bits/stdc++.h"
#include <random>
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | [] | 730,802 | 730,801 | u554988565 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define froop1(a, n) for (int i = a; i < n; i++)
#define froop2(a, n) for (int i = a; i > n; i--)
#define ll long long
#define pq(name, type) priority_queue<type> name
#define vec(name, type, length, value) vector<type> name(length, value)
#define vec2(name, type, length... | #include <bits/stdc++.h>
using namespace std;
#define froop1(a, n) for (int i = a; i < n; i++)
#define froop2(a, n) for (int i = a; i > n; i--)
#define ll long long
#define pq(name, type) priority_queue<type> name
#define vec(name, type, length, value) vector<type> name(length, value)
#define vec2(name, type, length... | [
"assignment.change"
] | 730,807 | 730,808 | u475471747 | cpp |
p02928 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | [] | 730,820 | 730,821 | u222866518 | cpp |
p02928 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | [] | 730,822 | 730,823 | u222866518 | cpp |
p02928 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | [] | 730,822 | 730,824 | u222866518 | cpp |
p02928 | // う し た ぷ に き あ く ん 笑
#include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
constexpr int MOD = 1000000000 + 7;
// copied from https://github.com/atcoder-live/library/blo... | // う し た ぷ に き あ く ん 笑
#include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
constexpr int MOD = 1000000000 + 7;
// copied from https://github.com/atcoder-live/library/blo... | [
"expression.operation.binary.remove"
] | 730,825 | 730,826 | u076506345 | cpp |
p02928 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define sim template <class c
#define ris... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define sim template <class c
#define ris... | [
"assignment.add"
] | 730,830 | 730,831 | u428805520 | cpp |
p02928 | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
static ll MOD = 1'000'000'007;
int m... | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
static ll MOD = 1'000'000'007;
int m... | [
"variable_declaration.type.change"
] | 730,832 | 730,833 | u011438316 | cpp |
p02928 | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
static ll MOD = 1'000'000'007;
int m... | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
static ll MOD = 1'000'000'007;
int m... | [] | 730,834 | 730,833 | u011438316 | cpp |
p02928 | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
static int MOD = 1'000'000'007;
int ... | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
static ll MOD = 1'000'000'007;
int m... | [
"variable_declaration.type.change"
] | 730,835 | 730,833 | u011438316 | cpp |
p02928 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A.at(i);
}
long long kk;
if (k % 2 == 0) {
kk = (k / 2) * (k - 1) % (7 + (long long)1e9);
} else {
kk = k * ((k - 1... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A.at(i);
}
long long kk;
if (k % 2 == 0) {
kk = ((k / 2) * (k - 1)) % (7 + (long long)1e9);
} else {
kk = (k * ((k ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 730,836 | 730,837 | u981206782 | cpp |
p02928 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 730,838 | 730,839 | u527058497 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | [
"assignment.change"
] | 730,840 | 730,841 | u461336793 | cpp |
p02928 | #include <bits/stdc++.h>
#include <cmath>
// using namespace boost::multiprecision;
using namespace std;
typedef long long ll;
// typedef unsigned long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//#define sz(x) ll(x.size())
// type... | #include <bits/stdc++.h>
#include <cmath>
// using namespace boost::multiprecision;
using namespace std;
typedef long long ll;
// typedef unsigned long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//#define sz(x) ll(x.size())
// type... | [
"call.add",
"call.arguments.change"
] | 730,842 | 730,843 | u564182781 | cpp |
p02928 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi =... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi =... | [
"assignment.add"
] | 730,844 | 730,845 | u802434195 | cpp |
p02928 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi =... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi =... | [
"call.add",
"assignment.add"
] | 730,846 | 730,845 | u802434195 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const ll inf = 10010010... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const ll inf = 10010010... | [
"expression.operation.binary.remove"
] | 730,847 | 730,848 | u330518333 | cpp |
p02928 | #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>;
const int m = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll inv1 = 0, inv2 = 0;
rep(i, n) {
rep(j, n) {
if (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>;
const int m = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll inv1 = 0, inv2 = 0;
rep(i, n) {
rep(j, n) {
if (i ... | [
"variable_declaration.type.change"
] | 730,857 | 730,858 | u281829807 | cpp |
p02928 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cstring>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cstring>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | [] | 730,861 | 730,862 | u734397606 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
vector<ll> inans(n);
for (int i = 0; i < n; i++) {
if (i == n - 1) {
inans.at(i) = 0;
break;
} else {
ll x = a.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
vector<ll> inans(n);
for (int i = 0; i < n; i++) {
if (i == n - 1) {
inans.at(i) = 0;
break;
} else {
ll x = a.... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 730,868 | 730,869 | u582684800 | cpp |
p02928 | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 100100;
const long long mod = 1e9 + 7;
using namespace std;
int n;
int a[N];
long long k;
int main() {
ios_base::sync_with_stdio(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n >> k;
for (... | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 100100;
const long long mod = 1e9 + 7;
using namespace std;
int n;
int a[N];
long long k;
int main() {
ios_base::sync_with_stdio(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n >> k;
for (... | [] | 730,872 | 730,873 | u941977569 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
const long long int M = 1e9 + 7;
int main() {
long long int n, k, i, j;
cin >> n >> k;
long long int a[n + 1];
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long int ans = 0;
for (i = 0; i < n; i++) {
long long int c = 0, d = 0;
for (j = 0; j < i; ... | #include <bits/stdc++.h>
using namespace std;
const long long int M = 1e9 + 7;
int main() {
long long int n, k, i, j;
cin >> n >> k;
long long int a[n + 1];
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long int ans = 0;
for (i = 0; i < n; i++) {
long long int c = 0, d = 0;
for (j = 0; j < i; ... | [
"assignment.change"
] | 730,885 | 730,886 | u532483802 | cpp |
p02928 | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, m, n) for (in... | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, m, n) for (in... | [] | 730,891 | 730,892 | u138062788 | cpp |
p02928 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int cnt = 0, cnt2 = 0;
rep(i, n) {
for (int j = i + 1; j < n; ++j) {
if (a[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int cnt = 0, cnt2 = 0;
rep(i, n) {
for (int j = i + 1; j < n; ++j) {
if (a[i]... | [
"expression.operation.binary.remove"
] | 730,902 | 730,903 | u754114382 | cpp |
p02928 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define rep2(i, n, m) for (long long i = n; i <= m; i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1e18;... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define rep2(i, n, m) for (long long i = n; i <= m; i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1e18;... | [] | 730,904 | 730,905 | u449123607 | cpp |
p02928 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | [] | 730,906 | 730,907 | u965730380 | cpp |
p02928 | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> a(2 * n);
for (long ... | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> a(2 * n);
for (long ... | [
"assignment.add"
] | 730,908 | 730,909 | u583888880 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | [
"assignment.change"
] | 730,912 | 730,913 | u093973314 | cpp |
p02928 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#incl... | [
"identifier.change",
"expression.operation.binary.change"
] | 730,914 | 730,915 | u247679666 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll k;
cin >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll cou = 0;
ll q = 10e8 + 7;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j])... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll k;
cin >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll cou = 0;
ll q = 10e8 + 7;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j])... | [
"assignment.add"
] | 730,916 | 730,917 | u457483230 | cpp |
p02928 | #include <bits/stdc++.h>
#include <functional>
#include <numeric>
using namespace std;
namespace mod {
template <class T, int M> class MInt;
template <class T, int M> MInt<T, M> Pow(const MInt<T, M> &base, T exp);
template <class T, int M> MInt<T, M> Inv(const MInt<T, M> &n);
template <class T, int M> class MInt ... | #include <bits/stdc++.h>
#include <functional>
#include <numeric>
using namespace std;
namespace mod {
template <class T, int M> class MInt;
template <class T, int M> MInt<T, M> Pow(const MInt<T, M> &base, T exp);
template <class T, int M> MInt<T, M> Inv(const MInt<T, M> &n);
template <class T, int M> class MInt ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change"
] | 730,930 | 730,931 | u289545075 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = (ll)(1e9 + 7);
int main() {
ll n;
ll k;
cin >> n >> k;
vector<ll> a(n);
ll sum = 0, sum2 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < n; j++) {
if (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = (ll)(1e9 + 7);
int main() {
ll n;
ll k;
cin >> n >> k;
vector<ll> a(n);
ll sum = 0, sum2 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 730,932 | 730,933 | u962609087 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = (ll)(1e9 + 7);
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> a(n);
ll sum = 0, sum2 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < n; j++) {
if ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = (ll)(1e9 + 7);
int main() {
ll n;
ll k;
cin >> n >> k;
vector<ll> a(n);
ll sum = 0, sum2 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 730,934 | 730,933 | u962609087 | cpp |
p02928 | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto pitr = c.begin(); pitr != c.end(); ++pitr) { \
cout << *pitr;... | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto pitr = c.begin(); pitr != c.end(); ++pitr) { \
cout << *pitr;... | [
"assignment.value.change"
] | 730,938 | 730,939 | u135248164 | cpp |
p02928 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
void file() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
const int P = 1e9 + 7;
l... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
void file() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
const int P = 1e9 + 7;
l... | [
"call.remove"
] | 730,948 | 730,949 | u555865264 | cpp |
p02928 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
void file() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
const int P = 1e9 + 7;
l... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
void file() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
const int P = 1e9 + 7;
l... | [
"call.remove"
] | 730,948 | 730,950 | u555865264 | cpp |
p02928 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
... | [
"expression.operation.binary.add"
] | 730,951 | 730,952 | u501163846 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long lint;
mt19937 mt(time(nullptr));
// uniform_int_distribution< int > rand_int(0, 10) // rand[0, 10] inclusive
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
lint n, k;
cin >> n >> k;
vector<lint> a(n);
for (l... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long lint;
mt19937 mt(time(nullptr));
// uniform_int_distribution< int > rand_int(0, 10) // rand[0, 10] inclusive
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
lint n, k;
cin >> n >> k;
vector<lint> a(n);
for (l... | [
"expression.operation.binary.remove",
"assignment.change"
] | 730,953 | 730,954 | u691764803 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long lint;
mt19937 mt(time(nullptr));
// uniform_int_distribution< int > rand_int(0, 10) // rand[0, 10] inclusive
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
lint n, k;
cin >> n >> k;
vector<lint> a(n);
for (l... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long lint;
mt19937 mt(time(nullptr));
// uniform_int_distribution< int > rand_int(0, 10) // rand[0, 10] inclusive
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
lint n, k;
cin >> n >> k;
vector<lint> a(n);
for (l... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 730,955 | 730,954 | u691764803 | cpp |
p02928 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | [] | 730,965 | 730,966 | u812973725 | cpp |
p02928 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | [
"expression.operation.binary.remove"
] | 730,967 | 730,968 | u852449189 | cpp |
p02928 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
const static ll MOD = (1e+9) + 7;
ll modcross(ll a, ll k) {
if (k == 0)
return 0;
if (k % 2 == 1)
return (a + modcross... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
const static ll MOD = (1e+9) + 7;
ll modcross(ll a, ll k) {
if (k == 0)
return 0;
if (k % 2 == 1)
return (a + modcross(a... | [
"preprocessor.define.value.change",
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 730,969 | 730,970 | u480887263 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
#define rep0(i, j) for (int i = 0; i < j; i++)
#define rep1(i, j) for (int i = 1; i <= j; i++)
#define rep0d(i, j) for (int i = j - 1; i >= 0; i--)
#define MOD 1000000007
#define I... | #include <bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
#define rep0(i, j) for (int i = 0; i < j; i++)
#define rep1(i, j) for (int i = 1; i <= j; i++)
#define rep0d(i, j) for (int i = j - 1; i >= 0; i--)
#define MOD 1000000007
#define I... | [] | 730,975 | 730,976 | u950603962 | cpp |
p02928 |
#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;
#define oset \
tree<long long, null_type, less<long long>, rb_tree_tag, \
... |
#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;
#define oset \
tree<long long, null_type, less_equal<long long>, rb_tree_tag, \
... | [
"preprocessor.define.value.change",
"expression.operation.binary.remove"
] | 730,977 | 730,978 | u900937596 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, K;
int A[2000];
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++)
scanf("%d", A + i);
long long ans = 0;
int tmp = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 0; j < N - i - 1; j++) {
... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, K;
int A[2000];
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++)
scanf("%d", A + i);
long long ans = 0;
int tmp = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 0; j < N - i - 1; j++) {
... | [] | 730,979 | 730,980 | u821180083 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ll res = 0;
if (k == 1) {
for (int i = 0; i < n; ++i) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int n;
ll k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ll res = 0;
if (k == 1) {
for (int i = 0; i < n; ++i) {
... | [] | 730,988 | 730,989 | u190018920 | cpp |
p02928 | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
using n... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
using n... | [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 730,990 | 730,991 | u174404613 | cpp |
p02928 | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
using n... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
using n... | [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 730,992 | 730,991 | u174404613 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fst first
#define snd second
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const ll N = 2001;
ll a[N];
pii na[N];
ll k;
ll n;
ll res1 = 0, res2 = 0;
int bs(int low, int high, int idx) {
int ans = n;
int target = na[idx].fst;
while (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fst first
#define snd second
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const ll N = 2001;
ll a[N];
pii na[N];
ll k;
ll n;
ll res1 = 0, res2 = 0;
int bs(int low, int high, int idx) {
int ans = n;
int target = na[idx].fst;
while (... | [
"variable_declaration.type.change"
] | 730,995 | 730,996 | u738166971 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fst first
#define snd second
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
const int N = 2001;
ll a[N];
pii na[N];
ll k;
ll n;
ll res1 = 0, res2 = 0;
int bs(int low, int high, int idx) {
int ans = n;
int target = na[idx].fst;
while... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fst first
#define snd second
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const ll N = 2001;
ll a[N];
pii na[N];
ll k;
ll n;
ll res1 = 0, res2 = 0;
int bs(int low, int high, int idx) {
int ans = n;
int target = na[idx].fst;
while (... | [
"variable_declaration.type.change"
] | 730,997 | 730,996 | u738166971 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long ans = 0, k, modk, mod = 1000000007;
cin >> n >> k;
vector<int> a(n), invs_my(n, 0), invs_other(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long ans = 0, k, modk, mod = 1000000007;
cin >> n >> k;
vector<int> a(n), invs_my(n, 0), invs_other(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 731,007 | 731,008 | u623759422 | cpp |
p02928 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
const int INF = 1000000007;
typedef long long ll;
using names... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
const int INF = 1000000007;
typedef long long ll;
using names... | [
"variable_declaration.type.change"
] | 731,009 | 731,010 | u820341516 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K, X = 0, M = 1000000007;
cin >> N >> K;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
long long int S = 0, T = 0;
for (int j = 0; j < i; j++)
if (A[i] > A[j])
S++;
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K, X = 0, M = 1000000007;
cin >> N >> K;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
long long int S = 0, T = 0;
for (int j = 0; j < i; j++)
if (A[i] > A[j])
S++;
for ... | [
"assignment.change"
] | 731,011 | 731,012 | u820224016 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K, X = 0, M = 1000000007;
cin >> N >> K;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
long long int S = 0, T = 0;
for (int j = 0; j < i; j++)
if (A[i] < A[j])
S++;
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K, X = 0, M = 1000000007;
cin >> N >> K;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
long long int S = 0, T = 0;
for (int j = 0; j < i; j++)
if (A[i] > A[j])
S++;
for ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 731,013 | 731,012 | u820224016 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | [] | 731,016 | 731,017 | u330661451 | cpp |
p02928 | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, s, f) for (int i = s; i < f; i++)
#define INF 1000000000000000000
#define MOD 1000000007
typedef pair<int, int> P;
bool prime(int n) ... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, s, f) for (int i = s; i < f; i++)
#define INF 1000000000000000000
#define MOD 1000000007
typedef pair<int, int> P;
bool prime(int n) ... | [
"assignment.change"
] | 731,022 | 731,023 | u452009494 | cpp |
p02928 | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
int main() {
ll N, K;
cin >> N >> K;
for (ll i = 0; i < N; i++) {
ll t;
cin >> t... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
int main() {
ll N, K;
cin >> N >> K;
for (ll i = 0; i < N; i++) {
ll t;
cin >> t... | [
"assignment.change"
] | 731,028 | 731,029 | u048791623 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.