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 |
|---|---|---|---|---|---|---|---|
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = n; i < 999; i++) {
/* code */
if (i % 111 == 0) {
/* code */
ans = i;
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = n; i <= 999; i++) {
/* code */
if (i % 111 == 0) {
/* code */
ans = i;
break;
}
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,032,596 | 1,032,597 | u376859266 | cpp |
p03243 | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
printf("%d", (n / 111 + 1) * 111);
return 0;
} | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
printf("%d", ((n - 1) / 111 + 1) * 111);
return 0;
}
| [
"call.arguments.change"
] | 1,032,602 | 1,032,603 | u057942294 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) ... | [
"control_flow.break.add"
] | 1,032,609 | 1,032,610 | u139031151 | cpp |
p03243 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,611 | 1,032,612 | u112581208 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int num = 111;
while (num > n) {
num += 111;
}
cout << num << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int num = 111;
while (num < n) {
num += 111;
}
cout << num << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,032,628 | 1,032,629 | u157322125 | cpp |
p03243 | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
cout << ((n - 1) / n + 1) * 111;
/* code */
return 0;
}
| #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
cout << ((n - 1) / 111 + 1) * 111;
/* code */
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,032,630 | 1,032,631 | u318709124 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int a[10] = {111, 222, 333, 444, 555, 666, 777, 888, 999};
int n;
cin >> n;
for (int i = 0; i < 10; i++) {
if (n < a[i]) {
cout << a[i] << endl;
break;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a[10] = {111, 222, 333, 444, 555, 666, 777, 888, 999};
int n;
cin >> n;
for (int i = 0; i < 10; i++) {
if (n <= a[i]) {
cout << a[i] << endl;
break;
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,632 | 1,032,633 | u830055383 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double x = N / 111.0;
int ans = ceil(x);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double N;
cin >> N;
double x = N / 111.0;
int ans = ceil(x) * 111;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 1,032,634 | 1,032,635 | u866992281 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long tint;
const int INF = 1e6;
const long double PI = acos(-1);
int main() {
int n;
cin >>... | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long tint;
const int INF = 1e6;
const long double PI = acos(-1);
int main() {
int n;
cin >>... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,646 | 1,032,647 | u061383139 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << ceil(N / 111) * 111 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double N;
cin >> N;
cout << ceil(N / 111) * 111 << endl;
} | [
"variable_declaration.type.primitive.change"
] | 1,032,648 | 1,032,649 | u552201227 | cpp |
p03243 | #include <iostream>
int main() {
int n;
std::cin >> n;
int result = 111;
while (n <= result) {
result += 111;
}
std::cout << result << '\n';
return 0;
}
| #include <iostream>
int main() {
int n;
std::cin >> n;
int result = 111;
while (result < n) {
result += 111;
}
std::cout << result << '\n';
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.loop.condition.change"
] | 1,032,666 | 1,032,667 | u901295506 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int i, j, k, n, m, l, f, x, y, z;
string s;
cin >> n;
f = 0;
x = y = 0;
REP(i, 1, 8) {
x = 100 * i + 10 * i + i;
y = x + 111;
if ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int i, j, k, n, m, l, f, x, y, z;
string s;
cin >> n;
f = 0;
x = y = 0;
REP(i, 1, 9) {
x = 100 * i + 10 * i + i;
y = x + 111;
if ... | [
"literal.number.change",
"call.arguments.change"
] | 1,032,670 | 1,032,671 | u854612287 | cpp |
p03243 | using namespace std;
#include <iostream>
int main() {
int a;
cin >> a;
cout << int(a / 111 + 0.99999999) * 111 << endl;
return 0;
}
| using namespace std;
#include <iostream>
int main() {
int a;
cin >> a;
cout << int(a / 111.0 + 0.99999999) * 111 << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 1,032,674 | 1,032,675 | u981068718 | cpp |
p03243 | using namespace std;
#include <iostream>
int main() {
int a;
cin >> a;
cout << int(a / 111 + 0.99999999) << endl;
return 0;
}
| using namespace std;
#include <iostream>
int main() {
int a;
cin >> a;
cout << int(a / 111.0 + 0.99999999) * 111 << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 1,032,676 | 1,032,675 | u981068718 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x = n % 10 % 10;
if (n > x * 100 + x * 10 + x)
cout << (x + 1) * 100 + (x + 1) * 10 + x + 1 << endl;
else
cout << x * 100 + x * 10 + x << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x = n / 10 / 10;
if (n > x * 100 + x * 10 + x)
cout << (x + 1) * 100 + (x + 1) * 10 + x + 1 << endl;
else
cout << x * 100 + x * 10 + x << endl;
}
| [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,032,679 | 1,032,680 | u410878763 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, r;
cin >> n;
for (int i = 1; i <= 10; i++) {
if (n <= 111 * i)
r = 111 * i;
if (i == 10)
r = 1111;
}
cout << r << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, r;
cin >> n;
for (int i = 1; i <= 10; i++) {
if (n <= 111 * i) {
r = 111 * i;
break;
}
if (i == 10)
r = 1111;
}
cout << r << endl;
} | [
"control_flow.break.add"
] | 1,032,701 | 1,032,702 | u222965004 | cpp |
p03243 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
reps(i, 1, 9) {
if (n <= 111 * ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
reps(i, 1, 10) {
if (n <= 111 ... | [
"literal.number.change",
"call.arguments.change"
] | 1,032,708 | 1,032,709 | u704411633 | cpp |
p03243 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define For(i, n) for (int i = 0; i < (n); i++)
#define Range(container) container.begin(), container.end()
#define Cin(T, x) \
T x; ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define For(i, n) for (int i = 0; i < (n); i++)
#define Range(container) container.begin(), container.end()
#define Cin(T, x) \
T x; ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,032,712 | 1,032,713 | u375405838 | cpp |
p03243 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define For(i, n) for (int i = 0; i < (n); i++)
#define Range(container) container.begin(), container.end()
#define Cin(T, x) \
T x; ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define For(i, n) for (int i = 0; i < (n); i++)
#define Range(container) container.begin(), container.end()
#define Cin(T, x) \
T x; ... | [
"call.arguments.change",
"literal.number.change",
"expression.operation.binary.change"
] | 1,032,714 | 1,032,713 | u375405838 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
k = n / 100;
if (100 * k + 1 * k + k < n)
cout << 100 * (k + 1) + 10 * (k + 1) + k + 1;
else
cout << 100 * k + 10 * k + k;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
k = n / 100;
if (100 * k + 10 * k + k < n)
cout << 100 * (k + 1) + 10 * (k + 1) + k + 1;
else
cout << 100 * k + 10 * k + k;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,032,715 | 1,032,716 | u676029460 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
k = n / 100;
if (100 * k + 1 * k + k < n)
cout << 100 * (k + 1) + 1 * (k + 1) + k + 1;
else
cout << 100 * k + 10 * k + k;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
k = n / 100;
if (100 * k + 10 * k + k < n)
cout << 100 * (k + 1) + 10 * (k + 1) + k + 1;
else
cout << 100 * k + 10 * k + k;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,032,717 | 1,032,716 | u676029460 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= 9; i++) {
if (n <= i * 111) {
cout << i * 111 << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= 9; i++) {
if (n <= i * 111) {
cout << i * 111 << endl;
break;
}
}
}
| [
"control_flow.break.add"
] | 1,032,718 | 1,032,719 | u233626335 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int n, x, ans;
cin >> n;
x = n / 111;
if (n % 100 == 0)
cout << x * 111 << endl;
else
cout << (x + 1) * 111 << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, x, ans;
cin >> n;
x = n / 111;
if (n % 111 == 0)
cout << x * 111 << endl;
else
cout << (x + 1) * 111 << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,032,734 | 1,032,735 | u127856129 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int n;
int ppans;
int pans;
cin >> n;
ppans = n / 111;
pans = pans + 1;
if (n % 111 == 0)
pans = pans - 1;
cout << pans * 111 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
int ppans;
int pans;
cin >> n;
ppans = n / 111;
pans = ppans + 1;
if (n % 111 == 0)
pans = pans - 1;
cout << pans * 111 << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,032,738 | 1,032,739 | u794707792 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 1; i < 10; i++) {
if (N < 111 * i) {
cout << (i * 111) << "\n";
break;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 1; i < 10; i++) {
if (N <= 111 * i) {
cout << (i * 111) << "\n";
break;
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,740 | 1,032,741 | u891876603 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < 9; i++) {
if (n < i * 111 and n <= (i + 1) * 111)
cout << (i + 1) * 111 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < 9; i++) {
if (n > i * 111 and n <= (i + 1) * 111)
cout << (i + 1) * 111 << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,746 | 1,032,747 | u807998890 | cpp |
p03243 | #include <iostream>
int main() {
int n;
std::cin >> n;
std::cout << ((n - 110) / 111) * 111 << std::endl;
} | #include <iostream>
int main() {
int n;
std::cin >> n;
std::cout << ((n + 110) / 111) * 111 << std::endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,032,748 | 1,032,749 | u502709453 | cpp |
p03243 | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
for (int i = 1; i < 9; i++) {
if (n <= 100 * i + 10 * i + i) {
cout << 100 * i + 10 * i + i << endl;
return 0;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
for (int i = 1; i <= 9; i++) {
if (n <= 100 * i + 10 * i + i) {
cout << 100 * i + 10 * i + i << endl;
return 0;
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,032,750 | 1,032,751 | u218356514 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) / 111 * 111 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << ((n - 1) / 111 + 1) * 111 << endl;
} | [] | 1,032,756 | 1,032,757 | u579152247 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = n; i <= 999; i++) {
if (n % 111 == 0) {
cout << i << endl;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = n; i <= 999; i++) {
if (i % 111 == 0) {
cout << i << endl;
return 0;
}
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,032,771 | 1,032,772 | u817760251 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = n; i <= 999; i++) {
if (n % 111 == 0) {
cout << n << endl;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = n; i <= 999; i++) {
if (i % 111 == 0) {
cout << i << endl;
return 0;
}
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,032,773 | 1,032,772 | u817760251 | cpp |
p03243 | #include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#inclu... | #include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#inclu... | [] | 1,032,774 | 1,032,775 | u817760251 | cpp |
p03243 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cout << ((N + 110) / 111) * 111 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
cout << ((N + 110) / 111) * 111 << endl;
return 0;
} | [] | 1,032,776 | 1,032,777 | u504103417 | cpp |
p03243 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cout << ((N + 100) / 111) * 111 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
cout << ((N + 110) / 111) * 111 << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 1,032,778 | 1,032,777 | u504103417 | cpp |
p03243 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, i;
cin >> n;
for (i = 1; i < 9; i++) {
if (111 * i >= n) {
cout << 111 * i;
break;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, i;
cin >> n;
for (i = 1; i < 10; i++) {
if (111 * i >= n) {
cout << 111 * i;
break;
}
}
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,032,787 | 1,032,788 | u274055316 | cpp |
p03243 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
typedef unsigned long long ui64;
typedef long long i64;
void AtCoderBeginn... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
typedef unsigned long long ui64;
typedef long long i64;
void AtCoderBeginn... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,032,793 | 1,032,794 | u224756887 | cpp |
p03243 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 1; i < 9; i++) {
int c = i * (111);
if (c >= N) {
cout << c << endl;
break;
}
}
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 1; i <= 9; i++) {
int c = i * (111);
if (c >= N) {
cout << c << endl;
break;
}
}
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,032,797 | 1,032,798 | u090436701 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = N / 111;
if (ans % 111 == 0) {
cout << ans * 111 << endl;
} else {
cout << (ans + 1) * 111 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = N / 111;
if (N % 111 == 0) {
cout << ans * 111 << endl;
} else {
cout << (ans + 1) * 111 << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,032,799 | 1,032,800 | u618697411 | cpp |
p03243 | #include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define v_exists(elem, v) find(v.begin(), v.end(), elem) != v.end()
using namespace std;
int main() {
int n;
cin >> n;
if (n < 100) {
cout << 111 << endl;
... | #include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define v_exists(elem, v) find(v.begin(), v.end(), elem) != v.end()
using namespace std;
int main() {
int n;
cin >> n;
if (n < 100) {
cout << 111 << endl;
... | [
"literal.number.change",
"io.output.change"
] | 1,032,803 | 1,032,804 | u604896914 | cpp |
p03243 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
long long int a, b, c;
char s;
string str1, str2;
int main() {
cin >> a;
for (int k = 1; k < 10; k++) {
if (k * 111 > a) {
cout << k * 111;
return 0;
}
}
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
long long int a, b, c;
char s;
string str1, str2;
int main() {
cin >> a;
for (int k = 1; k < 10; k++) {
if (k * 111 >= a) {
cout << k * 111;
return 0;
}
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,805 | 1,032,806 | u950603962 | cpp |
p03243 | #include <cstdio>
int n;
int main() {
scanf("%d", &n);
for (int i = n; i <= 999; i++)
if ((n / 100) == (n / 10 % 10) && (n / 10 % 10) == n % 10) {
printf("%d\n", i);
break;
}
return 0;
} | #include <cstdio>
int n;
int main() {
scanf("%d", &n);
for (int i = n; i <= 999; i++)
if ((i / 100) == (i / 10 % 10) && (i / 10 % 10) == i % 10) {
printf("%d\n", i);
break;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,032,809 | 1,032,810 | u722555249 | cpp |
p03243 | // Written by Zhu Zeqi
// Come on,baby
// Hack,please
#include <bits/stdc++.h>
#define MAX 1000000000000000000
#define MOD 1000000007
#define PI 3.141592653589793238462
#define INF 0x3F3F3F3F
typedef long long ll;
// orz yht
using namespace std;
string i_s(int x) {
if (x == 0)
return "0";
string ret = "";
whi... | // Written by Zhu Zeqi
// Come on,baby
// Hack,please
#include <bits/stdc++.h>
#define MAX 1000000000000000000
#define MOD 1000000007
#define PI 3.141592653589793238462
#define INF 0x3F3F3F3F
typedef long long ll;
// orz yht
using namespace std;
string i_s(int x) {
if (x == 0)
return "0";
string ret = "";
whi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,811 | 1,032,812 | u466062134 | cpp |
p03243 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <memory>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MAX_SIZE 100000000
typedef unsigned long long ull;
using namespace std;
int main() {
int ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <memory>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MAX_SIZE 100000000
typedef unsigned long long ull;
using namespace std;
int main() {
int ... | [
"control_flow.break.add"
] | 1,032,813 | 1,032,814 | u377777817 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n--;
cout << n / 111 * 111;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n--;
cout << (n / 111 + 1) * 111;
} | [] | 1,032,833 | 1,032,834 | u987476436 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x), end()
typedef long long ll;
int N;
int main() {
cin >> N;
for (int i = 1; i < 10; i++) {
if (i * 100 + i * 10 + i > N) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x), end()
typedef long long ll;
int N;
int main() {
cin >> N;
for (int i = 1; i < 10; i++) {
if (i * 100 + i * 10 + i >= N) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,841 | 1,032,842 | u819123139 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
#define fastio() ios::sync_with_stdio(0), cin.tie(0);
int main() {
int n;
cin >> n;
for (int i = 111; i < 1000; i += 111)
if (n >= i) {
cout << i;
break;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fastio() ios::sync_with_stdio(0), cin.tie(0);
int main() {
int n;
cin >> n;
for (int i = 111; i < 1000; i += 111)
if (n <= i) {
cout << i;
break;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,845 | 1,032,846 | u051758804 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N % 111 == 0)
cout << N << endl;
else
cout << N / 111 * 111 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N % 111 == 0)
cout << N << endl;
else
cout << N / 111 * 111 + 111 << endl;
}
| [
"expression.operation.binary.add"
] | 1,032,849 | 1,032,850 | u069941351 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
// ==================================================
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i, a, b) for (i64 i = (int64_t)(a); i < (int64_t)(b); i++)
#define repn(i, n) rep(i, 0, n)
#define din(t, ...) ... | #include <bits/stdc++.h>
using namespace std;
// ==================================================
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i, a, b) for (i64 i = (int64_t)(a); i < (int64_t)(b); i++)
#define repn(i, n) rep(i, 0, n)
#define din(t, ...) ... | [] | 1,032,851 | 1,032,852 | u651068030 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = (n - 1) / 111 * 111 + 1;
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = ((n - 1) / 111 + 1) * 111;
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 1,032,853 | 1,032,854 | u639297580 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 1; i < 9; ++i) {
int x = 111 * i;
if (x >= N) {
cout << x << endl;
return 0;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 1; i <= 9; ++i) {
int x = 111 * i;
if (x >= N) {
cout << x << endl;
return 0;
}
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,032,855 | 1,032,856 | u430966577 | cpp |
p03243 | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int ans, dp, dc;
for (int div = 100; div > 1; div /= 10) {
dp = N / div;
dc = (N % div) / (div / 10);
if (dp > dc) {
ans = dp;
break;
} else if (dp < dc) {
ans = dc;
break;
} else {
a... | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int ans, dp, dc;
for (int div = 100; div > 1; div /= 10) {
dp = N / div;
dc = (N % div) / (div / 10);
if (dp > dc) {
ans = dp;
break;
} else if (dp < dc) {
ans = dp + 1;
break;
} else {
... | [
"assignment.value.change",
"assignment.change"
] | 1,032,859 | 1,032,860 | u177739577 | cpp |
p03243 | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
for (int i = n; i < 999; i++) {
int tmp = i;
int keta1 = tmp % 10;
tmp /= 10;
int keta2 = tmp % 10;
tmp /= 10;
int keta3 = tmp % 10;
if (keta1 == keta2 && keta2 == keta3) {
cout... | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
for (int i = n; i <= 999; i++) {
int tmp = i;
int keta1 = tmp % 10;
tmp /= 10;
int keta2 = tmp % 10;
tmp /= 10;
int keta3 = tmp % 10;
if (keta1 == keta2 && keta2 == keta3) {
cou... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,032,864 | 1,032,865 | u032895200 | cpp |
p03243 | #include <cstdio>
using namespace std;
int main() {
int n, ans;
scanf("%d", &n);
ans = n / 100 * 111;
if (ans <= n)
printf("%d\n", ans);
else
printf("%d\n", ans + 111);
} | #include <cstdio>
using namespace std;
int main() {
int n, ans;
scanf("%d", &n);
ans = n / 100 * 111;
if (ans >= n)
printf("%d\n", ans);
else
printf("%d\n", ans + 111);
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,868 | 1,032,869 | u855429581 | cpp |
p03243 | #include <cstdio>
using namespace std;
int main() {
int n, ans;
scanf("%d", n);
ans = n / 100 * 111;
if (ans <= n)
printf("%d\n", ans);
else
printf("%d\n", ans + 111);
} | #include <cstdio>
using namespace std;
int main() {
int n, ans;
scanf("%d", &n);
ans = n / 100 * 111;
if (ans >= n)
printf("%d\n", ans);
else
printf("%d\n", ans + 111);
}
| [
"expression.operation.unary.reference.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,870 | 1,032,869 | u855429581 | cpp |
p03243 | #include <iostream>
#include <string>
using namespace std;
int main() {
/* string s;
cin >> s;
if(s[1] > s[2]){
cout<<"large"<<endl;
s.replace(2, 1, s.substr(1,1));
}else if(s[1] < s[2]){
}
cout << s << endl;
*/
int i;
int tmp;
int num = 0;
cin >> i... | #include <iostream>
#include <string>
using namespace std;
int main() {
/* string s;
cin >> s;
if(s[1] > s[2]){
cout<<"large"<<endl;
s.replace(2, 1, s.substr(1,1));
}else if(s[1] < s[2]){
}
cout << s << endl;
*/
int i;
int tmp;
int num = 0;
cin >> i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,879 | 1,032,880 | u951141003 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
scanf("%d\n", &n);
int a = n / 100;
if (a == 0)
a++;
if (n < 100 * a + 10 * a + a)
printf("%d\n", 100 * a + 10 * a + a);
else
printf("%d\n", 100 * a + 10 * a + a + 111);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
scanf("%d\n", &n);
int a = n / 100;
if (a == 0)
a++;
if (n <= 100 * a + 10 * a + a)
printf("%d\n", 100 * a + 10 * a + a);
else
printf("%d\n", 100 * a + 10 * a + a + 111);
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,884 | 1,032,885 | u579754454 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,895 | 1,032,896 | u333917945 | cpp |
p03243 | #include <stdio.h>
int main(void) {
int n, a, b, c;
scanf("%d", &n);
a = n / 100;
b = (n / 10) % 10;
c = n % 10;
if ((b < a) || ((b = a) && (c <= a)))
printf("%d%d%d\n", a, a, a);
else
printf("%d%d%d\n", a + 1, a + 1, a + 1);
return 0;
}
| #include <stdio.h>
int main(void) {
int n, a, b, c;
scanf("%d", &n);
a = n / 100;
b = (n / 10) % 10;
c = n % 10;
if ((b < a) || ((b == a) && (c <= a)))
printf("%d%d%d\n", a, a, a);
else
printf("%d%d%d\n", a + 1, a + 1, a + 1);
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,032,899 | 1,032,900 | u328163917 | cpp |
p03243 | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 0
//{
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push_back
#define all(v) (v).begin(),... | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 0
//{
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push_back
#define all(v) (v).begin(),... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,032,913 | 1,032,914 | u130196064 | cpp |
p03243 | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 0
//{
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push_back
#define all(v) (v).begin(),... | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 0
//{
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push_back
#define all(v) (v).begin(),... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,032,915 | 1,032,914 | u130196064 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
for (int i = 0; i < 10; ++i)
if (i * 111 > n) {
cout << i * 111 << endl;
return 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
for (int i = 0; i < 10; ++i)
if (i * 111 >= n) {
cout << i * 111 << endl;
return 0;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,920 | 1,032,921 | u269963329 | cpp |
p03243 | #include <algorithm>
#include <climits>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int, int>
#define debug(x)... | #include <algorithm>
#include <climits>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int, int>
#define debug(x)... | [
"expression.operation.binary.add"
] | 1,032,926 | 1,032,927 | u492373312 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N <= 111)
cout << 111 << endl;
else if (N <= 222)
cout << 222 << endl;
else if (N <= 333)
cout << 333 << endl;
else if (N <= 444)
cout << 444 << endl;
else if (N <= 555)
cout << 555 << endl;
else if (N <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N <= 111)
cout << 111 << endl;
else if (N <= 222)
cout << 222 << endl;
else if (N <= 333)
cout << 333 << endl;
else if (N <= 444)
cout << 444 << endl;
else if (N <= 555)
cout << 555 << endl;
else if (N <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,939 | 1,032,940 | u711340028 | cpp |
p03243 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define loop(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x, y) make_pair... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define loop(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x, y) make_pair... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,941 | 1,032,942 | u315288101 | cpp |
p03243 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
void ans(int n) {
for (int i = 0; i < 3; i++) {
cout << n;
}
cout << endl;
}
int main() {
int n;
cin >> n;
int a[3];
a[0] = n / 100;
a[1] = (n - a[0] * 100) / 10;
a[2] = (n - a[... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
void ans(int n) {
for (int i = 0; i < 3; i++) {
cout << n;
}
cout << endl;
}
int main() {
int n;
cin >> n;
int a[3];
a[0] = n / 100;
a[1] = (n - a[0] * 100) / 10;
a[2] = (n - a[... | [
"control_flow.branch.if.condition.change"
] | 1,032,943 | 1,032,944 | u495386448 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 105
int a[MAX_N];
int n;
int main() {
// freopen("in.txt", "r", stdin);
for (int i = 1; i <= 9; ++i)
a[i] = i * 111;
a[10] = 1111;
while (cin >> n) {
for (int i = 1; i <= 10; ++i) {
if (a[i] > n) {
cout << a[i] << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 105
int a[MAX_N];
int n;
int main() {
// freopen("in.txt", "r", stdin);
for (int i = 1; i <= 9; ++i)
a[i] = i * 111;
a[10] = 1111;
while (cin >> n) {
for (int i = 1; i <= 10; ++i) {
if (a[i] >= n) {
cout << a[i] << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,945 | 1,032,946 | u466497827 | cpp |
p03243 | #include <iostream>
int main() {
unsigned int n;
std::cin >> n;
std::cout << (n - (n % 111 + 1) + 112);
} | #include <iostream>
int main() {
unsigned int n;
std::cin >> n;
n -= 1;
std::cout << (n - (n % 111 + 1) + 112);
} | [
"assignment.add"
] | 1,032,952 | 1,032,953 | u614460543 | cpp |
p03243 | // https://abc111.contest.atcoder.jp/tasks/abc111_b
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
for (int i = n; i < 999; i++) {
int ichi = i % 10;
int juu = (i /... | // https://abc111.contest.atcoder.jp/tasks/abc111_b
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
for (int i = n; i <= 999; i++) {
int ichi = i % 10;
int juu = (i ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"io.output.newline.add"
] | 1,032,961 | 1,032,962 | u924770834 | cpp |
p03243 | #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>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
... | #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>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
... | [] | 1,032,965 | 1,032,966 | u713333397 | cpp |
p03243 | #if defined(LOCAL)
const double _max_double_error = 1e-9;
#include "testutils.h"
#define L(x...) (debug(x, #x))
#define I(x, ...) (x)
#define C(x...) CHECK(x)
#else
#define L(x, ...) (x)
#define I(x, ...) (x)
#define C(x, ...) ;
#endif
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#inclu... | #if defined(LOCAL)
const double _max_double_error = 1e-9;
#include "testutils.h"
#define L(x...) (debug(x, #x))
#define I(x, ...) (x)
#define C(x...) CHECK(x)
#else
#define L(x, ...) (x)
#define I(x, ...) (x)
#define C(x, ...) ;
#endif
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#inclu... | [
"literal.number.change",
"call.arguments.change"
] | 1,032,967 | 1,032,968 | u934544251 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a, b, c;
a = N / 100;
b = (N - 100 * a) / 10;
c = N - 100 * a - 10 * b;
if (b < a) {
cout << 100 * a + 10 * a + a << endl;
} else if (b > a) {
cout << 100 * (a + 1) + 10 * (a + 1) + a + 1 << endl;
} else if (c < a) {... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a, b, c;
a = N / 100;
b = (N - 100 * a) / 10;
c = N - 100 * a - 10 * b;
if (b < a) {
cout << 100 * a + 10 * a + a << endl;
} else if (b > a) {
cout << 100 * (a + 1) + 10 * (a + 1) + a + 1 << endl;
} else if (c <= a) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,969 | 1,032,970 | u774652316 | cpp |
p03243 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
//#include <iostream>//POJ
//#include <vector>
//#include <string>
//#include <iomanip>
//#include <math.h>
//#include <algorithm>
//#include <cstring>
using namespace std;
#define setc ... |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
//#include <iostream>//POJ
//#include <vector>
//#include <string>
//#include <iomanip>
//#include <math.h>
//#include <algorithm>
//#include <cstring>
using namespace std;
#define setc ... | [
"literal.number.change",
"call.arguments.change"
] | 1,032,973 | 1,032,974 | u675296835 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int A;
cin >> A;
if (A % 111 == 0) {
A = (A / 111 + 1) * 111;
} else {
A = (A / 111 + 1) * 111;
}
cout << A << endl;
} | #include <iostream>
using namespace std;
int main() {
int A;
cin >> A;
if (A % 111 == 0) {
A = (A / 111) * 111;
} else {
A = (A / 111 + 1) * 111;
}
cout << A << endl;
}
| [
"expression.operation.binary.remove"
] | 1,032,975 | 1,032,976 | u800221251 | cpp |
p03243 | #include <stdio.h>
int main(void) {
int n, i, c;
scanf("%d", &n);
for (i = 1; i < 10; i++) {
c = 111 * i;
if (c >= n) {
printf("%d", &c);
break;
}
}
return 0;
} | #include <stdio.h>
int main(void) {
int n, i, c;
scanf("%d", &n);
for (i = 1; i < 10; i++) {
c = 111 * i;
if (c >= n) {
printf("%d", c);
break;
}
}
return 0;
}
| [
"call.arguments.change"
] | 1,032,977 | 1,032,978 | u930830772 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int meguru_binary_search(int val, int *array, int ok, int ng) {
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (array[mid] >= val) {
ok = mid;
} else {
ng = mid;
}
}
return ok;
}
int main() {
int contest[] = {111, 222, 333,... | #include <bits/stdc++.h>
using namespace std;
int meguru_binary_search(int val, int *array, int ok, int ng) {
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (array[mid] >= val) {
ok = mid;
} else {
ng = mid;
}
}
return ok;
}
int main() {
int contest[] = {111, 222, 333,... | [
"call.arguments.change",
"call.arguments.add"
] | 1,032,979 | 1,032,980 | u521992338 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
for (int i = 0; i < 9; i++) {
if (a > i * 111) {
} else {
cout << i * 111;
break;
}
}
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
for (int i = 0; i < 10; i++) {
if (a > i * 111) {
} else {
cout << i * 111;
break;
}
}
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,032,981 | 1,032,982 | u872794515 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
for (int i = 0; i < 9; i++) {
if (a < i * 111) {
break;
} else {
cout << i * 111;
}
}
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
for (int i = 0; i < 10; i++) {
if (a > i * 111) {
} else {
cout << i * 111;
break;
}
}
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,032,984 | 1,032,982 | u872794515 | cpp |
p03243 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define INF int(1e9)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n - ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define INF int(1e9)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n - ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,002 | 1,033,003 | u136378781 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (; n <= 999; ++n) {
if (n % 10 == n / 100 && n / 10 % 10 == n % 10)
printf("%d", n);
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (; n <= 999; ++n) {
if (n % 10 == n / 100 && n / 10 % 10 == n % 10) {
printf("%d", n);
return 0;
}
}
} | [] | 1,033,009 | 1,033,010 | u953463534 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < 8; i++) {
if (n > i * 111 && n <= (i + 1) * 111) {
cout << (i + 1) * 111 << endl;
}
}
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < 9; i++) {
if (n > i * 111 && n <= (i + 1) * 111) {
cout << (i + 1) * 111 << endl;
}
}
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,033,014 | 1,033,015 | u843842420 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i < 8; i++) {
if (n >= i * 111 && n < (i + 1) * 111)
cout << (i + 1) * 111 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < 9; i++) {
if (n > i * 111 && n <= (i + 1) * 111) {
cout << (i + 1) * 111 << endl;
}
}
}
| [
"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",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,016 | 1,033,015 | u843842420 | cpp |
p03243 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define ALL(X) X.begin(), X.end()
#define SZ(A) int((A).size())
#define RALL(X) X.rbegin(), X.rend()
#define FOR(B) for (size_t i = 0; i < B; i++)
#define FOR2(B) for (size_t j = 0; j < B; j++)
#define FORE(B) for (size_t i = 1; i ... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define ALL(X) X.begin(), X.end()
#define SZ(A) int((A).size())
#define RALL(X) X.rbegin(), X.rend()
#define FOR(B) for (size_t i = 0; i < B; i++)
#define FOR2(B) for (size_t j = 0; j < B; j++)
#define FORE(B) for (size_t i = 1; i ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,033,017 | 1,033,018 | u799755608 | cpp |
p03243 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int a;
cin >> a;
int b = a / 100;
int c = b * 100 + b * 10 + b;
if (c > a) {
cout << c << endl;
} else {
b++;
c = b * 100 + ... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int a;
cin >> a;
int b = a / 100;
int c = b * 100 + b * 10 + b;
if (c >= a) {
cout << c << endl;
} else {
b++;
c = b * 100 +... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,022 | 1,033,023 | u588454863 | cpp |
p03243 | #include <cstring>
#include <iostream>
using namespace std;
main() {
int n, i, ans;
cin >> n;
for (i = 999; i <= 111; i -= 111) {
if (n <= i)
ans = i;
else
break;
}
cout << ans << endl;
}
| #include <cstring>
#include <iostream>
using namespace std;
main() {
int n, i, ans;
cin >> n;
for (i = 999; i >= 111; i -= 111) {
if (n <= i)
ans = i;
else
break;
}
cout << ans << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,033,026 | 1,033,027 | u160321725 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int n, a, m;
cin >> n;
a = n / 100;
m = a * 100 + a * 10 + a;
if (m <= n)
m += 111;
cout << m << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, a, m;
cin >> n;
a = n / 100;
m = a * 100 + a * 10 + a;
if (m < n)
m += 111;
cout << m << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,030 | 1,033,031 | u834488582 | cpp |
p03243 | #include <iostream>
int main() {
int N, a100, a10, a1;
std::cin >> N;
int i;
for (i = 1; i < 10; ++i) {
if (i * 111 - N > 0) {
break;
}
}
std::cout << i * 111 << std::endl;
return 0;
} | #include <iostream>
int main() {
int N, a100, a10, a1;
std::cin >> N;
int i;
for (i = 1; i < 10; ++i) {
if (i * 111 - N >= 0) {
break;
}
}
std::cout << i * 111 << std::endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,035 | 1,033,036 | u816645498 | cpp |
p03243 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
for (int i = 1; i <= 9; i++) {
if (a < 111 * i) {
cout << 111 * i << endl;
exit(0);
}
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
for (int i = 1; i <= 9; i++) {
if (a <= 111 * i) {
cout << 111 * i << endl;
exit(0);
}
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,045 | 1,033,046 | u324139341 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n;
x = (n - 1) / 111 + 1;
cout << x << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n;
x = (n - 1) / 111 + 1;
cout << x * 111 << endl;
}
| [
"expression.operation.binary.add"
] | 1,033,049 | 1,033,050 | u347588083 | cpp |
p03243 | /*
ID: leihaow1
TASK:
LANG: C++
*/
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int main() {
scanf("%d", &n);
for (int i = n + 1; i <= 999; i++) {
if ((i / 100 == i % 10) && (i / 100 == i / 10 % 10)) {
cout << i << endl;
return 0;
}
}
return 0;
} | /*
ID: leihaow1
TASK:
LANG: C++
*/
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int main() {
scanf("%d", &n);
for (int i = n; i <= 999; i++) {
if ((i / 100 == i % 10) && (i / 100 == i / 10 % 10)) {
cout << i << endl;
return 0;
}
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 1,033,051 | 1,033,052 | u925993509 | cpp |
p03243 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int rem = n / 111;
cout << rem * 111 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int rem = (n - 1) / 111 + 1;
cout << rem * 111 << endl;
return 0;
}
| [
"assignment.change"
] | 1,033,059 | 1,033,060 | u342703951 | cpp |
p03243 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#def... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#def... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,033,061 | 1,033,062 | u288432959 | cpp |
p03243 | // This Program is made by Jan(Codezebra)
#include <bits/stdc++.h>
#define int long long
#define INF 0x3f3f3f3f
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0;; i++) {
if (i * 111 > n) {
cout << i * 111;
return 0;
}
}
retu... | // This Program is made by Jan(Codezebra)
#include <bits/stdc++.h>
#define int long long
#define INF 0x3f3f3f3f
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0;; i++) {
if (i * 111 >= n) {
cout << i * 111;
return 0;
}
}
ret... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,063 | 1,033,064 | u531453632 | cpp |
p03243 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define FOR(i, a, b) for (i = (a); i < (b); ++i)
#define FORR(i, a, b) for (i = (a); i > (b); --i)
#define REP(i, n) for (i = 0; i < (n); ++i)
#define REPR(i, n) for (i = (n); i > 0; --i)
#define PB push_ba... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define FOR(i, a, b) for (i = (a); i < (b); ++i)
#define FORR(i, a, b) for (i = (a); i > (b); --i)
#define REP(i, n) for (i = 0; i < (n); ++i)
#define REPR(i, n) for (i = (n); i > 0; --i)
#define PB push_ba... | [
"literal.string.change",
"io.output.change"
] | 1,033,065 | 1,033,066 | u528981315 | cpp |
p03243 | #include <stdio.h>
int main() {
int n, c, a, b;
scanf("%d", &n);
c = n % 100;
a = (n - c) / 100;
b = 111 * a;
if (b > n)
printf("%d", b);
else
printf("%d", b + 111);
return 0;
}
| #include <stdio.h>
int main() {
int n, c, a, b;
scanf("%d", &n);
c = n % 100;
a = (n - c) / 100;
b = 111 * a;
if (b >= n)
printf("%d", b);
else
printf("%d", b + 111);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,067 | 1,033,068 | u072831727 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n <= n / 100 * 111)
cout << n / 100 * 111 << endl;
else
cout << (n + 1) / 100 * 111 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n <= n / 100 * 111)
cout << n / 100 * 111 << endl;
else
cout << (n / 100 + 1) * 111 << endl;
} | [
"expression.operation.binary.remove"
] | 1,033,075 | 1,033,076 | u128196936 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
char c[3];
int main() {
int x;
cin >> x;
for (int i = x; i < 1000; i++)
if ((x / 100) == (x / 10) % 10 && x / 100 == x % 10) {
cout << i;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
char c[3];
int main() {
int x;
cin >> x;
for (int i = x; i < 1000; i++)
if ((i / 100) == (i / 10) % 10 && i / 100 == i % 10) {
cout << i;
return 0;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,033,079 | 1,033,080 | u515315348 | cpp |
p03243 | #include <iostream>
int main() {
int n, s;
std::cin >> n;
for (int i = 1; i < 9; i++) {
s = 111 * i;
if (n <= s) {
std::cout << s << std::endl;
exit(0);
}
}
return 0;
} | #include <iostream>
int main() {
int n, s;
std::cin >> n;
for (int i = 1; i <= 9; i++) {
s = 111 * i;
if (n <= s) {
std::cout << s << std::endl;
exit(0);
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,033,081 | 1,033,082 | u210398438 | cpp |
p03243 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < 9; i++) {
if (n / 111 == i && n % 111 != 0) {
cout << (i + 1) * 111 << endl;
} else if (n % 111 == 0 && n / 111 == 1) {
cout << n << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < 9; i++) {
if (n / 111 == i && n % 111 != 0) {
cout << (i + 1) * 111 << endl;
} else if (n % 111 == 0 && n / 111 == i + 1) {
cout << n << endl;
}
}
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,033,083 | 1,033,084 | u763606830 | cpp |
p03243 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, ans, b;
cin >> n;
b = 1;
for (int i = 0; i < 10; i++) {
if (n < (i * 100 + i * 10 + i) && b == 1) {
ans = i * 100 + i * 10 + i;
b = 0;
}
}
cout << ans;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, ans, b;
cin >> n;
b = 1;
for (int i = 0; i < 10; i++) {
if (n <= (i * 100 + i * 10 + i) && b == 1) {
ans = i * 100 + i * 10 + i;
b = 0;
}
}
cout << ans;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,033,093 | 1,033,094 | u596912804 | cpp |
p03243 | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int a;
scanf("%d", &a);
int b;
b = a / 111 + 1;
printf("%d", 111 * b);
}
| #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int a;
scanf("%d", &a);
int b;
b = (a - 1) / 111 + 1;
printf("%d", 111 * b);
}
| [] | 1,033,097 | 1,033,098 | u671367320 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.