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>
using namespace std;
typedef long long ll;
// const int INF = 2e9;
// const ll INF = 9e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
if (N == 1 && M == 1) {
cout << 1 << "\n";
return 0;
}
vector<int> div;
for (int i = 1; i * i <= M;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2e9;
// const ll INF = 9e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
if (N == 1) {
cout << M << "\n";
return 0;
}
vector<int> div;
for (int i = 1; i * i <= M; i++) {
... | [
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,029,119 | 1,029,120 | u904131021 | cpp |
p03241 | #include <bits/stdc++.h>
#define booga cout << "booga" << endl
#define ll long long int
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, m;
cin >> n >> m;
if (m % n == 0) {
... | #include <bits/stdc++.h>
#define booga cout << "booga" << endl
#define ll long long int
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, m;
cin >> n >> m;
if (m % n == 0) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,029,123 | 1,029,124 | u389078199 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, ini, n) for (int i = ini; i < n; i++)
#define _rep(i, ini, n) for (int i = ini; i >= n; i--)
#define ToEnd(a) a.begin(), a.end()
uint64_t MOD = 1000000007;
int main() {
int64_t N, M;
cin >> N >> M;
int64_t ans = 0;
rep(i, 1, M / N + 1) {
if (M %... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, ini, n) for (int i = ini; i < n; i++)
#define _rep(i, ini, n) for (int i = ini; i >= n; i--)
#define ToEnd(a) a.begin(), a.end()
uint64_t MOD = 1000000007;
int main() {
int64_t N, M;
cin >> N >> M;
int64_t ans = 0;
rep(i, 1, M / N + 1) {
if (M %... | [
"assignment.change"
] | 1,029,127 | 1,029,128 | u190679129 | cpp |
p03241 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <vector>
using namespace std;
int main() {
unsigned N, M;
scanf("%u %u", &N, &M);
vector<unsigned> divisor;
for (unsigned i = 1; i * i <= N; ++i) {
if (!(N % i)) {
divisor.push_back(i);
if (i != N / i)
divisor.push_ba... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <vector>
using namespace std;
int main() {
unsigned N, M;
scanf("%u %u", &N, &M);
vector<unsigned> divisor;
for (unsigned i = 1; i * i <= M; ++i) {
if (!(M % i)) {
divisor.push_back(i);
if (i != M / i)
divisor.push_ba... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,029,146 | 1,029,147 | u642912410 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
... | [
"expression.operation.binary.remove"
] | 1,029,148 | 1,029,149 | u418810472 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
... | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,029,150 | 1,029,149 | u418810472 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N, M;
cin >> N >> M;
int ans;
if (M % N == 0) {
ans = M / N;
} else {
vector<int> div;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
div.emplace_back(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N, M;
cin >> N >> M;
int ans;
if (M % N == 0) {
ans = M / N;
} else {
vector<int> div;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
div.emplace_back(... | [
"control_flow.break.add"
] | 1,029,151 | 1,029,152 | u912952979 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int res = 1;
for (int i = 1; i <= N; i++) {
if (M % i == 0) {
if (M / i >= N)
res = max(res, i);
else if (i >= N)
res = max(res, M / i);
}
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int res = 1;
for (int i = 1; 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;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,029,155 | 1,029,156 | u315542000 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int res = 1;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
if (M / i >= N)
res = max(res, i);
else if (i >= N)
res = max(res, M / i);
}
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int res = 1;
for (int i = 1; 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;
return 0;
}
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,029,157 | 1,029,156 | u315542000 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int res = 1;
for (int i = 2; i * i <= M; i++) {
if (M % i == 0) {
if (M / i >= N)
res = max(res, i);
else if (i >= N)
res = max(res, M / i);
}
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int res = 1;
for (int i = 1; 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;
return 0;
}
| [
"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,158 | 1,029,156 | u315542000 | cpp |
p03241 | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for... | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for... | [
"expression.operation.binary.add"
] | 1,029,163 | 1,029,164 | u432688695 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#defin... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,029,171 | 1,029,172 | u790461875 | cpp |
p03241 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) ... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,029,177 | 1,029,178 | u034865202 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,029,183 | 1,029,184 | u645961531 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,029,185 | 1,029,184 | u645961531 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18 + 1;
const ll... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,029,187 | 1,029,188 | u645961531 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
void divisor(vector<int> &d, int n) {
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
d.push_back(i);
if (i * i != n)
d.push_back(n / i);
}
}
}
int main() {
int n, m;
cin >> n >> m;
vector<int> mm;
divisor(mm, m);
sort(mm.be... | #include <bits/stdc++.h>
using namespace std;
void divisor(vector<int> &d, int n) {
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
d.push_back(i);
if (i * i != n)
d.push_back(n / i);
}
}
}
int main() {
long long n, m;
cin >> n >> m;
vector<int> mm;
divisor(mm, m);
sort... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,029,197 | 1,029,198 | u494609869 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
void divisor(vector<int> &d, int n) {
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
d.push_back(i);
if (i * i != n)
d.push_back(n / i);
}
}
}
int main() {
int n, m;
cin >> n >> m;
vector<int> mm;
divisor(mm, m);
sort(mm.be... | #include <bits/stdc++.h>
using namespace std;
void divisor(vector<int> &d, int n) {
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
d.push_back(i);
if (i * i != n)
d.push_back(n / i);
}
}
}
int main() {
long long n, m;
cin >> n >> m;
vector<int> mm;
divisor(mm, m);
sort... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,029,199 | 1,029,198 | u494609869 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0... | [
"call.add"
] | 1,029,200 | 1,029,201 | u718758485 | cpp |
p03241 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<ll>... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<ll>... | [
"expression.operation.binary.add"
] | 1,029,206 | 1,029,207 | u536087211 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,210 | 1,029,211 | u389009751 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 1,029,212 | 1,029,211 | u389009751 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, M;
cin >> N >> M;
int ans = 1;
if (N == 1) {
cout << M << endl;
} else {
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
if (i * N <= M) {
ans = max(ans, i);
} else if (M / ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, M;
cin >> N >> M;
int ans = 1;
if (N == 1) {
cout << M << endl;
} else {
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
if (i * N <= M) {
ans = max(ans, i);
}
if (M... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,029,213 | 1,029,214 | u237390401 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define revrepeat(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define revre... | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define revrepeat(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define revre... | [
"call.add",
"call.arguments.change"
] | 1,029,215 | 1,029,216 | u765690804 | cpp |
p03241 | #include <bits/stdc++.h>
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 (i * n <= m && (m - i * n) % i == 0)
ans = max(ans, i);
if ((m / i) * n <= m && (m - (m / i) * n) % i == 0)
... | #include <bits/stdc++.h>
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 (i * n <= m && (m - i * n) % i == 0)
ans = max(ans, i);
if ((m / i) * n <= m && (m - (m / i) * n) % (m / i) == 0)
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,029,221 | 1,029,222 | u184929210 | cpp |
p03241 | #include <bits/stdc++.h>
#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 all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) s... | #include <bits/stdc++.h>
#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 all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) s... | [
"expression.operation.binary.add"
] | 1,029,225 | 1,029,226 | u892687772 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,227 | 1,029,228 | u376082984 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1e9;
const int MOD = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> yakusu;
yakusu.push_back(m);
for (int i = 1; i * i <= m; i++) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1e9;
const int MOD = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> yakusu;
yakusu.push_back(m);
for (int i = 1; i * i <= m; i++) {
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,029,233 | 1,029,234 | u371149954 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,241 | 1,029,242 | u093973314 | cpp |
p03241 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,250 | 1,029,251 | u519759783 | cpp |
p03241 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,252 | 1,029,251 | u519759783 | cpp |
p03241 | // ~zaletaet~
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
using ull = unsigned long long;
// using big = ... | // ~zaletaet~
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
using ull = unsigned long long;
// using big = ... | [
"assignment.change"
] | 1,029,253 | 1,029,254 | u877399296 | cpp |
p03241 | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using n... | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using n... | [
"control_flow.loop.for.initializer.change"
] | 1,029,255 | 1,029,256 | u767543103 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll N, M;
cin >> N >> M;
// greatest divisor of M smaller than or equal to M/N
ll ans = 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll N, M;
cin >> N >> M;
// greatest divisor of M smaller than or equal to M/N
ll ans = 0... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,029,257 | 1,029,258 | u144913062 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v;
for (ll i = 2; i * i <= k; i++) {
if (k % i == 0) {
v.push_back(i);
if (k / i != i)
v.push_back(k / i);
}
}
ll counter;
sort(v.begin(), v.end());
for (i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v;
for (ll i = 1; i * i <= k; i++) {
if (k % i == 0) {
v.push_back(i);
if (k / i != i)
v.push_back(k / i);
}
}
ll counter;
sort(v.begin(), v.end());
for (i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,269 | 1,029,270 | u837843177 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v;
for (ll i = 2; i * i <= k; i++) {
if (k % i == 0) {
v.push_back(i);
if (k / i != i)
v.push_back(k / i);
}
}
ll counter;
sort(v.rbegin(), v.rend());
for ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v;
for (ll i = 1; i * i <= k; i++) {
if (k % i == 0) {
v.push_back(i);
if (k / i != i)
v.push_back(k / i);
}
}
ll counter;
sort(v.begin(), v.end());
for (i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.function.change",
"call.arguments.change"
] | 1,029,271 | 1,029,270 | u837843177 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define intt long long
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0);
const int N = 100005;
int n, m;
int main() {
FAST;
cin >> n >> m... | #include <bits/stdc++.h>
using namespace std;
#define intt long long
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0);
const int N = 100005;
int n, m;
int main() {
FAST;
cin >> n >> m... | [
"assignment.change",
"expression.operation.binary.remove"
] | 1,029,272 | 1,029,273 | u670128805 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define intt long long
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0);
const int N = 100005;
int n, m;
int main() {
FAST;
cin >> n >> m... | #include <bits/stdc++.h>
using namespace std;
#define intt long long
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0);
const int N = 100005;
int n, m;
int main() {
FAST;
cin >> n >> m... | [
"assignment.change"
] | 1,029,274 | 1,029,273 | u670128805 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define intt long long
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0);
const int N = 100005;
int n, m;
int main() {
FAST;
cin >> n >> m... | #include <bits/stdc++.h>
using namespace std;
#define intt long long
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0);
const int N = 100005;
int n, m;
int main() {
FAST;
cin >> n >> m... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,029,275 | 1,029,273 | u670128805 | cpp |
p03241 | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
//#include <iostream>//POJ
//#include <vector>
//#include <string>
//#include <iomanip>
//#include <math.h>
//#include <algorithm>
//#include <cstring>
using namespace std;
#define setc ... |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
//#include <iostream>//POJ
//#include <vector>
//#include <string>
//#include <iomanip>
//#include <math.h>
//#include <algorithm>
//#include <cstring>
using namespace std;
#define setc ... | [
"call.add"
] | 1,029,281 | 1,029,282 | u675296835 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
#define for1(n) fo... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
#define for1(n) fo... | [] | 1,029,285 | 1,029,286 | u383056481 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <regex>
#include <set>
#include <vector>
using namespace std;
long long N, M;
bool check(long long ans) {
long long MM = M - ans * N;
if (MM < 0)
return false;
if (MM % ans == 0)
return true;
else
return false;
}
int main() {
cin >> N >> M;
i... | #include <algorithm>
#include <iostream>
#include <regex>
#include <set>
#include <vector>
using namespace std;
long long N, M;
bool check(long long ans) {
long long MM = M - ans * N;
if (MM < 0)
return false;
if (MM % ans == 0)
return true;
else
return false;
}
int main() {
cin >> N >> M;
i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 1,029,287 | 1,029,288 | u903215911 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a;
cin >> n >> m;
a = 1;
for (int i = 2; i * i <= m; i++) {
if (m % i == 0) {
if (m / i >= n)
a = max(i, a);
if (i >= n)
a = max(m / i, a);
}
}
cout << a << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a;
cin >> n >> m;
a = 1;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (m / i >= n)
a = max(i, a);
if (i >= n)
a = max(m / i, a);
}
}
cout << a << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,289 | 1,029,290 | u863370423 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 2; i * i <= m; i++) {
if (m % i == 0) {
if (i * n <= m) {
ans = max(ans, i);
}
ll x = m / i;
if (x * n <= m) {
ans... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 1; i * i <= m; i++) {
if (m % i == 0 && i * n <= m) {
ans = max(ans, i);
ll x = m / i;
if (x * n <= m) {
ans = max(ans, x);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 1,029,293 | 1,029,294 | u191114518 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 2; i * i <= m; i++) {
if (m % i == 0 && i * n <= m) {
ans = max(ans, i);
ll x = m / i;
if (x * n <= m) {
ans = max(ans, x);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 1; i * i <= m; i++) {
if (m % i == 0 && i * n <= m) {
ans = max(ans, i);
ll x = m / i;
if (x * n <= m) {
ans = max(ans, x);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,295 | 1,029,294 | u191114518 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 2; i * i <= m; i++) {
if (m % i == 0) {
if (i * n <= m) {
ans = max(ans, i);
}
ll x = m / i;
if (x * n <= m) {
ans... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (i * n <= m) {
ans = max(ans, i);
}
ll x = m / i;
if (x * n <= m) {
ans... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,293 | 1,029,296 | u191114518 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 2; i * i <= m; i++) {
if (m % i == 0 && i * n <= m) {
ans = max(ans, i);
ll x = m / i;
if (x * n <= m) {
ans = max(ans, x);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (i * n <= m) {
ans = max(ans, i);
}
ll x = m / i;
if (x * n <= m) {
ans... | [
"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.branch.if.add"
] | 1,029,295 | 1,029,296 | u191114518 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int64_t N, M;
cin >> N >> M;
int64_t res = 1;
for (int64_t m = 2; m <= sqrt(M); ++m) {
if (M % m)
continue;
int64_t m2 = M / m;
if (m >= N)
res = max(res, m2);
if (m2 >= N... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int64_t N, M;
cin >> N >> M;
int64_t res = 1;
for (int64_t m = 1; m <= sqrt(M); ++m) {
if (M % m)
continue;
int64_t m2 = M / m;
if (m >= N)
res = max(res, m2);
if (m2 >= N)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,304 | 1,029,305 | u762603420 | cpp |
p03241 | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll md = mod;
constexpr ll inf = 1e15;
int main() {
int n;
ll m;
cin >> n >> m;
ll ret = 1;
for (ll i = 2; i * i <= m; ++i) {
if (m % i == 0) {
if (n <= m /... | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll md = mod;
constexpr ll inf = 1e15;
int main() {
int n;
ll m;
cin >> n >> m;
ll ret = 1;
for (ll i = 1; i * i <= m; ++i) {
if (m % i == 0) {
if (n <= m /... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,312 | 1,029,313 | u699193595 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
int n, m;
cin >> n >> m;
if (m % n == 0)
cout << m / n << endl;
else {
for (int i = m / n - 1; i >= 1; i--) {
if (m % i == 0) {
cout << i << endl;
return 0;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
int n, m;
cin >> n >> m;
if (m % n == 0)
cout << m / n << endl;
else {
for (int i = m / n; i >= 1; i--) {
if (m % i == 0) {
cout << i << endl;
return 0;
}
}
}
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 1,029,318 | 1,029,319 | u633967774 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (long long i = 0; i < (int)n; i++)
#define rep2(i, a, n) for (long long i = (a); i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using pii = pai... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (long long i = 0; i < (int)n; i++)
#define rep2(i, a, n) for (long long i = (a); i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using pii = pai... | [
"variable_declaration.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,320 | 1,029,321 | u124142430 | cpp |
p03241 | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
strin... | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
strin... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,322 | 1,029,323 | u610897920 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> fac;
for (long long x = 2; x * x <= m; x++) {
if (m % x == 0) {
fac.push_back(x);
if (x != m / x)
fac.push_back(m / x);
}
}
sort(fac.b... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> fac;
for (long long x = 1; x * x <= m; x++) {
if (m % x == 0) {
fac.push_back(x);
if (x != m / x)
fac.push_back(m / x);
}
}
sort(fac.b... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,324 | 1,029,325 | u110383054 | cpp |
p03241 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,326 | 1,029,327 | u225660136 | cpp |
p03241 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"variable_declaration.name.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,029,342 | 1,029,343 | u415325136 | cpp |
p03241 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 1,029,342 | 1,029,344 | u415325136 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,029,350 | 1,029,351 | u104074027 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(), (x).end()
#define uniq(x) ((x).erase(unique(all(x)), (x).end()))
#define sz(x) ((int)(x).size()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(), (x).end()
#define uniq(x) ((x).erase(unique(all(x)), (x).end()))
#define sz(x) ((int)(x).size()... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,365 | 1,029,364 | u618649215 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
ve... | [
"call.add",
"call.arguments.change"
] | 1,029,366 | 1,029,367 | u030504180 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define INF (1 << 30) - 1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, const T... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define INF (1 << 30) - 1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, const T... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 1,029,371 | 1,029,372 | u667375816 | cpp |
p03241 | // ABC 112 D
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;... | // ABC 112 D
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,381 | 1,029,382 | u733814820 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 1; i * i <= m; i++) {
if (m % i == 0) {
ll tmp = m / i;
if (tmp >= n)
ans = max(ans, tmp);
if (i >= n)
ans = max(ans, i);
}
}
if (n == 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 1; i * i <= m; i++) {
if (m % i == 0) {
ll tmp = m / i;
if (tmp >= n)
ans = max(ans, i);
if (i >= n)
ans = max(ans, tmp);
}
}
if (n == 1... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,029,383 | 1,029,384 | u515131769 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 1; i * i <= m; i++) {
if (m % i == 0) {
ll tmp = m / i;
if (tmp >= n)
ans = max(ans, i);
if (i >= n)
ans = max(ans, i);
}
}
if (n == 1)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1;
for (ll i = 1; i * i <= m; i++) {
if (m % i == 0) {
ll tmp = m / i;
if (tmp >= n)
ans = max(ans, i);
if (i >= n)
ans = max(ans, tmp);
}
}
if (n == 1... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,029,385 | 1,029,384 | u515131769 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
set<int> d;
d.insert(1);
d.insert(m);
for (int i = 2; i * i <= m; i++) {
if (m % i == 0) {
d.insert(i);
d.insert(m / i);
}
}
int ans = 0;
for (auto k : d) {
if (k * n > m)
break;
ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
set<long long> d;
d.insert(1);
d.insert(m);
for (int i = 2; i * i <= m; i++) {
if (m % i == 0) {
d.insert(i);
d.insert(m / i);
}
}
long long ans = 0;
for (auto k : d) {
if (k * n > m)
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,029,386 | 1,029,387 | u515131769 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
int N, M;
cin >> N >> M;
int ans = 1;
if (M == 1)
ans = 1;
else {
for (int i = 2; i <= sqrt(M); i++) {
if (M % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
int N, M;
cin >> N >> M;
int ans = 1;
if (M == 1)
ans = 1;
else {
for (int i = 1; i <= sqrt(M); i++) {
if (M % i == 0) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,392 | 1,029,393 | u342075214 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
int N, M;
cin >> N >> M;
int ans = 0;
if (M == 1)
ans = 1;
else {
for (int i = 2; i <= sqrt(M); i++) {
if (M % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
int N, M;
cin >> N >> M;
int ans = 1;
if (M == 1)
ans = 1;
else {
for (int i = 1; i <= sqrt(M); i++) {
if (M % i == 0) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,394 | 1,029,393 | u342075214 | cpp |
p03241 | #include <iostream>
using namespace std;
#include <cmath>
#include <map>
#include <vector>
#define int long long int
int power(int a, int b) {
int x = pow(a, b);
return x;
}
int solve(int val) {
int j;
if (val > 0) {
int sum = 0;
for (j = 0;; j += 2) {
sum += power(2, j);
if (sum >= val) {
... | #include <iostream>
using namespace std;
#include <cmath>
#include <map>
#include <vector>
#define int long long int
int power(int a, int b) {
int x = pow(a, b);
return x;
}
int solve(int val) {
int j;
if (val > 0) {
int sum = 0;
for (j = 0;; j += 2) {
sum += power(2, j);
if (sum >= val) {
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,029,408 | 1,029,409 | u688660263 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> c;
for (long long i = 1; i * i < m; ++i) {
if (m % i == 0LL) {
if (i * n <= m)
c.push_back(i);
if (n / i * n <= m)
c.push_back(n / i);
}
}
sort(c.begin(), c.end... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> c;
for (long long i = 1; i * i <= m; ++i) {
if (m % i == 0LL) {
if (i * n <= m)
c.push_back(i);
if (m / i * n <= m)
c.push_back(m / i);
}
}
sort(c.begin(), c.en... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,029,410 | 1,029,411 | u221391729 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n, m;
cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n, m;
cin... | [
"assignment.change"
] | 1,029,413 | 1,029,414 | u877494916 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n, m;
cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n, m;
cin... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,029,415 | 1,029,414 | u877494916 | cpp |
p03241 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
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 (M / i >= N)
ans = max(ans, i);
if (M / j >= N)
ans = max(ans, j);
}
cout << ans ... | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 1;
for (int i = 1; i * i <= M; ++i) {
if (M % i != 0)
continue;
int j = M / i;
if (M / i >= N)
ans = max(ans, i);
if (M / j >= N)
ans = max(ans, j);
}
cout << ans << '\n';
return 0;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,418 | 1,029,419 | u843175622 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
vector<long long> enum_divisors(ll N) {
vector<ll> res;
for (ll i = 1; i * i ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
vector<long long> enum_divisors(ll N) {
vector<ll> res;
for (ll i = 1; i * i ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,422 | 1,029,423 | u651235280 | cpp |
p03241 | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespac... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespac... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,029,424 | 1,029,425 | u866535689 | cpp |
p03241 | /*
* atcoder/abc112_3rd/d.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T> ostream &op... | /*
* atcoder/abc112_3rd/d.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T> ostream &op... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,435 | 1,029,436 | u823862638 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int res = 1;
for (int i = 1; i * i <= m; ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int res = 1;
for (int i = 1; i * i <= m; ... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,029,437 | 1,029,438 | u495704746 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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,... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,444 | 1,029,445 | u785492958 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, M;
cin >> N >> M;
long long ans = 1;
for (long long i = 1; i * i <= M; i++) {
if (M % i != 0)
continue;
long long x = M / i;
if (i * N <= M)
ans = max(ans, i);
if (x * N <= M)
ans = max(ans, i);
}... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, M;
cin >> N >> M;
long long ans = 1;
for (long long i = 1; i * i <= M; i++) {
if (M % i != 0)
continue;
long long x = M / i;
if (i * N <= M)
ans = max(ans, i);
if (x * N <= M)
ans = max(ans, x);
}... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,029,448 | 1,029,449 | u263564761 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, M;
cin >> N >> M;
long long ans = 1;
for (long long i = 1; i * i < M; i++) {
if (M % i != 0)
continue;
long long x = M / i;
if (i * N <= M)
ans = max(ans, i);
if (x * N <= M)
ans = max(ans, i);
}
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, M;
cin >> N >> M;
long long ans = 1;
for (long long i = 1; i * i <= M; i++) {
if (M % i != 0)
continue;
long long x = M / i;
if (i * N <= M)
ans = max(ans, i);
if (x * N <= M)
ans = max(ans, x);
}... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,029,450 | 1,029,449 | u263564761 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, M;
cin >> N >> M;
int ans = 1;
for (int i = 1; i * i < M; i++) {
if (M % i != 0)
continue;
long long x = M / i;
if (i * N <= M)
ans = max(ans, i);
if (x * N <= M)
ans = max(ans, i);
}
cout << a... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, M;
cin >> N >> M;
long long ans = 1;
for (long long i = 1; i * i <= M; i++) {
if (M % i != 0)
continue;
long long x = M / i;
if (i * N <= M)
ans = max(ans, i);
if (x * N <= M)
ans = max(ans, x);
}... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
... | 1,029,451 | 1,029,449 | u263564761 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,029,461 | 1,029,462 | u178536051 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,463 | 1,029,462 | u178536051 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
vector<int> v;
bool check(int n, int m, int mid) {
int x = (m - mid);
int y = (n - 1) * mid;
return (x >= y && x % mid == 0);
}
int cal(int n, int m) {
int ans = 0;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (check(n, m, i))
ans =... | #include <bits/stdc++.h>
using namespace std;
vector<int> v;
bool check(int n, int m, int mid) {
int x = (m - mid);
long long int y = (n - 1) * 1LL * mid;
return (x >= y && x % mid == 0);
/// return (m/mid>=n && m%mid==0);
}
int cal(int n, int m) {
int ans = 0;
for (int i = 1; i * i <= m; i++) {
if ... | [
"variable_declaration.type.widen.change",
"assignment.change"
] | 1,029,478 | 1,029,479 | u842204282 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
ll N, M;
vector<ll> divisors(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
res.push_back(i);... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
ll N, M;
vector<ll> divisors(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
res.push_back(i);... | [
"call.add"
] | 1,029,480 | 1,029,481 | u455366471 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod = 1000000007;
/* 4 方向への隣接頂点への移動を表すベクトル */
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ll n, m;
cin >> n >> m;
ll ca = 0;
ll f = 0;
for (ll i = 1; i * i <= m; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod = 1000000007;
/* 4 方向への隣接頂点への移動を表すベクトル */
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
ll n, m;
cin >> n >> m;
ll ca = 0;
ll f = 0;
for (ll i = 1; i * n <= m; i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,029,482 | 1,029,483 | u722640678 | cpp |
p03241 | #include <bits/stdc++.h>
#define INF 100100100
#define MOD 1000000007
#define FOR(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
struct edge {
ll to, cost;
};
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
ll N... | #include <bits/stdc++.h>
#define INF 100100100
#define MOD 1000000007
#define FOR(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
struct edge {
ll to, cost;
};
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
ll N... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,029,484 | 1,029,485 | u864171425 | cpp |
p03241 | #include <bits/stdc++.h>
#define INF 100100100
#define MOD 1000000007
#define FOR(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
struct edge {
ll to, cost;
};
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
ll N... | #include <bits/stdc++.h>
#define INF 100100100
#define MOD 1000000007
#define FOR(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
struct edge {
ll to, cost;
};
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
ll N... | [
"expression.operation.unary.arithmetic.remove",
"expression.operation.binary.remove",
"assignment.change"
] | 1,029,486 | 1,029,485 | u864171425 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"identifier.change",
"call.function.change"
] | 1,029,487 | 1,029,488 | u809967037 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,029,489 | 1,029,490 | u809967037 | cpp |
p03241 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,029,491 | 1,029,492 | u449123607 | cpp |
p03241 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,029,493 | 1,029,492 | u449123607 | cpp |
p03241 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,029,494 | 1,029,492 | u449123607 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 1,029,518 | 1,029,519 | u052332717 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 1,029,520 | 1,029,519 | u052332717 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int N, M;
const int N_MAX = 1e5;
int main() {
cin >> N >> M;
queue<int> que;
que.push(M);
for (int i = sqrt(M); i >= 1; i--) {
if (M % i == 0)
que.push(i);
}
while (!que.empty()) {
int n = que.front();
que.pop();
if (M / n >= N) {
... | #include <bits/stdc++.h>
using namespace std;
int N, M;
const int N_MAX = 1e5;
int main() {
cin >> N >> M;
queue<int> que;
que.push(M);
for (int i = M / 2; i >= 1; i--) {
if (M % i == 0)
que.push(i);
}
while (!que.empty()) {
int n = que.front();
que.pop();
if (M / n >= N) {
co... | [
"control_flow.loop.for.initializer.change",
"call.remove",
"call.arguments.change"
] | 1,029,521 | 1,029,522 | u756514276 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
long long dp[3][100100] ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
long long dp[3][100100] ... | [] | 1,029,529 | 1,029,530 | u959822889 | 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)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
us... | #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)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
us... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 1,029,531 | 1,029,532 | u881647420 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define fi first
#define se second
template <typename A, typename B> inline bool chmax(A &a, B b) {
if (a < b) {
a = b;
return 1;
}
return... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define fi first
#define se second
template <typename A, typename B> inline bool chmax(A &a, B b) {
if (a < b) {
a = b;
return 1;
}
return... | [
"call.add",
"call.arguments.change"
] | 1,029,533 | 1,029,534 | u105791541 | cpp |
p03241 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define dup(x, y) (((x) + (y)-1) / (y)) // dup * y >= x なる最小のdup.
using namespace std;
typedef long... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define dup(x, y) (((x) + (y)-1) / (y)) // dup * y >= x なる最小のdup.
using namespace std;
typedef long... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,535 | 1,029,536 | u017293723 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#defi... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,539 | 1,029,540 | u390193191 | cpp |
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() {
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)
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,541 | 1,029,542 | u052247353 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.