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 |
|---|---|---|---|---|---|---|---|
p03230 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// 数学的考察の問題。自力で思いつけなかった。不変量を思いつくために実験が大事。
int main() {
int n;
cin >> n;
bool enable = false;
int k = 1;
while (true) {
if (k * (k - 1) / 2 > n)
break;
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// 数学的考察の問題。自力で思いつけなかった。図を見て初めて分かった
int main() {
int n;
cin >> n;
bool enable = false;
int k = 1;
while (true) {
if (k * (k - 1) / 2 > n)
break;
if (k *... | [
"expression.operation.binary.remove"
] | 1,021,125 | 1,021,126 | u018250459 | cpp |
p03230 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,021,127 | 1,021,128 | u266874640 | cpp |
p03230 | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
using usize = ::std::size_t;
// using u64 = ::std::int_least64_t;
using u64 = long long;
static constexpr u64 Inf = ::std::numeric_limits<u64>::max() / 2;
int main(int argc, char *argv[]) {
// std::ifstream in("in.txt... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
using usize = ::std::size_t;
// using u64 = ::std::int_least64_t;
using u64 = long long;
static constexpr u64 Inf = ::std::numeric_limits<u64>::max() / 2;
int main(int argc, char *argv[]) {
// std::ifstream in("in.txt... | [
"control_flow.branch.if.condition.change"
] | 1,021,129 | 1,021,130 | u945078804 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
// エイリアス
using ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
// 汎用マクロ
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#def... | #include <bits/stdc++.h>
using namespace std;
// エイリアス
using ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
// 汎用マクロ
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#def... | [
"io.output.change"
] | 1,021,142 | 1,021,143 | u740054550 | cpp |
p03230 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define r... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define r... | [
"control_flow.loop.for.condition.change"
] | 1,021,144 | 1,021,145 | u860546679 | cpp |
p03230 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,021,154 | 1,021,155 | u824905100 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
template <typename T, typename U> using pv = vector<pair<T, U>>;
template <typename T> using matrix = vector<vector<T>>;
template <typename T> using pque = priority_queue<T>;
template <typename T> using lpque = priority_queue<T, vector<T>, greater<T>>;
using ll = long lon... | #include <bits/stdc++.h>
using namespace std;
template <typename T, typename U> using pv = vector<pair<T, U>>;
template <typename T> using matrix = vector<vector<T>>;
template <typename T> using pque = priority_queue<T>;
template <typename T> using lpque = priority_queue<T, vector<T>, greater<T>>;
using ll = long lon... | [
"io.output.change"
] | 1,021,179 | 1,021,180 | u195036695 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 10000000000 + 7;
int main() {
cout << setprecision(10);
int N;
cin >> N;
int k = 0;
for (int i = 1; i <= N; i++) {
if (i * (i - 1) == 2 * N) {
k = i;
}
}
if (k == 0) {
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 10000000000 + 7;
int main() {
cout << setprecision(10);
int N;
cin >> N;
int k = 0;
for (int i = 1; i <= N + 1; i++) {
if (i * (i - 1) == 2 * N) {
k = i;
}
}
if (k == 0) {
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,021,185 | 1,021,186 | u190875453 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n;
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n;
cin >>... | [
"io.output.change"
] | 1,021,189 | 1,021,190 | u877494916 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n;
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n;
cin >>... | [
"io.output.change"
] | 1,021,189 | 1,021,191 | u877494916 | cpp |
p03230 | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, a, b) for (int i = a; i <= b; i++)
#define REPR(i, a, b) for (int i = a; i >= b; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#de... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, a, b) for (int i = a; i <= b; i++)
#define REPR(i, a, b) for (int i = a; i >= b; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#de... | [
"expression.operation.binary.add"
] | 1,021,200 | 1,021,201 | u135626132 | cpp |
p03230 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | [
"expression.operation.binary.add"
] | 1,021,204 | 1,021,205 | u128572736 | cpp |
p03230 | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int i;
bool bJudge = false;
for (i = 1; i < 500; i++) {
if (i * (i + 1) / 2 == n) {
bJudge = true;
}
if (i * (i + 1) / 2 >= n) {
... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int i;
bool bJudge = false;
for (i = 1; i < 500; i++) {
if (i * (i + 1) / 2 == n) {
bJudge = true;
}
if (i * (i + 1) / 2 >= n) {
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 1,021,206 | 1,021,207 | u865858945 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF = 1e9 + 7;
const ll LINF = 9223372036854775807;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld EPS = 1e-10; //微調整用（EPSより小さいと0と判定など）
int ii() {
int x... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF = 1e9 + 7;
const ll LINF = 9223372036854775807;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld EPS = 1e-10; //微調整用（EPSより小さいと0と判定など）
int ii() {
int x... | [
"literal.number.change",
"call.arguments.change"
] | 1,021,214 | 1,021,215 | u778814286 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int table[1000][1000];
for (int k = 2; k < 1000; k++) {
if (k * (k + 1) == N * 2) {
cout << "Yes" << endl;
cout << k + 1 << endl;
int count = 1;
for (int i = 0; i < k; i++) {
for (int j = i; j < k; j+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int table[1000][1000];
for (int k = 1; k < 1000; k++) {
if (k * (k + 1) == N * 2) {
cout << "Yes" << endl;
cout << k + 1 << endl;
int count = 1;
for (int i = 0; i < k; i++) {
for (int j = i; j < k; j+... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,021,226 | 1,021,227 | u058186113 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int table[1000][1000];
for (int k = 2; k < 1000; k++) {
if (k * (k + 1) == N * 2) {
cout << "Yes" << endl;
cout << k + 1 << endl;
int count = 1;
for (int i = 0; i < k; i++) {
for (int j = i; j < k; j+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int table[1000][1000];
for (int k = 1; k < 1000; k++) {
if (k * (k + 1) == N * 2) {
cout << "Yes" << endl;
cout << k + 1 << endl;
int count = 1;
for (int i = 0; i < k; i++) {
for (int j = i; j < k; j+... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.change",
"expression.operation.binary.remove"
] | 1,021,228 | 1,021,227 | u058186113 | cpp |
p03230 | #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 ll;
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
int k = 0;
rep(i, 450) {
if (i * (i + 1) / 2 == n) {
k = i;
}
... | #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 ll;
typedef pair<ll, ll> P;
int main() {
int n;
cin >> n;
int k = 0;
rep(i, 450) {
if (i * (i + 1) / 2 == n) {
k = i;
}
... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 1,021,235 | 1,021,236 | u387371565 | cpp |
p03230 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | [
"call.add"
] | 1,021,241 | 1,021,242 | u607229598 | cpp |
p03230 | #include <bits/stdc++.h>
#define SZ(x) ((int)(x).size())
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP make_pair
using namespace std;
typedef lo... | #include <bits/stdc++.h>
#define SZ(x) ((int)(x).size())
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP make_pair
using namespace std;
typedef lo... | [
"control_flow.branch.if.condition.change"
] | 1,021,243 | 1,021,244 | u385825353 | cpp |
p03230 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 1,021,252 | 1,021,253 | u751964641 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,021,256 | 1,021,257 | u382423941 | cpp |
p03230 | #include <sys/time.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<double... | #include <sys/time.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<double... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,021,260 | 1,021,261 | u389009751 | cpp |
p03230 | #include <sys/time.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<double... | #include <sys/time.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<double... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,021,262 | 1,021,261 | u389009751 | cpp |
p03230 | #include <sys/time.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<double... | #include <sys/time.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<double... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,021,263 | 1,021,261 | u389009751 | cpp |
p03230 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include ... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,021,266 | 1,021,267 | u845000384 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int k = -1;
for (int i = 2; i <= N; i++) {
if ((long long)i * (i - 1) / 2 == N) {
k = i;
break;
}
}
if (k == -1) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
vector<vector<int>> S(k);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int k = -1;
for (int i = 0; i <= N + 1; i++) {
if ((long long)i * (i - 1) / 2 == N) {
k = i;
break;
}
}
if (k == -1) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
vector<vector<int>> S(k);... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,021,268 | 1,021,269 | u424374375 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int k = -1;
for (int i = 0; i <= N; i++) {
if ((long long)i * (i - 1) / 2 == N) {
k = i;
break;
}
}
if (k == -1) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
vector<vector<int>> S(k);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int k = -1;
for (int i = 0; i <= N + 1; i++) {
if ((long long)i * (i - 1) / 2 == N) {
k = i;
break;
}
}
if (k == -1) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
vector<vector<int>> S(k);... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,021,270 | 1,021,269 | u424374375 | cpp |
p03230 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template <class ... |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template <class ... | [
"expression.operation.binary.remove"
] | 1,021,288 | 1,021,289 | u887675488 | cpp |
p03230 | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 1,021,298 | 1,021,299 | u554988565 | cpp |
p03230 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int M = sqrt(N * 2);
if (2 * N & M == 0 && 2 * N / M == M + 1) {
cout << "Yes" << endl;
cout << M + 1 << endl;
vector<vector<int>> Ans(M + 1, vector<int>(M));
for (int i = 0; i < M; i++)
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int M = sqrt(N * 2);
if ((2 * N) % M == 0 && 2 * N / M == M + 1) {
cout << "Yes" << endl;
cout << M + 1 << endl;
vector<vector<int>> Ans(M + 1, vector<int>(M));
for (int i = 0; i < M; i++)
... | [
"control_flow.branch.if.condition.change"
] | 1,021,300 | 1,021,301 | u868132236 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"literal.string.change",
"io.output.change"
] | 1,021,302 | 1,021,303 | u987913144 | cpp |
p03230 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i > b; i--)
... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i > b; i--)
... | [
"expression.operation.binary.add"
] | 1,021,344 | 1,021,345 | u558667782 | cpp |
p03230 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int n;
void solve() {
int mul = n * 2;
int k = 2;
while (k * (k - 1) < mul) {
k++;
}
if (k < 3 || k * (k - 1) != mul) {
cout << "No" << endl;
return;
}
cout << "Yes" << endl;
cout << k << endl;
vector<vector<int... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int n;
void solve() {
int mul = n * 2;
int k = 2;
while (k * (k - 1) < mul) {
k++;
}
if (k * (k - 1) != mul) {
cout << "No" << endl;
return;
}
cout << "Yes" << endl;
cout << k << endl;
vector<vector<int>> v(k, v... | [
"expression.operation.binary.remove"
] | 1,021,352 | 1,021,353 | u550178285 | cpp |
p03230 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define invrepr(i, a, b) for (int i = b - 1; i >= a; i--)
#define invrep(i, n) invrepr(i, 0, n)
#define repitr(itr, a) for (auto itr = a.begin(); itr != a.e... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define invrepr(i, a, b) for (int i = b - 1; i >= a; i--)
#define invrep(i, n) invrepr(i, 0, n)
#define repitr(itr, a) for (auto itr = a.begin(); itr != a.e... | [
"literal.number.change",
"call.arguments.change"
] | 1,021,354 | 1,021,355 | u012298376 | cpp |
p03230 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
int main() {
long... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
int main() {
long... | [
"control_flow.loop.for.condition.change"
] | 1,021,367 | 1,021,368 | u843522325 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool flag = false;
int size;
for (int i = 2; i <= N; i++) {
if (i * (i + 1) == 2 * N) {
flag = true;
size = i;
break;
}
}
if (!flag) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool flag = false;
int size;
for (int i = 1; i <= N; i++) {
if (i * (i + 1) == 2 * N) {
flag = true;
size = i;
break;
}
}
if (!flag) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,021,369 | 1,021,370 | u660341491 | cpp |
p03230 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < ... | [
"literal.number.change",
"call.arguments.change"
] | 1,021,371 | 1,021,372 | u399721252 | cpp |
p03230 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define DIV 998244353
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N;
cin >> N;
int g = 0;
for (int K =... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define DIV 998244353
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N;
cin >> N;
int g = 0;
for (int K =... | [
"expression.operation.binary.remove"
] | 1,021,377 | 1,021,378 | u105100688 | cpp |
p03230 | #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... | [
"identifier.change",
"call.arguments.change"
] | 1,021,383 | 1,021,384 | u809967037 | cpp |
p03230 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
bool ok = false;
int k = 0;
for (int i = 1; i < 1000; i++) {
if (i * (i - 1) == 2 * n) {
ok = true;
k = i;
}
}
if (true) {
cout << "Yes" << endl;
cout << k << endl;
int a[k][k - 1];
int c = 1;
f... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
bool ok = false;
int k = 0;
for (int i = 1; i < 1000; i++) {
if (i * (i - 1) == 2 * n) {
ok = true;
k = i;
}
}
if (ok) {
cout << "Yes" << endl;
cout << k << endl;
int a[k][k - 1];
int c = 1;
for... | [
"control_flow.branch.if.condition.change"
] | 1,021,643 | 1,021,644 | u179970156 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N;
cin >> N;
int k = 0;
for (int i = 1; i * i <= N; ++i) {
if ((i * (i - 1)) / 2 == N) {
k = i;
break;
}
}
if (k == 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
cout << k <... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N;
cin >> N;
int k = 0;
for (int i = 1; i <= N + 5; ++i) {
if ((i * (i - 1)) / 2 == N) {
k = i;
break;
}
}
if (k == 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
cout << k <... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,021,660 | 1,021,661 | u826487371 | cpp |
p03230 | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[100005], finv[100005], inv[100005];
vector<int> v[10005];
int m... | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[100005], finv[100005], inv[100005];
vector<int> v[10005];
int m... | [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,021,668 | 1,021,669 | u539402331 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,021,672 | 1,021,673 | u685892567 | cpp |
p03230 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define pii pair<int, int>
int N;
vector<int> ans[100010];
int main() {
cin >> N;
int k = 1;
while (k * (k + 1) < 2 * N)
k++;
if (k * (k + 1) != 2 * N) {
cout << "No" << endl;
return 0;
}
cout ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define pii pair<int, int>
int N;
vector<int> ans[100010];
int main() {
cin >> N;
int k = 1;
while (k * (k + 1) < 2 * N)
k++;
if (k * (k + 1) != 2 * N) {
cout << "No" << endl;
return 0;
}
cout ... | [
"control_flow.loop.for.condition.change"
] | 1,021,678 | 1,021,679 | u554116180 | cpp |
p03230 |
#include "bits/stdc++.h"
using namespace std;
vector<int> V[100005];
int Pos[100005];
void Solve(int N, int k) {
int i, j, length, high;
for (i = 1; i < k; ++i)
V[1].emplace_back(i);
high = k;
Pos[1] = 0;
for (i = 2; i <= k; ++i) {
length = 0;
Pos[i] = i - 1;
for (j = 1; j < i; ++j, ++le... |
#include "bits/stdc++.h"
using namespace std;
vector<int> V[100005];
int Pos[100005];
void Solve(int N, int k) {
int i, j, length, high;
for (i = 1; i < k; ++i)
V[1].emplace_back(i);
high = k;
Pos[1] = 0;
for (i = 2; i <= k; ++i) {
length = 0;
Pos[i] = i - 1;
for (j = 1; j < i; ++j, ++le... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,021,680 | 1,021,681 | u843106258 | cpp |
p03230 |
#include "bits/stdc++.h"
using namespace std;
vector<int> V[100005];
int Pos[100005];
void Solve(int N, int k) {
int i, j, length, high;
for (i = 1; i < k; ++i)
V[1].emplace_back(i);
high = k;
Pos[1] = 0;
for (i = 2; i <= k; ++i) {
length = 0;
Pos[i] = i - 1;
for (j = 1; j < i; ++j, ++le... |
#include "bits/stdc++.h"
using namespace std;
vector<int> V[100005];
int Pos[100005];
void Solve(int N, int k) {
int i, j, length, high;
for (i = 1; i < k; ++i)
V[1].emplace_back(i);
high = k;
Pos[1] = 0;
for (i = 2; i <= k; ++i) {
length = 0;
Pos[i] = i - 1;
for (j = 1; j < i; ++j, ++le... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,021,682 | 1,021,681 | u843106258 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
#define ALL(c) begin(c), end(c)
#define RALL(c) rbegin(c), rend(c)
#define ITR(i, b, e) for (auto i = (b); i != (e); ++i)
#define FORE(x, c) for (auto &&x : c)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
#define ALL(c) begin(c), end(c)
#define RALL(c) rbegin(c), rend(c)
#define ITR(i, b, e) for (auto i = (b); i != (e); ++i)
#define FORE(x, c) for (auto &&x : c)... | [
"expression.operation.binary.add"
] | 1,021,685 | 1,021,686 | u133129810 | cpp |
p03230 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int A = 1;
while (A * (A - 1) / 2 < N)
++A;
if (A * (A - 1) / 2 > N) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
vector<vector<int>> G(N);
int cnt = 0;
for (int i = 0; i < A; ++i) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int A = 1;
while (A * (A - 1) / 2 < N)
++A;
if (A * (A - 1) / 2 > N) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
vector<vector<int>> G(A);
int cnt = 0;
for (int i = 0; i < A; ++i) {
... | [] | 1,021,691 | 1,021,692 | u837745858 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int k;
bool frag = false;
for (int i = 1; i < N; i++) {
if (i * (i + 1) == 2 * N) {
k = i;
frag = true;
cout << "Yes" << endl;
break;
}
}
vector<vect... | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int k;
bool frag = false;
for (int i = 1; i < sqrt(2 * N); i++) {
if (i * (i + 1) == 2 * N) {
k = i;
frag = true;
cout << "Yes" << endl;
break;
}
}
... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 1,021,693 | 1,021,694 | u881160582 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int k;
bool frag = false;
for (int i = 1; i < N; i++) {
if (i * (i + 1) == 2 * N) {
k = i;
frag = true;
cout << "Yes" << endl;
break;
}
}
vector<v... | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int k;
bool frag = false;
for (int i = 1; i < sqrt(2 * N); i++) {
if (i * (i + 1) == 2 * N) {
k = i;
frag = true;
cout << "Yes" << endl;
break;
}
}
... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 1,021,695 | 1,021,694 | u881160582 | cpp |
p03230 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int row = sqrt(2 * N);
bool is_exist = (N != 1 && 2 * N == row * (row + 1));
cout << (is_exist ? "Yes" : "No") << endl;
if (!is_exist)
return 0;
cout << row + 1 << endl;
// diagonal
cout << row;
for (i... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int row = sqrt(2 * N);
bool is_exist = (2 * N == row * (row + 1));
cout << (is_exist ? "Yes" : "No") << endl;
if (!is_exist)
return 0;
cout << row + 1 << endl;
// diagonal
cout << row;
for (int ii = 1;... | [
"expression.operation.binary.remove"
] | 1,021,696 | 1,021,697 | u843070415 | cpp |
p03230 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using pii = pair<int, int>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(obj) (obj).begin(... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using pii = pair<int, int>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(obj) (obj).begin(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,021,701 | 1,021,702 | u949798495 | cpp |
p03230 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using pii = pair<int, int>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(obj) (obj).begin(... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using pii = pair<int, int>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(obj) (obj).begin(... | [
"preprocessor.define.value.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,021,701 | 1,021,703 | u949798495 | cpp |
p03230 | #include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define il inline
#define in1(a) a = read()
#define in2(a, b) in1(a), in1(b)
#define in3(a, b, c) in2(a, b), in1(c)
#define in4(a, b, c, d) in2(a, b), in2(c, d)
#define out(a) printf("%d", a)
#define out_(a) printf(" %d", a)
#define outn(a) out(a), ... | #include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define il inline
#define in1(a) a = read()
#define in2(a, b) in1(a), in1(b)
#define in3(a, b, c) in2(a, b), in1(c)
#define in4(a, b, c, d) in2(a, b), in2(c, d)
#define out(a) printf("%d", a)
#define out_(a) printf(" %d", a)
#define outn(a) out(a), ... | [
"control_flow.loop.for.condition.change"
] | 1,021,709 | 1,021,710 | u993519359 | cpp |
p03230 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int k = 2;
for (int i = 1; i < 500; i++) {
if (i * (i - 1) / 2 == n) {
k = i;
break;
}
}
if (k == 2) {
cout << "No" << endl;
return 0;
}
vector<int> s[k];
int x = 0;
for (int i =... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int k = -1;
for (int i = 1; i < 500; i++) {
if (i * (i - 1) / 2 == n) {
k = i;
break;
}
}
if (k == -1) {
cout << "No" << endl;
return 0;
}
vector<int> s[k];
int x = 0;
for (int i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,021,711 | 1,021,712 | u587665681 | cpp |
p03230 | // #includes {{{
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end... | // #includes {{{
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,021,713 | 1,021,714 | u852599784 | cpp |
p03230 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int v[500][500];
int p[500];
int main() {
int N;
cin >> N;
int n = 3;
int t = 3;
while (n < 100001) {
if (n == N) {
cout << "Yes" << endl;
cout << t << endl;
i... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int v[500][500];
int p[500];
int main() {
int N;
cin >> N;
int n = 1;
int t = 2;
while (n < 100001) {
if (n == N) {
cout << "Yes" << endl;
cout << t << endl;
i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,021,717 | 1,021,718 | u657611449 | cpp |
p03230 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int v[500][500];
int p[500];
int main() {
int N;
cin >> N;
int n = 3;
int t = 3;
while (n < 100001) {
if (n == N) {
cout << "Yes" << endl;
cout << n << endl;
i... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int v[500][500];
int p[500];
int main() {
int N;
cin >> N;
int n = 1;
int t = 2;
while (n < 100001) {
if (n == N) {
cout << "Yes" << endl;
cout << t << endl;
i... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"io.output.change"
] | 1,021,719 | 1,021,718 | u657611449 | cpp |
p03230 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int v[500][500];
int p[500];
int main() {
int N;
cin >> N;
int n = 3;
int t = 3;
if (N == 2) {
cout << "Yes" << endl;
cout << "2" << endl;
cout << "1 1" << endl;
cout... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int v[500][500];
int p[500];
int main() {
int N;
cin >> N;
int n = 3;
int t = 3;
if (N == 1) {
cout << "Yes" << endl;
cout << "2" << endl;
cout << "1 1" << endl;
cout... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,021,720 | 1,021,721 | u657611449 | cpp |
p03230 | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int k;
k = (1 + sqrt(1 + 8 * N)) / 2;
if (N != 1 && k == (1 + sqrt(1 + 8 * N)) / 2) {
vector<vector<int>> ans;
int cnt = 1;
ans.resize(k);
for (int i = 0; i < k; i++) {
fo... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int k;
k = (1 + sqrt(1 + 8 * N)) / 2;
if (k == (1 + sqrt(1 + 8 * N)) / 2) {
vector<vector<int>> ans;
int cnt = 1;
ans.resize(k);
for (int i = 0; i < k; i++) {
for (int j =... | [
"expression.operation.binary.remove"
] | 1,021,724 | 1,021,725 | u252200763 | cpp |
p03230 | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int k;
k = (1 + sqrt(1 + 8 * N)) / 2;
if (k > 2 && k == (1 + sqrt(1 + 8 * N)) / 2) {
vector<vector<int>> ans;
int cnt = 1;
ans.resize(k);
for (int i = 0; i < k; i++) {
for... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int k;
k = (1 + sqrt(1 + 8 * N)) / 2;
if (k == (1 + sqrt(1 + 8 * N)) / 2) {
vector<vector<int>> ans;
int cnt = 1;
ans.resize(k);
for (int i = 0; i < k; i++) {
for (int j =... | [
"expression.operation.binary.remove"
] | 1,021,726 | 1,021,725 | u252200763 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
int k = -1;
for (int i = 0; i < 100000; i++) {
if (i * (i - 1) / 2 == n)
k = i;
}
if (k == -1) {
cout << "No" << endl;
return 0;
}
int r = 1;
vector<vector<int>> v(n);
for (int i = 0; i < k; i++) {
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
int k = -1;
for (int i = 1; i < 10000; i++) {
if (i * (i - 1) / 2 == n)
k = i;
}
if (k == -1) {
cout << "No" << endl;
return 0;
}
int r = 1;
vector<vector<int>> v(2 * n);
for (int i = 0; i < k; i++) {... | [
"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,021,731 | 1,021,732 | u344122377 | cpp |
p03230 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int A[500][500] = {};
int main() {
int N;
cin >> N;
int c = 0;
for (int i = 2; i < ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int A[500][500] = {};
int main() {
int N;
cin >> N;
int c = 0;
for (int i = 1; i < ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove"
] | 1,021,733 | 1,021,734 | u596912804 | cpp |
p03230 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int A[450][450] = {};
int main() {
int N;
cin >> N;
int c = 0;
for (int i = 2; i < ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int A[500][500] = {};
int main() {
int N;
cin >> N;
int c = 0;
for (int i = 1; i < ... | [
"literal.number.change",
"variable_declaration.array_dimensions.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,021,735 | 1,021,734 | u596912804 | cpp |
p03230 | #include <cstdio>
#include <math.h>
#include <stdio.h>
using namespace std;
long int isqrt(long int x);
int MAX_N = 1000;
int main() {
long int N = 0;
/* read input */
scanf("%ld", &N);
long int s = isqrt(2 * N);
if (2 * N == s * (s + 1)) {
printf("Yes\n");
int n = 1;
int sets[MAX_N][MAX_N];
... |
#include <cstdio>
#include <math.h>
#include <stdio.h>
using namespace std;
long int isqrt(long int x);
int MAX_N = 1000;
int main() {
long int N = 0;
/* read input */
scanf("%ld", &N);
long int s = isqrt(2 * N);
if (2 * N == s * (s + 1)) {
printf("Yes\n");
int n = 1;
int sets[MAX_N][MAX_N];
... | [
"call.arguments.change",
"io.output.change",
"literal.string.change"
] | 1,021,749 | 1,021,750 | u401013791 | cpp |
p03230 |
#include <cstdio>
#include <math.h>
#include <stdio.h>
using namespace std;
long int isqrt(long int x);
int MAX_N = 1000;
int main() {
long int N;
/* read input */
scanf("%ld", &N);
long int s = isqrt(2 * N);
if (2 * N == s * (s + 1)) {
printf("Yes\n");
int n = 1;
int sets[MAX_N][MAX_N];
... |
#include <cstdio>
#include <math.h>
#include <stdio.h>
using namespace std;
long int isqrt(long int x);
int MAX_N = 1000;
int main() {
long int N = 0;
/* read input */
scanf("%ld", &N);
long int s = isqrt(2 * N);
if (2 * N == s * (s + 1)) {
printf("Yes\n");
int n = 1;
int sets[MAX_N][MAX_N];
... | [
"variable_declaration.value.change",
"call.arguments.change",
"io.output.change"
] | 1,021,751 | 1,021,750 | u401013791 | cpp |
p03230 | /*
author: Apoorv Singh
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef tree<int... | /*
author: Apoorv Singh
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef tree<int... | [
"control_flow.loop.for.condition.change"
] | 1,021,752 | 1,021,753 | u082633058 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int hlist[445];
int pos = -1;
for (int i = 0; i < 445; i++) {
hlist[i] = ((i + 2) * (i + 3)) / 2;
if (n == hlist[i]) {
pos = i + 3;
}
}
if (pos == -1) {
cout << "No" << endl;
} else ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int hlist[446];
int pos = -1;
for (int i = 0; i < 446; i++) {
hlist[i] = ((i + 1) * (i + 2)) / 2;
if (n == hlist[i]) {
pos = i + 2;
}
}
if (pos == -1) {
cout << "No" << endl;
} else ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change"
] | 1,021,756 | 1,021,755 | u764234894 | cpp |
p03230 | //#pragma comment(linker, "/STACK:102400000,102400000") 手动扩栈
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set> //插入时相同的不插，边插边排序，里面还有multiset可以重复
#include <stdio.h>
#include <string.h>
#include <string>
#define foc(i, x, y) for (int i = x; i <= y; i++)
#define rea(i, x, y) for (i... | //#pragma comment(linker, "/STACK:102400000,102400000") 手动扩栈
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set> //插入时相同的不插，边插边排序，里面还有multiset可以重复
#include <stdio.h>
#include <string.h>
#include <string>
#define foc(i, x, y) for (int i = x; i <= y; i++)
#define rea(i, x, y) for (i... | [
"literal.string.change",
"io.output.change"
] | 1,021,759 | 1,021,760 | u173380057 | cpp |
p03230 | //#pragma comment(linker, "/STACK:102400000,102400000") 手动扩栈
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set> //插入时相同的不插，边插边排序，里面还有multiset可以重复
#include <stdio.h>
#include <string.h>
#include <string>
#define foc(i, x, y) for (int i = x; i <= y; i++)
#define rea(i, x, y) for (i... | //#pragma comment(linker, "/STACK:102400000,102400000") 手动扩栈
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set> //插入时相同的不插，边插边排序，里面还有multiset可以重复
#include <stdio.h>
#include <string.h>
#include <string>
#define foc(i, x, y) for (int i = x; i <= y; i++)
#define rea(i, x, y) for (i... | [
"literal.string.change",
"io.output.change"
] | 1,021,761 | 1,021,760 | u173380057 | cpp |
p03230 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> a[1000];
cin >> N;
int k, t;
t = -1;
for (int i = 2; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> a[1000];
cin >> N;
int k, t;
t = -1;
for (int i = 1; ... | [
"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"
] | 1,021,762 | 1,021,763 | u453764945 | cpp |
p03230 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> a[1000];
cin >> N;
int k, t;
t = -1;
for (int i = 2; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> a[1000];
cin >> N;
int k, t;
t = -1;
for (int i = 1; ... | [
"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"
] | 1,021,764 | 1,021,763 | u453764945 | cpp |
p03230 | #include <cmath>
#include <cstdio>
void rekkyo(int i, int k, int n) {
int j;
for (j = (i + 1) * i / 2; j > i * (i - 1) / 2; j--) {
printf(" %d", j + 1);
}
j = i * (i - 1) / 2 + i + 1;
if (j <= n)
printf(" %d", j);
int tmp = i + 2;
while (true) {
j += tmp;
if (j > n)
break;
print... | #include <cmath>
#include <cstdio>
void rekkyo(int i, int k, int n) {
int j;
for (j = (i + 1) * i / 2; j > i * (i - 1) / 2; j--) {
printf(" %d", j);
}
j = i * (i - 1) / 2 + i + 1;
if (j <= n)
printf(" %d", j);
int tmp = i + 2;
while (true) {
j += tmp;
if (j > n)
break;
printf(" ... | [
"expression.operation.binary.remove"
] | 1,021,778 | 1,021,779 | u651808137 | cpp |
p03230 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int t = 0;
for (int i = 1; i < 320; i++) {
if (N == i * (i - 1) / 2) {
t = i;
break;
}
}
if (t > 2) {
cout << "Yes" << endl;
cout << t << endl;
for (int p = 0; p < t; p++) {
cout ... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int t = 0;
for (int i = 1; i < 3200; i++) {
if (N == i * (i - 1) / 2) {
t = i;
break;
}
}
if (t > 0) {
cout << "Yes" << endl;
cout << t << endl;
for (int p = 0; p < t; p++) {
cout... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,021,782 | 1,021,781 | u881541634 | cpp |
p03230 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int t = 0;
for (int i = 1; i < 320; i++) {
if (N == i * (i - 1) / 2) {
t = i;
break;
}
}
if (t > 2) {
cout << "yes" << endl;
cout << t << endl;
for (int p = 0; p < t; p++) {
cout ... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int t = 0;
for (int i = 1; i < 3200; i++) {
if (N == i * (i - 1) / 2) {
t = i;
break;
}
}
if (t > 0) {
cout << "Yes" << endl;
cout << t << endl;
for (int p = 0; p < t; p++) {
cout... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,021,783 | 1,021,781 | u881541634 | cpp |
p03230 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int t = 0;
for (int i = 1; i < 320; i++) {
if (N == i * (i - 1) / 2) {
t = i;
break;
}
}
if (t > 0) {
cout << "yes" << endl;
cout << t << endl;
for (int p = 0; p < t; p++) {
cout ... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int t = 0;
for (int i = 1; i < 3200; i++) {
if (N == i * (i - 1) / 2) {
t = i;
break;
}
}
if (t > 0) {
cout << "Yes" << endl;
cout << t << endl;
for (int p = 0; p < t; p++) {
cout... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,021,784 | 1,021,781 | u881541634 | cpp |
p03230 | #include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;
vector<int> graph[1000];
int myf(int a) { return a * (a - 1) / 2; }
int main(void) {
int n;
scanf("%d", &n);
int l = 0;
int r = 1000;
int k;
bool chk = false;
while (l <= r) {
int mid = (l + r) / 2;
if (myf(mid) == ... | #include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;
vector<int> graph[1000];
int myf(int a) { return a * (a - 1) / 2; }
int main(void) {
int n;
scanf("%d", &n);
int l = 0;
int r = 1000;
int k;
bool chk = false;
while (l <= r) {
int mid = (l + r) / 2;
if (myf(mid) == ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"call.arguments.add"
] | 1,021,785 | 1,021,786 | u225129981 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | [] | 1,021,793 | 1,021,794 | u825429292 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | [] | 1,021,795 | 1,021,794 | u825429292 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | [] | 1,021,796 | 1,021,794 | u825429292 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | [] | 1,021,797 | 1,021,794 | u825429292 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | [] | 1,021,798 | 1,021,794 | u825429292 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | [] | 1,021,799 | 1,021,794 | u825429292 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | [] | 1,021,800 | 1,021,794 | u825429292 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
void draw(size_t cols) {
cout << "Yes\n";
vector<vector<int>> matrix(cols + 1);
int next = 1;
for (size_t i = 0; i < cols + 1; ++i) {
if (i == 0) {
for (size_t j = 0; j < cols; ++j) {
matrix[i].push_back(next++);
}
} else {
for (s... | #include <bits/stdc++.h>
using namespace std;
void draw(size_t cols) {
cout << "Yes\n";
vector<vector<int>> matrix(cols + 1);
int next = 1;
for (size_t i = 0; i < cols + 1; ++i) {
if (i == 0) {
for (size_t j = 0; j < cols; ++j) {
matrix[i].push_back(next++);
}
} else {
for (s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,021,813 | 1,021,814 | u838194315 | cpp |
p03230 | #include <iostream>
#include <vector>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rep(i, q) for (int i = 0; q > i; i++)
int main() {
int n;
cin >> n;
bool ok = false;
int m = 2;
while (n * 2 >= m * (m + 1)) {
if (m * (m + 1) == n * 2) {
ok = true;
break;
} else {
... | #include <iostream>
#include <vector>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rep(i, q) for (int i = 0; q > i; i++)
int main() {
int n;
cin >> n;
bool ok = false;
int m = 2;
while (n * 2 >= m * (m + 1)) {
if (m * (m + 1) == n * 2) {
ok = true;
break;
} else {
... | [
"io.output.change"
] | 1,021,820 | 1,021,821 | u466161487 | cpp |
p03230 | #include "algorithm"
#include "bitset"
#include "cmath"
#include "complex"
#include "deque"
#include "fstream"
#include "iomanip"
#include "iostream"
#include "iterator"
#include "list"
#include "map"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
#i... | #include "algorithm"
#include "bitset"
#include "cmath"
#include "complex"
#include "deque"
#include "fstream"
#include "iomanip"
#include "iostream"
#include "iterator"
#include "list"
#include "map"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
#i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,021,826 | 1,021,827 | u957962914 | cpp |
p03230 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int a[1000][1000];
int main() {
int n, d, i, j, k;
scanf("%d", &n);
for (d = 1; d * d <= n + n; d++)
if (d * (d + 1) == n * 2)
break;
if (d * (d + 1) != n + n) {
puts("No");
return 0;
}
... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int a[1000][1000];
int main() {
int n, d, i, j, k;
scanf("%d", &n);
for (d = 1; d * d <= n + n; d++)
if (d * (d + 1) == n * 2)
break;
if (d * (d + 1) != n + n) {
puts("No");
return 0;
}
... | [
"expression.operation.binary.add"
] | 1,021,840 | 1,021,841 | u746018669 | cpp |
p03231 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
... | [
"variable_declaration.type.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,021,853 | 1,021,852 | u516525290 | cpp |
p03231 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
// aとbの最大公約数
long long gcd(long long a, long long b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
int main() {
long long N, M;
cin >> N >> M;
string S, T;
cin >> S >> T;
// 入力終了
// NとMの最大公約... | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
// aとbの最大公約数
long long gcd(long long a, long long b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
int main() {
long long N, M;
cin >> N >> M;
string S, T;
cin >> S >> T;
// 入力終了
// NとMの最大公約... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,021,856 | 1,021,857 | u537852947 | cpp |
p03231 | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, m;
cin >> n >> m;
string s, t;
cin >> s >> t;
... | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, m;
cin >> n >> m;
string s, t;
cin >> s >> t;
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,021,865 | 1,021,866 | u748819456 | cpp |
p03231 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll N, M;
cin >> N >> M;
string S, T;
cin >> S >> T;
ll lcm = N / __gcd(N, M) * M;
ll g = __gcd(N, M);
/*vecto... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll N, M;
cin >> N >> M;
string S, T;
cin >> S >> T;
ll lcm = N / __gcd(N, M) * M;
ll g = __gcd(N, M);
/*vecto... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove",
"call.arguments.change"
] | 1,021,879 | 1,021,880 | u138273120 | cpp |
p03231 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll N, M;
cin >> N >> M;
string S, T;
cin >> S >> T;
ll lcm = N / __gcd(N, M) * M;
ll g = __gcd(N, M);
/*vecto... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll N, M;
cin >> N >> M;
string S, T;
cin >> S >> T;
ll lcm = N / __gcd(N, M) * M;
ll g = __gcd(N, M);
/*vecto... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,021,881 | 1,021,880 | u138273120 | cpp |
p03231 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll N, M;
cin >> N >> M;
string S, T;
cin >> S >> T;
ll lcm = N / __gcd(N, M) * M;
ll g = __gcd(N, M);
/*vecto... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll N, M;
cin >> N >> M;
string S, T;
cin >> S >> T;
ll lcm = N / __gcd(N, M) * M;
ll g = __gcd(N, M);
/*vecto... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,021,881 | 1,021,882 | u138273120 | cpp |
p03231 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | [
"control_flow.return.add",
"control_flow.return.0.add",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,021,912 | 1,021,913 | u338903636 | cpp |
p03231 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, n) for (ll i = 1; i <= n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, n) for (ll i = 1; i <= n; i++)
#define sz(x) ll(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,021,921 | 1,021,922 | u363936720 | cpp |
p03231 | #include <iostream>
#include <numeric>
using namespace std;
int main() {
int N, M;
string S, T;
cin >> N >> M >> S >> T;
auto X = lcm<long long>(N, M);
auto Y = gcd(N, M);
bool b{1};
for (int i = 0; i != Y; ++i) {
if (S[i * X / Y] != T[i * X / Y]) {
b = 0;
break;
}
}
cout << (b ?... | #include <iostream>
#include <numeric>
using namespace std;
int main() {
int N, M;
string S, T;
cin >> N >> M >> S >> T;
auto X = lcm<long long>(N, M);
auto Y = gcd(N, M);
bool b{1};
for (int i = 0; i != Y; ++i) {
if (S[i * N / Y] != T[i * M / Y]) {
b = 0;
break;
}
}
cout << (b ?... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,021,928 | 1,021,929 | u462257825 | cpp |
p03231 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define INF (1 << 30) - 1
using ll = long long;
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
te... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define INF (1 << 30) - 1
using ll = long long;
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
te... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,021,939 | 1,021,940 | u667375816 | cpp |
p03231 | #include <bits/stdc++.h>
#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)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// 最大公約数を計算( gcd.cpp 参照)
ll gcd(ll a,... | #include <bits/stdc++.h>
#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)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// 最大公約数を計算( gcd.cpp 参照)
ll gcd(ll a,... | [
"variable_declaration.type.change"
] | 1,021,970 | 1,021,969 | u011438316 | cpp |
p03231 | #include <bits/stdc++.h>
#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)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// 最大公約数を計算( gcd.cpp 参照)
ll gcd(ll a,... | #include <bits/stdc++.h>
#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)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// 最大公約数を計算( gcd.cpp 参照)
ll gcd(ll a,... | [
"assignment.change"
] | 1,021,971 | 1,021,969 | u011438316 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.