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 "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... | [
"expression.operation.binary.remove",
"assignment.change"
] | 731,030 | 731,029 | u048791623 | cpp |
p02928 | #include <cstdio>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int N, A[2000];
ll K;
int main() {
scanf("%d %ld", &N, &K);
for (int i = 0; i < N; ++i)
scanf("%d", &A[i]);
ll localT = 0LL, localL = 0LL;
for (int l = 0; l < N - 1; ++l) {
for (int r = l; r < N; ++r) {
if (A[l] >... | #include <cstdio>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int N, A[2000];
ll K;
int main() {
scanf("%d %ld", &N, &K);
for (int i = 0; i < N; ++i)
scanf("%d", &A[i]);
ll localT = 0LL, localL = 0LL;
for (int l = 0; l < N - 1; ++l) {
for (int r = l; r < N; ++r) {
if (A[l] >... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 731,033 | 731,034 | u923285281 | cpp |
p02928 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, be... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, be... | [
"assignment.change"
] | 731,037 | 731,038 | u899220667 | cpp |
p02928 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, be... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, be... | [
"assignment.change"
] | 731,039 | 731,040 | u899220667 | cpp |
p02928 | #include <bits/stdc++.h>
#define sort_(a) sort(a.begin(), a.end())
#define rsort(a) sort(a.rbegin(), a.rend())
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; 0 <= i; i--)
#define for_(i, start, end) for (int i = start; i < end; i++)
#define rfor(i, start, end) for (int i = start - ... | #include <bits/stdc++.h>
#define sort_(a) sort(a.begin(), a.end())
#define rsort(a) sort(a.rbegin(), a.rend())
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; 0 <= i; i--)
#define for_(i, start, end) for (int i = start; i < end; i++)
#define rfor(i, start, end) for (int i = start - ... | [
"variable_declaration.type.change"
] | 731,043 | 731,044 | u324303263 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
const long long MOD = 1000000007;
void solve(long long N, long long K, std::vector<long long... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
const long long MOD = 1000000007;
void solve(long long N, long long K, std::vector<long long... | [] | 731,045 | 731,046 | u131340563 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, t, n) for (ll i = t; i <= (ll)n; ++i)
struct edge {
int from, to;
ll cost;
};
class Eratosthenes {
public:
vector<bool> prime;
Eratosthenes(ll size) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, t, n) for (ll i = t; i <= (ll)n; ++i)
struct edge {
int from, to;
ll cost;
};
class Eratosthenes {
public:
vector<bool> prime;
Eratosthenes(ll size) {
... | [
"assignment.change"
] | 731,049 | 731,050 | u181806820 | cpp |
p02928 | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
const LL mod = 1000000007;
int main() {
LL N, K;
in >> N >> K;
std::vector<LL> A(N);
rep(i, N) in >> A[i];
LL ans = 0;
rep(i, N) {
rep(j, N) {
if (A[i] > A[j... | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
const LL mod = 1000000007;
int main() {
LL N, K;
in >> N >> K;
std::vector<LL> A(N);
rep(i, N) in >> A[i];
LL ans = 0;
rep(i, N) {
rep(j, N) {
if (A[i] > A[j... | [
"expression.operation.binary.remove"
] | 731,056 | 731,057 | u660613376 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a;
ll tmp;
for (int i = 0; i < n; i++) {
cin >> tmp;
a.push_back(tmp);
}
ll tentou = 0;
ll ans = 0;
bool first = false;
ll sumtentou = 0;
for (int i = 0; i < n; i++) {
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a;
ll tmp;
for (int i = 0; i < n; i++) {
cin >> tmp;
a.push_back(tmp);
}
ll tentou = 0;
ll ans = 0;
bool first = false;
ll sumtentou = 0;
for (int i = 0; i < n; i++) {
f... | [
"expression.operation.binary.add"
] | 731,058 | 731,059 | u091552241 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define rep(j, n) for (int i = (int)(j); i < (int)(n); i++)
#define int int64_t
signed main() {
int ans = 0;
int N, K;
cin >> N >> K;
int X = (K - 1) * K / 2;
vector<int> A(N);
rep(0, N) cin >> A[i];
rep(0, N) {
int count = 0, sum = 0;
for (int j = 0; ... | #include <bits/stdc++.h>
using namespace std;
#define rep(j, n) for (int i = (int)(j); i < (int)(n); i++)
#define int int64_t
signed main() {
int ans = 0;
int N, K;
cin >> N >> K;
int X = (K - 1) * K / 2;
X %= 1000000007;
vector<int> A(N);
rep(0, N) cin >> A[i];
rep(0, N) {
int count = 0, sum = 0;
... | [
"assignment.add"
] | 731,060 | 731,061 | u347057617 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001 // int32_t
#define MOD 1000000007
#define MOD2 998244353
#define all(a) (a).begin(), (a).end()
#define mkp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int mmul(int p, int q, int m) {... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001 // int32_t
#define MOD 1000000007
#define MOD2 998244353
#define all(a) (a).begin(), (a).end()
#define mkp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int mmul(int p, int q, int m) {... | [
"assignment.add"
] | 731,064 | 731,065 | u355424600 | cpp |
p02928 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
void prime(vector<int> &num, int n) {
for (int i = 0; i <= n; i++) ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
void prime(vector<int> &num, int n) {
for (int i = 0; i <= n; i++) ... | [] | 731,066 | 731,067 | u939401127 | cpp |
p02928 | #include <algorithm>
#include <array>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <unordered_map>
#include <utility>
... | #include <algorithm>
#include <array>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <unordered_map>
#include <utility>
... | [] | 731,074 | 731,075 | u324139341 | cpp |
p02928 | #include <algorithm>
#include <iostream>
using namespace std;
#define int long long
#define mod 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < n; i++)
int n, k, a[3000], cnt = 0, s = 0;
signed main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
rep(i, n) {
for (int j = i + 1; j < n; j++) {
if (a[... | #include <algorithm>
#include <iostream>
using namespace std;
#define int long long
#define mod 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < n; i++)
int n, k, a[3000], cnt = 0, s = 0;
signed main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
rep(i, n) {
for (int j = i + 1; j < n; j++) {
if (a[... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 731,076 | 731,077 | u988961969 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int a[2010];
int main() {
long long res = 0;
int n;
long long k;
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; j < n; j++) {
if (a[i] > a[j]) {
l... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int a[2010];
int main() {
long long res = 0;
int n;
long long k;
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; j < n; j++) {
if (a[i] > a[j]) {
l... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change",
"expression.operation.unary.arithmetic.remove"
] | 731,078 | 731,079 | u871472869 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[2005];
ll B[2005];
ll C[2005];
int ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[2005];
ll B[2005];
ll C[2005];
int ma... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 731,080 | 731,081 | u340980616 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long mod = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
long long ans = 0;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
lo... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long mod = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long N, K;
cin >> N >> K;
long long ans = 0;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
l... | [
"variable_declaration.type.primitive.change"
] | 731,086 | 731,087 | u013803727 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
const ll INF = 1 << LLONG_MAX;
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll N, K;
cin >> N >> K;
vector<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
const ll INF = 1 << LLONG_MAX;
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll N, K;
cin >> N >> K;
vector<... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 731,088 | 731,089 | u946090308 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
const ll INF = 1 << LLONG_MAX;
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll N, K;
cin >> N >> K;
vector<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
const ll INF = 1 << LLONG_MAX;
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll N, K;
cin >> N >> K;
vector<... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 731,090 | 731,089 | u946090308 | cpp |
p02928 | #include <algorithm> //STLͨ���㷨
#include <cmath> //������ѧ����
#include <cstdio> //��������/�������
#include <cstring> //�ַ�������
#include <ctime> //�������ʱ��ĺ���
#include <iostream> //����������/���
#include <string> //�ַ�����
#define itn int
#define fro for
#define ll long long
#define reg register... | #include <algorithm> //STLͨ���㷨
#include <cmath> //������ѧ����
#include <cstdio> //��������/�������
#include <cstring> //�ַ�������
#include <ctime> //�������ʱ��ĺ���
#include <iostream> //����������/���
#include <string> //�ַ�����
#define itn int
#define fro for
#define ll long long
#define reg register... | [
"expression.operation.binary.remove"
] | 731,094 | 731,095 | u794315108 | cpp |
p02928 | #include <bits/stdc++.h>
#define int long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define IOS \
cin.tie(0); \
ios::sync_with_stdio(false)
const int INF = 1e9... | #include <bits/stdc++.h>
#define int long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define IOS \
cin.tie(0); \
ios::sync_with_stdio(false)
const int INF = 1e9... | [
"expression.operation.binary.remove"
] | 731,099 | 731,100 | u526894223 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000000 + 7;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
ll res = 0;
ll m = 0;
ll s = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000000 + 7;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
ll res = 0;
ll m = 0;
ll s = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if... | [
"expression.operation.binary.add"
] | 731,103 | 731,104 | u652009496 | cpp |
p02928 | #include <cassert>
// PXjUXeZStdX
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#inc... | #include <cassert>
// PXjUXeZStdX
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#inc... | [] | 731,114 | 731,115 | u159757494 | cpp |
p02928 | #include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll modpow(ll a, ll b, ll p = 1e9 + 7) {
if (b == 0)
return 1;
if (b % 2 == 0) {
ll d = modpow(a, b / 2, p);
return (d * d) % p;
} else {
return (a % p * modpow(a, b - 1, p)) %... | #include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll modpow(ll a, ll b, ll p = 1e9 + 7) {
if (b == 0)
return 1;
if (b % 2 == 0) {
ll d = modpow(a, b / 2, p);
return (d * d) % p;
} else {
return (a % p * modpow(a, b - 1, p)) %... | [
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 731,116 | 731,117 | u734519000 | cpp |
p02928 | #include <cstdio>
#include <iostream>
using namespace std;
#define MOD 1000000007
int main() {
int n, k;
scanf("%d%d", &n, &k);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
... | #include <cstdio>
#include <iostream>
using namespace std;
#define MOD 1000000007
int main() {
long long n, k;
scanf("%lld%lld", &n, &k);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
long long ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change"
] | 731,129 | 731,130 | u765857778 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
long long mod = 1e9 + 7;
long long ans = 0, tmp = 0, tmp2 = 0, tmp3;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
long long mod = 1e9 + 7;
long long ans = 0, tmp = 0, tmp2 = 0, tmp3;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
if (... | [
"expression.operation.binary.remove"
] | 731,134 | 731,135 | u074306398 | cpp |
p02928 | #include <iostream>
using namespace std;
using ll = long long;
const ll mod = (1e9) + 7;
ll n, k;
ll a[2005];
ll ans;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
ll cnt = 0;
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
... | #include <iostream>
using namespace std;
using ll = long long;
const ll mod = (1e9) + 7;
ll n, k;
ll a[2005];
ll ans;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
ll cnt = 0;
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
... | [
"assignment.change"
] | 731,141 | 731,142 | u683588090 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define bFOR(i, n1, n2) for (ll i = n1; i >= n2; i--)
#define speed_up ... | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define bFOR(i, n1, n2) for (ll i = n1; i >= n2; i--)
#define speed_up ... | [] | 731,150 | 731,151 | u055303078 | cpp |
p02928 | /*
░░░░░░░░░░░░░░░░▄▄█▀▀██▄▄░░░░░░░
░░░░░░░░░░░░░▄█▀▀░░░░░░░▀█░░░░░░
░░░░░░░░░░░▄▀░░░░░░░░░░░░░█░░░░░
░░░░░░░░░▄█░░░░░░░░░░░░░░░█░░░░░
░░░░░░░██▀░░░░░░░▄▄▄░░▄░█▄█▄░░░░
░░░░░▄▀░░░░░░░░░░████░█▄██░▀▄░░░
░░░░█▀░░░░░░░░▄▄██▀░░█████░██░░░
░░░█▀░░░░░░░░░▀█░▀█▀█▀▀▄██▄█▀░░░
░░░██░░░░░░░░░░█░░█░█░░▀▀▄█▀░░░░
░░░░█░░░░░█░░░▀█░░░░... | /*
░░░░░░░░░░░░░░░░▄▄█▀▀██▄▄░░░░░░░
░░░░░░░░░░░░░▄█▀▀░░░░░░░▀█░░░░░░
░░░░░░░░░░░▄▀░░░░░░░░░░░░░█░░░░░
░░░░░░░░░▄█░░░░░░░░░░░░░░░█░░░░░
░░░░░░░██▀░░░░░░░▄▄▄░░▄░█▄█▄░░░░
░░░░░▄▀░░░░░░░░░░████░█▄██░▀▄░░░
░░░░█▀░░░░░░░░▄▄██▀░░█████░██░░░
░░░█▀░░░░░░░░░▀█░▀█▀█▀▀▄██▄█▀░░░
░░░██░░░░░░░░░░█░░█░█░░▀▀▄█▀░░░░
░░░░█░░░░░█░░░▀█░░░░... | [
"assignment.value.change",
"assignment.add"
] | 731,152 | 731,153 | u392848063 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
const ll mod = 1000000007;
/*ll fast_mul(ll x,ll y)
{
ll temp=x*y-(ll)((long double)x*y/mod+1.0e-8)*mod;
return temp<0?temp+mod:temp;
}*/
ll fast_mul(ll x, ll y) {
ll temp = (x * y - (ll)((long double)x * y / mod + mod)... | #include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
const ll mod = 1000000007;
/*ll fast_mul(ll x,ll y)
{
ll temp=x*y-(ll)((long double)x*y/mod+1.0e-8)*mod;
return temp<0?temp+mod:temp;
}*/
ll fast_mul(ll x, ll y) {
ll temp = (x * y - (ll)((long double)x * y / mod) * mod... | [
"expression.operation.binary.remove"
] | 731,156 | 731,157 | u086925634 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n;
int indegree[N * N];
vector<int> g[N * N];
int toint(int x, int y) {
if (x > y)
swap(x, y);
return n * x + y;
}
pair<int, int> demap(int x) { return {x / n, x % n}; }
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n;
int indegree[N * N];
vector<int> g[N * N];
int toint(int x, int y) {
if (x > y)
swap(x, y);
return n * x + y;
}
pair<int, int> demap(int x) { return {x / n, x % n}; }
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
... | [
"call.arguments.change"
] | 731,165 | 731,166 | u153798346 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n;
int indegree[N];
vector<int> g[N * N];
int toint(int x, int y) {
if (x > y)
swap(x, y);
return n * x + y;
}
pair<int, int> demap(int x) { return {x / n, x % n}; }
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int... | #include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n;
int indegree[N * N];
vector<int> g[N * N];
int toint(int x, int y) {
if (x > y)
swap(x, y);
return n * x + y;
}
pair<int, int> demap(int x) { return {x / n, x % n}; }
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
... | [
"call.arguments.change"
] | 731,167 | 731,166 | u153798346 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 1e9 + 555;
const int maxN = 1000 + 9;
int n;
int a[maxN][maxN], idx[maxN];
bool mrk[maxN];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 1e9 + 555;
const int maxN = 1000 + 9;
int n;
int a[maxN][maxN], idx[maxN];
bool mrk[maxN];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 731,172 | 731,173 | u482794458 | cpp |
p02925 | #include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define pb push_back
using namespace std;
const int N = 1005;
void fast() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int n, a[N][N];
qu... | #include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define pb push_back
using namespace std;
const int N = 1005;
void fast() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int n, a[N][N];
qu... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 731,174 | 731,175 | u785897267 | cpp |
p02925 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto &(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto &(... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 731,182 | 731,183 | u708550576 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | [
"assignment.value.change",
"identifier.change"
] | 731,193 | 731,194 | u568652083 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
main() {
int n;
scanf("%d", &n);
int a[n][n - 1], b[n][n], vn = 0;
rep(i, n) rep(j, n - 1) {
scanf("%d", &a[i][j]);
a[i][j]--;
}
rep(i, n) {
for (int j = i; j < n; ++j) {
b[i][j] = b[j][i] = vn;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
main() {
int n;
scanf("%d", &n);
int a[n][n - 1], b[n][n], vn = 0;
rep(i, n) rep(j, n - 1) {
scanf("%d", &a[i][j]);
a[i][j]--;
}
rep(i, n) {
for (int j = i; j < n; ++j) {
b[i][j] = b[j][i] = vn;... | [
"expression.operation.binary.remove"
] | 731,197 | 731,198 | u423624748 | cpp |
p02925 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (i... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (i... | [
"io.output.change",
"expression.operation.binary.remove"
] | 731,216 | 731,217 | u314008046 | cpp |
p02925 | #include <algorithm>
#include <array>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int mix_id(int l, int r) {
if (l > r) {
swap(l, r);
}
return l * 1000 + r;
}
bool has_cycle(const vector<vector<int>> &nodes, int id,
unordered_s... | #include <algorithm>
#include <array>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int mix_id(int l, int r) {
if (l > r) {
swap(l, r);
}
return l * 1000 + r;
}
bool has_cycle(const vector<vector<int>> &nodes, int id,
unordered_s... | [
"expression.operation.binary.add"
] | 731,243 | 731,244 | u184819501 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin... | [] | 731,265 | 731,266 | u475972508 | cpp |
p02925 | #include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <un... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <un... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 731,267 | 731,268 | u096453658 | cpp |
p02925 | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define ACC(c) (accumulate(ALL(c), 0LL))
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pint = pair<int, ... | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define ACC(c) (accumulate(ALL(c), 0LL))
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pint = pair<int, ... | [
"call.arguments.change"
] | 731,295 | 731,296 | u569690172 | cpp |
p02925 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MAXN = 1005;
const int MAXV = MAXN * (MAXN - 1) / 2;
vector<int> to[MAXV];
int id[MAXN][MAXN];
int toId(int i, int j) {
if (i > j)
swap(i, j);
return id[i][j];
}
bool visited[MAXV];
bo... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MAXN = 1005;
const int MAXV = MAXN * (MAXN - 1) / 2;
vector<int> to[MAXV];
int id[MAXN][MAXN];
int toId(int i, int j) {
if (i > j)
swap(i, j);
return id[i][j];
}
bool visited[MAXV];
bo... | [
"literal.number.change",
"assignment.value.change"
] | 731,299 | 731,300 | u457283867 | cpp |
p02925 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MAXN = 1005;
const int MAXV = MAXN * (MAXN - 1) / 2;
vector<int> to[MAXV];
int id[MAXN][MAXN];
int toId(int i, int j) {
if (i > j)
swap(i, j);
return id[i][j];
}
bool visited[MAXV];
bo... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MAXN = 1005;
const int MAXV = MAXN * (MAXN - 1) / 2;
vector<int> to[MAXV];
int id[MAXN][MAXN];
int toId(int i, int j) {
if (i > j)
swap(i, j);
return id[i][j];
}
bool visited[MAXV];
bo... | [
"literal.number.change",
"assignment.value.change"
] | 731,301 | 731,300 | u457283867 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
int n, a[1025][1025], vis[1025];
bool flag;
bool ok() {
for (int i = 1; i <= n; i++)
if (a[i][0] != n)
return 0;
return 1;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <... | #include <bits/stdc++.h>
using namespace std;
int n, a[1025][1025], vis[1025];
bool flag;
bool ok() {
for (int i = 1; i <= n; i++)
if (a[i][0] != n)
return 0;
return 1;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 731,311 | 731,312 | u667714875 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
int n, a[1025][1025], vis[1025];
bool flag;
bool ok() {
for (int i = 1; i <= n; i++)
if (a[i][0] != n)
return 0;
return 1;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <... | #include <bits/stdc++.h>
using namespace std;
int n, a[1025][1025], vis[1025];
bool flag;
bool ok() {
for (int i = 1; i <= n; i++)
if (a[i][0] != n)
return 0;
return 1;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 731,313 | 731,314 | u667714875 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
int n, a[1025][1025];
bool vis[1025], flag;
bool ok() {
for (int i = 1; i <= n; i++)
if (a[i][0] != n)
return 0;
return 1;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <... | #include <bits/stdc++.h>
using namespace std;
int n, a[1025][1025];
bool vis[1025], flag;
bool ok() {
for (int i = 1; i <= n; i++)
if (a[i][0] != n)
return 0;
return 1;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <... | [
"expression.unary.arithmetic.remove"
] | 731,315 | 731,316 | u667714875 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
int n, a[20000][20000], t = 0;
bool flag[20000], fl = 0;
bool judge() {
for (int i = 1; i <= n; ++i)
if (a[i][0] != n)
return 0;
return 1;
}
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j < n; ++j)
cin >> a[i][j];
a[... | #include <bits/stdc++.h>
using namespace std;
int n, a[11000][11000], t = 0;
bool flag[11000], fl = 0;
bool judge() {
for (int i = 1; i <= n; ++i)
if (a[i][0] != n)
return 0;
return 1;
}
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j < n; ++j)
cin >> a[i][j];
a[... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 731,319 | 731,320 | u667714875 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
int n, a[20000][20000], t = 0;
bool flag[20000], fl = 0;
bool judge() {
for (int i = 1; i <= n; ++i)
if (a[i][0] != n)
return 0;
return 1;
}
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j < n; ++j)
cin >> a[i][j];
a[... | #include <bits/stdc++.h>
using namespace std;
int n, a[11000][11000], t = 0;
bool flag[11000], fl = 0;
bool judge() {
for (int i = 1; i <= n; ++i)
if (a[i][0] != n)
return 0;
return 1;
}
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j < n; ++j)
cin >> a[i][j];
a[... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 731,319 | 731,329 | u667714875 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 998244353
#define pb push_back
#define pi pair<int, int>
#define vi vector<int>
#define vpi vector<pi>
const int N = 1010;
vi v[N * N];
int st[N * N], tim[N * N];
int main() {
// memset(d,1,sizeof d)
int n, lst, x;
cin >> n;
for (in... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 998244353
#define pb push_back
#define pi pair<int, int>
#define vi vector<int>
#define vpi vector<pi>
const int N = 1010;
vi v[N * N];
int st[N * N], tim[N * N];
int main() {
// memset(d,1,sizeof d)
int n, lst, x;
cin >> n;
for (in... | [
"io.output.change"
] | 731,340 | 731,341 | u105709069 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 10;
int n, m = 1003;
int b[1010];
int deg[maxn];
int ct[1010];
vector<int> a[maxn], all;
bool vis[maxn], d[maxn], ok;
void topsort(int nod) {
vis[nod] = true;
d[nod] = true;
for (int i : a[nod]) {
if (!vis[i]) {
topsort(i);
} else ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 10;
int n, m = 1003;
int b[1010];
int deg[maxn];
int ct[1010];
vector<int> a[maxn], all;
bool vis[maxn], d[maxn], ok;
void topsort(int nod) {
vis[nod] = true;
d[nod] = true;
for (int i : a[nod]) {
if (!vis[i]) {
topsort(i);
} else ... | [
"assignment.add"
] | 731,342 | 731,343 | u047398677 | cpp |
p02925 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | [] | 731,354 | 731,355 | u051493691 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long int INF = 1000000007;
long long int acnt = 0;
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;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long int INF = 1000000007;
long long int acnt = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
if (A[i] > A[j])
... | [] | 731,360 | 731,361 | u665871498 | cpp |
p02928 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer
#include <functional>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer
#include <functional>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h... | [] | 731,362 | 731,363 | u142996493 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll d = 1000000000 + 7;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
ll ans1 = 0;
for (ll i = 0; i < N; i++) {
for (ll j = i + 1; j < N; j++) {
if (A[i] > A[j])
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll d = 1000000000 + 7;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
ll ans1 = 0;
for (ll i = 0; i < N; i++) {
for (ll j = i + 1; j < N; j++) {
if (A[i] > A[j])
... | [] | 731,364 | 731,365 | u037276799 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
long long a[2100], c;
long long K;
cin >> K;
long long ans = 0, cnt = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
long long z = 0;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
long long a[2100], c;
long long K;
cin >> K;
long long ans = 0, cnt = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
long long z = 0;
fo... | [
"assignment.value.change",
"assignment.change"
] | 731,366 | 731,367 | u126833093 | cpp |
p02928 | #include <stdio.h>
int main() {
int n, i, j;
long long int k, d = 0, f = 0;
scanf("%d %lld", &n, &k);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n - 1; i++) {
for (j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
d++;
}
if (a[i] < a[j]) {
... | #include <stdio.h>
int main() {
int n, i, j;
long long int k, d = 0, f = 0;
scanf("%d %lld", &n, &k);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n - 1; i++) {
for (j = i + 1; j < n; j++) {
if (a[i] > a[j]) {
d++;
}
if (a[i] < a[j]) {
... | [
"assignment.change"
] | 731,383 | 731,384 | u222643545 | cpp |
p02928 | #include <iostream>
#include <vector>
using namespace std;
int main() {
const long long int M = 1000000007;
long long int N, K;
cin >> N >> K;
vector<long long int> A(N);
for (long long int i = 0; i < N; ++i) {
cin >> A[i];
}
vector<long long int> cnt(2001, 0);
for (long long int i = 1; i < N; +... | #include <iostream>
#include <vector>
using namespace std;
int main() {
const long long int M = 1000000007;
long long int N, K;
cin >> N >> K;
vector<long long int> A(N);
for (long long int i = 0; i < N; ++i) {
cin >> A[i];
}
vector<long long int> cnt(2001, 0);
for (long long int i = 1; i < N; +... | [] | 731,385 | 731,386 | u982123883 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, k;
ll a[2005];
ll ansm, kk, kkk;
ll const BAD = 1e9 + 7;
ll add(ll x, ll y) {
ll a = (x % BAD + y % BAD) % BAD;
return a;
}
ll multiply(ll x, ll y) {
ll b = (x % BAD * y % BAD) % BAD;
return b;
}
int main() {
ios_base::sync_with_stdio(0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, k;
ll a[2005];
ll ansm, kk, kkk;
ll const BAD = 1e9 + 7;
ll add(ll x, ll y) {
ll a = (x % BAD + y % BAD) % BAD;
return a;
}
ll multiply(ll x, ll y) {
ll b = (x * y);
return b;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
... | [
"expression.operation.binary.remove"
] | 731,387 | 731,388 | u928313240 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
using ll = long long;
using ull = unsigned long long;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
usi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
using ll = long long;
using ull = unsigned long long;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
usi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 731,393 | 731,394 | u172929647 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
using ll = long long;
using ull = unsigned long long;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
usi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
using ll = long long;
using ull = unsigned long long;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
usi... | [
"assignment.change"
] | 731,395 | 731,394 | u172929647 | cpp |
p02928 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | [] | 731,401 | 731,402 | u391331433 | cpp |
p02928 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | [
"variable_declaration.type.change"
] | 731,403 | 731,402 | u391331433 | cpp |
p02928 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pll pair<long long, long long>
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define D(x) cerr << #x " = " << (x) << endl
#define vll vector<ll>
#define IOS ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pll pair<long long, long long>
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define D(x) cerr << #x " = " << (x) << endl
#define vll vector<ll>
#define IOS ... | [
"preprocessor.define.value.change"
] | 731,410 | 731,411 | u244472647 | cpp |
p02928 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
vector<int> a(n);
for (auto &e : a) {
cin >> e;
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
int under_num = 0;
int under_num_back = 0;
for (int j = 0; j < n; j++) {
if (a[i] > a[j... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
vector<int> a(n);
for (auto &e : a) {
cin >> e;
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
int under_num = 0;
int under_num_back = 0;
for (int j = 0; j < n; j++) {
if (a[i] > a[j... | [
"assignment.change"
] | 731,412 | 731,413 | u056633659 | cpp |
p02928 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
vector<int> a(n);
for (auto &e : a) {
cin >> e;
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
int under_num = 0;
int under_num_back = 0;
for (int j = 0; j < n; j++) {
if (a[i] > a[j... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
vector<int> a(n);
for (auto &e : a) {
cin >> e;
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
int under_num = 0;
int under_num_back = 0;
for (int j = 0; j < n; j++) {
if (a[i] > a[j... | [
"assignment.change"
] | 731,414 | 731,413 | u056633659 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define float long double
#define M 1000000007
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
int n;
cin >> n;
int k;
cin >> k;
int a[n];
int c = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define float long double
#define M 1000000007
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
int n;
cin >> n;
int k;
cin >> k;
int a[n];
int c = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 731,415 | 731,416 | u270945478 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define float long double
#define M 1000000007
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
int n;
cin >> n;
int k;
cin >> k;
int a[n];
int c = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define float long double
#define M 1000000007
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
int n;
cin >> n;
int k;
cin >> k;
int a[n];
int c = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 731,417 | 731,416 | u270945478 | cpp |
p02928 | /*
vrrtll==???>;::::~~~~~~......`.`````````````````````...-?777!_.._?7u,~~~::::;>>??=lllttrrzu
rtll==??>>;::::~~~~......`.``````````````````
..J77!`````````...`..._T,~~~~:::;;>??==lttrrv
tll=??>>;:::~~~~......``````````````````..J7^ ` `` ` ``
.,```````...._4,.~~~::;;>>?===lttr l=???>;;::~~~......`````HTSu,.`` `..J7! ... | /*
vrrtll==???>;::::~~~~~~......`.`````````````````````...-?777!_.._?7u,~~~::::;>>??=lllttrrzu
rtll==??>>;::::~~~~......`.``````````````````
..J77!`````````...`..._T,~~~~:::;;>??==lttrrv
tll=??>>;:::~~~~......``````````````````..J7^ ` `` ` ``
.,```````...._4,.~~~::;;>>?===lttr l=???>;;::~~~......`````HTSu,.`` `..J7! ... | [] | 731,428 | 731,429 | u373958718 | cpp |
p02928 | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using db = double;
using ldb = long db;
using str = string;
using vll = V<l... | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using db = double;
using ldb = long db;
using str = string;
using vll = V<l... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 731,434 | 731,435 | u177143886 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
typedef long long int ll;
int main() {
long long N, K;
cin >> N >> K;
vector<long long> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
ll P = 0;
for (int i = 0; i < v.size() - 1; i++) {
for (int j = i + 1; j < v.... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
typedef long long int ll;
int main() {
long long N, K;
cin >> N >> K;
vector<long long> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
ll P = 0;
for (int i = 0; i < v.size() - 1; i++) {
for (int j = i + 1; j < v.... | [
"expression.operation.binary.remove"
] | 731,436 | 731,437 | u598710706 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
typedef long long int ll;
int main() {
long long N, K;
cin >> N >> K;
vector<long long> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
ll P = 0;
for (int i = 0; i < v.size() - 1; i++) {
for (int j = i + 1; j < v.... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
typedef long long int ll;
int main() {
long long N, K;
cin >> N >> K;
vector<long long> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
ll P = 0;
for (int i = 0; i < v.size() - 1; i++) {
for (int j = i + 1; j < v.... | [
"assignment.change"
] | 731,438 | 731,437 | u598710706 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, i;
ll k, a[2005];
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> a[i];
ll ans = 0, mod = 1e9 + 7;
int c1 = 0, c2 = 0;
for (i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[j] < a[i])
c1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, i;
ll k, a[2005];
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> a[i];
ll ans = 0, mod = 1e9 + 7;
int c1 = 0, c2 = 0;
for (i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[j] < a[i])
c1... | [
"literal.number.change",
"assignment.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",
"variable_declaration.value.change"
] | 731,442 | 731,443 | u057633934 | cpp |
p02928 | /* Author: Dhruv Rastogi */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define all(sdk) sdk.begin(), sdk.end()
#define mll map<int, int>
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define repd(i, a, b) for (int i = a; i >= b; --i)
#define mp make_... | /* Author: Dhruv Rastogi */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define all(sdk) sdk.begin(), sdk.end()
#define mll map<int, int>
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define repd(i, a, b) for (int i = a; i >= b; --i)
#define mp make_... | [
"assignment.add"
] | 731,444 | 731,445 | u651976779 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int64_t x = 0;
bool flag;
int64_t p = int64_t(pow(10, 9));
do {
flag = false;
for (int i = 0; i < N - 1; i++) {
if (A.at(i)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int64_t x = 0;
bool flag;
int64_t p = int64_t(pow(10, 9));
do {
flag = false;
for (int i = 0; i < N - 1; i++) {
if (A.at(i)... | [
"expression.operation.binary.remove"
] | 731,451 | 731,452 | u030246664 | cpp |
p02928 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | [
"expression.operation.binary.remove"
] | 731,453 | 731,454 | u643747754 | cpp |
p02928 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | [] | 731,460 | 731,461 | u643747754 | cpp |
p02928 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
void solve() {
const ll M = 1000000007;
ll n, k;
cin >> n >> k;
ll ans = 0, peeche[n] = {0}, aage[n] = {0}, a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++) {
for (ll... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
void solve() {
const ll M = 1000000007;
ll n, k;
cin >> n >> k;
ll ans = 0, peeche[n] = {0}, aage[n] = {0}, a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++) {
for (ll... | [
"assignment.value.change",
"assignment.change"
] | 731,462 | 731,463 | u488672860 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const... | [] | 731,468 | 731,469 | u339558464 | cpp |
p02928 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
// #include <numeric> // gcdとかlcmとか C++17から
#include <time.h> // time_t timer; time(&timer); でtimerに現在時刻が代入される．
#include <unistd.h> // sleep関数．引数は秒単位．
using namespace std;
typedef long long ll;
ll my_gcd(ll a, ll b) { return (b == 0) ? a : my_g... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
// #include <numeric> // gcdとかlcmとか C++17から
#include <time.h> // time_t timer; time(&timer); でtimerに現在時刻が代入される．
#include <unistd.h> // sleep関数．引数は秒単位．
using namespace std;
typedef long long ll;
ll my_gcd(ll a, ll b) { return (b == 0) ? a : my_g... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 731,485 | 731,486 | u867763103 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
ll k, ans1 = 0, ans2 = 0, ans = 0;
cin >> n >> k;
int a[n], b[n * 2];
for (ll i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (a[i] > a[j])
ans1++;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
ll k, ans1 = 0, ans2 = 0, ans = 0;
cin >> n >> k;
int a[n], b[n * 2];
for (ll i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (a[i] > a[j])
ans1++;
... | [
"expression.operation.binary.remove"
] | 731,487 | 731,488 | u907518238 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
ll k, ans1 = 0, ans2 = 0, ans = 0;
cin >> n >> k;
int a[n], b[n * 2];
for (ll i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (a[i] > a[j])
ans1++;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
ll k, ans1 = 0, ans2 = 0, ans = 0;
cin >> n >> k;
int a[n], b[n * 2];
for (ll i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (a[i] > a[j])
ans1++;
... | [
"expression.operation.binary.remove"
] | 731,489 | 731,488 | u907518238 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int64_t N, K;
cin >> N >> K;
vector<int> A(N);
for (auto &v : A) {
cin >> v;
}
int64_t x = 0;
for (int i = 0; i < N - 1; ++i) {
for (int j = i + 1; j < N; ++j) {
if (A[i] > A[j]) {
x +=... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int64_t N, K;
cin >> N >> K;
vector<int> A(N);
for (auto &v : A) {
cin >> v;
}
int64_t x = 0;
for (int i = 0; i < N - 1; ++i) {
for (int j = i + 1; j < N; ++j) {
if (A[i] > A[j]) {
x +=... | [
"expression.operation.binary.remove"
] | 731,494 | 731,495 | u842596864 | cpp |
p02928 | #include <iostream>
long n, k, a = 0, i, j, m = 1e9 + 7, v[2 << 20];
main() {
for (std::cin >> n >> k; i++ < n;)
for (j = 0; j++ < n;) {
std::cin >> v[i];
if (i == j)
continue;
if (v[i] > v[j])
(a += k * (k - 1) / 2 + (i < j ? k : 0)) %= m;
}
std::cout << a;
}
| #include <iostream>
long n, k, a = 0, i, j, m = 1e9 + 7, v[2 << 20];
main() {
for (std::cin >> n >> k; i++ < n;)
for (j = 0; j++ < n;) {
std::cin >> v[j];
if (i == j)
continue;
if (v[i] > v[j])
(a += k * (k - 1) / 2 + (i < j ? k : 0)) %= m;
}
std::cout << a;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 731,507 | 731,508 | u317711717 | cpp |
p02928 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000000 + 7;
t... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000000 + 7;
t... | [] | 731,514 | 731,515 | u612271542 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
ll k;
cin >> n >> k;
ll a[2005];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll c1 = 0;
ll c2 = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j])
c1++;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
ll k;
cin >> n >> k;
ll a[2005];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll c1 = 0;
ll c2 = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j])
c1++;
... | [
"expression.operation.binary.remove"
] | 731,516 | 731,517 | u892687772 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
ll k;
cin >> n >> k;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll c1 = 0;
ll c2 = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j])
c1++;
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
ll k;
cin >> n >> k;
ll a[2005];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll c1 = 0;
ll c2 = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[j])
c1++;
... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 731,518 | 731,517 | u892687772 | cpp |
p02928 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define ggr ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define ggr ... | [
"assignment.change"
] | 731,526 | 731,527 | u441250130 | cpp |
p02928 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define ggr ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define ggr ... | [] | 731,526 | 731,528 | u441250130 | cpp |
p02928 | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define mod (ll)(1000000007)
#define inf (ll)(3e18 + 7)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(x) x.begin(), x.end... | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define mod (ll)(1000000007)
#define inf (ll)(3e18 + 7)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(x) x.begin(), x.end... | [
"expression.operation.binary.add"
] | 731,529 | 731,530 | u441250130 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(2e3 + 5);
const ll MOD = (ll)(1e9 + 7);
int n;
ll k;
int a[MAX_N];
ll base[MAX_N];
ll duplicate[MAX_N];
ll ans;
int main(void) {
// Here your code !
s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(2e3 + 5);
const ll MOD = (ll)(1e9 + 7);
int n;
ll k;
int a[MAX_N];
ll base[MAX_N];
ll duplicate[MAX_N];
ll ans;
int main(void) {
// Here your code !
s... | [
"assignment.add"
] | 731,531 | 731,532 | u497422208 | cpp |
p02928 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPP(i, n) for (int i = 1; i <= n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
us... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPP(i, n) for (int i = 1; i <= n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
us... | [
"assignment.change"
] | 731,533 | 731,534 | u881647420 | cpp |
p02928 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
using namespace std;
typedef long long int ll;
const ll INF = (ll)1e18;
int main... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
using namespace std;
typedef long long int ll;
const ll INF = (ll)1e18;
int main... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 731,539 | 731,540 | u868089307 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int sum1, sum2, ans;
sum1 = sum2 = 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;
#define MOD 1000000007
int main() {
int n;
long long k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long sum1, sum2, ans;
sum1 = sum2 = ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 731,548 | 731,549 | u863841238 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int sum1, sum2, ans;
sum1 = sum2 = 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;
#define MOD 1000000007
int main() {
int n;
long long k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long sum1, sum2, ans;
sum1 = sum2 = ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 731,550 | 731,549 | u863841238 | cpp |
p02928 | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
const LL mod = 1e9 + 7;
const int N = 2000;
int a[N + 5];
int n, k;
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
LL ans = 0;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j ... | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
const LL mod = 1e9 + 7;
const int N = 2000;
int a[N + 5];
int n, k;
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
LL ans = 0;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j ... | [
"assignment.change"
] | 731,551 | 731,552 | u239970578 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long n, k, b = 0, c = 0, ans = 0, mod = 1000000007;
cin >> n >> k;
vector<long long> a(n);
rep(i, n) cin >> a.at(i);
rep(i, n) {
for (int j = i; j < n; j++) {
if (a.at(i) > a.at(j))
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long n, k, b = 0, c = 0, ans = 0, mod = 1000000007;
cin >> n >> k;
vector<long long> a(n);
rep(i, n) cin >> a.at(i);
rep(i, n) {
for (int j = i; j < n; j++) {
if (a.at(i) > a.at(j))
... | [
"assignment.change"
] | 731,558 | 731,559 | u422633119 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long n, k, b = 0, c = 0, ans = 0, mod = 1000000007;
cin >> n >> k;
vector<long long> a(n);
rep(i, n) cin >> a.at(i);
rep(i, n) {
for (int j = i; j < n; j++) {
if (a.at(i) > a.at(j))
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long n, k, b = 0, c = 0, ans = 0, mod = 1000000007;
cin >> n >> k;
vector<long long> a(n);
rep(i, n) cin >> a.at(i);
rep(i, n) {
for (int j = i; j < n; j++) {
if (a.at(i) > a.at(j))
... | [
"assignment.change"
] | 731,560 | 731,559 | u422633119 | cpp |
p02928 | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
ll n, k, ans, mod = 1000000007, a[20005];
ll m[20005], f[20005];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
for (int j = 1; j < i; j++) {
if (a[i] < a[... | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
ll n, k, ans, mod = 1000000007, a[20005];
ll m[20005], f[20005];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
for (int j = 1; j < i; j++) {
if (a[i] < a[... | [
"assignment.change"
] | 731,568 | 731,569 | u178725037 | cpp |
p02928 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
rep(i, N) cin >> A[i];
// 中
ll ans = 0;
rep(i, N) rep(j... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
rep(i, N) cin >> A[i];
// 中
ll ans = 0;
rep(i, N) rep(j... | [
"assignment.add"
] | 731,599 | 731,600 | u482544950 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.