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 |
|---|---|---|---|---|---|---|---|
p02928 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
// 引数の受け取り
long long N, K;
cin >> N >> K;
long long A[N];
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
long long mod = 1000000007;
long long ans1 = 0;
long long ans2 = 0;
long long ans = 0;
lo... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
// 引数の受け取り
long long N, K;
cin >> N >> K;
long long A[N];
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
long long mod = 1000000007;
long long ans1 = 0;
long long ans2 = 0;
long long ans = 0;
lo... | [
"assignment.change"
] | 731,601 | 731,602 | u641145334 | cpp |
p02928 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
// 引数の受け取り
long long N, K;
cin >> N >> K;
long long A[N];
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
long long mod = 1000000007;
long long ans1 = 0;
long long ans2 = 0;
long long ans = 0;
lo... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
// 引数の受け取り
long long N, K;
cin >> N >> K;
long long A[N];
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
long long mod = 1000000007;
long long ans1 = 0;
long long ans2 = 0;
long long ans = 0;
lo... | [
"assignment.change"
] | 731,603 | 731,602 | u641145334 | cpp |
p02928 | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
using T = tuple<... | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
using T = tuple<... | [
"assignment.change"
] | 731,604 | 731,605 | u168621426 | cpp |
p02928 | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
int N;
ll K, ans = 0;
cin >> N >> K;
int A[N];
rep(i, N) cin >> A[i];
rep(i, N) {
rep(j, N) {
if (i ==... | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
int N;
ll K, ans = 0;
cin >> N >> K;
int A[N];
rep(i, N) cin >> A[i];
rep(i, N) {
rep(j, N) {
if (i ==... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 731,619 | 731,620 | u895536055 | cpp |
p02928 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) :... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) :... | [
"call.arguments.add",
"assignment.change"
] | 731,621 | 731,622 | u089885969 | cpp |
p02928 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) :... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) :... | [
"assignment.change"
] | 731,623 | 731,624 | u089885969 | cpp |
p02928 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) :... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) :... | [
"assignment.change"
] | 731,625 | 731,624 | u089885969 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change"
] | 731,626 | 731,627 | u565624841 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change"
] | 731,628 | 731,627 | u565624841 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | [
"variable_declaration.type.change"
] | 731,629 | 731,630 | u565624841 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | [
"variable_declaration.type.change"
] | 731,631 | 731,630 | u565624841 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | [
"variable_declaration.type.change"
] | 731,632 | 731,630 | u565624841 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"assignment.change"
] | 731,633 | 731,634 | u565624841 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | [
"variable_declaration.type.change"
] | 731,629 | 731,634 | u565624841 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | [
"variable_declaration.type.change"
] | 731,631 | 731,634 | u565624841 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <iterator>
#include <map>
//#include <fstream>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <c... | [
"variable_declaration.type.change",
"assignment.add"
] | 731,632 | 731,634 | u565624841 | cpp |
p02928 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[2010] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cntl[2010] = {};
int cntr[2010] = {};
for (int i = 0; i < n; i++) {
for (int j =... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[2010] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cntl[2010] = {};
int cntr[2010] = {};
for (int i = 0; i < n; i++) {
for (int j =... | [
"assignment.change",
"expression.operation.binary.remove"
] | 731,650 | 731,651 | u108648546 | cpp |
p02928 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[2010] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cntl[2010] = {};
int cntr[2010] = {};
for (int i = 0; i < n; i++) {
for (int j =... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[2010] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cntl[2010] = {};
int cntr[2010] = {};
for (int i = 0; i < n; i++) {
for (int j =... | [
"assignment.change",
"expression.operation.binary.remove"
] | 731,652 | 731,651 | u108648546 | cpp |
p02928 | #include <iostream>
using namespace std;
#define MOD 1000000007
int main() {
int N, f = 0, b = 0;
long long int K, ans = 0;
cin >> N >> K;
int A[N];
long long int x = K * (K - 1) % MOD, y = (K * (K - 1) + 2 * K) % MOD;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
b = 0;
... | #include <iostream>
using namespace std;
#define MOD 1000000007
int main() {
int N, f = 0, b = 0;
long long int K, ans = 0;
cin >> N >> K;
int A[N];
long long int x = K * (K - 1) / 2 % MOD, y = (K * (K - 1) / 2 + K) % MOD;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
b =... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 731,655 | 731,656 | u310690147 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long N, K;
cin >> N >> K;
vector<long long> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
long long ans = 0;
for (int i = 0; i < N; i++) {
long long p = 0, q = 0;
for (int j = 0; j < N; j++) {
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long N, K;
cin >> N >> K;
vector<long long> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
long long ans = 0;
for (int i = 0; i < N; i++) {
long long p = 0, q = 0;
for (int j = 0; j < N; j++) {
... | [] | 731,668 | 731,669 | u579355226 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long N, K;
cin >> N >> K;
vector<long long> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
long long ans = 0;
for (int i = 0; i < N; i++) {
long long p = 0, q = 0;
for (int j = 0; j < N; j++) {
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long N, K;
cin >> N >> K;
vector<long long> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
long long ans = 0;
for (int i = 0; i < N; i++) {
long long p = 0, q = 0;
for (int j = 0; j < N; j++) {
... | [
"expression.operation.binary.add"
] | 731,670 | 731,669 | u579355226 | cpp |
p02928 | #include <cstdio>
int N = 1000000007;
int main(void) {
int n;
long long k;
scanf("%d %lld", &n, &k);
int arr[n], arr1[n], arr2[n];
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
arr1[i] = 0, arr2[i] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (arr[i] < ... | #include <cstdio>
int N = 1000000007;
int main(void) {
int n;
long long k;
scanf("%d %lld", &n, &k);
int arr[n], arr1[n], arr2[n];
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
arr1[i] = 0, arr2[i] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (arr[i] < ... | [
"assignment.change"
] | 731,671 | 731,672 | u946105795 | cpp |
p02928 | ///**Bismillahir Rahmanir Rahim.**
#include <bits/stdc++.h>
#define clr(a, v) memset(a, v, sizeof a)
#define all(v) v.begin(), v.end()
#define ast(v) sort(v.begin(), v.end())
#define dst(v) sort(v.begin(), v.end(), greater<int>())
#define fast \
ios_b... | ///**Bismillahir Rahmanir Rahim.**
#include <bits/stdc++.h>
#define clr(a, v) memset(a, v, sizeof a)
#define all(v) v.begin(), v.end()
#define ast(v) sort(v.begin(), v.end())
#define dst(v) sort(v.begin(), v.end(), greater<int>())
#define fast \
ios_b... | [] | 731,683 | 731,684 | u912245812 | cpp |
p02928 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 731,689 | 731,690 | u236433947 | cpp |
p02928 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 731,691 | 731,690 | u236433947 | cpp |
p02928 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 731,694 | 731,695 | u532894762 | cpp |
p02928 | #include <algorithm>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(... | #include <algorithm>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(... | [
"expression.operation.binary.remove"
] | 731,711 | 731,712 | u050698451 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; ++i)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n, k... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; ++i)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n;
... | [] | 731,733 | 731,734 | u655777757 | cpp |
p02928 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all... | [
"assignment.change"
] | 731,745 | 731,746 | u054475353 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (ll)1000000007
int main() {
int N;
ll K;
cin >> N >> K;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll c = 0; // i桁目の数字よりも大きい数の総数（1≦i≦N）
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (ll)1000000007
int main() {
int N;
ll K;
cin >> N >> K;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll c = 0; // i桁目の数字よりも大きい数の総数（1≦i≦N）
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
i... | [
"expression.operation.binary.remove",
"assignment.change"
] | 731,749 | 731,750 | u568545273 | cpp |
p02928 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
type... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
type... | [
"assignment.change"
] | 731,769 | 731,770 | u899645116 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
long long int a[2001];
long long int cnt = 0;
long long int cnt2 = 0;
long long int MOD = 1000000007;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = i + 1;... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
long long int a[2001];
long long int cnt = 0;
long long int cnt2 = 0;
long long int MOD = 1000000007;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = i + 1;... | [
"expression.operation.binary.remove",
"assignment.change"
] | 731,780 | 731,781 | u681005393 | cpp |
p02928 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_limit = (n); i < i##_limit; ++i)
#define FOR(i, a, b) for (int i = (a), i##_limit = (b); i < i##_limit; ++i)
#define pb push_back
#define mp make_pair
using namespace std;
using ll = long long;
using pi = pair<int, int>;
#define MOD 1000000007
ll modinv(l... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_limit = (n); i < i##_limit; ++i)
#define FOR(i, a, b) for (int i = (a), i##_limit = (b); i < i##_limit; ++i)
#define pb push_back
#define mp make_pair
using namespace std;
using ll = long long;
using pi = pair<int, int>;
#define MOD 1000000007
ll modinv(l... | [
"expression.operation.binary.remove"
] | 731,782 | 731,783 | u986334889 | cpp |
p02928 | #include <iostream>
#include <unordered_map>
using namespace std;
int A[2000];
int MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int t = 0;
for (int i = N - 1; i >= 0; --i) {
for (int j = 0; j < i; ++j) {
if (A[j] > A[j + 1]) {
... | #include <iostream>
#include <unordered_map>
using namespace std;
int A[2000];
int MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int t = 0;
for (int i = N - 1; i >= 0; --i) {
for (int j = 0; j < i; ++j) {
if (A[j] > A[j + 1]) {
... | [
"type_conversion.add"
] | 731,784 | 731,785 | u673928159 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000000 + 7;
int main(void) {
ll N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll c1;
ll c2;
ll count = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000000 + 7;
int main(void) {
ll N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll c1 = 0;
ll c2 = 0;
ll count = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {... | [
"variable_declaration.value.change"
] | 731,789 | 731,790 | u010725318 | cpp |
p02928 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
const int64_t R = 1e9 + 7;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
const int64_t R = 1e9 + 7;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i... | [
"expression.operation.binary.remove"
] | 731,796 | 731,797 | u395676079 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K;
long long int mod = 1e9 + 7;
cin >> N >> K;
long long int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
// cout << A[i] << endl;
}
long long int A1[N], A2[N];
for (int i = 0; i < N - 1; i++) {
long long int co... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K;
long long int mod = 1e9 + 7;
cin >> N >> K;
long long int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
// cout << A[i] << endl;
}
long long int A1[N], A2[N];
for (int i = 0; i < N - 1; i++) {
long long int co... | [] | 731,798 | 731,799 | u422506696 | cpp |
p02928 | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a... | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 731,804 | 731,805 | u103799157 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using int64 = int64_t;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using int64 = int64_t;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
d... | [
"call.add",
"call.arguments.change"
] | 731,806 | 731,807 | u160321725 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
int a[2010];
long long n, k;
long long ans;
long long js(long long k) {
if (k == 0)
return 0;
return ((((1 + k) % M) * (k % M) % M) / 2) % M;
}
int main() {
while (cin >> n >> k) {
memset(a, 0, sizeof(a));
for (int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
int a[2010];
long long n, k;
long long ans;
long long js(long long k) {
if (k == 0)
return 0;
return ((((1 + k) % M) * (k % M)) / 2) % M;
}
int main() {
while (cin >> n >> k) {
memset(a, 0, sizeof(a));
for (int i = 0; i < n; i+... | [
"expression.operation.binary.remove"
] | 731,808 | 731,809 | u397880990 | cpp |
p02928 | #include <bits/stdc++.h>
#define MAX_INT 2100000000
#define rep(i, n) for (i = 1; i <= (n); ++i)
using namespace std;
typedef long long int ll;
#ifdef COMPILE_IN_VCPP
#include <windows.h>
HWND GetConsoleHwnd(void) {
#define MY_BUFSIZE 1024 // Buffer size for console window titles.
HWND hwndFound; ... | #include <bits/stdc++.h>
#define MAX_INT 2100000000
#define rep(i, n) for (i = 1; i <= (n); ++i)
using namespace std;
typedef long long int ll;
#ifdef COMPILE_IN_VCPP
#include <windows.h>
HWND GetConsoleHwnd(void) {
#define MY_BUFSIZE 1024 // Buffer size for console window titles.
HWND hwndFound; ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.change",
"assignment.change"
] | 731,811 | 731,812 | u697367509 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
map<ll, ll> index;
for (int i = 0; i < n; ++i) {
cin >> a[i];
// count[a[i]]++;
}
vector<pair<ll, ll>>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
map<ll, ll> index;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<pair<ll, ll>> v(n), temp1(n);
vec... | [
"expression.operation.binary.remove"
] | 731,818 | 731,819 | u644164234 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
map<ll, ll> index;
for (int i = 0; i < n; ++i) {
cin >> a[i];
// count[a[i]]++;
}
vector<pair<ll, ll>>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
map<ll, ll> index;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<pair<ll, ll>> v(n), temp1(n);
vec... | [
"expression.operation.binary.change"
] | 731,820 | 731,819 | u644164234 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
map<ll, ll> index;
for (int i = 0; i < n; ++i) {
cin >> a[i];
// count[a[i]]++;
}
vector<pair<ll, ll>>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
map<ll, ll> index;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<pair<ll, ll>> v(n), temp1(n);
vec... | [
"expression.operation.binary.change"
] | 731,821 | 731,819 | u644164234 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
map<ll, ll> index;
for (int i = 0; i < n; ++i) {
cin >> a[i];
// count[a[i]]++;
}
// vector<pair<ll, l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
map<ll, ll> index;
for (int i = 0; i < n; ++i) {
cin >> a[i];
// count[a[i]]++;
}
// vector<pair<ll, l... | [
"expression.operation.binary.remove"
] | 731,822 | 731,823 | u644164234 | cpp |
p02928 | #include "bits/stdc++.h"
#define REP(i, n, N) for (ll i = (n); i < (N); i++)
#define RREP(i, n, N) for (ll i = (N - 1); i >= (n); i--)
#define LREP(lst, itr) for (auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a) <= (n) && (n) < (b))
#define ALL(v) (v).begin(), (v).end()
#define MCP(a, b) memcp... | #include "bits/stdc++.h"
#define REP(i, n, N) for (ll i = (n); i < (N); i++)
#define RREP(i, n, N) for (ll i = (N - 1); i >= (n); i--)
#define LREP(lst, itr) for (auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a) <= (n) && (n) < (b))
#define ALL(v) (v).begin(), (v).end()
#define MCP(a, b) memcp... | [
"call.add",
"call.arguments.change",
"function.return_value.change"
] | 731,824 | 731,825 | u379951749 | cpp |
p02928 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, _s, n) for (int i = _s, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
// vector
template <t... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, _s, n) for (int i = _s, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
// vector
template <t... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 731,830 | 731,831 | u743229067 | cpp |
p02928 | #include "bits/stdc++.h"
using namespace std;
// vector<long long> factors;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define _ << '\n'
#define __ << ' '
#define all(x) (x).begin(), (x).end()
#define gcd __gcd
int IT_MAX = 1 << 17;
int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const ll... | #include "bits/stdc++.h"
using namespace std;
// vector<long long> factors;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define _ << '\n'
#define __ << ' '
#define all(x) (x).begin(), (x).end()
#define gcd __gcd
int IT_MAX = 1 << 17;
int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const ll... | [] | 731,836 | 731,837 | u559507546 | cpp |
p02928 | #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... | [
"assignment.change"
] | 731,840 | 731,841 | u579875569 | cpp |
p02928 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++i)
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; -... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++i)
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; -... | [
"assignment.change"
] | 731,852 | 731,853 | u094718623 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
long long N, K;
long long a[2001];
long long sa[2001];
const int M = int(1e9) + 7;
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> a[i];
sa[i] = a[i];
}
//
sort(sa, sa + N);
//
long long ans = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
long long N, K;
long long a[2001];
long long sa[2001];
const int M = int(1e9) + 7;
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> a[i];
sa[i] = a[i];
}
//
sort(sa, sa + N);
//
long long ans = 0;
for (int i = 0; i < N; i++) {
... | [
"assignment.change"
] | 731,856 | 731,857 | u206133536 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N + 10);
for (int i = 0; i < N; i++)
cin >> A[i];
ll ans = 0;
for (int i = 0; i < N; i++) {
ll cnt = 0, cnt2 = 0;
for (int j = 0; j < N; j++) {
if (A[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N + 10);
for (int i = 0; i < N; i++)
cin >> A[i];
ll ans = 0;
for (int i = 0; i < N; i++) {
ll cnt = 0, cnt2 = 0;
for (int j = 0; j < N; j++) {
if (A[... | [
"expression.operation.binary.remove"
] | 731,860 | 731,861 | u302870145 | cpp |
p02928 | //
// main.cpp
// upgranet
//
// Created by Dong Truong on 7/5/19.
// Copyright © 2019 Dong Truong. All rights reserved.
//
#include <algorithm>
#include <fstream>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define maxn 1000005
#define gh 1005
#define long long... | //
// main.cpp
// upgranet
//
// Created by Dong Truong on 7/5/19.
// Copyright © 2019 Dong Truong. All rights reserved.
//
#include <algorithm>
#include <fstream>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define maxn 1000005
#define gh 1005
#define long long... | [
"expression.operation.binary.remove"
] | 731,862 | 731,863 | u224557577 | cpp |
p02928 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/rope"
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef pair<int, ... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/rope"
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef pair<int, ... | [] | 731,864 | 731,865 | u712630284 | cpp |
p02928 | #define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [] | 731,868 | 731,869 | u734321328 | cpp |
p02928 | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> cnt_a(n, 0), cnt_s(n, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i] > a... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> cnt_a(n, 0), cnt_s(n, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i] > a... | [] | 731,878 | 731,879 | u185690073 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define let auto const
int main() {
i64 N, K;
cin >> N >> K;
vector<i64> A(N);
rep(i, 0, N) cin >> A[i];
i64 mod = 1e9 + 7;
i64 AA = 0;
map<i64,... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define let auto const
int main() {
i64 N, K;
cin >> N >> K;
vector<i64> A(N);
rep(i, 0, N) cin >> A[i];
i64 mod = 1e9 + 7;
i64 AA = 0;
map<i64,... | [
"identifier.change",
"expression.operation.binary.change"
] | 731,882 | 731,883 | u852585808 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define mod 1000000007
int main() {
ll N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
vector<ll> v1(N, 0);
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
if (A[i] > A[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define mod 1000000007
int main() {
ll N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
vector<ll> v1(N, 0);
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
if (A[i] > A[... | [
"assignment.add"
] | 731,884 | 731,885 | u590088474 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define endl "\n"
const ll INF = 1e15;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
const double PI = acos(-1.0);
const int N = 2005;
ll n, k, a[N];
int main() {
ios::sync_with_stdio(f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define endl "\n"
const ll INF = 1e15;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
const double PI = acos(-1.0);
const int N = 2005;
ll n, k, a[N];
int main() {
ios::sync_with_stdio(f... | [
"call.arguments.change"
] | 731,886 | 731,887 | u824402098 | cpp |
p02928 | // B - Kleene Inversion
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main(int argc, char *argv[]) {
long long n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<long long> c(n), d(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j ... | // B - Kleene Inversion
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main(int argc, char *argv[]) {
long long n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<long long> c(n), d(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j ... | [
"assignment.change"
] | 731,895 | 731,896 | u839953699 | cpp |
p02928 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? ... | [
"expression.operation.binary.remove"
] | 731,899 | 731,900 | u824905100 | cpp |
p02928 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | [
"assignment.change"
] | 731,901 | 731,902 | u896838289 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long N, K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<pair<long long, long long>> num(N);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long N, K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<pair<long long, long long>> num(N);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
... | [
"assignment.change"
] | 731,907 | 731,908 | u372299304 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
int T;
const int maxN = 2e3 + 8;
const ll INF = 1e15 + 7;
const int MOD = 1e9 + 7;
int n;
int k;
int a[maxN];
int main() {
int n, k;
scanf("%d %d", &n, &k);
ll cn... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
int T;
const int maxN = 2e3 + 8;
const ll INF = 1e15 + 7;
const int MOD = 1e9 + 7;
int n;
int k;
int a[maxN];
int main() {
int n, k;
scanf("%d %d", &n, &k);
ll cn... | [
"assignment.change"
] | 731,909 | 731,910 | u807919574 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, k, n) for (int i = k; i <= n; ++i)
#define REPR(i, k, n) for (int i = k; i >= n; --i)
#define pb push_back
#define F first
#define S second
#define I insert
#define mp make_pair
#define sz(a)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, k, n) for (int i = k; i <= n; ++i)
#define REPR(i, k, n) for (int i = k; i >= n; --i)
#define pb push_back
#define F first
#define S second
#define I insert
#define mp make_pair
#define sz(a)... | [] | 731,918 | 731,919 | u680850076 | cpp |
p02928 | #include <bits/stdc++.h>
#define MSET(x, y) memset(x, y, sizeof(x))
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 100005
#define ll long long
#define ld long double
#define INF 1e18
#define endl "\n"
#define fastio ... | #include <bits/stdc++.h>
#define MSET(x, y) memset(x, y, sizeof(x))
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 100005
#define ll long long
#define ld long double
#define INF 1e18
#define endl "\n"
#define fastio ... | [] | 731,924 | 731,925 | u053638061 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
ll k;
cin >> n >> k;
vector<ll> v(n), cnt(n, 0), cn(n, 0);
for (ll i = 0; i < n; i++)
cin >> v[i];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < n; j++) {
if (v[i] > v[j]) {
cn[i]++;
if (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
ll k;
cin >> n >> k;
vector<ll> v(n), cnt(n, 0), cn(n, 0);
for (ll i = 0; i < n; i++)
cin >> v[i];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < n; j++) {
if (v[i] > v[j]) {
cn[i]++;
if (i... | [] | 731,929 | 731,930 | u664207511 | cpp |
p02928 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unor... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unor... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 731,931 | 731,932 | u224756887 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define se second
#define pi 2 * acos(0)
#define PI 3.14159265358979323846264338
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 100010;
c... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define se second
#define pi 2 * acos(0)
#define PI 3.14159265358979323846264338
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 100010;
c... | [
"assignment.add"
] | 731,933 | 731,934 | u487769730 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll ... | [
"assignment.change"
] | 731,935 | 731,936 | u561186440 | cpp |
p02928 | #include <iostream>
using namespace std;
const int max_n = (2e3) + 5;
const long long mod = (1e9) + 7;
int n, k;
int a[max_n];
int geng[max_n] = {0}, eg[max_n] = {0};
long long inv = 0;
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i) {
for (int j = 0; j... | #include <iostream>
using namespace std;
const int max_n = (2e3) + 5;
const long long mod = (1e9) + 7;
int n, k;
int a[max_n];
int geng[max_n] = {0}, eg[max_n] = {0};
long long inv = 0;
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i) {
for (int j = 0; j... | [] | 731,937 | 731,938 | u743294402 | cpp |
p02928 | #include <cstdio>
#define Int register int
const int N = 2000, mod = 1e9 + 7;
typedef long long LL;
static inline char Get_Char() {
static char buffer[100000], *S = buffer, *T = buffer;
if (S == T) {
T = (S = buffer) + fread(buffer, 1, 100000, stdin);
if (S == T)
return EOF;
}
return *S++;
}
//#... | #include <cstdio>
#define Int register int
const int N = 2000, mod = 1e9 + 7;
typedef long long LL;
static inline char Get_Char() {
static char buffer[100000], *S = buffer, *T = buffer;
if (S == T) {
T = (S = buffer) + fread(buffer, 1, 100000, stdin);
if (S == T)
return EOF;
}
return *S++;
}
//#... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 731,943 | 731,944 | u067894715 | cpp |
p02928 | #include <bits/stdc++.h>
namespace shl {
typedef long long ll;
const ll mod = 1e9 + 7;
inline ll read() {
ll ret = 0, op = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')
op = -1;
c = getchar();
}
while (isdigit(c)) {
ret = (ret << 3) + (ret << 1) + c - '0';
c = getchar();
}... | #include <bits/stdc++.h>
namespace shl {
typedef long long ll;
const ll mod = 1e9 + 7;
inline ll read() {
ll ret = 0, op = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')
op = -1;
c = getchar();
}
while (isdigit(c)) {
ret = (ret << 3) + (ret << 1) + c - '0';
c = getchar();
}... | [
"assignment.change"
] | 731,945 | 731,946 | u419192203 | cpp |
p02928 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define x first
#define y second
#define all(aaa) (aaa).begin(), (aaa).end()
#define REP(i, sss, eee) for (int i = sss; i <= eee; ++i)
#define pb push_back
#define pii pair<int, int>
#define vi v... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define x first
#define y second
#define all(aaa) (aaa).begin(), (aaa).end()
#define REP(i, sss, eee) for (int i = sss; i <= eee; ++i)
#define pb push_back
#define pii pair<int, int>
#define vi v... | [] | 731,951 | 731,952 | u930089439 | cpp |
p02928 | #include <bits/stdc++.h>
#define int long long
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define leng(n) (int)(log10(n) + 1)
#define INF 9000000000000000000
using namespace std;
in... | #include <bits/stdc++.h>
#define int long long
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define leng(n) (int)(log10(n) + 1)
#define INF 9000000000000000000
using namespace std;
in... | [] | 731,953 | 731,954 | u095453583 | cpp |
p02928 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<int> incnt(n, 0);
vector<int> outcnt(n, 0);
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<int> incnt(n, 0);
vector<int> outcnt(n, 0);
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j ... | [
"assignment.change"
] | 731,962 | 731,963 | u698760125 | cpp |
p02928 | #include <algorithm>
#include <chrono>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>... | #include <algorithm>
#include <chrono>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>... | [
"literal.string.change",
"call.arguments.change"
] | 731,964 | 731,965 | u394853232 | cpp |
p02928 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define EPS (1e-7)
#define INF (3e9)
using namespace std;
typedef long long int ll;
typedef... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define EPS (1e-7)
#define INF (3e9)
using namespace std;
typedef long long int ll;
typedef... | [
"assignment.change"
] | 731,968 | 731,969 | u097408484 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int s[2005];
long long modd = 1e9 + 7;
long long num1[2005];
long long num2[2005];
typedef long long ll;
ll qpow(ll a, ll n) //计算a^n % mod
{
ll re = 1;
while (n) {
if (n & 1) //判断n的最后一位是否为1
re = (re * a) % modd;
n >>= 1; //舍去n的最后一位
a = (a... | #include <bits/stdc++.h>
using namespace std;
int s[2005];
long long modd = 1e9 + 7;
long long num1[2005];
long long num2[2005];
typedef long long ll;
ll qpow(ll a, ll n) //计算a^n % mod
{
ll re = 1;
while (n) {
if (n & 1) //判断n的最后一位是否为1
re = (re * a) % modd;
n >>= 1; //舍去n的最后一位
a = (a... | [
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 731,974 | 731,975 | u428618452 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int s[2005];
long long modd = 1e9 + 7;
long long num1[2005];
long long num2[2005];
typedef long long ll;
ll qpow(ll a, ll n) //计算a^n % mod
{
ll re = 1;
while (n) {
if (n & 1) //判断n的最后一位是否为1
re = (re * a) % modd;
n >>= 1; //舍去n的最后一位
a = (a... | #include <bits/stdc++.h>
using namespace std;
int s[2005];
long long modd = 1e9 + 7;
long long num1[2005];
long long num2[2005];
typedef long long ll;
ll qpow(ll a, ll n) //计算a^n % mod
{
ll re = 1;
while (n) {
if (n & 1) //判断n的最后一位是否为1
re = (re * a) % modd;
n >>= 1; //舍去n的最后一位
a = (a... | [
"assignment.change"
] | 731,976 | 731,977 | u428618452 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define mm (1e16)
ll Mod = (1e9 + 7);
int main() {
ios::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define mm (1e16)
ll Mod = (1e9 + 7);
int main() {
ios::sync_with_stdi... | [] | 731,980 | 731,981 | u158165654 | cpp |
p02928 | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | [] | 731,982 | 731,983 | u578751202 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // p... | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // p... | [
"assignment.change"
] | 731,984 | 731,985 | u933068010 | cpp |
p02928 | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stri... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stri... | [
"assignment.change"
] | 731,988 | 731,989 | u633284019 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long mod = 1e9 + 7;
long long N, K;
cin >> N >> K;
vector<int> A(N);
for (auto &a : A)
cin >> a;
long long ans = 0;
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
ans += (A[i] ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long mod = 1e9 + 7;
long long N, K;
cin >> N >> K;
vector<int> A(N);
for (auto &a : A)
cin >> a;
long long ans = 0;
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
ans += (A[i] ... | [
"assignment.add"
] | 731,990 | 731,991 | u107077660 | cpp |
p02928 | #include <iostream>
#include <vector>
using namespace std;
const long mod = int(1e9) + 7;
int main() {
long n, k;
cin >> n >> k;
vector<long> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<long> rtent(n), tent(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i] > ... | #include <iostream>
#include <vector>
using namespace std;
const long mod = int(1e9) + 7;
int main() {
long n, k;
cin >> n >> k;
vector<long> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<long> rtent(n), tent(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i] > ... | [] | 731,992 | 731,993 | u809153881 | cpp |
p02928 | #include <bits/stdc++.h>
#define CEIL(a, b) ((a) / (b) + ((a) % (b) == 0 ? 0 : 1))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'000'000'001;
constexpr ll LLINF = 4'000'000'000'000'000'001;
// constexpr int INF = 2147483647; // 2 * 1e9... | #include <bits/stdc++.h>
#define CEIL(a, b) ((a) / (b) + ((a) % (b) == 0 ? 0 : 1))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'000'000'001;
constexpr ll LLINF = 4'000'000'000'000'000'001;
// constexpr int INF = 2147483647; // 2 * 1e9... | [
"assignment.change"
] | 731,994 | 731,995 | u993640894 | cpp |
p02928 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD (int)(1e9 + 7)
int main() {
ll N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<ll> cnt(N... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD (int)(1e9 + 7)
int main() {
ll N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<ll> cnt(N... | [] | 731,996 | 731,997 | u265881782 | cpp |
p02928 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG ce... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG ce... | [
"assignment.change"
] | 731,998 | 731,999 | u905715926 | cpp |
p02928 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF (1 << 29)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pa... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF (1 << 29)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pa... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 732,000 | 732,001 | u299869545 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define fi first
#define sec second
typedef long long ll;
typedef long double ld;
#define pii pair<ll, ll>
#define vi vector<ll>
#define vvi vector<vi>
#define vpi vector<pii>
#define vvpi vector<vpi>
#define ... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define fi first
#define sec second
typedef long long ll;
typedef long double ld;
#define pii pair<ll, ll>
#define vi vector<ll>
#define vvi vector<vi>
#define vpi vector<pii>
#define vvpi vector<vpi>
#define ... | [
"assignment.add"
] | 732,008 | 732,009 | u232189905 | cpp |
p02928 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
int a[30000];
int main() {
ll n, K;
cin >> n >> K;
rep(i, n) scanf("%d", &a[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
int a[30000];
int main() {
ll n, K;
cin >> n >> K;
rep(i, n) scanf("%d", &a[i]... | [
"assignment.change"
] | 732,014 | 732,015 | u781091740 | cpp |
p02928 | #include <bits/stdc++.h>
#define MOD 1000000007
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int k = ri();
int a[n];
for (int i = 0; i < n; i++)
a[i] = ri();
int64_t res = 0;
for (int i = 0; i < n; i++) {
int every = 0;
int cur = 0;
for (int j = 0; j < n;... | #include <bits/stdc++.h>
#define MOD 1000000007
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int k = ri();
int a[n];
for (int i = 0; i < n; i++)
a[i] = ri();
int64_t res = 0;
for (int i = 0; i < n; i++) {
int every = 0;
int cur = 0;
for (int j = 0; j < n;... | [
"assignment.change"
] | 732,016 | 732,017 | u040490988 | cpp |
p02929 | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 101010
#define DEBUG_OUT true
#define ALL(x) (x)... | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 101010
#define DEBUG_OUT true
#define ALL(x) (x)... | [
"call.remove"
] | 732,038 | 732,039 | u221285045 | cpp |
p02929 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i, n) for (int i = (int)(n); i > 0; --i)
#define all(f, x, ...) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i, n) for (int i = (int)(n); i > 0; --i)
#define all(f, x, ...) ... | [
"control_flow.return.add"
] | 732,042 | 732,043 | u640248738 | cpp |
p02929 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
template <int MOD> class Modular {
private:
long long value;
public:
constexpr Modular() : value(){};
constexpr Modular(const Modular &other) : value(other.value) {}
template <typename U> constexpr Modular(const U &x) { value = normalize(x... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
template <int MOD> class Modular {
private:
long long value;
public:
constexpr Modular() : value(){};
constexpr Modular(const Modular &other) : value(other.value) {}
template <typename U> constexpr Modular(const U &x) { value = normalize(x... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 732,044 | 732,045 | u817760251 | cpp |
p02929 | #include <bits/stdc++.h>
using namespace std;
#define next Next
#define last Last
#define int long long
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
/*char buf[1<<21],*p1=buf,*p2=buf;
inline int gc(){return
p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;}*/
#define gc getchar
inline int read() {
i... | #include <bits/stdc++.h>
using namespace std;
#define next Next
#define last Last
#define int long long
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
/*char buf[1<<21],*p1=buf,*p2=buf;
inline int gc(){return
p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;}*/
#define gc getchar
inline int read() {
i... | [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 732,046 | 732,047 | u447610671 | cpp |
p02929 | // Written By NewbieChd
#include <cstdio>
using namespace std;
const int maxN = 2000003, mod = 1e9 + 7;
char s[maxN];
int main() {
int n, i, ans = 1, tmp = 1;
bool dir = 1;
scanf("%d%s", &n, s + 1);
if (s[1] != 'B') {
printf("0\n");
return 0;
}
for (i = 1; i <= n; ++i)
ans = 1ll * ans * i % mo... | // Written By NewbieChd
#include <cstdio>
using namespace std;
const int maxN = 2000003, mod = 1e9 + 7;
char s[maxN];
int main() {
int n, i, ans = 1, tmp = 1;
bool dir = 1;
scanf("%d%s", &n, s + 1);
if (s[1] != 'B') {
printf("0\n");
return 0;
}
for (i = 1; i <= n; ++i)
ans = 1ll * ans * i % mo... | [] | 732,048 | 732,049 | u305668100 | cpp |
p02929 | #include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << (x) << endl
using namespace std;
const int N = 100005;
const long long mod = 1000000007ll;
int n, now = 0, seq[N << 1];
char str[N << 1];
long long ans = 1ll;
int main() {
scanf("%d", &n);
scanf("%s", str);
for (int i = 1; i <= (n << 1); i++)
seq[... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << (x) << endl
using namespace std;
const int N = 100005;
const long long mod = 1000000007ll;
int n, now = 0, seq[N << 1];
char str[N << 1];
long long ans = 1ll;
int main() {
scanf("%d", &n);
scanf("%s", str);
for (int i = 1; i <= (n << 1); i++)
seq[... | [] | 732,062 | 732,063 | u198204105 | cpp |
p02929 | #include <cstdio>
#include <iostream>
#define mod 1000000007
using namespace std;
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f... | #include <cstdio>
#include <iostream>
#define mod 1000000007
using namespace std;
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f... | [] | 732,078 | 732,079 | u547532427 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.