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 <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,954 | 1,006,953 | u034810328 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
string s;
cin >> s;
int n = (int)s.size();
int ans = 1000000007;
for (int i = 0; i < n - 3; i++) {
string t = s.substr(i, 3);
ans = min(ans, (int)abs(753 - stoi(t)));
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
string s;
cin >> s;
int n = (int)s.size();
int ans = 1000000007;
for (int i = 0; i < n - 2; i++) {
string t = s.substr(i, 3);
ans = min(ans, (int)abs(753 - stoi(t)));
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,955 | 1,006,956 | u212904724 | cpp |
p03211 | #include <iostream>
using namespace std;
#include <string>
int main() {
string u;
int minTmp = 9999999;
cin >> u;
for (int i = 0; i < u.length() - 2; i++) {
int tmp = (u[i] - '0') * 100 + (u[i + 1] - '0') * 10 + (u[i] - '0') - 753;
minTmp = min(abs(tmp), minTmp);
}
cout << minTmp << endl;
retu... | #include <iostream>
using namespace std;
#include <string>
int main() {
string u;
int minTmp = 9999999;
cin >> u;
for (int i = 0; i < u.length() - 2; i++) {
int tmp =
(u[i] - '0') * 100 + (u[i + 1] - '0') * 10 + (u[i + 2] - '0') - 753;
minTmp = min(abs(tmp), minTmp);
}
cout << minTmp << e... | [
"assignment.change"
] | 1,006,959 | 1,006,960 | u981068718 | cpp |
p03211 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int max = 0;
for (int i = 0; i < s.size() - 3; i++) {
int a = 100 * (s[i] - '0') + 10 * (s[i + 1] - '0') + (s[i + 2] - ... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int max = 0;
for (int i = 0; i < s.size() - 2; i++) {
int a = 100 * (s[i] - '0') + 10 * (s[i + 1] - '0') + (s[i + 2] - ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,968 | 1,006,969 | u233626335 | cpp |
p03211 | #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
using namespace std;
string s;
int mypow(int a, int b, int c) {
if (b == 1)
return a % c;
if (b % 2)
return a * mypow(a, b - 1, c) % c;
int d = mypow(a, b... | #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
using namespace std;
string s;
int mypow(int a, int b, int c) {
if (b == 1)
return a % c;
if (b % 2)
return a * mypow(a, b - 1, c) % c;
int d = mypow(a, b... | [
"call.arguments.change"
] | 1,006,984 | 1,006,985 | u259210975 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
char s[15];
scanf("%s", s);
int len = strlen(s);
int ans = 100000000;
for (int i = 0; i <= len - 2; i++) {
int tp = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + s[i + 2] - '0';
ans = min(ans... | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
char s[15];
scanf("%s", s);
int len = strlen(s);
int ans = 100000000;
for (int i = 0; i <= len - 3; i++) {
int tp = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + s[i + 2] - '0';
ans = min(ans... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,988 | 1,006,989 | u442980709 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
const int target = 753;
int mindif = INT_MAX;
for (int i = 0; i < S.length() - 3; i++) {
int val = stoi(S.substr(i, 3));
int dif = abs(val - target);
if (dif < mindif)
mindif = dif;
}
cout << mindif << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
const int target = 753;
int mindif = INT_MAX;
for (int i = 0; i <= S.length() - 3; i++) {
int val = stoi(S.substr(i, 3));
int dif = abs(val - target);
if (dif < mindif)
mindif = dif;
}
cout << mindif << end... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,997 | 1,006,998 | u482092601 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,001 | 1,007,002 | u895971408 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,003 | 1,007,002 | u895971408 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int64_t x;
std::cin >> x;
int ret = INT_MAX;
while (x >= 999) {
ret = std::min(ret, abs(753 - int(x % 1000)));
x /= 10;
}
std::cout << ret;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int64_t x;
std::cin >> x;
int ret = INT_MAX;
while (x >= 100) {
ret = std::min(ret, abs(753 - int(x % 1000)));
x /= 10;
}
std::cout << ret;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.condition.change"
] | 1,007,008 | 1,007,009 | u478530879 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int64_t x;
std::cin >> x;
int ret = INT_MAX;
while (x > 999) {
ret = std::min(ret, abs(753 - int(x % 1000)));
x /= 10;
}
std::cout << ret;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int64_t x;
std::cin >> x;
int ret = INT_MAX;
while (x >= 100) {
ret = std::min(ret, abs(753 - int(x % 1000)));
x /= 10;
}
std::cout << ret;
return 0;
}
| [] | 1,007,010 | 1,007,009 | u478530879 | cpp |
p03211 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#in... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,015 | 1,007,016 | u543301644 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int value = 100000;
for (int i = 0; i < S.size() - 3; ++i) {
int n = (S[i] - '0');
n = n * 10 + S[i + 1] - '0';
n = ... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int value = 100000;
for (int i = 0; i < S.size() - 2; ++i) {
int n = (S[i] - '0');
n = n * 10 + (S[i + 1] - '0');
n ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,017 | 1,007,018 | u796069639 | cpp |
p03211 | #include "bits/stdc++.h"
using namespace std;
#define repr(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(... | #include "bits/stdc++.h"
using namespace std;
#define repr(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(... | [
"expression.operation.binary.remove"
] | 1,007,025 | 1,007,026 | u705085875 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR... | [
"expression.operation.binary.add"
] | 1,007,027 | 1,007,028 | u128676584 | cpp |
p03211 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <numeric>
#include <queue>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 2000000000
#define REP(i, b, n) for (int i = (b); i <... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <numeric>
#include <queue>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 2000000000
#define REP(i, b, n) for (int i = (b); i <... | [
"call.add",
"call.arguments.change"
] | 1,007,029 | 1,007,030 | u576712004 | cpp |
p03211 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 1,007,033 | 1,007,034 | u899220667 | cpp |
p03211 | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push_back
#define all(v) (v).begin(),... | #define debug_interval ','
#define dump_interval ' '
#define debug_toggle 1
//{
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INT_MAX LLONG_MAX
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define pb push_back
#define all(v) (v).begin(),... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.add"
] | 1,007,041 | 1,007,042 | u130196064 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size(), k = 1e8;
for (int i = 0; i < n - 3; i++) {
int ans = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
if (abs(ans - 753) < k)
k = abs(ans - 753);
}
printf("%d\n", k);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size(), k = 1e8;
for (int i = 0; i < n - 2; i++) {
int ans = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
if (abs(ans - 753) < k)
k = abs(ans - 753);
}
printf("%d\n", k);
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,043 | 1,007,044 | u439283029 | cpp |
p03211 | #include <stdio.h>
#include <string.h>
typedef long long ll;
using namespace std;
ll abs(ll a) { return a > 0 ? a : -a; }
int main(void) {
ll i, j, k, n, m, a, b, c, ans = 1e9;
char s[15];
scanf("%s", s);
for (i = 0; i < strlen(s) - 3; ++i) {
ll t = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] -... | #include <stdio.h>
#include <string.h>
typedef long long ll;
using namespace std;
ll abs(ll a) { return a > 0 ? a : -a; }
int main(void) {
ll i, j, k, n, m, a, b, c, ans = 1e9;
char s[15];
scanf("%s", s);
for (i = 0; i < strlen(s) - 2; ++i) {
ll t = (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,007,047 | 1,007,048 | u440920318 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
char s[100];
int a[110];
int main() {
scanf("%s", s);
int len = strlen(s);
for (int i = 0; i < len; i++)
a[i] = s[i] - '0';
int x = a[0] * 100 + a[1] * 10 + a[2];
int ans = abs(x - 753);
for (int i = 3; i < l... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
char s[100];
int a[110];
int main() {
scanf("%s", s);
int len = strlen(s);
for (int i = 0; i < len; i++)
a[i] = s[i] - '0';
int x = a[0] * 100 + a[1] * 10 + a[2];
int ans = abs(x - 753);
for (int i = 3; i < l... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 1,007,049 | 1,007,050 | u360800499 | cpp |
p03211 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int diff_min = 999;
for (int i = 0; i < s.size() - 2; i++) {
int d = stoi(s.substr(i, 3)) - 753;
if (abs(diff_min) > abs(d))
diff_min = d;
}
cout << diff_min << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int diff_min = 999;
for (int i = 0; i < s.size() - 2; i++) {
int d = stoi(s.substr(i, 3)) - 753;
if (abs(diff_min) > abs(d))
diff_min = d;
}
cout << abs(diff_min) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 1,007,053 | 1,007,054 | u091454649 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.size();
int x = 999;
for (int i = 0; i < n - 3; i++) {
int w = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + (S[i + 2] - '0');
x = min(x, abs(w - 753));
}
cout << x;
retur... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.size();
int x = 999;
for (int i = 0; i < n - 2; i++) {
int w = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + (S[i + 2] - '0');
x = min(x, abs(w - 753));
}
cout << x;
retur... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,068 | 1,007,069 | u540300321 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int mn;
for (int i = 0; i < s.size() - 2; i++) {
string t;
t += s[i];
t += s[i + 1];
t += s[i + 2];
if (mn > abs(753 - stoi(t))) {
mn = abs(753 - stoi(t));
}
}
cout << mn << endl;
re... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int mn = 1000;
for (int i = 0; i < s.size() - 2; i++) {
string t;
t += s[i];
t += s[i + 1];
t += s[i + 2];
if (mn > abs(753 - stoi(t)))
mn = abs(753 - stoi(t));
}
cout << mn << endl;
retu... | [
"variable_declaration.value.change"
] | 1,007,074 | 1,007,075 | u513736711 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int mn;
for (int i = 0; i < s.size() - 2; i++) {
string t;
t += s[i];
t += s[i + 1];
t += s[i + 2];
if (mn > abs(753 - stoi(t))) {
mn = abs(753 - stoi(t));
}
}
cout << mn << endl;
re... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int mn = 100000;
for (int i = 0; i < s.size() - 2; i++) {
string t;
t += s[i];
t += s[i + 1];
t += s[i + 2];
if (mn > abs(753 - stoi(t))) {
mn = abs(753 - stoi(t));
}
}
cout << mn << e... | [
"variable_declaration.value.change"
] | 1,007,074 | 1,007,076 | u513736711 | cpp |
p03211 | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
#define INF 1000
int main() {
string str;
cin >> str;
int min = INF;
for (int i = 0; i < str.size() - 2; i++) {
string tmp = str.substr(i, i + 2);
int x = atoi(tmp.c_str());
if (min > abs(753 - x))
... | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
#define INF 1000
int main() {
string str;
cin >> str;
int min = INF;
for (int i = 0; i < str.size() - 2; i++) {
string tmp = str.substr(i, 3);
int x = atoi(tmp.c_str());
if (min > abs(753 - x))
min ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,007,077 | 1,007,078 | u353464699 | cpp |
p03211 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1e9;
for (int i = 0; i < s.length() - 2; i++) {
ans = min(ans, abs(753 - stoi(s.substr(i + 1, 3))));
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1e9;
for (int i = 0; i < s.length() - 2; i++) {
ans = min(ans, abs(753 - stoi(s.substr(i, 3))));
}
cout << ans << endl;
return 0;
}
| [
"call.arguments.change"
] | 1,007,081 | 1,007,082 | u687548330 | cpp |
p03211 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int ans = 800;
for (int i = 0; i < l - 2; i++) {
int a = s[i] - '0';
int b = s[i + 1] - '0';
int c = s[i + 2] - '0';
int x = a * 100 + b * ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
int ans = 800;
for (int i = 0; i < l - 2; i++) {
int a = s[i] - '0';
int b = s[i + 1] - '0';
int c = s[i + 2] - '0';
int x = a * 100 + b * ... | [
"assignment.change"
] | 1,007,083 | 1,007,084 | u539485388 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int main() {
string S;
cin >> S;
int ans = -100;
for (int i = 0; i < S.size() - 3; i++) {
int tmp... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int main() {
string S;
cin >> S;
int ans = -100;
for (int i = 0; i < S.size() - 2; i++) {
int tmp... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,089 | 1,007,090 | u285598935 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long int
using namespace std;
int to_int(string s) { return atoi(s.c_str()); }
int main() {
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long int
using namespace std;
int to_int(string s) { return atoi(s.c_str()); }
int main() {
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,095 | 1,007,096 | u620059302 | cpp |
p03211 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,107 | 1,007,108 | u715750943 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
int x;
int minValue = 999;
int i;
constexpr long long pows[10] = {
1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000,
// 10000000000,
};
scanf("%d", &x);
for (i = 3; i < 11; i... | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
long long x;
int minValue = 999;
int i;
constexpr long long pows[11] = {
1, 10, 100, 1000, 10000, 100000,
1000000, 10000000, 100000000, 1000000000, 10000000000,
};
scanf("%ld... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"literal.string.change",
"call.arguments.change"
] | 1,007,122 | 1,007,121 | u051981922 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
long long x;
int minValue = 999;
int i;
constexpr long long pows[11] = {
1, 10, 100, 1000, 10000, 100000,
1000000, 10000000, 100000000, 1000000000, 10000000000,
};
scanf("%d"... | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
long long x;
int minValue = 999;
int i;
constexpr long long pows[11] = {
1, 10, 100, 1000, 10000, 100000,
1000000, 10000000, 100000000, 1000000000, 10000000000,
};
scanf("%ld... | [
"literal.string.change",
"call.arguments.change"
] | 1,007,123 | 1,007,121 | u051981922 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
long x;
int minValue = 999;
int i;
constexpr long long pows[11] = {
1, 10, 100, 1000, 10000, 100000,
1000000, 10000000, 100000000, 1000000000, 10000000000,
};
scanf("%d", &x)... | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
long long x;
int minValue = 999;
int i;
constexpr long long pows[11] = {
1, 10, 100, 1000, 10000, 100000,
1000000, 10000000, 100000000, 1000000000, 10000000000,
};
scanf("%ld... | [
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change"
] | 1,007,124 | 1,007,121 | u051981922 | cpp |
p03211 | #include <stdio.h>
#include <stdlib.h>
int main(int argc, char *argv[]) {
long long a;
int digits[10];
int len = 0;
int i;
int min = 1e9;
scanf("%d", &a);
while (a > 0) {
digits[len] = a % 10;
a /= 10;
len++;
}
for (i = 0; i < len - 2; i++) {
a = 100 * digits[len - 1 - i] + 10 * di... | #include <stdio.h>
#include <stdlib.h>
int main(int argc, char *argv[]) {
long long a;
int digits[10];
int len = 0;
int i;
int min = 1e9;
scanf("%lld", &a);
while (a > 0) {
digits[len] = a % 10;
a /= 10;
len++;
}
for (i = 0; i < len - 2; i++) {
a = 100 * digits[len - 1 - i] + 10 * ... | [
"literal.string.change",
"call.arguments.change"
] | 1,007,125 | 1,007,126 | u589756509 | cpp |
p03211 | #include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int len, ans, num;
char s[10];
cin >> s;
for (len = 0; s[len] != '\0'; len++) {
}
for (int i = 0; i < len - 2; i++) {
num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ans = min(ans, abs(... | #include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int len, ans = 114514810, num;
char s[10];
cin >> s;
for (len = 0; s[len] != '\0'; len++) {
}
for (int i = 0; i < len - 2; i++) {
num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ans = m... | [
"variable_declaration.value.change"
] | 1,007,146 | 1,007,147 | u890807039 | cpp |
p03211 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int min = 1000;
for (int i = 0; i < s.length() - 2; i++) {
int a = 100 * (s[i] - '0') + 10 * (s[i + 1] - '0') + (s[i + 2] - '0') - 754;
if (abs(a) < min) {
min = abs(a);
}
}
printf("%d\n", min);
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int min = 1000;
for (int i = 0; i < s.length() - 2; i++) {
int a = 100 * (s[i] - '0') + 10 * (s[i + 1] - '0') + (s[i + 2] - '0') - 753;
if (abs(a) < min) {
min = abs(a);
}
}
printf("%d\n", min);
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 1,007,150 | 1,007,151 | u214502450 | cpp |
p03211 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int min_d = 1000;
for (int i = 0; i < S.size() - 2; ++i) {
int X = stoi(S.substr(i, i + 3));
int d = X - 753;
if (d < 0)
d = -d;
if (d < min_d)
min_d = d;
}
cout << min_d << endl;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int min_d = 1000;
for (int i = 0; i < S.size() - 2; ++i) {
int X = stoi(S.substr(i, 3));
int d = X - 753;
if (d < 0)
d = -d;
if (d < min_d)
min_d = d;
}
cout << min_d << endl;
} | [
"expression.operation.binary.remove"
] | 1,007,157 | 1,007,158 | u521712919 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typede... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typede... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,160 | 1,007,161 | u254521846 | cpp |
p03211 | #include <iostream>
using namespace std;
const int INF = 1e9;
int fabs(int n) {
if (n >= 0)
return n;
else
return -n;
}
int min(int a, int b) {
if (a >= b)
return b;
else
return a;
}
main() {
string S;
cin >> S;
int n = 0;
do {
if (S[n] == 0)
break;
n++;
} while (n < 1... | #include <iostream>
using namespace std;
const int INF = 1e9;
int fabs(int n) {
if (n >= 0)
return n;
else
return -n;
}
int min(int a, int b) {
if (a >= b)
return b;
else
return a;
}
main() {
string S;
cin >> S;
int n = 0;
do {
if (S[n] == 0)
break;
n++;
} while (n < 1... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,164 | 1,007,165 | u975837479 | cpp |
p03211 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
long long int s;
scanf("%lld", &s);
long long int d[10];
long long int i, j, n;
for (i = 9; i > -1; i--) {
d[i] = s % 10;
s = s / 10;
}
// for(i=0;i<10;i++) {
// printf("%lld\n",d[i]);
//}
long long int diff = 99999999... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
long long int s;
scanf("%lld", &s);
long long int d[10];
long long int i, j, n;
for (i = 9; i > -1; i--) {
d[i] = s % 10;
s = s / 10;
}
// for(i=0;i<10;i++) {
// printf("%lld\n",d[i]);
//}
long long int diff = 99999999... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,007,166 | 1,007,167 | u636273931 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#defi... | [
"call.function.change",
"call.arguments.change"
] | 1,007,181 | 1,007,182 | u890870565 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#defi... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.function.change",
"call.arguments.change"
] | 1,007,183 | 1,007,182 | u890870565 | cpp |
p03211 | #include <iostream>
#include <string>
std::string str;
int ans = 0;
int main() {
std::cin >> str;
for (int i = 0; i < str.size() - 2; ++i) {
int x = std::stoi(str.substr(i, 3));
if (abs(ans - 753) > abs(x - 753))
ans = x;
}
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
#include <string>
std::string str;
int ans = 0;
int main() {
std::cin >> str;
for (int i = 0; i < str.size() - 2; ++i) {
int x = std::stoi(str.substr(i, 3));
if (abs(ans - 753) > abs(x - 753))
ans = x;
}
std::cout << abs(ans - 753) << std::endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 1,007,184 | 1,007,185 | u332570575 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
int main() {
string s;
cin >> s;
ll num = 0, ans = 1e9;
for (int i = 0; i < s.size() - 2; i++) {
num = 1;
for (int j = 0; j < 3; j++) {
ll yojo = s[i + j] - '0';
num += pow(10, 2 - j) * yojo;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
int main() {
string s;
cin >> s;
ll num = 0, ans = 1e9;
for (int i = 0; i < s.size() - 2; i++) {
num = 0;
for (int j = 0; j < 3; j++) {
ll yojo = s[i + j] - '0';
num += pow(10, 2 - j) * yojo;
... | [
"literal.number.change",
"assignment.value.change"
] | 1,007,186 | 1,007,187 | u774202056 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
typedef long long ll;
const int maxn = 1e9;
void read(int &xxxxx) { scanf("%d", &xxxxx); }
int main() {
char t[100];
cin >> t;
int l = strlen(t), minn = 100000;
rep(i, 0, l - 3) {
minn = min(minn, abs((t[i] - '0'... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
typedef long long ll;
const int maxn = 1e9;
void read(int &xxxxx) { scanf("%d", &xxxxx); }
int main() {
char t[100];
cin >> t;
int l = strlen(t), minn = 100000;
rep(i, 0, l - 2) {
minn = min(minn, abs((t[i] - '0'... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,188 | 1,007,189 | u892292299 | 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 ll long long
#d... | #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 ll long long
#d... | [
"expression.operation.binary.add"
] | 1,007,212 | 1,007,213 | u084968244 | cpp |
p03211 | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
using namespace ... | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
using namespace ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,228 | 1,007,229 | u422592877 | cpp |
p03211 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string x;
cin >> x;
int min = INT32_MAX;
for (int i = 0; i < x.size() - 3; i++) {
int sub = abs(stoi(x.substr(i, 3)) - 753);
if (sub < min)
min = sub;
}
cout << min... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string x;
cin >> x;
int min = INT32_MAX;
for (int i = 0; i < x.size() - 2; i++) {
int sub = abs(stoi(x.substr(i, 3)) - 753);
if (sub < min)
min = sub;
}
cout << min... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,236 | 1,007,237 | u901678655 | cpp |
p03211 | #include <iostream>
#include <string>
int main() {
std::string A;
std::cin >> A;
int B;
int C;
int D = 753;
for (int i = 0; i < A.size() - 3; i++) {
B = std::stoi(A.substr(i, 3));
if (B <= 753) {
C = 753 - B;
} else {
C = B - 753;
}
if (C < D) {
D = C;
}
}
... | #include <iostream>
#include <string>
int main() {
std::string A;
std::cin >> A;
int B;
int C;
int D = 1000;
for (int i = 0; i <= A.size() - 3; i++) {
B = std::stoi(A.substr(i, 3));
if (B <= 753) {
C = 753 - B;
} else {
C = B - 753;
}
if (C < D) {
D = C;
}
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,238 | 1,007,239 | u454803751 | cpp |
p03211 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x, chal = 0;
int min_diff = 10000000;
string s = "";
cin >> s;
int len = s.length();
for (int i = 0; i < len - 2; ++i) {
chal = stoi(s.substr(i, 3));
// cout << i << "回目は" << chal << "で" << abs(754-chal) <<... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x, chal = 0;
int min_diff = 10000000;
string s = "";
cin >> s;
int len = s.length();
for (int i = 0; i < len - 2; ++i) {
chal = stoi(s.substr(i, 3));
// cout << i << "回目は" << chal << "で" << abs(754-chal) <<... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,242 | 1,007,243 | u473234731 | cpp |
p03211 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x, chal = 0;
int min_diff = 10000000;
string s = "";
cin >> s;
int len = s.length();
for (int i = 0; i < len - 2; ++i) {
chal = stoi(s.substr(i, 3));
// cout << i << "回目は" << chal << "で" << abs(754-chal) <<... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x, chal = 0;
int min_diff = 10000000;
string s = "";
cin >> s;
int len = s.length();
for (int i = 0; i < len - 2; ++i) {
chal = stoi(s.substr(i, 3));
// cout << i << "回目は" << chal << "で" << abs(754-chal) <<... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 1,007,244 | 1,007,243 | u473234731 | cpp |
p03211 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
long ans = 99999;
while (n >= 1000) {
ans = min(ans, abs(n % 1000 - 753));
n /= 10;
}
cout << ans << endl;
return 0;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
long ans = 99999;
while (n >= 100) {
ans = min(ans, abs(n % 1000 - 753));
n /= 10;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.condition.change"
] | 1,007,246 | 1,007,247 | u090994275 | cpp |
p03211 | // Header Files {{{
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queu... | // Header Files {{{
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queu... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,007,248 | 1,007,249 | u702996070 | cpp |
p03211 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans;
int f = 0;
for (int i = 0; i < s.length(); i++) {
int p = 0;
for (int j = i; j < i + 3; j++) {
p = p * 10 + s[j] - '0';
}
if (f == 0) {
ans = fabs(p - 753);
f = 1;
} else {... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans;
int f = 0;
for (int i = 0; i < s.length() - 2; i++) {
int p = 0;
for (int j = i; j < i + 3; j++) {
p = p * 10 + s[j] - '0';
}
if (f == 0) {
ans = fabs(p - 753);
f = 1;
} el... | [
"control_flow.loop.for.condition.change"
] | 1,007,259 | 1,007,260 | u056043043 | cpp |
p03211 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans;
int f = 0;
for (int i = 0; i < s.length(); i += 3) {
int p = 0;
for (int j = i; j < i + 3; j++) {
p = p * 10 + s[j] - '0';
}
if (f == 0) {
ans = fabs(p - 753);
f = 1;
} els... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int ans;
int f = 0;
for (int i = 0; i < s.length() - 2; i++) {
int p = 0;
for (int j = i; j < i + 3; j++) {
p = p * 10 + s[j] - '0';
}
if (f == 0) {
ans = fabs(p - 753);
f = 1;
} el... | [
"control_flow.loop.for.condition.change"
] | 1,007,261 | 1,007,260 | u056043043 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
const int wbr = 753;
int main() {
long long s, m = 0;
cin >> s;
while (s > 100) {
m = min(m, abs(s % 1000 - 753));
s /= 10;
}
cout << m;
} | #include <bits/stdc++.h>
using namespace std;
const int wbr = 753;
int main() {
long long s, m = 1000000000;
cin >> s;
while (s > 100) {
m = min(m, abs(s % 1000 - 753));
s /= 10;
}
cout << m;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,007,262 | 1,007,263 | u463360790 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
vector<int> a;
rep(i, s.size() - 2) {
int x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
vector<int> a;
rep(i, s.size() - 2) {
int x... | [
"assignment.change"
] | 1,007,264 | 1,007,265 | u480831358 | cpp |
p03211 | // 754
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int abs(int n) {
if (n >= 0) {
return n;
}
return -n;
}
int calc(string s) {
int i = stoi(s);
return abs(i - 753);
}
int main() {
int res = 1000;
string input;
cin >> input;... | // 754
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int abs(int n) {
if (n >= 0) {
return n;
}
return -n;
}
int calc(string s) {
int i = stoi(s);
return abs(i - 753);
}
int main() {
int res = 1000;
string input;
cin >> input;... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,266 | 1,007,267 | u318345739 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ret = 1e9;
for (int i = 0; i < s.length() - 3; i++) {
int x = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ret = min(ret, abs(x - 753));
}
cout << ret;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ret = 760;
for (int i = 0; i <= s.length() - 3; i++) {
int x = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ret = min(ret, abs(x - 753));
}
cout << ret;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,268 | 1,007,269 | u275726913 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t = "753";
cin >> s;
int ans = 1e+9;
for (int i = 0; i <= s.size() - 3; i++) {
int tp = 0;
for (int j = 0; j < 3; j++) {
tp += (s[i + j] - t[j]) * pow(10, 2 - j);
}
ans = min(ans, tp);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t = "753";
cin >> s;
int ans = 1e+9;
for (int i = 0; i <= s.size() - 3; i++) {
int tp = 0;
for (int j = 0; j < 3; j++) {
tp += (s[i + j] - t[j]) * pow(10, 2 - j);
}
ans = min(ans, abs(tp));
}
cout << ans << endl;
}
| [
"call.add",
"call.arguments.change"
] | 1,007,270 | 1,007,271 | u798086274 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t = "753";
cin >> s;
int ans = 1e+9;
for (int i = 0; i <= s.size() - 3; i++) {
int tp = 0;
for (int j = 0; j < 3; j++) {
tp += abs(s[i + j] - t[j]) * pow(10, 2 - j);
}
ans = min(ans, tp);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t = "753";
cin >> s;
int ans = 1e+9;
for (int i = 0; i <= s.size() - 3; i++) {
int tp = 0;
for (int j = 0; j < 3; j++) {
tp += (s[i + j] - t[j]) * pow(10, 2 - j);
}
ans = min(ans, abs(tp));
}
cout << ans << endl;
}
| [
"call.add",
"call.arguments.change"
] | 1,007,272 | 1,007,271 | u798086274 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int toVal(string s) {
int ret = 0;
ret += (s[0] - '0') * 100;
ret += (s[1] - '0') * 10;
ret += (s[2] - '0') * 1;
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("input.txt", "rt", stdin);
string s;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int toVal(string s) {
int ret = 0;
ret += (s[0] - '0') * 100;
ret += (s[1] - '0') * 10;
ret += (s[2] - '0') * 1;
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("input.txt", "rt", stdin);
string s;
c... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change"
] | 1,007,273 | 1,007,274 | u257960005 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int minval = 1000;
for (int i = 0; i < (S.size() - 3); i++) {
int x = 100 * (S[i] - '0') + 10 * (S[i + 1] - '0') + (S[i + 2] - '0');
minval = min(minval, abs(x - 753));
}
cout << minval ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int minval = 1000;
for (int i = 0; i < (S.size() - 2); i++) {
int x = 100 * (S[i] - '0') + 10 * (S[i + 1] - '0') + (S[i + 2] - '0');
minval = min(minval, abs(x - 753));
}
cout << minval ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,279 | 1,007,280 | u467763786 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int i = k; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define vi vector<int>
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begi... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int i = k; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define vi vector<int>
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begi... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,281 | 1,007,282 | u381585104 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define endl '\n'
#define MAX
typedef long long ll;
typedef pair<int, int> pii;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define endl '\n'
#define MAX
typedef long long ll;
typedef pair<int, int> pii;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,283 | 1,007,284 | u045505231 | cpp |
p03211 | #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1e9;
for (int i = 0; i < s.size() - 3; i++)
ans = min(ans, abs(753 - stoi(s.substr(i, 3))));
cout << ans << endl;
return 0;
}
| #include <assert.h>
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1e9;
for (int i = 0; i < s.size() - 2; i++)
ans = min(ans, abs(753 - stoi(s.substr(i, 3))));
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,285 | 1,007,286 | u623115612 | cpp |
p03211 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
char in[20];
int min;
cin >> in;
min = 999;
int j = 0;
int hoge;
while (in[j + 3] != '\0') {
hoge = 753 -
((in[j] - '0') * 100 + (in[j + 1] - '0') * 10 + (in[j + 2] - '0'));
if (hoge < 0)
hoge = hoge * (-1);... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
char in[20];
int min;
cin >> in;
min = 999;
int j = 0;
int hoge;
while (in[j + 2] != '\0') {
hoge = 753 -
((in[j] - '0') * 100 + (in[j + 1] - '0') * 10 + (in[j + 2] - '0'));
if (hoge < 0)
hoge = hoge * (-1);... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.loop.condition.change"
] | 1,007,297 | 1,007,298 | u902428263 | cpp |
p03211 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
int main() {
string S;
cin >> S;
int ans = 1 << 30;
for (int i = 0; i + 3 < S.size(); i++) {
string x = S.substr(i, 3);
ans = min(ans, abs(atoi(x... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
int main() {
string S;
cin >> S;
int ans = 1 << 30;
for (int i = 0; i + 3 <= S.size(); i++) {
string x = S.substr(i, 3);
ans = min(ans, abs(atoi(... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,299 | 1,007,300 | u243961437 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int n = str.length();
int minx = 1000;
for (int i = 0; i < n - 3; i++) {
string tmp = str.substr(i, 3);
int tmp2 = stoi(tmp);
int tmp3 = abs(753 - tmp2);
minx = min(minx, tmp3);
}
cout << minx << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int n = str.length();
int minx = 1000;
for (int i = 0; i < n - 2; i++) {
string tmp = str.substr(i, 3);
int tmp2 = stoi(tmp);
int tmp3 = abs(753 - tmp2);
minx = min(minx, tmp3);
}
cout << minx << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,302 | 1,007,303 | u148968106 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string.h>
#define maxn 10005
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI 3.1415926
using namespace std;
typedef long long ll;
int main() {
// freopen("Test.txt", "r", stdin);
char s[11... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string.h>
#define maxn 10005
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI 3.1415926
using namespace std;
typedef long long ll;
int main() {
// freopen("Test.txt", "r", stdin);
char s[11... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,304 | 1,007,305 | u438719133 | cpp |
p03211 | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "ctime"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unor... | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "ctime"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unor... | [
"assignment.change"
] | 1,007,308 | 1,007,309 | u468700753 | cpp |
p03211 | /*
Author : shah_entrance
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll i, ascii1, ascii2, ascii3, num, res = 100000, n = 753, count = 0;
string str;
cin >> str;
for (i = 0; i < str.length(); i++) {
ascii1 = str[i] - 48;
ascii2 = str[i + 1] - 48;
ascii3 =... | /*
Author : shah_entrance
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll i, x, ascii1, ascii2, ascii3, num, res = 100000, n = 753, count = 0;
string str;
cin >> str;
for (i = 0; i < (str.length() - 2); i++) {
ascii1 = str[i] - 48;
ascii2 = str[i + 1] - 48;
... | [
"variable_declaration.add",
"control_flow.loop.for.condition.change"
] | 1,007,336 | 1,007,337 | u656753546 | cpp |
p03211 | #include <iostream>
#include <math.h>
#include <string>
int main() {
int x[10] = {};
int h = 753;
std::string s;
std::cin >> s;
for (int i = 0; i < s.size(); i++) {
x[i] = s[i] - '0';
}
for (int i = 0; i < 10 && i < s.size(); i++) {
if (abs(753 - (x[i] * 100 + x[i + 1] * 10 + x[i + 2])) < h) {
... | #include <iostream>
#include <math.h>
#include <string>
int main() {
int x[10] = {};
int h = 753;
std::string s;
std::cin >> s;
for (int i = 0; i < s.size(); i++) {
x[i] = s[i] - '0';
}
for (int i = 0; i < 11 && i < s.size() - 2; i++) {
if (abs(753 - (x[i] * 100 + x[i + 1] * 10 + x[i + 2])) < h)... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,349 | 1,007,350 | u344810256 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, res = 1432214;
string s;
cin >> s;
n = s.size();
for (int i = 0; i < n - 3; i++) {
int sum = 0;
for (int j = 0; j < 3; j++) {
sum *= 10;
sum += s[i + j] - '0';
}
res = min(res, abs(753 - sum));
}
// for(int i=0;i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, res = 1432214;
string s;
cin >> s;
n = s.size();
for (int i = 0; i <= n - 3; i++) {
int sum = 0;
for (int j = 0; j < 3; j++) {
sum *= 10;
sum += s[i + j] - '0';
}
res = min(res, abs(753 - sum));
}
// for(int i=0;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,355 | 1,007,356 | u547457320 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
string in;
cin >> in;
int ans = 1000;
for (int i = 0; i < in.size() - 3; i++) {
int sub;
sub = stoi(in.substr(i, 3));
ans = min(ans, abs(753 - sub));
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
string in;
cin >> in;
int ans = 1000;
for (int i = 0; i <= in.size() - 3; i++) {
int sub;
sub = stoi(in.substr(i, 3));
ans = min(ans, abs(753 - sub));
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,357 | 1,007,358 | u870092796 | cpp |
p03211 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,359 | 1,007,360 | u628047647 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main(void) {
string s;
cin >> s;
int ans = 10000;
for (int i = 0; i < s.size() - 3; ++i) {
int t = (s[i] - '0') * 1... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main(void) {
string s;
cin >> s;
int ans = 10000;
for (int i = 0; i < s.size() - 2; ++i) {
int t = (s[i] - '0') * 1... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,363 | 1,007,364 | u181719868 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int a = 0;
int b = 10000;
for (int i = 0; i < n - 2; i++) {
a = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + s[i + 2] - '0';
b = min(a, b);
}
cout << b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int a = 0;
int b = 10000;
for (int i = 0; i < n - 2; i++) {
a = abs((s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + s[i + 2] - '0' - 753);
b = min(a, b);
}
cout << b << endl;
}
| [
"call.add",
"call.arguments.add"
] | 1,007,371 | 1,007,372 | u685726857 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#define inf 1e9
#define re register
#define ll long long
#define Flj(i, a, b) for (int i = (a); i; i = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#define inf 1e9
#define re register
#define ll long long
#define Flj(i, a, b) for (int i = (a); i; i = ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"assignment.value.change"
] | 1,007,373 | 1,007,374 | u330078242 | cpp |
p03211 | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
char sub[4];
int i;
int subNumber;
int remain;
int minRemain = 999999999;
cin >> s;
for (i = 0; i < s.length() - 3; i++) {
sub[0] = s[i];
sub[1] = s[i + 1];
sub[2] = s[i ... | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
char sub[4];
int i;
int subNumber;
int remain;
int minRemain = 999999999;
cin >> s;
for (i = 0; i < s.length() - 2; i++) {
sub[0] = s[i];
sub[1] = s[i + 1];
sub[2] = s[i ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,375 | 1,007,376 | u634135595 | cpp |
p03211 | #include <iostream>
using namespace std;
int main() {
char InpS[11];
string S;
int ans = 999;
for (int i = 0; i < 11; i++) {
InpS[i] = NULL;
}
cin >> InpS;
S = InpS;
for (uint16_t i = 1; i <= S.length() - 3; i++) {
int c;
c = abs(atoi(S.substr(i, 3).c_str()) - 753);
if (ans > c)
... | #include <iostream>
using namespace std;
int main() {
char InpS[11];
string S;
int ans = 999;
for (int i = 0; i < 11; i++) {
InpS[i] = NULL;
}
cin >> InpS;
S = InpS;
for (uint16_t i = 0; i <= S.length() - 3; i++) {
int c;
c = abs(atoi(S.substr(i, 3).c_str()) - 753);
if (ans > c)
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,007,377 | 1,007,378 | u386119132 | cpp |
p03211 | #include <cmath>
#include <iostream>
#include <string>
#include <typeinfo>
using namespace std;
int main() {
string s;
cin >> s;
int min = 200;
for (int i = 0; i < s.size() - 2; i++) {
int a =
(int(s[i]) - 48) * 100 + (int(s[i + 1]) - 48) * 10 + int(s[i + 2]) - 48;
if (abs(753 - a) < min) {
... | #include <cmath>
#include <iostream>
#include <string>
#include <typeinfo>
using namespace std;
int main() {
string s;
cin >> s;
int min = 10000;
for (int i = 0; i < s.size() - 2; i++) {
int a =
(int(s[i]) - 48) * 100 + (int(s[i + 1]) - 48) * 10 + int(s[i + 2]) - 48;
if (abs(753 - a) < min) {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,007,379 | 1,007,380 | u402453211 | cpp |
p03211 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
u... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
u... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,384 | 1,007,385 | u050865477 | cpp |
p03211 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utili... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utili... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,388 | 1,007,389 | u657901243 | cpp |
p03211 | #include <bits/stdc++.h>
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int iy[] = {0, 0, 1, -1};... | #include <bits/stdc++.h>
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int iy[] = {0, 0, 1, -1};... | [
"assignment.change"
] | 1,007,394 | 1,007,395 | u420071596 | cpp |
p03212 | #include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
using namespace std;
int64_t n357[3] = {3, 5, 7};
int64_t Make(int rest, string num, bool has3, bool has5, bool has7, int64_t N) {
if (rest == 0) {
if (has3 && has5 && has7 && stoll(num) < N) {
return 1;
}
return 0;
}
i... | #include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
using namespace std;
int64_t n357[3] = {3, 5, 7};
int64_t Make(int rest, string num, bool has3, bool has5, bool has7, int64_t N) {
if (rest == 0) {
if (has3 && has5 && has7 && stoll(num) <= N) {
return 1;
}
return 0;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,398 | 1,007,399 | u762603420 | cpp |
p03212 | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = ... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = ... | [
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,007,400 | 1,007,401 | u211255607 | cpp |
p03212 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const long long bound = 1000000000LL;
vector<long long> arr;
void dfs(long long cur, bool f3, bool f5, bool f7) {
if (f3 && f5 && f7)
arr.push_back(cur);
if (cur > bound)
... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const long long bound = 1000000000LL;
vector<long long> arr;
void dfs(long long cur, bool f3, bool f5, bool f7) {
if (f3 && f5 && f7)
arr.push_back(cur);
if (cur > bound)
... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 1,007,412 | 1,007,413 | u018679195 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define newline cout << "\n"
#define deb(x) cout << #x << " " << x << endl;
template <typename... T> void read(T &...args) { ((cin >> args), ...); }
template <typename... T> void write(T... args) { ((cout << args << " "), ...); }
void printarr(ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define newline cout << "\n"
#define deb(x) cout << #x << " " << x << endl;
template <typename... T> void read(T &...args) { ((cin >> args), ...); }
template <typename... T> void write(T... args) { ((cout << args << " "), ...); }
void printarr(ve... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,421 | 1,007,422 | u151251720 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define newline cout << "\n"
#define deb(x) cout << #x << " " << x << endl;
template <typename... T> void read(T &...args) { ((cin >> args), ...); }
template <typename... T> void write(T... args) { ((cout << args << " "), ...); }
void printarr(ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define newline cout << "\n"
#define deb(x) cout << #x << " " << x << endl;
template <typename... T> void read(T &...args) { ((cin >> args), ...); }
template <typename... T> void write(T... args) { ((cout << args << " "), ...); }
void printarr(ve... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 1,007,423 | 1,007,422 | u151251720 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
void fnInput(string &rsMaxNum) { cin >> rsMaxNum; }
int fnDgtDP(string sMaxNum) {
// dp[nPos][nSmall][nFlag] := nPos : 上位 nPos 桁目まで決定
// nSmall: small(数字を自由に選べる)か
// nFlag : 上位 nPos 桁までで {3,5,7}
// ... | #include <bits/stdc++.h>
using namespace std;
void input(string &rsMaxNum) { cin >> rsMaxNum; }
int digitDp(string sMaxNum) {
// dp[nPos][nSmall][nFlag] := nPos : 上位 nPos 桁目まで決定
// nSmall: small(数字を自由に選べる)か
// nFlag : 上位 nPos 桁までで {3,5,7}
// ... | [
"identifier.change",
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"call.function.change",
"io.output.change"
] | 1,007,427 | 1,007,428 | u439912527 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
void fnInput(string &rsMaxNum) { cin >> rsMaxNum; }
int fnDgtDP(string sMaxNum) {
// dp[nPos][nSmall][nFlag] := nPos : 上位 nPos 桁目まで決定
// nSmall: small(数字を自由に選べる)か
// nFlag : 上位 nPos 桁までで {3,5,7}
// ... | #include <bits/stdc++.h>
using namespace std;
void fnInput(string &rsMaxNum) { cin >> rsMaxNum; }
int fnDgtDP(string sMaxNum) {
// dp[nPos][nSmall][nFlag] := nPos : 上位 nPos 桁目まで決定
// nSmall: small(数字を自由に選べる)か
// nFlag : 上位 nPos 桁までで {3,5,7}
// ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 1,007,427 | 1,007,429 | u439912527 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
void fnInput(string &rsMaxNum) { cin >> rsMaxNum; }
int fnDgtDP(string sMaxNum) {
// dp[nPos][nSmall][nFlag] := nPos : 上位 nPos 桁目まで決定
// nSmall: small(数字を自由に選べる)か
// nFlag : 上位 nPos 桁までで {3,5,7}
// ... | #include <bits/stdc++.h>
using namespace std;
void fnInput(string &rsMaxNum) { cin >> rsMaxNum; }
int fnDgtDP(string sMaxNum) {
// dp[nPos][nSmall][nFlag] := nPos : 上位 nPos 桁目まで決定
// nSmall: small(数字を自由に選べる)か
// nFlag : 上位 nPos 桁までで {3,5,7}
// ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 1,007,427 | 1,007,431 | u439912527 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<"... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<"... | [
"literal.number.change",
"call.arguments.change"
] | 1,007,448 | 1,007,449 | u517348254 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
template <typename T> string ToString(const T &n) {
ostringstream stm;
stm << n;
return stm.str();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
vector<int> a = {
357, 375, 537, 573, ... | #include <bits/stdc++.h>
using namespace std;
template <typename T> string ToString(const T &n) {
ostringstream stm;
stm << n;
return stm.str();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
vector<int> a = {
357, 375, 537, 573, ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,452 | 1,007,453 | u686962993 | cpp |
p03212 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using vv = vector<v>;
int main() {
ll n;
cin >> n;
queue<ll> q;
vector<int> a = {3, 5, 7};
q.push(3);
q.push(5);
q.push(7);
int ans = 0;
while (q.front() < n... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using vv = vector<v>;
int main() {
int n;
cin >> n;
queue<ll> q;
vector<int> a = {3, 5, 7};
q.push(3);
q.push(5);
q.push(7);
int ans = 0;
while (q.front() <=... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,007,458 | 1,007,459 | u759987571 | cpp |
p03212 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using vv = vector<v>;
int main() {
int n;
cin >> n;
queue<ll> q;
vector<int> a = {3, 5, 7};
q.push(3);
q.push(5);
q.push(7);
int ans = 0;
while (q.front() < ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using v = vector<int>;
using vv = vector<v>;
int main() {
int n;
cin >> n;
queue<ll> q;
vector<int> a = {3, 5, 7};
q.push(3);
q.push(5);
q.push(7);
int ans = 0;
while (q.front() <=... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,007,460 | 1,007,459 | u759987571 | cpp |
p03212 | #include <bits/stdc++.h>
typedef long long ll;
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
const double PI = 3.14159265358979323846;
using namespace std;
int ans = 0;
ll goal;
bool is(ll a) {
int f[3] = {0, 0, 0};
string s = to_string(a);
re... | #include <bits/stdc++.h>
typedef long long ll;
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
const double PI = 3.14159265358979323846;
using namespace std;
int ans = 0;
ll goal;
bool is(ll a) {
int f[3] = {0, 0, 0};
string s = to_string(a);
re... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,461 | 1,007,462 | u566084784 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int cnt = 0;
int n;
void dfs(string num) {
if (stoi(num) <= n) {
bool three = false, five = false, seven = false;
rep(i, num.lengt... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int cnt = 0;
int n;
void dfs(string num) {
if (stoll(num) <= n) {
bool three = false, five = false, seven = false;
rep(i, num.leng... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,007,467 | 1,007,468 | u509420256 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.