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 |
|---|---|---|---|---|---|---|---|
p03241 | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
int 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)
... | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 0;
for (ll i = 1; i * i <= m; i++)
if (m % i == 0) {
if (m / i >= n)
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 1,029,541 | 1,029,543 | u052247353 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
ll n, m;
ll ans;
int main(void) {
// Here your code !
scanf("%lld %lld", &n, &m);
ans = 1LL;
for (ll i = 1LL; i * i <= m; ++i) {
if (m % i > 0)
continue;
l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
ll n, m;
ll ans;
int main(void) {
// Here your code !
scanf("%lld %lld", &n, &m);
ans = 1LL;
for (ll i = 1LL; i * i <= m; ++i) {
if (m % i > 0)
continue;
l... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,029,544 | 1,029,545 | u497422208 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define BR "\n"
#define SP " "
#define SHOW(x) \
for (int i = 0; i < x.size(); i++) { \
cout << x[i] << SP; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define BR "\n"
#define SP " "
#define SHOW(x) \
for (int i = 0; i < x.size(); i++) { \
cout << x[i] << SP; ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,029,546 | 1,029,547 | u339233484 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> vec;
ll c = (ll)sqrt((double)M);
for (ll a = 1; a <= c; a++) {
if (!(M % a)) {
vec.push_back(a);
}
}
vec.push_back(M);
sort(vec.begin(), vec.end());
reverse(vec.begi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> vec;
ll c = (ll)sqrt((double)M);
for (ll a = 1; a <= c; a++) {
if (!(M % a)) {
vec.push_back(a);
vec.push_back(M / a);
}
}
sort(vec.begin(), vec.end());
reverse... | [
"expression.operation.binary.add"
] | 1,029,548 | 1,029,549 | u904123392 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define trace(var) cerr << ">>> " << #var << " = " << var << endl;
int main() {
int n;
cin >> n;
int m;
cin >> m;
int ans = 1;
for (int i = 2; i < m; ++i) {
if (i * i > m)
break;
if (m % i == 0 && m ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define trace(var) cerr << ">>> " << #var << " = " << var << endl;
int main() {
int n;
cin >> n;
int m;
cin >> m;
int ans = 1;
for (int i = 1; i < m; ++i) {
if (i * i > m)
break;
if (m % i == 0 && m ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,550 | 1,029,551 | u161323909 | cpp |
p03241 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m % n == 0) {
cout << n << endl;
} else {
for (n = m / n; n > 0; n--) {
if (m % n == 0) {
cout << n << endl;
return 0;
}
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m % n == 0) {
cout << m / n << endl;
} else {
for (n = m / n; n > 0; n--) {
if (m % n == 0) {
cout << n << endl;
return 0;
}
}
}
return 0;
} | [
"expression.operation.binary.add"
] | 1,029,558 | 1,029,559 | u384161668 | cpp |
p03241 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m % n == 0) {
cout << n << endl;
} else {
for (n; n > 0; n--) {
if (m % n == 0) {
cout << n << endl;
return 0;
}
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m % n == 0) {
cout << m / n << endl;
} else {
for (n = m / n; n > 0; n--) {
if (m % n == 0) {
cout << n << endl;
return 0;
}
}
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 1,029,560 | 1,029,559 | u384161668 | cpp |
p03241 | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define Rep(i, n)... | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define Rep(i, n)... | [
"call.add"
] | 1,029,563 | 1,029,564 | u714724786 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#... | [
"expression.operation.binary.add"
] | 1,029,565 | 1,029,566 | u001566280 | cpp |
p03241 | #include <math.h>
#include <stdio.h>
int main(void) {
int M, N, a;
scanf("%d", &N);
scanf("%d", &M);
double b = sqrt(M * 1.0);
a = 0;
for (int i = 1; i <= b * 1; i++) {
if (M % i == 0 && M / N >= i) {
if (a < i) {
a = i;
}
if (a < M / i && M / N >= M / i) {
a = i;
... | #include <math.h>
#include <stdio.h>
int main(void) {
int M, N, a;
scanf("%d", &N);
scanf("%d", &M);
double b = sqrt(M * 1.0);
a = 0;
for (int i = 1; i <= b * 1; i++) {
if (M % i == 0 && M / N >= i) {
if (a < i) {
a = i;
}
if (a < M / i && M / N >= M / i) {
a = M / i;
... | [
"assignment.change"
] | 1,029,572 | 1,029,573 | u731154599 | cpp |
p03241 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,029,576 | 1,029,577 | u222293734 | cpp |
p03241 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define endl '\n'
#define ll ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define endl '\n'
#define ll ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,578 | 1,029,579 | u285118720 | cpp |
p03241 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define endl '\n'
#define ll ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define endl '\n'
#define ll ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,580 | 1,029,579 | u285118720 | cpp |
p03241 | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <fstream>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signe... | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <fstream>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signe... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,029,581 | 1,029,582 | u575781793 | cpp |
p03241 | #include <algorithm>
#include <array>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
template <typename T> std::vector<T> divisor_list(const T N) {
std::vector<T> result;
for (T val = 2; val * val <= N; val++) {
if (N % val == 0)... | #include <algorithm>
#include <array>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
template <typename T> std::vector<T> divisor_list(const T N) {
std::vector<T> result;
for (T val = 1; val * val <= N; val++) {
if (N % val == 0)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,587 | 1,029,588 | u537234062 | cpp |
p03241 | #include <iostream>
using namespace std;
int N, M;
int main() {
cin >> N >> M;
int ans = 0;
for (int i = 2; i * i <= M; i++) {
if (M % i == 0) {
int a = M / i;
if ((long long int)i * N <= M)
ans = max(ans, i);
if ((long long int)a * N <= M)
ans = max(ans, a);
}
}
c... | #include <iostream>
using namespace std;
int N, M;
int main() {
cin >> N >> M;
int ans = 0;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
int a = M / i;
if ((long long int)i * N <= M)
ans = max(ans, i);
if ((long long int)a * N <= M)
ans = max(ans, a);
}
}
c... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,589 | 1,029,590 | u090967649 | cpp |
p03241 | #include <iostream>
using namespace std;
int N, M;
int main() {
cin >> N >> M;
int ans = 0;
for (int i = 2; i * i <= M; i++) {
if (M % i == 0) {
int a = N / i;
if ((long long int)i * N <= M)
ans = max(ans, i);
if ((long long int)a * N <= M)
ans = max(ans, a);
}
}
c... | #include <iostream>
using namespace std;
int N, M;
int main() {
cin >> N >> M;
int ans = 0;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
int a = M / i;
if ((long long int)i * N <= M)
ans = max(ans, i);
if ((long long int)a * N <= M)
ans = max(ans, a);
}
}
c... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"expression.operation.binary.change"
] | 1,029,591 | 1,029,590 | u090967649 | cpp |
p03241 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
int ans = 1;
for (int i = 1; i * i <= m; ++i) {
if (m % i)
continue;
if (m / i >= n)
ans = max(ans, i);
int j = m / i;
if (m / j >= n... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
int ans = 1;
for (int i = 1; i * i <= m; ++i) {
if (m % i)
continue;
if (m / i >= n)
ans = max(ans, i);
int j = m / i;
if (m / j >= n... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,029,592 | 1,029,593 | u169848474 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> p;
for (ll i = 1; i * i <= m; i++) {
if (m % i == 0) {
if ((m / i) / n > 0)
p.push_back(i);
if (i != 1 && i * i != m) {
ll k = m / i;
if ((m / k) / n > ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> p;
for (ll i = 1; i * i <= m; i++) {
if (m % i == 0) {
if ((m / i) / n > 0)
p.push_back(i);
if (i * i != m) {
ll k = m / i;
if ((m / k) / n > 0)
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,029,594 | 1,029,595 | u082673785 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#define EPS (1e-7)
#define INF ... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#define EPS (1e-7)
#define INF ... | [
"expression.operation.binary.remove"
] | 1,029,596 | 1,029,597 | u551351897 | cpp |
p03241 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a, b, c) for (int a = b; a <= (int)c; ++a)
#define fd(a, b, c) for (int a = b; a >= (int)c; --a)
#define cu(a, b, c) for (int a = b; a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a, b, c) for (int a = b; a <= (int)c; ++a)
#define fd(a, b, c) for (int a = b; a >= (int)c; --a)
#define cu(a, b, c) for (int a = b; a... | [
"literal.number.change",
"call.arguments.change"
] | 1,029,603 | 1,029,604 | u730731139 | cpp |
p03241 | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
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; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b %... | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
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; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b %... | [
"control_flow.loop.for.condition.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,029,607 | 1,029,608 | u862237347 | cpp |
p03241 | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
/*
//#if __cplusplus >= ... | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
/*
//#if __cplusplus >= ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,029,611 | 1,029,612 | u819300485 | cpp |
p03241 | #include <cstdio>
typedef long long int lli;
int main(void) {
lli n, m, r;
scanf("%lld%lld", &n, &m);
if (n == 1) {
printf("%d\n", m);
return 0;
}
for (lli i = 1; i * n <= m && i * i <= m; i++) {
if (m % i == 0)
r = i;
}
printf("%lld\n", r);
}
| #include <cstdio>
typedef long long int lli;
int main(void) {
lli n, m, r;
scanf("%lld%lld", &n, &m);
if (n == 1) {
printf("%d\n", m);
return 0;
}
for (lli i = 1; i * n <= m && i <= m; i++) {
if (m % i == 0)
r = i;
}
printf("%lld\n", r);
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,029,621 | 1,029,622 | u056944756 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 998244353;
int gcd(int a, int b) {
if (b == 0)
return a;
retu... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 998244353;
int gcd(int a, int b) {
if (b == 0)
return a;
retu... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,029,627 | 1,029,628 | u554988565 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 0;
for (int i = 1; i * i <= N; ++i) {
if (N % i == 0 && i <= M / N)
ans = max(ans, i);
if (N % i == 0 && M / i <= M / N)
ans = max(ans, M / i);
}
cout << ans << endl;
return 0;
} | #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 && i <= M / N)
ans = max(ans, i);
if (M % i == 0 && M / i <= M / N)
ans = max(ans, M / i);
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,029,631 | 1,029,632 | u826487371 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
vector<int> factors(int M) {
vector<int> ans;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
ans.push_back(i);
ans.push_back(M / i);
}
}
return ans;
}
int main() {
int N, M;
cin >> N >> M;
vector<int> ans = factors(M);
int res = 1... | #include <bits/stdc++.h>
using namespace std;
vector<int> factors(int M) {
vector<int> ans;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
ans.push_back(i);
ans.push_back(M / i);
}
}
return ans;
}
int main() {
int N, M;
cin >> N >> M;
vector<int> ans = factors(M);
int res = 1... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,029,633 | 1,029,634 | u826487371 | cpp |
p03241 | #include <bits/stdc++.h>
using lint = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int gcd;
for (int i = m / n + 1; i >= 1; i--) {
if (m % i == 0) {
gcd = i;
break;
}
}
cout << gcd << endl;
return 0;
}
| #include <bits/stdc++.h>
using lint = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int gcd;
for (int i = m / n; i >= 1; i--) {
if (m % i == 0) {
gcd = i;
break;
}
}
cout << gcd << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 1,029,635 | 1,029,636 | u723180465 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> fact;
for (int i = 2; i * i <= m; i++) {
if (m % i == 0) {
fact.push_back(i);
fact.push_back(m / i);
}
}
int ans = 1;
for (int i : fact) {
if (m / i >=... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> fact;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
fact.push_back(i);
fact.push_back(m / i);
}
}
int ans = 1;
for (int i : fact) {
if (m / i >=... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,641 | 1,029,642 | u489536233 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<int> vcI;
typedef vector<lli> vcL;
typedef vector<pii> vPI;
typedef vector<pll> vPL;
const lli ... | #include <bits/stdc++.h>
using namespace std;
#define mem(arr, i) fill(arr, arr + sizeof(arr), i)
typedef unsigned long long ull;
typedef long long lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<int> vcI;
typedef vector<lli> vcL;
typedef vector<pii> vPI;
typedef vector<pll> vPL;
const lli ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,643 | 1,029,644 | u516708338 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
for (int i = n; i >= 1; i--) {
if (m % i == 0) {
if (m / i >= n)... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
for (int i = m / n + 1; i >= 1; i--) {
if (m % i == 0) {
if (m /... | [
"control_flow.loop.for.initializer.change"
] | 1,029,653 | 1,029,654 | u678503521 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l = pow(m, 0.5);
vector<int> a;
for (int i = 1; i <= l + 10; i++) {
if (m % i == 0) {
a.push_back(m / i);
a.push_back(i);
}
}
sort(a.begin(), a.end());
for (int i = a.size() - 1; i > 0; i--) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l = pow(m, 0.5);
vector<int> a;
for (int i = 1; i <= l + 10; i++) {
if (m % i == 0) {
a.push_back(m / i);
a.push_back(i);
}
}
sort(a.begin(), a.end());
for (int i = a.size() - 1; i >= 0; i--) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,029,656 | 1,029,657 | u280114218 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l = pow(m, 0.5);
vector<int> a;
for (int i = 1; i < l; i++) {
if (m % i == 0) {
a.push_back(m / i);
a.push_back(i);
}
}
sort(a.begin(), a.end());
for (int i = a.size() - 1; i > 0; i--) {
if (m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l = pow(m, 0.5);
vector<int> a;
for (int i = 1; i <= l + 10; i++) {
if (m % i == 0) {
a.push_back(m / i);
a.push_back(i);
}
}
sort(a.begin(), a.end());
for (int i = a.size() - 1; i >= 0; i--) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,029,658 | 1,029,657 | u280114218 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INFL = 1000000000000000010; // 10^18 = 2^60
int INF = 2000000000; // 10^9
ll MOD = 1000000007;
int main(void) {
ll N, M;
cin >> N >> M;
ll ans = 0;
for (int i = 0; i * i <= M; i++) {
if (M % i == 0) {
ll a, b;
a = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INFL = 1000000000000000010; // 10^18 = 2^60
int INF = 2000000000; // 10^9
ll MOD = 1000000007;
int main(void) {
ll N, M;
cin >> N >> M;
ll ans = 0;
for (ll i = 1; i * i <= M; i++) {
if (M % i == 0) {
ll a, b;
a = i... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 1,029,661 | 1,029,662 | u633284019 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pii = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pii = ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 1,029,666 | 1,029,667 | u406158207 | cpp |
p03241 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair... | [
"call.add",
"call.arguments.change"
] | 1,029,672 | 1,029,673 | u493750228 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | [
"assignment.change"
] | 1,029,681 | 1,029,682 | u806999568 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll>... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll>... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,683 | 1,029,684 | u227379863 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for (int i = m; i < (int)(n); i++)
#define MOD 1000000007
#define Graph vector<vector<int>>
#define lint int64_t
int main() {
lint N, M;
cin >> N >> M;
lint tmpGCD = M / N;
lint ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for (int i = m; i < (int)(n); i++)
#define MOD 1000000007
#define Graph vector<vector<int>>
#define lint int64_t
int main() {
lint N, M;
cin >> N >> M;
lint tmpGCD = M / N;
lint ans = 1;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,029,695 | 1,029,696 | u503640463 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,697 | 1,029,698 | u106297876 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,029,699 | 1,029,698 | u106297876 | 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;
for (int i = n; i > 0; i--) {
if (m % i == 0 && m / i >= n) {
cout << i << endl;
return 0;
}
}
} | #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;
for (ll i = m / n; i > 0; i--) {
if (m % i == 0 && m / i >= n) {
cout << i << endl;
return 0;
}
}
} | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 1,029,700 | 1,029,701 | u343935874 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
for (int i = b / a; i > 0; i--) {
if (b % i == 0) {
cout << i << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
for (int i = b / a; i > 0; i--) {
if (b % i == 0) {
cout << i << endl;
break;
}
}
} | [
"control_flow.break.add"
] | 1,029,704 | 1,029,705 | u822169805 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
int ans = 0;
for (int i = n; i <= floor(sqrt(m)); i++) {
if (m % i == 0) {
if (m / i >= n) {
ans = i;
} ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
int ans = 0;
for (int i = 1; i <= floor(sqrt(m)); i++) {
if (m % i == 0) {
if (m / i >= n) {
ans = i;
} ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 1,029,706 | 1,029,707 | u712768978 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
for (int i = floor(m / n); i > 0; i--) {
if (m % i == 0)
cout << i << endl;
break;
}
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
for (int i = floor(m / n); i > 0; i--) {
if (m % i == 0) {
cout << i << endl;
break;
}
}
}
| [] | 1,029,712 | 1,029,713 | u989345508 | cpp |
p03241 | // _/ _/ _/_/_/ _/
//_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
// _/ _/ _/ _/ _/ _/ _/_/_/ _/
//_/ _/ _/ _/ _/ _/ _/ _/ _/
// _/_/ _/_/ _/_/ _/_/ _/_/ _/
#include <algorithm>
#include <cmath>
#include <iomanip>
#in... | // _/ _/ _/_/_/ _/
//_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
// _/ _/ _/ _/ _/ _/ _/_/_/ _/
//_/ _/ _/ _/ _/ _/ _/ _/ _/
// _/_/ _/_/ _/_/ _/_/ _/_/ _/
#include <algorithm>
#include <cmath>
#include <iomanip>
#in... | [
"variable_declaration.remove",
"assignment.value.change",
"call.arguments.change",
"assignment.change"
] | 1,029,716 | 1,029,717 | u401900157 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, N) for (l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, N) for (l... | [
"call.add",
"call.arguments.change"
] | 1,029,720 | 1,029,721 | u344425917 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef set<ll> sl;
typedef pair<int, int> pii;
#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 all(x) (x).begin(),... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef set<ll> sl;
typedef pair<int, int> pii;
#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 all(x) (x).begin(),... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,726 | 1,029,727 | u035566695 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt = 0;
int n, m;
cin >> n >> m;
int p = (int)round(sqrt(m));
int mi = INT_MAX;
for (i = 2; i <= p; i++) {
if (m % i == 0) {
if (i >= n)
mi = min(i, mi);
if (m / i >= n)
mi = min(m / ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt = 0;
int n, m;
cin >> n >> m;
int p = (int)round(sqrt(m));
int mi = INT_MAX;
for (i = 1; i <= p; i++) {
if (m % i == 0) {
if (i >= n)
mi = min(i, mi);
if (m / i >= n)
mi = min(m / ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,029,728 | 1,029,729 | u952130512 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI = acos(-1);
const ll MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
set<int> s;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
s.insert(i);
s.insert(M / i);
}
}
int ans;
for (auto i : s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI = acos(-1);
const ll MOD = 1000000007;
int main() {
ll N, M;
cin >> N >> M;
set<ll> s;
for (ll i = 1; i * i <= M; i++) {
if (M % i == 0) {
s.insert(i);
s.insert(M / i);
}
}
ll ans;
for (auto i : s) {
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 1,029,739 | 1,029,740 | u842939260 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int x = sqrt(M) + 2;
if (N == 1) {
cout << M;
return 0;
}
while (1) {
if (M % x == 0 && M / x >= N) {
cout << x;
return 0;
}
x--;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int x = M / 2 + 1;
if (N == 1) {
cout << M;
return 0;
}
while (1) {
if (M % x == 0 && M / x >= N) {
cout << x;
return 0;
}
x--;
}
}
| [
"call.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,029,741 | 1,029,742 | u236193715 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int x = sqrt(M) + 1;
if (N == 1) {
cout << M;
return 0;
}
while (1) {
if (M % x == 0 && M / x >= N) {
cout << x;
return 0;
}
x--;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int x = M / 2 + 1;
if (N == 1) {
cout << M;
return 0;
}
while (1) {
if (M % x == 0 && M / x >= N) {
cout << x;
return 0;
}
x--;
}
}
| [
"call.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,029,743 | 1,029,742 | u236193715 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
cin >> n >> m;
for (long long int i = n; i > 0; i--) {
if (m % i == 0 && (m / i) >= n) {
cout << i;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
cin >> n >> m;
for (long long int i = int(m / n); i > 0; i--) {
if (m % i == 0 && (m / i) >= n) {
cout << i;
break;
}
}
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"call.add",
"call.arguments.change"
] | 1,029,746 | 1,029,745 | u383828019 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, m, z = 0;
cin >> n >> m;
for (int i = 1; i * i <= m; i++)
if (m %... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, m, z = 0;
cin >> n >> m;
for (int i = 1; i * i <= m; i++)
if (m %... | [
"call.arguments.change"
] | 1,029,749 | 1,029,750 | u151855078 | cpp |
p03241 | #include <algorithm>
#include <assert.h>
#include <iostream>
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int32_t N, M;
std::cin >> N >> M;
int32_t gcd = 1;
for (int32_t k = 2; k <= M / N && k * k <= M; k++) {
// std::cout << gcd <<"," << k << std::endl;
if (M % k == 0) {
... | #include <algorithm>
#include <assert.h>
#include <iostream>
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int32_t N, M;
std::cin >> N >> M;
int32_t gcd = 1;
for (int32_t k = 1; k <= M / N && k * k <= M; k++) {
// std::cout << gcd <<"," << k << std::endl;
if (M % k == 0) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,753 | 1,029,754 | u775900747 | cpp |
p03241 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"identifier.change",
"call.function.change"
] | 1,029,760 | 1,029,761 | u841131859 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
vector<int> get_divisors(int n) {
vector<int> ds;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ds.push_back(i);
if (n / i != i) {
ds.push_back(i);
}
}
}
sort(ds.begin(), ds.end());
return ds;
}
int main() {
ios::sync_... | #include <bits/stdc++.h>
using namespace std;
vector<int> get_divisors(int n) {
vector<int> ds;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ds.push_back(i);
if (n / i != i) {
ds.push_back(n / i);
}
}
}
sort(ds.begin(), ds.end());
return ds;
}
int main() {
ios::s... | [
"expression.operation.binary.add"
] | 1,029,764 | 1,029,765 | u813181182 | cpp |
p03241 | #include <iostream>
using ll = long long;
#define int ll
using namespace std;
int maxi = 1;
int n, m;
signed main() {
scanf("%lld,%lld", &n, &m);
if (m % n == 0)
return cout << m / n << endl, 0;
for (int i = 2; i * n <= m; i++)
if (m % i == 0)
maxi = max(maxi, i);
printf("%lld\n", maxi);
}
| #include <iostream>
using ll = long long;
#define int ll
using namespace std;
int maxi = 1;
int n, m;
signed main() {
scanf("%lld%lld", &n, &m);
if (m % n == 0)
return cout << m / n << endl, 0;
for (int i = 2; i * n <= m; i++)
if (m % i == 0)
maxi = max(maxi, i);
printf("%lld\n", maxi);
}
| [
"literal.string.change",
"call.arguments.change"
] | 1,029,766 | 1,029,767 | u318334550 | cpp |
p03241 | #include <iostream>
using ll = long long;
#define int ll
using namespace std;
int maxi = 1;
int n, m;
signed main() {
scanf("%lld%lld", &n, &m);
if (m % n == 0)
return cout << n << endl, 0;
for (int i = 2; i * n <= m; i++)
if (m % i == 0)
maxi = max(maxi, i);
printf("%lld\n", maxi);
}
| #include <iostream>
using ll = long long;
#define int ll
using namespace std;
int maxi = 1;
int n, m;
signed main() {
scanf("%lld%lld", &n, &m);
if (m % n == 0)
return cout << m / n << endl, 0;
for (int i = 2; i * n <= m; i++)
if (m % i == 0)
maxi = max(maxi, i);
printf("%lld\n", maxi);
}
| [
"expression.operation.binary.add"
] | 1,029,768 | 1,029,767 | u318334550 | cpp |
p03241 | #include <iostream>
using ll = long long;
#define int ll
using namespace std;
int maxi = 1;
int n, m;
signed main() {
scanf("%lld,%lld", &n, &m);
if (m % n == 0)
return cout << n << endl, 0;
for (int i = 2; i * n <= m; i++)
if (m % i == 0)
maxi = max(maxi, i);
printf("%lld\n", maxi);
}
| #include <iostream>
using ll = long long;
#define int ll
using namespace std;
int maxi = 1;
int n, m;
signed main() {
scanf("%lld%lld", &n, &m);
if (m % n == 0)
return cout << m / n << endl, 0;
for (int i = 2; i * n <= m; i++)
if (m % i == 0)
maxi = max(maxi, i);
printf("%lld\n", maxi);
}
| [
"literal.string.change",
"call.arguments.change"
] | 1,029,769 | 1,029,767 | u318334550 | cpp |
p03241 | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MAX_N 100000000
#define INF 100000000000000
int main... | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MAX_N 100000000
#define INF 100000000000000
int main... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,770 | 1,029,771 | u167604613 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 99999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end())... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 99999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end())... | [
"call.add"
] | 1,029,776 | 1,029,777 | u618604643 | cpp |
p03241 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> b... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define repr(i, m, n) for (int i = m; i >= n; i--)
#define db(x) cout << #x << "=" << x << endl
template <class T> b... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 1,029,778 | 1,029,779 | u556276145 | cpp |
p03241 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <s... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,784 | 1,029,785 | u706695185 | cpp |
p03241 | //============================================================================
// Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Name : Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//=================================... | //============================================================================
// Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Name : Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//=================================... | [
"variable_declaration.type.change"
] | 1,029,786 | 1,029,787 | u720420025 | cpp |
p03241 | //============================================================================
// Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Name : Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//=================================... | //============================================================================
// Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Name : Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//=================================... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,029,788 | 1,029,787 | u720420025 | cpp |
p03241 | //============================================================================
// Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Name : Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//=================================... | //============================================================================
// Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Name : Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//=================================... | [
"variable_declaration.type.change"
] | 1,029,789 | 1,029,790 | u720420025 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
int N, M;
int main() {
cin >> N >> M;
int ans = 1;
for (int i = 1; i *... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
ll N, M;
int main() {
cin >> N >> M;
ll ans = 1;
for (ll i = 1; i * i ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 1,029,791 | 1,029,792 | u034055199 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
vector<ll> numnum(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 9999999999999999;
using ll = long long;
vector<ll> numnum(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,029,793 | 1,029,794 | u833295869 | cpp |
p03241 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utili... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utili... | [
"expression.operation.binary.add"
] | 1,029,795 | 1,029,796 | u895641117 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < n; i++)
typedef long long ll;
const int INF = 1e9 + 7;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
ll res = 0;
if (n == 1) {
cout << m << endl;
return 0;
}
for (ll i =... | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < n; i++)
typedef long long ll;
const int INF = 1e9 + 7;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
ll res = 0;
if (n == 1) {
cout << m << endl;
return 0;
}
for (ll i =... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,029,797 | 1,029,798 | u441723963 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < n; i++)
typedef long long ll;
const int INF = 1e9 + 7;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
ll res = 0;
if (n == 1) {
cout << m << endl;
return 0;
}
for (ll i =... | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < n; i++)
typedef long long ll;
const int INF = 1e9 + 7;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
ll res = 0;
if (n == 1) {
cout << m << endl;
return 0;
}
for (ll i =... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,029,799 | 1,029,798 | u441723963 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define co(x) cout << x << endl
#define cs(x) cout << x << " "
#define ALL(a) (a)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define co(x) cout << x << endl
#define cs(x) cout << x << " "
#define ALL(a) (a)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,800 | 1,029,801 | u984529214 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, t, res;
cin >> n >> m;
res = 1;
for (int i = 2; i * i <= (m + 1); i++) {
if (m % i == 0) {
if (m / i >= n) {
res = max(res, i);
}
if (i >= n) {
res = max(res, m / i);
}
}
}
cout << res << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, t, res;
cin >> n >> m;
res = 1;
for (int i = 1; i * i <= (m + 1); i++) {
if (m % i == 0) {
if (m / i >= n) {
res = max(res, i);
}
if (i >= n) {
res = max(res, m / i);
}
}
}
cout << res << end... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,802 | 1,029,803 | u300352570 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, t, res;
cin >> n >> m;
res = 1;
for (int i = 2; i * i <= m; i++) {
if (m % i == 0) {
if (m / i >= n) {
res = max(res, i);
}
if (i >= n) {
res = max(res, m / i);
}
}
}
cout << res << endl;
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, t, res;
cin >> n >> m;
res = 1;
for (int i = 1; i * i <= (m + 1); i++) {
if (m % i == 0) {
if (m / i >= n) {
res = max(res, i);
}
if (i >= n) {
res = max(res, m / i);
}
}
}
cout << res << end... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change"
] | 1,029,804 | 1,029,803 | u300352570 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, t, res;
cin >> n >> m;
res = 1;
for (int i = 2; i * i <= (m + 1); i++) {
if (m % i == 0) {
if (m / i >= n) {
res = max(res, i);
}
if (i >= n) {
res = max(res, m / i);
}
}
}
cout << res << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, t, res;
cin >> n >> m;
res = 0;
for (int i = 1; i * i <= (m + 1); i++) {
if (m % i == 0) {
if (m / i >= n) {
res = max(res, i);
}
if (i >= n) {
res = max(res, m / i);
}
}
}
cout << res << end... | [
"literal.number.change",
"assignment.value.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,802 | 1,029,805 | u300352570 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long n, m;
cin >> n >> m;
long long ans = 1;
for (long long i = 2; i * i <= m; ++i) {
if (m % i == 0 && m >= n * i) {
ans = max(ans, i);
}
if (m % i == 0 && m % (m / i) == 0 && m >= n * (m / i)) {
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long n, m;
cin >> n >> m;
long long ans = 1;
for (long long i = 1; i * i <= m; ++i) {
if (m % i == 0 && m >= n * i) {
ans = max(ans, i);
}
if (m % i == 0 && m % (m / i) == 0 && m >= n * (m / i)) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,808 | 1,029,809 | u399987025 | cpp |
p03241 | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = (N == 1 ? M : 1);
for (int i = 2; i <= M / 2; i++) {
if (!M % i and (long long) i * N <= M and ans < i)
ans = i;
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = (N == 1 ? M : 1);
for (int i = 2; i <= M / 2; i++) {
if (M % i == 0 and (long long) i * N <= M and ans < i)
ans = i;
}
cout << ans << endl;
}
| [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,029,818 | 1,029,819 | u022138926 | cpp |
p03241 | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = (N == 1 ? M : 1);
for (int i = 0; i <= M / 2; i++) {
if (M % i == 0 && (long long)i * N <= M && ans < i)
ans = i;
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = (N == 1 ? M : 1);
for (int i = 2; i <= M / 2; i++) {
if (M % i == 0 and (long long) i * N <= M and ans < i)
ans = i;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 1,029,820 | 1,029,819 | u022138926 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// inf
constexpr ll infl = 10000000000000000LL;
constexpr int inf = 1000000000;
int main() {
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// inf
constexpr ll infl = 10000000000000000LL;
constexpr int inf = 1000000000;
int main() {
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,029,821 | 1,029,822 | u577747009 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1e9 + 1;
/*
mの約数で、m/x>=nを満たす最大のx
*/
std::vector<int> enum_div(int n) // nの約数を列挙
{
std::vector<int> ret;
for (int i = 1; i * i <= n; ++i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1e9 + 1;
/*
mの約数で、m/x>=nを満たす最大のx
*/
std::vector<int> enum_div(int n) // nの約数を列挙
{
std::vector<int> ret;
for (int i = 1; i * i <= n; ++i... | [
"variable_declaration.value.change"
] | 1,029,831 | 1,029,832 | u272496669 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#def... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#def... | [
"literal.number.change",
"call.arguments.change"
] | 1,029,833 | 1,029,834 | u947304300 | cpp |
p03241 | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define fro(i, j, n) for (int i = j; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i... | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define fro(i, j, n) for (int i = j; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i... | [
"call.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,029,841 | 1,029,842 | u806159048 | cpp |
p03241 | /*
BY - Darkworld1 ( Tanu kumar )
college - AIT
Problem - contest ( div 3 )
*/
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
#define st(v) (v).begin(), (v).end()
#define rep(i, a, n) for (in... | /*
BY - Darkworld1 ( Tanu kumar )
college - AIT
Problem - contest ( div 3 )
*/
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
#define st(v) (v).begin(), (v).end()
#define rep(i, a, n) for (in... | [
"control_flow.loop.for.initializer.change"
] | 1,029,847 | 1,029,848 | u082568020 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <st... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <st... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,029,849 | 1,029,850 | u693386219 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, lim;
cin >> N >> M;
lim = M / N;
int num = 0;
vector<int> yakusu(M);
for (int i = 0; i < sqrt(M); i++) {
if (M % (i + 1) == 0) {
yakusu[num] = i + 1;
num++;
yakusu[num] = M / (i + 1);
num++;
}
}
int max... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, lim;
cin >> N >> M;
lim = M / N;
int num = 0;
vector<int> yakusu(1000000);
for (int i = 0; i < sqrt(M); i++) {
if (M % (i + 1) == 0) {
yakusu[num] = i + 1;
num++;
yakusu[num] = M / (i + 1);
num++;
}
}
i... | [] | 1,029,855 | 1,029,856 | u077536797 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, lim;
cin >> N >> M;
lim = M / N;
int num = 0;
vector<int> yakusu;
for (int i = 0; i < sqrt(M); i++) {
if (M % (i + 1) == 0) {
yakusu[num] = i + 1;
num++;
yakusu[num] = M / (i + 1);
num++;
}
}
int max = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, lim;
cin >> N >> M;
lim = M / N;
int num = 0;
vector<int> yakusu(1000000);
for (int i = 0; i < sqrt(M); i++) {
if (M % (i + 1) == 0) {
yakusu[num] = i + 1;
num++;
yakusu[num] = M / (i + 1);
num++;
}
}
i... | [
"call.arguments.add"
] | 1,029,857 | 1,029,856 | u077536797 | cpp |
p03241 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
ll ans = 0;
for (ll i = 1; i * i <= M; i++) {
if (M % i == 0) {
if (N * i <= M) {
ans = max(ans, i);
}
}
ll d = M / i;
if (N * d <= M) {
ans = max(ans, d);
}
}... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
ll ans = 0;
for (ll i = 1; i * i <= M; i++) {
if (M % i == 0) {
if (N * i <= M) {
ans = max(ans, i);
}
ll d = M / i;
if (N * d <= M) {
ans = max(ans, d);
}
... | [] | 1,029,858 | 1,029,859 | u243961437 | cpp |
p03241 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | [
"call.add",
"call.arguments.change"
] | 1,029,860 | 1,029,861 | u596276291 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n, m;
int ans = 1;
cin >> n >> m;
if (n == 1) ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n, m;
int ans = 1;
cin >> n >> m;
if (n == 1) ... | [
"control_flow.loop.for.condition.change"
] | 1,029,862 | 1,029,863 | u704411633 | cpp |
p03241 | #include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n;
int m;
cin >> n >> m;
int kotae = 1;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (m / i >= n) {
kotae = kotae > i ? kotae : i;
} else if (i >= n) {
... | #include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n;
int m;
cin >> n >> m;
int kotae = 1;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (m / i >= n) {
kotae = kotae > i ? kotae : i;
}
if (i >= n) {
... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,029,864 | 1,029,865 | u791073783 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <... | [
"expression.operation.binary.add"
] | 1,029,868 | 1,029,869 | u942290141 | cpp |
p03241 | /*
Name: Mohit Khare
CSE - MNNIT Allahabad
never give up!!
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define speed ios_base::sync_with_stdio(false);
#define pb push_back
#define mp make_pair
#defi... | /*
Name: Mohit Khare
CSE - MNNIT Allahabad
never give up!!
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define speed ios_base::sync_with_stdio(false);
#define pb push_back
#define mp make_pair
#defi... | [
"call.add",
"call.arguments.change"
] | 1,029,870 | 1,029,871 | u386746446 | cpp |
p03241 | #include <iostream>
#include <vector>
using namespace std;
int main() {
unsigned long N;
unsigned long M;
unsigned long ans = 0;
cin >> N >> M;
for (unsigned long i = 1; i * i <= M; i++) {
if (M % i == 0) {
unsigned long D = M / i;
if (M / i >= N) {
if (i > ans)
ans = i;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
unsigned long N;
unsigned long M;
unsigned long ans = 0;
cin >> N >> M;
for (unsigned long i = 1; i * i <= M; i++) {
if (M % i == 0) {
unsigned long D = M / i;
if (M / i >= N) {
if (i > ans)
ans = i;
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,029,872 | 1,029,873 | u386119132 | cpp |
p03241 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#include <bitse... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#include <bitse... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,874 | 1,029,875 | u815501404 | cpp |
p03241 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) ... | [
"call.remove"
] | 1,029,876 | 1,029,877 | u698760125 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
int n, m;
cin >> n >> m;
int ans = m / n;
for (int ans = m / n; ans > 1; --ans) {
if (m % ans == 0) {
cout << ans << "\n";
return 0;
}
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
int n, m;
cin >> n >> m;
int ans;
for (ans = m / n; ans > 1; --ans) {
if (m % ans == 0) {
cout << ans << "\n";
return 0;
}
}
cout << ans << "\... | [] | 1,029,878 | 1,029,879 | u219786796 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int max = 0;
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
for (int i = 1; i <= sqrt(m); i++)
if (m % i == 0 && m / i >= n && i > max)
max = i;
cout << max << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int max = 0;
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
for (int i = 1; i <= m / 2; i++)
if (m % i == 0 && m / i >= n && i > max)
max = i;
cout << max << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"call.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,029,895 | 1,029,896 | u313427116 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> num;
//素因数分解は不要で、単にMの約数を求めれば良い。
// Mの約数のうち、
int main() {
int N, M;
cin >> N >> M;
int ans = 0;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
num.push_back(i);
num.push_back(M / i);
}
}
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> num;
//素因数分解は不要で、単にMの約数を求めれば良い。
// Mの約数のうち、
int main() {
int N, M;
cin >> N >> M;
int ans = 0;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
num.push_back(i);
num.push_back(M / i);
}
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,898 | 1,029,899 | u317715099 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> num;
//素因数分解は不要で、単にMの約数を求めれば良い。
// Mの約数のうち、
int main() {
int N, M;
cin >> N >> M;
int ans = 0;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
num.push_back(i);
num.push_back(M / i);
}
}
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> num;
//素因数分解は不要で、単にMの約数を求めれば良い。
// Mの約数のうち、
int main() {
int N, M;
cin >> N >> M;
int ans = 0;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
num.push_back(i);
num.push_back(M / i);
}
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,029,900 | 1,029,899 | u317715099 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.