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 |
|---|---|---|---|---|---|---|---|
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int f(int n) { return ((n % 2 == 0) ? n / 2 : 3 * n + 1); }
int main() {
string s;
cin >> s;
int ans ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int f(int n) { return ((n % 2 == 0) ? n / 2 : 3 * n + 1); }
int main() {
string s;
cin >> s;
int ans ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 1,005,589 | 1,005,590 | u119171625 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
/// Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout << #var << " " << var << endl;
#define co(q) cout << q << endl;
#define all(q) (q).begin(), (q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9 + 7;
... | #include <bits/stdc++.h>
using namespace std;
/// Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout << #var << " " << var << endl;
#define co(q) cout << q << endl;
#define all(q) (q).begin(), (q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9 + 7;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,591 | 1,005,592 | u642657797 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
int ans = INF;
rep(i, S.length() - 2) {
int a[3];
int X;
rep(j, 3) {
a[j] = S[i + j] - '0';
X += pow(10, 2 - j) * a[j];
}
ans = min... | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
int ans = INF;
rep(i, S.length() - 2) {
int a[3];
int X = 0;
rep(j, 3) {
a[j] = S[i + j] - '0';
X += pow(10, 2 - j) * a[j];
}
ans =... | [
"variable_declaration.value.change"
] | 1,005,595 | 1,005,596 | u900958593 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int M = 1000;
for (int i = 0; i < N - 3; i++) {
int right = 0;
int cnt = 0;
for (int j = i; j < i + 3; j++) {
char A = S.at(j);
if (j == i)
right = 100 * (A - '0');
if (j =... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int M = 1000;
for (int i = 0; i < N - 2; i++) {
int right = 0;
int cnt = 0;
for (int j = i; j < i + 3; j++) {
char A = S.at(j);
if (j == i)
right = 100 * (A - '0');
if (j =... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,601 | 1,005,602 | u714624983 | cpp |
p03211 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int m = 1000, a;
for (int i = 0; i < s.size(); i++) {
int num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
m = min(m, abs(num - 753));
}
cout << m << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int m = 1000, a;
for (int i = 0; i < s.size() - 2; i++) {
a = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
m = min(m, abs(a - 753));
}
cout << m << endl;
} | [
"control_flow.loop.for.condition.change",
"assignment.variable.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,005,607 | 1,005,608 | u098923136 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 10000;
for (int i = 0; i < s.size() - 3; i++) {
int num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ans = min(ans, abs(753 - num));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 10000;
for (int i = 0; i < s.size() - 2; i++) {
int num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ans = min(ans, abs(753 - num));
}
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,609 | 1,005,610 | u351148423 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 10000;
for (int i = 0; i < s.size() - 3; i++) {
int num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ans = min(ans, 753 - num);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 10000;
for (int i = 0; i < s.size() - 2; i++) {
int num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ans = min(ans, abs(753 - num));
}
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.add",
"call.arguments.change"
] | 1,005,611 | 1,005,610 | u351148423 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int nw = 1000;
int ans = 1000;
for (int i = 0; i < s.size() - 2; i++) {
string sx = s.substr(i, 3);
int nx = stoi(sx);
nw = abs(754 - nx);
ans = min(nw, ans);
}
cout << ans - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int nw = 1000;
int ans = 1000;
for (int i = 0; i < s.size() - 2; i++) {
string sx = s.substr(i, 3);
int nx = stoi(sx);
nw = abs(753 - nx);
ans = min(nw, ans);
}
cout << ans << endl;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,005,617 | 1,005,618 | u739489568 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.size();
int i, j, ans = 10000;
for (i = 0; i < len - 3; i++) {
ans = min(ans, abs(753 - ((s[i] - '0') * 100 + (s[i + 1] - '0') * 10 +
(s[i + 2] - '0'))));
}
cout << ans << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.size();
int i, j, ans = 10000;
for (i = 0; i <= len - 3; i++) {
ans = min(ans, abs(753 - ((s[i] - '0') * 100 + (s[i + 1] - '0') * 10 +
(s[i + 2] - '0'))));
}
cout << ans << endl;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,623 | 1,005,624 | u494609869 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.size();
int i, j, ans = 10000;
for (i = 0; i < len - 3; i++) {
ans = min(abs(753 - ans),
abs(753 - ((s[i] - '0') * 100 + (s[i + 1] - '0') * 10 +
(s[i + 2] - '0'))));
}
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.size();
int i, j, ans = 10000;
for (i = 0; i <= len - 3; i++) {
ans = min(ans, abs(753 - ((s[i] - '0') * 100 + (s[i + 1] - '0') * 10 +
(s[i + 2] - '0'))));
}
cout << ans << endl;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.remove",
"call.arguments.change"
] | 1,005,625 | 1,005,624 | u494609869 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> input(int N) {
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
return vec;
}
int main() {
string s;
int a = 1000;
cin >> s;
for (int i = 0; i < s.size() - 3; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> input(int N) {
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
return vec;
}
int main() {
string s;
int a = 1000;
cin >> s;
for (int i = 0; i <= s.size() - 3; i++) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,626 | 1,005,627 | u492660436 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s;
cin >> s;
int u = stoi(s);
vector<int> a(s.size());
for (int i = 0; i < s.size(); i++) {
a[i] = u % 10;
u = u / 10;
}
reverse(a.begin(), a.end());
int minV =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s;
cin >> s;
ll u = stol(s);
vector<int> a(s.size());
for (int i = 0; i < s.size(); i++) {
a[i] = u % 10;
u = u / 10;
}
reverse(a.begin(), a.end());
int minV = ... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,642 | 1,005,641 | u224843402 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int a = 999;
for (int i = 0; i < N - 3; i++) {
int b = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + (S[i + 2] - '0');
a = min(a, abs(b - 753));
}
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int a = 999;
for (int i = 0; i <= N - 3; i++) {
int b = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
a = min(a, abs(b - 753));
}
cout << a << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,644 | 1,005,645 | u896053584 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int a = 999;
for (int i = 0; i < N - 3; i++) {
int b = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + (S[i] - '0');
a = min(a, abs(b - 753));
}
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int a = 999;
for (int i = 0; i <= N - 3; i++) {
int b = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
a = min(a, abs(b - 753));
}
cout << a << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,646 | 1,005,645 | u896053584 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
int main() {
ll N, ans = 1000;
cin >> N;
while (N > 99) {
ll n = N % 1000;
if (n > 754) {
n -= 754;
} else {
n = 754 - n;
}
ans = min(ans, n);
N /= 10;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
int main() {
ll N, ans = 1000;
cin >> N;
while (N > 99) {
ll n = N % 1000;
// cout<<ans<<endl;
if (n > 753) {
n -= 753;
} else {
n = 753 - n;
}
ans = min(ans, n);
N /= 10;
}
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,005,653 | 1,005,654 | u102070373 | cpp |
p03211 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,005,660 | 1,005,661 | u812973725 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
scanf("%lld", &s);
deque<int> deq;
while (s > 0) {
deq.push_front(s % 10);
s = s / 10;
}
int ans = 1e9;
int n = deq.size();
for (int i = 0; i < n - 2; i++) {
int a = abs((deq[i] * 100 + deq[i + 1] * 10 + deq[i + 2]) - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
scanf("%lld", &s);
deque<int> deq;
while (s > 0) {
deq.push_front(s % 10);
s = s / 10;
}
int ans = 1e9;
int n = deq.size();
for (int i = 0; i < n - 2; i++) {
int a = abs((deq[i] * 100 + deq[i + 1] * 10 + deq[i + 2]) - ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,005,664 | 1,005,665 | u787005274 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
scanf("%lld", &s);
deque<int> deq;
while (s > 0) {
deq.push_front(s % 10);
s = s / 10;
}
int ans = 1e9;
int n = deq.size();
for (int i = 0; i < n - 3; i++) {
int a = abs((deq[i] * 100 + deq[i + 1] * 10 + deq[i + 2]) - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
scanf("%lld", &s);
deque<int> deq;
while (s > 0) {
deq.push_front(s % 10);
s = s / 10;
}
int ans = 1e9;
int n = deq.size();
for (int i = 0; i < n - 2; i++) {
int a = abs((deq[i] * 100 + deq[i + 1] * 10 + deq[i + 2]) - ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,666 | 1,005,665 | u787005274 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
scanf("%lld", &s);
deque<int> deq;
while (s > 9) {
deq.push_front(s % 10);
s = s / 10;
}
int ans = 1e9;
int n = deq.size();
for (int i = 0; i < n - 3; i++) {
int a = abs((deq[i] * 100 + deq[i + 1] * 10 + deq[i + 2]) - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
scanf("%lld", &s);
deque<int> deq;
while (s > 0) {
deq.push_front(s % 10);
s = s / 10;
}
int ans = 1e9;
int n = deq.size();
for (int i = 0; i < n - 2; i++) {
int a = abs((deq[i] * 100 + deq[i + 1] * 10 + deq[i + 2]) - ... | [
"literal.number.change",
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,667 | 1,005,665 | u787005274 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
scanf("%lld", &s);
deque<int> deq;
while (s > 9) {
deq.push_front(s % 10);
s = s / 10;
}
int ans = 1e9;
int n = deq.size();
for (int i = 0; i < n - 3; i++) {
int a = abs(deq[i] * 100 + deq[i + 1] * 10 + deq[i + 2] - 75... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
scanf("%lld", &s);
deque<int> deq;
while (s > 0) {
deq.push_front(s % 10);
s = s / 10;
}
int ans = 1e9;
int n = deq.size();
for (int i = 0; i < n - 2; i++) {
int a = abs((deq[i] * 100 + deq[i + 1] * 10 + deq[i + 2]) - ... | [
"literal.number.change",
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.arguments.change"
] | 1,005,668 | 1,005,665 | u787005274 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int val = stoi(S.substr(0, 3));
int diff = abs(stoi(S.substr(0, 3)) - 753);
for (int i = 0; i < S.size() - 3; i++) {
if (diff > abs(stoi(S.substr(i, 3)) - 753)) {
diff = abs(stoi(S.substr(i, 3)) - 753);
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int val = stoi(S.substr(0, 3));
int diff = abs(stoi(S.substr(0, 3)) - 753);
for (int i = 0; i < S.size() - 2; i++) {
if (diff > abs(stoi(S.substr(i, 3)) - 753)) {
diff = abs(stoi(S.substr(i, 3)) - 753);
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,669 | 1,005,670 | u605901675 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int val = stoi(S.substr(0, 3));
int diff = abs(stoi(S.substr(0, 3)) - 753);
for (int i = 0; i < S.size() - 3; i++) {
if (diff > abs(stoi(S.substr(i, 3)) - 753)) {
diff = abs(stoi(S.substr(i, 3)) - 753);
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int val = stoi(S.substr(0, 3));
int diff = abs(stoi(S.substr(0, 3)) - 753);
for (int i = 0; i < S.size() - 2; i++) {
if (diff > abs(stoi(S.substr(i, 3)) - 753)) {
diff = abs(stoi(S.substr(i, 3)) - 753);
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 1,005,671 | 1,005,670 | u605901675 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int val = stoi(S.substr(0, 3));
int diff = abs(stoi(S.substr(0, 3)) - 753);
for (int i = 0; i < S.size() - 3; i++) {
if (diff < abs(stoi(S.substr(i, 3)) - 753)) {
diff = abs(stoi(S.substr(i, 3)) - 753);
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int val = stoi(S.substr(0, 3));
int diff = abs(stoi(S.substr(0, 3)) - 753);
for (int i = 0; i < S.size() - 2; i++) {
if (diff > abs(stoi(S.substr(i, 3)) - 753)) {
diff = abs(stoi(S.substr(i, 3)) - 753);
... | [
"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",
"identifier.change",
"io.output.change"
] | 1,005,672 | 1,005,670 | u605901675 | cpp |
p03211 | #include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for (intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for (intl i = (intl)(n)-1; i >= 0; i--)
#define repi(i, a, b) for (intl i = (intl)(a); i < (intl)(b); i++)
#def... | #include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for (intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for (intl i = (intl)(n)-1; i >= 0; i--)
#define repi(i, a, b) for (intl i = (intl)(a); i < (intl)(b); i++)
#def... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,005,675 | 1,005,676 | u344119694 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int N = S.size();
vector<int> A(N - 2);
for (int i = 0; i < N - 2; i++) {
string s = "";
for (int j = 0; j < 3; j++) {
s += S.at(i + j);
}
A.at(i) = stoi(s);
}
int Min = 1000;
for (int i = 0; i < N - 2; i++)
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> A(N - 2);
for (int i = 0; i < N - 2; i++) {
string s = "";
for (int j = 0; j < 3; j++) {
s += S.at(i + j);
}
A.at(i) = stoi(s);
}
int Min = 1000;
for (int i = 0; i < N - 2; ... | [] | 1,005,677 | 1,005,678 | u101018317 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int min = 1000;
for (int i = 0; i < N - 2; i++) {
string suji;
suji.push_back(S.at(i));
suji.push_back(S.at(i + 1));
suji.push_back(S.at(i + 2));
int number = stoi(suji); //文字列から数字
if (abs... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int min = 1000;
for (int i = 0; i < N - 2; i++) {
string suji;
suji.push_back(S.at(i));
suji.push_back(S.at(i + 1));
suji.push_back(S.at(i + 2));
int number = stoi(suji); //文字列から数字
if (abs... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,005,681 | 1,005,682 | u094654185 | cpp |
p03211 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
std::vector<int> a;
int n;
std::cin >> n;
while (n > 1) {
a.push_back(n % 10);
n /= 10;
}
std::reverse(a.begin(), a.end());
int min = INT_MAX;
for (size_t i = 0; i < a.size() - 3; +... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
std::vector<int> a;
long n;
std::cin >> n;
while (n >= 1) {
a.push_back(n % 10);
n /= 10;
}
std::reverse(a.begin(), a.end());
int min = INT_MAX;
for (size_t i = 0; i < a.size() - 2;... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,695 | 1,005,696 | u089888152 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 1,005,697 | 1,005,698 | u584787460 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"call.add",
"call.arguments.add"
] | 1,005,699 | 1,005,698 | u584787460 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
type... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
type... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,714 | 1,005,715 | u743889070 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i... | [
"call.add",
"call.arguments.add"
] | 1,005,724 | 1,005,725 | u900485130 | cpp |
p03211 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
int len = S.size();
int min_sa = INT_MAX;
for (int i = 0; i < len - 3; i++) {
string s = S.substr(i, 3);
int num = stoi(s);
int sa = abs(753 - num);
if (min_sa > sa) {
min... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
int len = S.size();
int min_sa = INT_MAX;
for (int i = 0; i < len - 2; i++) {
string s = S.substr(i, 3);
int num = stoi(s);
int sa = abs(753 - num);
if (min_sa > sa) {
min... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,726 | 1,005,727 | u651314218 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 1; i <= (n); ++i)
typedef long long ll;
bool debug = false;
int main() {
string s;
cin >> s;
ll ans = 753;
rep(i, s.size() - 2) {
ll p = 100 * (s[i] - '0') + 10 * (s[i + 1] - '0') + (s[i + 2] - '0');
ans = min(ans, abs(753 - p))... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef long long ll;
bool debug = false;
int main() {
string s;
cin >> s;
ll ans = 753;
rep(i, s.size() - 2) {
ll p = 100 * (s[i] - '0') + 10 * (s[i + 1] - '0') + (s[i + 2] - '0');
ans = min(ans, abs(753 - p));... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operator.compare.change"
] | 1,005,735 | 1,005,736 | u816352006 | cpp |
p03211 | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | [
"expression.operation.binary.add"
] | 1,005,741 | 1,005,742 | u167931717 | cpp |
p03211 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... | [
"variable_declaration.remove"
] | 1,005,743 | 1,005,744 | u983547593 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int diff = 1000;
for (int i = 0; i < s.size(); i++) {
int x;
x = (int)(s[i] - '0') * 100 + (int)(s[i + 1] - '0') * 10 +
(int)(s[i + 2] - '0');
diff = min(diff, abs(x - 753));
}
cout << diff << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int diff = 1000;
for (int i = 0; i < s.size() - 2; i++) {
int x;
x = (int)(s[i] - '0') * 100 + (int)(s[i + 1] - '0') * 10 +
(int)(s[i + 2] - '0');
diff = min(diff, abs(x - 753));
}
cout << diff << endl;
ret... | [
"control_flow.loop.for.condition.change"
] | 1,005,745 | 1,005,746 | u603958124 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int diff = 1000;
for (int i = 0; i < s.size() - 1; i++) {
int x;
x = (int)(s[i] - '0') * 100 + (int)(s[i + 1] - '0') * 10 +
(int)(s[i + 2] - '0');
diff = min(diff, abs(x - 753));
}
cout << diff << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int diff = 1000;
for (int i = 0; i < s.size() - 2; i++) {
int x;
x = (int)(s[i] - '0') * 100 + (int)(s[i + 1] - '0') * 10 +
(int)(s[i + 2] - '0');
diff = min(diff, abs(x - 753));
}
cout << diff << endl;
ret... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,747 | 1,005,746 | u603958124 | cpp |
p03211 | #include "bits/stdc++.h"
using namespace std;
void Main() {
string S;
cin >> S;
int ans = 1000;
for (int i = 0; i < S.size() - 2; ++i) {
int lunlun = atoi(S.substr(i, 3).c_str());
ans = min(ans, lunlun);
}
cout << ans << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
... | #include "bits/stdc++.h"
using namespace std;
void Main() {
string S;
cin >> S;
int ans = 1000;
for (int i = 0; i < S.size() - 2; ++i) {
int lunlun = atoi(S.substr(i, 3).c_str());
ans = min(ans, abs(lunlun - 753));
}
cout << ans << endl;
}
int main() {
std::cout << std::fixed << std::setprecis... | [
"call.add",
"call.arguments.add"
] | 1,005,750 | 1,005,751 | u138886316 | cpp |
p03211 | #include <bits/stdc++.h>
#include <numeric>
#include <set>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) a.begin(), a.end()
using ll = long long;
using namespace std;
int solve() {
string s;
int n = s.size();
int ans = 999;
for (int i = 0; i <= n - 3; ++i) {
int num = (s[i] - '0') * 100 +... | #include <bits/stdc++.h>
#include <numeric>
#include <set>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) a.begin(), a.end()
using ll = long long;
using namespace std;
// ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// const double PI = acos(-1);
// int gcd(int x, int y) { return (x % y)? gcd(... | [] | 1,005,752 | 1,005,753 | u080608919 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,005,756 | 1,005,755 | u296160120 | cpp |
p03211 | //
// CPlibrary
//
// Created by Tanmay Singh on 3/03/2020.
// INDIAN INSTITUTE OF TECHNOLOGY (BHU) , VARANASI
// Copyright © 2020 Tanmay Singh. All rights reserved.
//#pragma GCC target ("avx2")
#pragma GCC optimization("O3")
//#pragma GCC optimization ("unroll-loops")
#include <algorithm>
#include <bitset>
#inclu... | //
// CPlibrary
//
// Created by Tanmay Singh on 3/03/2020.
// INDIAN INSTITUTE OF TECHNOLOGY (BHU) , VARANASI
// Copyright © 2020 Tanmay Singh. All rights reserved.
//#pragma GCC target ("avx2")
#pragma GCC optimization("O3")
//#pragma GCC optimization ("unroll-loops")
#include <algorithm>
#include <bitset>
#inclu... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,765 | 1,005,766 | u981065082 | cpp |
p03211 | #include <stdio.h>
int main(void) {
long int S;
int min = 1000, S2 = 0;
int base = 753;
scanf("%d", &S);
while (S > 100) {
S2 = S % 1000;
S /= 10;
if (S2 >= 753) {
if (min > S2 - 753) {
min = S2 - 753;
}
} else if (S2 < 753) {
if (min > 753 - S2) {
min = 753 -... | #include <stdio.h>
int main(void) {
long int S;
int min = 1000, S2 = 0;
int base = 753;
scanf("%ld", &S);
while (S > 100) {
S2 = S % 1000;
S /= 10;
if (S2 >= 753) {
if (min > S2 - 753) {
min = S2 - 753;
}
} else if (S2 < 753) {
if (min > 753 - S2) {
min = 753 ... | [
"literal.string.change",
"call.arguments.change"
] | 1,005,770 | 1,005,771 | u475843109 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int ans = 11111110;
while (s >= 1000) {
int r = s % 1000;
ans = min(ans, abs(r - 753));
s /= 10;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
cin >> s;
int ans = 11111110;
while (s >= 100) {
int r = s % 1000;
ans = min(ans, abs(r - 753));
s /= 10;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"control_flow.loop.condition.change"
] | 1,005,774 | 1,005,773 | u319279308 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define repn(i, a, n) for (int i = a; i < n; i++)
#define revn(i, a, n) for (int i = a; i > n; i--)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, a) for (int i = a; i > -1; i--)
#define mp make_pair
#define pb push... | #include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define repn(i, a, n) for (int i = a; i < n; i++)
#define revn(i, a, n) for (int i = a; i > n; i--)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, a) for (int i = a; i > -1; i--)
#define mp make_pair
#define pb push... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,784 | 1,005,785 | u074294821 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int makenum(char a, char b, char c) {
int x, y, z;
x = a - '0';
y = b - '0';
z = c - '0';
return x * 100 + y * 10 + z;
}
int main() {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int makenum(char a, char b, char c) {
int x, y, z;
x = a - '0';
y = b - '0';
z = c - '0';
return x * 100 + y * 10 + z;
}
int main() {... | [
"assignment.change"
] | 1,005,786 | 1,005,787 | u527311983 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int num;
int res = 10000000;
for (int i = 0; i < (int)s.size() - 3; i++) {
num =
(s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 + (s.at(i + 2) - '0');
res = min(res, abs(num - 753));
}
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int num;
int res = 10000000;
for (int i = 0; i <= (int)s.size() - 3; i++) {
num =
(s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 + (s.at(i + 2) - '0');
res = min(res, abs(num - 753));
}
cout << res << endl;
}... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,788 | 1,005,789 | u231354686 | cpp |
p03211 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <valarray>
#include <vector>
using namespace std;
int main() {
int x = 0, ans = INT_MAX;
const int z = 753;
string s;
cin >> s;
for (int i = 0; i < s.size() - 3; i++) {
x = (s[i] - '0') * 100 + (s[i +... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <valarray>
#include <vector>
using namespace std;
int main() {
int x = 0, ans = INT_MAX;
const int z = 753;
string s;
cin >> s;
for (int i = 0; i < s.size() - 2; i++) {
x = (s[i] - '0') * 100 + (s[i +... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,792 | 1,005,793 | u854402515 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int k = 1;
long long int x = n;
while (x >= 10) {
x /= 10;
k++;
}
long long int ans = 1000;
long long int a = 1;
for (int i = 0; i < k - 2; i++)
a *= 10;
for (int i = 0; i < k - 2; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int k = 1;
long long int x = n;
while (x >= 10) {
x /= 10;
k++;
}
long long int ans = 1000;
long long int a = 1;
for (long long int i = 0; i < k - 2; i++)
a *= 10;
for (long long int i = 0;... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,796 | 1,005,797 | u247123590 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define ALL(x) (x).begin(), (x).end()
#define rALL(x) (x).rbegin(), (x).rend()
typedef long double ld;
using ll = long long;
using namespace std;
const int mod = 1e9 + 7;
const ll inf = 1LL << 60;
const ld pi = (acos(-1));
template <class ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define ALL(x) (x).begin(), (x).end()
#define rALL(x) (x).rbegin(), (x).rend()
typedef long double ld;
using ll = long long;
using namespace std;
const int mod = 1e9 + 7;
const ll inf = 1LL << 60;
const ld pi = (acos(-1));
template <class ... | [
"assignment.change"
] | 1,005,800 | 1,005,801 | u709373021 | cpp |
p03210 | #include "bits/stdc++.h"
using namespace std;
int main() {
int X;
cin >> X;
if (X == 3 || X == 5 || X == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int X;
cin >> X;
if (X == 3 || X == 5 || X == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,005,806 | 1,005,807 | u709583164 | cpp |
p03210 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = (0); (i) < (n); ++i)
#define ll long long
#define PB push_back
#define INF 1000000000
int main() {
int x;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = (0); (i) < (n); ++i)
#define ll long long
#define PB push_back
#define INF 1000000000
int main() {
int x;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,005,812 | 1,005,815 | u263518976 | cpp |
p03210 | #include <iostream>
using namespace std;
int main(void) {
int i;
cin >> i;
if (i == 3 or i == 5 or i == 7) {
cout << "YES";
}
cout << "NO";
}
| #include <iostream>
using namespace std;
int main(void) {
int i;
cin >> i;
if (i == 3 or i == 5 or i == 7) {
cout << "YES";
} else {
cout << "NO";
}
}
| [
"control_flow.branch.else.add"
] | 1,005,826 | 1,005,827 | u505547600 | cpp |
p03210 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int X;
cin >> X;
if (X == 3 || X == 5 || X =... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int X;
cin >> X;
if (X == 3 || X == 5 || X =... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,005,832 | 1,005,833 | u701891338 | cpp |
p03210 | #include <stdio.h>
int main() {
int x;
scanf("%d", &x);
if (x == 3 || x == 5 || x == 7) {
printf("Yes\n");
} else
printf("No\n");
return 0;
}
| #include <stdio.h>
int main() {
int x;
scanf("%d", &x);
if (x == 3 || x == 5 || x == 7) {
printf("YES\n");
} else
printf("NO\n");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,005,834 | 1,005,835 | u950985776 | cpp |
p03210 | #include <stdio.h>
int main() {
int x;
scanf("%d", &x);
if (x == 3 | x == 5 | x == 7) {
printf("Yes\n");
} else
printf("No\n");
return 0;
}
| #include <stdio.h>
int main() {
int x;
scanf("%d", &x);
if (x == 3 || x == 5 || x == 7) {
printf("YES\n");
} else
printf("NO\n");
return 0;
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,005,836 | 1,005,835 | u950985776 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if ((x == 3) || (x == 5) || (x == 6))
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if ((x == 3) || (x == 5) || (x == 7))
cout << "YES";
else
cout << "NO";
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,005,837 | 1,005,838 | u850741288 | cpp |
p03210 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, N) for (long long i = 0; i < (long long)N; ++i)
int N;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, N) for (long long i = 0; i < (long long)N; ++i)
int N;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,005,839 | 1,005,840 | u378155378 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
#define max(a, b) (a < b ? b : a)
#define abs(x) (x < 0 ? (-x) : x)
#define F(i, L, R) for (int i = L; i < R; i++)
#define FE(i, L, R) for (int i = L; i <= R; i++)
#define RF(i, L, R) for (int i = L; i > R; i--)
#define RFE(i, L, R) for (int i = L; i >= R; i--)
#define getI... | #include <bits/stdc++.h>
using namespace std;
#define max(a, b) (a < b ? b : a)
#define abs(x) (x < 0 ? (-x) : x)
#define F(i, L, R) for (int i = L; i < R; i++)
#define FE(i, L, R) for (int i = L; i <= R; i++)
#define RF(i, L, R) for (int i = L; i > R; i--)
#define RFE(i, L, R) for (int i = L; i >= R; i--)
#define getI... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,005,842 | 1,005,843 | u596372590 | cpp |
p03210 | #include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
scanf("%lld", &n);
if (n == 3 || n == 5 || n == 7)
printf("Yes");
else
printf("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
scanf("%lld", &n);
if (n == 3 || n == 5 || n == 7)
printf("YES");
else
printf("NO");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,005,848 | 1,005,849 | u386813869 | cpp |
p03210 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 3 || n == 5 || n == 7)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 3 || n == 5 || n == 7)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,005,861 | 1,005,863 | u390066708 | cpp |
p03210 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORB(i, m, n) for (int i = m; i >= m; i--)
#define ll long long
#define pb push_back
#define popb pop_back
using namespace std;
int main() {
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORB(i, m, n) for (int i = m; i >= m; i--)
#define ll long long
#define pb push_back
#define popb pop_back
using namespace std;
int main() {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,005,871 | 1,005,873 | u525432476 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 3 || n == 5 || n == 7)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 3 || n == 5 || n == 7)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,005,879 | 1,005,881 | u428110253 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,005,887 | 1,005,889 | u642210599 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,005,895 | 1,005,897 | u393693918 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7)
cout << "Yes";
else
cout << "No";
cout << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
if (x == 3 || x == 5 || x == 7)
cout << "YES";
else
cout << "NO";
cout << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,005,898 | 1,005,900 | u961876423 | cpp |
p03210 | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
using i64 = long long int;
int main() {
int X;
cin >> X;
if (X == 3 || X == 5 |... | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
using i64 = long long int;
int main() {
int X;
cin >> X;
if (X == 3 || X == 5 |... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,005,910 | 1,005,913 | u158253287 | cpp |
p03210 | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>
#define mod 1000000007
#define S second
#define F first
#define int long long
using namespace std;
string s;
int mutu(int a) {
int b = 1;
for (int i = a + 1; i != s.size(); i++) {
if (s[i] == s[a])
b++;
els... | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>
#define mod 1000000007
#define S second
#define F first
#define int long long
using namespace std;
string s;
int mutu(int a) {
int b = 1;
for (int i = a + 1; i != s.size(); i++) {
if (s[i] == s[a])
b++;
els... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,005,918 | 1,005,920 | u259210975 | cpp |
p03210 | #include "bits/stdc++.h"
using namespace std;
#define print(s) cout << (s) << endl;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
int main() {
ios::sync_with_stdio(false);
cin.t... | #include "bits/stdc++.h"
using namespace std;
#define print(s) cout << (s) << endl;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
int main() {
ios::sync_with_stdio(false);
cin.t... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,005,936 | 1,005,938 | u601825761 | cpp |
p03210 | #include "bits/stdc++.h"
using namespace std;
#define print(s) cout << (s) << endl;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
int main() {
ios::sync_with_stdio(false);
cin.t... | #include "bits/stdc++.h"
using namespace std;
#define print(s) cout << (s) << endl;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
int main() {
ios::sync_with_stdio(false);
cin.t... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,005,940 | 1,005,938 | u601825761 | cpp |
p03210 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,005,953 | 1,005,961 | u937608388 | cpp |
p03210 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 3 || a == 5 || a == 7)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
if (a == 3 || a == 5 || a == 7)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,006,004 | 1,006,006 | u338520482 | cpp |
p03210 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,006,012 | 1,006,014 | u479953984 | cpp |
p03210 | #include <iostream>
using namespace std;
int main() {
// 整数の入力
int a;
if (a == 7) {
cout << "YES\n " << endl;
return 0;
} else if (a == 5) {
cout << "YES\n " << endl;
return 0;
} else if (a == 3) {
cout << "YES\n " << endl;
return 0;
}
// 出力
cout << "NO\n " << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
// 整数の入力
int a;
cin >> a;
if (a == 7) {
cout << "YES\n " << endl;
return 0;
} else if (a == 5) {
cout << "YES\n " << endl;
return 0;
} else if (a == 3) {
cout << "YES\n " << endl;
return 0;
}
// 出力
cout << "NO\n " << endl;
... | [] | 1,006,016 | 1,006,018 | u028413707 | cpp |
p03210 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define prin(num) cout << num << endl
#define max(a, b) ((a) > (b) ? (a) : (b))
#define mi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define prin(num) cout << num << endl
#define max(a, b) ((a) > (b) ? (a) : (b))
#define mi... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,006,036 | 1,006,038 | u768152935 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0;
int m = 3456;
cin >> s;
for (int i = 2; i < s.size() - 2; i++) {
int sum = 0;
for (int j = i; j < i + 3; j++) {
sum = sum * 10 + (s[j] - '0');
}
m = min(m, abs(sum - 753));
}
cout << m << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum = 0;
int m = 3456;
cin >> s;
for (int i = 0; i < s.size() - 2; i++) {
int sum = 0;
for (int j = i; j < i + 3; j++) {
sum = sum * 10 + (s[j] - '0');
}
m = min(m, abs(sum - 753));
}
cout << m << endl;
retur... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 1,005,808 | 1,005,811 | u353919145 | cpp |
p03210 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
if (n = 3 or n == 5 or n == 7)
cout << "YES" << endl;
else
cout << "NO" << 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;
if (n == 3 or n == 5 or n == 7)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,006,050 | 1,006,052 | u174404613 | cpp |
p03210 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fi first
#define se second
#define fcout(n) cout << fixed << setprecision((n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fi first
#define se second
#define fcout(n) cout << fixed << setprecision((n... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,006,054 | 1,006,056 | u946140993 | cpp |
p03210 | #include "algorithm"
#include "cmath"
#include "iostream"
#include "string"
#include "vector"
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[]) {
ll NN;
std::cin >> NN;
int flag = 0;
if (NN != 3) {
if (NN != 5) {
if (NN != 7) {
flag = 1;
}
}
}
... | #include "algorithm"
#include "cmath"
#include "iostream"
#include "string"
#include "vector"
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[]) {
ll NN;
std::cin >> NN;
int flag = 0;
if (NN != 3) {
if (NN != 5) {
if (NN != 7) {
flag = 1;
}
}
}
... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,006,062 | 1,006,064 | u271986615 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,005,857 | 1,005,862 | u946082956 | cpp |
p03211 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using ll = long long;
using namespace std;
int x, y, z, l, m, n, r, q, k;
void solve() {
int mdiff = LONG_LONG_MAX;
string s;
cin >> s;
n = s.size();
for (int i = 0; i < n - 2; i++) {
int diff = abs(stoi(s.subst... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using ll = long long;
using namespace std;
int x, y, z, l, m, n, r, q, k;
void solve() {
int mdiff = INT_MAX;
string s;
cin >> s;
n = s.size();
for (int i = 0; i < n - 2; i++) {
int diff = abs(stoi(s.substr(i, 3... | [
"variable_declaration.value.change",
"identifier.change"
] | 1,005,868 | 1,005,870 | u646017153 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 0; i <= S.size() + 3; i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 0; i <= S.size() - 3; i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,005,880 | 1,005,882 | u187772564 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 0; i <= S.size(); i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 0; i <= S.size() - 3; i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 1,005,884 | 1,005,882 | u187772564 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 1; i <= S.size(); i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 0; i <= S.size() - 3; i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change"
] | 1,005,886 | 1,005,882 | u187772564 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 2; i < S.size(); i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 0; i <= S.size() - 3; i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,888 | 1,005,882 | u187772564 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 2; i <= S.size(); i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 0; i <= S.size() - 3; i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 1,005,890 | 1,005,882 | u187772564 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 3; i <= S.size(); i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 0; i <= S.size() - 3; i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 1,005,892 | 1,005,882 | u187772564 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 1000;
for (int i = 3; i <= S.size(); i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 999;
for (int i = 0; i <= S.size() - 3; i++) {
int aaa = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(aaa - 753));
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 1,005,894 | 1,005,882 | u187772564 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const st... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const st... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,005,896 | 1,005,899 | u223160139 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int toInt(char ch) { return (ch - '0'); }
int main() {
string s;
int i, j, l, x, ans = 11111;
cin >> s;
l = (int)s.size();
for (i = 0; i + 2 <= l; i++) {
x = toInt(s[i]) * 100 + toInt(s[i + 1]) * 10 + toInt(s[i + 2]);
ans = min(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int toInt(char ch) { return (ch - '0'); }
int main() {
string s;
int i, j, l, x, ans = 11111;
cin >> s;
l = (int)s.size();
for (i = 0; i + 2 < l; i++) {
x = toInt(s[i]) * 100 + toInt(s[i + 1]) * 10 + toInt(s[i + 2]);
ans = min(a... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,903 | 1,005,905 | u816631826 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
string s;
int main(void) {
cin >> s;
int ans;
for (int i = 0; i < s.size() - 2; i++) {
ans = min(ans, abs(stoi(s.substr(i, 3)) - 753));
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
string s;
int main(void) {
cin >> s;
int ans = INT_MAX;
for (int i = 0; i < s.size() - 2; i++) {
ans = min(ans, abs(stoi(s.substr(i, 3)) - 753));
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 1,005,911 | 1,005,912 | u720447689 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 999;
for (int i = 0; i < N - 3; i++) {
int num = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(num - 754));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 999;
for (int i = 0; i < N - 2; i++) {
int num = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(num - 753));
}
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change"
] | 1,005,921 | 1,005,923 | u864785784 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 999;
for (int i = 0; i < N - 3; i++) {
int num = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(num - 753));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 999;
for (int i = 0; i < N - 2; i++) {
int num = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(num - 753));
}
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,925 | 1,005,923 | u864785784 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 999;
for (int i = 0; i < s.size() - 3; i++) {
int num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ans = min(ans, abs(num - 753));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 999;
for (int i = 0; i <= s.size() - 3; i++) {
int num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ans = min(ans, abs(num - 753));
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,931 | 1,005,933 | u225777148 | cpp |
p03211 | #include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define per(i, a, b) for (ll i = a; i >= b; i--)
using namespace std;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
int main() {
string s;
cin >> s;
int num = (s[0] - '0') * 100 + (s[1] -... | #include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define per(i, a, b) for (ll i = a; i >= b; i--)
using namespace std;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
int main() {
string s;
cin >> s;
int num = (s[0] - '0') * 100 + (s[1] -... | [
"expression.operation.binary.add"
] | 1,005,939 | 1,005,941 | u847929893 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string s;
cin >> s;
int minm = 1e8;
for (int i = 2; i <= (int)s.size(); i++) {
int ans = (s[i - 2] - '0') * 100 + (s[i - 1] - '0') ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string s;
cin >> s;
int minm = 1e8;
for (int i = 2; i < (int)s.size(); i++) {
int ans = (s[i - 2] - '0') * 100 + (s[i - 1] - '0') *... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,947 | 1,005,949 | u188332959 | cpp |
p03211 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | [] | 1,005,950 | 1,005,954 | u605833494 | cpp |
p03211 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,005,955 | 1,005,956 | u151236434 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define fast_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\... | #include <bits/stdc++.h>
using namespace std;
#define fast_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,005,957 | 1,005,958 | u476305001 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 1000;
for (int i = 0; i < (int)S.size() - 3; i++) {
int num = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 1000;
for (int i = 0; i < (int)S.size() - 2; i++) {
int num = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,005,962 | 1,005,963 | u260525363 | cpp |
p03211 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pf(n) printf("%d\n", n)
typedef long long ll;
typedef pair<ll, ll> p;
const in... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pf(n) printf("%d\n", n)
typedef long long ll;
typedef pair<ll, ll> p;
const in... | [
"control_flow.loop.for.condition.change"
] | 1,005,985 | 1,005,987 | u770486670 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.