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 8
values |
|---|---|---|---|---|---|---|---|
p03243 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <vector>
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <vector>
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
... | [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change",
"call.arguments.add"
] | 1,033,107 | 1,033,108 | u719183609 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 1,033,113 | 1,033,114 | u319279308 | cpp |
p03244 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,033,118 | 1,033,119 | u116523315 | cpp |
p03244 | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T> void debug(T value) { std::cerr << value; }
template <typename T, typename... Ts> void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T> void debug(T value) { std::cerr << value; }
template <typename T, typename... Ts> void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | [
"call.arguments.add"
] | 1,033,120 | 1,033,121 | u505122009 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM \
cin.tie(0); \
ios::sync_with_std... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM \
cin.tie(0); \
ios::sync_with_std... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,033,132 | 1,033,133 | u855838587 | cpp |
p03244 | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,033,136 | 1,033,137 | u976940619 | cpp |
p03244 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi =... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi =... | [
"function.return_value.change",
"expression.operation.binary.change"
] | 1,033,154 | 1,033,155 | u802434195 | cpp |
p03244 | #include "bits/stdc++.h"
using namespace std;
// 23
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
map<int, int> m1;
map<int, int> m2;
for (int i = 0; i < n; i += 2) {
m1[v[i]]++;
}
for (int i = 1; i < n; i += 2) {
m2[v[i]]+... | #include "bits/stdc++.h"
using namespace std;
// 23
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
map<int, int> m1;
map<int, int> m2;
for (int i = 0; i < n; i += 2) {
m1[v[i]]++;
}
for (int i = 1; i < n; i += 2) {
m2[v[i]]+... | [
"call.function.change"
] | 1,033,158 | 1,033,159 | u403668916 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 1,033,163 | 1,033,164 | u084949493 | cpp |
p03244 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n);... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n);... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,033,171 | 1,033,172 | u480172743 | cpp |
p03244 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
const double PI = 3.141592653589793238463;
using namespace std;
using ll = long long;
const ll INF = +10010010000;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
stru... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
const double PI = 3.141592653589793238463;
using namespace std;
using ll = long long;
const ll INF = +10010010000;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
stru... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,183 | 1,033,184 | u412659798 | cpp |
p03244 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
map<int, int> emap;
map<int, i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
map<int, int> emap;
map<int, i... | [
"call.arguments.add"
] | 1,033,200 | 1,033,201 | u476027087 | cpp |
p03244 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 1,033,227 | 1,033,228 | u222866518 | cpp |
p03244 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
map<int, int> mp_even;
map<int, i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
map<int, int> mp_even;
map<int, i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,033,244 | 1,033,245 | u596311864 | cpp |
p03244 | /* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#define pi 2 * acos(0.0)
#define ll long long
#defin... | /* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#define pi 2 * acos(0.0)
#define ll long long
#defin... | [] | 1,033,248 | 1,033,249 | u164081575 | cpp |
p03244 | #include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long lint;
#define rep(i, n) for (lint(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (lint(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (lint(i) = (n - 1); (i) >= 0; (i)--)
#define INF (1ll << 60)
#define all(x) (x).begin(), (x).e... | #include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long lint;
#define rep(i, n) for (lint(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (lint(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (lint(i) = (n - 1); (i) >= 0; (i)--)
#define INF (1ll << 60)
#define all(x) (x).begin(), (x).e... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 1,033,250 | 1,033,251 | u768204022 | cpp |
p03244 | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#def... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#def... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,033,252 | 1,033,253 | u932275750 | cpp |
p03244 | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (long long i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FORR(i, m, n) for (long long i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.en... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (long long i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FORR(i, m, n) for (long long i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.en... | [
"identifier.change",
"call.function.change"
] | 1,033,258 | 1,033,259 | u557565572 | cpp |
p03244 | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | [
"function.return_value.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,033,260 | 1,033,261 | u526639495 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<pair<int, int>> a(100001), b(100001);
for (int i = 0; i < n; i++) {
a[i] = make_pair(0, i + 1);
b[i] = make_pair(0, i + 1);
}
for (int i = 0; i < n; i++) {
int v;
cin >> v;
if (i % 2 ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<pair<int, int>> a(100001), b(100001);
for (int i = 0; i < 100001; i++) {
a[i] = make_pair(0, i + 1);
b[i] = make_pair(0, i + 1);
}
for (int i = 0; i < n; i++) {
int v;
cin >> v;
if (i... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,033,277 | 1,033,278 | u962609087 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
usin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
usin... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,033,279 | 1,033,280 | u364618491 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
struct StNumCnt {
StNumCnt() : m_nNum(0), m_nCnt(0) {}
int m_nNum;
int m_nCnt;
};
class CGreater_nCnt {
public:
bool operator()(const StNumCnt &lhs, const StNumCnt &rhs) {
return lhs.m_nCnt < rhs.m_nCnt;
}
};
void fnInput(vector<int> &rvnNum) {
int nNumS... | #include <bits/stdc++.h>
using namespace std;
struct StNumCnt {
StNumCnt() : m_nNum(0), m_nCnt(0) {}
int m_nNum;
int m_nCnt;
};
class CGreater_nCnt {
public:
bool operator()(const StNumCnt &lhs, const StNumCnt &rhs) {
return lhs.m_nCnt > rhs.m_nCnt;
}
};
void input(vector<int> &rvnNum) {
int nNumSiz... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,033,342 | 1,033,343 | u439912527 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
struct StNumCnt {
StNumCnt() : m_nNum(0), m_nCnt(0) {}
int m_nNum;
int m_nCnt;
};
class CGreater_nCnt {
public:
bool operator()(const StNumCnt &lhs, const StNumCnt &rhs) {
return lhs.m_nCnt < rhs.m_nCnt;
}
};
void fnInput(vector<int> &rvnNum) {
int nNumS... | #include <bits/stdc++.h>
using namespace std;
struct StNumCnt {
StNumCnt() : m_nNum(0), m_nCnt(0) {}
int m_nNum;
int m_nCnt;
};
class CGreater_nCnt {
public:
bool operator()(const StNumCnt &lhs, const StNumCnt &rhs) {
return lhs.m_nCnt > rhs.m_nCnt;
}
};
void fnInput(vector<int> &rvnNum) {
int nNumS... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,033,342 | 1,033,344 | u439912527 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define INF 1000000001
int main() {
int n;
cin >> n;
n /= 2;
vector<int> e(100001), o(100001);
for (int i = 0; i < n * 2; i++) {
int v;
cin >> v;
if (i % 2 == 0) {
o[v]++;
} else
e[v]++;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define INF 1000000001
int main() {
int n;
cin >> n;
n /= 2;
vector<int> e(100001), o(100001);
for (int i = 0; i < n * 2; i++) {
int v;
cin >> v;
if (i % 2 == 0) {
o[v]++;
} else
e[v]++;
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,033,350 | 1,033,351 | u413396046 | cpp |
p03244 | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
// -fsanitize=undefinedでオーバーフロー検出,オーバーフローする入力を投げるとよい
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "Y... | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
// -fsanitize=undefinedでオーバーフロー検出,オーバーフローする入力を投げるとよい
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "Y... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,033,364 | 1,033,365 | u683769494 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
/// Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout << #var << " " << var << endl;
#define co(q) cout << q << endl;
#define all(q) (q).begin(), (q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9 + 7;
... | #include <bits/stdc++.h>
using namespace std;
/// Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout << #var << " " << var << endl;
#define co(q) cout << q << endl;
#define all(q) (q).begin(), (q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9 + 7;
... | [
"call.add"
] | 1,033,370 | 1,033,371 | u642657797 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
int n;
cin >> n;
V<P<int, int>> od(100010), ev(100010);
for (int i = 0; i < n; i++) {
int v;
cin >> v;
if (i & 1) {
od[v].first++;
od[v].se... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
int n;
cin >> n;
V<P<int, int>> od(100010), ev(100010);
for (int i = 0; i < n; i++) {
int v;
cin >> v;
if (i & 1) {
od[v].first++;
od[v].se... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,033,389 | 1,033,390 | u651235280 | cpp |
p03244 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
templa... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
templa... | [
"assignment.change"
] | 1,033,392 | 1,033,393 | u450883456 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<int, int> even;
map<int, int> odd;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
if (i % 2 == 0) {
if (even.count(v)) {
even[v] = even[v] + 1;
} else
even[v] = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<int, int> even;
map<int, int> odd;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
if (i % 2 == 0) {
if (even.count(v)) {
even[v] = even[v] + 1;
} else
even[v] = 1;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,033,396 | 1,033,397 | u732578115 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<int, int> even;
map<int, int> odd;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
if (i % 2 == 0) {
if (even.count(v)) {
even[v] = even[v] + 1;
} else
even[v] = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<int, int> even;
map<int, int> odd;
for (int i = 0; i < n; i++) {
int v;
cin >> v;
if (i % 2 == 0) {
if (even.count(v)) {
even[v] = even[v] + 1;
} else
even[v] = 1;
... | [
"variable_declaration.type.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,033,398 | 1,033,397 | u732578115 | cpp |
p03244 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> o(100010), e(100010);
rep(i, n) {
int v;
cin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> o(100010), e(100010);
rep(i, n) {
int v;
cin... | [
"call.function.change",
"call.arguments.change"
] | 1,033,399 | 1,033,400 | u309168663 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> v;
vector<long> u;
map<long, long> vmap;
map<long, long> umap;
long tmp;
for (long i = 0; i < n; ++i) {
cin >> tmp;
if (i % 2 == 0) {
v.push_back(tmp)... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> v;
vector<long> u;
map<long, long> vmap;
map<long, long> umap;
long tmp;
for (long i = 0; i < n; ++i) {
cin >> tmp;
if (i % 2 == 0) {
v.push_back(tmp)... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,033,412 | 1,033,413 | u860546679 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = 2147483647;
constexpr ll L_INF = 9223372036854775807LL;
//===
int main() {
int n;
cin >> n;
Vi v(n);
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = 2147483647;
constexpr ll L_INF = 9223372036854775807LL;
//===
int main() {
int n;
cin >> n;
Vi v(n);
for (int i = 0; i... | [
"assignment.variable.change",
"identifier.change",
"misc.opposites",
"assignment.value.change",
"call.function.change"
] | 1,033,424 | 1,033,425 | u067237725 | cpp |
p03244 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> A;
map<int, int> B;
for (int n = 0; n < N; ++n) {
int num;
cin >> num;
if (0 == n % 2) {
A[num]++;
} else {
B[num]++;
}
}
int A0 = 0;
int a0 = 0;
int A1 = 0;
int a1 = 0;
for (... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> A;
map<int, int> B;
for (int n = 0; n < N; ++n) {
int num;
cin >> num;
if (0 == n % 2) {
A[num]++;
} else {
B[num]++;
}
}
int A0 = 0;
int a0 = 0;
int A1 = 0;
int a1 = 0;
for (... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 1,033,430 | 1,033,431 | u835523614 | cpp |
p03244 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> A;
map<int, int> B;
for (int n = 0; n < N; ++n) {
int num;
cin >> num;
if (0 == n % 2) {
A[num]++;
} else {
B[num]++;
}
}
int A0 = 0;
int a0 = 0;
int A1 = 0;
int a1 = 0;
for (... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> A;
map<int, int> B;
for (int n = 0; n < N; ++n) {
int num;
cin >> num;
if (0 == n % 2) {
A[num]++;
} else {
B[num]++;
}
}
int A0 = 0;
int a0 = 0;
int A1 = 0;
int a1 = 0;
for (... | [
"control_flow.branch.if.condition.change",
"identifier.change",
"misc.opposites",
"assignment.value.change",
"call.function.change"
] | 1,033,432 | 1,033,431 | u835523614 | cpp |
p03244 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,441 | 1,033,442 | u153607901 | cpp |
p03244 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,443 | 1,033,442 | u153607901 | cpp |
p03244 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,444 | 1,033,442 | u153607901 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 1; i <= n; i++)
cin >> v[i];
const int N = 100010;
vector<int> o(N);
vector<int> e(N);
int o_maxNum_first = 0;
int o_maxNum_second = 0;
int o_maxValue;
int e_maxNum_first = 0;
int e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
const int N = 100010;
vector<int> o(N);
vector<int> e(N);
int o_maxNum_first = 0;
int o_maxNum_second = 0;
int o_maxValue;
int e_maxNum_first = 0;
int e_... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change"
] | 1,033,450 | 1,033,451 | u221391729 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 1; i <= n; i++)
cin >> v[i];
const int N = 100010;
vector<int> o(N);
vector<int> e(N);
int o_maxNum_first = 0;
int o_maxNum_second = 0;
int o_maxValue;
int e_maxNum_first = 0;
int e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i];
const int N = 100010;
vector<int> o(N);
vector<int> e(N);
int o_maxNum_first = 0;
int o_maxNum_second = 0;
int o_maxValue;
int e_maxNum_first = 0;
i... | [
"assignment.change"
] | 1,033,450 | 1,033,452 | u221391729 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> odd(1e5 + 1, 0), even(1e5 + 1, 0);
for (int i = 0; i < n; i += 2)
odd[v[i]]++;
for (int i = 1; i < n; i += 2)
ev... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> odd(1e5 + 1, 0), even(1e5 + 1, 0);
for (int i = 0; i < n; i += 2)
odd[v[i]]++;
for (int i = 1; i < n; i += 2)
ev... | [
"expression.operation.binary.add"
] | 1,033,458 | 1,033,459 | u765815947 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const st... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const st... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,466 | 1,033,467 | u223160139 | cpp |
p03244 | #include <bits/stdc++.h>
#define trace1(a) cout << #a << ": " << a << endl
#define trace2(a, b) cout << #a << ": " << a << " | ", trace1(b)
#define trace3(a, b, c) cout << #a << ": " << a << " | ", trace2(b, c)
#define trace4(a, b, c, d) cout << #a << ": " << a << " | ", trace3(b, c, d)
#define trace5(a, b, c, d, e) ... | #include <bits/stdc++.h>
#define trace1(a) cout << #a << ": " << a << endl
#define trace2(a, b) cout << #a << ": " << a << " | ", trace1(b)
#define trace3(a, b, c) cout << #a << ": " << a << " | ", trace2(b, c)
#define trace4(a, b, c, d) cout << #a << ": " << a << " | ", trace3(b, c, d)
#define trace5(a, b, c, d, e) ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"call.function.change"
] | 1,033,478 | 1,033,479 | u430494842 | cpp |
p03244 | #include <bits/stdc++.h>
#define trace1(a) cout << #a << ": " << a << endl
#define trace2(a, b) cout << #a << ": " << a << " | ", trace1(b)
#define trace3(a, b, c) cout << #a << ": " << a << " | ", trace2(b, c)
#define trace4(a, b, c, d) cout << #a << ": " << a << " | ", trace3(b, c, d)
#define trace5(a, b, c, d, e) ... | #include <bits/stdc++.h>
#define trace1(a) cout << #a << ": " << a << endl
#define trace2(a, b) cout << #a << ": " << a << " | ", trace1(b)
#define trace3(a, b, c) cout << #a << ": " << a << " | ", trace2(b, c)
#define trace4(a, b, c, d) cout << #a << ": " << a << " | ", trace3(b, c, d)
#define trace5(a, b, c, d, e) ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"call.function.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,033,480 | 1,033,479 | u430494842 | cpp |
p03244 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> even, odd;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
if (i % 2 == 0) {
even[v]++;
} else {
odd[v]++;
}
}
vector<pair<int, int>> v0, v... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> even, odd;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
if (i % 2 == 0) {
even[v]++;
} else {
odd[v]++;
}
}
vector<pair<int, int>> v0, v... | [
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,033,481 | 1,033,482 | u119098168 | cpp |
p03244 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
const int INF = 1000000007;
typedef long long ll;
using names... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
const int INF = 1000000007;
typedef long long ll;
using names... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"assignment.value.change",
"call.function.change"
] | 1,033,504 | 1,033,503 | u820341516 | cpp |
p03244 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
const int INF = 1000000007;
typedef long long ll;
using names... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
const int INF = 1000000007;
typedef long long ll;
using names... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"assignment.value.change",
"call.function.change"
] | 1,033,505 | 1,033,503 | u820341516 | cpp |
p03244 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
const int INF = 1000000007;
typedef long long ll;
using names... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
const int INF = 1000000007;
typedef long long ll;
using names... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,033,507 | 1,033,503 | u820341516 | cpp |
p03244 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template <typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template <typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,033,510 | 1,033,511 | u868099754 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
vector<map<int, int>> cnt(2);
for (int i = 0; i < N; i++) {
cnt[i & 1][V[i]]++;
}
vector<vector<pair<int, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
vector<map<int, int>> cnt(2);
for (int i = 0; i < N; i++) {
cnt[i & 1][V[i]]++;
}
vector<vector<pair<int, ... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,033,518 | 1,033,519 | u782098901 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v0(n / 2), v1(n / 2);
for (int i = 0; i < n / 2; i++) {
cin >> v0.at(i) >> v1.at(i);
}
vector<pair<int, int>> v0c(100001), v1c(100001);
for (int i = 0; i < n / 2; i++) {
v0c[v0.at(i)].f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v0(n / 2), v1(n / 2);
for (int i = 0; i < n / 2; i++) {
cin >> v0.at(i) >> v1.at(i);
}
vector<pair<int, int>> v0c(100001), v1c(100001);
for (int i = 0; i < n / 2; i++) {
v0c[v0.at(i)].f... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 1,033,531 | 1,033,532 | u526476325 | cpp |
p03244 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, a, b) for (int i = a; i < (b); ++i)
#define reprev(i, n) for (int i = n - 1; i >= 0; --i)
#define reprrev(i, a, b) for (int i = b - 1; i >= (a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, a, b) for (int i = a; i < (b); ++i)
#define reprev(i, n) for (int i = n - 1; i >= 0; --i)
#define reprrev(i, a, b) for (int i = b - 1; i >= (a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() ... | [
"assignment.variable.change",
"identifier.change"
] | 1,033,533 | 1,033,534 | u495903598 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int n;
vector<int> v;
void input() {
cin >> n;
v = vector<int>(n);
rep(i, n) cin >> v[i];
}
int main() {
input();
vector<pair<int, int>> w1, w2;
w1 = w2 = vector<pair<int, int>>(1e5 + ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int n;
vector<int> v;
void input() {
cin >> n;
v = vector<int>(n);
rep(i, n) cin >> v[i];
}
int main() {
input();
vector<pair<int, int>> w1, w2;
w1 = w2 = vector<pair<int, int>>(1e5 + ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,033,543 | 1,033,544 | u671861352 | cpp |
p03244 | // C
#include <cassert>
#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 <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cs... | // C
#include <cassert>
#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 <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cs... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.remove"
] | 1,033,558 | 1,033,559 | u685346012 | cpp |
p03244 | #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, ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,033,587 | 1,033,588 | u569690172 | cpp |
p03244 | #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, ... | [
"identifier.change",
"misc.opposites",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,033,589 | 1,033,588 | u569690172 | cpp |
p03244 | #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, ... | [
"identifier.change",
"literal.number.change",
"call.arguments.change",
"misc.opposites",
"call.function.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,033,590 | 1,033,588 | u569690172 | cpp |
p03244 | #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(int 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(int size) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,033,602 | 1,033,603 | u181806820 | cpp |
p03244 | #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(int 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(int size) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,033,604 | 1,033,603 | u181806820 | cpp |
p03244 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
// ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
// ... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,033,609 | 1,033,610 | u021034020 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define tl 1'000'000'007
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
map<int, int> A;
map<int,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define tl 1'000'000'007
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
map<int, int> A;
map<int,... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,033,613 | 1,033,614 | u852839243 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int cnt_odd[100010];
int cnt_even[100010];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int v;
cin >> v;
if (i % 2 == 1) {
cnt_odd[v]++;
} else {
cnt_even[v]++;
}
}
// 奇数番目の最頻値、2番目に多い値
int O1 = 0, O2 = 0... | #include <bits/stdc++.h>
using namespace std;
int cnt_odd[100010];
int cnt_even[100010];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int v;
cin >> v;
if (i % 2 == 1) {
cnt_odd[v]++;
} else {
cnt_even[v]++;
}
}
// 奇数番目の最頻値、2番目に多い値
int O1 = 0, O2 = 0... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,033,635 | 1,033,636 | u553129408 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
int guusuu[100005], kisuu[100005], mx1, mx2, x1, x2;
#define int long long
signed main() {
int n;
cin >> n;
int u;
for (int i = 0; i < n; i++) {
cin >> u;
if (i % 2 == 0) {
guusuu[u]++;
if (mx1 < guusuu[u]) {
mx1 = guusuu[u];
x1 =... | #include <bits/stdc++.h>
using namespace std;
int guusuu[100005], kisuu[100005], mx1, mx2, x1, x2;
#define int long long
signed main() {
int n;
cin >> n;
int u;
for (int i = 0; i < n; i++) {
cin >> u;
if (i % 2 == 0) {
guusuu[u]++;
if (mx1 < guusuu[u]) {
mx1 = guusuu[u];
x1 ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,033,639 | 1,033,640 | u237390401 | cpp |
p03244 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,033,641 | 1,033,642 | u965730380 | cpp |
p03244 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN =... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN =... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,033,645 | 1,033,646 | u348398921 | cpp |
p03244 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN =... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN =... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,033,645 | 1,033,647 | u348398921 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
... | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
... | [
"call.add"
] | 1,033,678 | 1,033,679 | u787139585 | cpp |
p03244 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,033,690 | 1,033,691 | u809967037 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<pair<int, int>> K;
vector<pair<int, int>> G;
vector<int> KI(n / 2);
vector<int> GU(n / 2);
for (int i = 0; i < n / 2; i++) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<pair<int, int>> K;
vector<pair<int, int>> G;
vector<int> KI(n / 2);
vector<int> GU(n / 2);
for (int i = 0; i < n / 2; i++) {... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change",
"call.function.change"
] | 1,033,695 | 1,033,696 | u028061225 | cpp |
p03244 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(), (v).end()
using namespace std;
const double ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(), (v).end()
using namespace std;
const double ... | [
"identifier.change",
"io.output.change"
] | 1,033,714 | 1,033,715 | u863717702 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
int n;
cin >> n;
map<int, int> odd, even;
rep(i, n) {
int a;
cin >> a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
int n;
cin >> n;
map<int, int> odd, even;
rep(i, n) {
int a;
cin >> a... | [
"assignment.value.change",
"identifier.change"
] | 1,033,726 | 1,033,727 | u877494916 | cpp |
p03244 | #define _USE_MATH_DEFINES
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <complex>
#include <iterator>
#include <sstream>
#include <bitset>
#include <cstring>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <set>
... | #define _USE_MATH_DEFINES
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <complex>
#include <iterator>
#include <sstream>
#include <bitset>
#include <cstring>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <set>
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,033,755 | 1,033,756 | u870307668 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 1000... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 1000... | [
"call.arguments.add"
] | 1,033,761 | 1,033,762 | u980909653 | cpp |
p03244 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,778 | 1,033,779 | u729166490 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> V;
#define rep(s, e) for (ll i = s; i < e; i++)
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll INF = 100000000000009;
ll i;
int main() {
ll N;
cin >> N;
V v(N);
rep(0, N) cin >> v.at(i);
map<ll, ll> sa, sb;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> V;
#define rep(s, e) for (ll i = s; i < e; i++)
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll INF = 100000000000009;
ll i;
int main() {
ll N;
cin >> N;
V v(N);
rep(0, N) cin >> v.at(i);
map<ll, ll> sa, sb;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,033,823 | 1,033,824 | u696486967 | cpp |
p03244 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
i... | [] | 1,033,832 | 1,033,833 | u584139221 | cpp |
p03244 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,033,837 | 1,033,838 | u631558039 | cpp |
p03244 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
map<int, int> num1, num2;
for (int i = 0; i < n; i++) {
if (i & 1) {
if (num1.count... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
map<int, int> num1, num2;
for (int i = 0; i < n; i++) {
if (i & 1) {
if (num1.count... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,033,839 | 1,033,840 | u828593789 | cpp |
p03243 | /*
I just got lost in thought. It was unfamiliar territory.
- Steven Wright
*/
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#include <iostream>
#include <istream>
#include... | /*
I just got lost in thought. It was unfamiliar territory.
- Steven Wright
*/
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#include <iostream>
#include <istream>
#include... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,033,843 | 1,033,844 | u372798233 | cpp |
p03243 | #include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <string>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; ... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <string>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; ... | [
"control_flow.break.add"
] | 1,033,858 | 1,033,859 | u612721349 | cpp |
p03243 | #include <iostream>
using namespace std;
int N;
int main() {
cin >> N;
cout << (N + 110) / 111 << endl;
} | #include <iostream>
using namespace std;
int N;
int main() {
cin >> N;
cout << ((N + 110) / 111) * 111 << endl;
} | [
"expression.operation.binary.add"
] | 1,033,862 | 1,033,863 | u623954643 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
#define lp(i, x, n) for (int i = x; i < (int)n; ++i)
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
#define ll long long
#define N 111
int n;
int eq(int hw) {
int nm = (hw * 10 + hw);
int nm2 = (nm * 10 + hw);
return nm2;
}
int main() {
cin >> n... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, x, n) for (int i = x; i < (int)n; ++i)
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
#define ll long long
#define N 111
int n;
int eq(int hw) {
int nm = (hw * 10 + hw);
int nm2 = (nm * 10 + hw);
return nm2;
}
int main() {
cin >> n... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,864 | 1,033,865 | u972547684 | cpp |
p03243 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
int ans = 0;
cin >> n;
for (int i = 0; i < 9; i++) {
if (n <= 100 * i + 10 * i + i) {
ans = i;
break;
}
}
cout << 100 * ans + 10 * ans + ans << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
int ans = 0;
cin >> n;
for (int i = 1; i < 10; i++) {
if (n <= 100 * i + 10 * i + i) {
ans = i;
break;
}
}
cout << 100 * ans + 10 * ans + ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,033,866 | 1,033,867 | u904833081 | cpp |
p03243 | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> A = {111, 222, 333, 444, 555, 666, 777, 888, 999};
int N;
cin >> N;
for (int i = 0; i < A.size(); i++) {
if (N >= A[i]) {
cout << A[i] << endl;
return 0;
}
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> A = {111, 222, 333, 444, 555, 666, 777, 888, 999};
int N;
cin >> N;
for (int i = 0; i < A.size(); i++) {
if (N <= A[i]) {
cout << A[i] << endl;
return 0;
}
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,872 | 1,033,873 | u745250049 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int b, a[9] = {111, 222, 333, 444, 555, 666, 777, 888, 999};
cin >> b;
cout << a[b / 111] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int b, a[9] = {111, 222, 333, 444, 555, 666, 777, 888, 999};
cin >> b;
cout << a[(b - 1) / 111] << endl;
} | [] | 1,033,874 | 1,033,875 | u073398103 | cpp |
p03243 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | [] | 1,033,876 | 1,033,877 | u141378465 | cpp |
p03243 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
... | [
"expression.operation.binary.add"
] | 1,033,880 | 1,033,881 | u548624367 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 111; i <= 999; i += 111) {
if (i >= n) {
cout << i << endl;
}
}
return 0;
}
static int speedUp = []() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
return 0;
}(); | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 111; i <= 999; i += 111) {
if (i >= n) {
cout << i << endl;
break;
}
}
return 0;
}
static int speedUp = []() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
return 0;
}()... | [
"control_flow.break.add"
] | 1,033,888 | 1,033,889 | u666721654 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= 10; ++i) {
if (i * 111 > n) {
cout << i * 111 << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= 10; ++i) {
if (i * 111 >= n) {
cout << i * 111 << endl;
return 0;
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,892 | 1,033,893 | u604693716 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i < 10; ++i) {
if (i * 111 > n) {
cout << i * 111 << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= 10; ++i) {
if (i * 111 >= n) {
cout << i * 111 << endl;
return 0;
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,033,894 | 1,033,893 | u604693716 | cpp |
p03243 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 1; i < 11; i++) {
if ((i * 100) + (i * 10) + 1 >= N) {
cout << (i * 100) + (i * 10) + i << endl;
break;
}
}
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 1; i < 11; i++) {
if ((i * 100) + (i * 10) + i >= N) {
cout << (i * 100) + (i * 10) + i << endl;
break;
}
}
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,033,909 | 1,033,910 | u343355096 | cpp |
p03243 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int a;
cin >> a;
int ans;
for (int i = a; i < 999; i++) {
if (i % 111 == 0) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int a;
cin >> a;
int ans;
for (int i = a; i <= 999; i++) {
if (i % 111 == 0) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,033,915 | 1,033,916 | u391202061 | cpp |
p03243 | #include <iostream>
#include <map>
using namespace std;
#define pi 3.14159265
int main() {
long long ans = 0, i = 0, j = 0, k = 0, n, max = 1;
cin >> n;
i = n / 100;
n %= 100;
j = n / 10;
n %= 10;
k = n;
if (i > j)
max = i;
else if (i == j) {
if (i > k)
max = i;
else
max = i... | #include <iostream>
#include <map>
using namespace std;
#define pi 3.14159265
int main() {
long long ans = 0, i = 0, j = 0, k = 0, n, max = 1;
cin >> n;
i = n / 100;
n %= 100;
j = n / 10;
n %= 10;
k = n;
if (i > j)
max = i;
else if (i == j) {
if (i >= k)
max = i;
else
max = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,919 | 1,033,920 | u932175579 | cpp |
p03243 | #include <iostream>
#include <map>
using namespace std;
#define pi 3.14159265
int main() {
long long ans = 0, i = 0, j = 0, k = 0, n, max = 1;
cin >> n;
i = n / 100;
n %= 100;
j = n / 10;
n %= 10;
k = n;
if (i > j)
max = i;
else if (i == j) {
if (i > k)
max = i;
else
max = i... | #include <iostream>
#include <map>
using namespace std;
#define pi 3.14159265
int main() {
long long ans = 0, i = 0, j = 0, k = 0, n, max = 1;
cin >> n;
i = n / 100;
n %= 100;
j = n / 10;
n %= 10;
k = n;
if (i > j)
max = i;
else if (i == j) {
if (i >= k)
max = i;
else
max = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"assignment.change"
] | 1,033,921 | 1,033,920 | u932175579 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, e) for (int(i) = (s); (i) <= (e); (i)++)
#define RFOR(i, s, e) for (int(i) = (s); (i) >= (e); (i)--)
#define rep(i, n) FOR(i, 0, n - 1)
signed main() {
int n;
cin >> n;
while (n++) {
if (n / 100 == n / 10 % 10 && n / 100 ==... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, e) for (int(i) = (s); (i) <= (e); (i)++)
#define RFOR(i, s, e) for (int(i) = (s); (i) >= (e); (i)--)
#define rep(i, n) FOR(i, 0, n - 1)
signed main() {
int n;
cin >> n;
while (n) {
if (n / 100 == n / 10 % 10 && n / 100 == n... | [
"control_flow.loop.condition.change",
"expression.unary.arithmetic.add"
] | 1,033,931 | 1,033,932 | u566529875 | cpp |
p03243 | #include <iostream>
using namespace std;
int a[] = {111, 222, 333, 444, 555, 666, 777, 888, 999};
int main() {
int n, m;
cin >> n;
for (int i = 0; i < 9; i++)
if (a[i] > n) {
m = a[i];
break;
}
cout << m << endl;
return 0;
} | #include <iostream>
using namespace std;
int a[] = {111, 222, 333, 444, 555, 666, 777, 888, 999};
int main() {
int n, m;
cin >> n;
for (int i = 0; i < 9; i++)
if (a[i] >= n) {
m = a[i];
break;
}
cout << m << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,937 | 1,033,938 | u176446106 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
float N;
cin >> N;
int a = N;
for (int i = 0; i < 9; i++) {
if (a / 100 == i && N / 111 > i) {
cout << 111 * (i + 1);
break;
} else if (N / 111 < i) {
cout << 111 * i;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
float N;
cin >> N;
int a = N;
for (int i = 1; i < 10; i++) {
if (a / 100 == i && N / 111 > i) {
cout << 111 * (i + 1);
break;
} else if (N / 111 <= i) {
cout << 111 * i;
break;
}
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,944 | 1,033,943 | u441250130 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int a[3];
a[0] = n % 10;
a[1] = n / 10 % 10;
a[2] = n / 100;
for (i = a[2] - 1; i < 10; i++) {
j = i + 1;
if ((n < (j * 100 + j * 10 + j)) && (n > (i * 100 + i * 10 + i))) {
break;
}
}
cout << j * 100 + j * ... | #include <iostream>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int a[3];
a[0] = n % 10;
a[1] = n / 10 % 10;
a[2] = n / 100;
for (i = a[2] - 1; i < 10; i++) {
j = i + 1;
if ((n <= (j * 100 + j * 10 + j)) && (n > (i * 100 + i * 10 + i))) {
break;
}
}
cout << j * 100 + j *... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,952 | 1,033,953 | u989654188 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i = 111;
cin >> N;
while (true) {
int a = i - N;
if (a > 0) {
cout << i << endl;
break;
} else {
i += 111;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i = 111;
cin >> N;
while (true) {
int a = i - N;
if (a >= 0) {
cout << i << endl;
break;
} else {
i += 111;
}
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,954 | 1,033,955 | u815026012 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i = 111;
cin >> N;
while (true) {
int a = i - N;
if (a > 0) {
cout << a << endl;
break;
} else {
i += 111;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i = 111;
cin >> N;
while (true) {
int a = i - N;
if (a >= 0) {
cout << i << endl;
break;
} else {
i += 111;
}
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 1,033,957 | 1,033,955 | u815026012 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.