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 |
|---|---|---|---|---|---|---|---|
p03240 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | [
"expression.operation.binary.remove",
"misc.opposites",
"variable_declaration.value.change"
] | 1,028,400 | 1,028,401 | u833393891 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,028,402 | 1,028,403 | u833393891 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int x[200], y[200], h[200], N;
void check(int X, int Y) {
int L, R;
for (int i = 0; i < N; i += 1) {
if (h[i])
L = max(L, abs(X - x[i]) + abs(Y - y[i]) + h[i]),
R = min(R, abs(X - x[i]) + abs(Y - y[i]) + h[i]);
else
R = min(R, abs(X - x[i]) + a... | #include <bits/stdc++.h>
using namespace std;
int x[200], y[200], h[200], N;
void check(int X, int Y) {
int L = 0, R = 2E9;
for (int i = 0; i < N; i += 1) {
if (h[i])
L = max(L, abs(X - x[i]) + abs(Y - y[i]) + h[i]),
R = min(R, abs(X - x[i]) + abs(Y - y[i]) + h[i]);
else
R = min(R, abs(X -... | [
"variable_declaration.value.change"
] | 1,028,408 | 1,028,409 | u018438536 | cpp |
p03240 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define pi 3.14159265
int main() {
long long ans = 0, i = 0, j = 0, k = 0, l = 0, N, h... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define pi 3.14159265
int main() {
long long ans = 0, i = 0, j = 0, k = 0, l = 0, N, h... | [
"control_flow.loop.for.condition.change"
] | 1,028,421 | 1,028,422 | u932175579 | cpp |
p03240 | #include <algorithm>
#include <iostream>
#include <string>
#define int long long
using namespace std;
signed main() {
int n, p = -1;
cin >> n;
int x[105], y[105], h[105];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] != 0)
p = i;
}
for (int X = 0; X <= 100; X++) {
for... | #include <algorithm>
#include <iostream>
#include <string>
#define int long long
using namespace std;
signed main() {
int n, p = -1;
cin >> n;
int x[105], y[105], h[105];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] != 0)
p = i;
}
for (int X = 0; X <= 100; X++) {
for... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,028,433 | 1,028,434 | u141968173 | cpp |
p03240 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> xv;
vector<int> yv;
vector<int> hv;
int tmpch;
bool check;
cin >> N;
xv.resize(N);
yv.resize(N);
hv.resize(N);
for (int i = 0; i < N; ++i) {
int x, y, z;
cin >> x >> y >> z... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> xv;
vector<int> yv;
vector<int> hv;
int tmpch;
bool check;
cin >> N;
xv.resize(N);
yv.resize(N);
hv.resize(N);
for (int i = 0; i < N; ++i) {
int x, y, z;
cin >> x >> y >> z... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,028,441 | 1,028,442 | u045291627 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<ll> vll;
#define F first;
#define S second;
#define PB push_back;
#define MP make_pair;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
ll n;
cin >> n;
ll arr[... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<ll> vll;
#define F first;
#define S second;
#define PB push_back;
#define MP make_pair;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
ll n;
cin >> n;
ll arr[... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,028,465 | 1,028,466 | u454021500 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<ll> vll;
#define F first;
#define S second;
#define PB push_back;
#define MP make_pair;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
ll n;
cin >> n;
ll arr[... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<ll> vll;
#define F first;
#define S second;
#define PB push_back;
#define MP make_pair;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
ll n;
cin >> n;
ll arr[... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,028,467 | 1,028,466 | u454021500 | cpp |
p03240 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int x[101], y[101], h[101];
for (int i = 0; i < N; i++)
cin >> x[i] >> y[i] >> h[i];
for (int posY = 0; posY <= 100; p... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int x[101], y[101], h[101];
for (int i = 0; i < N; i++)
cin >> x[i] >> y[i] >> h[i];
for (int posY = 0; posY <= 100; p... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"function.return_value.change"
] | 1,028,494 | 1,028,495 | u806800460 | cpp |
p03240 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ROF(i, b, a) for (int i = (b); i > (a); --i)
#define REP(i,... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ROF(i, b, a) for (int i = (b); i > (a); --i)
#define REP(i,... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,028,509 | 1,028,508 | u244712228 | cpp |
p03240 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
t... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
t... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,028,535 | 1,028,536 | u355335354 | cpp |
p03240 | #include <algorithm>
#include <iostream>
#include <tuple>
//#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int H;
int N;
vector<vector<int>> v;
int ansx, ansy, ansh;
int main() {
cin >> N;
rep(i, N) {
int x, y, h;
cin >> x >> y >... | #include <algorithm>
#include <iostream>
#include <tuple>
//#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int H;
int N;
vector<vector<int>> v;
int ansx, ansy, ansh;
int main() {
cin >> N;
rep(i, N) {
int x, y, h;
cin >> x >> y >... | [
"literal.number.change",
"call.arguments.change"
] | 1,028,541 | 1,028,542 | u180262908 | cpp |
p03240 | #include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>... | #include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,028,566 | 1,028,567 | u159757494 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
... | [
"control_flow.branch.if.condition.change"
] | 1,028,585 | 1,028,586 | u287015418 | cpp |
p03240 | #include <bits/stdc++.h>
#define chmin(a, b) ((a) = min((a), (b)))
#define chmax(a, b) ((a) = max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int MOD = 1e9 + 7;
ll INF = 1e18;
int dx[] = {1,... | #include <bits/stdc++.h>
#define chmin(a, b) ((a) = min((a), (b)))
#define chmax(a, b) ((a) = max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int MOD = 1e9 + 7;
ll INF = 1e18;
int dx[] = {1,... | [
"call.add"
] | 1,028,592 | 1,028,593 | u049420296 | cpp |
p03240 | #include <bits/stdc++.h>
#define debug 0
using namespace std;
typedef long long lint;
const int maxn = 1e2 + 5;
struct pr {
lint x, y;
};
lint n, i, j, h;
pr v[maxn];
lint b[maxn];
inline lint ab(lint x) { return (x < 0 ? -x : x); }
inline lint dist(pr x, pr y) { // manhattan
return (ab(x.x - y.x) + ab(x.y - ... | #include <bits/stdc++.h>
#define debug 0
using namespace std;
typedef long long lint;
const int maxn = 1e2 + 5;
struct pr {
lint x, y;
};
lint n, i, j, h;
pr v[maxn];
lint b[maxn];
inline lint ab(lint x) { return (x < 0 ? -x : x); }
inline lint dist(pr x, pr y) { // manhattan
return (ab(x.x - y.x) + ab(x.y - ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,028,612 | 1,028,611 | u785619166 | cpp |
p03240 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int cx, cy;
long ch;
cin >> n;
int *x = new int[n];
int *y = new int[n];
long *h = new long[n];
for (int i = 0; i < n; i++) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int cx, cy;
long ch;
cin >> n;
int *x = new int[n];
int *y = new int[n];
long *h = new long[n];
for (int i = 0; i < n; i++) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,028,638 | 1,028,639 | u149945867 | cpp |
p03240 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int x[100];
int y[100];
int h[100];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
int i, j; //中心Cx, Cy
int hmax;
//マス
for (i = 0; i <= 100; i++) {
for (j = 0; j <= 100; j++) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int x[100];
int y[100];
int h[100];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
int i, j; //中心Cx, Cy
int hmax;
//マス
for (i = 0; i <= 100; i++) {
for (j = 0; j <= 100; j++) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,028,647 | 1,028,648 | u482092601 | cpp |
p03240 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int x[100];
int y[100];
int h[100];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
int i, j; //中心Cx, Cy
int hmax;
//マス
for (i = 0; i <= 100; i++) {
for (j = 0; j <= 100; j++) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int x[100];
int y[100];
int h[100];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
int i, j; //中心Cx, Cy
int hmax;
//マス
for (i = 0; i <= 100; i++) {
for (j = 0; j <= 100; j++) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 1,028,649 | 1,028,648 | u482092601 | cpp |
p03240 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main(void) {
int n;
cin >> n;
int b = numeric_limits<int>::max();
map<pair<int, int>, int> m;
for (int i = 0; i < n; i++) {
int x, y, h;
cin >> x >> y >> h;
m[make_pair(x, y)] = h;
b = min(x, min(y, h));
}
for (... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main(void) {
int n;
cin >> n;
int b = numeric_limits<int>::max();
map<pair<int, int>, int> m;
for (int i = 0; i < n; i++) {
int x, y, h;
cin >> x >> y >> h;
m[make_pair(x, y)] = h;
b = min(b, h);
}
for (int x = ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,028,655 | 1,028,656 | u774263141 | cpp |
p03240 | #include <cstdio>
int x[105], y[105], h[105];
bool vis[105][105];
inline int abs(int x) { return x >= 0 ? x : -x; }
inline int max(int a, int b) { return a > b ? a : b; }
int main() {
int n, S;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d%d%d", x + i, y + i, h + i), S = h[i] ? i : S,
... | #include <cstdio>
int x[105], y[105], h[105];
bool vis[105][105];
inline int abs(int x) { return x >= 0 ? x : -x; }
inline int max(int a, int b) { return a > b ? a : b; }
int main() {
int n, S;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d%d%d", x + i, y + i, h + i), S = h[i] ? i : S,
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,028,662 | 1,028,663 | u210490856 | cpp |
p03240 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define INF 999999999
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> x(n);
vector<int> y(n);
vector<l... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define INF 999999999
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> x(n);
vector<int> y(n);
vector<l... | [
"variable_declaration.type.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.else.add"
] | 1,028,666 | 1,028,667 | u185306658 | cpp |
p03240 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define INF 999999999
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> x(n);
vector<int> y(n);
vector<l... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define INF 999999999
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> x(n);
vector<int> y(n);
vector<l... | [
"variable_declaration.type.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.else.add"
] | 1,028,666 | 1,028,668 | u185306658 | cpp |
p03240 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int main() {
int n... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int main() {
int n... | [
"literal.number.change",
"call.arguments.change"
] | 1,028,674 | 1,028,675 | u521389909 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
template <class T> inline bool... | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
template <class T> inline bool... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,028,678 | 1,028,679 | u901397311 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
template <class T> inline bool... | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
template <class T> inline bool... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 1,028,680 | 1,028,679 | u901397311 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long x[N], y[N], h[N];
int able_h = 0;
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] > 0) {
able_h = i;
}
}
for (long i = 0; i <= 100; i++) {
for (long j = 0; j <= 100; j++) {
lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long x[N], y[N], h[N];
int able_h = 0;
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] > 0) {
able_h = i;
}
}
for (long i = 0; i <= 100; i++) {
for (long j = 0; j <= 100; j++) {
lo... | [
"control_flow.branch.if.condition.change"
] | 1,028,681 | 1,028,682 | u489117389 | cpp |
p03240 | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push... | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define hi cerr << "hi" << endl;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,028,699 | 1,028,700 | u130196064 | cpp |
p03240 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, H, Cx, Cy, h_tmp;
cin >> N;
vector<int> x(N);
vector<int> y(N);
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> x[i];
cin >> y[i];
cin >> h[i];
}
for (int j = 0; j <= 100; j++) {
for ... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, H, Cx, Cy, h_tmp;
cin >> N;
vector<int> x(N);
vector<int> y(N);
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> x[i];
cin >> y[i];
cin >> h[i];
}
for (int j = 0; j <= 100; j++) {
for ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,028,711 | 1,028,712 | u749475370 | cpp |
p03240 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERS... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERS... | [
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,028,726 | 1,028,725 | u164300951 | cpp |
p03240 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 1000000000000000000
using namespace std;
signed main() {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 1000000000000000000
using namespace std;
signed main() {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,028,809 | 1,028,810 | u807998890 | cpp |
p03240 | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
#define reps(i, N) for (int i = 1; i <= (N); i++)
#define repr(i, N) for (int i = (N)-1; i >= 0; i--)
#define pub push_back
template <typename T> void chmax(T &a, T b) { a = max(a, b... | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
#define reps(i, N) for (int i = 1; i <= (N); i++)
#define repr(i, N) for (int i = (N)-1; i >= 0; i--)
#define pub push_back
template <typename T> void chmax(T &a, T b) { a = max(a, b... | [
"expression.operation.binary.remove"
] | 1,028,813 | 1,028,814 | u073946233 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int X[105], Y[105], H[105];
int idx = -1;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i] >> H[i];
if (H[i] > 0) {
idx = i;
}
}
for (int y = 0; y <= 100; y++) {
for (int x = 0; x <= 100; x++) {
int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int X[105], Y[105], H[105];
int idx = -1;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i] >> H[i];
if (H[i] > 0) {
idx = i;
}
}
for (int y = 0; y <= 100; y++) {
for (int x = 0; x <= 100; x++) {
int... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 1,028,823 | 1,028,822 | u239239546 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
#define INF 1 << 30
#define REP(i, n) for (ll i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for (ll i = (k); i < (int)(n); i++)
int n;
ll x[100], y[100], h[100];
int main() {
cin >> n;
REP(i, n) cin >> x[i] >> y... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
#define INF 1 << 30
#define REP(i, n) for (ll i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for (ll i = (k); i < (int)(n); i++)
int n;
ll x[100], y[100], h[100];
int main() {
cin >> n;
REP(i, n) cin >> x[i] >> y... | [
"call.arguments.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,028,826 | 1,028,825 | u195402105 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N), y(N), h(N);
int a, b, c;
for (int i = 0; i < N; i++) {
cin >> x.at(i) >> y.at(i) >> h.at(i);
if (h.at(i) != 0)
a = x.at(i), b = y.at(i), c = h.at(i);
}
int ans, sub, count = 0;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N), y(N), h(N);
int a, b, c;
for (int i = 0; i < N; i++) {
cin >> x.at(i) >> y.at(i) >> h.at(i);
if (h.at(i) != 0)
a = x.at(i), b = y.at(i), c = h.at(i);
}
int ans, sub, count = 0;
for (int i = 0; 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.remove"
] | 1,028,829 | 1,028,830 | u239087789 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n], y[n], h[n];
int num;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] > 0)
num = i;
}
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <= 100; j++) {
int now = h[num] + abs(i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n], y[n], h[n];
int num;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] > 0)
num = i;
}
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <= 100; j++) {
int now = h[num] + abs(i ... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,028,843 | 1,028,844 | u357265888 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n], y[n], h[n];
int num;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] > 0)
num = i;
}
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <= 100; j++) {
int now = h[num] + abs(i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n], y[n], h[n];
int num;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
if (h[i] > 0)
num = i;
}
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <= 100; j++) {
int now = h[num] + abs(i ... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,028,845 | 1,028,844 | u357265888 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (int i = (a), i##Len_ = (b); i < i##Len_; i++)
const char *LF = "\n";
namespace {
struct _ {
_() {
cin.tie(0);
ios::sync_with_stdio(false);
}
} a;
} // namespace
signed main() {
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (int i = (a), i##Len_ = (b); i < i##Len_; i++)
const char *LF = "\n";
namespace {
struct _ {
_() {
cin.tie(0);
ios::sync_with_stdio(false);
}
} a;
} // namespace
signed main() {
int ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,028,858 | 1,028,859 | u248306486 | cpp |
p03240 | // ABC112_C
#include <algorithm>
#include <iostream>
#include <tuple> // std::tuple std::get
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++) // 0 ~ n-1
int main() {
// input
ll N, idx = 0;
cin >> N;
vector<ll> X(N), Y(N), H(N);
REP(i, N) {
cin >>... | // ABC112_C
#include <algorithm>
#include <iostream>
#include <tuple> // std::tuple std::get
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++) // 0 ~ n-1
int main() {
// input
ll N, idx = 0;
cin >> N;
vector<ll> X(N), Y(N), H(N);
REP(i, N) {
cin >>... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,028,874 | 1,028,875 | u870998297 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD (int)(1e9 + 7)
#define INF (int)2e9
int main() {
int n, m;
cin >> n >> m;
int ans = 1;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD (int)(1e9 + 7)
#define INF (int)2e9
int main() {
int n, m;
cin >> n >> m;
int ans = 1;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
i... | [
"assignment.change"
] | 1,028,880 | 1,028,881 | u263654061 | cpp |
p03241 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 1;
for (int A = 1; A * A <= M; A++) {
if (M % A != 0)
continue;
int B = M / A;
// if((long)A*N <= M) ans = max(ans, A);
/... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 1;
for (int A = 1; A * A <= M; A++) {
if (M % A != 0)
continue;
int B = M / A;
if ((long)A * N <= M)
ans = max(ans, A);... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,028,882 | 1,028,883 | u263654061 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | [
"expression.operation.binary.add"
] | 1,028,884 | 1,028,885 | u461336793 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | [
"expression.operation.binary.remove"
] | 1,028,886 | 1,028,887 | u812973725 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | [
"expression.operation.binary.add"
] | 1,028,888 | 1,028,887 | u812973725 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#define boost \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#define boost \
ios_base::sync_with_stdio(false); ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,028,891 | 1,028,892 | u130834422 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
priority_queue<ll> ret;
void divisor(long long n) {
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push(i);
if (i * i != n)
ret.push(n / i);
}
}
// sort(re... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
priority_queue<ll> ret;
void divisor(long long n) {
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push(i);
if (i * i != n)
ret.push(n / i);
}
}
// sort(re... | [
"control_flow.loop.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,028,895 | 1,028,894 | u910028046 | cpp |
p03241 | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
ll mx = 1;
for (ll i = m - 1; i >= 2; i--) {
if ((i % 2 == 0 && m % 2 != 0)) {
continue;
}
ll u = m - i * (n - 1);
if (u <= 0) {
continue;
}
if (u % ... | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
ll mx = 1;
for (ll i = m - 2 * (n - 1); i >= 2; i--) {
if ((i % 2 == 0 && m % 2 != 0)) {
continue;
}
ll u = m - i * (n - 1);
if (u <= 0) {
continue;
}
... | [
"control_flow.loop.for.initializer.change"
] | 1,028,900 | 1,028,901 | u380579419 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, ans = -1;
cin >> N >> M;
vector<int> divisor;
for (int i = 1; (long long)i * i <= M; i++) {
if (M % i == 0) {
if (M >= (long long)i * N) {
ans = max(ans, i);
}
if (i >= N) {
ans = max(ans, i);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, ans = -1;
cin >> N >> M;
vector<int> divisor;
for (int i = 1; (long long)i * i <= M; i++) {
if (M % i == 0) {
if (M >= (long long)i * N) {
ans = max(ans, i);
}
if (i >= N) {
ans = max(ans, M / i);
... | [
"assignment.change"
] | 1,028,904 | 1,028,905 | u303453927 | cpp |
p03241 | #include "bits/stdc++.h"
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define vi vector<int>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cerr << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) ... | #include "bits/stdc++.h"
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define vi vector<int>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cerr << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,028,906 | 1,028,907 | u747184036 | cpp |
p03241 | #include "bits/stdc++.h"
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define vi vector<int>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cerr << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) ... | #include "bits/stdc++.h"
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define vi vector<int>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cerr << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,028,908 | 1,028,907 | u747184036 | cpp |
p03241 | #include "bits/stdc++.h"
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define vi vector<int>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cerr << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) ... | #include "bits/stdc++.h"
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define vi vector<int>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cerr << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,028,909 | 1,028,907 | u747184036 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int i, j, k, l = -1, n, m;
string s;
cin >> n >> m;
for (i = 1; i * i <= m; i++) {
if (m % i == 0 && i <= m / n)
l = max(i, l);
if (m % i == 0 && m % (... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int i, j, k, l = -1, n, m;
string s;
cin >> n >> m;
for (i = 1; i * i <= m; i++) {
if (m % i == 0 && i <= m / n)
l = max(i, l);
if (m % i == 0 && m % (... | [
"assignment.change"
] | 1,028,914 | 1,028,915 | u595893956 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int ans = 1;
for (int i = 2; i * i <= M; i++) {
if (M % i == 0) {
int x = M / i;
if (x >= N) {
ans = max(ans, i);
}
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int ans = 1;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
int x = M / i;
if (x >= N) {
ans = max(ans, i);
}
i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,028,916 | 1,028,917 | u412039195 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> mm;
for (ll i = 2; i <= sqrt(m); i++) {
if (m % i == 0) {
mm.push_back(i);
if (i * i != m)
mm.push_back(m / i);
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> mm;
for (ll i = 1; i <= sqrt(m); i++) {
if (m % i == 0) {
mm.push_back(i);
if (i * i != m)
mm.push_back(m / i);
}
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 1,028,918 | 1,028,919 | u294721290 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
const int INF = INT_MAX / 2;
int main() {
ll N, M;
cin >> N >> M;
ll ans;
for (int i = M / N; i >= 1; i--) {
if (M % N % i == 0) {
ans = i;
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
const int INF = INT_MAX / 2;
int main() {
ll N, M;
cin >> N >> M;
ll ans;
for (int i = M / N; i >= 1; i--) {
if ((M - N * i) % i == 0) {
ans = i;
break;
}
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change"
] | 1,028,920 | 1,028,921 | u777258731 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int yakusu_count = 1;
vector<long long> yakusu(m);
yakusu.at(0) = m;
int current = 1;
for (int i = m / 2; i > 0; i--) {
if (m % i == 0) {
yakusu.at(current)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int yakusu_count = 1;
vector<long long> yakusu(1000000);
yakusu.at(0) = m;
int current = 1;
for (int i = m / 2; i > 0; i--) {
if (m % i == 0) {
yakusu.at(cu... | [] | 1,028,926 | 1,028,927 | u384683861 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int yakusu_count = 1;
vector<long long> yakusu(n);
yakusu.at(0) = m;
int current = 1;
for (int i = m / 2; i > 0; i--) {
if (m % i == 0) {
yakusu.at(current)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int yakusu_count = 1;
vector<long long> yakusu(1000000);
yakusu.at(0) = m;
int current = 1;
for (int i = m / 2; i > 0; i--) {
if (m % i == 0) {
yakusu.at(cu... | [] | 1,028,928 | 1,028,927 | u384683861 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,028,932 | 1,028,933 | u989306199 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,028,934 | 1,028,935 | u132364782 | cpp |
p03241 | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int ans = 1;
for (int i = 2; i * i <= M; i++) {
if (M % i > 0)
continue;
int j = M / i;
if (j >= N)
ans = max(ans, i);
if (i >= N)
ans = max(ans, j);
... | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int ans = 0;
for (int i = 1; i * i <= M; i++) {
if (M % i > 0)
continue;
int j = M / i;
if (j >= N)
ans = max(ans, i);
if (i >= N)
ans = max(ans, j);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,028,936 | 1,028,937 | u464052933 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | [
"literal.number.change",
"call.arguments.change"
] | 1,028,938 | 1,028,939 | u454081619 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 1,028,940 | 1,028,939 | u454081619 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using pii = pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
int ans = 1;
for (int i = 2; i * i <= M; i++) {
if (M % i == 0) {
if (i >= N)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using pii = pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
int ans = 1;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
if (i >= N)
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,028,941 | 1,028,942 | u494249944 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
// macro
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define all(v) v.begin(), v.end()
// code starts
int main() {
int n, m;
cin >> n >> m;
int i;
int ans = 1;
for (i = 2; i * i <= m; i++) {
if (m % i == 0) {
if (i >= n)
... | #include <bits/stdc++.h>
using namespace std;
// macro
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define all(v) v.begin(), v.end()
// code starts
int main() {
int n, m;
cin >> n >> m;
int i;
int ans = 1;
for (i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (i >= n)
... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,028,945 | 1,028,946 | u989336028 | cpp |
p03241 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int N, M;
vector<int> fact;
int32_t main() {
cin >> N >> M;
for (int i = 2; i * i <= M; i++) {
if (M % i == 0) {
fact.push_back(i);
fact.push_back(M / i);
}
}
sort(fact.begin(), fact.end());
int l = 0, r = fact.size() - ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int N, M;
vector<int> fact;
int32_t main() {
cin >> N >> M;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
fact.push_back(i);
fact.push_back(M / i);
}
}
sort(fact.begin(), fact.end());
int l = 0, r = fact.size() - ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 1,028,956 | 1,028,957 | u350617416 | cpp |
p03241 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | [
"expression.operation.binary.remove"
] | 1,028,960 | 1,028,961 | u941028483 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
#define vecout(V) \
for (int i = 0; i < V.size(); i++) { \
cout << V[i] << endl; ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
#define vecout(V) \
for (int i = 0; i < V.size(); i++) { \
cout << V[i] << endl; ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,028,962 | 1,028,963 | u247576416 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
int N, M;
cin >> N >> M;
vector<int> divid;
for (int i = 1; i <= (double)sqrt(M); i++) {
if (M % i == 0) {
divid.push_back(i);
divid.push_back(M / i);
}
}
sort(divid.begin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
int N, M;
cin >> N >> M;
vector<int> divid;
for (int i = 1; i <= (double)sqrt(M); i++) {
if (M % i == 0) {
divid.push_back(i);
divid.push_back(M / i);
}
}
sort(divid.begin... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,028,966 | 1,028,967 | u630211216 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using vi = vector<lint>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int main() {
lint n, m;
cin ... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using vi = vector<lint>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int main() {
lint n, m;
cin ... | [
"expression.operation.unary.arithmetic.add",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,028,968 | 1,028,969 | u208844959 | cpp |
p03241 | #include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define LIMIT(d_in, d_min, d_max) max(d_min, min(d_max, d_in))
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute() {
lint N, M;
cin ... | #include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define LIMIT(d_in, d_min, d_max) max(d_min, min(d_max, d_in))
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute() {
lint N, M;
cin ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,028,979 | 1,028,980 | u874525170 | cpp |
p03241 | #include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define LIMIT(d_in, d_min, d_max) max(d_min, min(d_max, d_in))
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute() {
lint N, M;
cin ... | #include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define LIMIT(d_in, d_min, d_max) max(d_min, min(d_max, d_in))
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute() {
lint N, M;
cin ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 1,028,981 | 1,028,980 | u874525170 | cpp |
p03241 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll gcd(ll a, ll b);
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
ll n, m;
cin >> n >> m;
vector<ll> div... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll gcd(ll a, ll b);
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
ll n, m;
cin >> n >> m;
vector<ll> div... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,028,986 | 1,028,987 | u755121033 | cpp |
p03241 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll gcd(ll a, ll b);
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
int n, m;
cin >> n >> m;
vector<int> d... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll gcd(ll a, ll b);
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
ll n, m;
cin >> n >> m;
vector<ll> div... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 1,028,988 | 1,028,987 | u755121033 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define MAX_N (100010)
int main() {
ll N, M;
scanf("%lld%lld"... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define MAX_N (100010)
int main() {
ll N, M;
scanf("%lld%lld"... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,028,989 | 1,028,990 | u519382463 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = 0; (i) < (ll)(n); ++(i))
#define REPN(i, m, n) for (ll(i) = m; (i) < (ll)(n); ++(i))
#define REP_REV(i, n) for (ll(i) = (ll)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (ll(i) = (ll)(n)-1; (i) >= m; --(i))
#define INF 2e9
#define IN... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = 0; (i) < (ll)(n); ++(i))
#define REPN(i, m, n) for (ll(i) = m; (i) < (ll)(n); ++(i))
#define REP_REV(i, n) for (ll(i) = (ll)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (ll(i) = (ll)(n)-1; (i) >= m; --(i))
#define INF 2e9
#define IN... | [
"identifier.change",
"call.function.change"
] | 1,028,991 | 1,028,992 | u127768253 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,028,995 | 1,028,996 | u427344224 | cpp |
p03241 | // AtCoder template
// 見た奴全員saba!
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll m;
cin >> m;
ll ans = 1LL;
for (ll i = 1LL; i * i <= m; ++i) {
if (m % i == 0... | // AtCoder template
// 見た奴全員saba!
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll m;
cin >> m;
ll ans = 1LL;
for (ll i = 1LL; i * i <= m; ++i) {
if (m % i == 0... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,029,003 | 1,029,004 | u083190434 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, l) for (lli i = s; i < l; i++)
#define DEBUG 0
#define INF (1LL << 50)
#define MOD 1000000007
vector<lli> divisorList(lli num) {
vector<lli> v;
for (lli i = 1; i * i <= num; i++) {
if (num % i == 0) {
v.push_back... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, l) for (lli i = s; i < l; i++)
#define DEBUG 0
#define INF (1LL << 50)
#define MOD 1000000007
vector<lli> divisorList(lli num) {
vector<lli> v;
for (lli i = 1; i * i <= num; i++) {
if (num % i == 0) {
v.push_back... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,029,008 | 1,029,009 | u041513069 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
const ll MOD = (ll)1e9 + 7;
const ll H... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
const ll MOD = (ll)1e9 + 7;
const ll H... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,029,010 | 1,029,011 | u077337864 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using ll = long long;
using pll = pair<ll, ll>;
constexpr ll INF = (1LL << 60);
constexpr ll MOD = (1e9 + 7);
// constexpr ll MOD = (998244353);
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using ll = long long;
using pll = pair<ll, ll>;
constexpr ll INF = (1LL << 60);
constexpr ll MOD = (1e9 + 7);
// constexpr ll MOD = (998244353);
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
r... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 1,029,014 | 1,029,015 | u423624748 | cpp |
p03241 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = int(n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main() {
ll N, M;
cin >> N >> M;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = int(n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main() {
ll N, M;
cin >> N >> M;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,016 | 1,029,017 | u203033720 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 1;
for (long long i = 2; i <= sqrt(m) + 1; i++) {
if (m % i == 0) {
if (m / i >= n)
ans = max(ans, i);
if (i >= n)
ans = max(ans, m / i);
}
}
cout << ans << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 0;
for (long long i = 1; i <= sqrt(m) + 1; i++) {
if (m % i == 0) {
if (m / i >= n)
ans = max(ans, i);
if (i >= n)
ans = max(ans, m / i);
}
}
cout << ans << endl;
return ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,020 | 1,029,021 | u370608397 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#d... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#d... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,029,022 | 1,029,023 | u863044225 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#d... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#d... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,029,024 | 1,029,025 | u863044225 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,029,026 | 1,029,027 | u649915042 | cpp |
p03241 | #include <bits/stdc++.h>
#define MAXN 233333
using namespace std;
typedef long long LL;
LL a[MAXN], top, ans;
int main() {
LL n, m;
cin >> n >> m;
for (int i = 1; i <= int(sqrt(m * 1.0)) + 1; i++) {
if (m % i == 0) {
a[++top] = i;
}
}
for (int i = top; i >= 1; i--) {
if (a[i] * n <= m) {
... | #include <bits/stdc++.h>
#define MAXN 233333
using namespace std;
typedef long long LL;
LL a[MAXN], top, ans;
int main() {
LL n, m;
cin >> n >> m;
for (int i = 1; i <= LL(sqrt(m * 1.0)) + 1; i++) {
if (m % i == 0) {
a[++top] = i;
}
}
for (int i = top; i >= 1; i--) {
if (a[i] * n <= m) {
... | [
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change"
] | 1,029,031 | 1,029,032 | u839072554 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
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)
int MOD = 1000000007;
signed main() {
int n, m;
c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
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)
int MOD = 1000000007;
signed main() {
int n, m;
c... | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,029,037 | 1,029,036 | u313043608 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
ll answer = 1;
for (ll i = 2; i * i <= M; i++) {
if (M % i == 0) {
if (M / i >= N) {
answer = max(answer, i);
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
ll answer = 1;
for (ll i = 1; i * i <= M; i++) {
if (M % i == 0) {
if (M / i >= N) {
answer = max(answer, i);
}... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,038 | 1,029,039 | u759177660 | cpp |
p03241 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,029,047 | 1,029,048 | u114234520 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define el endl
#define INF 1e8
typedef long long ll;
typedef long double ld;
int main() {
int n, m;
cin >> n >> m;
int ans = 1;
for (int i = 1; i * i <= m; i++) {
if (m % i != 0)
cont... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define el endl
#define INF 1e8
typedef long long ll;
typedef long double ld;
int main() {
int n, m;
cin >> n >> m;
int ans = 1;
for (int i = 1; i * i <= m; i++) {
if (m % i != 0)
cont... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,029,068 | 1,029,069 | u532086793 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int n, m, mx = 1;
bool check(int x) {
int a = m / x;
return a >= n;
}
int main() {
cin >> n >> m;
for (int i = 2; i * i <= m; i++) {
if (m % i == 0) {
int j = m / i;
if (check(i)) {
mx = max(mx, i);
}
if (check(j)) {
mx = ... | #include <bits/stdc++.h>
using namespace std;
int n, m, mx = 1;
bool check(int x) {
int a = m / x;
return a >= n;
}
int main() {
cin >> n >> m;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
int j = m / i;
if (check(i)) {
mx = max(mx, i);
}
if (check(j)) {
mx = ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,072 | 1,029,073 | u701136990 | cpp |
p03241 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Silviase
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
class
DPartition {
public:
void solve(std::istream &in, st... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Silviase
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
class
DPartition {
public:
void solve(std::istream &in, st... | [
"expression.operation.binary.add"
] | 1,029,076 | 1,029,077 | u902576227 | cpp |
p03241 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define pb push_back
#define sz(s) (int)(s.size())
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define Unique(n) (n).erase(unique(all(n)), (n).end())
#define NumofDigits(n) ((l... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define pb push_back
#define sz(s) (int)(s.size())
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define Unique(n) (n).erase(unique(all(n)), (n).end())
#define NumofDigits(n) ((l... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,029,086 | 1,029,087 | u973466769 | cpp |
p03241 | /* Simplicity and Goodness */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
void my_dbg() { c... | /* Simplicity and Goodness */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
void my_dbg() { c... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,029,088 | 1,029,089 | u777549027 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void chmax(ll &a, ll b) {
if (a < b)
a = b;
}
int main() {
ll N, M;
cin >> N >> M;
ll ans = 1;
for (int i = 2; i * i <= M; i++) {
if (M % i == 0 && i * N <= M) {
chmax(ans, i);
if (M / i * N <= M) {
chmax(ans, M... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void chmax(ll &a, ll b) {
if (a < b)
a = b;
}
int main() {
ll N, M;
cin >> N >> M;
ll ans = 1;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0 && i * N <= M) {
chmax(ans, i);
if (M / i * N <= M) {
chmax(ans, M... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,092 | 1,029,093 | u538808095 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, M;
cin >> N >> M;
vector<long long> vec;
for (long long i = 1; i <= (long long)pow(M, 0.5); i++) {
if (M % i == 0) {
if (M / i < M / N) {
long long ans = M / i;
cout << ans << endl;
exit(0);
} e... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, M;
cin >> N >> M;
vector<long long> vec;
for (long long i = 1; i <= (long long)pow(M, 0.5); i++) {
if (M % i == 0) {
if (M / i <= M / N) {
long long ans = M / i;
cout << ans << endl;
exit(0);
} ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,029,094 | 1,029,095 | u194393111 | cpp |
p03241 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#... | [
"expression.operation.binary.remove"
] | 1,029,102 | 1,029,103 | u553461888 | cpp |
p03241 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 1,029,104 | 1,029,103 | u553461888 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define rep4(i, s, n) for (ll i = (s); i ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define rep4(i, s, n) for (ll i = (s); i ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,112 | 1,029,113 | u901282405 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 0;
for (int i = 2; i * i <= M; i++) {
if (M % i == 0) {
if (M / i >= N) {
ans = max(ans, i);
}
if (i >= N) {
ans = max(ans, M / i);
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 0;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
if (M / i >= N) {
ans = max(ans, i);
}
if (i >= N) {
ans = max(ans, M / i);
}
}
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,114 | 1,029,115 | u424374375 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.