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 |
|---|---|---|---|---|---|---|---|
p02962 | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdi... | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdi... | [
"literal.number.change",
"function.return_value.change",
"expression.operation.binary.change",
"identifier.change"
] | 770,907 | 770,908 | u708618797 | cpp |
p02962 | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdi... | //#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdi... | [
"identifier.change",
"function.return_value.change",
"literal.number.change"
] | 770,909 | 770,908 | u708618797 | cpp |
p02962 | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x)) % modulo)
#define Inf 10000000000000000
struct rolling_hash {
vector<long long> h;
vector<vector<long long>> t_hash;
vector<vector<long long>> power;
long long b;
string t;
rolling_hash(string ... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x)) % modulo)
#define Inf 10000000000000000
struct rolling_hash {
vector<long long> h;
vector<vector<long long>> t_hash;
vector<vector<long long>> power;
long long b;
string t;
rolling_hash(string ... | [
"assignment.add"
] | 770,918 | 770,919 | u118797367 | cpp |
p02962 | #include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <deque> // deque
#include <functional> // std::function<void(int)>
#include <iomanip> // cout<<setprecision(n)
#in... | #include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <deque> // deque
#include <functional> // std::function<void(int)>
#include <iomanip> // cout<<setprecision(n)
#in... | [
"call.remove"
] | 770,929 | 770,930 | u128456980 | cpp |
p02962 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int... | [
"assignment.add"
] | 770,955 | 770,956 | u050865477 | cpp |
p02962 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <v... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <v... | [
"assignment.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 770,985 | 770,984 | u090994275 | cpp |
p02962 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) x.begin(), x.end()
#define db(x) cout << #x << "=" << x << endl
#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, n, m) for (int i = n; i >= m; i--)
#define INF (1e9)
#defin... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) x.begin(), x.end()
#define db(x) cout << #x << "=" << x << endl
#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, n, m) for (int i = n; i >= m; i--)
#define INF (1e9)
#defin... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 770,986 | 770,987 | u556276145 | cpp |
p02962 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) x.begin(), x.end()
#define db(x) cout << #x << "=" << x << endl
#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, n, m) for (int i = n; i >= m; i--)
#define INF (1e9)
#defin... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) x.begin(), x.end()
#define db(x) cout << #x << "=" << x << endl
#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, n, m) for (int i = n; i >= m; i--)
#define INF (1e9)
#defin... | [
"call.add",
"call.arguments.change"
] | 770,991 | 770,987 | u556276145 | cpp |
p02962 | // By Hacheylight
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | // By Hacheylight
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.remove"
] | 771,003 | 771,004 | u049262741 | cpp |
p02962 | /*********************
* Author: xuziyuan *
*********************/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define LL long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
#d... | /*********************
* Author: xuziyuan *
*********************/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define LL long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
#d... | [
"identifier.change",
"call.arguments.change"
] | 771,009 | 771,010 | u977365687 | cpp |
p02962 | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
// A[i] := SとSのi文字目以降の最長共通接頭辞の長さ
//としたものを返す
//参考:http://snuke.hatenablog.com/entry/2014/12/03/214243
vector<ll> Z_algorithm(const string &S) {
vector<ll> A(S.size());
A[0] = S.size();
ll i = 1, j = 0;
while (i < S.size()) {
while (i + j < S.... | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
// A[i] := SとSのi文字目以降の最長共通接頭辞の長さ
//としたものを返す
//参考:http://snuke.hatenablog.com/entry/2014/12/03/214243
vector<ll> Z_algorithm(const string &S) {
vector<ll> A(S.size());
A[0] = S.size();
ll i = 1, j = 0;
while (i < S.size()) {
while (i + j < S.... | [
"expression.operation.binary.remove",
"assignment.change"
] | 771,015 | 771,016 | u456065785 | cpp |
p02962 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
template <typename T> vector<int> build_kmp(const T &s) {
vector<int> f(s.size());
int fp = f[0] = -1;
for (int i = 1; i < s.size(); ++i) {
while (~fp && s[fp + 1] != s[i])
fp = f[fp];
if (s[fp + 1] == s[i])
++fp;
f[i]... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
template <typename T> vector<int> build_kmp(const T &s) {
vector<int> f(s.size());
int fp = f[0] = -1;
for (int i = 1; i < s.size(); ++i) {
while (~fp && s[fp + 1] != s[i])
fp = f[fp];
if (s[fp + 1] == s[i])
++fp;
f[i]... | [
"expression.operation.binary.remove"
] | 771,025 | 771,026 | u459737327 | cpp |
p02962 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | [
"literal.number.change",
"expression.operation.binary.change"
] | 771,051 | 771,052 | u500496457 | cpp |
p02962 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | [
"literal.number.change",
"expression.operation.binary.change"
] | 771,053 | 771,052 | u500496457 | cpp |
p02962 | #include <bits/stdc++.h>
using namespace std;
vector<int> Z_Algorithm(string &s) {
vector<int> ret(s.size());
for (int i = 1, j = 0; i < s.size(); i++) {
if (i + ret[i - j] < j + ret[j]) {
ret[i] = ret[i - j];
} else {
int k = max(0, j + ret[j] - i);
while (i + k < s.size() && s[k] == s[i... | #include <bits/stdc++.h>
using namespace std;
vector<int> Z_Algorithm(string &s) {
vector<int> ret(s.size());
for (int i = 1, j = 0; i < s.size(); i++) {
if (i + ret[i - j] < j + ret[j]) {
ret[i] = ret[i - j];
} else {
int k = max(0, j + ret[j] - i);
while (i + k < s.size() && s[k] == s[i... | [
"assignment.change"
] | 771,058 | 771,059 | u521364030 | cpp |
p02962 | // #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimize("unroll-loops")
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
vi init(string &P) {
vi b(P.size() + 1);
int i = 0, j = -1;
b[0] = -1;
while (i... | // #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimize("unroll-loops")
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
vi init(string &P) {
vi b(P.size() + 1);
int i = 0, j = -1;
b[0] = -1;
while (i... | [
"expression.operation.binary.remove"
] | 771,065 | 771,066 | u562319622 | cpp |
p02964 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(), a.end()
#define SZ(a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(), a.end()
#define SZ(a)... | [
"control_flow.branch.if.condition.change"
] | 771,908 | 771,909 | u194908943 | cpp |
p02964 | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | [
"expression.operation.binary.remove"
] | 771,949 | 771,950 | u543167400 | cpp |
p02964 | #ifndef LOCAL
#pragma GCC optimize("Ofast")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stac... | #ifndef LOCAL
#pragma GCC optimize("Ofast")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stac... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 771,955 | 771,956 | u629015299 | cpp |
p02964 | // ███▓▓▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓╬╬╬╬╬╬▓█
// ███▓███████▓▓╬╬╬╬╬╬╬╬╬╬╬╬▓███▓▓▓▓█▓╬╬╬▓█
// ███████▓█████▓▓╬╬╬╬╬╬╬╬▓███▓╬╬╬╬╬╬╬▓╬╬▓█
// ████▓▓▓▓╬╬▓█████╬╬╬╬╬╬███▓╬╬╬╬╬╬╬╬╬╬╬╬╬█
// ███▓▓▓▓╬╬╬╬╬╬▓██╬╬╬╬╬╬▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓█
// ████▓▓▓╬╬╬╬╬╬╬▓█▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓█
// ███▓█▓███████▓▓███▓╬╬╬╬╬╬▓███████▓╬╬╬╬▓█
// █████████... | // ███▓▓▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓╬╬╬╬╬╬▓█
// ███▓███████▓▓╬╬╬╬╬╬╬╬╬╬╬╬▓███▓▓▓▓█▓╬╬╬▓█
// ███████▓█████▓▓╬╬╬╬╬╬╬╬▓███▓╬╬╬╬╬╬╬▓╬╬▓█
// ████▓▓▓▓╬╬▓█████╬╬╬╬╬╬███▓╬╬╬╬╬╬╬╬╬╬╬╬╬█
// ███▓▓▓▓╬╬╬╬╬╬▓██╬╬╬╬╬╬▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓█
// ████▓▓▓╬╬╬╬╬╬╬▓█▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓█
// ███▓█▓███████▓▓███▓╬╬╬╬╬╬▓███████▓╬╬╬╬▓█
// █████████... | [] | 771,957 | 771,958 | u135773862 | cpp |
p02964 | #include <bits/stdc++.h> // Tomasz Nowak
using namespace std; // XIII LO Szczecin
using LL = long long; // Poland
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
template <class T> int size(T &&x) { return int(x.size()); }
template <class A, class B>
ostream &operator<<(o... | #include <bits/stdc++.h> // Tomasz Nowak
using namespace std; // XIII LO Szczecin
using LL = long long; // Poland
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
template <class T> int size(T &&x) { return int(x.size()); }
template <class A, class B>
ostream &operator<<(o... | [
"call.arguments.change",
"variable_declaration.type.change"
] | 771,959 | 771,960 | u412965895 | cpp |
p02964 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#i... | [
"identifier.change"
] | 771,973 | 771,974 | u094022977 | cpp |
p02964 | #include <bits/stdc++.h>
using namespace std;
const int MX = 200000;
int a[MX], fst[MX + 1], lst[MX + 1], seen[MX + 1];
int main() {
int n;
long long k;
ignore = scanf("%d %lld", &n, &k);
for (int i = 0; i < n; i++)
ignore = scanf("%d", a + i);
fill(lst, lst + n + 1, -1);
fst[n] = -1;
for (int i... | #include <bits/stdc++.h>
using namespace std;
const int MX = 200000;
int a[MX], fst[MX + 1], lst[MX + 1], seen[MX + 1];
int main() {
int n;
long long k;
ignore = scanf("%d %lld", &n, &k);
for (int i = 0; i < n; i++)
ignore = scanf("%d", a + i);
fill(lst, lst + MX + 1, -1);
fst[n] = -1;
for (int ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 771,977 | 771,978 | u037304230 | cpp |
p02964 | #include <bits/stdc++.h>
using namespace std;
const int MX = 200000;
int a[MX], fst[MX + 1], lst[MX + 1], seen[MX + 1];
int main() {
int n;
long long k;
ignore = scanf("%d %lld", &n, &k);
for (int i = 0; i < n; i++)
ignore = scanf("%d", a + i);
fill(lst, lst + n, -1);
fst[n] = -1;
for (int i = n... | #include <bits/stdc++.h>
using namespace std;
const int MX = 200000;
int a[MX], fst[MX + 1], lst[MX + 1], seen[MX + 1];
int main() {
int n;
long long k;
ignore = scanf("%d %lld", &n, &k);
for (int i = 0; i < n; i++)
ignore = scanf("%d", a + i);
fill(lst, lst + MX + 1, -1);
fst[n] = -1;
for (int ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 771,979 | 771,978 | u037304230 | cpp |
p02965 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using VVbo = vector<Vbo>;
using VV... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using VVbo = vector<Vbo>;
using VV... | [
"call.add",
"call.arguments.add"
] | 771,980 | 771,981 | u366381207 | cpp |
p02965 | //雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll, ll>
#define iii pair<ii, ll>
#define fi first
#define se se... | //雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll, ll>
#define iii pair<ii, ll>
#define fi first
#define se se... | [
"literal.number.change",
"variable_declaration.value.change"
] | 771,987 | 771,988 | u780811667 | cpp |
p02965 | //雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll, ll>
#define iii pair<ii, ll>
#define fi first
#define se se... | //雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll, ll>
#define iii pair<ii, ll>
#define fi first
#define se se... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"call.arguments.change"
] | 771,989 | 771,988 | u780811667 | cpp |
p02965 | #include <bits/stdc++.h>
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 = 10e17;
#define cmin(x... | #include <bits/stdc++.h>
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 = 10e17;
#define cmin(x... | [
"literal.number.change",
"variable_declaration.value.change"
] | 771,998 | 771,999 | u564182781 | cpp |
p02964 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <u... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <u... | [] | 772,089 | 772,090 | u508571192 | cpp |
p02965 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD 998244353
ll N, M;
ll Fa[5050505];
ll i, j, k, ans;
ll moddiv(l... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD 998244353
ll N, M;
ll Fa[5050505];
ll i, j, k, ans;
ll moddiv(l... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 772,103 | 772,104 | u259396003 | cpp |
p02965 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define int long long
#define ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define int long long
#define ... | [
"literal.number.change",
"call.arguments.change"
] | 772,111 | 772,112 | u179970156 | cpp |
p02965 | #include <iostream>
using namespace std;
typedef long long ll;
ll mod = 998244353;
ll fac[3000010];
ll modinv(ll a) {
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
void modfac() {
... | #include <iostream>
using namespace std;
typedef long long ll;
ll mod = 998244353;
ll fac[3000010];
ll modinv(ll a) {
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
void modfac() {
... | [
"expression.operation.binary.add"
] | 772,113 | 772,114 | u179970156 | cpp |
p02965 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 998244353;
const LL LINF = 1LL << 60;
con... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 998244353;
const LL LINF = 1LL << 60;
con... | [
"control_flow.loop.for.initializer.change",
"call.remove",
"call.arguments.change"
] | 772,156 | 772,157 | u640323045 | cpp |
p02965 | #include <bits/stdc++.h>
using namespace std;
const int N = 1000005, P = 998244353;
int n, m, fac[2 * N], ifac[2 * N];
int power(int a, int x) {
int ans = 1;
for (; x; x >>= 1, a = 1LL * a * a % P)
if (x & 1)
ans = 1LL * ans * a % P;
return ans;
}
int binom(int n, int m) {
return n < m || m < 0 ? 0 ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1000005, P = 998244353;
int n, m, fac[2 * N], ifac[2 * N];
int power(int a, int x) {
int ans = 1;
for (; x; x >>= 1, a = 1LL * a * a % P)
if (x & 1)
ans = 1LL * ans * a % P;
return ans;
}
int binom(int n, int m) {
return n < m || m < 0 ? 0 ... | [
"call.arguments.change"
] | 772,160 | 772,161 | u760178976 | cpp |
p02965 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string.h>
#define N 2000005
using namespace std;
typedef long long ll;
const int mod = 998244353;
int n, m;
ll f[N], inv[N];
ll C(int n, int m) { return f[n] * inv[m] % mod * inv[n - m] % mod; }
ll solve(int n, int m) {
ll ans = 0;
... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string.h>
#define N 2000005
using namespace std;
typedef long long ll;
const int mod = 998244353;
int n, m;
ll f[N], inv[N];
ll C(int n, int m) { return f[n] * inv[m] % mod * inv[n - m] % mod; }
ll solve(int n, int m) {
ll ans = 0;
... | [
"control_flow.loop.for.condition.change"
] | 772,168 | 772,169 | u743451419 | cpp |
p02965 | #include <bits/stdc++.h>
using namespace std;
long long ans, n, m, mod = 998244353ll, fact[5000005], invfact[5000005], tmp;
long long fastp(long long base, long long exp) {
if (exp == 0)
return 1ll;
long long tmp2 = fastp(base, exp / 2ll);
tmp2 = (tmp2 * tmp2) % mod;
if (exp % 2 == 1)
tmp2 *= base;
... | #include <bits/stdc++.h>
using namespace std;
long long ans, n, m, mod = 998244353ll, fact[5000005], invfact[5000005], tmp;
long long fastp(long long base, long long exp) {
if (exp == 0)
return 1ll;
long long tmp2 = fastp(base, exp / 2ll);
tmp2 = (tmp2 * tmp2) % mod;
if (exp % 2 == 1)
tmp2 *= base;
... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"assignment.change"
] | 772,182 | 772,183 | u036145426 | cpp |
p02965 | #include <bits/stdc++.h>
using namespace std;
long long ans, n, m, mod = 998244353ll, fact[5000005], invfact[5000005], tmp;
long long fastp(long long base, long long exp) {
if (exp == 0)
return 1ll;
long long tmp2 = fastp(base, exp / 2ll);
tmp2 = (tmp2 * tmp2) % mod;
if (exp % 2 == 1)
tmp2 *= base;
... | #include <bits/stdc++.h>
using namespace std;
long long ans, n, m, mod = 998244353ll, fact[5000005], invfact[5000005], tmp;
long long fastp(long long base, long long exp) {
if (exp == 0)
return 1ll;
long long tmp2 = fastp(base, exp / 2ll);
tmp2 = (tmp2 * tmp2) % mod;
if (exp % 2 == 1)
tmp2 *= base;
... | [
"assignment.change"
] | 772,184 | 772,183 | u036145426 | cpp |
p02965 | #include <iostream>
#define llint long long
#define mod 998244353
using namespace std;
llint n, m;
const int FACT_MAX = 4000005;
llint fact[FACT_MAX], fact_inv[FACT_MAX];
llint modpow(llint a, llint n) {
if (n == 0)
return 1;
if (n % 2) {
return ((a % mod) * (modpow(a, n - 1) % mod)) % mod;
} else {
... | #include <iostream>
#define llint long long
#define mod 998244353
using namespace std;
llint n, m;
const int FACT_MAX = 4000005;
llint fact[FACT_MAX], fact_inv[FACT_MAX];
llint modpow(llint a, llint n) {
if (n == 0)
return 1;
if (n % 2) {
return ((a % mod) * (modpow(a, n - 1) % mod)) % mod;
} else {
... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 772,187 | 772,188 | u319282133 | cpp |
p02965 | #include <bits/stdc++.h>
using namespace std;
const int N = 3000300;
const int mod = 998244353;
void add(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
}
void sub(int &x, int y) {
x -= y;
if (x < 0)
x += mod;
}
int mul(int x, int y) { return (long long)x * y % mod; }
int pw(int x, int y) {
int... | #include <bits/stdc++.h>
using namespace std;
const int N = 3000300;
const int mod = 998244353;
void add(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
}
void sub(int &x, int y) {
x -= y;
if (x < 0)
x += mod;
}
int mul(int x, int y) { return (long long)x * y % mod; }
int pw(int x, int y) {
int... | [
"control_flow.loop.for.update.change",
"assignment.change"
] | 772,191 | 772,192 | u434765267 | cpp |
p02965 | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
constexpr ll MOD = 998244353;
class Combination {
public:
Combination(ll max_num) {
fact_.resize(max_num + 1, 1);
inv_fact_.resize(max_num + 1, 1);
for (ll i = 2; i <= max_num; i++) {
fact_[i] = i * fact_[i - 1] % MOD;
inv_fac... | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
constexpr ll MOD = 998244353;
class Combination {
public:
Combination(ll max_num) {
fact_.resize(max_num + 1, 1);
inv_fact_.resize(max_num + 1, 1);
for (ll i = 2; i <= max_num; i++) {
fact_[i] = i * fact_[i - 1] % MOD;
inv_fac... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 772,205 | 772,206 | u456065785 | cpp |
p02965 | #include <bits/stdc++.h>
using namespace std;
const int N = 3 * 1000 * 1000 + 17;
const int MOD = 1000 * 1000 * 1000 + 7;
const int M = 998244353;
int n, m;
long long F[N];
bool read() {
if (!(cin >> n >> m))
return false;
return true;
}
long long naive() {
vector<vector<vector<long long>>> dp(
n ... | #include <bits/stdc++.h>
using namespace std;
const int N = 5 * 1000 * 1000 + 17;
const int MOD = 1000 * 1000 * 1000 + 7;
const int M = 998244353;
int n, m;
long long F[N];
bool read() {
if (!(cin >> n >> m))
return false;
return true;
}
long long naive() {
vector<vector<vector<long long>>> dp(
n ... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 772,214 | 772,215 | u138919616 | cpp |
p02965 | #include <iostream>
using namespace std;
typedef long long ll;
#define M 998244353
#define Z 3000000
ll pot(int a, int b) {
if (b == 0)
return 1;
ll x = pot(a, b / 2);
x = x * x % M;
if (b % 2)
x = x * a % M;
return x;
}
ll inv(ll x) { return pot(x, M - 2); }
ll ff[Z + 1];
ll ii[Z + 1];
ll ncr... | #include <iostream>
using namespace std;
typedef long long ll;
#define M 998244353
#define Z 3000000
ll pot(int a, int b) {
if (b == 0)
return 1;
ll x = pot(a, b / 2);
x = x * x % M;
if (b % 2)
x = x * a % M;
return x;
}
ll inv(ll x) { return pot(x, M - 2); }
ll ff[Z + 1];
ll ii[Z + 1];
ll ncr... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 772,216 | 772,217 | u068910003 | cpp |
p02965 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"assignment.add"
] | 772,244 | 772,245 | u352642493 | cpp |
p02965 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X)... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X)... | [
"assignment.add"
] | 772,250 | 772,251 | u205561862 | cpp |
p02966 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 510;
int n, a[maxn][maxn];
long long suma[maxn][maxn], sumb[maxn][maxn], f[maxn][maxn], ans = 1e18;
inline int getsum(int a, int b, int c) {
return sumb[b + 1][c] + suma[n][b] - suma[n][a] + suma[c][a] - suma[c][b];
}
int main() {
cin >> n;
for (int i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 510;
int n, a[maxn][maxn];
long long suma[maxn][maxn], sumb[maxn][maxn], f[maxn][maxn], ans = 1e18;
inline long long getsum(int a, int b, int c) {
return sumb[b + 1][c] + suma[n][b] - suma[n][a] + suma[c][a] - suma[c][b];
}
int main() {
cin >> n;
for ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 772,254 | 772,255 | u177525366 | cpp |
p02969 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.141592653589793
// vector < vector<int>>a(0, vector<int>(0));二次元配列宣言
int main() {
int r;
cout << 3 * r * r << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.141592653589793
// vector < vector<int>>a(0, vector<int>(0));二次元配列宣言
int main() {
int r;
cin >> r;
cout << 3 * r * r << endl;
} | [] | 772,256 | 772,257 | u477156071 | cpp |
p02969 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pf(n) printf("%d\n", n)
typedef long long ll;
typedef pair<ll, ll> p;
const in... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pf(n) printf("%d\n", n)
typedef long long ll;
typedef pair<ll, ll> p;
const in... | [
"expression.operation.binary.remove"
] | 772,272 | 772,273 | u770486670 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long int ll;
typedef unsigned long long int ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
string s, t;
cin >> a;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long int ll;
typedef unsigned long long int ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
string s, t;
cin >> a;... | [
"expression.operation.binary.remove"
] | 772,276 | 772,277 | u906199847 | cpp |
p02968 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(2 * N), R(2 * N);
for (int i = 0; i < 2 * N; ++i) {
while (L[i] * L[i] + i * i < N * N)
++L[i];
while (R[i] < 2 * N && R[i] * R[i] + i * i <= 4 * N * N)
++R[i];... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(2 * N), R(2 * N);
for (int i = 0; i < 2 * N; ++i) {
while (L[i] * L[i] + i * i < N * N)
++L[i];
while (R[i] < 2 * N && R[i] * R[i] + i * i <= 4 * N * N)
++R[i];... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 772,290 | 772,291 | u837745858 | cpp |
p02969 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long int;
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll r;
cout << 3 * r * r << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long int;
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll r;
cin >> r;
cout << 3 * r * r << endl;
} | [] | 772,313 | 772,314 | u167245594 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
cin >> a;
cout << 2 * pow(a, 2) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
cin >> a;
cout << 3 * pow(a, 2) << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 772,320 | 772,321 | u319965179 | cpp |
p02969 | #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
cout << 4 * n * n << endl;
} | #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
cout << 3 * n * n << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 772,324 | 772,325 | u503170128 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int R;
cin >> R;
cout << 3 * R + 3 * R << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int R;
cin >> R;
cout << 3 * R * R << endl;
}
| [
"expression.operation.binary.remove"
] | 772,326 | 772,327 | u237390401 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lli long long
#define mp make_pair
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define allr(v) (v).rbegin(), (v).rend()
#define ok return 0;
#define MOAE \
ios::s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lli long long
#define mp make_pair
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define allr(v) (v).rbegin(), (v).rend()
#define ok return 0;
#define MOAE \
ios::s... | [] | 772,330 | 772,331 | u595501523 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cout << 3 * r * r << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * r * r << endl;
} | [] | 772,334 | 772,335 | u422692699 | cpp |
p02969 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * pow(r, 3) << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * pow(r, 2) << endl;
} | [
"literal.number.change",
"io.output.change"
] | 772,336 | 772,337 | u395356317 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int r;
cout << 3 * r * r << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int r;
cin >> r;
cout << 3 * r * r << '\n';
return 0;
} | [] | 772,349 | 772,350 | u194015723 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N... | [
"expression.operation.binary.remove"
] | 772,357 | 772,358 | u618604643 | cpp |
p02969 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#defi... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#defi... | [
"expression.operation.binary.remove"
] | 772,359 | 772,360 | u172873334 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 2 * r * r << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * r * r << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 772,369 | 772,370 | u342703951 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * r * 3 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * r * r << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 772,386 | 772,387 | u037563046 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << 3 * N * N * N << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << 3 * N * N << endl;
}
| [
"expression.operation.binary.remove"
] | 772,388 | 772,389 | u889173297 | cpp |
p02969 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
int s;
cout << s * s * 3 << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
int s;
cin >> s;
cout << s * s * 3 << endl;
return 0;
}
| [] | 772,406 | 772,407 | u201553784 | cpp |
p02969 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 772,410 | 772,411 | u154645927 | cpp |
p02969 | // include
//------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list... | // include
//------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list... | [
"call.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 772,413 | 772,414 | u266763028 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"expression.operation.binary.remove"
] | 772,441 | 772,442 | u347057617 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, ... | [] | 772,443 | 772,444 | u341447450 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 4 * r * r;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * r * r;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 772,445 | 772,446 | u641500793 | cpp |
p02969 | #include <bits/stdc++.h>
#define rep(var, cnt) for (int(var) = 0; (var) < (int)(cnt); ++(var))
#define Rep(var, init, cnt) for (int(var) = (init); (var) < (int)(cnt); ++(var))
#define REP(var, init, cnt) \
for (int(var) = (init); (var) <= (int)(cnt); ++(var))
#define... | #include <bits/stdc++.h>
#define rep(var, cnt) for (int(var) = 0; (var) < (int)(cnt); ++(var))
#define Rep(var, init, cnt) for (int(var) = (init); (var) < (int)(cnt); ++(var))
#define REP(var, init, cnt) \
for (int(var) = (init); (var) <= (int)(cnt); ++(var))
#define... | [] | 772,447 | 772,448 | u143572112 | cpp |
p02969 | #include <iostream>
#include <string>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * 4 * 4 << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * r * r << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 772,449 | 772,450 | u542474460 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int r;
cin >> r;
cout << 4 * r * r << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int r;
cin >> r;
cout << 3 * r * r << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 772,451 | 772,452 | u417563928 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * pow(r, 3);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * pow(r, 2);
} | [
"literal.number.change",
"io.output.change"
] | 772,462 | 772,463 | u901813121 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * (r * r * r);
} | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * (r * r);
} | [
"expression.operation.binary.remove"
] | 772,479 | 772,480 | u904019018 | cpp |
p02969 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int a;
cout << 3 * a * a;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int a;
cin >> a;
cout << 3 * a * a;
}
| [] | 772,485 | 772,486 | u154833883 | cpp |
p02969 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int r;
cout << 3 * r * r << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int r;
cin >> r;
cout << 3 * r * r << en... | [] | 772,494 | 772,495 | u108484707 | cpp |
p02969 | #include <stdio.h>
int main() {
int a = 0;
scanf("%d", &a);
printf("%d", 3 * a * a * a);
}
| #include <stdio.h>
int main() {
int a = 0;
scanf("%d", &a);
printf("%d", 3 * a * a);
}
| [
"expression.operation.binary.remove"
] | 772,511 | 772,512 | u505466816 | cpp |
p02969 | #include <stdio.h>
int main() {
int a = 0;
scanf("%d", &a);
printf("%d", a * a * a);
}
| #include <stdio.h>
int main() {
int a = 0;
scanf("%d", &a);
printf("%d", 3 * a * a);
}
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 772,513 | 772,512 | u505466816 | cpp |
p02969 | #include <bits/stdc++.h> //C++の標準ライブラリを一行で一括でインクルードする
#include <math.h> //数学関数と数学定数を利用する
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
in... | #include <bits/stdc++.h> //C++の標準ライブラリを一行で一括でインクルードする
#include <math.h> //数学関数と数学定数を利用する
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
in... | [
"expression.operation.binary.remove"
] | 772,514 | 772,515 | u014967455 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a;
cin >> a;
cout << 3 * pow(a, 3) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << 3 * pow(a, 2) << endl;
} | [
"literal.number.change",
"io.output.change"
] | 772,521 | 772,522 | u770009793 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int n;
cout << 3 * n * n << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << 3 * n * n << endl;
return 0;
} | [] | 772,525 | 772,526 | u522506260 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vc = vector<char>;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) x.begin(), x.end()
int main() {
int r;
cin >> r;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vc = vector<char>;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) x.begin(), x.end()
int main() {
int r;
cin >> r;
... | [
"expression.operation.binary.remove"
] | 772,527 | 772,528 | u688825490 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << 4 * n * n;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << 3 * n * n;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 772,535 | 772,536 | u391340825 | cpp |
p02969 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, x) for (int i{0}; i < (int)(x); i++)
#define RE... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, x) for (int i{0}; i < (int)(x); i++)
#define RE... | [] | 772,537 | 772,538 | u815659544 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int r;
cout << 3 * r * r << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int r;
cin >> r;
cout << 3 * r * r << endl;
}
| [] | 772,548 | 772,549 | u610579155 | cpp |
p02969 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int r;
cin >> r;
int ans = 0;
ans = 3 * 3 * r;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int r;
cin >> r;
int ans = 0;
ans = 3 * r * r;
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 772,550 | 772,551 | u625522718 | cpp |
p02969 | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie();
ios_base::sync_with_stdio(0);
int r;
cin >> r;
cout << 3 * r * r * r;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie();
ios_base::sync_with_stdio(0);
int r;
cin >> r;
cout << 3 * r * r;
}
| [
"expression.operation.binary.remove"
] | 772,559 | 772,560 | u022827845 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int r;
cin >> r;
cout << 3 * r * r * r;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int r;
cin >> r;
cout << 3 * r * r;
return 0;
}
| [
"expression.operation.binary.remove"
] | 772,572 | 772,573 | u891061025 | cpp |
p02969 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b = 0;
b = 3 * a * a;
cout << b << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b = 0;
cin >> a;
b = 3 * a * a;
cout << b << endl;
}
| [] | 772,585 | 772,586 | u479202791 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * r * r * r << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * r * r << endl;
} | [
"expression.operation.binary.remove"
] | 772,596 | 772,597 | u677149659 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define whole(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll,... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define whole(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll,... | [
"expression.operation.binary.remove"
] | 772,612 | 772,613 | u829956284 | cpp |
p02969 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"literal.number.change",
"io.output.change"
] | 772,614 | 772,615 | u186359321 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << r * r * 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << r * r * 3 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 772,616 | 772,617 | u932319885 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cout << 3 * a * a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << 3 * a * a << endl;
}
| [] | 772,624 | 772,625 | u018807058 | cpp |
p02969 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
int main() {
int r;
cin >> r;
cout << 3 * (r ^ 2) << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
int main() {
int r;
cin >> r;
cout << 3 * r * r << endl;
} | [] | 772,626 | 772,627 | u091665287 | cpp |
p02969 | #include <bits/stdc++.h>
#include <cmath>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define SUBL \
freopen("/home/... | #include <bits/stdc++.h>
#include <cmath>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define SUBL \
freopen("/home/... | [] | 772,639 | 772,640 | u851831516 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 4 * r * r << endl;
} | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * r * r << endl;
} | [
"literal.number.change",
"io.output.change"
] | 772,645 | 772,646 | u981388291 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A;
cout << 4 * A * A;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A;
cout << 3 * A * A;
}
| [
"literal.number.change",
"io.output.change"
] | 772,649 | 772,650 | u383166010 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << 2 * (n * n);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << 3 * (n * n);
} | [
"literal.number.change",
"io.output.change"
] | 772,651 | 772,652 | u488087935 | cpp |
p02969 | /*
1. I'm the Future Red Coder :)
2. Hopefully, I'll be Yellow Soon.
*/
#include <bits/stdc++.h>
#define mod 998244353 // 1000000007
#define lim 1000000000000000007
#define lim1 18446744073709551615 // Unsigned
#define sq(a) ((a) * (a))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mms(... | /*
1. I'm the Future Red Coder :)
2. Hopefully, I'll be Yellow Soon.
*/
#include <bits/stdc++.h>
#define mod 998244353 // 1000000007
#define lim 1000000000000000007
#define lim1 18446744073709551615 // Unsigned
#define sq(a) ((a) * (a))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mms(... | [] | 772,673 | 772,674 | u921940646 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cout << (3 * n * n) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (3 * n * n) << endl;
return 0;
}
| [] | 772,699 | 772,700 | u379904287 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.