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>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespac... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespac... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 1,005,989 | 1,005,991 | u866535689 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> ... | [
"call.arguments.change"
] | 1,005,997 | 1,005,999 | u886310677 | cpp |
p03211 | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int fn(long long x, long long y, long long z) {
return x * x +... | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int fn(long long x, long long y, long long z) {
return x * x +... | [
"call.arguments.change"
] | 1,006,007 | 1,006,009 | u794274928 | cpp |
p03211 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#de... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#de... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,019 | 1,006,023 | u125669112 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int c = 1000;
while (s >= 1000) {
int a = s % 1000;
int b = abs(a - 753);
c = min(c, b);
s /= 10;
}
cout << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int_fast64_t s;
cin >> s;
int c = 1000;
while (s >= 100) {
int a = s % 1000;
int b = abs(a - 753);
c = min(c, b);
s /= 10;
}
cout << c << endl;
} | [
"variable_declaration.type.change",
"literal.number.change",
"control_flow.loop.condition.change"
] | 1,006,074 | 1,006,071 | u823790438 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
string s, t = "";
cin >> s;
int ans = 999;
rep(i, s.size() - 2) {
t += s[i] + s[i + 1] +... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
string s, t = "";
cin >> s;
int ans = 999;
rep(i, s.size() - 2) {
t += s[i];
t += s[... | [
"expression.operation.binary.change",
"assignment.change"
] | 1,006,076 | 1,006,078 | u534923072 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1000;
for (int i = 0; s.size() - 2; i++) {
int num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ans = min(ans, abs(num - 753));
}
cout << ans << endl;
} | #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 num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ans = min(ans, abs(num - 753));
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change"
] | 1,006,084 | 1,006,085 | u176218583 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
string s;
cin >> s;
int yoy = 123467;
for (int i = 0; i < s.length() - 3; i++) {
string game;
game += s[i];
game += s[i + 1];
game += s[i + 2];
int diff;
diff = stoi(game);
if (abs(753 - diff) < yoy)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
string s;
cin >> s;
int yoy = 123467;
for (int i = 0; i <= s.length() - 3; i++) {
string game;
game += s[i];
game += s[i + 1];
game += s[i + 2];
int diff;
diff = stoi(game);
if (abs(753 - diff) < yoy... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,088 | 1,006,089 | u489372131 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int dis = 1000000;
string str = S;
for (int i = 0; i < S.size(); i++) {
str = S;
str.substr(i, 3);
int num;
num = stoi(str);
if (dis > abs(753 - num)) {
dis = abs(753 - num);
}
}
cout << dis <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int dis = 1000000;
string str = S;
for (int i = 0; i < S.size(); i++) {
str = S;
string substr = str.substr(i, 3);
int num;
num = stoi(substr);
if (dis > abs(753 - num)) {
dis = abs(753 - num);
}
... | [
"variable_declaration.add",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,006,092 | 1,006,093 | u109191542 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int min1 = 1000;
for (int i = 0; i < s.size() - 2; i++) {
int num = (s[i] - '0') * 100 + (s[i - 1] - '0') * 10 + (s[i - 2] - '0');
min1 = min(abs(753 - num), min1);
}
cout << min1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int min1 = 1000;
for (int i = 0; i < s.size() - 2; i++) {
int num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
min1 = min(abs(753 - num), min1);
}
cout << min1 << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,006,096 | 1,006,097 | u459105164 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long div(long long a, long long b, long long c) {
return b / c - (a - 1) / c;
}
void print_binary(long long a) ... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long div(long long a, long long b, long long c) {
return b / c - (a - 1) / c;
}
void print_binary(long long a) ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 1,006,098 | 1,006,099 | u687204015 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,109 | 1,006,110 | u989306199 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | [
"assignment.change"
] | 1,006,111 | 1,006,112 | u454081619 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int answer = 999;
for (int i = 0; i < N; i++) {
int sumsum = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
answer = min(answer, abs(sumsum - 753));
}
cout << answer << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int answer = 999;
for (int i = 0; i < N - 2; i++) {
int sumsum = (S[i] - '0') * 100 + (S[i + 1] - '0') * 10 + S[i + 2] - '0';
answer = min(answer, abs(sumsum - 753));
}
cout << answer << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 1,006,115 | 1,006,116 | u629548179 | cpp |
p03211 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (n); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : ... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operator.compare.change"
] | 1,006,117 | 1,006,118 | u503080601 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int mi = 1e9;
for (int i = 0; i < N - 2; i++) {
string T = S.substr(i, 3);
int X = stoi(T);
mi = min(mi, X);
}
cout << mi << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int mi = 1e9;
for (int i = 0; i < N - 2; i++) {
string T = S.substr(i, 3);
int X = stoi(T);
mi = min(mi, abs(753 - X));
}
cout << mi << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 1,006,119 | 1,006,120 | u784072785 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++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 irep(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++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 irep(i, m, n) for (int i = ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,006,128 | 1,006,129 | u530107518 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;
const int INF = 1e9;
const ll INFLL = 1e18;
const int MOD = 1e9 + 7;
const int NIL = -1;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(n)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;
const int INF = 1e9;
const ll INFLL = 1e18;
const int MOD = 1e9 + 7;
const int NIL = -1;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(n)... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,006,130 | 1,006,131 | u959682820 | cpp |
p03211 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
int main() {
string s;
int MIN = INF;
for (int i = 0; i < s.size() - 2; i++) {
int num = abs((s[i] - '0') * 100 + (s[i + 1] - '0') * ... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
int main() {
string s;
cin >> s;
int MIN = INF;
for (int i = 0; i < s.size() - 2; i++) {
int num = abs((s[i] - '0') * 100 + (s[i + ... | [] | 1,006,132 | 1,006,133 | u614128939 | cpp |
p03211 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int min = 1e9;
int SIZE = S.size();
for (int i = 0; i < SIZE - 2; i++) {
int X =
100 * (S.at(i) - '0') + 10 * (S.at(i + 1) - '0') + (S.at(i + 2) - '0');
int dif = (X > 753 ? X - 753 : 753 - X);
if (dif < min)
... | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int min = 1e9;
int SIZE = S.size();
for (int i = 0; i < SIZE - 2; i++) {
int X =
100 * (S.at(i) - '0') + 10 * (S.at(i + 1) - '0') + (S.at(i + 2) - '0');
int dif = (X > 753 ? X - 753 : 753 - X);
if (dif < min)
... | [
"assignment.change"
] | 1,006,134 | 1,006,135 | u660112829 | cpp |
p03211 | /*#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int m, n;
cin >> m >> n;
int p[100000], q[100000],temp[100000];
int i,j;
bool flag[100... | /*#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int m, n;
cin >> m >> n;
int p[100000], q[100000],temp[100000];
int i,j;
bool flag[100... | [
"call.add",
"call.arguments.change"
] | 1,006,142 | 1,006,143 | u708794223 | cpp |
p03211 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll gcd(ll a, ll b);
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
string s;
cin >> s;
int m = 1000;
for ... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll gcd(ll a, ll b);
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
string s;
cin >> s;
int m = 1000;
for ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,006,144 | 1,006,145 | u755121033 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int minn = 0x3f;
string s;
int main() {
cin >> s;
int l = s.size();
for (int i = 1; i <= l - 2; i++) {
minn = min(minn, abs(753 - ((int(s[i - 1] - '0') * 100) +
(int(s[i] - '0') * 10) + int(s[i + 1] - '0'))));
}
cout << minn << ... | #include <bits/stdc++.h>
using namespace std;
int minn = 0x7fffffff;
string s;
int main() {
cin >> s;
int l = s.size();
for (int i = 1; i <= l - 2; i++) {
minn = min(minn, abs(753 - ((int(s[i - 1] - '0') * 100) +
(int(s[i] - '0') * 10) + int(s[i + 1] - '0'))));
}
cout << mi... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,006,148 | 1,006,149 | u726124338 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
using namespace std;
int main() {
string s;
int minimum = 1000000;
cin >> s;
rrep(i, s.size() - 1) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
using namespace std;
int main() {
string s;
int minimum = 1000000;
cin >> s;
rrep(i, s.size() - 2) {
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,152 | 1,006,153 | u356754940 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
using namespace std;
int main() {
string s;
int minimum = 1000000;
cin >> s;
rrep(i, s.size() - 1) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
using namespace std;
int main() {
string s;
int minimum = 1000000;
cin >> s;
rrep(i, s.size() - 2) {
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,006,154 | 1,006,153 | u356754940 | 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 - 2; i++) {
int x = (s[i + 2] - '0') * 100 + (s[i + 1] - '0') * 10 + s[i] - '0';
x = abs(x - 753);
ans = min(ans, x);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 999;
for (int i = 0; i < n - 2; i++) {
int x = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + s[i + 2] - '0';
x = abs(x - 753);
ans = min(ans, x);
}
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 1,006,157 | 1,006,158 | u105533331 | cpp |
p03211 | /*
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define cint const int
#define ld long double
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#defin... | /*
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define cint const int
#define ld long double
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#defin... | [
"expression.operation.binary.remove"
] | 1,006,164 | 1,006,165 | u751518217 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int f(int n) {
if (n % 2 == 0)
return n / 2;
else
return 3 * n + 1;
}
int main(void) {
int S;
int l = 1000, r = 1;
int min = 753;
cin >> S;
while (S / l > 0) {
int d = (S % l) / r;
if (abs(d - 753) < min)
min = abs(d - 753);
l *= 10... | #include <bits/stdc++.h>
using namespace std;
int f(int n) {
if (n % 2 == 0)
return n / 2;
else
return 3 * n + 1;
}
int main(void) {
long long S;
long long l = 1000, r = 1;
int min = 753;
cin >> S;
while (S * 10 / l > 0) {
int d = (S % l) / r;
// cout << d << endl;
if (abs(d - 753) <... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.condition.change"
] | 1,006,168 | 1,006,167 | u316491370 | cpp |
p03211 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,169 | 1,006,170 | u438265890 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int abs(int n) {
if (n > 0)
return n;
else
return -n;
}
int main() {
string S;
cin >> S;
int n = S.size();
vector<int> M(n);
for (int i = 0; i < n; i++) {
int a, b, c;
a = S[i] - 48;
b = S[i + 1] - 48;
c = S[i + 2] - 48;
int sum =... | #include <bits/stdc++.h>
using namespace std;
int abs(int n) {
if (n > 0)
return n;
else
return -n;
}
int main() {
string S;
cin >> S;
int n = S.size();
vector<int> M(n - 2);
for (int i = 0; i < n - 2; i++) {
int a, b, c;
a = S[i] - 48;
b = S[i + 1] - 48;
c = S[i + 2] - 48;
i... | [
"control_flow.loop.for.condition.change"
] | 1,006,171 | 1,006,172 | u132364782 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
// #define int long long
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 1000000000000000ll // 1e15
#define fi ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
// #define int long long
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 1000000000000000ll // 1e15
#define fi ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,175 | 1,006,176 | u379947938 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using mii = map<int, int>;
using msi = map<string, int>;
using pii =... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using mii = map<int, int>;
using msi = map<string, int>;
using pii =... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,177 | 1,006,178 | u058748522 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int X = 0;
for (int i = 2; i < S.size(); i++) {
int x = (S[i - 2] - '0') * 100 + (S[i - 1] - '0') * 10 + S[i] - '0';
if (abs(x - 753) > abs(X - 753))
X = x;
}
cout << abs(X - 753);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int X = 0;
for (int i = 2; i < S.size(); i++) {
int x = (S[i - 2] - '0') * 100 + (S[i - 1] - '0') * 10 + S[i] - '0';
if (abs(x - 753) < abs(X - 753))
X = x;
}
cout << abs(X - 753);
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,006,181 | 1,006,182 | u424374375 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int lengthS = S.length();
int dif = 753;
int numX = 0;
for (int i = 0; i < lengthS - 3; i++) {
numX =
(S.at(i) - '0') * 100 + (S.at(i + 1) - '0') * 10 + (S.at(i + 2) - '0');
dif = min(dif, abs(numX - 753));
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int lengthS = S.length();
int dif = 753;
int numX = 0;
for (int i = 0; i < lengthS - 2; i++) {
numX =
(S.at(i) - '0') * 100 + (S.at(i + 1) - '0') * 10 + (S.at(i + 2) - '0');
dif = min(dif, abs(numX - 753));
}
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,183 | 1,006,184 | u469315559 | cpp |
p03211 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
string a;
cin >> a;
int e;
e = 1000;
for (int i = 0; i < a.size() - 2; i++) {
e = min(abs((a[i] - '0') * 100 + (a[i + 1] - '0') * 10 + (a[i + 2] - '0') -
754),
e);
}
cout <<... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
string a;
cin >> a;
int e;
e = 1000;
for (int i = 0; i < a.size() - 2; i++) {
e = min(abs((a[i] - '0') * 100 + (a[i + 1] - '0') * 10 + (a[i + 2] - '0') -
753),
e);
}
cout <<... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,199 | 1,006,200 | u530329977 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(),... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(),... | [
"expression.operation.binary.remove"
] | 1,006,201 | 1,006,202 | u931191237 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 1000;
for (int i = 0; i < S.size() - 2; i++) {
a = min(abs(753 - ((S.at(i) - '0') * 100 + (S.at(i + 1) - '0') * 10 +
S.at(i - 2) - '0')),
a);
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 1000;
for (int i = 0; i < S.size() - 2; i++) {
a = min(abs(753 - ((S.at(i) - '0') * 100 + (S.at(i + 1) - '0') * 10 +
S.at(i + 2) - '0')),
a);
}
cout << a << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,203 | 1,006,204 | u028572059 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1e9;
rep(i, s.size() - 3) {
int a = s.at(i) - '0';
int b = s.at(i + 1) - '0';
int c = s.at(i + 2) - '0';
int x = a * 100 + b * 10 + c;
ans = min(ans, x);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1e9;
rep(i, s.size() - 2) {
int a = s.at(i) - '0';
int b = s.at(i + 1) - '0';
int c = s.at(i + 2) - '0';
int x = a * 100 + b * 10 + c;
ans = min(ans, abs(... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.add"
] | 1,006,207 | 1,006,208 | u009870106 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1e9;
int n = s.size();
rep(i, n - 3) {
int a = s.at(i) - '0';
int b = s.at(i + 1) - '0';
int c = s.at(i + 2) - '0';
int x = a * 100 + b * 10 + c;
ans = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1e9;
int n = s.size();
rep(i, n - 2) {
int a = s.at(i) - '0';
int b = s.at(i + 1) - '0';
int c = s.at(i + 2) - '0';
int x = a * 100 + b * 10 + c;
ans = ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,209 | 1,006,210 | u009870106 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1e9;
int n = s.size();
rep(i, n - 3) {
int a = s.at(i) - '0';
int b = s.at(i + 1) - '0';
int c = s.at(i + 2) - '0';
int x = a * 100 + b * 10 + c;
ans = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1e9;
int n = s.size();
rep(i, n - 2) {
int a = s.at(i) - '0';
int b = s.at(i + 1) - '0';
int c = s.at(i + 2) - '0';
int x = a * 100 + b * 10 + c;
ans = ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.add"
] | 1,006,211 | 1,006,210 | u009870106 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string S;
cin >> S;
long long tmp = 0;
long long ans = 1e9;
rep(i, S.size()) {
tmp = 100 * (S[i] - '0') + 10 * (S[i + 1] - '0') + (S[i + 2] - '0');
ans = min(ans, abs(tmp - 753));
}
cout << ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string S;
cin >> S;
long long tmp = 0;
long long ans = 1e9;
rep(i, S.size() - 2) {
tmp = 100 * (S[i] - '0') + 10 * (S[i + 1] - '0') + (S[i + 2] - '0');
ans = min(ans, abs(tmp - 753));
}
cout... | [
"expression.operation.binary.add"
] | 1,006,217 | 1,006,218 | u764860452 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x = 753, mind = LLONG_MAX, yo;
string asu;
cin >> asu;
for (int i = 0; i < asu.length() - 3; ++i) {
yo = ((int)asu[i] - (int)'0') * 100 + ((int)asu[i + 1] - (int)'0') * 10 +
((int)asu[i + 2] - (int)'0');
mind = min(mind, abs(y... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x = 753, mind = LLONG_MAX, yo;
string asu;
cin >> asu;
for (int i = 0; i < asu.length() - 2; ++i) {
yo = ((int)asu[i] - (int)'0') * 100 + ((int)asu[i + 1] - (int)'0') * 10 +
((int)asu[i + 2] - (int)'0');
mind = min(mind, abs(y... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,219 | 1,006,220 | u646113240 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int MOD = 1000000007;
int main() {
string S;
ci... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int MOD = 1000000007;
int main() {
string S;
ci... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,222 | 1,006,223 | u680707192 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = s.size();
vector<int> ans(a - 2);
for (int i = 0; i < a; i++) {
string x = s.substr(i, 3);
int y = stoi(x);
ans[i] = abs(753 - y);
}
sort(ans.begin(), ans.end());
cout << ans[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = s.size();
vector<int> ans(a - 2);
for (int i = 0; i < a - 2; i++) {
string x = s.substr(i, 3);
int y = stoi(x);
ans[i] = abs(753 - y);
}
sort(ans.begin(), ans.end());
cout << ans[0] << endl;
} | [
"control_flow.loop.for.condition.change"
] | 1,006,224 | 1,006,225 | u351265848 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 9999;
for (int i = 0; i < s.size() - 3; i++) {
int tmp = atoi(s.substr(i, 3).c_str());
// cout<<tmp<<endl;
tmp = abs(tmp - 753);
ans = min(tmp, ans);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 9999;
for (int i = 0; i < s.size() - 2; i++) {
int tmp = atoi(s.substr(i, 3).c_str());
// cout<<tmp<<endl;
tmp = abs(tmp - 753);
ans = min(tmp, ans);
}
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,226 | 1,006,227 | u223172354 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int d = 999;
for (int i = 0; i < s.size(); i++) {
int x = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
d = min(d, abs(x - 753));
}
cout << d << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int d = 999;
for (int i = 0; i < s.size() - 2; i++) {
int x = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
d = min(d, abs(x - 753));
}
cout << d << endl;
} | [
"control_flow.loop.for.condition.change"
] | 1,006,228 | 1,006,229 | u057810841 | 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 ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define toInt(x) (x - '0')
#define vi... | #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 ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define toInt(x) (x - '0')
#define vi... | [
"expression.operation.binary.add"
] | 1,006,232 | 1,006,233 | u075520262 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string s;
int ans = 753, a;
cin >> s;
rep(i, s.size() - 2) {
a = 100 * (int)s[i] + 10 * (int)s[i + 1] + (int)s[i + 2];
ans = min(abs(753 - a), ans);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string s;
int ans = 753, a;
cin >> s;
rep(i, s.size() - 2) {
a = 100 * (int)s[i] + 10 * (int)s[i + 1] + (int)s[i + 2] - 5328;
ans = min(abs(753 - a), ans);
}
cout << ans << endl;
}
| [
"assignment.change"
] | 1,006,234 | 1,006,235 | u264265458 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
int ans = 1000;
cin >> s;
int n = s.size();
rep(i, n - 2) {
if (abs(ans - 753) > abs(stoi(s.substr(i, 3)) - 753)) {
ans = stoi(s.substr(i, 3));
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
int ans = 10000;
cin >> s;
int n = s.size();
rep(i, n - 2) {
if (abs(ans - 753) > abs(stoi(s.substr(i, 3)) - 753)) {
ans = stoi(s.substr(i, 3));
}
}
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,006,238 | 1,006,239 | u018807058 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a;
int mini = 1000;
for (int i = 0; i < s.size() - 3; i++) {
a = ((s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0'));
mini = min(mini, abs(753 - a));
}
cout << mini << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a;
int mini = 1000;
for (int i = 0; i < s.size() - 2; i++) {
a = ((s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0'));
mini = min(mini, abs(753 - a));
}
cout << mini << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,248 | 1,006,249 | u319967566 | cpp |
p03211 | #include <cmath>
#include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
int ans = 753;
for (int i = 0; i < s.length() - 3; i++) {
std::string ss = s.substr(i, 3);
int y = std::stoi(ss);
ans = std::min(ans, std::abs(y - 753));
}
std::cout << ans << std::endl;
return... | #include <cmath>
#include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
int ans = 753;
for (int i = 0; i < s.length() - 2; i++) {
std::string ss = s.substr(i, 3);
int y = std::stoi(ss);
ans = std::min(ans, std::abs(y - 753));
}
std::cout << ans << std::endl;
return... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,252 | 1,006,253 | u922974720 | cpp |
p03211 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath> // abs
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <qu... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath> // abs
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <qu... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,254 | 1,006,255 | u539675863 | cpp |
p03211 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath> // abs
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <qu... | [
"import.add",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,256 | 1,006,255 | u539675863 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int mn = 1000000009;
cin >> s;
for (int i = 0; i < s.length() - 3; i++) {
int x = 0;
for (int j = 0; j < 3; j++) {
x += ((s[i + j] - 48) * pow(10, 2 - j));
}
mn = min(mn, abs(x - 753));
}
cout << mn << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int mn = 1000000009;
cin >> s;
for (int i = 0; i <= s.length() - 3; i++) {
int x = 0;
for (int j = 0; j < 3; j++) {
x += ((s[i + j] - 48) * pow(10, 2 - j));
}
mn = min(mn, abs(x - 753));
}
cout << mn << endl;
return... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,262 | 1,006,263 | u482647339 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int mn = 1000000009;
cin >> s;
for (int i = 0; i < s.length() - 3; i++) {
int x = 0;
for (int j = 0; j < 3; j++) {
x += ((s[i + j] - 48) * pow(10, 2 - j));
}
mn = min(mn, abs(x));
}
cout << mn << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int mn = 1000000009;
cin >> s;
for (int i = 0; i <= s.length() - 3; i++) {
int x = 0;
for (int j = 0; j < 3; j++) {
x += ((s[i + j] - 48) * pow(10, 2 - j));
}
mn = min(mn, abs(x - 753));
}
cout << mn << endl;
return... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 1,006,264 | 1,006,263 | u482647339 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
int a, ans = 1000;
cin >> s;
for (int i = 0; i < s.size(); i++) {
a = abs(753 -
(100 * (s[i] - '0') + 10 * (s[i + 1] - '0') + (s[i + 2] - '0')));
ans = min(ans, a);
}
cout << ans << '\n'... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
int a, ans = 1000;
cin >> s;
for (int i = 0; i < s.size() - 2; i++) {
a = abs(753 -
(100 * (s[i] - '0') + 10 * (s[i + 1] - '0') + (s[i + 2] - '0')));
ans = min(ans, a);
}
cout << ans << ... | [
"control_flow.loop.for.condition.change"
] | 1,006,269 | 1,006,270 | u119817090 | cpp |
p03211 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define al... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define al... | [
"call.arguments.change"
] | 1,006,273 | 1,006,274 | u843739531 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> num(n);
rep(i, n) { num[i] = s[i] - '0'; }
int x = 99999;
for (int i = 1; i <= n - 2; i++) {
int sum = num[i - 1] * 100 + num[i] * 10 + num[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> num(n);
rep(i, n) { num[i] = s[i] - '0'; }
int x = 99999;
for (int i = 1; i <= n - 2; i++) {
int sum = num[i - 1] * 100 + num[i] * 10 + num[i... | [
"call.remove",
"call.arguments.change"
] | 1,006,284 | 1,006,285 | u862412671 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> num(n);
rep(i, n) { num[i] = s[i] - '0'; }
int x = 99999;
for (int i = 1; i < n - 2; i++) {
int sum = num[i - 1] * 100 + num[i] * 10 + num[i ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> num(n);
rep(i, n) { num[i] = s[i] - '0'; }
int x = 99999;
for (int i = 1; i <= n - 2; i++) {
int sum = num[i - 1] * 100 + num[i] * 10 + num[i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.remove",
"call.arguments.change"
] | 1,006,286 | 1,006,285 | u862412671 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define ppi pair<int, int>
#define ppl pair<ll, ll>
#define all(x) x.begin(), x.end()
#define ii int, int
#define ff first
#define ss secon... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define ppi pair<int, int>
#define ppl pair<ll, ll>
#define all(x) x.begin(), x.end()
#define ii int, int
#define ff first
#define ss secon... | [
"assignment.change"
] | 1,006,291 | 1,006,292 | u460819600 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[11];
cin >> s;
int l = strlen(s);
int mx = 10000;
for (int i = 0; i < l; i++) {
int x = (s[i] - '0') * 100;
int y = (s[i + 1] - '0') * 10;
int z = (s[i + 2] - '0');
int ans = 753 - (x + y + z);
if ((ans) < mx) {
mx = (... | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[11];
cin >> s;
int l = strlen(s);
int mx = 10000;
for (int i = 0; i < l - 2; i++) {
int x = (s[i] - '0') * 100;
int y = (s[i + 1] - '0') * 10;
int z = (s[i + 2] - '0');
int ans = 753 - (x + y + z);
if (abs(ans) < mx) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.add",
"call.add",
"control_flow.branch.if.condition.change"
] | 1,006,293 | 1,006,294 | u351012095 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[11];
cin >> s;
int l = strlen(s);
int mx = 10000;
for (int i = 0; i < l; i++) {
int x = (s[i] - '0') * 100;
int y = (s[i + 1] - '0') * 10;
int z = (s[i + 2] - '0');
int ans = 753 - (x + y + z);
if (abs(ans) < mx) {
mx ... | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[11];
cin >> s;
int l = strlen(s);
int mx = 10000;
for (int i = 0; i < l - 2; i++) {
int x = (s[i] - '0') * 100;
int y = (s[i + 1] - '0') * 10;
int z = (s[i + 2] - '0');
int ans = 753 - (x + y + z);
if (abs(ans) < mx) {
... | [
"control_flow.loop.for.condition.change"
] | 1,006,295 | 1,006,294 | u351012095 | cpp |
p03211 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,304 | 1,006,305 | u222293734 | cpp |
p03211 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,006,306 | 1,006,305 | u222293734 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> r(n);
for (int i = 0; i < n; i++)
r.at(i) = s.at(i);
int a = r.at(0) * 100 + r.at(1) * 10 + r.at(2) - 753;
if (a < 0)
a *= -1;
for (int i = 1; i < n - 2; i++) {
int b = r.at(i) * 100... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> r(n);
for (int i = 0; i < n; i++)
r.at(i) = s.at(i) - '0';
int a = r.at(0) * 100 + r.at(1) * 10 + r.at(2) - 753;
if (a < 0)
a *= -1;
for (int i = 1; i < n - 2; i++) {
int b = r.at(i)... | [
"assignment.change"
] | 1,006,309 | 1,006,310 | u757584836 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int m = 800;
for (int i = 0; i < n - 2; i++) {
int a =
(s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 + (s.at(i + 2) - '0');
m = min(m, abs(a - 700));
}
cout << m << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int m = 800;
for (int i = 0; i < n - 2; i++) {
int a =
(s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 + (s.at(i + 2) - '0');
m = min(m, abs(a - 753));
}
cout << m << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,317 | 1,006,318 | u522993719 | cpp |
p03211 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> s(N);
for (int i = 0; i < N; i++) {
s[i] = S[i... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> s(N);
for (int i = 0; i < N; i++) {
s[i] = S[i... | [
"call.add",
"call.arguments.change"
] | 1,006,319 | 1,006,320 | u855985627 | cpp |
p03211 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> s(N);
for (int i = 0; i < N; i++) {
s[i] = S[i... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> s(N);
for (int i = 0; i < N; i++) {
s[i] = S[i... | [
"literal.number.change",
"variable_declaration.value.change",
"call.add",
"call.arguments.change"
] | 1,006,321 | 1,006,320 | u855985627 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int c, minc = 999;
for (int i = 0; i < S.size() - 2; i++) {
c = (S[i] - 48) * 100 + (S[i + 1] - 48) * 10 + (S[i + 2] - 48);
minc = min(abs(754 - c), minc);
}
cout << minc << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int c, minc = 999;
for (int i = 0; i < S.size() - 2; i++) {
c = (S[i] - 48) * 100 + (S[i + 1] - 48) * 10 + (S[i + 2] - 48);
minc = min(abs(753 - c), minc);
}
cout << minc << endl;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,329 | 1,006,330 | u347579224 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define Rep(i, s, t) for (long long i = s; i < t; i++)
#define all(x) x.begin(), x.end()
#define _GLIBCXX_DEBUG
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
int l = s.size();
int j = 1000;
... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define Rep(i, s, t) for (long long i = s; i < t; i++)
#define all(x) x.begin(), x.end()
#define _GLIBCXX_DEBUG
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
int l = s.size();
int j = 1000;
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,336 | 1,006,337 | u223857357 | cpp |
p03211 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
#define MOD 998244353
ll gcd(ll a, ll b) {
if ... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
#define MOD 998244353
ll gcd(ll a, ll b) {
if ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,338 | 1,006,339 | u474551232 | 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 x =
(s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 + (s.at(i + 2) - '0');
ans = min(ans, abs(x - 753));
}
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 x =
(s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 + (s.at(i + 2) - '0');
ans = min(ans, abs(x - 753));
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,347 | 1,006,348 | u697658632 | cpp |
p03211 | #include <iostream>
#include <vector>
using namespace std;
int make_digits(long long int S, vector<int> &digits) {
int count = 0;
while (S > 0) {
count++;
int tmp = S % 10;
digits.push_back(tmp);
S /= 10;
}
return count;
}
int main(void) {
long long int S;
cin >> S;
vector<int> digits;
... | #include <iostream>
#include <vector>
using namespace std;
int make_digits(long long int S, vector<int> &digits) {
int count = 0;
while (S > 0) {
count++;
int tmp = S % 10;
digits.push_back(tmp);
S /= 10;
}
return count;
}
int main(void) {
long long int S;
cin >> S;
vector<int> digits;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,351 | 1,006,352 | u652760628 | cpp |
p03211 | #include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int min = 1000;
for (int i = 0; i < S.size() - 3; i++) {
if (abs(753 - stoi(S.substr(i, 3))) < min) {
min = abs(753 - stoi(S.substr(i, 3)));
}
}
cout << min;
} | #include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int min = 1000;
for (int i = 0; i < S.size() - 2; i++) {
if (abs(753 - stoi(S.substr(i, 3))) < min) {
min = abs(753 - stoi(S.substr(i, 3)));
}
}
cout << min;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,357 | 1,006,358 | u272628953 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case... | #include <bits/stdc++.h>
using namespace std;
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,363 | 1,006,364 | u621527413 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int T(char a, char b, char c) {
int ret = 0;
ret += (int)(a - '0') * 100;
ret += (int)(b - '0') * 10;
ret += (int)(c - '0');
return ret;
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int m = s.... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int T(char a, char b, char c) {
int ret = 0;
ret += (int)(a - '0') * 100;
ret += (int)(b - '0') * 10;
ret += (int)(c - '0');
return ret;
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int m = s.... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,365 | 1,006,366 | u885523920 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1000;
for (int j = 0; j < s.size() - 3; j++) {
int k = 100 * (int)(s.at(j) - '0') + 10 * (int)(s.at(j + 1) - '0') +
(int)(s.at(j + 2) - '0');
ans = min(ans, abs(753 - k));
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1000;
for (int j = 0; j < s.size() - 2; j++) {
int k = 100 * (int)(s.at(j) - '0') + 10 * (int)(s.at(j + 1) - '0') +
(int)(s.at(j + 2) - '0');
ans = min(ans, abs(753 - k));
}
cout << ans;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,367 | 1,006,368 | u885523920 | cpp |
p03211 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define int ll
#define double long double
#define YES \
{ cout << "YES" << '\n'; }
#define NO ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define int ll
#define double long double
#define YES \
{ cout << "YES" << '\n'; }
#define NO ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,371 | 1,006,372 | u305847048 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdexcept>
#include <string>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int sum = 0;
int ans = 1e5;
for (int i = 0; i < s.size() - 3; i++) {
sum = ((s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + s[i] - '0');... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdexcept>
#include <string>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int sum = 0;
int ans = 1e5;
for (int i = 0; i < s.size() - 2; i++) {
sum = ((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",
"assignment.change"
] | 1,006,373 | 1,006,374 | u077051605 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
signed main() {
long long b = 0, c = 0, d = 1, e, f = 1000000, t, g[100000];
string a;
cin >> a;
b = (a[0] - '0') * 100 + (a[1] - '0') * 1 + (a[2] - '0');
c = abs(753 - b);
for (int i = 2; i < a.size(); i++) {
b %= 100;
b *= 10;
b += (a[i] - '0');
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
long long b = 0, c = 0, d = 1, e, f = 1000000, t, g[100000];
string a;
cin >> a;
b = ((a[0] - '0') * 100) + ((a[1] - '0') * 10) + (a[2] - '0');
c = abs(753 - b);
for (int i = 3; i < a.size(); i++) {
b %= 100;
b *= 10;
b += (a[i] - '0'... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,006,375 | 1,006,376 | u831161882 | cpp |
p03211 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
usi... |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
usi... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,377 | 1,006,378 | u641145334 | cpp |
p03211 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int result = 1000;
rep(i, s.size() - 3) {
int c = stoi(s.substr(i, 3));
result = min(result, abs(753 - c));
}
cout << result;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
string s;
cin >> s;
int result = 1000;
rep(i, s.size() - 2) {
int c = stoi(s.substr(i, 3));
result = min(result, abs(753 - c));
}
cout << result;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,388 | 1,006,389 | u021358975 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int toint(string s) {
int ans = 0;
for (char x : s)
ans = ans * 10 + (x - '0');
return ans;
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
string s;
c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int toint(string s) {
int ans = 0;
for (char x : s)
ans = ans * 10 + (x - '0');
return ans;
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
string s;
c... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,390 | 1,006,391 | u651593570 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
int main(int argc, char *argv[]) {
string s;
int best = 1E4;
cin >> s;
for (int i = 0; i < s.length() - 3; i++) {
best = min(best, abs(753 - atoi(s.su... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
int main(int argc, char *argv[]) {
string s;
int best = 1E4;
cin >> s;
for (int i = 0; i < s.length() - 2; i++) {
best = min(best, abs(753 - atoi(s.su... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,392 | 1,006,393 | u696526733 | cpp |
p03211 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define lint long long
#define all(x) (x).begin(), (x).... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define lint long long
#define all(x) (x).begin(), (x).... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,006,396 | 1,006,397 | u632094970 | 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... | [
"expression.operation.binary.add"
] | 1,006,400 | 1,006,401 | u494058663 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
string S;
cin >> S;
int n = S.length();
int Snum = stoi(S);
int ans = 1000;
for (int i = 0; i < n - 3; i++) {
int M = abs(Snum % 1000 - 753);
ans = min(M, ans);
if (ans == 0)
break;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
string S;
cin >> S;
int n = S.length();
ll Snum = stoll(S);
int ans = 999;
for (int i = 0; i < n - 2; i++) {
int M = abs(Snum % 1000 - 753);
ans = min(M, ans);
if (ans == 0)
break;
... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,413 | 1,006,411 | u142203512 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b)-1; (i) >= (a); --(i)) // Re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b)-1; (i) >= (a); --(i)) // Re... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,006,421 | 1,006,422 | u801513186 | cpp |
p03211 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < ... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 1,006,423 | 1,006,424 | u834415466 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int num, MIN;
int ans;
cin >> s;
for (int i = 0; i < s.length() - 2; i++) {
num = 100 * (s[i] - '0') + 10 * (s[i + 1] - '0') + (s[i + 2] - '0');
if (MIN > abs(753 - num)) {
MIN = abs(753 - num);
ans = num;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int num, MIN = 999;
int ans;
cin >> s;
for (int i = 0; i < s.length() - 2; i++) {
num = 100 * (s[i] - '0') + 10 * (s[i + 1] - '0') + (s[i + 2] - '0');
if (MIN > abs(753 - num)) {
MIN = abs(753 - num);
ans = num;
}
... | [
"variable_declaration.value.change"
] | 1,006,427 | 1,006,428 | u355424600 | cpp |
p03211 | #include <fstream>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
cin >> S;
// X * t = T
// t = T/X
int imin = 1000;
int tmp;
for (int i = 0; i <= S.size() - 3; i++) {
tmp = stoi(S.subs... | #include <fstream>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int imin = 1000;
int tmp;
for (int i = 0; i <= S.size() - 3; i++) {
tmp = stoi(S.substr(i, 3));
tmp = abs(753 - tmp);
imin = min(imin, tmp);
}
cout << imin << endl;
}
| [
"call.add"
] | 1,006,431 | 1,006,432 | u485731913 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, N;
int near = 1000;
int t = 0;
string S, T;
cin >> S;
for (int i = 0; i < S.size() - 2; i++) {
T.push_back(S.at(i));
T.push_back(S.at(i + 1));
T.push_back(S.at(i + 2));
t = abs(stoi(T) - 753);
near = (near, t);
T = {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, N;
int near = 1000;
int t = 0;
string S, T;
cin >> S;
for (int i = 0; i < S.size() - 2; i++) {
T.push_back(S.at(i));
T.push_back(S.at(i + 1));
T.push_back(S.at(i + 2));
t = abs(stoi(T) - 753);
near = min(near, t);
T ... | [
"call.add"
] | 1,006,438 | 1,006,439 | u715253965 | cpp |
p03211 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int abs(int a, int b) {
if (a >= b) {
return a - b;
} else {
return b - a;
}
}
int main() {
string S;
cin >> S;
int s = (int)S.size();
vector<int> T;
for (int i = 0; i < s; i++) {
T[i] = S[i] - '0';
}
int mi... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int abs(int a, int b) {
if (a >= b) {
return a - b;
} else {
return b - a;
}
}
int main() {
string S;
cin >> S;
int s = (int)S.size();
vector<int> T(s);
for (int i = 0; i < s; i++) {
T[i] = S[i] - '0';
}
int... | [] | 1,006,442 | 1,006,443 | u904123392 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n = s.size();
int D = 1000;
for (int i = 0; i < n - 2; i++) {
int num =
(s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 + (s.at(i + 2) - '0');
int d = max(num, 753) - min(num, 753);
D = min(d, D);
}
cout << D;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int D = 1000;
for (int i = 0; i < n - 2; i++) {
int num =
(s.at(i) - '0') * 100 + (s.at(i + 1) - '0') * 10 + (s.at(i + 2) - '0');
int d = max(num, 753) - min(num, 753);
D = min(d, D);
}
co... | [] | 1,006,446 | 1,006,447 | u166378830 | cpp |
p03211 | // it was hard to write
// so it should be hard to read
#include <bits/stdc++.h>
#define sz size
#define pb push_back
#define ll long long
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define last(x) (x).size() - 1
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
typedef... | // it was hard to write
// so it should be hard to read
#include <bits/stdc++.h>
#define sz size
#define pb push_back
#define ll long long
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define last(x) (x).size() - 1
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
typedef... | [
"control_flow.loop.for.condition.change"
] | 1,006,448 | 1,006,449 | u828521673 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string n;
cin >> n;
vector<int> v(n.size() - 2);
rep(i, n.size() - 2) v[i] = abs(765 - stoi(n.substr(i, 3)));
cout <... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string n;
cin >> n;
vector<int> v(n.size() - 2);
rep(i, n.size() - 2) v[i] = abs(753 - stoi(n.substr(i, 3)));
cout <... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,006,454 | 1,006,455 | u130834452 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string n;
cin >> n;
vector<int> v(n.size() - 2);
rep(i, n.size() - 2) v[i] = abs(753 - stoi(n.substr(i, 3)));
cout <... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string n;
cin >> n;
vector<int> v(n.size() - 2);
rep(i, n.size() - 2) v[i] = abs(753 - stoi(n.substr(i, 3)));
cout <... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,006,456 | 1,006,455 | u130834452 | cpp |
p03211 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(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 ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define INF 1e9
template <class T> bool chmax(T &a, ... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(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 ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define INF 1e9
template <class T> bool chmax(T &a, ... | [
"control_flow.loop.condition.change"
] | 1,006,459 | 1,006,460 | u395846213 | cpp |
p03211 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(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 ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define INF 1e9
template <class T> bool chmax(T &a, ... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(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 ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define INF 1e9
template <class T> bool chmax(T &a, ... | [
"control_flow.loop.condition.change"
] | 1,006,461 | 1,006,460 | u395846213 | cpp |
p03211 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int X, num, ans = 1000;
cin >> s;
for (int i = 0; i < s.size() - 3; i++) {
num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ans = min(ans, abs(753 - num));
}
cout << ans << end... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int X, num, ans = 1000;
cin >> s;
for (int i = 0; i <= s.size() - 3; i++) {
num = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
ans = min(ans, abs(753 - num));
}
cout << ans << en... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,006,466 | 1,006,467 | u240685518 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.