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;
int main() {
string s;
cin >> s;
long long ans = 1e9 + 7;
for (int i = 0; i < s.size() - 2; i++) {
int x = stoi(s.substr(i, i + 2));
ans = min(ans, llabs(x - 753));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long ans = 1e9 + 7;
for (int i = 0; i <= s.size() - 3; i++) {
int x = stoi(s.substr(i, 3));
ans = min(ans, llabs(x - 753));
// cout << x << endl;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.remove"
] | 1,006,476 | 1,006,477 | u735909278 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int value = 922337203685477580;
for (int i = 0; i < S.length() - 2; i++) {
int tmp = abs(753 - ((int(S[i]) - 48) * 100 + (int(S[i + 1]) - 48) * 10 +
in... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int value = 99999999;
for (int i = 0; i < S.length() - 2; i++) {
int tmp = abs(753 - ((int(S[i]) - 48) * 100 + (int(S[i + 1]) - 48) * 10 +
int(S[i + 2]... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,006,478 | 1,006,479 | u911222357 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
long long int value = 922337203685477580;
for (int i = 0; i < S.length(); i++) {
long long int tmp =
abs(753 - ((int(S[i]) - 48) * 100 + (int(S[i + 1]) - 48) * 10 +
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
long long int value = 922337203685477580;
for (int i = 0; i < S.length() - 2; i++) {
long long int tmp =
abs(753 - ((int(S[i]) - 48) * 100 + (int(S[i + 1]) - 48) * 10 +... | [
"control_flow.loop.for.condition.change"
] | 1,006,480 | 1,006,481 | u911222357 | cpp |
p03211 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1000;
int n = s.length();
for (int i = 0; i < n - 3; i++) {
int num = stoi(s.substr(i, 3));
ans = min(ans, abs(num - ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1000;
int n = s.length();
for (int i = 0; i <= n - 3; i++) {
int num = stoi(s.substr(i, 3));
ans = min(ans, abs(num -... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,485 | 1,006,486 | u143492911 | cpp |
p03211 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int deka = 10000;
int zettai = 0;
for (int i = 0; i < S.size() - 2; i++) {
zettai = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + (S[i + 2] - '0');
if (abs(zettai - 753) < deka) {
... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int deka = 10000;
int zettai = 0;
for (int i = 0; i < S.size() - 2; i++) {
zettai = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + (S[i + 2] - '0');
if (abs(zettai - 753) < deka) {
... | [
"call.add",
"call.arguments.add"
] | 1,006,487 | 1,006,488 | u041978507 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
int ans = 1e4;
for (int i = 0; i + 2 <= S.size(); i++) {
int tmp, res;
tmp = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + (S[i + 2... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
int ans = 1e4;
for (int i = 0; i + 3 <= S.size(); i++) {
int tmp, res;
tmp = (S[i] - '0') * 100 + (S[i + 1] - '0'... | [
"import.add",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,489 | 1,006,490 | u258183816 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int mind = 10000;
for (int i = 2; i < S.length(); i++) {
int h = S.at(i - 2) - '0';
int t = S.at(i - 1) - '0';
int o = S.at(i) - '0';
int sum = h * 100 + t * 10 + 0;
mind = min(abs(sum - 753), mind... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int mind = 10000;
for (int i = 2; i < S.length(); i++) {
int h = S.at(i - 2) - '0';
int t = S.at(i - 1) - '0';
int o = S.at(i) - '0';
int sum = h * 100 + t * 10 + o;
mind = min(abs(sum - 753), mind... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 1,006,498 | 1,006,499 | u166632863 | cpp |
p03211 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
int ans = 999;
cin >> s;
int n = s.size();
for (int i = 0; i < n - 2; ++i) {
int num = (s[i] - '0') * 100 + (s[i + 1] - '0') + s[i + 2] - '0';
ans = min(ans, abs(753 - num));
}
cout << ans << ... |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
int ans = 999;
cin >> s;
int n = s.size();
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(753 - num));
}
cout << an... | [
"assignment.change"
] | 1,006,500 | 1,006,501 | u734876600 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int 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 (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,502 | 1,006,503 | u139031151 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int a, b;
int ans = 1000;
for (int i = 0; i < s.size() - 2; i++) {
a = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + s[i + 2];
b = abs(a - 753);
ans = min(b, ans);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int a, b;
int ans = 1000;
for (int i = 0; i < s.size() - 2; i++) {
a = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
b = abs(a - 753);
ans = min(b, ans);
}
cout << ans << endl... | [] | 1,006,509 | 1,006,510 | u342051078 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 100000;
int now = s[0] - '0' + s[1] - '0';
for (int i = 2; i <= s.size(); i++) {
now = (s[i - 2] - '0') * 100 + (s[i - 1] - '0') * 10 + (s[i] - '0');
if (abs(now - 753) < ans)
ans = abs(now - ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 100000;
int now = s[0] - '0' + s[1] - '0';
for (int i = 2; i < s.size(); i++) {
now = (s[i - 2] - '0') * 100 + (s[i - 1] - '0') * 10 + (s[i] - '0');
if (abs(now - 753) < ans)
ans = abs(now - 7... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,511 | 1,006,512 | u990764614 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> list(S.size());
for (int i = 0; i < S.size(); i++) {
list.at(i) = S.at(i) - '0';
}
int mini = 700;
for (int i = 0; i < S.size() - 2; i++) {
int k;
int t;
k = S.at(i) * 100 + S.at(i + 1) * 10 + S.at(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> list(S.size());
for (int i = 0; i < S.size(); i++) {
list.at(i) = S.at(i) - '0';
}
int mini = 700;
for (int i = 0; i < S.size() - 2; i++) {
int k;
int t;
k = list.at(i) * 100 + list.at(i + 1) * 10 + ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,006,513 | 1,006,514 | u028061225 | cpp |
p03211 | #include <iostream>
using namespace std;
#include <string>
int abs(int n) {
if (n < 0)
n = n * -1;
return n;
}
int main() {
string S;
cin >> S;
int sz = S.size();
int min = 99999;
for (int i = 0; i < sz - 3; i++) {
string sbstr;
sbstr = S.substr(i, 3);
int num = atoi(sbstr.c_str());
... | #include <iostream>
using namespace std;
#include <string>
int abs(int n) {
if (n < 0)
n = n * -1;
return n;
}
int main() {
string S;
cin >> S;
int sz = S.size();
int min = 99999;
for (int i = 0; i <= sz - 3; i++) {
string sbstr;
sbstr = S.substr(i, 3);
int num = atoi(sbstr.c_str());
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,518 | 1,006,519 | u601575292 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin()... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin()... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,520 | 1,006,521 | u912359563 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long llong;
int main() {
char a[100];
int sizeofa, b[100];
cin >> a;
for (int i = 0;; i++) {
b[i] = a[i] - '0';
if (a[i] == '\... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long llong;
int main() {
char a[100];
int sizeofa, b[100];
cin >> a;
for (int i = 0;; i++) {
b[i] = a[i] - '0';
if (a[i] == '\... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,522 | 1,006,523 | u740232619 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int b, ans, c;
b = a.size();
ans = 1000000;
for (int i = 0; i < b - 2; i++) {
c = (a[i] - '0') * 100 + (a[i + 1] - '0') * 10 + a[i + 2] - '0';
ans = (ans, abs(753 - c));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int b, ans, c;
b = a.size();
ans = 1000000;
for (int i = 0; i < b - 2; i++) {
c = (a[i] - '0') * 100 + (a[i + 1] - '0') * 10 + a[i + 2] - '0';
ans = min(ans, abs(753 - c));
}
cout << ans << endl;
}
| [
"call.add"
] | 1,006,530 | 1,006,531 | u902787159 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 753;
int kari;
string s;
cin >> s;
size_t len = s.length();
for (int i = 0; i < len - 1; i++) {
kari = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
kari = abs(kari - 753);
if (kari < ans) {
ans = kari;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 753;
int kari;
string s;
cin >> s;
size_t len = s.length();
for (int i = 0; i < len - 2; i++) {
kari = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
kari = abs(kari - 753);
if (kari <= ans) {
ans = kari;... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,006,534 | 1,006,535 | u941284252 | cpp |
p03211 | #include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef long long ll;
#define pb push_back
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
int main() {
string S;
int N = S.size();
vector<int> s;
FOR(i, 0, N) s.pb(stoi(S.substr(i, 1)));
int ans = 753;
FOR(i, 0,... | #include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef long long ll;
#define pb push_back
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> s;
FOR(i, 0, N) s.pb(stoi(S.substr(i, 1)));
int ans = 753;... | [] | 1,006,546 | 1,006,547 | u508571192 | cpp |
p03211 | //
// main.cpp
// 20190810lesson
//
// Created by Priscilla Leang on 8/10/19.
// Copyright © 2019 Priscilla Leang. All rights reserved.
//
#include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int x, m, a, b, c, n;
int f;
bool b1 = false;
string s;
m = 753;
cin >> s;
for (... | //
// main.cpp
// 20190810lesson
//
// Created by Priscilla Leang on 8/10/19.
// Copyright © 2019 Priscilla Leang. All rights reserved.
//
#include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int x, m, a, b, c, n;
int f;
bool b1 = false;
string s;
m = 753;
cin >> s;
for (... | [
"assignment.variable.change",
"identifier.change",
"io.output.change"
] | 1,006,554 | 1,006,555 | u927572682 | cpp |
p03211 | //
// main.cpp
// 20190810lesson
//
// Created by Priscilla Leang on 8/10/19.
// Copyright © 2019 Priscilla Leang. All rights reserved.
//
#include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int x, m, a, b, c, n;
int f;
bool b1 = false;
string s;
m = 753;
cin >> s;
for (... | //
// main.cpp
// 20190810lesson
//
// Created by Priscilla Leang on 8/10/19.
// Copyright © 2019 Priscilla Leang. All rights reserved.
//
#include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int x, m, a, b, c, n;
int f;
bool b1 = false;
string s;
m = 753;
cin >> s;
for (... | [
"assignment.variable.change",
"identifier.change",
"io.output.change"
] | 1,006,556 | 1,006,555 | u927572682 | cpp |
p03211 | #include <iostream>
using namespace std;
int main() {
int a = 0, b, c, d, z[11], i;
string s;
getline(cin, s);
for (i = 0; i < 10; i++) {
if (49 <= s[i] + 0 <= 57) {
z[i] = s[i] - 48;
a++;
}
}
c = 1001;
for (i = 0; i < a - 2; i++) {
b = z[i] * 100 + z[i + 1] * 10 + z[i + 2] - 753;
... | #include <iostream>
using namespace std;
int main() {
int a = 0, b, c, d, z[11], i;
string s;
getline(cin, s);
for (i = 0; i < s.length(); i++) {
if (49 <= s[i] + 0 <= 57) {
z[i] = s[i] - 48;
a++;
}
}
c = 1001;
for (i = 0; i < a - 2; i++) {
b = z[i] * 100 + z[i + 1] * 10 + z[i + 2]... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 1,006,557 | 1,006,558 | u927572682 | cpp |
p03211 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a = 700;
string s;
cin >> s;
r(i, s.length() - 3) {
if (a > abs((s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0') -
753))
a = abs((s[i] - '0') * 100 + (s[i + 1] - '0'... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a = 700;
string s;
cin >> s;
r(i, s.length() - 2) {
if (a > abs((s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0') -
753))
a = abs((s[i] - '0') * 100 + (s[i + 1] - '0'... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,561 | 1,006,562 | u192280767 | cpp |
p03211 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void) {
int l, x[11], i, a, n;
char s[11];
cin >> s;
l = strlen(s);
n = 246;
for (i = 0; i < l; i++)
x[i] = s[i] - '0';
for (i = 0; i < l - 2; i++) {
a = x[i] * 100 + x[i + 1] * 10 + x[i + 2];
a = 753 - a;
... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void) {
int l, x[11], i, a, n;
char s[11];
cin >> s;
l = strlen(s);
n = 1000;
for (i = 0; i < l; i++)
x[i] = s[i] - '0';
for (i = 0; i < l - 2; i++) {
a = x[i] * 100 + x[i + 1] * 10 + x[i + 2];
a = 753 - a;
... | [
"literal.number.change",
"assignment.value.change"
] | 1,006,572 | 1,006,573 | u520011376 | cpp |
p03211 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void) {
int l, x[11], i, a, n;
char s[11];
cin >> s;
l = strlen(s);
n = 246;
for (i = 0; i < l; i++)
x[i] = s[i] - '0';
for (i = 0; i < l - 2; i++) {
a = x[i] * 100 + x[i + 1] * 10 + x[i + 2];
a = 753 - a;
... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void) {
int l, x[11], i, a, n;
char s[11];
cin >> s;
l = strlen(s);
n = 1000;
for (i = 0; i < l; i++)
x[i] = s[i] - '0';
for (i = 0; i < l - 2; i++) {
a = x[i] * 100 + x[i + 1] * 10 + x[i + 2];
a = 753 - a;
... | [
"literal.number.change",
"assignment.value.change"
] | 1,006,572 | 1,006,574 | u520011376 | cpp |
p03211 | #include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int a = 1000;
cin >> S;
for (int i = 0; i < S.size() - 3; i++) {
int MIN = min(a, abs(753 - stoi(S.substr(i, 3))));
a = abs(MIN);
}
cout << a << endl;
} | #include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int a = 1000;
cin >> S;
for (int i = 0; i < S.size() - 2; i++) {
int MIN = min(a, abs(753 - stoi(S.substr(i, 3))));
a = abs(MIN);
}
cout << a << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,582 | 1,006,583 | u840731541 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string X;
cin >> X;
int ans = 100000;
for (int i = 0; i <= X.size() - 3; i++) {
int MIN = min(ans, 753 - stoi(X.substr(i, 3)));
ans = abs(MIN);
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string X;
cin >> X;
int ans = 100000;
for (int i = 0; i <= X.size() - 3; i++) {
int MIN = min(ans, abs(753 - stoi(X.substr(i, 3))));
ans = abs(MIN);
}
cout << ans << endl;
} | [
"call.add",
"call.arguments.change"
] | 1,006,584 | 1,006,585 | u840731541 | cpp |
p03211 | #include <bits/stdc++.h>
#define REP(i, n) for (decltype(n) i = 0; i < n; i++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) std::sort(ALL(c))
#define RSORT(c) std::sort(ALL(c), std::greater<decltype(c)::value_type>())
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;
const int INF = (int... | #include <bits/stdc++.h>
#define REP(i, n) for (decltype(n) i = 0; i < n; i++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) std::sort(ALL(c))
#define RSORT(c) std::sort(ALL(c), std::greater<decltype(c)::value_type>())
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;
const int INF = (int... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,587 | 1,006,588 | u403800404 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int c = 1000;
for (int i = 0; i < a.size() - 1; i++) {
if (c > abs((a.at(i) - '0') * 100 + (a.at(i + 1) - '0') * 10 +
(a.at(i + 2) - '0') - 753))
c = abs((a.at(i) - '0') * 100 + (a.at(i + 1) - '0') * 10 +
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int c = 1000;
for (int i = 0; i < a.size() - 2; i++) {
if (c > abs((a.at(i) - '0') * 100 + (a.at(i + 1) - '0') * 10 +
(a.at(i + 2) - '0') - 753))
c = abs((a.at(i) - '0') * 100 + (a.at(i + 1) - '0') * 10 +
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,589 | 1,006,590 | u341447450 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int c = 1000;
for (int i = 0; i < a.size() - 2; i++) {
if (c > (a.at(i) - '0') * 100 + (a.at(i + 1) - '0') * 10 +
(a.at(i + 2) - '0') - 753)
c = abs((a.at(i) - '0') * 100 + (a.at(i + 1) - '0') * 10 +
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int c = 1000;
for (int i = 0; i < a.size() - 2; i++) {
if (c > abs((a.at(i) - '0') * 100 + (a.at(i + 1) - '0') * 10 +
(a.at(i + 2) - '0') - 753))
c = abs((a.at(i) - '0') * 100 + (a.at(i + 1) - '0') * 10 +
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 1,006,591 | 1,006,590 | u341447450 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int c = 1000;
for (int i = 0; i < a.size() - 1; i++) {
if (c >
(a.at(i) - '0') * 100 + (a.at(i + 1) - '0') * 10 + (a.at(i + 2) - '0'))
c = abs((a.at(i) - '0') * 100 + (a.at(i + 1) - '0') * 10 +
(a.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int c = 1000;
for (int i = 0; i < a.size() - 2; i++) {
if (c > abs((a.at(i) - '0') * 100 + (a.at(i + 1) - '0') * 10 +
(a.at(i + 2) - '0') - 753))
c = abs((a.at(i) - '0') * 100 + (a.at(i + 1) - '0') * 10 +
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.add"
] | 1,006,592 | 1,006,590 | u341447450 | cpp |
p03211 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(obj) (obj).begin, (obj).end()
#define SORT(list) s... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(obj) (obj).begin, (obj).end()
#define SORT(list) s... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,006,593 | 1,006,594 | u988076584 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF pow(10, 9)
int main(void) {
string s;
cin >> s;
ll ans = INF;
for (int i = 0; i < s.length() - 2; i++) {
ll tmp = 753 - stoi(s.substr(i, 3));
if (tmp < ans) {
ans = tmp;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF pow(10, 9)
int main(void) {
string s;
cin >> s;
ll ans = INF;
for (int i = 0; i < s.length() - 2; i++) {
ll tmp = abs(753 - stoi(s.substr(i, 3)));
if (tmp < ans) {
ans = tmp;
}
}
cout << ans << endl;
return... | [
"call.add",
"call.arguments.change"
] | 1,006,603 | 1,006,604 | u030848580 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int m = 753;
for (int i = 0; i < s.size() - 2; i++) {
m = min(m, stoi(s.substr(i, 3)));
}
cout << m << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int m = 753;
for (int i = 0; i < s.size() - 2; i++) {
m = min(m, abs(753 - stoi(s.substr(i, 3))));
}
cout << m << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 1,006,605 | 1,006,606 | u930561195 | cpp |
p03211 | // TOPSIC001_0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_l... | // TOPSIC001_0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_l... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,609 | 1,006,610 | u245710867 | cpp |
p03211 | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | [
"assignment.change"
] | 1,006,611 | 1,006,612 | u775507068 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int res = numeric_limits<int>::max();
for (int i = 0; i < S.size() - 3; i++) {
auto v = stoi(S.substr(i, 3));
res = min(res, abs(v - 753));
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int res = numeric_limits<int>::max();
for (int i = 0; i <= S.size() - 3; i++) {
auto v = stoi(S.substr(i, 3));
res = min(res, abs(v - 753));
}
cout << res << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,613 | 1,006,614 | u235057691 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
string s;
cin >> s;
int minv = INT32_MAX;
int check = 0;
for (int i = 0; i < (s.size() - 2); ++i) {
check = abs(753 - stoi(s.substr(i, 3)));
// cout << "7... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
string s;
cin >> s;
int minv = INT32_MAX;
int check = 0;
for (int i = 0; i < (s.size() - 2); ++i) {
check = abs(753 - stoi(s.substr(i, 3)));
if (minv > c... | [
"identifier.change",
"io.output.change"
] | 1,006,624 | 1,006,625 | u871841829 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
string s;
cin >> s;
int minv = INT32_MAX;
int check = 0;
for (int i = 0; i < (s.size() - 3); ++i) {
check = abs(753 - stoi(s.substr(i, 3)));
// cout << "7... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
string s;
cin >> s;
int minv = INT32_MAX;
int check = 0;
for (int i = 0; i < (s.size() - 2); ++i) {
check = abs(753 - stoi(s.substr(i, 3)));
if (minv > c... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 1,006,626 | 1,006,625 | u871841829 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
string s;
cin >> s;
int minv = INT32_MAX;
int check = 0;
for (int i = 0; i < s.size() - 2; ++i) {
check = abs(753 - stoi(s.substr(i, i + 2)));
if (minv > ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
string s;
cin >> s;
int minv = INT32_MAX;
int check = 0;
for (int i = 0; i < (s.size() - 2); ++i) {
check = abs(753 - stoi(s.substr(i, 3)));
if (minv > c... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 1,006,627 | 1,006,625 | u871841829 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
string s;
cin >> s;
int minv = INT32_MAX;
int check = 0;
for (int i = 0; i < s.size() - 3; ++i) {
check = abs(753 - stoi(s.substr(i, i + 3)));
if (minv > ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
string s;
cin >> s;
int minv = INT32_MAX;
int check = 0;
for (int i = 0; i < (s.size() - 2); ++i) {
check = abs(753 - stoi(s.substr(i, 3)));
if (minv > c... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 1,006,628 | 1,006,625 | u871841829 | cpp |
p03211 | #include <cstring>
#include <iostream>
#include <stdlib.h>
using namespace std;
int main(void) {
char x[256], str1, str2, str3;
int cmp, ans = 9999;
cin >> x;
for (int i = 0; i < strlen(x) - 2; i++) {
str1 = x[i];
str2 = x[i + 1];
str3 = x[i + 2];
cmp = (str1 - '0') * 100 + (str2 - '0') * 10 + (... | #include <cstring>
#include <iostream>
#include <stdlib.h>
using namespace std;
int main(void) {
char x[256], str1, str2, str3;
int cmp, ans = 9999;
cin >> x;
for (int i = 0; i < strlen(x) - 2; i++) {
str1 = x[i];
str2 = x[i + 1];
str3 = x[i + 2];
cmp = (str1 - '0') * 100 + (str2 - '0') * 10 + (... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 1,006,629 | 1,006,630 | u784849232 | cpp |
p03211 | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <cstring>
#include <iostream>
#include <map> // pair
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
... | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <cstring>
#include <iostream>
#include <map> // pair
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
... | [
"control_flow.loop.for.condition.change"
] | 1,006,634 | 1,006,635 | u276796245 | cpp |
p03211 | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define l... | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define l... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,647 | 1,006,648 | u662918817 | cpp |
p03211 | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define l... | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define l... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 1,006,649 | 1,006,648 | u662918817 | cpp |
p03211 | // https://atcoder.jp/contests/abc114/tasks/abc114_b
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
string s;
int d, ans;
ans = 1000;
cin >> s;
... | // https://atcoder.jp/contests/abc114/tasks/abc114_b
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
string s;
int d, ans;
ans = 10000;
cin >> s;
... | [
"literal.number.change",
"assignment.value.change",
"call.add",
"call.arguments.change"
] | 1,006,655 | 1,006,656 | u643912307 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a;
a = 1000;
for (int i = 0; i < s.size() - 2; i++) {
if (a > abs(753 - (s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 +
s.at(i + 2) - '0'))
a = abs(753 - ((s.at(i) - '0') * 100 + (s.at(i + 1) - '0'... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a;
a = 1000;
for (int i = 0; i < s.size() - 2; i++) {
if (a > abs(753 - ((s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 +
s.at(i + 2) - '0')))
a = abs(753 - ((s.at(i) - '0') * 100 + (s.at(i +... | [
"control_flow.branch.if.condition.change"
] | 1,006,663 | 1,006,664 | u322177979 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a;
a = 1000;
for (int i = 0; i < s.size() - 2; i++) {
if (a >
abs(s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 + s.at(i + 2) - '0')
a = abs(753 - ((s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 +
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a;
a = 1000;
for (int i = 0; i < s.size() - 2; i++) {
if (a > abs(753 - ((s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 +
s.at(i + 2) - '0')))
a = abs(753 - ((s.at(i) - '0') * 100 + (s.at(i +... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add"
] | 1,006,665 | 1,006,664 | u322177979 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int ans;
cin >> S;
for (int i = 0; i < S.length() - 2; i++) {
int A = stoi(S.substr(i, 3));
ans = min(abs(A - 753), ans);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int ans = 999;
cin >> S;
for (int i = 0; i < S.length() - 2; i++) {
int A = stoi(S.substr(i, 3));
ans = min(abs(A - 753), ans);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 1,006,669 | 1,006,670 | u710135612 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
string S;
int ans = 1e9;
for (int i = 0; i + 2 < S.size(); i++) {
string now = S.substr(i, 3);
ans = min(ans,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
string S;
cin >> S;
int ans = 1e9;
for (int i = 0; i + 2 < S.size(); i++) {
string now = S.substr(i, 3);
//... | [] | 1,006,677 | 1,006,678 | u980655160 | 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 t = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + s[i + 2] - '0';
ans = min(ans, abs(t - 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() - 2; i++) {
int t = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + s[i + 2] - '0';
ans = min(ans, abs(t - 753));
}
cout << ans << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,679 | 1,006,680 | u244626757 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int ans = 1000, temp, i;
string str;
cin >> str;
for (i = 0; i < str.size() - 3; i++) {
temp = abs((str.at(i) - 48) * 100 + (str.at(i + 1) - 48) * 10 +
(str.at(i + 2) - 48) - 753);
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int ans = 1000, temp, i;
string str;
cin >> str;
for (i = 0; i < str.size() - 2; i++) {
temp = abs((str.at(i) - 48) * 100 + (str.at(i + 1) - 48) * 10 +
(str.at(i + 2) - 48) - 753);
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,681 | 1,006,682 | u453235374 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans;
for (int i = 0; i < s.length() - 2; i++) {
string b = s.substr(i, 3);
int k = atoi(b.c_str());
ans = min(abs(753 - k), ans);
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1000;
for (int i = 0; i < s.length() - 2; i++) {
string b = s.substr(i, 3);
int k = atoi(b.c_str());
ans = min(abs(753 - k), ans);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 1,006,685 | 1,006,686 | u169639579 | cpp |
p03211 | #include <algorithm> // min
#include <cmath> // abs
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int num, ans = 999, c[10];
for (int i = 0; i <= N - 3; i++) {
num = (c[i] - '0') * 100 + (c[i + 1] - '0') * 10 + c[i + 2] - '0';
ans = min(ans, abs(num -... | #include <algorithm> // min
#include <cmath> // abs
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int num, ans = 999, c[10];
for (int i = 0; i <= N - 3; i++) {
num = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
ans = min(ans, abs(num -... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,006,691 | 1,006,692 | u821416900 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 100000;
for (int i = 0; i < s.size() - 3; i++) {
int a = stoi(s.substr(i, 3));
;
ans = min(ans, abs(753 - a));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 100000;
for (int i = 0; i < s.size() - 2; i++) {
int a = stoi(s.substr(i, 3));
;
ans = min(ans, abs(753 - a));
}
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,693 | 1,006,694 | u468647389 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0), cout.tie(0)
#define ll long long int
#define fr first
#define se second
#define all(v) v.begin... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0), cout.tie(0)
#define ll long long int
#define fr first
#define se second
#define all(v) v.begin... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,702 | 1,006,703 | u685338438 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
vector<int> a(S.length() - 2);
for (int i = 0; i < S.length() - 2; i++) {
a[i] = abs(753 - stoi(S.substr(i, 3)));
}
sort(a.begin(), a.end());
cout << a[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> a(S.length() - 2);
for (int i = 0; i < S.length() - 2; i++) {
a[i] = abs(753 - stoi(S.substr(i, 3)));
}
sort(a.begin(), a.end());
cout << a[0] << endl;
}
| [] | 1,006,711 | 1,006,712 | u593555034 | cpp |
p03211 | #include <bits/stdc++.h>
#include <cstring>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define PRINT(s) cout << s
#define PRINTS(s) cout << s << ' '
#define PRINTL(s) cout << s << endl
#define INF 2e9
#define ALL(v)... | #include <bits/stdc++.h>
#include <cstring>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define PRINT(s) cout << s
#define PRINTS(s) cout << s << ' '
#define PRINTL(s) cout << s << endl
#define INF 2e9
#define ALL(v)... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,715 | 1,006,716 | u069035678 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1000;
for (int i = 0; i < s.size() - 3; ++i) {
int tmp = atoi(s.substr(i, 3).c_str());
tmp = (tmp >= 753 ? tmp - 753 : 753 - tmp);
if (ans > tmp)
ans = tmp;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1000;
for (int i = 0; i < s.size() - 2; ++i) {
int tmp = atoi(s.substr(i, 3).c_str());
tmp = (tmp >= 753 ? tmp - 753 : 753 - tmp);
if (ans > tmp)
ans = tmp;
}
cout << ans << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,717 | 1,006,718 | u647474992 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
string x;
int a;
int ans = 999;
int num;
cin >> x;
a = x.length();
for (int i = 1; i <= a - 2; i++) {
num = stoi(x.substr(i, 3));
ans = min(ans, abs(753 - num));
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
string x;
int a;
int ans = 999;
int num;
cin >> x;
a = x.length();
for (int i = 0; i <= a - 2; i++) {
num = stoi(x.substr(i, 3));
ans = min(ans, abs(753 - num));... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,006,719 | 1,006,720 | u545674098 | cpp |
p03211 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 1,006,725 | 1,006,726 | u134810655 | 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 number = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
a = min(a, abs(number - 753));
}
cout << a;
} | #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 - 2; i++) {
int number = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
a = min(a, abs(number - 753));
}
cout << a;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,729 | 1,006,730 | u959539771 | 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 number = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
a = min(a, abs(number - 753));
cout << a;
}
} | #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 - 2; i++) {
int number = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
a = min(a, abs(number - 753));
}
cout << a;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,731 | 1,006,730 | u959539771 | 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 number = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
a = min(a, abs(number - 753));
cout << number;
}
} | #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 - 2; i++) {
int number = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
a = min(a, abs(number - 753));
}
cout << a;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 1,006,732 | 1,006,730 | u959539771 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum;
int m = 1000000;
int diff = '0';
cin >> s;
for (int i = 0; i < s.size(); i++) {
sum = (s[i] - diff) * 100 + (s[i + 1] - diff) * 10 + (s[i + 2] - diff);
int a = abs(753 - sum);
m = min(a, m);
}
cout << m << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum;
int m = 1000000;
int diff = '0';
cin >> s;
for (int i = 0; i < s.size() - 2; i++) {
sum = (s[i] - diff) * 100 + (s[i + 1] - diff) * 10 + (s[i + 2] - diff);
int a = abs(753 - sum);
m = min(a, m);
}
cout << m << endl... | [
"control_flow.loop.for.condition.change"
] | 1,006,733 | 1,006,734 | u691878051 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum;
int m = 1000;
int diff = '0';
cin >> s;
for (int i = 0; i < s.size(); i++) {
sum = (s[i] - diff) * 100 + (s[i + 1] - diff) * 10 + (s[i + 2] - diff);
int a = abs(753 - sum);
m = min(a, m);
}
cout << m << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sum;
int m = 1000000;
int diff = '0';
cin >> s;
for (int i = 0; i < s.size() - 2; i++) {
sum = (s[i] - diff) * 100 + (s[i + 1] - diff) * 10 + (s[i + 2] - diff);
int a = abs(753 - sum);
m = min(a, m);
}
cout << m << endl... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change"
] | 1,006,735 | 1,006,734 | u691878051 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string subS;
int ans = 753;
for (int i = 0; i < S.size() - 2; i++) {
subS = S.substr(i, 3);
ans = min(ans, abs(atoi(subS.c_str()) - 754));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string subS;
int ans = 753;
for (int i = 0; i < S.size() - 2; i++) {
subS = S.substr(i, 3);
ans = min(ans, abs(atoi(subS.c_str()) - 753));
}
cout << ans << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,752 | 1,006,753 | u651032293 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int m, ans, x, y, count = 10000;
for (int i = 0; i < s.size() - 3; i++) {
x = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
y = abs(753 - x);
if (y < count) {
ans =... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int m, ans, x, y, count = 10000;
for (int i = 0; i < s.size() - 2; i++) {
x = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
y = abs(753 - x);
if (y < count) {
ans =... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,754 | 1,006,755 | u127856129 | cpp |
p03211 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int i, ans = 100000000000, num, fav = 753;
string s;
cin >> s;
for (i = 1; i < s.length(); i++) {
num = stoi(s.substr(i, 3));
if (ans > abs(fav - num))
ans = abs(fav - num);
}
cout << ans;
}
| #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int i, ans = 100000000000, num, fav = 753;
string s;
cin >> s;
for (i = 0; i < s.length(); i++) {
num = stoi(s.substr(i, 3));
if (ans > abs(fav - num))
ans = abs(fav - num);
}
cout << ans;
}
| [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,006,758 | 1,006,759 | u205700197 | cpp |
p03211 | /*
Converted by scratch2cpp (https://github.com/yos1up/scratch2cpp).
*/
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "--" ... | /*
Converted by scratch2cpp (https://github.com/yos1up/scratch2cpp).
*/
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "--" ... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.condition.change"
] | 1,006,764 | 1,006,765 | u451598761 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int min;
for (int i = 0; i < S.size() - 2; i++) {
string num = S.substr(i, 3);
int ans = atoi(S.c_str());
ans = 753 - ans;
if (abs(ans) < min)
min = abs(ans);
}
cout << min << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int min = 1000;
for (int i = 0; i < S.size() - 2; i++) {
string num = S.substr(i, 3);
int ans = atoi(num.c_str());
ans = 753 - ans;
if (abs(ans) < min)
min = abs(ans);
}
cout << min << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.change",
"call.arguments.change"
] | 1,006,770 | 1,006,771 | u239087789 | cpp |
p03211 | #include "bits/stdc++.h"
using namespace std;
int main(void) {
string s;
cin >> s;
int ans = 753;
int n, diff;
for (int i = 0; i < s.length() - 3; ++i) {
n = stoi(s.substr(i, 3));
diff = abs(n - 753);
ans = min(ans, diff);
}
cout << ans;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main(void) {
string s;
cin >> s;
int ans = 753;
int n, diff;
for (int i = 0; i <= s.length() - 3; ++i) {
n = stoi(s.substr(i, 3));
diff = abs(n - 753);
ans = min(ans, diff);
}
cout << ans;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,772 | 1,006,773 | u700598037 | cpp |
p03211 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int x, z, ans;
ans = 1000;
while (s > 1000) {
x = s % 1000;
z = max(753 - x, x - 753);
s = s / 10;
ans = min(z, ans);
}
cout << ans << endl;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
long s;
cin >> s;
int x, z, ans;
ans = 999;
while (s > 99) {
x = s % 1000;
z = max(753 - x, x - 753);
s = s / 10;
ans = min(z, ans);
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.condition.change"
] | 1,006,789 | 1,006,788 | u189404681 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <regex>
#include <set>
#include <string>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i > (b); --i)
typedef long long ll;
int main() {
string S;
cin >> S;
int a[100];
int n = S.length();
F... | #include <algorithm>
#include <iostream>
#include <regex>
#include <set>
#include <string>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i > (b); --i)
typedef long long ll;
int main() {
string S;
cin >> S;
int a[100];
int n = S.length();
F... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,805 | 1,006,806 | u964246645 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define allof(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb push_back
#define exists(s, e) (s.find(e) != s.end())
#define INF 0x3f3f3f3f
#define endl '\n'
#define mp make_pair
#define watch(x) cout << (#x) << " is " << (x) << endl;
typedef pair<int... | #include <bits/stdc++.h>
using namespace std;
#define allof(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb push_back
#define exists(s, e) (s.find(e) != s.end())
#define INF 0x3f3f3f3f
#define endl '\n'
#define mp make_pair
#define watch(x) cout << (#x) << " is " << (x) << endl;
typedef pair<int... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,809 | 1,006,810 | u580635452 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define mst(a, i) memset(a, i, size... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define mst(a, i) memset(a, i, size... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,006,811 | 1,006,812 | u394634573 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int m(1000), t;
for (int i(0); i < S.length() - 3; ++i) {
t = abs(atoi(S.substr(i, 3).c_str()) - 753);
if (t < m)
m = t;
}
cout << m << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int m(1000), t;
for (int i(0); i < S.length() - 2; ++i) {
t = abs(atoi(S.substr(i, 3).c_str()) - 753);
if (t < m)
m = t;
}
cout << m << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,818 | 1,006,819 | u244832678 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 1000;
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(abs(753 - num)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 1000;
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(abs(753 - num... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,822 | 1,006,823 | u262733088 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int mi = 10e7;
cin >> s;
for (int a = 0; a < s.size() - 3; a++) {
int x = (s[a] - '0') * 100 + (s[a + 1] - '0')... | #include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int mi = 10e7;
cin >> s;
for (int a = 0; a <= s.size() - 3; a++) {
int x = (s[a] - '0') * 100 + (s[a + 1] - '0'... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,824 | 1,006,825 | u139300044 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int mi = 10e7;
cin >> s;
for (int a = 0; a < s.size() - 1; a++) {
int x = (s[a] - '0') * 100 + (s[a + 1] - '0')... | #include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
int mi = 10e7;
cin >> s;
for (int a = 0; a <= s.size() - 3; a++) {
int x = (s[a] - '0') * 100 + (s[a + 1] - '0'... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change"
] | 1,006,826 | 1,006,825 | u139300044 | 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; 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;
return 0;
}
| #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;
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 1,006,827 | 1,006,828 | u120826790 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int a, b = 999;
cin >> s;
for (int i = 0; i < s.size() - 3; i++) {
a = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
b = min(abs(753 - a), b);
}
cout << b << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int a, b = 999;
cin >> s;
for (int i = 0; i <= s.size() - 3; i++) {
a = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
b = min(abs(753 - a), b);
}
cout << b << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,833 | 1,006,834 | u464725395 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.size();
int ans = 999;
for (int i = 0; i <= len - 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;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.size();
int ans = 999;
for (int i = 0; i <= len - 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;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,843 | 1,006,844 | u999442989 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, n) repi(i, 0, n)
#define rerepi(i, a, b) for (int i = int(a) - 1; i >= b; --i)
#define rerep(i, n) rerepi(i, n, 0)
template ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, n) repi(i, 0, n)
#define rerepi(i, a, b) for (int i = int(a) - 1; i >= b; --i)
#define rerep(i, n) rerepi(i, n, 0)
template ... | [
"expression.operation.binary.remove",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,845 | 1,006,846 | u952022797 | cpp |
p03211 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
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(a... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
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(... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,847 | 1,006,848 | u974285535 | cpp |
p03211 | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int ans = 1000;
char b[11];
cin >> b;
int i = 0;
while (b[i + 2] != '\0') {
int x = b[i] - '0';
int y = b[i + 1] - '0';
int z = b[i + 2] - '0';
int num = x * 100 + y * 10 + z;
if (num >= 75... | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int ans = 1000;
char b[11];
cin >> b;
int i = 0;
while (b[i + 2] != '\0') {
int x = b[i] - '0';
int y = b[i + 1] - '0';
int z = b[i + 2] - '0';
int num = x * 100 + y * 10 + z;
if (num >= 75... | [
"identifier.change",
"io.output.change"
] | 1,006,858 | 1,006,859 | u033620890 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,860 | 1,006,861 | u239375815 | cpp |
p03211 | #include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int min = abs(753 - atoi(S.substr(0, 3).c_str()));
for (int i = 1; i < S.size() - 3; i++) {
if (abs(753 - atoi(S.substr(i, 3).c_str())) < min) {
min = abs(753 - atoi(S.substr(i, 3).c_str()))... | #include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int min = abs(753 - atoi(S.substr(0, 3).c_str()));
for (int i = 1; i < S.size() - 2; i++) {
// cout << min << endl;
if (abs(753 - atoi(S.substr(i, 3).c_str())) < min) {
min = abs(753 - a... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,868 | 1,006,869 | u570417673 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, a = 9999;
string s;
cin >> s;
for (i = 0; i < s.size() - 2; i++) {
n = (int)100 * (s[i] - '0') + 10 * (s[i] - '0') + (s[i] - '0');
a = min(a, abs(753 - n));
}
cout << a;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, a = 9999;
string s;
cin >> s;
for (i = 0; i < s.size() - 2; i++) {
n = (int)100 * (s[i] - '0') + 10 * (s[i + 1] - '0') + (s[i + 2] - '0');
a = min(a, abs(753 - n));
}
cout << a;
return 0;
} | [
"assignment.change"
] | 1,006,878 | 1,006,879 | u058348416 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
using namespace std;
signed main() {
int s;
int ans;
cin >> s;
for (; s > 100; s /= 10) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
using namespace std;
signed main() {
int s;
int ans = 753;
cin >> s;
for (; s > 100; s /= ... | [
"variable_declaration.value.change"
] | 1,006,882 | 1,006,883 | u783922005 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, ans;
cin >> a;
ans = abs(a % 1000 - 753);
for (int i = 10; i < 10000000000; i = i * 10) {
if (abs((a % (i * 1000) / i) - 753) < ans) {
ans = abs((a % (i * 1000) / i) - 753);
}
if (a / (i * 10000) == 0) {
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, ans;
cin >> a;
ans = abs(a % 1000 - 753);
for (long long i = 10; i < 10000000000000; i = i * 10) {
if (abs((a % (i * 1000) / i) - 753) < ans) {
ans = abs((a % (i * 1000) / i) - 753);
}
if (a / (i * 1000) == 0) {
bre... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,006,900 | 1,006,897 | u634967948 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
int main() {
string S;
ci... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
int main() {
string S;
ci... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,902 | 1,006,903 | u824337972 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begi... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,912 | 1,006,913 | u033602950 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppiii;
void solve() {
ll ret = 1e10;
string s;
cin >> s;
for (int i = 0; i + 3 <= s.size(); i++) {
ll curr = 0;
for (int a = 0; a < s.size(); a++) {
if (a >= i && a < i + 3)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppiii;
void solve() {
ll ret = 1e10;
string s;
cin >> s;
for (int i = 0; i + 3 <= s.size(); i++) {
ll curr = 0;
for (int a = 0; a < s.size(); a++) {
if (a >= i && a < i + 3) {
... | [] | 1,006,920 | 1,006,921 | u109256064 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i <= S.size() - 3; i++) {
int a = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + (S[i + 2] - '0');
ans = min(ans, abs(753 - a));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 753;
for (int i = 0; i <= S.size() - 3; i++) {
int a = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + (S[i + 2] - '0');
ans = min(ans, abs(753 - a));
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 1,006,924 | 1,006,925 | u401900157 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i <= S.size() - 3; i++) {
int a = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + (S[i + 2] - '0');
ans = min(ans, abs(753 - a));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 1000;
for (int i = 0; i <= S.size() - 3; i++) {
int a = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + (S[i + 2] - '0');
ans = min(ans, abs(753 - a));
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 1,006,924 | 1,006,926 | u401900157 | cpp |
p03211 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
int main() {
string S;
cin >> S;
int min = 99999;
for (int i = 0; i ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
int main() {
string S;
cin >> S;
int min = 99999;
for (int i = 0; i ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,937 | 1,006,938 | u928536113 | cpp |
p03211 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
string s;
cin >> s;
int n = s.length();
int ans = 1000;
for (int i = 0; i < n - 3; i++) {
int a = s[i] - '0';
int b = s[i + 1] - '0';
int c = s[i + 2] - '0';
int x = a * 100 + b * 10 + c;
ans = min(ans, abs(x -... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
string s;
cin >> s;
int n = s.length();
int ans = 1000;
for (int i = 0; i <= n - 3; i++) {
int a = s[i] - '0';
int b = s[i + 1] - '0';
int c = s[i + 2] - '0';
int x = a * 100 + b * 10 + c;
ans = min(ans, abs(x ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,939 | 1,006,940 | u043877190 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,944 | 1,006,945 | u685892567 | cpp |
p03211 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,948 | 1,006,949 | u511379665 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iostream>
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 << an... | #include <algorithm> // min
#include <cmath> // abs
#include <iostream>
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));
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,006,952 | 1,006,953 | u034810328 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.