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 |
|---|---|---|---|---|---|---|---|
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
| #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,913 | 728,914 | u231230182 | cpp |
p02924 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define db double
#define ui unsigned int
#define ll long long
#define ull unsiged ll
#define rep(i, l, r) for (int i = l; i <= r; i+... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define db double
#define ui unsigned int
#define ll long long
#define ull unsiged ll
#define rep(i, l, r) for (int i = l; i <= r; i++... | [
"variable_declaration.type.change"
] | 728,915 | 728,916 | u393604857 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,917 | 728,918 | u244203620 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,925 | 728,926 | u788717734 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
constexpr int64_t mod = 1e9 + 7;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << 0;
return 0;
}
cout << (n - 1) * n / 2;
} | #include <bits/stdc++.h>
using namespace std;
constexpr int64_t mod = 1e9 + 7;
int main() {
int64_t n;
cin >> n;
if (n == 1) {
cout << 0;
return 0;
}
cout << (n - 1) * n / 2;
} | [
"variable_declaration.type.primitive.change"
] | 728,927 | 728,928 | u849073847 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
static const int INF(1 << 30);
int main() {
ll N;
cin >> N;
if (N == 1) {
cout << 0 << endl;
return 0;
} else if (N == 2) {
cout << 1 << en... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
static const int INF(1 << 30);
int main() {
ll N;
cin >> N;
if (N == 1) {
cout << 0 << endl;
return 0;
} else if (N == 2) {
cout << 1 << en... | [
"assignment.change"
] | 728,931 | 728,932 | u730946954 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans;
if (n == 1)
ans = 0;
else {
ans = (n - 1) * (n) / 2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans;
if (n == 1)
ans = 0;
else {
ans = (n - 1) * (n) / 2;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,933 | 728,934 | u756514276 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n--;
cout << ((1 + n) * n) / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
cin >> n;
n--;
cout << ((1 + n) * n) / 2;
}
| [
"variable_declaration.type.widen.change"
] | 728,935 | 728,936 | u016726316 | cpp |
p02924 | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_D main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int... | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_D main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int... | [
"variable_declaration.type.change"
] | 728,937 | 728,938 | u404244809 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
long long n;
cin >> n;
cout << (n * (n - 1)) / 2 << "\n";
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,939 | 728,940 | u261237205 | cpp |
p02924 | //#define NDEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <vecto... | //#define NDEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <vecto... | [
"variable_declaration.type.change"
] | 728,943 | 728,944 | u495072453 | cpp |
p02924 | #include <bits/stdc++.h>
#define ll long long
#define inf 1000000000
#define mp make_pair
#define pii pair<int, int>
#define pb push_back
#define r1 rt << 1
#define r2 rt << 1 | 1
#define ri register int
#define rep(i, a, b) for (ri i = (a); i <= (b); ++i)
#define rep2(i, a, b, c) for (ri i = (a); i <= (b); i += (c))
#... | #include <bits/stdc++.h>
#define ll long long
#define inf 1000000000
#define mp make_pair
#define pii pair<int, int>
#define pb push_back
#define r1 rt << 1
#define r2 rt << 1 | 1
#define ri register int
#define rep(i, a, b) for (ri i = (a); i <= (b); ++i)
#define rep2(i, a, b, c) for (ri i = (a); i <= (b); i += (c))
#... | [] | 728,945 | 728,946 | u329585799 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0;
ans = (N - 1) * N / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
ans = (N - 1) * N / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,949 | 728,950 | u032068406 | cpp |
p02924 | #include "bits/stdc++.h"
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define eb emplace_back
#define rep(i, a, b) for (long i = (a); i <= (b); ++i)
#define per(i, a, b) for (long i = (a); i >= (b); --i)
#define mmst(v) memset(v, 0, sizeof(v))
template <typename T1, typename T... | #include "bits/stdc++.h"
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define eb emplace_back
#define rep(i, a, b) for (long i = (a); i <= (b); ++i)
#define per(i, a, b) for (long i = (a); i >= (b); --i)
#define mmst(v) memset(v, 0, sizeof(v))
template <typename T1, typename T... | [
"variable_declaration.type.change"
] | 728,953 | 728,954 | u449221649 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2;
}
| #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long N;
cin >> N;
cout << N * (N - 1) / 2;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,959 | 728,960 | u554988565 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int ans = N * (N - 1) / 2;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long N;
cin >> N;
long ans = N * (N - 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 728,961 | 728,962 | u521602455 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
scanf("%d", &n);
ll sum = (1 + n - 1) * (n - 1) / 2;
printf("%lld\n", sum);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n;
scanf("%lld", &n);
ll sum = (1 + n - 1) * (n - 1) / 2;
printf("%lld\n", sum);
return 0;
}
| [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change"
] | 728,965 | 728,966 | u175426149 | cpp |
p02924 | #include <iostream>
using namespace std;
main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | #include <iostream>
using namespace std;
main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,967 | 728,968 | u771099984 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = (n - 1) * n / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans;
cin >> n;
ans = (n - 1) * n / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,969 | 728,970 | u082801599 | cpp |
p02924 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
#define LL long long
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << '\n';
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
#define LL long long
int main() {
LL n;
cin >> n;
cout << (n * (n - 1)) / 2 << '\n';
return 0;
} | [
"variable_declaration.type.change"
] | 728,975 | 728,976 | u924429544 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main() {
LLONG N;
cin >> N;
cout << N * (N - 1) / 2 <... | [
"variable_declaration.type.change"
] | 728,977 | 728,978 | u214685595 | cpp |
p02924 | #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... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,979 | 728,980 | u096453658 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin()... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin()... | [
"variable_declaration.type.change"
] | 728,983 | 728,984 | u352200121 | cpp |
p02924 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vecto... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vecto... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 728,985 | 728,986 | u810616694 | cpp |
p02924 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<uns... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<uns... | [
"variable_declaration.type.change"
] | 728,987 | 728,988 | u493750228 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int main() {
cin >> N;
cout << (N - 1) * N / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
int main() {
cin >> N;
cout << (N - 1) * N / 2 << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 728,989 | 728,990 | u488352661 | cpp |
p02924 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define dup(x, y) (((x) + (y)-1) / (y)) // dup * y >= x なる最小のdup.
using namespace std;
typedef long ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define dup(x, y) (((x) + (y)-1) / (y)) // dup * y >= x なる最小のdup.
using namespace std;
typedef long ... | [
"variable_declaration.type.change"
] | 728,991 | 728,992 | u017293723 | cpp |
p02924 | #include <bits/stdc++.h>
#define debug(n) cerr << #n << ':' << n << endl;
using namespace std;
using ll = long long;
template <class T, class U> using umap = unordered_map<T, U>;
template <class T> using uset = unordered_set<T>;
template <class T> inline bool change_max(T &a, const T &b) {
if (b > a) {
a = ... | #include <bits/stdc++.h>
#define debug(n) cerr << #n << ':' << n << endl;
using namespace std;
using ll = long long;
template <class T, class U> using umap = unordered_map<T, U>;
template <class T> using uset = unordered_set<T>;
template <class T> inline bool change_max(T &a, const T &b) {
if (b > a) {
a = ... | [
"variable_declaration.type.change"
] | 728,993 | 728,994 | u691380397 | cpp |
p02924 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
cout << N * (N - 1) / 2;
return 0;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll N;
cin >> N;
cout << N * (N - 1) / 2;
return 0;
}
| [
"variable_declaration.type.change"
] | 728,997 | 728,998 | u854904794 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i... | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 728,999 | 729,000 | u909601929 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
typedef pair<int, int> P;
typedef vector<int> Vi;
int const MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
return a = b;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | #include <bits/stdc++.h>
using namespace std;
using Int = long long unsigned;
typedef pair<int, int> P;
typedef vector<int> Vi;
int const MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
return a = b;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a <... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.change"
] | 729,001 | 729,002 | u735089337 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 729,003 | 729,004 | u073082475 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using ull = unsigned long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using ull = unsigned long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<... | [
"variable_declaration.type.change"
] | 729,015 | 729,016 | u525888949 | cpp |
p02924 | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0)... | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0)... | [
"expression.unary.arithmetic.add"
] | 729,017 | 729,018 | u317754719 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | [
"literal.number.change",
"call.arguments.change"
] | 729,024 | 729,025 | u058297300 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | [
"literal.number.change",
"call.arguments.change"
] | 729,026 | 729,025 | u058297300 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | [
"literal.number.change",
"call.arguments.change"
] | 729,027 | 729,025 | u058297300 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#de... | [
"literal.number.change",
"call.arguments.change"
] | 729,028 | 729,025 | u058297300 | cpp |
p02913 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool rk(string t, string p) {
int k = 1000007, m = 1000000007;
long long ht = 0;
long long po = 1;
for (int i = 0; i < p.size(); i++) {
po *= k;
po %= m;
}
po %= m;
for (int i = 0; i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool rk(string t, string p) {
int k = 1000007, m = 1000000007;
long long ht = 0;
long long po = 1;
for (int i = 0; i < p.size(); i++) {
po *= k;
po %= m;
}
po %= m;
for (int i = 0; i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 729,031 | 729,032 | u553461888 | cpp |
p02913 | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
int zalgorithm(string s) {
int i = 1;
int j = 0;
vector<int> a(s.size(), s.size());
while (i < s.size()) {
while (i + j < s.size(... | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
int zalgorithm(string s) {
int i = 1;
int j = 0;
vector<int> a(s.size(), s.size());
while (i < s.size()) {
while (i + j < s.size(... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 729,033 | 729,034 | u052247353 | cpp |
p02913 | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
int zalgorithm(string s) {
int i = 1;
int j = 0;
vector<int> a(s.size(), s.size());
while (i < s.size()) {
while (i + j < s.size(... | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
int zalgorithm(string s) {
int i = 1;
int j = 0;
vector<int> a(s.size(), s.size());
while (i < s.size()) {
while (i + j < s.size(... | [
"expression.operation.binary.remove"
] | 729,035 | 729,034 | u052247353 | cpp |
p02913 | #include <algorithm>
#include <cstdio>
#include <cstring>
#define N 5005
int n, ans;
char a[N];
int main() {
scanf("%d%s", &n, a + 1);
for (register int i = 1; i <= (n >> 1); ++i) {
int s = 0;
for (register int j = 1; j <= n - i; ++j)
a[j] == a[j + i] && s < i ? ++s, ans = std ::max(ans, s) : s = 0;
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#define N 5005
int n, ans;
char a[N];
int main() {
scanf("%d%s", &n, a + 1);
for (register int i = 1; i <= n; ++i) {
int s = 0;
for (register int j = 1; j <= n - i; ++j)
a[j] == a[j + i] && s < i ? ++s, ans = std ::max(ans, s) : s = 0;
}
pr... | [
"control_flow.loop.for.condition.change"
] | 729,050 | 729,051 | u684791042 | cpp |
p02913 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll dp[5001][5001]; // dp[i][j]はi番目とj番目から始めたときの部分列の
//共通の長さで,i<jとする.
int... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll dp[5001][5000];
int main() {
int N;
cin >> N;
string s;
cin >> s;
for (int i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 729,052 | 729,053 | u963055157 | cpp |
p02913 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll dp[5001][5001]; // dp[i][j]はi番目とj番目から始めたときの部分列の
//共通の長さで,i<jとする.
int... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll dp[5000][5000];
int main() {
int N;
cin >> N;
string s;
cin >> s;
for (int i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 729,052 | 729,054 | u963055157 | cpp |
p02913 | #include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (int i = (N)-1; i >= 0; i--)
#define rep1(i, N) for (int i = 1; i <= (N); i++)
#define repr1(i, N) for (int i = (N); i > 0; ... | #include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (int i = (N)-1; i >= 0; i--)
#define rep1(i, N) for (int i = 1; i <= (N); i++)
#define repr1(i, N) for (int i = (N); i > 0; ... | [
"call.remove"
] | 729,072 | 729,074 | u168578024 | cpp |
p02913 | #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... | [
"identifier.replace.add",
"literal.replace.remove"
] | 729,092 | 729,093 | u905715926 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
#define repi(i, x, n) for (int i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
#define repi(i, x, n) for (int i ... | [
"identifier.change"
] | 729,094 | 729,095 | u317711717 | cpp |
p02913 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int dp[5005][5005]; //グローバルだと0初期化される
int main(void) {
int n;
string s;
cin >> n >> s;
for (int i = n - 1; i >= 0; --i) {
for (int j = n - 1; j >= 0; --j) {
if (s[i] != s[j]) {
dp[i][j] = 0;
} ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int dp[5005][5005]; //グローバルだと0初期化される
int main(void) {
int n;
string s;
cin >> n >> s;
for (int i = n - 1; i >= 0; --i) {
for (int j = n - 1; j >= 0; --j) {
if (s[i] != s[j]) {
dp[i][j] = 0;
} ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 729,098 | 729,099 | u905170328 | cpp |
p02913 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int dp[5005][5005]; //グローバルだと0初期化される
int main(void) {
int n;
string s;
cin >> n >> s;
for (int i = n - 1; i >= 0; --i) {
for (int j = n - 1; j >= 0; --j) {
if (s[i] != s[j]) {
dp[i][j] = 0;
} el... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int dp[5005][5005]; //グローバルだと0初期化される
int main(void) {
int n;
string s;
cin >> n >> s;
for (int i = n - 1; i >= 0; --i) {
for (int j = n - 1; j >= 0; --j) {
if (s[i] != s[j]) {
dp[i][j] = 0;
} ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 729,100 | 729,099 | u905170328 | cpp |
p02913 | #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 = 5 * 1e3;
vector<vector<int>> dp(MAXN + 5, vector<int>(MAXN + 5));
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (int i = n - 1; i >= 0; i--) {
for (int j = n - 1;... | #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 = 5 * 1e3;
vector<vector<int>> dp(MAXN + 5, vector<int>(MAXN + 5));
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (int i = n - 1; i >= 0; i--) {
for (int j = n - 1;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 729,101 | 729,102 | u762183504 | cpp |
p02913 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
constexpr ll mod[2] = {1000000007, 998244353};
struct rolling_hash {
ll z = 1000, ex[2][100010];
vector<ll> v, w[2];
rolling_hash(string &s) {
int i, j, n = s.size();
for (i = 0; i ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
constexpr ll mod[2] = {1000000007, 998244353};
struct rolling_hash {
ll z = 100, ex[2][100010];
vector<ll> v, w[2];
rolling_hash(string &s) {
int i, j, n = s.size();
for (i = 0; i <... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 729,109 | 729,110 | u621509943 | cpp |
p02913 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using treap =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using treap =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long... | [
"literal.number.change",
"expression.operation.binary.change"
] | 729,132 | 729,133 | u852113235 | cpp |
p02913 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using treap =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using treap =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long... | [
"literal.number.change",
"expression.operation.binary.change"
] | 729,134 | 729,133 | u852113235 | cpp |
p02913 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using treap =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using treap =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long... | [
"expression.operation.binary.remove"
] | 729,135 | 729,136 | u852113235 | cpp |
p02913 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int len, ans;
string S;
cin >> N;
cin >> S;
ans = 0;
for (int i = 1; i < N; i++) {
len = 0;
for (int j = 0; j < N - i; j++) {
if (S[j] == S[j - i]) {
len++;
} else {
len = ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int len, ans;
string S;
cin >> N;
cin >> S;
ans = 0;
for (int i = 1; i < N; i++) {
len = 0;
for (int j = 0; j < N - i; j++) {
if (S[j] == S[j + i]) {
len++;
} else {
len = ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 729,138 | 729,139 | u235231201 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 729,143 | 729,144 | u616029737 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
uint64_t randint() {
static int64_t seed = chrono::duration_cast<chrono::milliseconds>(
chrono::system_clock::now().time_since_epoch())
.count();
static mt19937_64 rnd(seed);
return rnd();
}
template <int64_t m... | #include <bits/stdc++.h>
using namespace std;
uint64_t randint() {
static int64_t seed = chrono::duration_cast<chrono::milliseconds>(
chrono::system_clock::now().time_since_epoch())
.count();
static mt19937_64 rnd(seed);
return rnd();
}
template <int64_t m... | [
"identifier.change",
"call.arguments.change"
] | 729,151 | 729,152 | u314396879 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 729,155 | 729,156 | u452725238 | cpp |
p02913 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"assignment.change"
] | 729,157 | 729,156 | u452725238 | cpp |
p02913 | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
temp... | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
temp... | [
"expression.operation.binary.add"
] | 729,162 | 729,163 | u581122825 | cpp |
p02913 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//#define int ll
typedef vector<vector<pair<int, int>>> vvp;
typedef vector<pair<int, int>> vp;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vect... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//#define int ll
typedef vector<vector<pair<int, int>>> vvp;
typedef vector<pair<int, int>> vp;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vect... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 729,164 | 729,165 | u902151549 | cpp |
p02913 | #include <stdio.h>
#define MAX(x, y) ((x) > (y) ? (x) : (y))
#define MIN(x, y) ((x) < (y) ? (x) : (y))
int n;
char S[5000];
int dp[5000][5000];
int main() {
int i, j, r;
scanf("%d", &n);
scanf("%s", S);
for (j = 1; j < n; j++)
dp[0][j] = S[0] == S[j];
for (i = 1; i < n; i++) {
for (j = i + 1; j < n... | #include <stdio.h>
#define MAX(x, y) ((x) > (y) ? (x) : (y))
#define MIN(x, y) ((x) < (y) ? (x) : (y))
int n;
char S[5001];
int dp[5000][5000];
int main() {
int i, j, r;
scanf("%d", &n);
scanf("%s", S);
for (j = 1; j < n; j++)
dp[0][j] = S[0] == S[j];
for (i = 1; i < n; i++) {
for (j = i + 1; j < n... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 729,168 | 729,167 | u367021138 | cpp |
p02913 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define base 26
int n;
string s;
#define MAXN (int)(5e3 + 233)
unsigned long long h[MAXN];
long long power[MAXN];
unsigned long long lstans;
#define gethash(l, r) (h[r] - h[l - 1] * power[r - l + 1])
int ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define base 37
int n;
string s;
#define MAXN (int)(5e3 + 233)
unsigned long long h[MAXN];
unsigned long long power[MAXN];
unsigned long long lstans;
#define gethash(l, r) (h[r] - h[l - 1] * power[r - l +... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 729,172 | 729,170 | u582434836 | cpp |
p02913 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define base 377
int n;
string s;
#define MAXN (int)(5e3 + 233)
unsigned long long h[MAXN];
long long power[MAXN];
unsigned long long lstans;
#define gethash(l, r) (h[r] - h[l - 1] * power[r - l + 1])
int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define base 37
int n;
string s;
#define MAXN (int)(5e3 + 233)
unsigned long long h[MAXN];
unsigned long long power[MAXN];
unsigned long long lstans;
#define gethash(l, r) (h[r] - h[l - 1] * power[r - l +... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 729,173 | 729,170 | u582434836 | cpp |
p02913 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define base 7
int n;
string s;
#define MAXN (int)(5e3 + 233)
unsigned long long h[MAXN];
long long power[MAXN];
unsigned long long lstans;
#define gethash(l, r) (h[r] - h[l - 1] * power[r - l + 1])
int m... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define base 37
int n;
string s;
#define MAXN (int)(5e3 + 233)
unsigned long long h[MAXN];
unsigned long long power[MAXN];
unsigned long long lstans;
#define gethash(l, r) (h[r] - h[l - 1] * power[r - l +... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 729,174 | 729,170 | u582434836 | cpp |
p02913 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define base 37
int n;
string s;
#define MAXN (int)(5e3 + 233)
unsigned long long h[MAXN];
long long power[MAXN];
unsigned long long lstans;
#define gethash(l, r) (h[r] - h[l - 1] * power[r - l + 1])
int ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define base 37
int n;
string s;
#define MAXN (int)(5e3 + 233)
unsigned long long h[MAXN];
unsigned long long power[MAXN];
unsigned long long lstans;
#define gethash(l, r) (h[r] - h[l - 1] * power[r - l +... | [
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 729,175 | 729,170 | u582434836 | cpp |
p02913 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define base 37
int n;
string s;
#define MAXN (int)(5e3 + 233)
int h[MAXN];
long long power[MAXN];
unsigned long long lstans;
#define gethash(l, r) (h[r] - h[l - 1] * power[r - l + 1])
int main() {
scan... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define base 37
int n;
string s;
#define MAXN (int)(5e3 + 233)
unsigned long long h[MAXN];
unsigned long long power[MAXN];
unsigned long long lstans;
#define gethash(l, r) (h[r] - h[l - 1] * power[r - l +... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 729,176 | 729,170 | u582434836 | cpp |
p02924 | #include <algorithm>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long n;
void input() { scanf("%I64d", &n); }
void solve() {
--n;
printf("... | #include <algorithm>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long n;
void input() { scanf("%lld", &n); }
void solve() {
--n;
printf("%... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 729,185 | 729,186 | u741945117 | cpp |
p02924 | #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... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 729,187 | 729,188 | u054475353 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
cout << (N - 1) * N / 2 << std::endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
cout << (N - 1) * N / 2 << std::endl;
}
| [
"variable_declaration.type.change"
] | 729,189 | 729,190 | u580402951 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 10000000... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 10000000... | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 729,191 | 729,192 | u334624175 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; ... | [
"expression.operation.binary.remove"
] | 729,193 | 729,194 | u942393279 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
i64 res = (N) * (N - 1) / 2;
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
i64 res = 1LL * N * (N - 1) / 2;
cout << res << "\n";
return 0;
} | [
"expression.operation.binary.change"
] | 729,197 | 729,198 | u959960486 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
const int INF = 1000000000;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
const int INF = 1000000000;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 729,201 | 729,202 | u791146764 | cpp |
p02925 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
//#include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" ... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
//#include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" ... | [
"call.function.change"
] | 729,205 | 729,206 | u424602097 | cpp |
p02925 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
//#include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" ... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
//#include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 729,207 | 729,208 | u424602097 | cpp |
p02925 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | [] | 729,237 | 729,238 | u600402037 | cpp |
p02925 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 62;
const int IINF = 1000000000;
template <class T> inline bool chmax(T &a, T b) {... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL << 62;
const int IINF = 1000000000;
template <class T> inline bool chmax(T &a, T b) {... | [] | 729,239 | 729,240 | u622045059 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) std:... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) std:... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change"
] | 729,245 | 729,246 | u350072791 | cpp |
p02925 | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
// typedef pair<ll, ll> P;
typedef pair<ll, ll> P;
const ll INF = 10e1... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
// typedef pair<ll, ll> P;
typedef pair<ll, ll> P;
const ll INF = 10e1... | [
"expression.operation.binary.remove"
] | 729,263 | 729,264 | u564182781 | cpp |
p02925 | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
struct Edge {
long long to;
};
using Graph = vector<vector<Edge>>;
int swap(int i, int j) {
if (i < j)
swap(i, j);
... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
struct Edge {
long long to;
};
using Graph = vector<vector<Edge>>;
int swaping(int i, int j) {
if (i < j)
swap(i, j)... | [
"identifier.change",
"call.function.change"
] | 729,278 | 729,279 | u530329977 | cpp |
p02925 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int MAXN = 1005;
con... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int MAXN = 1005;
con... | [
"literal.number.change",
"assignment.value.change"
] | 729,280 | 729,281 | u828388155 | cpp |
p02925 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int MAXN = 1005;
con... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int MAXN = 1005;
con... | [
"literal.number.change",
"assignment.value.change"
] | 729,282 | 729,281 | u828388155 | cpp |
p02925 | #include <algorithm> // for next_permutation
#include <bits/stl_numeric.h>
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
#define DEBUG 0
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;... | #include <algorithm> // for next_permutation
#include <bits/stl_numeric.h>
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
#define DEBUG 0
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 729,289 | 729,290 | u485731913 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N;
const int MAX_N = 1001;
const int MAX_GAME = MAX_N * MAX_N;
bool visited[MAX_GAME];
bool calced[MAX_GAME];
int day[MAX_GAME];
int get_day(int game, vector<vector<int>> &prev) {
if (visited[game]) {
if (!calced[game])
return -1;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N;
const int MAX_N = 1001;
const int MAX_GAME = MAX_N * MAX_N;
bool visited[MAX_GAME];
bool calced[MAX_GAME];
int day[MAX_GAME];
int get_day(int game, vector<vector<int>> &prev) {
if (visited[game]) {
if (!calced[game])
return -1;
... | [
"assignment.change"
] | 729,291 | 729,292 | u904833081 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
#define int long long
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[maxN]; // 関数外の変数については,
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
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]; // 関数外の変数については,
... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 729,295 | 729,294 | u904833081 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
#define int long long
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[maxN]; // 関数外の変数については,
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
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]; // 関数外の変数については,
... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 729,295 | 729,296 | u904833081 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 729,304 | 729,305 | u721367699 | cpp |
p02925 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"expression.operation.binary.add"
] | 729,313 | 729,314 | u832095504 | cpp |
p02925 | #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 MAXN = 1005;
const int MAXV = MAXN * MAXN / 2;
vector<int> to[MAXV];
int id[MAXN][MAXN];
//とりあえず、試合のIDを返す関数を作成。
int toId(int i, int j) {
if (i > j)
swap(i, j);
... | #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 MAXN = 1005;
const int MAXV = MAXN * MAXN / 2;
vector<int> to[MAXV];
int id[MAXN][MAXN];
//とりあえず、試合のIDを返す関数を作成。
int toId(int i, int j) {
if (i > j)
swap(i, j);
... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 729,315 | 729,316 | u480887263 | cpp |
p02925 | /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | [
"expression.operation.binary.add"
] | 729,331 | 729,332 | u061984624 | cpp |
p02925 | /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 729,333 | 729,332 | u061984624 | cpp |
p02925 | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
vector<vector<int>> a(n, vector<int>(n - 1));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
cin >> a[i][j];
a[i][j]--;
}
};
... | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n - 1));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
cin >> a[i][j];
a[i][j]--;
... | [] | 729,342 | 729,343 | u136509923 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
const bool DEBUG = true;
const int MAX_N = 1005;
const int MAX_V = MAX_N * (MAX_N - 1) / 2;
vector<int> to[MAX_V];
int id[MAX_N][MAX_N];
int to_match_id(int i, int j) {
if (i > j)
swap(i, j);
return id[i][j];
}
bool visited[MAX_V];
bool calculated[MAX_V];
int dp... | #include <bits/stdc++.h>
using namespace std;
const bool DEBUG = true;
const int MAX_N = 1005;
const int MAX_V = MAX_N * (MAX_N - 1) / 2;
vector<int> to[MAX_V];
int id[MAX_N][MAX_N];
int to_match_id(int i, int j) {
if (i > j)
swap(i, j);
return id[i][j];
}
bool visited[MAX_V];
bool calculated[MAX_V];
int dp... | [
"literal.number.change",
"assignment.value.change"
] | 729,355 | 729,356 | u482785341 | cpp |
p02925 | #include <bits/stdc++.h>
using namespace std;
const bool DEBUG = true;
const int MAX_N = 1005;
const int MAX_V = MAX_N * (MAX_N - 1) / 2;
vector<int> to[MAX_V];
int id[MAX_N][MAX_N];
int to_match_id(int i, int j) {
if (i > j)
swap(i, j);
return id[i][j];
}
bool visited[MAX_V];
bool calculated[MAX_V];
int dp... | #include <bits/stdc++.h>
using namespace std;
const bool DEBUG = true;
const int MAX_N = 1005;
const int MAX_V = MAX_N * (MAX_N - 1) / 2;
vector<int> to[MAX_V];
int id[MAX_N][MAX_N];
int to_match_id(int i, int j) {
if (i > j)
swap(i, j);
return id[i][j];
}
bool visited[MAX_V];
bool calculated[MAX_V];
int dp... | [
"literal.number.change",
"assignment.value.change",
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 729,357 | 729,356 | u482785341 | cpp |
p02925 | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define int long long
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) {... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define int long long
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) {... | [] | 729,366 | 729,367 | u526532903 | 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"
] | 729,380 | 729,379 | u506858457 | cpp |
p02925 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> b... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> b... | [
"expression.operation.binary.add"
] | 729,381 | 729,382 | u556276145 | cpp |
p02925 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> b... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> b... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 729,383 | 729,382 | u556276145 | cpp |
p02925 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using datas = pair<ll, ll>;
using tdata = pair<ll, datas>;
using vec = vector<ll>;
using mat = vector<vec>;
using pvec = vector<datas>;
using pmat = vector<pvec>;
#define For(i, a, b) for (i = a; i < b; i++)
#define bFor(i... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using datas = pair<ll, ll>;
using tdata = pair<ll, datas>;
using vec = vector<ll>;
using mat = vector<vec>;
using pvec = vector<datas>;
using pmat = vector<pvec>;
#define For(i, a, b) for (i = a; i < b; i++)
#define bFor(i... | [
"assignment.change"
] | 729,390 | 729,391 | u251847465 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.