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 <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",
"expression.operation.binary.remove"
] | 1,029,901 | 1,029,899 | u317715099 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int ans = 1;
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= sqrt(m); i++) {
if (m % i)
continue;
if (m / i >= n)
ans = max(m / i, ans);
if (i >= n)
ans = max(i, ans);
}
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
int n, m;
int ans = 1;
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= sqrt(m); i++) {
if (m % i)
continue;
if (m / i >= n)
ans = max(i, ans);
if (i >= n)
ans = max(m / i, ans);
}
printf("%d\n", ans);
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,029,905 | 1,029,906 | u073260074 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ans = 0;
cin >> n >> m;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (i * n <= m)
ans = max(ans, i);
if (m / i * n <= m)
ans = max(ans, m / i);
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, ans = 0;
cin >> n >> m;
for (long long i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (i * n <= m)
ans = max(ans, i);
if (m / i * n <= m)
ans = max(ans, m / i);
}
}
cout << ans;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change"
] | 1,029,909 | 1,029,910 | u004109131 | cpp |
p03241 | #include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int l = sqrt(m);
for (int i = l; i >= 1; i--) {
if (m % i == 0 && m / i >= n)
return printf("%d\n", i), 0;
}
return 0;
}
| #include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int l = m / n + 1;
for (int i = l; i >= 1; i--) {
if (m % i == 0 && m / i >= n)
return printf("%d\n", i), 0;
}
return 0;
}
| [
"call.remove",
"call.arguments.change"
] | 1,029,911 | 1,029,912 | u174476896 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, const char *argv[]) {
long N, M;
cin >> N >> M;
long dmax = 1;
for (long i = 1; i * i <= M; i++) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, const char *argv[]) {
long N, M;
cin >> N >> M;
long dmax = 1;
for (long i = 1; i * i <= M; i++) {
... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,029,915 | 1,029,916 | u320491590 | cpp |
p03241 | //
// abc112d.cpp
//
//
// Created by Yoshida Satoshi on 2018/10/22.
//
#include <cmath>
#include <iostream>
#include <stdio.h>
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) {
if (i >= N)
ans = max(ans, M / i);
... | //
// abc112d.cpp
//
//
// Created by Yoshida Satoshi on 2018/10/22.
//
#include <cmath>
#include <iostream>
#include <stdio.h>
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) {
if (i >= N)
ans = max(ans, M / i);
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,029,920 | 1,029,921 | u109200592 | cpp |
p03241 | //
// abc112d.cpp
//
//
// Created by Yoshida Satoshi on 2018/10/22.
//
#include <cmath>
#include <iostream>
#include <stdio.h>
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) {
if (i >= N)
ans = max(ans, M / i);
... | //
// abc112d.cpp
//
//
// Created by Yoshida Satoshi on 2018/10/22.
//
#include <cmath>
#include <iostream>
#include <stdio.h>
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) {
if (i >= N)
ans = max(ans, M / i);
... | [
"control_flow.branch.if.condition.change"
] | 1,029,922 | 1,029,921 | u109200592 | cpp |
p03241 | //
// abc112d.cpp
//
//
// Created by Yoshida Satoshi on 2018/10/22.
//
#include <cmath>
#include <iostream>
#include <stdio.h>
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) {
if (i >= N)
ans = max(ans, M / i);
... | //
// abc112d.cpp
//
//
// Created by Yoshida Satoshi on 2018/10/22.
//
#include <cmath>
#include <iostream>
#include <stdio.h>
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) {
if (i >= N)
ans = max(ans, M / i);
... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 1,029,923 | 1,029,921 | u109200592 | cpp |
p03241 | //
// abc112d.cpp
//
//
// Created by Yoshida Satoshi on 2018/10/22.
//
#include <cmath>
#include <iostream>
#include <stdio.h>
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) {
if (i >= N)
ans = max(ans, M / i);
... | //
// abc112d.cpp
//
//
// Created by Yoshida Satoshi on 2018/10/22.
//
#include <cmath>
#include <iostream>
#include <stdio.h>
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) {
if (i >= N)
ans = max(ans, M / i);
... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"expression.operator.compare.change"
] | 1,029,924 | 1,029,921 | u109200592 | cpp |
p03241 | #define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#... | #define _CRT_NONSTDC_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,029,929 | 1,029,930 | u713333397 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m, ans = 1;
cin >> n >> m;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
int first = i, second = m / i;
if (first * n <= m)
ans = max(ans, first);
if (second * n <= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n, m, ans = 1;
cin >> n >> m;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
long long int first = i, second = m / i;
if (first * n <= m)
ans = max(ans, first);
... | [
"variable_declaration.type.widen.change"
] | 1,029,933 | 1,029,934 | u257960005 | cpp |
p03241 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
//#define DEBUG true
#define DEBUG false
using namespace std;
const int MAX = 10... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
//#define DEBUG true
#define DEBUG false
using namespace std;
const int MAX = 10... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 1,029,935 | 1,029,936 | u248995595 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ma = 0;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0 && i <= m / n) {
ma = max(ma, i);
if (i >= n) {
ma = max(ma, n / i);
}
}
}
cout << ma << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ma = 0;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0 && i <= m / n) {
ma = max(ma, i);
if (i >= n) {
ma = max(ma, m / i);
}
}
}
cout << ma << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,029,937 | 1,029,938 | u387258288 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ma = 0;
for (int i = 1; i <= sqrt(m); i++) {
if (m % i == 0 && i <= m / n) {
ma = max(ma, i);
if (i >= n) {
ma = max(ma, n / i);
}
}
}
cout << ma << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ma = 0;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0 && i <= m / n) {
ma = max(ma, i);
if (i >= n) {
ma = max(ma, m / i);
}
}
}
cout << ma << endl;
} | [
"control_flow.loop.for.condition.change",
"call.remove",
"call.arguments.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,029,939 | 1,029,938 | u387258288 | cpp |
p03241 | //#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int d = m / n; d >= 1; --d) {
int ret = m / d;
if (m % d == 0 && ret >= n) {
printf("%d\n", ret);
break;
}
}
return 0;
} | //#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int d = m / n; d >= 1; --d) {
int ret = m / d;
if (m % d == 0 && ret >= n) {
printf("%d\n", d);
break;
}
}
return 0;
} | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 1,029,958 | 1,029,959 | u261374857 | cpp |
p03241 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | [
"control_flow.return.add"
] | 1,029,960 | 1,029,961 | u579875569 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
int ans = 0;
cin >> N >> M;
for (int i = 1; i * i <= N; i++) {
if (M % i)
continue;
int x ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
int ans = 0;
cin >> N >> M;
for (int i = 1; i * i <= M; i++) {
if (M % i)
continue;
int x ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,029,962 | 1,029,963 | u105959367 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
int ans = 0;
cin >> N >> M;
for (int i = 1; i * i <= N; i++) {
if (M % i)
continue;
int x ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
int ans = 0;
cin >> N >> M;
for (int i = 1; i * i <= M; i++) {
if (M % i)
continue;
int x ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,029,964 | 1,029,963 | u105959367 | cpp |
p03241 | #include <iostream>
using namespace std;
int n, m;
int main() {
cin >> n >> m;
for (int i = m / 2; i >= 1; i--)
if (m % i == 0 and i <= n and 1LL * n * i <= 1LL * m) {
cout << i;
return 0;
}
return 0;
}
| #include <iostream>
using namespace std;
int n, m;
int main() {
cin >> n >> m;
for (int i = m / n; i >= 1; i--)
if (m % i == 0 and 1LL * n * i <= 1LL * m) {
cout << i;
return 0;
}
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,029,977 | 1,029,976 | u479602674 | cpp |
p03241 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define EPS 1e-9
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#define REPR1(i, n) for (ll i = (n); i > 0; -... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define EPS 1e-9
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#define REPR1(i, n) for (ll i = (n); i > 0; -... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 1,029,980 | 1,029,979 | u388817534 | cpp |
p03241 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define EPS 1e-9
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#define REPR1(i, n) for (ll i = (n); i > 0; -... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define EPS 1e-9
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#define REPR1(i, n) for (ll i = (n); i > 0; -... | [
"expression.operation.binary.add"
] | 1,029,981 | 1,029,979 | u388817534 | cpp |
p03241 | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------... | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,029,986 | 1,029,987 | u150376070 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m, ans = 1;
cin >> n >> m;
forx(i, 1, m / 2 + 1) {
if (m % i == 0)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m, ans = 1;
cin >> n >> m;
forx(i, 1, m / 2 + 1) {
if (m % i == 0)
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,029,988 | 1,029,989 | u604231488 | cpp |
p03241 | #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;
if (M / i >= N)
ans = i;
if (i >= N) {
ans = M % i;
break;
}
}
cout << ans << endl;
return 0;
}
| #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;
if (M / i >= N)
ans = i;
if (i >= N) {
ans = M / i;
break;
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,029,992 | 1,029,993 | u059727354 | cpp |
p03241 | #include <bits/stdc++.h>
#define up(i, a, b) for (int i = a; i <= b; i++)
#define down(i, a, b) for (int i = a; i >= b; i--)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i > b; i--)
#define self (*this)
#define pb push_back
#define cntbit(x) __builtin_popcountll(x)
#define x fi... | #include <bits/stdc++.h>
#define up(i, a, b) for (int i = a; i <= b; i++)
#define down(i, a, b) for (int i = a; i >= b; i--)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i > b; i--)
#define self (*this)
#define pb push_back
#define cntbit(x) __builtin_popcountll(x)
#define x fi... | [
"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,998 | 1,029,999 | u814647611 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
vector<int> frac;
for (int i = 1; i * i <= m; ++i) {
if (i * i == m)
frac.emplace_back(i);
else if (m % i == 0)
frac.emplace_back(i), frac.emplace_back(m / i);
}
sort(frac.begin(), frac.end(), g... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
vector<int> frac;
for (int i = 1; i * i <= m; ++i) {
if (i * i == m)
frac.emplace_back(i);
else if (m % i == 0)
frac.emplace_back(i), frac.emplace_back(m / i);
}
sort(frac.begin(), frac.end(), g... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,030,004 | 1,030,005 | u976321756 | cpp |
p03241 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#in... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#in... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,012 | 1,030,013 | u112723190 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, ans = 1;
cin >> N >> M;
for (int i = 1; i * i < M; i += 1)
if (M % i) {
if (M / i >= N)
ans = max(ans, i);
if (i >= N)
ans = max(ans, M / i);
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, ans = 1;
cin >> N >> M;
for (int i = 1; i * i < M; i += 1)
if (M % i == 0) {
if (M / i >= N)
ans = max(ans, i);
if (i >= N)
ans = max(ans, M / i);
}
cout << ans;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,030,026 | 1,030,027 | u018438536 | cpp |
p03241 | #include <iostream>
#include <math.h>
using namespace std;
int n, m;
#define N 100010
int main() {
ios::sync_with_stdio(false);
while (cin >> n >> m) {
if (m % n == 0)
cout << m / n << endl;
else {
for (int i = sqrt(m); i >= 1; i--) {
if (m % i == 0 && m / i > n) {
cout << i <<... | #include <iostream>
#include <math.h>
using namespace std;
int n, m;
#define N 100010
int main() {
ios::sync_with_stdio(false);
while (cin >> n >> m) {
if (m % n == 0)
cout << m / n << endl;
else {
for (int i = m / n; i >= 1; i--) {
if (m % i == 0 && m / i > n) {
cout << i << e... | [
"control_flow.loop.for.initializer.change",
"call.remove",
"call.arguments.change"
] | 1,030,030 | 1,030,031 | u820628270 | 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 <= M; i++) {
if (M % i == 0) {
if (i <= M / N)
ans = i;
if (M / i <= M / N)
ans = max(ans, M / i);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 0;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
if (i <= M / N)
ans = max(ans, i);
if (M / i <= M / N)
ans = max(ans, M / i);
}
}
cout << ans << endl;
} | [
"call.add",
"call.arguments.change"
] | 1,030,050 | 1,030,051 | u392423112 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int ans = 1;
for (int a = 1; a * a < m; a++) {
int b = m / a;
if (m % a != 0)
continue;
if (m / a > n)
ans = max(ans, a);
if (m / b > n)
ans = max(ans, b);
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int ans = 1;
for (int a = 1; a * a < m; a++) {
int b = m / a;
if (m % a != 0)
continue;
if (m / a >= n)
ans = max(ans, a);
if (m / b >= n)
ans = max(ans, b);
}
cout <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,030,056 | 1,030,057 | u374929478 | cpp |
p03241 | #include <algorithm>
#include <iomanip>
#include <ios> // std::left, std::right
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string ... | #include <algorithm>
#include <iomanip>
#include <ios> // std::left, std::right
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 1,030,064 | 1,030,065 | u824337972 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
long D = 0;
for (long i = (M / N); i > 1; i--) {
if (M % i == 0) {
D = i;
break;
}
}
cout << D << "\n";
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
long D = 0;
for (long i = (M / N); i >= 1; i--) {
if (M % i == 0) {
D = i;
break;
}
}
cout << D << "\n";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,030,067 | 1,030,068 | u326356738 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N, M;
cin >> N >> M;
ll maxi = 1;
for (ll i = 2; i * i <= M; i++) {
if (M % i == 0) {
if (M / i >= N)
maxi =... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N, M;
cin >> N >> M;
ll maxi = 1;
for (ll i = 1; i * i <= M; i++) {
if (M % i == 0) {
if (M / i >= N)
maxi =... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,084 | 1,030,085 | u157322125 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N, M;
cin >> N >> M;
ll maxi = 0;
for (ll i = 2; i * i <= M; i++) {
if (M % i == 0) {
if (M / i >= N)
maxi =... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N, M;
cin >> N >> M;
ll maxi = 1;
for (ll i = 1; i * i <= M; i++) {
if (M % i == 0) {
if (M / i >= N)
maxi =... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,086 | 1,030,085 | u157322125 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
ll N, M;
cin >> N >> M;
ll num = M;
vector<ll> div;
for (int i = 1; i * i <= M; i++) {
if (num % i == 0) {
div.push_b... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
ll N, M;
cin >> N >> M;
ll num = M;
vector<ll> div;
for (ll i = 1; i * i <= M; i++) {
if (num % i == 0) {
div.push_ba... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 1,030,087 | 1,030,088 | u157322125 | cpp |
p03241 | #include <algorithm>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#in... | #include <algorithm>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#in... | [
"control_flow.loop.for.condition.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,030,094 | 1,030,095 | u181719868 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
ll ans = 0;
for (ll i = 2; i * i <= M; ++i) {
if (M % i == 0) {
ll b = M / i;
if (b * N <= M)
ans = max(ans, b);
if (i * N <... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
ll ans = 1;
for (ll i = 1; i * i <= M; ++i) {
if (M % i == 0) {
ll b = M / i;
if (b * N <= M)
ans = max(ans, b);
if (i * N <... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,096 | 1,030,097 | u181719868 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [
"assignment.change"
] | 1,030,098 | 1,030,099 | u181719868 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
long long n, m;
std::cin >> n >> m;
long long result = 1;
for (long long i = 2; i * i <= m; i++) {
if (m % i == 0) {
long long j = m / i;
if (n <= m / j) {
result = std::max(result, j);
}
if (n <= m / i)... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
long long n, m;
std::cin >> n >> m;
long long result = 1;
for (long long i = 1; i * i <= m; i++) {
if (m % i == 0) {
long long j = m / i;
if (n <= m / j) {
result = std::max(result, j);
}
if (n <= m / i)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,103 | 1,030,104 | u901295506 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,107 | 1,030,108 | u685892567 | cpp |
p03241 | #include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 1;
for (int i = 2; i <= floor(sqrt(M)); i++) {
if (M % i == 0) {
if (i <= M / N)
ans = max(ans, i);
if (N <= i)
ans = max(ans, M / i);
... | #include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 1;
for (int i = 1; i <= floor(sqrt(M)); i++) {
if (M % i == 0) {
if (i <= M / N)
ans = max(ans, i);
if (N <= i)
ans = max(ans, M / i);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,113 | 1,030,114 | u547742717 | cpp |
p03241 | #include <bits/stdc++.h>
#define F(i, n) for (int i = 1; i <= (int)n; i++)
#define FF(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define pi pair<int, int>
#define re(x) (int)x.size()
#define y1 u228
#define vi vec... | #include <bits/stdc++.h>
#define F(i, n) for (int i = 1; i <= (int)n; i++)
#define FF(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define pi pair<int, int>
#define re(x) (int)x.size()
#define y1 u228
#define vi vec... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,030,115 | 1,030,116 | u744195405 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> void chmax(T &a, const T &b) {
if (b > a)
a = b;
}
const char *LF = "\n";
namespace {
struct _ {
_() {
cin.tie(0);
ios::sync_with_stdio(false);
}
} a;
} // namespace
signed main() {
ll n, m, ans;
cin >> n >> m;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> void chmax(T &a, const T &b) {
if (b > a)
a = b;
}
const char *LF = "\n";
namespace {
struct _ {
_() {
cin.tie(0);
ios::sync_with_stdio(false);
}
} a;
} // namespace
signed main() {
ll n, m, ans = 0;
cin >> n >>... | [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,030,121 | 1,030,120 | u248306486 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
long long n, k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
long long n, k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,030,122 | 1,030,123 | u064087840 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int N, M;
cin >> N >> M;
for (int i = N; i >= 1; i--) {
if (M % i == 0) {
cout <... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int N, M;
cin >> N >> M;
for (int i = M / N; i >= 1; i--) {
if (M % i == 0) {
co... | [
"control_flow.loop.for.initializer.change"
] | 1,030,127 | 1,030,128 | u285598935 | cpp |
p03241 | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int c = m / n;
int ans;
if (n == 1) {
cout << m << endl;
} else {
for (int i = 1; i <= c; i++) {
if (m % i == 0) {
ans = i;
}
}
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int c = m / n;
int ans;
if (n == 1) {
cout << m << endl;
} else {
for (int i = 1; i <= c; i++) {
if (m % i == 0) {
ans = i;
}
}
cout << ans << endl;
}
} | [] | 1,030,129 | 1,030,130 | u179970156 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long n, m, ans = 1;
cin >> n >> m;
for (long long i = 1; i * i <= m; i++) {
if (m % i != 0)
continue;
long long j = m / i;
if (i * n <= m)
ans = max(ans, i);
if (j * n <= m)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long n, m, ans = 1;
cin >> n >> m;
for (long long i = 1; i * i <= m; i++) {
if (m % i != 0)
continue;
long long j = m / i;
if (i * n <= m)
ans = max(ans, i);
if (j * n <= m)
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,030,133 | 1,030,134 | u136869985 | cpp |
p03241 | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
ll N, M;
void input() { cin >> N >> M; }
void solve() {
ll ans = 1;
for (ll n = 2; n <= min(double(M / ... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
ll N, M;
void input() { cin >> N >> M; }
void solve() {
ll ans = 0;
for (ll n = 1; n <= min(double(M / ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,137 | 1,030,138 | u500092662 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
vector<ll> frac(ll n) {
vector<ll> res;
res.clear();
for (ll i = 2LL; i * i <= n; ++i) {
if (n % i == 0LL) {
res.push_back(i)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
vector<ll> frac(ll n) {
vector<ll> res;
res.clear();
for (ll i = 1LL; i * i <= n; ++i) {
if (n % i == 0LL) {
res.push_back(i)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 1,030,153 | 1,030,154 | u635277286 | cpp |
p03241 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
vector<ll> frac(ll n) {
vector<ll> res;
res.clear();
for (ll i = 2LL; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
vector<ll> frac(ll n) {
vector<ll> res;
res.clear();
for (ll i = 1LL; i * i <= n; ++i) {
if (n % i == 0LL) {
res.push_back(i)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 1,030,155 | 1,030,154 | u635277286 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define prin(arg) cout << arg
#define scan(arg) cin >> arg
#define newl cout << "\n"
using namespace std;
typedef vector<int> vi;
int N, M;
vi d;
vi divisor(int a) { // aの約数が全列挙されたベクトルを返す
vi res;
for (int i = 1;... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define prin(arg) cout << arg
#define scan(arg) cin >> arg
#define newl cout << "\n"
using namespace std;
typedef vector<int> vi;
int N, M;
vi d;
vi divisor(int a) { // aの約数が全列挙されたベクトルを返す
vi res;
for (int i = 1;... | [
"literal.number.change",
"call.arguments.change"
] | 1,030,158 | 1,030,159 | u110996038 | cpp |
p03241 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
t... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
t... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 1,030,167 | 1,030,168 | u355335354 | cpp |
p03241 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,030,169 | 1,030,170 | u874996917 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
#define REP(i, n) for (int i = 0; i < (n); ++i)
// 約数を求める
vi divisor(int n) {
vi res;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) {
res.push_back(n / i);
}
}
}
ret... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
#define REP(i, n) for (int i = 0; i < (n); ++i)
// 約数を求める
vi divisor(int n) {
vi res;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) {
res.push_back(n / i);
}
}
}
ret... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,030,173 | 1,030,174 | u833393891 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | [
"control_flow.branch.if.condition.change"
] | 1,030,175 | 1,030,176 | u833393891 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n, m;
cin >> n >> m;
long long int res = 1;
for (long long int i = 1; i <= sqrt(m); i++) {
if (m % i == 0) {
if (i <= n) {
res = max(res, m / i);
}
if (m ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n, m;
cin >> n >> m;
long long int res = 1;
for (long long int i = 1; i <= sqrt(m); i++) {
if (m % i == 0) {
if (i >= n) {
res = max(res, m / i);
}
if (m ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,030,181 | 1,030,182 | u365058393 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N = 0, M = 0, G = 0;
cin >> N >> M;
for (int i = 1; i <= sqrt(M); i++) {
if (M % i == 0) {
int q = M / i;
int temp[2] = {};
if (q >= N) {
temp[0] = i;
} else if (i >= N) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N = 0, M = 0, G = 0;
cin >> N >> M;
for (int i = 1; i <= sqrt(M); i++) {
if (M % i == 0) {
int q = M / i;
int temp[2] = {};
if (q >= N) {
temp[0] = i;
if (i >= N) {
t... | [] | 1,030,183 | 1,030,184 | u180262908 | cpp |
p03241 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).beg... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).beg... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,030,187 | 1,030,188 | u061916079 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
int main() {
ll n, m, ans;
vector<ll> divisor;
cin >> n >> m;
if (n == 1) {
cout << m << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
int main() {
ll n, m, ans = 1;
vector<ll> divisor;
cin >> n >> m;
if (n == 1) {
cout << m << endl... | [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,197 | 1,030,198 | u934105772 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, m;
cin >> n;
cin >> m;
vector<int> dd(0);
for (int i = 2; i * i <= m; i++) {
if (m % i == 0) {
dd.push_back(i);
dd.p... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, m;
cin >> n;
cin >> m;
vector<int> dd(0);
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
dd.push_back(i);
dd.p... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,201 | 1,030,202 | u242680486 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// map<ll,ll> yaku;
vector<ll> yaku;
int main() {
ll n, m;
cin >> n >> m;
ll i = 1;
while (i * i <= m) {
if (m % i == 0) {
yaku.push_back(i);
yaku.push_back(m / i);
}
i++;
}
sort(yaku.begin(), yaku.end(), greate... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> yaku;
int main() {
ll n, m;
cin >> n >> m;
ll i = 1;
while (i * i <= m) {
if (m % i == 0) {
yaku.push_back(i);
yaku.push_back(m / i);
}
i++;
}
sort(yaku.begin(), yaku.end(), greater<>());
i = 0;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,030,206 | 1,030,207 | u906651641 | cpp |
p03241 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long n, m;
cin >> n >> m;
long ans = 1;
for (long i = 2; i * i <= m; i++) {
long r = m % i;
if (r == 0) {
if (m >= i * n)
ans = max(i, ans);
if (i >= n)
ans = max(m / i, ans);
}
}
cout << ans ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long n, m;
cin >> n >> m;
long ans = 1;
for (long i = 1; i * i <= m; i++) {
long r = m % i;
if (r == 0) {
if (m >= i * n)
ans = max(i, ans);
if (i >= n)
ans = max(m / i, ans);
}
}
cout << ans ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,208 | 1,030,209 | u280512618 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
vector<pair<ll, ll>> prime_factor(int64_t n) {
vector<pair<ll, ll>> ret;
for (int64_t i = 2; i * i <= n; i++) {
if (n % i == 0)
ret.push_back(pair<ll, ll>(i, 0));
while (n % i == 0) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
vector<pair<ll, ll>> prime_factor(int64_t n) {
vector<pair<ll, ll>> ret;
for (int64_t i = 2; i * i <= n; i++) {
if (n % i == 0)
ret.push_back(pair<ll, ll>(i, 0));
while (n % i == 0) ... | [
"literal.number.change",
"assignment.value.change"
] | 1,030,219 | 1,030,220 | u273357559 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
vector<pair<ll, ll>> prime_factor(int64_t n) {
vector<pair<ll, ll>> ret;
for (int64_t i = 2; i * i <= n; i++) {
if (n % i == 0)
ret.push_back(pair<ll, ll>(i, 0));
while (n % i == 0) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
vector<pair<ll, ll>> prime_factor(int64_t n) {
vector<pair<ll, ll>> ret;
for (int64_t i = 2; i * i <= n; i++) {
if (n % i == 0)
ret.push_back(pair<ll, ll>(i, 0));
while (n % i == 0) ... | [
"literal.number.change",
"assignment.value.change"
] | 1,030,221 | 1,030,220 | u273357559 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define con continue
#define bk break
#define LL long long
#define db double
#define pt cout << '\n';
#define ms(a, b) memset((a), (b), sizeof(a))
#define mp make_pair
LL inf = 2147483647;
const long long ll = 9223372036854775807, ninf = 1000000000;
const double eps = 1e-6;... | #include <bits/stdc++.h>
using namespace std;
#define con continue
#define bk break
#define LL long long
#define db double
#define pt cout << '\n';
#define ms(a, b) memset((a), (b), sizeof(a))
#define mp make_pair
LL inf = 2147483647;
const long long ll = 9223372036854775807, ninf = 1000000000;
const double eps = 1e-6;... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,228 | 1,030,229 | u805468645 | cpp |
p03241 | #include <cmath>
#include <cstdio>
using namespace std;
int main() {
int n, m, d;
scanf("%d %d", &n, &m);
for (d = m / n; d >= 2; d--) {
if (m % d == 0 && n <= m / d) {
printf("%d\n", d);
break;
}
}
return 0;
}
| #include <cmath>
#include <cstdio>
using namespace std;
int main() {
int n, m, d;
scanf("%d %d", &n, &m);
for (d = m / n; d >= 1; d--) {
if (m % d == 0 && n <= m / d) {
printf("%d\n", d);
break;
}
}
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,030,230 | 1,030,231 | u067884729 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#defin... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"assignment.change"
] | 1,030,232 | 1,030,233 | u995997203 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define ll long long
#define pi pair<ll, ll>
#define mp(a, b) make_pair(a, b)
#define rep(i, a, b) for (ll i = a; i < b; i++)
using namespace std;
ll n, m;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define ll long long
#define pi pair<ll, ll>
#define mp(a, b) make_pair(a, b)
#define rep(i, a, b) for (ll i = a; i < b; i++)
using namespace std;
ll n, m;
... | [
"literal.number.change",
"call.arguments.change"
] | 1,030,240 | 1,030,241 | u751243213 | cpp |
p03241 | #include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j, k, n, m, ans = 1;
scanf("%lld%lld", &n, &m);
vector<ll> v;
for (i = 2; i <= sqrt(m); ++i)
if (!(m % i))
v.push_back(i);
for (i = v.size() - 1; i >= 0; --i)
v.push_back(m /... | #include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j, k, n, m, ans = 1;
scanf("%lld%lld", &n, &m);
vector<ll> v;
for (i = 1; i <= sqrt(m); ++i)
if (!(m % i))
v.push_back(i);
for (i = v.size() - 1; i >= 0; --i)
v.push_back(m /... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,242 | 1,030,243 | u440920318 | cpp |
p03241 | #include <iostream>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <stdlib.h>
#include <string>
#include <algorithm>
#include <functional>
#include <math.h>
#include <fstream>
#include <iomanip>
using namespace std;
using ll = long long;... | #include <iostream>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <stdlib.h>
#include <string>
#include <algorithm>
#include <functional>
#include <math.h>
#include <fstream>
#include <iomanip>
using namespace std;
using ll = long long;... | [
"literal.number.change",
"call.arguments.change"
] | 1,030,244 | 1,030,245 | u692632484 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int ans = 1;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (m / i >= n)
ans = max(i, ans);
if (i >= n)
ans = max(i, ans);
}
}
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int ans = 1;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (m / i >= n)
ans = max(i, ans);
if (i >= n)
ans = max(m / i, ans);
}
}
printf("%d\n", ans);
return 0;
} | [
"assignment.change"
] | 1,030,248 | 1,030,249 | u935845450 | cpp |
p03241 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P2;
#define fi first
#define se second
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
signed main() {
int n, m;
cin >> n >> m;
vector<int> v;
for (... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P2;
#define fi first
#define se second
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
signed main() {
int n, m;
cin >> n >> m;
vector<int> v;
for (... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,030,250 | 1,030,251 | u777468981 | cpp |
p03241 | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long int ll;
ll N, M;
int main() {
scanf("%lld %lld", &N, &M);
ll res = 1;
for (ll i = 1; i * i <= M; i++) {
if (M % i == 0 && i * N <= M)
res = max(res, i);
if (M % i == 0 && i * N <= M)
res = max(res, i);
}
printf... | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long int ll;
ll N, M;
int main() {
scanf("%lld %lld", &N, &M);
ll res = 1;
for (ll i = 1; i * i <= M; i++) {
if (M % i == 0 && i * N <= M)
res = max(res, i);
if (M % i == 0 && (M / i) * N <= M)
res = max(res, M / i);
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 1,030,254 | 1,030,255 | u755090102 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define popb pop_back()
#define sz size()
#define y1 dfsdsfsdfsd
#define next fdsfsdfjkl
#define speed \
ios_base::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define popb pop_back()
#define sz size()
#define y1 dfsdsfsdfsd
#define next fdsfsdfjkl
#define speed \
ios_base::sync_with_stdi... | [
"call.add",
"call.arguments.change"
] | 1,030,256 | 1,030,257 | u381061204 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
usin... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
usin... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,030,262 | 1,030,263 | u294531924 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> v;
for (int i = 1; i * i <= m; ++i) {
if (m % i == 0) {
v.push_back(i);
v.push_back(m / i);
}
}
sort(v.begin(), v.end());
int ans = 1;
for (auto x : v) {
if (x... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> v;
for (ll i = 1; i * i <= m; ++i) {
if (m % i == 0) {
v.push_back(i);
v.push_back(m / i);
}
}
sort(v.begin(), v.end());
ll ans = 1;
for (auto x : v) {
if (x * n... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 1,030,266 | 1,030,267 | u402472923 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int isGood(int N, int sum) { return (sum >= N); }
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int N, M;
cin >> N >> M;
int ans = 0;
for (int i = 1; i * i <= M; i++) {
if (M % i)
continue;
if (isGood(N, M / i))
... | #include <bits/stdc++.h>
using namespace std;
int isGood(int N, int sum) { return (sum >= N); }
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int N, M;
cin >> N >> M;
int ans = 0;
for (int i = 1; i * i <= M; i++) {
if (M % i)
continue;
if (isGood(N, M / i))
... | [
"assignment.change"
] | 1,030,272 | 1,030,273 | u363653022 | cpp |
p03241 | #include <bits/stdc++.h>
#define Tree int h, int l, int r, int L, int R
#define left 2 * h, l, (l + r) / 2, L, R
#define right 2 * h + 1, (l + r) / 2 + 1, r, L, R
#define F first
#define S second
#define Pb push_back
using namespace std;
long long n, m, A, B, ans = 1;
main() {
cin >> n >> m;
for (int i = 2; i <= s... | #include <bits/stdc++.h>
#define Tree int h, int l, int r, int L, int R
#define left 2 * h, l, (l + r) / 2, L, R
#define right 2 * h + 1, (l + r) / 2 + 1, r, L, R
#define F first
#define S second
#define Pb push_back
using namespace std;
long long n, m, A, B, ans;
main() {
cin >> n >> m;
for (int i = 1; i <= sqrt(... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,274 | 1,030,275 | u898791488 | cpp |
p03241 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pcc pair<char, char>
#define vi vector<int>
#define vl vector<ll>
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define p... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pcc pair<char, char>
#define vi vector<int>
#define vl vector<ll>
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define p... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,030,276 | 1,030,277 | u153343375 | cpp |
p03241 | #include <bits/stdc++.h>
#include <random>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
#define MOD 1000000007LL
#define INF 1000000000LL
#define EPS 1e-10
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define DUMP(a) ... | #include <bits/stdc++.h>
#include <random>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
#define MOD 1000000007LL
#define INF 1000000000LL
#define EPS 1e-10
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define DUMP(a) ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,030,278 | 1,030,279 | u607034173 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
long long n, m, ans = 0;
int main() {
cin >> n >> m;
for (long long i = 1; i * i <= m; ++i) {
if (m % i == 0) {
if (m / i >= n) {
ans = max(ans, m / i);
}
if (i >= n) {
ans = max(ans, i);
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, m, ans = 0;
int main() {
cin >> n >> m;
for (long long i = 1; i * i <= m; ++i) {
if (m % i == 0) {
if (m / i >= n) {
ans = max(ans, i);
}
if (i >= n) {
ans = max(ans, m / i);
}
}
}
cout << ans << endl;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 1,030,280 | 1,030,281 | u437553474 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//#define int long long
#define reps(i, s, n) for (int(i) = (s... | #include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//#define int long long
#define reps(i, s, n) for (int(i) = (s... | [
"expression.operation.binary.remove"
] | 1,030,282 | 1,030,283 | u065125881 | cpp |
p03241 | #include <bits/stdc++.h>
/*
#include <boost/functional/hash.hpp>
#include <boost/multiprecision/cpp_int.hpp>
typedef boost::multiprecision::cpp_int mlint;
*/
#define debug 0
#define fcout(d) cout << fixed << setprecision(d)
#define urep(i, s, t) for (int i = (int)(s); i <= (int)(t); ++i)
#define drep(i, s, t) for (in... | #include <bits/stdc++.h>
/*
#include <boost/functional/hash.hpp>
#include <boost/multiprecision/cpp_int.hpp>
typedef boost::multiprecision::cpp_int mlint;
*/
#define debug 0
#define fcout(d) cout << fixed << setprecision(d)
#define urep(i, s, t) for (int i = (int)(s); i <= (int)(t); ++i)
#define drep(i, s, t) for (in... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,030,284 | 1,030,285 | u629015299 | cpp |
p03242 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int t, h, o;
t = n / 100;
h = n / 10 - 1... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int t, h, o;
t = n / 100;
h = n % 100 / ... | [
"assignment.change",
"expression.operation.binary.remove"
] | 1,030,288 | 1,030,289 | u127741845 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
cout << (s[i] == '0' ? '9' : '0');
}
cout << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
cout << (s[i] == '1' ? '9' : '1');
}
cout << endl;
return (0);
}
| [
"literal.string.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 1,030,290 | 1,030,291 | u899084195 | cpp |
p03242 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,030,292 | 1,030,293 | u005006157 | cpp |
p03242 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0... | [] | 1,030,294 | 1,030,295 | u618263300 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<char> vec(3);
for (ll i = 0; i < 3; i++) {
cin >> vec.at(i);
if (vec.at(i) == '1') {
vec.at(i) = '9';
} else {
vec.at(i) == '1';
}
}
for (ll i = 0; i < 3; i++) {
cout << vec.at(i);
}
cout ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<char> vec(3);
for (ll i = 0; i < 3; i++) {
cin >> vec.at(i);
if (vec.at(i) == '1') {
vec.at(i) = '9';
} else {
vec.at(i) = '1';
}
}
for (ll i = 0; i < 3; i++) {
cout << vec.at(i);
}
cout <... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,030,300 | 1,030,301 | u883297128 | cpp |
p03242 | #include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
string n;
cin >> n;
rep(0, n.size()) {
if (n[i] == '1') {
cout << '9';
} else {
cout << '1';
}
cout << endl;
}
return 0;
}
| #include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
string n;
cin >> n;
rep(0, n.size()) {
if (n[i] == '1') {
cout << '9';
} else {
cout << '1';
}
}
cout << endl;
return 0;
}
| [] | 1,030,302 | 1,030,303 | u351174574 | cpp |
p03242 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | [
"control_flow.branch.if.condition.change"
] | 1,030,308 | 1,030,309 | u496511996 | cpp |
p03242 | //#define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | //#define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,310 | 1,030,311 | u096616343 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '1') {
s.at(i) = '9';
} else if (s.at(i) == '9') {
s.at(i) = '1';
}
}
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '1') {
s.at(i) = '9';
} else if (s.at(i) == '9') {
s.at(i) = '1';
}
}
cout << s << endl;
}
| [] | 1,030,312 | 1,030,313 | u758405447 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '1') {
s.at(i) = '9';
continue;
} else if (s.at(i) == '9') {
s.at(i) = '1';
continue;
}
}
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '1') {
s.at(i) = '9';
continue;
} else if (s.at(i) == '9') {
s.at(i) = '1';
continue;
}
}
cout << s << endl;
}
| [] | 1,030,314 | 1,030,315 | u758405447 | cpp |
p03242 |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i = i + 1) {
if (s[i] == '9')
cout << 9;
if (s[i] == '9')
cout << 1;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); i = i + 1) {
if (s[i] == '1')
cout << 9;
if (s[i] == '9')
cout << 1;
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 1,030,318 | 1,030,319 | u645553756 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '9')
cout << 9;
if (s[i] == '9')
cout << 1;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i = i + 1) {
if (s[i] == '1')
cout << 9;
if (s[i] == '9')
cout << 1;
}
return 0;
} | [
"control_flow.loop.for.update.change",
"assignment.change",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 1,030,320 | 1,030,321 | u645553756 | cpp |
p03242 |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i = i + 1) {
if (s[i] == '9')
cout << 9;
if (s[i] == '9')
cout << 1;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i = i + 1) {
if (s[i] == '1')
cout << 9;
if (s[i] == '9')
cout << 1;
}
return 0;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 1,030,318 | 1,030,321 | u645553756 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i = i + 1) {
if (s[i] == 9)
cout << 9;
if (s[i] == 9)
cout << 1;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i = i + 1) {
if (s[i] == '1')
cout << 9;
if (s[i] == '9')
cout << 1;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,030,324 | 1,030,321 | u645553756 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '9')
cout << 9;
if (s[i] == '9')
cout << 1;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '1')
cout << 9;
if (s[i] == '9')
cout << 1;
}
return 0;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 1,030,320 | 1,030,326 | u645553756 | cpp |
p03242 |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i = i + 1) {
if (s[i] == '9')
cout << 9;
if (s[i] == '9')
cout << 1;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '1')
cout << 9;
if (s[i] == '9')
cout << 1;
}
return 0;
} | [
"control_flow.loop.for.update.change",
"expression.operation.binary.remove",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 1,030,318 | 1,030,326 | u645553756 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.