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 |
|---|---|---|---|---|---|---|---|
p03242 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, sum = 0, m = 1;
cin >> n;
for (int i = 0; i < 2; i++) {
if (n % 10 == 1)
sum += 9 * m;
else
sum += 1 * m;
m *= 10;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, sum = 0, m = 1;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n % 10 == 1)
sum += 9 * m;
else
sum += 1 * m;
m *= 10;... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,031,478 | 1,031,479 | u028762029 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define rp(i, n) for (int i = 0; i < n; i++)
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define lrp(i, n) for (long long i = 0; i < n; i++)
#define lrep(i, m, n) for (long long i = m; i <= n; i++)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, n) for (int i = 0; i < n; i++)
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define lrp(i, n) for (long long i = 0; i < n; i++)
#define lrep(i, m, n) for (long long i = m; i <= n; i++)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a... | [
"literal.number.change",
"call.arguments.change"
] | 1,031,482 | 1,031,483 | u050138914 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < S.size(); i++)
S[i] = '9' - S[i] + 1;
cout << S;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < S.size(); i++)
S[i] = '9' - S[i] + '1';
cout << S;
return 0;
}
| [] | 1,031,484 | 1,031,485 | u927253988 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
s[i] = '9';
if (s[i] == '9')
s[i] = '1';
}
cout << s;
// your code goes here
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
s[i] = '9';
else if (s[i] == '9')
s[i] = '1';
}
cout << s;
// your code goes here
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,502 | 1,031,503 | u221519228 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = INF + 7;
const ll LINF = 1e18;
#define rep(i, N) for (int(i) = 0; (i) < (N); ++(i))
#define rrep(i, N) for (int(i) = (N - 1); (i) > 0; --i)
#define FOR(i, j, N) for (int(i) = (j); (i) < (N); ++(i))
#define put(n) co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = INF + 7;
const ll LINF = 1e18;
#define rep(i, N) for (int(i) = 0; (i) < (N); ++(i))
#define rrep(i, N) for (int(i) = (N - 1); (i) > 0; --i)
#define FOR(i, j, N) for (int(i) = (j); (i) < (N); ++(i))
#define put(n) co... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,504 | 1,031,505 | u031178961 | cpp |
p03242 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
void p(int n) {
if (n == 0)
return;
int c;
c = n % 10;
p(n / 10);
cout << c;
}
int main() {
int n;
cin >> n;
p(n);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
void p(int n) {
if (n == 0)
return;
int c;
c = n % 10;
p(n / 10);
c = 10 - c;
cout << c;
}
int main() {
int n;
cin >> n;
p(n);
return 0;
}
| [
"assignment.add"
] | 1,031,509 | 1,031,510 | u061597928 | cpp |
p03242 | #include <iostream>
using namespace std;
int main(void) {
int n, a[5], b[5];
cin >> n;
for (int i = 0; n > 0; n /= 10, i++) {
a[i] = n % 10;
}
for (int i = 0; i < 3; i++) {
if (a[i] == 1)
b[i] = 9;
if (a[i] == 9)
b[i] = 1;
else
b[i] = a[i];
}
cout << b[2] << b[1] << b[0] ... | #include <iostream>
using namespace std;
int main(void) {
int n, a[5], b[5];
cin >> n;
for (int i = 0; n > 0; n /= 10, i++) {
a[i] = n % 10;
}
for (int i = 0; i < 3; i++) {
if (a[i] == 1)
b[i] = 9;
else if (a[i] == 9)
b[i] = 1;
else
b[i] = a[i];
}
cout << b[2] << b[1] << ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,511 | 1,031,512 | u437973379 | cpp |
p03242 | #include "algorithm"
#include "cmath"
#include "iostream"
#include "string"
#include "vector"
int main(int argc, char const *argv[]) {
int NN;
std::cin >> NN;
int a1, a2, a3;
a1 = NN % 10;
a2 = ((NN - a1) / 10) % 10;
a3 = ((NN - a1 - a2 * 10) / 100) % 10;
std::cout << (10 - a1) + (10 - a2) * 10 + (10 ... | #include "algorithm"
#include "cmath"
#include "iostream"
#include "string"
#include "vector"
int main(int argc, char const *argv[]) {
int NN;
std::cin >> NN;
int a1, a2, a3;
a1 = NN % 10;
a2 = ((NN - a1) / 10) % 10;
a3 = ((NN - a1 - a2 * 10) / 100) % 10;
std::cout << (10 - a1) + (10 - a2) * 10 + (10 ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 1,031,513 | 1,031,514 | u271986615 | cpp |
p03242 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == '1')
n[i] = '9';
if (n[i] == '9')
n[i] = '1';
}
for (int i = 0; i < 3; i++)
cout << n[i];
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == '1')
n[i] = '9';
else if (n[i] == '9')
n[i] = '1';
}
for (int i = 0; i < 3; i++)
cout << n[i];
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,515 | 1,031,516 | u209767598 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
int str;
cin >> str;
int answer = 1100 - str;
cout << answer << endl;
} | #include <iostream>
using namespace std;
int main() {
int str;
cin >> str;
int answer = 1110 - str;
cout << answer << endl;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 1,031,529 | 1,031,530 | u643268746 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
int n, i;
int a[3];
cin >> n;
a[0] = n % 10;
a[1] = n / 10;
a[2] = n / 100;
for (i = 0; i < 3; i++) {
if (a[i] == 1)
a[i] = 9;
else
a[i] = 1;
}
cout << a[2] * 100 + a[1] * 10 + a[0] << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, i;
int a[3];
cin >> n;
a[0] = n % 10;
a[1] = n / 10 % 10;
a[2] = n / 100;
for (i = 0; i < 3; i++) {
if (a[i] == 1)
a[i] = 9;
else
a[i] = 1;
}
cout << a[2] * 100 + a[1] * 10 + a[0] << endl;
} | [
"assignment.change"
] | 1,031,538 | 1,031,539 | u989654188 | cpp |
p03242 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << 1100 - N << endl;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << 1110 - N << endl;
} | [
"literal.number.change",
"io.output.change"
] | 1,031,548 | 1,031,549 | u089295382 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string ab;
cin >> ab;
for (int i = 0; i < ab.size(); i++) {
if (ab[i] == '1')
ab[i] = '9';
if (ab[i] == '9')
ab[i] = '1';
}
cout << ab << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string ab;
cin >> ab;
for (int i = 0; i < ab.size(); i++) {
if (ab[i] == '1')
ab[i] = '9';
else if (ab[i] == '9')
ab[i] = '1';
}
cout << ab << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,550 | 1,031,551 | u537126698 | cpp |
p03242 | /* Author - Ankur Kumar Singh
IDE :- Offine Linux
---------------------------------*/
#include <bits/stdc++.h>
using namespace std;
/* variable type :- */
/* variable type :- */
#define ll long long int
#define ld long double
#define I ll
#define mod 1000000007
/* map */
#define abc pair<ll, ll>
map<pair<abc, abc>... | /* Author - Ankur Kumar Singh
IDE :- Offine Linux
---------------------------------*/
#include <bits/stdc++.h>
using namespace std;
/* variable type :- */
/* variable type :- */
#define ll long long int
#define ld long double
#define I ll
#define mod 1000000007
/* map */
#define abc pair<ll, ll>
map<pair<abc, abc>... | [
"literal.string.change",
"assignment.value.change"
] | 1,031,554 | 1,031,555 | u250660855 | cpp |
p03242 | #include <stdio.h>
int main() {
int a, b, c, n;
scanf("%d", &n);
c = n % 10;
n = n - c;
b = n % 100;
n = n - b;
if (c == 1)
c = 9;
else
c = 1;
if (b == 10)
b = 90;
else
b = 10;
if (n == 100)
n = 900;
else
n = 100;
printf("%d", a + b + n);
return 0;
} | #include <stdio.h>
int main() {
int a, b, c, n;
scanf("%d", &n);
c = n % 10;
n = n - c;
b = n % 100;
n = n - b;
if (c == 1)
c = 9;
else
c = 1;
if (b == 10)
b = 90;
else
b = 10;
if (n == 100)
n = 900;
else
n = 100;
printf("%d", c + b + n);
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,031,560 | 1,031,561 | u072831727 | cpp |
p03242 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,570 | 1,031,571 | u846813901 | cpp |
p03243 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
int f = 111;
cin >> n;
int ans = 0;
for (int i = 0; i < 8; i++) {
if (n <= f * (i + 1) && n > f * i) {
ans = f * (i + 1);
... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
int f = 111;
cin >> n;
int ans = 0;
for (int i = 0; i < 9; i++) {
if (n <= f * (i + 1) && n > f * i) {
ans = f * (i + 1);
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,031,572 | 1,031,573 | u583963729 | cpp |
p03243 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
int f = 111;
cin >> n;
int ans = 0;
for (int i = 1; i < 8; i++) {
if (n <= f * (i + 1) && n > f * i) {
ans = f * (i + 1);
... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
int f = 111;
cin >> n;
int ans = 0;
for (int i = 0; i < 9; i++) {
if (n <= f * (i + 1) && n > f * i) {
ans = f * (i + 1);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,031,574 | 1,031,573 | u583963729 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
//ありうる答え 999 888 777 666 555 444 333 222 111
for (int i = 0; i < 10; i++)
if (111 * i >= N && 111 * (i - 1) <= N)
cout << i * 111;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
// int A=max({N/100,N%100/10,N%100%10});
//ありうる答え 999 888 777 666 555 444 333 222 111
for (int i = 0; i < 10; i++)
if (111 * i >= N && 111 * (i - 1) < N)
cout << i * 111;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,031,575 | 1,031,576 | u470906288 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = 111;
while (n < ans) {
ans += 111;
}
cout << ans << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = 111;
while (n > ans) {
ans += 111;
}
cout << ans << endl;
return (0);
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,031,577 | 1,031,578 | u899084195 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> v;
pair<int, int> p;
map<int, int> m;
deque<int> d;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int x[9] = {111, 222, 333, 444, 555, 666, 777, 888, 999};
for (int i = 0; i < 9; i++)
if ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> v;
pair<int, int> p;
map<int, int> m;
deque<int> d;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int x[9] = {111, 222, 333, 444, 555, 666, 777, 888, 999};
for (int i = 0; i < 9; i++)
if ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,031,579 | 1,031,580 | u576955602 | cpp |
p03243 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end();
int main() {
int a;
cin >> a;
int b = a / 100;
b *= 111;
if (a < b)
cout <... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end();
int main() {
int a;
cin >> a;
int b = a / 100;
b *= 111;
if (a <= b)
cout ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,031,583 | 1,031,584 | u079532978 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N % 111 == 0 ? N : (N + 110) / 111) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N % 111 == 0 ? N : ((N + 110) / 111) * 111) << endl;
}
| [] | 1,031,585 | 1,031,586 | u430394202 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[10] = {0, 111, 222, 333, 444, 555, 666, 777, 888, 999}, n;
while (~scanf("%d", &n)) {
for (int i = 0; i < 9; i++) {
if (a[i + 1] > n && a[i] < n)
printf("%d\n", a[i + 1]);
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[10] = {0, 111, 222, 333, 444, 555, 666, 777, 888, 999}, n;
while (~scanf("%d", &n)) {
for (int i = 0; i < 9; i++) {
if (a[i + 1] >= n && a[i] < n)
printf("%d\n", a[i + 1]);
}
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,031,595 | 1,031,596 | u863370423 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define chmin(a, b) \
if ((a) > (b)) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define chmin(a, b) \
if ((a) > (b)) ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,031,597 | 1,031,598 | u552847961 | cpp |
p03243 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int k = 111;
for (int i = 1; i < 10; i++) {
if (k >= n) {
cout << i << endl;
return 0;
}
k += 111;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int k = 111;
for (int i = 1; i < 10; i++) {
if (k >= n) {
cout << k << endl;
return 0;
}
k += 111;
}
} | [
"identifier.change",
"io.output.change"
] | 1,031,599 | 1,031,600 | u422506696 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
if (n % 111 == 0)
cout << n << endl;
else
cout << (1 + n % 111) * 111 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
if (n % 111 == 0)
cout << n << endl;
else
cout << (1 + n / 111) * 111 << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 1,031,603 | 1,031,604 | u019136169 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n + 109) / 111 * 111;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n + 110) / 111 * 111;
}
| [
"literal.number.change",
"io.output.change"
] | 1,031,618 | 1,031,619 | u843175622 | cpp |
p03243 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int n;
int main() {
cin >> n;
vector<int> a(3);
a.at(0) = n % 10;
n -= a.at(0);
a.at(1) = (n / 10) % 10;
n -= a.at(1) * 10;
a.at(2) = n / 100;
n = 0;
if (a.at(2) < a.at(1)) { // 450
int b = a.at(2) + 1;
n = b + b * ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int n;
int main() {
cin >> n;
vector<int> a(3);
a.at(0) = n % 10;
n -= a.at(0);
a.at(1) = (n / 10) % 10;
n -= a.at(1) * 10;
a.at(2) = n / 100;
n = 0;
if (a.at(2) < a.at(1)) { // 450
int b = a.at(2) + 1;
n = b + b * ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,031,620 | 1,031,621 | u012298376 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, A) for (int i = 0; i < A; i++)
int main() {
int A;
cin >> A;
if (A % 111 == 0) {
cout << A << endl;
} else {
cout << 111 + A / 111 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, A) for (int i = 0; i < A; i++)
int main() {
int A;
cin >> A;
if (A % 111 == 0) {
cout << A << endl;
} else {
cout << 111 + A / 111 * 111 << endl;
}
}
| [
"expression.operation.binary.add"
] | 1,031,625 | 1,031,626 | u425231382 | cpp |
p03240 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
#define INF 1000000005
int main() {
int n;... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
#define INF 1000000005
int main() {
int n;... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,031,631 | 1,031,632 | u407233506 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
typedef long long ll;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
int x[105], y[1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
typedef long long ll;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
int x[105], y[1... | [
"control_flow.branch.if.condition.change"
] | 1,031,635 | 1,031,636 | u917282863 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int n, OK; // n点的个数，OK（是否找到）控制循环停止
int x[105], y[105], h[105]; //存数据
int sum, ri, hi; // sum（差的和）用于计算hi（假定高度）
int hh, hh_n;
int main() {
scanf("%d ", &n);
for (int i = 1; i <= n; i++) {
scanf("%d %d %d", &x[i], &y[i], &h[i]);
if (h[i])
hh_n = i;
}
fo... | #include <bits/stdc++.h>
using namespace std;
int n, OK; // n点的个数，OK（是否找到）控制循环停止
int x[105], y[105], h[105]; //存数据
int sum, ri, hi; // sum（差的和）用于计算hi（假定高度）
int hh, hh_n;
int main() {
scanf("%d ", &n);
for (int i = 1; i <= n; i++) {
scanf("%d %d %d", &x[i], &y[i], &h[i]);
if (h[i])
hh_n = i;
}
fo... | [
"assignment.add"
] | 1,031,647 | 1,031,648 | u409052964 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
int n, OK; // n点的个数，OK（是否找到）控制循环停止
int x[105], y[105], h[105]; //存数据
int sum, ri, hi; // sum（差的和）用于计算hi（假定高度）
int hh, hh_n;
int main() {
scanf("%d ", &n);
for (int i = 1; i <= n; i++) {
scanf("%d %d %d", &x[i], &y[i], &h[i]);
if (h[i]) {
hh_n = i;
}
... | #include <bits/stdc++.h>
using namespace std;
int n, OK; // n点的个数，OK（是否找到）控制循环停止
int x[105], y[105], h[105]; //存数据
int sum, ri, hi; // sum（差的和）用于计算hi（假定高度）
int hh, hh_n;
int main() {
scanf("%d ", &n);
for (int i = 1; i <= n; i++) {
scanf("%d %d %d", &x[i], &y[i], &h[i]);
if (h[i])
hh_n = i;
}
fo... | [
"literal.number.change",
"assignment.value.change"
] | 1,031,649 | 1,031,648 | u409052964 | cpp |
p03240 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define RFOR(i, b, e) for (int i = ((e)-1); (b) <= i; --i)
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define RREP(i, N) for (int i = ((N)-1); 0 <= i; --i)
#define scanInt(x) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define RFOR(i, b, e) for (int i = ((e)-1); (b) <= i; --i)
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define RREP(i, N) for (int i = ((N)-1); 0 <= i; --i)
#define scanInt(x) ... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,031,661 | 1,031,662 | u977652465 | cpp |
p03240 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
typedef long long ll;
using namespace std;
int main() {
int n;
ll x[100], y[100], cx, cy, H;
ll h[100], tmp1, tmp2;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
for (ll i = 0; i <= 100; i++) {
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
typedef long long ll;
using namespace std;
int main() {
int n;
ll x[100], y[100], cx, cy, H;
ll h[100], tmp1, tmp2;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
for (ll i = 0; i <= 100; i++) {
... | [] | 1,031,667 | 1,031,668 | u831873811 | cpp |
p03240 | #include <iostream>
#include <math.h>
using namespace std;
int n;
int main() {
cin >> n;
long long x[101], y[101], h[101];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
for (long long i = 0; i <= 100; i++) {
for (long long j = 0; j <= 100; j++) {
long long height = 0;
for ... | #include <iostream>
#include <math.h>
using namespace std;
int n;
int main() {
cin >> n;
long long x[101], y[101], h[101];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> h[i];
}
for (long long i = 0; i <= 100; i++) {
for (long long j = 0; j <= 100; j++) {
long long height = 0;
for ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,031,677 | 1,031,676 | u547457320 | cpp |
p03240 | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int x[110];
int y[110];
int h[110];
int mai... | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int x[110];
int y[110];
int h[110];
int mai... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,031,688 | 1,031,689 | u661336847 | cpp |
p03240 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <unordered_map>
#include <vector>
#define ll long long
using namespace std;
ll x[1010], y[1010], h[1010];
int main() {
int n;
cin >> n;
for (int... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <unordered_map>
#include <vector>
#define ll long long
using namespace std;
ll x[1010], y[1010], h[1010];
int main() {
int n;
cin >> n;
for (int... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 1,031,701 | 1,031,702 | u494567133 | cpp |
p03240 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef lo... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef lo... | [
"literal.number.change",
"call.arguments.change"
] | 1,031,716 | 1,031,717 | u810616694 | cpp |
p03240 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef lo... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef lo... | [
"literal.number.change",
"call.arguments.change"
] | 1,031,716 | 1,031,718 | u810616694 | cpp |
p03240 | #include <iostream>
#include <vector>
using namespace std;
int absmi(int a, int b) {
if (a - b < 0)
return b - a;
else
return a - b;
}
int main() {
int n, i, H = 0, ckh = 2000000000;
int cx, cy;
cin >> n;
vector<int> x(n), y(n), h(n);
for (i = 0; i < n; i++)
cin >> x[i] >> y[i] >> h[i];
f... | #include <iostream>
#include <vector>
using namespace std;
int absmi(int a, int b) {
if (a - b < 0)
return b - a;
else
return a - b;
}
int main() {
int n, i, H = 0, ckh = 2000000000;
int cx, cy;
cin >> n;
vector<int> x(n), y(n), h(n);
for (i = 0; i < n; i++)
cin >> x[i] >> y[i] >> h[i];
f... | [] | 1,031,734 | 1,031,735 | u890922829 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 111;
for (int i = 1; i < 10; i++) {
if (N <= ans * i) {
cout << ans << endl;
break;
} else if (i == 9) {
cout << 1111 << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 111;
for (int i = 1; i < 10; i++) {
if (N <= ans * i) {
cout << ans * i << endl;
break;
} else if (i == 9) {
cout << 1111 << endl;
}
}
} | [
"expression.operation.binary.add"
] | 1,031,798 | 1,031,799 | u453366189 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a = n / 100;
int b = n % 100 / 10;
int c = n % 10;
if (a > b || (a == b && b <= c)) {
cout << a * 111 << endl;
} else
cout << (a + 1) * 111 << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a = n / 100;
int b = n % 100 / 10;
int c = n % 10;
if (a > b || (a == b && b >= c)) {
cout << a * 111 << endl;
} else
cout << (a + 1) * 111 << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,031,800 | 1,031,801 | u666641075 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
//
int num;
cin >> num;
for (int i = 0; i < 100; i++) {
if (num + i % 111 == 0) {
cout << num;
break;
}
}
//
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
//
int num;
cin >> num;
for (int i = 0; i < 1000; i++) {
if ((num + i) % 111 == 0) {
cout << num + i;
break;
}
}
//
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,031,814 | 1,031,815 | u367131219 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
for (int i = 1; i <= 9; i++) {
int tmp = 111 * i;
if (tmp <= n) {
cout << tmp << endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
for (int i = 1; i <= 9; i++) {
int tmp = 111 * i;
if (tmp < n) {
} else {
cout << tmp << endl;
break;
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.add"
] | 1,031,818 | 1,031,819 | u221391729 | cpp |
p03243 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n = 0;
for (int i = n; i < 1000; i++) {
if (i % 111 == 0) {
cout << ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n = 0;
cin >> n;
for (int i = n; i < 1000; i++) {
if (i % 111 == 0) {
... | [] | 1,031,820 | 1,031,821 | u567906952 | cpp |
p03243 | #pragma region template
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC diagnostic ignored "-Wunused-result"
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define ... | #pragma region template
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC diagnostic ignored "-Wunused-result"
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define ... | [
"identifier.change",
"call.function.change"
] | 1,031,826 | 1,031,827 | u368735320 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int chk = n / 111;
if (n % 100)
++chk;
cout << (chk * 111) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int chk = n / 111;
if (n % 111)
++chk;
cout << (chk * 111) << '\n';
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,031,845 | 1,031,846 | u922911026 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int i = 0;
while (i * 100 + i * 10 + i <= N) {
i++;
}
cout << i * 100 + i * 10 + i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int i = 0;
while (i * 100 + i * 10 + i < N) {
i++;
}
cout << i * 100 + i * 10 + i << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,031,847 | 1,031,848 | u187393226 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
while (true) {
string s = to_string(N);
char c = s[0];
bool ok = true;
for (int i = 1; i < 3; i++) {
if (c != s[i])
false;
}
if (ok)
break;
N++;
}
cout << N << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
while (true) {
string s = to_string(N);
char c = s[0];
bool ok = true;
for (int i = 1; i < 3; i++) {
if (c != s[i])
ok = false;
}
if (ok)
break;
N++;
}
cout << N << endl;
return 0;
} | [
"assignment.change"
] | 1,031,849 | 1,031,850 | u568877271 | cpp |
p03243 | #pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pii pair<int, int>
#define pll pair<ll, ll>
#defi... | #pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pii pair<int, int>
#define pll pair<ll, ll>
#defi... | [
"literal.number.change",
"call.arguments.change"
] | 1,031,853 | 1,031,854 | u495699318 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
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;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
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;
... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 1,031,857 | 1,031,858 | u876953939 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <type... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <type... | [
"literal.number.change",
"call.arguments.change"
] | 1,031,865 | 1,031,866 | u531461815 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N + 110) / 111 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N + 110) / 111 * 111 << endl;
} | [
"expression.operation.binary.add"
] | 1,031,872 | 1,031,873 | u306482197 | cpp |
p03243 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
rep(i, 9) {
if (111 * i >= n) {
cout << 111 * i << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
rep(i, 10) {
if (111 * i >= n) {
cout << 111 * i << endl;
return 0;
}
}
} | [
"literal.number.change",
"call.arguments.change"
] | 1,031,874 | 1,031,875 | u436660228 | cpp |
p03243 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main() {
int n;
if (n <= 111)
cout << 111 << endl;
else if (n <= 222)
cout << 222 << endl;
else if (n <= 333)
cout << 33... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
if (n <= 111)
cout << 111 << endl;
else if (n <= 222)
cout << 222 << endl;
else if (n <= 333)
... | [] | 1,031,876 | 1,031,877 | u547099897 | cpp |
p03243 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | [] | 1,031,878 | 1,031,879 | u880221923 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
while (n >= ans) {
ans += 111;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
while (n > ans) {
ans += 111;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,031,882 | 1,031,883 | u524568016 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
while (n <= ans) {
ans += 111;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
while (n > ans) {
ans += 111;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,031,884 | 1,031,883 | u524568016 | cpp |
p03243 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
while (s[0] != s[1] && s[1] != s[2]) {
s = to_string(stoi(s) + 1);
}
cout << s << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
while (s[0] != s[1] || s[1] != s[2]) {
s = to_string(stoi(s) + 1);
}
cout << s << endl;
} | [
"misc.opposites",
"control_flow.loop.condition.change"
] | 1,031,885 | 1,031,886 | u789199225 | cpp |
p03243 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include... | [
"assignment.change",
"expression.operation.binary.change"
] | 1,031,887 | 1,031,888 | u396266329 | cpp |
p03243 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define cool \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define cool \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,031,891 | 1,031,892 | u883167571 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9 + 7
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i > b; --i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9 + 7
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i > b; --i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector... | [] | 1,031,893 | 1,031,894 | u499675841 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n + 110) / 111 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n + 110) / 111 * 111 << endl;
}
| [
"expression.operation.binary.add"
] | 1,031,895 | 1,031,896 | u231354686 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 111; i < 1000; i += 111) {
if (i > n) {
cout << i << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 111; i < 1000; i += 111) {
if (i >= n) {
cout << i << endl;
break;
}
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,031,899 | 1,031,900 | u983681697 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
int ans = 1;
for (int i = 2; i * i <= m; ++i) {
if (m % i == 0 && m / i >= n) {
ans = max(ans, i);
if (i >= n)
ans = max(ans, m / i);
}
}
cout << ans << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
int ans = 1;
for (int i = 1; i * i <= m; ++i) {
if (m % i == 0 && m / i >= n) {
ans = max(ans, i);
if (i >= n)
ans = max(ans, m / i);
}
}
cout << ans << endl;
return ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,031,903 | 1,031,904 | u611414307 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int n, t;
int x, y;
int main() {
scanf("%d%d", &n, &t);
int ans = 1;
for (int i = 2; i <= t / i; i++) {
if ((t % i) != 0)
continue;
if (i >= n) {
ans = t / i;
break;
}
if ((t / i) >= n)
ans = t;
}
printf("%d\n", ans);
re... | #include <bits/stdc++.h>
using namespace std;
int n, t;
int x, y;
int main() {
scanf("%d%d", &n, &t);
int ans = 1;
for (int i = 1; i <= t / i; i++) {
if ((t % i) != 0)
continue;
if (i >= n) {
ans = t / i;
break;
}
if ((t / i) >= n)
ans = i;
}
printf("%d\n", ans);
re... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change"
] | 1,031,909 | 1,031,910 | u320128666 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int n, t;
int x, y;
int main() {
scanf("%d%d", &n, &t);
int ans = 1;
for (int i = 1; i * i <= t; i++) {
if ((t % i) != 0)
continue;
if (i >= n) {
ans = t / i;
break;
}
if ((t / i) >= n)
ans = t;
}
printf("%d\n", ans);
re... | #include <bits/stdc++.h>
using namespace std;
int n, t;
int x, y;
int main() {
scanf("%d%d", &n, &t);
int ans = 1;
for (int i = 1; i <= t / i; i++) {
if ((t % i) != 0)
continue;
if (i >= n) {
ans = t / i;
break;
}
if ((t / i) >= n)
ans = i;
}
printf("%d\n", ans);
re... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change"
] | 1,031,911 | 1,031,910 | u320128666 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
long m;
int i;
cin >> n >> m;
for (i = n; i >= 1; i--) {
if (m % i == 0) {
cout << i;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long n;
long m;
long i;
cin >> n >> m;
for (i = (m / n); i >= 1; i--) {
if (m % i == 0) {
cout << i;
break;
}
}
return 0;
} | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 1,031,916 | 1,031,917 | u414949029 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define rp(i, n) for (int i = 0; i < n; i++)
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define lrp(i, n) for (long long i = 0; i < n; i++)
#define lrep(i, m, n) for (long long i = m; i <= n; i++)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, n) for (int i = 0; i < n; i++)
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define lrp(i, n) for (long long i = 0; i < n; i++)
#define lrep(i, m, n) for (long long i = m; i <= n; i++)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,031,918 | 1,031,919 | u050138914 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (int i = 0; i < (ll)rept; ++i)
typedef long long ll;
using ... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (int i = 0; i < (ll)rept; ++i)
typedef long long ll;
using ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,031,922 | 1,031,921 | u345965293 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (int i = 0; i < (ll)rept; ++i)
typedef long long ll;
using ... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (int i = 0; i < (ll)rept; ++i)
typedef long long ll;
using ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,031,923 | 1,031,921 | u345965293 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (int i = 0; i < (ll)rept; ++i)
typedef long long ll;
using ... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (int i = 0; i < (ll)rept; ++i)
typedef long long ll;
using ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 1,031,924 | 1,031,921 | u345965293 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int ans = 1;
if (m % n == 0) {
printf("%d\n", m / n);
} else {
int ans = 1;
int y = sqrt(m);
for (int i = 1; i <= y; i++) {
if (m % i == 0) {
if (i >= n) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int ans = 1;
if (m % n == 0) {
printf("%d\n", m / n);
} else {
int ans = 1;
int y = sqrt(m);
for (int i = 1; i <= y; i++) {
if (m % i == 0) {
if (i >= n) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,031,925 | 1,031,926 | u208697569 | cpp |
p03241 | #include <algorithm>
#include <cstdio>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define LLIandI pair<long long int, int>
#define ll long long
// ansはMの約数
int mai... | #include <algorithm>
#include <cstdio>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define LLIandI pair<long long int, int>
#define ll long long
// ansはMの約数
int mai... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,031,931 | 1,031,932 | u857644621 | cpp |
p03241 |
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#inc... |
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#inc... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,031,933 | 1,031,934 | u935586669 | cpp |
p03241 | // Even better better solutions q{^.^}p
#define ONLINE_JUDGE // in case i forget to uncomment this, sometimes the grader
// defines the macro ^.^
#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#else
#include "stdc++.h"
#endif
#define MAX(x, y) (((x) > (y)) ? (x) : (y))
#define MIN(x, y) (((x) < (y)... | // Even better better solutions q{^.^}p
#define ONLINE_JUDGE // in case i forget to uncomment this, sometimes the grader
// defines the macro ^.^
#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#else
#include "stdc++.h"
#endif
#define MAX(x, y) (((x) > (y)) ? (x) : (y))
#define MIN(x, y) (((x) < (y)... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,031,954 | 1,031,955 | u291271108 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define pb push_back
#define fst first
#define scd second
#define EPS (1e-7)
#define INF (1e9... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
#define pb push_back
#define fst first
#define scd second
#define EPS (1e-7)
#define INF (1e9... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,031,956 | 1,031,957 | u381714561 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, m;
cin >> n >> m;
int Max = 1;
for (int i = 2; i * i <= m; i++) {
if (m % i == 0) {
if (i * n <= m) {
Max = max(Max, i);
}
long long a = m / i;
if (a * n <= m) {
Max = max((long... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, m;
cin >> n >> m;
int Max = 1;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (i * n <= m) {
Max = max(Max, i);
}
long long a = m / i;
if (a * n <= m) {
Max = max((long... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,031,963 | 1,031,964 | u781091740 | cpp |
p03241 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using names... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using names... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 1,031,965 | 1,031,966 | u194463155 | cpp |
p03241 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using names... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using names... | [
"control_flow.loop.for.initializer.change",
"call.remove",
"call.arguments.change"
] | 1,031,967 | 1,031,966 | u194463155 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 10000;
for (; ans >= 1; --ans) {
if (M > (N - 1) * ans) {
if ((M - (N - 1) * ans) % ans == 0) {
break;
}
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
long long ans = M / N;
for (; ans >= 1; --ans) {
if (M > (N - 1) * ans) {
if ((M - (N - 1) * ans) % ans == 0) {
break;
}
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,031,970 | 1,031,971 | u036411476 | cpp |
p03241 | // By Bibi
/// .-~~~~~~~~~-._ _.-~~~~~~~~~-.
/// __.' ~. .~ `.__
/// .'// \./ \`.
/// .'// | \`.
/// .'// .-~"""""""~~~~-._ | _,-~~~~"""""""~-. \`.
/// ... | // By Bibi
/// .-~~~~~~~~~-._ _.-~~~~~~~~~-.
/// __.' ~. .~ `.__
/// .'// \./ \`.
/// .'// | \`.
/// .'// .-~"""""""~~~~-._ | _,-~~~~"""""""~-. \`.
/// ... | [
"literal.number.change",
"call.arguments.change"
] | 1,031,974 | 1,031,975 | u741300499 | cpp |
p03241 | // VIVEK UPADHYAY
// MANIT, BHOPAL(M.P)
/**********************************************************************************************/
/**********************************************************************************************/
// $$ JAB-TAK ... | // VIVEK UPADHYAY
// MANIT, BHOPAL(M.P)
/**********************************************************************************************/
/**********************************************************************************************/
// $$ JAB-TAK ... | [
"assignment.change"
] | 1,031,982 | 1,031,983 | u753615145 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
main() {
int N, M, g = 1;
cin >> N >> M;
for (int i = 1; i * i <= M; ++i) {
if (M % i == 0) {
if (N <= M / i)
g = max(i, g);
if (N <= i)
g = max(i, g);
}
}
cout << g << endl;
}
| #include <bits/stdc++.h>
using namespace std;
main() {
int N, M, g = 1;
cin >> N >> M;
for (int i = 1; i * i <= M; ++i) {
if (M % i == 0) {
if (N <= M / i)
g = max(i, g);
if (N <= i)
g = max(M / i, g);
}
}
cout << g << endl;
}
| [
"assignment.change"
] | 1,031,988 | 1,031,989 | u756659922 | cpp |
p03241 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | [
"expression.operation.binary.add"
] | 1,031,990 | 1,031,991 | u472675932 | cpp |
p03241 | #include <iostream>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
if (n * n <= m) {
while (n <= m) {
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
n++;
}
} else {
int i = m / n;
while (i >= 1) {
if (m % i == 0) {
cout << i... | #include <iostream>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
if (n * n <= m) {
while (n <= m) {
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
n++;
}
} else {
int i = m / n;
while (i >= 1) {
if (m % i == 0) {
cout << i... | [
"io.output.newline.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,032,002 | 1,032,003 | u178152729 | cpp |
p03241 | #include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// #include <priority_queue>
#include <algorithm>
#include <climits>
#include <cmath>
using namespace std;
int n, m;
int ans = 1;
int main() {
cin >> n >> m;
for (int i = 2; i... | #include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// #include <priority_queue>
#include <algorithm>
#include <climits>
#include <cmath>
using namespace std;
int n, m;
int ans = 1;
int main() {
cin >> n >> m;
for (int i = 1; i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,032,004 | 1,032,005 | u499373855 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define LL long long
// int x[110],y[110],h[110];
int n, m;
int main() {
scanf("%d%d", &n, &m);
int ans = 1;
for (int i = 2; i <= sqrt(m + 0.5); ++i) {
if (m % i == 0 && m / i >= n)
ans = max(i, ans);
if... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define LL long long
// int x[110],y[110],h[110];
int n, m;
int main() {
scanf("%d%d", &n, &m);
int ans = 1;
for (int i = 1; i <= sqrt(m + 1); ++i) {
if (m % i == 0 && m / i >= n)
ans = max(i, ans);
if (... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,032,006 | 1,032,007 | u756245913 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | [] | 1,032,008 | 1,032,009 | u310790595 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1010, maxs = 25000, maxp = 3000;
int n, m, ans;
int prim[maxp], pcnt;
bool isp[maxs];
inline int mymax(int a, int b) { return a > b ? a : b; }
void fil() {
memset(isp, 1, sizeof(isp));
isp[0] = isp[1] = false;
for (register int i = 2; i < maxs; i++)
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1010, maxs = 25000, maxp = 3000;
int n, m, ans;
int prim[maxp], pcnt;
bool isp[maxs];
inline int mymax(int a, int b) { return a > b ? a : b; }
void fil() {
memset(isp, 1, sizeof(isp));
isp[0] = isp[1] = false;
for (register int i = 2; i < maxs; i++)
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,032,010 | 1,032,011 | u915513603 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
using namespace std;
int main() {
long int N, M;
cin >> N >> M;
long int max = M / N + 1;
for (long int i = max; i > 0; i--) {
if (M % i == 0) {
cout << i;
break;
}
}
return 0;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
using namespace std;
int main() {
long int N, M;
cin >> N >> M;
long int max = M / N;
for (long int i = max; i > 0; i--) {
if (M % i == 0) {
cout << i;
break;
}
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 1,032,012 | 1,032,013 | u511344501 | cpp |
p03241 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
int mx = M / N;
int rem = M % N;
while (rem) {
mx--;
rem = M - N * mx;
rem %= mx;
}
cout << mx << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
int mx = M / N;
int rem = M % N;
rem %= mx;
while (rem) {
mx--;
rem = M - N * mx;
rem %= mx;
}
cout << mx << "\n";
return 0;
}... | [
"assignment.add"
] | 1,032,016 | 1,032,017 | u378750914 | cpp |
p03241 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pII;
#define pb push_back
#define X first
#define Y... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pII;
#define pb push_back
#define X first
#define Y... | [
"expression.operation.unary.arithmetic.remove",
"call.arguments.change"
] | 1,032,018 | 1,032,019 | u759188928 | cpp |
p03241 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#includ... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,032,020 | 1,032,021 | u630941334 | cpp |
p03241 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [
"identifier.change",
"call.arguments.change"
] | 1,032,024 | 1,032,025 | u010004797 | cpp |
p03241 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [
"expression.operation.binary.add"
] | 1,032,026 | 1,032,025 | u010004797 | cpp |
p03241 | #include <cstdio>
#include <set>
#include <vector>
using namespace std;
int main() {
set<int> s;
int N, M;
scanf("%d %d", &N, &M);
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
s.insert(i);
s.insert(M % i);
}
}
vector<int> vec;
for (auto i : s)
vec.push_back(i);
for ... | #include <cstdio>
#include <set>
#include <vector>
using namespace std;
int main() {
set<int> s;
int N, M;
scanf("%d %d", &N, &M);
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
s.insert(i);
s.insert(M / i);
}
}
vector<int> vec;
for (auto i : s)
vec.push_back(i);
for ... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,032,027 | 1,032,028 | u212253038 | cpp |
p03241 | #include <cstdio>
#include <set>
#include <vector>
using namespace std;
int main() {
set<int> s;
int N, M;
scanf("%d %d", &N, &M);
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
s.insert(i);
s.insert(M % i);
}
}
vector<int> vec;
for (auto i : s)
vec.push_back(i);
for ... | #include <cstdio>
#include <set>
#include <vector>
using namespace std;
int main() {
set<int> s;
int N, M;
scanf("%d %d", &N, &M);
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
s.insert(i);
s.insert(M / i);
}
}
vector<int> vec;
for (auto i : s)
vec.push_back(i);
for ... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 1,032,029 | 1,032,028 | u212253038 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.