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 |
|---|---|---|---|---|---|---|---|
p03212 | #include <bits/stdc++.h>
using namespace std;
long long N;
void rec(long long d, int use, long long &cnt) {
if (d > N)
return;
if (use == 0b111)
cnt++;
rec(d * 10 + 7, use | 0b001, cnt);
rec(d * 10 + 5, use | 0b010, cnt);
rec(d * 10 + 3, use | 0b010, cnt);
}
int main() {
cin >> N;
long long re... | #include <bits/stdc++.h>
using namespace std;
long long N;
void rec(long long d, int use, long long &cnt) {
if (d > N)
return;
if (use == 0b111)
cnt++;
rec(d * 10 + 7, use | 0b001, cnt);
rec(d * 10 + 5, use | 0b010, cnt);
rec(d * 10 + 3, use | 0b100, cnt);
}
int main() {
cin >> N;
long long re... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,479 | 1,007,480 | u533566373 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] =... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,481 | 1,007,482 | u877494916 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] =... | [
"expression.operation.binary.remove",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,483 | 1,007,482 | u877494916 | cpp |
p03212 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
c... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,486 | 1,007,487 | u571173211 | cpp |
p03212 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int countnum = 0;
int T, N;
string bign;
void DFS(int index, int flag1, int flag2, int flag3, string str) {
if (index == bign.size()) {
if (flag1 && flag2 && flag3 && str < bign)
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int countnum = 0;
int T, N;
string bign;
void DFS(int index, int flag1, int flag2, int flag3, string str) {
if (index == bign.size()) {
if (flag1 && flag2 && flag3 && str <= bign)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,488 | 1,007,489 | u816631826 | cpp |
p03212 | #include <cstdio>
long long N;
int count = 0;
void dfs(long long t, unsigned char k) {
if (t < N) {
if (k == 7) {
count++;
}
dfs(t * 10 + 3, k | 1);
dfs(t * 10 + 5, k | 2);
dfs(t * 10 + 7, k | 4);
}
}
int main() {
// freopen("_intimesoftrain.txt","r",stdin);
scanf("%lld", &N);
dfs(0,... | #include <cstdio>
long long N;
int count = 0;
void dfs(long long t, unsigned char k) {
if (t <= N) {
if (k == 7) {
count++;
}
dfs(t * 10 + 3, k | 1);
dfs(t * 10 + 5, k | 2);
dfs(t * 10 + 7, k | 4);
}
}
int main() {
// freopen("_intimesoftrain.txt","r",stdin);
scanf("%lld", &N);
dfs(0... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,490 | 1,007,491 | u863370423 | cpp |
p03212 | #include <cstdio>
unsigned int N;
int count = 0;
void dfs(unsigned int t, unsigned char k) {
if (t < N) {
if (k == 7) {
count++;
}
dfs(t * 10 + 3, k | 1);
dfs(t * 10 + 5, k | 2);
dfs(t * 10 + 7, k | 4);
}
}
int main() {
// freopen("_intimesoftrain.txt","r",stdin);
scanf("%d", &N);
df... | #include <cstdio>
long long N;
int count = 0;
void dfs(long long t, unsigned char k) {
if (t <= N) {
if (k == 7) {
count++;
}
dfs(t * 10 + 3, k | 1);
dfs(t * 10 + 5, k | 2);
dfs(t * 10 + 7, k | 4);
}
}
int main() {
// freopen("_intimesoftrain.txt","r",stdin);
scanf("%lld", &N);
dfs(0... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change"
] | 1,007,492 | 1,007,491 | u863370423 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1100;
vector<int> v;
long long n;
long long ans = 0;
int A[] = {3, 5, 7};
long long cal() {
long long ans = 0;
for (int i = 0; i < v.size(); i++) {
ans = ans * 10 + v[i];
}
return ans;
}
bool judge() {
bool flag1 = false, flag2 = false, fl... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1100;
vector<int> v;
long long n;
long long ans = 0;
int A[] = {3, 5, 7};
long long cal() {
long long ans = 0;
for (int i = 0; i < v.size(); i++) {
ans = ans * 10 + v[i];
}
return ans;
}
bool judge() {
bool flag1 = false, flag2 = false, fl... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,496 | 1,007,497 | u863370423 | cpp |
p03212 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for... | [
"variable_declaration.type.change"
] | 1,007,500 | 1,007,501 | u950174376 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void DFS(ll x, int n, int &ans) {
if (n <= x)
return;
string tmp = to_string(x);
map<char, int> mp;
for (int i = 0; i < tmp.size(); i++) {
if (mp.count(tmp[i]))
mp[tmp[i]]++;
else
mp[tmp[i]] = 1;
}
if (mp.size() ==... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void DFS(ll x, int n, int &ans) {
if (n < x)
return;
string tmp = to_string(x);
map<char, int> mp;
for (int i = 0; i < tmp.size(); i++) {
if (mp.count(tmp[i]))
mp[tmp[i]]++;
else
mp[tmp[i]] = 1;
}
if (mp.size() == ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,502 | 1,007,503 | u999989620 | cpp |
p03212 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#de... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#de... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,007,508 | 1,007,509 | u243196226 | cpp |
p03212 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend() // reverse
#define strall(v) (v).cbegin(), (v).cend() // const_itterator
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend() // reverse
#define strall(v) (v).cbegin(), (v).cend() // const_itterator
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vec... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,007,510 | 1,007,511 | u106635407 | cpp |
p03212 | #include <iostream>
#include <vector>
using namespace std;
int cnt = 0;
int n;
void dfs(long long a, int use) {
if (a >= n)
return;
if (use == 0b111)
cnt++;
dfs(a * 10 + 7, use | 0b100);
dfs(a * 10 + 5, use | 0b010);
dfs(a * 10 + 3, use | 0b001);
}
int main() {
cin >> n;
dfs(0, 0);
cout << cnt... | #include <iostream>
using namespace std;
int cnt = 0;
int n;
void dfs(long long a, int use) {
if (a > n)
return;
if (use == 0b111)
cnt++;
dfs(a * 10 + 7, use | 0b100);
dfs(a * 10 + 5, use | 0b010);
dfs(a * 10 + 3, use | 0b001);
}
int main() {
cin >> n;
dfs(0, 0);
cout << cnt << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,516 | 1,007,517 | u136086822 | cpp |
p03212 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,520 | 1,007,521 | u318042557 | cpp |
p03212 | #include <iostream>
#include <map>
#include <vector>
#define int long long
typedef long long ll;
using namespace std;
ll N, count = 0;
void check(ll num) {
map<ll, ll> M;
if (num < N) {
while (num >= 1) {
M[num % 10]++;
num = num / 10;
}
if (M[3] > 0 && M[5] > 0 && M[7] > 0)
count++;... | #include <iostream>
#include <map>
#include <vector>
#define int long long
typedef long long ll;
using namespace std;
ll N, count = 0;
void check(ll num) {
map<ll, ll> M;
if (num <= N) {
while (num >= 1) {
M[num % 10]++;
num = num / 10;
}
if (M[3] > 0 && M[5] > 0 && M[7] > 0)
count++... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,524 | 1,007,525 | u132452589 | cpp |
p03212 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll N;
void ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll N;
void ... | [
"expression.operation.binary.add"
] | 1,007,526 | 1,007,527 | u303163217 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector<... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,537 | 1,007,538 | u143618600 | cpp |
p03212 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef long long ll;
typedef priority_queue<int> ... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef long long ll;
typedef priority_queue<int> ... | [
"variable_declaration.remove"
] | 1,007,543 | 1,007,544 | u718774863 | cpp |
p03212 | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto pitr = c.begin(); pitr != c.end(); ++pitr) { \
cout << *pitr;... | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto pitr = c.begin(); pitr != c.end(); ++pitr) { \
cout << *pitr;... | [
"assignment.value.change",
"call.arguments.change"
] | 1,007,545 | 1,007,546 | u135248164 | cpp |
p03212 | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << ' '; ... | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << ' '; ... | [
"identifier.change",
"call.function.change"
] | 1,007,547 | 1,007,548 | u135248164 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vdbl;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vpii;
typedef vector<pa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vdbl;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vpii;
typedef vector<pa... | [
"identifier.change",
"call.function.change"
] | 1,007,551 | 1,007,552 | u852449189 | cpp |
p03212 | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus >= 201703L
#pragma GCC target("avx2")
#else
#pragma GCC target("avx")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFIN... | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus >= 201703L
#pragma GCC target("avx2")
#else
#pragma GCC target("avx")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFIN... | [
"expression.unary.arithmetic.remove"
] | 1,007,556 | 1,007,557 | u261538386 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef string s;
typedef int ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef string s;
typedef int ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"identifier.replace.remove",
"literal.replace.add"
] | 1,007,558 | 1,007,559 | u154672915 | cpp |
p03211 | #include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
int get_three_num(string str, int index);
int calc_sub(int num);
int main(void) {
string str;
int closest_num;
int current_num;
cin >> str;
closest_num = get_three_num(str, 0);
for (int i = 1; i < str.length() - 2; i++) {
... | #include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
int get_three_num(string str, int index);
int calc_sub(int num);
int main(void) {
string str;
int closest_num;
int current_num;
cin >> str;
closest_num = get_three_num(str, 0);
for (int i = 1; i < str.length() - 2; i++) {
... | [
"call.add",
"call.arguments.add"
] | 1,007,563 | 1,007,564 | u674347990 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
// B
string s;
cin >> s;
string tmp;
int diff = 2000;
for (int i = 0; i < s.size() - 3; i++) {
tmp = s.substr(i, 3);
if (abs((stoi(tmp)) - 753) < diff) {
diff = abs(stoi(tmp) - 753);
}
}
cout << diff;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
// B
string s;
cin >> s;
string tmp;
int diff = 2000;
for (int i = 0; i < s.size() - 2; i++) {
tmp = s.substr(i, 3);
if (abs((stoi(tmp)) - 753) < diff) {
diff = abs(stoi(tmp) - 753);
}
}
cout << diff;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,565 | 1,007,566 | u676101468 | cpp |
p03211 | #include <stdio.h>
#include <stdlib.h>
int abs(int x) {
if (x < 0) {
return -x;
} else {
return x;
}
}
int main(void) {
char s[11];
scanf("%s", s);
int i;
int l;
int ans = 999;
for (l = 0; s[l] != '\0'; l++)
;
for (i = 0; i + 2 <= l; i++) {
int a = (s[i + 2] - '0') + (s[i + 1... | #include <stdio.h>
#include <stdlib.h>
int abs(int x) {
if (x < 0) {
return -x;
} else {
return x;
}
}
int main(void) {
char s[11];
scanf("%s", s);
int i;
int l;
int ans = 999;
for (l = 0; s[l] != '\0'; l++)
;
for (i = 0; i + 2 <= l - 1; i++) {
int a = (s[i + 2] - '0') + (s[i... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,007,567 | 1,007,568 | u516922881 | cpp |
p03211 | #include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int min = 999;
int X;
int dif = 100;
for (int i = 1; i < (int)S.length() - 2; i++) {
string temp = S.substr(i, 3);
// cout << temp <<endl;
X = stoi(temp);
dif = abs(X - 753);
... | #include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int min = 999;
int X;
int dif = 100;
string temp;
for (int i = 0; i < (int)S.length() - 2; i++) {
temp = S.substr(i, 3);
// cout << temp << endl;
X = stoi(temp);
dif = abs(X - ... | [
"variable_declaration.add",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,007,583 | 1,007,584 | u866119355 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, x, MN = 1e9;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
a = 0;
for (int j = i; j < i + 3; j++) {
char ch = s[j];
a = a * 10 + (ch - '0');
}
x = abs(753 - a);
if (x < MN)
MN = x;
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, x, MN = 1e9;
string s;
cin >> s;
for (int i = 0; i < s.size() - 2; i++) {
a = 0;
for (int j = i; j < i + 3; j++) {
char ch = s[j];
a = a * 10 + (ch - '0');
}
x = abs(753 - a);
if (x < MN)
MN = x;
}
cout... | [
"control_flow.loop.for.condition.change"
] | 1,007,587 | 1,007,588 | u418568023 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
// typedef long long int;
typedef long long ll;
// typedef pair<int, int> P;
const int INF = 1 << 30;
const int... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
// typedef long long int;
typedef long long ll;
// typedef pair<int, int> P;
const int INF = 1 << 30;
const int... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,007,591 | 1,007,592 | u484962958 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int result = 999;
int a;
for (int i = 0; i < s.size() - 2; i++) {
string sub;
sub = s.substr(i, i + 2);
int num = atoi(sub.c_str());
a = 753 - num;
if (a < 0) {
a = -a;
}
if (a < result) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int result = 999;
int a;
for (int i = 0; i < s.size() - 2; i++) {
string sub;
sub = s.substr(i, 3);
int num = atoi(sub.c_str());
a = 753 - num;
if (a < 0) {
a = -a;
}
if (a < result) {
resu... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,007,593 | 1,007,594 | u132284673 | cpp |
p03211 | #include <cstdio>
#include <cstring>
int abss(int a) { return a > 0 ? a : -a; }
int main() {
int i, a[1010], ans, flag = 10007;
char s[1010];
scanf("%s", s);
int n = strlen(s);
for (i = 0; i < n; i++) {
a[i] = s[i] - '0';
}
for (i = 2; i < n; i++) {
ans = abss((a[i] * 100 + a[i - 1] * 10 + a[i - 2... | #include <cstdio>
#include <cstring>
int abss(int a) { return a > 0 ? a : -a; }
int main() {
int i, a[1010], ans, flag = 10007;
char s[1010];
scanf("%s", s);
int n = strlen(s);
for (i = 0; i < n; i++) {
a[i] = s[i] - '0';
// printf("%d...",a[i]);
}
for (i = 2; i < n; i++) {
ans = abss((a[i] + ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,007,599 | 1,007,600 | u075566809 | cpp |
p03211 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
using namespace std;
const double pi = acos(-1);
#define nyan cout << "(=^•ω•^=)" << endl;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
using namespace std;
const double pi = acos(-1);
#define nyan cout << "(=^•ω•^=)" << endl;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,603 | 1,007,604 | u128258399 | cpp |
p03211 | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 753;
for (int i = 0; i < s.size() - 2; i++) {
string ss = "";
ss += s[i];
ss += s[i + 1];
ss += s[i + 2];
int dis = stoi(ss);
dis = abs(753 - ans);
if (ans > dis)
... | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 753;
for (int i = 0; i < s.size() - 2; i++) {
string ss = "";
ss += s[i];
ss += s[i + 1];
ss += s[i + 2];
int dis = stoi(ss);
dis = abs(753 - dis);
if (ans > dis)
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,607 | 1,007,608 | u610253537 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string n;
cin >> n;
int len = n.length();
int sft = 753;
int ans = (n[0] - 48) * 100 + (n[1] - 48) * 10 + (n[2] - 48);
int min = abs(sft - ans);
int diff = 0;
for (int i = 1; i < len - 3; i++) {
ans = (n[i] - 48) * 100 + (n[i + 1] - 48) ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string n;
cin >> n;
int len = n.length();
int sft = 753;
int ans = (n[0] - 48) * 100 + (n[1] - 48) * 10 + (n[2] - 48);
int min = abs(sft - ans);
int diff = 0;
for (int i = 1; i < len - 2; i++) {
ans = (n[i] - 48) * 100 + (n[i + 1] - 48) ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,613 | 1,007,614 | u887066391 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef unsigned long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1L... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef unsigned long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1L... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,617 | 1,007,618 | u640323045 | cpp |
p03211 | #include <cmath>
#include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int main(void) {
string S;
cin >> S;
int min = 100000;
for (int cnt = 0; cnt < S.size() - 2; cnt++) {
int value = (S[cnt] - '0') * 100;
value += (S[cnt + 1] - '0') * 10;
value += (S[cnt] - '0');
if (a... | #include <cmath>
#include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int main(void) {
string S;
cin >> S;
int min = 100000;
for (int cnt = 0; cnt < S.size() - 2; cnt++) {
int value = (S[cnt] - '0') * 100;
value += (S[cnt + 1] - '0') * 10;
value += (S[cnt + 2] - '0');
i... | [
"assignment.change"
] | 1,007,619 | 1,007,620 | u777853124 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <string>
int main() {
string S;
int i, N, j;
cin >> S;
j = 10000;
N = S.length() - 2;
int A[N];
for (i = 0; i < N; i++) {
A[i] = stoi(S.substr(i + 1, ... | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <string>
int main() {
string S;
int i, N, j;
cin >> S;
j = 10000;
N = S.length() - 2;
int A[N];
for (i = 0; i < N; i++) {
A[i] = stoi(S.substr(i, 3));... | [
"expression.operation.binary.remove"
] | 1,007,627 | 1,007,628 | u499729664 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int r = 1e9;
for (int i = 0; i < s.size() - 3; i++) {
r = min(r, abs(100 * (s[i] - '0') + 10 * (s[i + 1] - '0') +
(s[i + 2] - '0') - 753));
}
cout << r << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int r = 1e9;
for (int i = 0; i < s.size() - 2; i++) {
r = min(r, abs(100 * (s[i] - '0') + 10 * (s[i + 1] - '0') +
(s[i + 2] - '0') - 753));
}
cout << r << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,634 | 1,007,635 | u848737670 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
ll r = 1e9;
for (int i = 0; i < s.size() - 3; i++) {
r = min(r, abs(100ll * (s[i] - '0') + 10ll * (s[i + 1] - '0') +
(s[i + 2] - '0') - 753ll));
}
cout << r << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
ll r = 1e9;
for (int i = 0; i < s.size() - 2; i++) {
r = min(r, abs(100ll * (s[i] - '0') + 10ll * (s[i + 1] - '0') +
(s[i + 2] - '0') - 753ll));
}
cout << r << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,636 | 1,007,637 | u848737670 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length(), minn = 999;
for (int i = 0; i < n - 3; i++) {
int x = 100 * (s[i] - 48) + 10 * (s[i + 1] - 48) + s[i + 2] - 48;
int y = x - 753;
if (y < 0)
y = -y;
if (y < minn)
minn = y;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length(), minn = 999;
for (int i = 0; i < n - 2; i++) {
int x = 100 * (s[i] - 48) + 10 * (s[i + 1] - 48) + s[i + 2] - 48;
int y = x - 753;
if (y < 0)
y = -y;
if (y < minn)
minn = y;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,644 | 1,007,645 | u428110253 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N;
N = S.length(); //文字の長さ
int Ans = 10000;
for (int i = 1; i <= N - 2; i++) {
string sub = S.substr(i, 3);
int NS = stoi(sub);
NS = abs(NS - 753);
if (Ans > NS) {
Ans = NS;
}
}
c... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N;
N = S.length(); //文字の長さ
int Ans = 10000;
for (int i = 0; i < N - 2; i++) {
string sub = S.substr(i, 3);
int NS = stoi(sub);
NS = abs(NS - 753);
if (Ans > NS) {
Ans = NS;
}
}
co... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,007,646 | 1,007,647 | u537837642 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N;
N = S.length(); //文字の長さ
int Ans = 1000;
for (int i = 1; i <= N - 2; i++) {
string sub = S.substr(i, 3);
int NS = stoi(sub);
NS = abs(NS - 753);
if (Ans > NS) {
Ans = NS;
}
}
co... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N;
N = S.length(); //文字の長さ
int Ans = 10000;
for (int i = 0; i < N - 2; i++) {
string sub = S.substr(i, 3);
int NS = stoi(sub);
NS = abs(NS - 753);
if (Ans > NS) {
Ans = NS;
}
}
co... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,007,648 | 1,007,647 | u537837642 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int abss(int x) {
if (x >= 0) {
return x;
} else {
return (-1) * x;
}
}
int main() {
string s;
cin >> s;
int size = s.size();
int sa = 8000;
for (int i = 0; i <= size - 2; ++i) {
int a = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 ... | #include <iostream>
#include <string>
using namespace std;
int abss(int x) {
if (x >= 0) {
return x;
} else {
return (-1) * x;
}
}
int main() {
string s;
cin >> s;
int size = s.size();
int sa = 8000;
for (int i = 0; i < size - 2; ++i) {
int a = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 +... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,649 | 1,007,650 | u421308322 | cpp |
p03211 | #include <iostream>
#include <string>
using namespace std;
int abss(int x) {
if (x >= 0) {
return x;
} else {
return (-1) * x;
}
}
int main() {
string s;
cin >> s;
int size = s.size();
int sa = 800;
for (int i = 0; i <= size - 2; ++i) {
int a = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 +... | #include <iostream>
#include <string>
using namespace std;
int abss(int x) {
if (x >= 0) {
return x;
} else {
return (-1) * x;
}
}
int main() {
string s;
cin >> s;
int size = s.size();
int sa = 8000;
for (int i = 0; i < size - 2; ++i) {
int a = (s[i] - '0') * 100 + (s[i + 1] - '0') * 10 +... | [
"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,651 | 1,007,650 | u421308322 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int dx[... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int dx[... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.b... | 1,007,656 | 1,007,657 | u037703936 | cpp |
p03211 | #include <cmath>
#include <cstdio>
#include <string>
using namespace std;
int main() {
char input[99];
string str;
int res;
int min = 9999;
int cur;
int i;
scanf("%s", input);
str = input;
res = (str[0] - '0') * 100 + (str[1] - '0') * 10 + (str[2] - '0');
cur = min = abs(res - 753);
for (i ... | #include <cmath>
#include <cstdio>
#include <string>
using namespace std;
int main() {
char input[99];
string str;
int res;
int min = 9999;
int cur;
int i;
scanf("%s", input);
str = input;
res = (str[0] - '0') * 100 + (str[1] - '0') * 10 + (str[2] - '0');
min = abs(res - 753);
cur = res;
... | [
"assignment.change",
"assignment.add"
] | 1,007,658 | 1,007,659 | u619248223 | cpp |
p03211 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, N) for (long long i = 0; i < (long long)N; ++i)
string ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, N) for (long long i = 0; i < (long long)N; ++i)
string ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,660 | 1,007,661 | u378155378 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int x = s.size();
int n[x - 2];
for (int i = 0; i < x; i++) {
n[i] = (int)(s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
n[i] = abs(n[i] - 753);
}
sort(n, n + x);
cout << n[0] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int x = s.size();
int n[x - 2];
for (int i = 0; i < x - 2; i++) {
n[i] = (int)(s[i] - '0') * 100 + (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
n[i] = abs(n[i] - 753);
}
sort(n, n + x - 2);
cout << n[0] << endl;
retur... | [
"control_flow.loop.for.condition.change"
] | 1,007,668 | 1,007,669 | u047554023 | cpp |
p03211 | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
//整形Shift + alt + f 2回
// int x[101],y[101],h[101];
// int koya[100001][];
/*
//ユークリッドの互除法
unsigned gcd(unsigned a, unsigned b) {
if(a < b) gcd(b... | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
//整形Shift + alt + f 2回
// int x[101],y[101],h[101];
// int koya[100001][];
/*
//ユークリッドの互除法
unsigned gcd(unsigned a, unsigned b) {
if(a < b) gcd(b... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,007,672 | 1,007,673 | u814440174 | cpp |
p03211 | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
//整形Shift + alt + f 2回
// int x[101],y[101],h[101];
// int koya[100001][];
/*
//ユークリッドの互除法
unsigned gcd(unsigned a, unsigned b) {
if(a < b) gcd(b... | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
//整形Shift + alt + f 2回
// int x[101],y[101],h[101];
// int koya[100001][];
/*
//ユークリッドの互除法
unsigned gcd(unsigned a, unsigned b) {
if(a < b) gcd(b... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,674 | 1,007,673 | u814440174 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define INF 10000000000000009
#define INF 9223372036854775807
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ORREP(i, n) for (int i = (n); i >= 1; --i)
#define ZREP(i, ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define INF 10000000000000009
#define INF 9223372036854775807
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ORREP(i, n) for (int i = (n); i >= 1; --i)
#define ZREP(i, ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,675 | 1,007,676 | u554953477 | cpp |
p03211 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (long long)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int main() {
s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (long long)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int main() {
s... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,681 | 1,007,682 | u482544950 | cpp |
p03211 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORB(i, m, n) for (int i = m; i >= m; i--)
#define ll long long
#define pb push_back
#define popb pop_back
using namespace std;
int main() {
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORB(i, m, n) for (int i = m; i >= m; i--)
#define ll long long
#define pb push_back
#define popb pop_back
using namespace std;
int main() {
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,683 | 1,007,684 | u525432476 | cpp |
p03211 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
#include <algorithm>
#include <queue>
typedef long long ll;
#include <vector>
#define cin(n) scanf("%lld", &(n))
#define cout(n) printf("%lld", (n))
#define couc(c) printf("%c", (c))
#define coutn printf("\n")
#define cout_... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
#include <algorithm>
#include <queue>
typedef long long ll;
#include <vector>
#define cin(n) scanf("%lld", &(n))
#define cout(n) printf("%lld", (n))
#define couc(c) printf("%c", (c))
#define coutn printf("\n")
#define cout_... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 1,007,694 | 1,007,695 | u550573951 | cpp |
p03211 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
string s;
int ans, minn = 123456789;
int getint(string s) {
return (s[0] - '0') * 100 + (s[1] - '0') * 10 + (s[2] - '0');
}
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
string s1 = s.sub... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
string s;
int ans, minn = 123456789;
int getint(string s) {
return (s[0] - '0') * 100 + (s[1] - '0') * 10 + (s[2] - '0');
}
int main() {
cin >> s;
for (int i = 0; i < s.size() - 2; i++) {
string s1 = s... | [
"control_flow.loop.for.condition.change"
] | 1,007,700 | 1,007,701 | u878056971 | cpp |
p03211 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define ll long long
using namespace std;
signed main() {
string s;
cin >> s;
int ans = 9999999;
for (int i = 0; i < s.size() - 3; i++) {
ans = min(abs(753 - stoi(s.substr(i, 3))), ans);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define ll long long
using namespace std;
signed main() {
string s;
cin >> s;
int ans = 9999999;
for (int i = 0; i < s.size() - 2; i++) {
ans = min(abs(753 - stoi(s.substr(i, 3))), ans);
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,704 | 1,007,705 | u994793728 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
void addnumber(string, string);
int counter = 0;
int N;
int main() {
cin >> N;
addnumber("", "7");
addnumber("", "5");
addnumber("", "3");
cout <<... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
void addnumber(string, string);
int counter = 0;
long N;
int main() {
cin >> N;
addnumber("", "7");
addnumber("", "5");
addnumber("", "3");
cout <... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"call.function.change"
] | 1,007,709 | 1,007,710 | u865014539 | cpp |
p03212 | #include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define per(i, a, b) for (ll i = a; i >= b; i--)
using namespace std;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
const string defaultval = "753";
ll dfs(string s, int n) {
ll x = stoi(s);
... | #include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define per(i, a, b) for (ll i = a; i >= b; i--)
using namespace std;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
const string defaultval = "753";
ll dfs(string s, ll n) {
ll x = stoll(s);
... | [
"identifier.change",
"call.function.change"
] | 1,007,722 | 1,007,723 | u847929893 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,737 | 1,007,738 | u722640678 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> p;
typedef unsign... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> p;
typedef unsign... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,741 | 1,007,742 | u765815947 | cpp |
p03212 | #include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, x, n) for (int i = x; i < n; i++)
using ll = long long;
int N;
int A[15];
int x[15][15], y[15][15];
void dfs(ll M, int bits, int &count) {
if (M > N)
return;
if (bi... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, x, n) for (int i = x; i < n; i++)
using ll = long long;
int N;
int A[15];
int x[15][15], y[15][15];
void dfs(ll M, int bits, int &count) {
if (M > N)
return;
if (bi... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,743 | 1,007,744 | u765815947 | cpp |
p03212 | #include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, x, n) for (int i = x; i < n; i++)
using ll = long long;
int N;
int A[15];
int x[15][15], y[15][15];
void dfs(ll M, int bits, int &count) {
if (M > N)
return;
if (bi... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, x, n) for (int i = x; i < n; i++)
using ll = long long;
int N;
int A[15];
int x[15][15], y[15][15];
void dfs(ll M, int bits, int &count) {
if (M > N)
return;
if (bi... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,745 | 1,007,744 | u765815947 | cpp |
p03212 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int iINF = 1001001001;
const long long llINF = 1LL << 60;
ll n;
ll dig... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int iINF = 1001001001;
const long long llINF = 1LL << 60;
ll n;
ll dig... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,007,756 | 1,007,757 | u544879354 | cpp |
p03212 | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
bool has... | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
bool has... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,007,758 | 1,007,759 | u970109776 | cpp |
p03212 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,764 | 1,007,765 | u116523315 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
int64_t m, ct = -1;
void f(int64_t n) {
if (n <= m)
ct++;
else
return;
f(10 * n + 3);
f(10 * n + 5);
f(10 * n + 7);
}
void g1(int64_t n) {
if (n <= m)
ct--;
else
return;
g1(10 * n + 3);
g1(10 * n + 5);
}
void g2(int64_t n) {
if (n <= m)
... | #include <bits/stdc++.h>
using namespace std;
int64_t m, ct = -1;
void f(int64_t n) {
if (n <= m)
ct++;
else
return;
f(10 * n + 3);
f(10 * n + 5);
f(10 * n + 7);
}
void g1(int64_t n) {
if (n <= m)
ct--;
else
return;
g1(10 * n + 3);
g1(10 * n + 5);
}
void g2(int64_t n) {
if (n <= m)
... | [
"identifier.change",
"call.function.change"
] | 1,007,770 | 1,007,771 | u340494803 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9 + 7)
#define INF (1LL << 60)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9 + 7)
#define INF (1LL << 60)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,007,780 | 1,007,781 | u803684095 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (long long)(1e9 + 7)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
ll next357(ll n) {
string s = to_string(n);
// cout << "s[" << s << "] " ;
int k = 1;
for (int i = s.size() - 1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (long long)(1e9 + 7)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
ll next357(ll n) {
string s = to_string(n);
// cout << "s[" << s << "] " ;
int k = 1;
for (int i = s.size() - 1;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,782 | 1,007,783 | u803684095 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
string nextStr(string str) {
bool flag = str[0] == '7';
if (str[0] == '3')
str[0] = '5';
else if (str[0] == '5')
str[0] = '7';
else
str[0] =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
string nextStr(string str) {
bool flag = str[0] == '7';
if (str[0] == '3')
str[0] = '5';
else if (str[0] == '5')
str[0] = '7';
else
str[0] =... | [
"identifier.change",
"call.function.change",
"control_flow.loop.condition.change"
] | 1,007,786 | 1,007,787 | u285598935 | cpp |
p03212 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,794 | 1,007,795 | u809967037 | cpp |
p03212 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stat... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stat... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,808 | 1,007,809 | u690326065 | cpp |
p03212 | #include <iostream>
using namespace std;
typedef long long ll;
ll n, ans = 0;
void f(ll a, ll b) {
cin >> n;
if (a >= n)
return;
if (b == 7)
ans++;
f(10 * a + 3, b | 1);
f(10 * a + 5, b | 2);
f(10 * a + 7, b | 4);
}
int main(void) {
f(0, 0);
cout << ans << endl;
}
| #include <iostream>
using namespace std;
typedef long long ll;
ll n, ans = 0;
void f(ll a, ll b) {
cin >> n;
if (a > n)
return;
if (b == 7)
ans++;
f(10 * a + 3, b | 1);
f(10 * a + 5, b | 2);
f(10 * a + 7, b | 4);
}
int main(void) {
f(0, 0);
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,816 | 1,007,817 | u050428930 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
int dfs(long long x, int t = 0, int f = 0, int s = 0) {
if (x > n)
return ... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
int dfs(long long x, int t = 0, int f = 0, int s = 0) {
if (x > n)
return ... | [] | 1,007,820 | 1,007,821 | u953463534 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
map<int, int> sftNums;
void addSftNums(vector<int> work) {
int scale = 0;
int sftNum = 0;
map<int, int> sftMap;
for (auto w : work) {
if (w == 0)
continue;
sftNum += w * pow(10, scale++);
sftMap[w]++;
}
if (sftMap[7] > 0 && sftMap[5] > 0 && ... | #include <bits/stdc++.h>
using namespace std;
map<int, int> sftNums;
void addSftNums(vector<int> work) {
int scale = 0;
int sftNum = 0;
map<int, int> sftMap;
for (auto w : work) {
if (w == 0)
continue;
sftNum += w * pow(10, scale++);
sftMap[w]++;
}
if (sftMap[7] > 0 && sftMap[5] > 0 && ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,007,837 | 1,007,838 | u568877271 | cpp |
p03212 | #include <iostream>
#include <string>
using namespace std;
const string decimals = "753";
bool check(string &s, long n) {
if (stoi(s) > n) {
return false;
}
for (char c : decimals) {
if (s.find(c) == string::npos) {
return false;
}
}
return true;
}
int dfs(string s, long n) {
int res = ... | #include <iostream>
#include <string>
using namespace std;
const string decimals = "753";
bool check(string &s, long n) {
if (stoll(s) > n) {
return false;
}
for (char c : decimals) {
if (s.find(c) == string::npos) {
return false;
}
}
return true;
}
int dfs(string s, long n) {
int res =... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,007,839 | 1,007,840 | u213143275 | cpp |
p03212 | #include <iostream>
#include <string>
using namespace std;
const string decimals = "753";
bool check(string &s, int n) {
if (stoi(s) > n) {
return false;
}
for (char c : decimals) {
if (s.find(c) == string::npos) {
return false;
}
}
return true;
}
int dfs(string s, int n) {
int res = 0;... | #include <iostream>
#include <string>
using namespace std;
const string decimals = "753";
bool check(string &s, long n) {
if (stoll(s) > n) {
return false;
}
for (char c : decimals) {
if (s.find(c) == string::npos) {
return false;
}
}
return true;
}
int dfs(string s, long n) {
int res =... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,007,841 | 1,007,840 | u213143275 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template <class T> inline bool chmax(T &a, T ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template <class T> inline bool chmax(T &a, T ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,007,855 | 1,007,856 | u328179672 | cpp |
p03212 | #include <bits/stdc++.h>
#define REP(i, b) for (int i = 0; i < (b); i++)
#define REPS(i, b) for (int i = 1; i <= (b); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
ll N, ans;
bool is753(string s) {
vector<int> c(3, 0);
RE... | #include <bits/stdc++.h>
#define REP(i, b) for (int i = 0; i < (b); i++)
#define REPS(i, b) for (int i = 1; i <= (b); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
ll N, ans;
bool is753(string s) {
vector<int> c(3, 0);
RE... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,007,862 | 1,007,863 | u952289831 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#ifdef XVENOM
#define errp(...) fprintf(stderr, __VA_ARGS__)
#define dbg(...) errp("[%s]: ", #__VA_ARGS__), dbg_str(__VA_ARGS__)
#else
#define errp(...)
#define dbg(...)
#endif
template <typename U, typename V> string to_stri... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#ifdef XVENOM
#define errp(...) fprintf(stderr, __VA_ARGS__)
#define dbg(...) errp("[%s]: ", #__VA_ARGS__), dbg_str(__VA_ARGS__)
#else
#define errp(...)
#define dbg(...)
#endif
template <typename U, typename V> string to_stri... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,876 | 1,007,877 | u943017136 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll check753(ll M, ll num, ll count7, ll count5, ll count3) {
ll nexta, nextb, nextc, next7, next5, next3, count = 0;
if (num > M) {
return 0;
}
nexta = num * 10 + 7;
next7 = count7 + 1;
if (count5 != 0 && count3 != 0 && nexta < M) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll check753(ll M, ll num, ll count7, ll count5, ll count3) {
ll nexta, nextb, nextc, next7, next5, next3, count = 0;
if (num > M) {
return 0;
}
nexta = num * 10 + 7;
next7 = count7 + 1;
if (count5 != 0 && count3 != 0 && nexta <= M) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,880 | 1,007,881 | u761994361 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
void print_v(ve... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
void print_v(ve... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,007,882 | 1,007,883 | u227379863 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,888 | 1,007,889 | u022832318 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,007,906 | 1,007,907 | u127768253 | cpp |
p03212 | #include <iostream>
using namespace std;
int main() {
long int n;
cin >> n;
int count = 0;
if (n < 357) {
cout << 0 << endl;
return 0;
} else {
long int p;
if (n >= 777777753) {
cout << 26484 << endl;
return 0;
}
if (n > 555555555) {
n = 777777753;
p = 555555... | #include <iostream>
using namespace std;
int main() {
long int n;
cin >> n;
int count = 0;
if (n < 357) {
cout << 0 << endl;
return 0;
} else {
long int p;
if (n >= 777777753) {
cout << 26484 << endl;
return 0;
}
if (n >= 555555555) {
p = 555555555;
count = 1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"assignment.value.change"
] | 1,007,908 | 1,007,909 | u465669072 | cpp |
p03212 | // abc114_c
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | // abc114_c
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,916 | 1,007,917 | u614550445 | cpp |
p03212 | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD ... | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD ... | [
"assignment.add"
] | 1,007,933 | 1,007,934 | u473116917 | cpp |
p03212 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int MOD = 1000000007;
int INF = numeric_limits<int>::max() / 2;
int ans = 0;
int N;
void dfs(string S) {
if (stoi(S) > N)
return;
bool ans3{}, ans5{}, ans7{};
for (int i = 0; i < S.size()... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int MOD = 1000000007;
int INF = numeric_limits<int>::max() / 2;
int ans = 0;
int N;
void dfs(string S) {
if (stol(S) > N)
return;
bool ans3{}, ans5{}, ans7{};
for (int i = 0; i < S.size()... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,007,935 | 1,007,936 | u415916075 | cpp |
p03212 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,954 | 1,007,955 | u419390395 | cpp |
p03212 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,956 | 1,007,955 | u419390395 | cpp |
p03212 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,957 | 1,007,955 | u419390395 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
int dfs(string s, int n) {
if (stoi(s) > n)
return 0;
int cnt3 = 0, cnt5 = 0, cnt7 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '3')
cnt3++;
if (s[i] == '5')
cnt5++;
if (s[i] == '7')
cnt7++;
}
int res = 0;
if (cnt3 ... | #include <bits/stdc++.h>
using namespace std;
int dfs(string s, int n) {
if (stol(s) > n)
return 0;
int cnt3 = 0, cnt5 = 0, cnt7 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '3')
cnt3++;
if (s[i] == '5')
cnt5++;
if (s[i] == '7')
cnt7++;
}
int res = 0;
if (cnt3 ... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,007,958 | 1,007,959 | u427681070 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll LongINF = 1e13 + 7;
const int INF = 1e9 + 7;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll LongINF = 1e13 + 7;
const int INF = 1e9 + 7;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 1,007,962 | 1,007,963 | u534015096 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
vector<int> x(0);
bool is753(int n, int dig) {
vector<bool> f(3, 0);
for (int i = 0; i < dig; i++) {
if (n % 10 == 3)
f.at(0) = 1;
if (n % 10 == 5)
f.at(1) = 1;
if (n % 10 == 7)
f.at(2) = 1;
n /= 10;
}
return f.at(0) && f.at(1) && ... | #include <bits/stdc++.h>
using namespace std;
vector<int> x(0);
bool is753(int n, int dig) {
vector<bool> f(3, 0);
for (int i = 0; i < dig; i++) {
if (n % 10 == 3)
f.at(0) = 1;
if (n % 10 == 5)
f.at(1) = 1;
if (n % 10 == 7)
f.at(2) = 1;
n /= 10;
}
return f.at(0) && f.at(1) && ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,970 | 1,007,971 | u082801599 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
stack<pair<int, int>> q;
cin >> n;
q.push({0, 0});
while (!q.empty()) {
auto k = q.top();
q.pop();
if (k.first <= n && k.second == 7)
ans++;
if (k.first < n / 10) {
q.push({k.first * 10 + 3, k.second | 1});... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
stack<pair<int, int>> q;
cin >> n;
q.push({0, 0});
while (!q.empty()) {
auto k = q.top();
q.pop();
if (k.first <= n && k.second == 7)
ans++;
if (k.first <= n / 10) {
q.push({k.first * 10 + 3, k.second | 1})... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,974 | 1,007,975 | u780122303 | cpp |
p03212 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,976 | 1,007,977 | u656771711 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
const int MAXD = 8;
const int sichigo[] = {3, 5, 7};
int n;
int main() {
cin >> n;
queue<int> que;
set<int> nums;
rep(i, 3) que.push(sichigo[i]);
while (que.... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
const int MAXD = 8;
const int sichigo[] = {3, 5, 7};
int n;
int main() {
cin >> n;
queue<int> que;
set<int> nums;
rep(i, 3) que.push(sichigo[i]);
while (que.... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,983 | 1,007,984 | u389007679 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
#define vll vector<ll>
#define INF 100000000
bool check(ll a) {
bool flag3 = false;
bool flag5 = f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
#define vll vector<ll>
#define INF 100000000
bool check(ll a) {
bool flag3 = false;
bool flag5 = f... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,991 | 1,007,992 | u613960672 | cpp |
p03212 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
if (n < 357) {
puts("0");
return 0;
}
int ans = 0;
for (int i = 357; i <= n; i += 2) {
int temp = i;
bool while_flag = true;
bool count3 ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
if (n < 357) {
puts("0");
return 0;
}
int ans = 0;
for (int i = 357; i <= n; i += 2) {
int temp = i;
bool while_flag = true;
bool count3 ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,007,995 | 1,007,996 | u915797797 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge {
long long to, cost;
};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge {
long long to, cost;
};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#defin... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,007,999 | 1,008,000 | u926099741 | cpp |
p03212 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,008,003 | 1,008,004 | u221285045 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.