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 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) ... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,005 | 1,008,006 | u034865202 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
int shichigo(long long a, long long ju) {
int a2 = (a % (10 * ju)) / ju;
if (a2 == 3 || a2 == 5) {
a += 2 * ju;
} else if (a2 == 0) {
a += 3 * ju;
} else {
a -= 4 * ju;
ju *= 10;
a = shichigo(a, ju);
}
return a;
}
int main() {
long long A... | #include <bits/stdc++.h>
using namespace std;
int shichigo(long long a, long long ju) {
int a2 = (a % (10 * ju)) / ju;
if (a2 == 3 || a2 == 5) {
a += 2 * ju;
} else if (a2 == 0) {
a += 3 * ju;
} else {
a -= 4 * ju;
ju *= 10;
a = shichigo(a, ju);
}
return a;
}
int main() {
long long A... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,020 | 1,008,021 | u261947526 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int ifsuu(int x) {
int if3 = 0, if5 = 0, if7 = 0;
while (x) {
if (x % 10 == 3)
if3 = 1;
if (x % 10 == 5)
if5 = 1;
if (x % 10 ==... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int ifsuu(int x) {
int if3 = 0, if5 = 0, if7 = 0;
while (x) {
if (x % 10 == 3)
if3 = 1;
if (x % 10 == 5)
if5 = 1;
if (x % 10 ==... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,022 | 1,008,023 | u088751997 | cpp |
p03212 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
vector<string> F;
vector<int> sft;
void f(string s) {
if (s.size() == 10)
return;
F.push_back(s);
f(s + ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
vector<string> F;
vector<int> sft;
void f(string s) {
if (s.size() == 10)
return;
F.push_back(s);
f(s + ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,024 | 1,008,025 | u826189900 | cpp |
p03212 | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int, int... | #include <bits/stdc++.h>
#include <cmath>
#include <map>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define been(ix) (ix).begin(), (ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int, int... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 1,008,048 | 1,008,049 | u495881622 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
void check(ll x, int &cnt) {
bool flg3 = 0;
bool flg5 = 0;
bool flg7 = 0;
bool flgo = 0;
while (1) {
if (x == 0) {
break;
}
if (x % 10 == 3) {
flg3 = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
void check(ll x, int &cnt) {
bool flg3 = 0;
bool flg5 = 0;
bool flg7 = 0;
bool flgo = 0;
while (1) {
if (x == 0) {
break;
}
if (x % 10 == 3) {
flg3 = 1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,052 | 1,008,053 | u596311864 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
constexpr int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
constexpr int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).b... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,008,056 | 1,008,057 | u310228685 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
constexpr int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
constexpr int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).b... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,008,058 | 1,008,057 | u310228685 | cpp |
p03212 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define adrep(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
typedef long long ll;
ll N;
void func(ll cur, int use, ll &counter) {
if (cur > N)
return;
if (use = 0b111)
counter++;
func(cur * 10 + 7, use | 0b001, c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define adrep(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
typedef long long ll;
ll N;
void func(ll cur, int use, ll &counter) {
if (cur > N)
return;
if (use == 0b111)
counter++;
func(cur * 10 + 7, use | 0b001, ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,008,059 | 1,008,060 | u978535698 | cpp |
p03212 | #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)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
bool isSma... | #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)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
bool isSma... | [
"misc.opposites",
"function.return_value.change"
] | 1,008,065 | 1,008,066 | u488493347 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define INF 0x7fffffff
long N;
long ans = 0;
bool judge(long n) {
int flag = 0;
int dig = 0;
while (n != 0) {
dig = n % 10;
if (dig == 3) {
flag = flag | 1;
}
if (dig == 5) {
flag = flag | 2;
}
if (dig == 7) {
flag = f... | #include <bits/stdc++.h>
using namespace std;
#define INF 0x7fffffff
long N;
long ans = 0;
bool judge(long n) {
int flag = 0;
int dig = 0;
while (n != 0) {
dig = n % 10;
if (dig == 3) {
flag = flag | 1;
}
if (dig == 5) {
flag = flag | 2;
}
if (dig == 7) {
flag = f... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,067 | 1,008,068 | u303453927 | cpp |
p03212 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack... | [
"identifier.change"
] | 1,008,075 | 1,008,076 | u820341516 | cpp |
p03212 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int ans = 0;
void cnt(int n, string s, char add) {
int a, b, c;
a = b = c = 0;
s += add;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '3')
a++;
else if (s[i] == '5')
b++;
else if (s... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int ans = 0;
void cnt(int n, string s, char add) {
int a, b, c;
a = b = c = 0;
s += add;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '3')
a++;
else if (s[i] == '5')
b++;
else if (s... | [
"variable_declaration.type.primitive.change"
] | 1,008,077 | 1,008,078 | u174434198 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc s... | [
"variable_declaration.remove"
] | 1,008,079 | 1,008,080 | u768152935 | cpp |
p03212 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,086 | 1,008,087 | u978109511 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod = 1e9;
static co... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod = 1e9;
static co... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,008,096 | 1,008,097 | u698883164 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod = 1e9;
static co... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod = 1e9;
static co... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,008,098 | 1,008,097 | u698883164 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
long long N;
int ans = 0;
void func(long long n, int num3, int num5, int num7) {
if (n > N) {
return;
}
if (num3 > 0 && num5 > 0 && num7 > 0)
ans++;
func(n * 10 + 3, num3 + 1, num5, num7);
func(n * 10 + ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
long long N;
int ans = 0;
void func(long long n, int num3, int num5, int num7) {
if (n > N) {
return;
}
if (num3 > 0 && num5 > 0 && num7 > 0)
ans++;
func(n * 10 + 3, num3 + 1, num5, num7);
func(n * 10 + ... | [
"call.add"
] | 1,008,114 | 1,008,115 | u625741705 | cpp |
p03212 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <math.h>
#include <queue>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using db = double;
using ldb = long db;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <math.h>
#include <queue>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using db = double;
using ldb = long db;
... | [
"identifier.change",
"call.function.change"
] | 1,008,118 | 1,008,119 | u177143886 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int dfs(ll a) {
if (n < a)
return 0;
int f3, f5, f7;
f3 = f5 = f7 = 0;
ll t = a;
while (t) {
int b = t % 10;
if (b == 3)
f3 = 1;
else if (b == 5)
f5 = 1;
else if (b == 7)
f7 = 1;
t /= 10;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int dfs(ll a) {
if (n < a)
return 0;
int f3, f5, f7;
f3 = f5 = f7 = 0;
ll t = a;
while (t) {
int b = t % 10;
if (b == 3)
f3 = 1;
else if (b == 5)
f5 = 1;
else if (b == 7)
f7 = 1;
t /= 10;
}... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,008,143 | 1,008,144 | u804999113 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int dfs(ll a) {
if (n < a)
return 0;
int f3, f5, f7;
f3 = f5 = f7 = 0;
ll t = a;
while (t) {
int b = t % 10;
if (t == 3)
f3 = 1;
else if (t == 5)
f5 = 1;
else if (t == 7)
f7 = 1;
t /= 10;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int dfs(ll a) {
if (n < a)
return 0;
int f3, f5, f7;
f3 = f5 = f7 = 0;
ll t = a;
while (t) {
int b = t % 10;
if (b == 3)
f3 = 1;
else if (b == 5)
f5 = 1;
else if (b == 7)
f7 = 1;
t /= 10;
}... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,008,145 | 1,008,144 | u804999113 | cpp |
p03212 | #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 N;
int dfs(string s) {
... | #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 N;
int dfs(string s) {
... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,008,150 | 1,008,151 | u680707192 | cpp |
p03212 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d[3] = {3, 5, 7};
int ans = 0;
for (int i = 3; i < 10;
i++) { // 333から大きくしていく感じ ここで桁が決まります
for (int bit = 0; bit < pow(3, i); bit++) { //ある桁のとき何数見ますか
//以下、どうやって3,5,7の3進作りますか
int a = 0, p = bit;
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d[3] = {3, 5, 7};
int ans = 0;
for (int i = 3; i < 10;
i++) { // 333から大きくしていく感じ ここで桁が決まります
for (int bit = 0; bit < pow(3, i); bit++) { //ある桁のとき何数見ますか
//以下、どうやって3,5,7の3進作りますか
int a = 0, p = bit;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,008,164 | 1,008,165 | u277556971 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var < (end); var++)
#define RFOR(var, begin, end) for (int var = (begin)-1; var >= (end); var--)
#define REP(var, length) FOR(var, 0, length)
#define RREP(var, length) RFOR(var, length, 0)
#define SO... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var < (end); var++)
#define RFOR(var, begin, end) for (int var = (begin)-1; var >= (end); var--)
#define REP(var, length) FOR(var, 0, length)
#define RREP(var, length) RFOR(var, length, 0)
#define SO... | [] | 1,008,166 | 1,008,167 | u212486902 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
ll ans = 0;
ll n;
void func(bool a, bool b, bool c, string now) {
if (now... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
ll ans = 0;
ll n;
void func(bool a, bool b, bool c, string now) {
if (now... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,008,172 | 1,008,173 | u864171425 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N, ans = 0;
void dfs(ll num, int thr, int fiv, int sev) {
if (num > N)
return;
if (thr && fiv && sev)
ans++;
dfs(10 * num + 3, 1, 0, 0);
dfs(10 * num + 5, 0, 1, 0);
dfs(10 * num + 7, 0, 0, 1);
}
int main() {
cin >> N;
dfs(3,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N, ans = 0;
void dfs(ll num, int thr, int fiv, int sev) {
if (num > N)
return;
if (thr && fiv && sev)
ans++;
dfs(10 * num + 3, 1, fiv, sev);
dfs(10 * num + 5, thr, 1, sev);
dfs(10 * num + 7, thr, fiv, 1);
}
int main() {
cin >>... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 1,008,174 | 1,008,175 | u370447425 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define N 50
#define INF 99999999
typedef pair<int, int> P;
int n;
int good[3] = {3, 5, 7};
int cnt = 0;
void dfs(long long, long long);
int main() {
cin >> n;
// printf("n=%d\n",n);
dfs(0, 0);
cout << cnt << endl;
}
void dfs(long long sum, long long d) {
// prin... | #include <bits/stdc++.h>
using namespace std;
#define N 50
#define INF 99999999
typedef pair<int, int> P;
int n;
int good[3] = {3, 5, 7};
int cnt = 0;
void dfs(long long, long long);
int main() {
cin >> n;
// printf("n=%d\n",n);
dfs(0, 0);
cout << cnt << endl;
}
void dfs(long long sum, long long d) {
// prin... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,188 | 1,008,189 | u745562814 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int lim = 150004;
bool ok(long long x) {
bool a = false, b = false, c = false;
while (x) {
if (x % 10 == 3)
a = true;
else if (x % 10 == 5)
b = true;
else if (x % 10 == 7)
c = true;
else
return false;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int lim = 150004;
bool ok(long long x) {
bool a = false, b = false, c = false;
while (x) {
if (x % 10 == 3)
a = true;
else if (x % 10 == 5)
b = true;
else if (x % 10 == 7)
c = true;
else
return false;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,190 | 1,008,191 | u515056330 | cpp |
p03212 | #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 ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
string tem = "753";
int dfs(string s, int n) {
if (stoi(s) > n)
ret... | #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 ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
string tem = "753";
int dfs(string s, int n) {
if (stol(s) > n)
ret... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,008,211 | 1,008,212 | u283907492 | cpp |
p03212 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[5000000], j, n;
int num;
void Prod(ll cur, int a, int b, int c) {
if (cur >= n)
return;
if (a && b && c)
num++;
Prod(cur * 10 + 3, a + 1, b, c);
Prod(cur * 10 + 5, a, b + 1, c);
Prod(cur * 10 + 7, a, b, c + 1);
}
int main() {
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[5000000], j, n;
int num;
void Prod(ll cur, int a, int b, int c) {
if (cur > n)
return;
if (a && b && c)
num++;
Prod(cur * 10 + 3, a + 1, b, c);
Prod(cur * 10 + 5, a, b + 1, c);
Prod(cur * 10 + 7, a, b, c + 1);
}
int main() {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,223 | 1,008,224 | u600640214 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 1,008,231 | 1,008,232 | u532573979 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
using p = pair<int, int>;
int n;
int dfs(string s) {
if (stoi(s) > n)
return 0;
auto ans = 0;
if (s.find('7') != string::npos && s.find('5') != string::npos &&
s.find('3') != string::npos) {
ans = 1;
}
for (auto i : string("753")) {
ans += dfs(... | #include <bits/stdc++.h>
using namespace std;
using p = pair<int, int>;
int n;
int dfs(string s) {
if (stoll(s) > n)
return 0;
long long ans = 0;
if (s.find('7') != string::npos && s.find('5') != string::npos &&
s.find('3') != string::npos) {
ans = 1;
}
for (auto i : string("753")) {
ans +... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"variable_declaration.type.widen.change"
] | 1,008,237 | 1,008,238 | u533749093 | cpp |
p03212 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a, n) vector<int>(a)((n));
#define Vec(a, n) vector<string>(a)((n));
#define twovec(a, n, m) vector<vector<int>> a(n, vector<int>(m, 0));
#define Twovec(a, n, m... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a, n) vector<int>(a)((n));
#define Vec(a, n) vector<string>(a)((n));
#define twovec(a, n, m) vector<vector<int>> a(n, vector<int>(m, 0));
#define Twovec(a, n, m... | [] | 1,008,241 | 1,008,242 | u607741489 | cpp |
p03212 | #include <iostream>
using namespace std;
typedef long int li;
#define df 1
int dc = 10000000;
int v[4] = {7, 5, 3, 0};
li to753(int k) {
dc -= df;
if (dc < 0) {
cout << "err in to753\n";
return 0;
}
li s = 0, i = 1;
while (k) {
dc -= df;
if (dc < 0) {
cout << "err in to753\n";
retu... | #include <iostream>
using namespace std;
typedef long int li;
#define df 0
int dc = 10000000;
int v[4] = {7, 5, 3, 0};
li to753(int k) {
dc -= df;
if (dc < 0) {
cout << "err in to753\n";
return 0;
}
li s = 0, i = 1;
while (k) {
dc -= df;
if (dc < 0) {
cout << "err in to753\n";
retu... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 1,008,250 | 1,008,251 | u014847113 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,008,252 | 1,008,253 | u030992242 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,252 | 1,008,254 | u030992242 | cpp |
p03212 | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int check(vector<int> l);
long long int cal(vector<int> l) {
long long int sum = 0;
for (int i = 0; i < l.size(); i++) {
sum = sum * 10;
sum += l[l.size() - i - 1];
}
return sum;
}
int next(int a) {
if (a == 0)
return 3;
... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int check(vector<int> l);
long long int cal(vector<int> l) {
long long int sum = 0;
for (int i = 0; i < l.size(); i++) {
sum = sum * 10;
sum += l[l.size() - i - 1];
}
return sum;
}
int next(int a) {
if (a == 0)
return 3;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,008,258 | 1,008,259 | u732502311 | cpp |
p03212 | #include <cmath>
#include <iostream>
using namespace std;
long long int N;
bool shichigo(long long int a) {
int keta = log10(a);
keta++;
bool is3 = false, is5 = false, is7 = false;
for (int i = keta; i >= 0; i--) {
int b;
b = a / pow(10, i);
if (b == 3)
is3 = true;
else if (b == 5)
... | #include <cmath>
#include <iostream>
using namespace std;
long long int N;
bool shichigo(long long int a) {
int keta = log10(a);
keta++;
bool is3 = false, is5 = false, is7 = false;
for (int i = keta; i >= 0; i--) {
int b;
b = a / pow(10, i);
if (b == 3)
is3 = true;
else if (b == 5)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,266 | 1,008,267 | u166632863 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
int N;
int num(int x) {
int res = 0;
int y = x;
bool c3 = false, c5 = false, c7 = false;
while (y != 0) {
if (y % 10 == 3)
c3 = true;
if (... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
int N;
int num(int x) {
int res = 0;
int y = x;
bool c3 = false, c5 = false, c7 = false;
while (y != 0) {
if (y % 10 == 3)
c3 = true;
if (... | [
"expression.operation.binary.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 1,008,280 | 1,008,281 | u888717396 | cpp |
p03212 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
ll n;
char c[3] = {'3', '5', '7'};
void solve() {
vector<string> v;
v.push_back("375");
int pos = 0;
while (true) {
int end = v.size();
if (v[end - 1].size() >= to_string(n).size()) {
... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
ll n;
char c[3] = {'3', '5', '7'};
void solve() {
vector<string> v;
v.push_back("375");
int pos = 0;
while (true) {
int end = v.size();
if (v[end - 1].size() >= to_string(n).size()) {
... | [
"control_flow.branch.if.condition.change"
] | 1,008,285 | 1,008,286 | u550178285 | cpp |
p03212 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | [
"call.arguments.change"
] | 1,008,296 | 1,008,297 | u057611820 | cpp |
p03212 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long N;
vector<long long> ans;
void check(long long n) {
long long m = n;
int seven, five, three;
seven = 0;
five = 0;
three = 0;
while (m > 0) {
long long a;
a = m % 10;
if (a == 7) {
seven... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long N;
vector<long long> ans;
void check(long long n) {
long long m = n;
int seven, five, three;
seven = 0;
five = 0;
three = 0;
while (m > 0) {
long long a;
a = m % 10;
if (a == 7) {
seven... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,307 | 1,008,308 | u761510695 | cpp |
p03212 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
using namespace std;
ll N;
vector<long long> ans_vec;
void check(long long x) {
ll keep = x;
ll three = 0, five = 0, seven... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
using namespace std;
ll N;
vector<long long> ans_vec;
void check(long long x) {
ll keep = x;
ll three = 0, five = 0, seven... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,309 | 1,008,310 | u468862268 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,326 | 1,008,327 | u155416173 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,328 | 1,008,327 | u155416173 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,008,329 | 1,008,330 | u239375815 | cpp |
p03212 | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,333 | 1,008,334 | u172873334 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
const int INF = 1 << 30, MOD = 1000000007;
const ll LINF = 1ll << 60;
#define _ol3(_1, _2, _3, name, ...) na... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
const int INF = 1 << 30, MOD = 1000000007;
const ll LINF = 1ll << 60;
#define _ol3(_1, _2, _3, name, ...) na... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,341 | 1,008,342 | u502709453 | cpp |
p03212 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int mask = 0; mask < (1 << 20); mask++) {
int num = 0;
for (int i = 0; i < 20; i += 2) {
int digit = i / 2;
if (mask & (1 << i) && mask & (1 << i + 1))
num ... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int mask = 0; mask < (1 << 18); mask++) {
int num = 0;
for (int i = 0; i < 18; i += 2) {
int digit = i / 2;
if (mask & (1 << i) && mask & (1 << i + 1))
num +... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,008,343 | 1,008,344 | u598501138 | cpp |
p03212 | #include <iostream>
#include <vector>
using namespace std;
int k, ans;
void enu(int n, int i, int x) {
if (i == n) {
if (x < k) {
bool f3 = false;
bool f5 = false;
bool f7 = false;
while (x > 0) {
if (x % 10 == 3) {
f3 = true;
}
if (x % 10 == 5) {
... | #include <iostream>
#include <vector>
using namespace std;
int k, ans;
void enu(int n, int i, int x) {
if (i == n) {
if (x <= k) {
bool f3 = false;
bool f5 = false;
bool f7 = false;
while (x > 0) {
if (x % 10 == 3) {
f3 = true;
}
if (x % 10 == 5) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,358 | 1,008,359 | u681557252 | cpp |
p03212 | #include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = std::pair<int, int>;
ll count = 0;
ll N;
void dfs(ll depth, ll n) {
if (n >= N) {
return;
}
ll tmp3 = n;
bool tmp3flag = false;
while (tmp3 > 0) {
... | #include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = std::pair<int, int>;
ll count = 0;
ll N;
void dfs(ll depth, ll n) {
if (n > N) {
return;
}
ll tmp3 = n;
bool tmp3flag = false;
while (tmp3 > 0) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,360 | 1,008,361 | u458798873 | cpp |
p03212 | #include <bits/stdc++.h>
#define INF (1 << 30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
ll bound;
int cnt = 0;
void dfs(ll n, int k) {
if (n > 1000000000) {
return;
}
if (k == 7 && n < bound)
++cnt;
dfs(n * 10 + 3, k | 1);
dfs(n * 10 + 5, k | 2);
dfs(n... | #include <bits/stdc++.h>
#define INF (1 << 30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
ll bound;
int cnt = 0;
void dfs(ll n, int k) {
if (n > bound) {
return;
}
if (k == 7)
++cnt;
dfs(n * 10 + 3, k | 1);
dfs(n * 10 + 5, k | 2);
dfs(n * 10 + 7, k | 4);... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,008,376 | 1,008,377 | u268977772 | cpp |
p03212 | #include <bits/stdc++.h>
#define INF (1 << 30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
ll bound;
int cnt = 0;
void dfs(ll n, int k) {
if (n > 1000000000) {
return;
}
if (k == 7 && n < bound)
++cnt;
dfs(n * 10 + 3, k | 1);
dfs(n * 10 + 5, k | 2);
dfs(n... | #include <bits/stdc++.h>
#define INF (1 << 30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
ll bound;
int cnt = 0;
void dfs(ll n, int k) {
if (n > 1000000000) {
return;
}
if (k == 7 && n <= bound)
++cnt;
dfs(n * 10 + 3, k | 1);
dfs(n * 10 + 5, k | 2);
dfs(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,376 | 1,008,378 | u268977772 | cpp |
p03212 | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const ll MOD = 1e9 + 7;
// Combinationの使い方
// vector<vector<ll>> v(N+1, vector<ll>(N+1, 0));
// comb(v);
void comb(vecto... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const ll MOD = 1e9 + 7;
// Combinationの使い方
// vector<vector<ll>> v(N+1, vector<ll>(N+1, 0));
// comb(v);
void comb(vecto... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,391 | 1,008,392 | u068277996 | cpp |
p03212 | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const ll MOD = 1e9 + 7;
// Combinationの使い方
// vector<vector<ll>> v(N+1, vector<ll>(N+1, 0));
// comb(v);
void comb(vecto... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const ll MOD = 1e9 + 7;
// Combinationの使い方
// vector<vector<ll>> v(N+1, vector<ll>(N+1, 0));
// comb(v);
void comb(vecto... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,393 | 1,008,392 | u068277996 | cpp |
p03212 | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const ll MOD = 1e9 + 7;
// Combinationの使い方
// vector<vector<ll>> v(N+1, vector<ll>(N+1, 0));
// comb(v);
void comb(vecto... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const ll MOD = 1e9 + 7;
// Combinationの使い方
// vector<vector<ll>> v(N+1, vector<ll>(N+1, 0));
// comb(v);
void comb(vecto... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,394 | 1,008,395 | u068277996 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | [
"control_flow.branch.if.condition.change"
] | 1,008,398 | 1,008,399 | u090325904 | cpp |
p03212 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define ii pair<int, int>
#define MAX 1000000007
using namespace std;
bool check(ll n) {
int work[3] = {3, 5, 7};
bool flag[3] = {... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define ii pair<int, int>
#define MAX 1000000007
using namespace std;
bool check(ll n) {
int work[3] = {3, 5, 7};
bool flag[3] = {... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,400 | 1,008,401 | u582848517 | cpp |
p03212 | #include <iostream>
using namespace std;
typedef unsigned long long ULL;
void process(ULL N, int use[3], int finish, ULL *ans, ULL number, int pos);
int main() {
ULL N;
ULL temp;
int use[3] = {0, 0, 0};
int count;
ULL ans = 0;
cin >> N;
temp = N;
count = 0;
while (temp > 0) {
count++;
temp /... | #include <iostream>
using namespace std;
typedef unsigned long long ULL;
void process(ULL N, int use[3], int finish, ULL *ans, ULL number, int pos);
int main() {
ULL N;
ULL temp;
int use[3] = {0, 0, 0};
int count;
ULL ans = 0;
cin >> N;
temp = N;
count = 0;
while (temp > 0) {
count++;
temp /... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,406 | 1,008,407 | u081275802 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << st... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << st... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,408 | 1,008,409 | u155216115 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
const int INF = 2e9;
#define pb push_back
#define mp make_pair
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
const int INF = 2e9;
#define pb push_back
#define mp make_pair
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return... | [
"expression.operation.binary.remove"
] | 1,008,414 | 1,008,415 | u193591892 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
long long N;
void func(long long a, int flag, long long counter) {
/*ベースケース */
if (a > N)
return;
/*753フラグが立ってる時にcounter増やす */
if (flag = 0b111)
counter++;
/*7を付け足す */
func(a * 10 + 7, flag | 0b001, counter);
/*この時点で7スタートのカウントができてる */
/*5を付け足す ... | #include <bits/stdc++.h>
using namespace std;
long long N;
void func(long long a, int flag, long long &counter) {
/*ベースケース */
if (a > N)
return;
/*753フラグが立ってる時にcounter増やす */
if (flag == 0b111)
++counter;
/*7を付け足す */
func(a * 10 + 7, flag | 0b001, counter);
/*この時点で7スタートのカウントができてる */
/*5を付け足... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,008,431 | 1,008,432 | u800100718 | cpp |
p03212 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int n, ans;
void dfs(long long sum, int cnt3, int cnt5, int cnt7) {
if (sum > n)
return;
if (cnt3 > 0 || cnt5 > 0 || cnt7 > 0)
ans++;
dfs(sum * 1... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int n, ans;
void dfs(long long sum, int cnt3, int cnt5, int cnt7) {
if (sum > n)
return;
if (cnt3 > 0 && cnt5 > 0 && cnt7 > 0)
ans++;
dfs(sum * 1... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,008,435 | 1,008,436 | u953753178 | cpp |
p03212 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
class P3 {
private:
std::vector<int> digits;
bool flag_of;
public:
P3() { flag_of = false; }
P3(int n) {
digits.resize(n);
for (int i = 0; i < n; ++i) {
digits[i] = 0;
}
flag_of = false;
}
~P3() {}
void operat... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
class P3 {
private:
std::vector<int> digits;
bool flag_of;
public:
P3() { flag_of = false; }
P3(int n) {
digits.resize(n);
for (int i = 0; i < n; ++i) {
digits[i] = 0;
}
flag_of = false;
}
~P3() {}
void operat... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,453 | 1,008,454 | u863819006 | cpp |
p03212 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
// #include <numeric>
using namespace std;
typedef unsigned long ul;
ty... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
// #include <numeric>
using namespace std;
typedef unsigned long ul;
ty... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,455 | 1,008,456 | u644070128 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[20];
ll dp[20][110];
ll dfs(ll pos, ll lim, ll sta, ll lead) {
if (pos == -1)
return sta == 105;
ll up = lim ? a[pos] : 9;
ll tmp = 0;
if (dp[pos][sta] != -1)
return dp[pos][sta];
if (sta != 105) {
for (ll i = lead ? 0 : 3; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[20];
ll dp[20][110];
ll dfs(ll pos, ll lim, ll sta, ll lead) {
if (pos == -1)
return sta == 105;
ll up = lim ? a[pos] : 9;
ll tmp = 0;
if (dp[pos][sta] != -1)
return dp[pos][sta];
if (sta != 105 || lim) {
for (ll i = lead ? 0... | [
"control_flow.branch.if.condition.change"
] | 1,008,457 | 1,008,458 | u976418120 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[20];
ll dp[20][110];
ll dfs(ll pos, ll lim, ll sta, ll lead) {
if (pos == -1)
return sta == 105;
ll up = lim ? a[pos] : 9;
ll tmp = 0;
if (dp[pos][sta] != -1)
return dp[pos][sta];
if (sta != 105) {
for (ll i = lead ? 0 : 3; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[20];
ll dp[20][110];
ll dfs(ll pos, ll lim, ll sta, ll lead) {
if (pos == -1)
return sta == 105;
ll up = lim ? a[pos] : 9;
ll tmp = 0;
if (dp[pos][sta] != -1)
return dp[pos][sta];
if (sta != 105 || lim) {
for (ll i = lead ? 0... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 1,008,459 | 1,008,458 | u976418120 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int dp[1000][2][2][2][2] = {};
string n;
cin >> n;
if (n.size() == 1000)
n = string(999, '9');
dp[0][0][0][0][0] = 1;
for (int i = 0; i < n.size(); i++)
for (int smaller = 0; smaller < 2; smaller++)
for (int ha... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int dp[1000][2][2][2][2] = {};
string n;
cin >> n;
if (n.size() == 1000)
n = string(999, '9');
dp[0][0][0][0][0] = 1;
for (int i = 0; i < n.size(); i++)
for (int smaller = 0; smaller < 2; smaller++)
for (int ha... | [
"call.add",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 1,008,469 | 1,008,470 | u598050616 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
//#define ONLINE_JUDGE
#define pb(a) push_back(a)
#define all(a) (a.begin(), a.end())
using ll = long long;
const int E5 = 1e5;
//////////// Solution /////////////////////////////////
int ans = 0;
int n;
void dfs(ll cur, int mask) {
if (cur > n)
return;
if (m... | #include <bits/stdc++.h>
using namespace std;
#define ONLINE_JUDGE
#define pb(a) push_back(a)
#define all(a) (a.begin(), a.end())
using ll = long long;
const int E5 = 1e5;
//////////// Solution /////////////////////////////////
int ans = 0;
int n;
void dfs(ll cur, int mask) {
if (cur > n)
return;
if (mas... | [] | 1,008,482 | 1,008,483 | u361383723 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
template <class T> inline bool... | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
template <class T> inline bool... | [
"identifier.change",
"call.function.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 1,008,496 | 1,008,497 | u901397311 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define FOR(NAME, START, NUM) for (ll NAME = START; NAME < (NUM); NAME++)
#define REP(NAME, NUM) for (ll NAME = 0; NAME < (NUM); NAME++)
#define BREP(NAME, NUM) for (ll NAME = (NUM)-1; NAME >= 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define FOR(NAME, START, NUM) for (ll NAME = START; NAME < (NUM); NAME++)
#define REP(NAME, NUM) for (ll NAME = 0; NAME < (NUM); NAME++)
#define BREP(NAME, NUM) for (ll NAME = (NUM)-1; NAME >= 0;... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"function.return_value.change"
] | 1,008,500 | 1,008,501 | u916256067 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define FOR(NAME, START, NUM) for (ll NAME = START; NAME < (NUM); NAME++)
#define REP(NAME, NUM) for (ll NAME = 0; NAME < (NUM); NAME++)
#define BREP(NAME, NUM) for (ll NAME = (NUM)-1; NAME >= 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define FOR(NAME, START, NUM) for (ll NAME = START; NAME < (NUM); NAME++)
#define REP(NAME, NUM) for (ll NAME = 0; NAME < (NUM); NAME++)
#define BREP(NAME, NUM) for (ll NAME = (NUM)-1; NAME >= 0;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,500 | 1,008,502 | u916256067 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using std::swap;
long long int N;
long long int t;
int che(long long int x, long long int u) {
std::string nnn = std::to_string(x);
if (x < N) {
if (x > 100 && nnn.find("3") != ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using std::swap;
long long int N;
long long int t;
int che(long long int x, long long int u) {
std::string nnn = std::to_string(x);
if (x <= N) {
if (x > 100 && nnn.find("3") !=... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,503 | 1,008,504 | u196471026 | cpp |
p03212 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
vector<int> buf;
int seeds[] = {3, 5, 7};
int N;
int size_;
int ans;
bool endflag = true;
int convert() {
bool exist3 = false;
bool exist5 = false;
bool exist7 = false;
int ret = 0;
for (int i = 0; i < size_; ++i) {
if (buf[i] ... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
vector<int> buf;
int seeds[] = {3, 5, 7};
int N;
int size_;
int ans;
bool endflag = true;
int convert() {
bool exist3 = false;
bool exist5 = false;
bool exist7 = false;
int ret = 0;
for (int i = 0; i < size_; ++i) {
if (buf[i] ... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 1,008,515 | 1,008,516 | u335667012 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
long long int N;
bool func(string s) {
bool seven = false, five = false, three... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
long long int N;
bool func(string s) {
bool seven = false, five = false, three... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,008,519 | 1,008,520 | u698142380 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
ll n;
vector<char> c753 = {'3', '5', '7'};
ll dfs(string m) {
if (stoi(m.c_str()) > n)
return 0;
ll re... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
ll n;
vector<char> c753 = {'3', '5', '7'};
ll dfs(string m) {
if (stol(m.c_str()) > n)
return 0;
ll re... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 1,008,531 | 1,008,532 | u934105772 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
ll n;
vector<char> c753 = {'3', '5', '7'};
ll dfs(string m) {
if (stoi(m.c_str()) > n)
return 0;
ll re... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
ll n;
vector<char> c753 = {'3', '5', '7'};
ll dfs(string m) {
if (stol(m.c_str()) > n)
return 0;
ll re... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,008,533 | 1,008,532 | u934105772 | cpp |
p03212 | #include "bits/stdc++.h"
using namespace std;
#define ll long long
ll n;
string s = "357";
ll shichigosan(string x) {
if (stoll(x) >= n) {
return 0;
}
int seven = 0, five = 0, three = 0;
for (int i = 0; i < x.size(); i++) {
if (x[i] == '7')
seven++;
else if (x[i] == '5')
five++;
el... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
ll n;
string s = "357";
ll shichigosan(string x) {
if (stoll(x) > n) {
return 0;
}
int seven = 0, five = 0, three = 0;
for (int i = 0; i < x.size(); i++) {
if (x[i] == '7')
seven++;
else if (x[i] == '5')
five++;
els... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,543 | 1,008,544 | u870610226 | cpp |
p03212 | #include <algorithm>
#include <iostream>
#include <stack>
#include <string>
bool check(std::string str) {
bool check1 = false;
bool check2 = false;
bool check3 = false;
for (int i = 0; i < str.length(); i++) {
if (str[i] == '3')
check1 = true;
else if (str[i] == '5')
check2 = true;
else... | #include <algorithm>
#include <iostream>
#include <stack>
#include <string>
bool check(std::string str) {
bool check1 = false;
bool check2 = false;
bool check3 = false;
for (int i = 0; i < str.length(); i++) {
if (str[i] == '3')
check1 = true;
else if (str[i] == '5')
check2 = true;
else... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,551 | 1,008,552 | u985625318 | cpp |
p03212 | #include <iostream>
#include <vector>
using namespace std;
vector<int> vals;
void enumeration(int x, int bit, int d) {
if (d == 0) {
if (bit == 7)
vals.push_back(x);
return;
}
enumeration(x * 10 + 3, bit | 1, d - 1);
enumeration(x * 10 + 5, bit | 2, d - 1);
enumeration(x * 10 + 7, bit | 4, d - 1... | #include <iostream>
#include <vector>
using namespace std;
vector<int> vals;
void enumeration(int x, int bit, int d) {
if (d == 0) {
if (bit == 7)
vals.push_back(x);
return;
}
enumeration(x * 10 + 3, bit | 1, d - 1);
enumeration(x * 10 + 5, bit | 2, d - 1);
enumeration(x * 10 + 7, bit | 4, d - 1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,567 | 1,008,568 | u837745858 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i <= int(n); ++i)
#define all(a) (a).begin(), (a).end()
#define lb(s, x) lower_bound(all(s), x) - s.begin()
#define ub(s, x) upper_bound(all(s), x) - s.begin()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i <= int(n); ++i)
#define all(a) (a).begin(), (a).end()
#define lb(s, x) lower_bound(all(s), x) - s.begin()
#define ub(s, x) upper_bound(all(s), x) - s.begin()
#defin... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,008,575 | 1,008,576 | u241615199 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
struct Node {
int num, cnt[3];
};
const int M = 3e6 + 44;
map<int, bool> mp;
int num[3] = {3, 5, 7};
int s[M];
int ls;
int bas[10];
void init() {
ls = 0;
s[0] = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
struct Node {
int num, cnt[3];
};
const int M = 3e6 + 44;
map<int, bool> mp;
int num[3] = {3, 5, 7};
int s[M];
int ls;
int bas[10];
void init() {
ls = 0;
s[0] = ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,008,577 | 1,008,578 | u214775674 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int mod = 1e9 + 7;
vector<ll> z;
void zzz(int i, ll j) {
z.push_back(j);
if (i < 9) {
zzz(i + 1, j * 10 + 3);
zzz(i + 1, j * 10 + 5);
zzz(i + 1, j * 10 + 7);
}
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int mod = 1e9 + 7;
vector<ll> z;
void zzz(int i, ll j) {
z.push_back(j);
if (i < 10) {
zzz(i + 1, j * 10 + 3);
zzz(i + 1, j * 10 + 5);
zzz(i + 1, j * 10 + 7);
}
}
int main() {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,008,585 | 1,008,586 | u164007697 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int mod = 1e9 + 7;
vector<int> z;
void zzz(int i, ll j) {
z.push_back(j);
if (i < 10) {
zzz(i + 1, j * 10 + 3);
zzz(i + 1, j * 10 + 5);
zzz(i + 1, j * 10 + 7);
}
}
int main() {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int mod = 1e9 + 7;
vector<ll> z;
void zzz(int i, ll j) {
z.push_back(j);
if (i < 10) {
zzz(i + 1, j * 10 + 3);
zzz(i + 1, j * 10 + 5);
zzz(i + 1, j * 10 + 7);
}
}
int main() {
... | [
"variable_declaration.type.change"
] | 1,008,589 | 1,008,586 | u164007697 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int mod = 1e9 + 7;
vector<int> z;
void zzz(int i, int j) {
z.push_back(j);
if (i < 10) {
zzz(i + 1, j * 10 + 3);
zzz(i + 1, j * 10 + 5);
zzz(i + 1, j * 10 + 7);
}
}
int main() ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int mod = 1e9 + 7;
vector<ll> z;
void zzz(int i, ll j) {
z.push_back(j);
if (i < 10) {
zzz(i + 1, j * 10 + 3);
zzz(i + 1, j * 10 + 5);
zzz(i + 1, j * 10 + 7);
}
}
int main() {
... | [
"variable_declaration.type.change"
] | 1,008,590 | 1,008,586 | u164007697 | cpp |
p03212 | #include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define ll long long
ll judge753(ll a) {
bool flag3 = 0;
bool flag5 = 0;
bool flag7 = 0;
int tmp;
while (a > 0) {
tmp = a % 10;
if (tmp == 3)
flag3 = 1;
if (tmp == ... | #include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define ll long long
ll judge753(ll a) {
bool flag3 = 0;
bool flag5 = 0;
bool flag7 = 0;
int tmp;
while (a > 0) {
tmp = a % 10;
if (tmp == 3)
flag3 = 1;
if (tmp == ... | [
"variable_declaration.value.change"
] | 1,008,591 | 1,008,592 | u770161743 | cpp |
p03212 | #include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define ll long long
ll judge753(ll a) {
bool flag3 = 0;
bool flag5 = 0;
bool flag7 = 0;
int tmp;
while (a > 0) {
tmp = a % 10;
if (tmp == 3)
flag3 = 1;
if (tmp == 5... | #include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define ll long long
ll judge753(ll a) {
bool flag3 = 0;
bool flag5 = 0;
bool flag7 = 0;
int tmp;
while (a > 0) {
tmp = a % 10;
if (tmp == 3)
flag3 = 1;
if (tmp == ... | [
"variable_declaration.value.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,008,594 | 1,008,592 | u770161743 | cpp |
p03212 | #include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int judge753(ll a) {
int flag3, flag5, flag7;
int tmp;
flag3 = 0;
flag5 = 0;
flag7 = 0;
while (a > 0) {
tmp = a % 10;
if (tmp == 3)
... | #include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int judge753(ll a) {
int flag3, flag5, flag7;
int tmp;
flag3 = 0;
flag5 = 0;
flag7 = 0;
while (a > 0) {
tmp = a % 10;
if (tmp == 3)
... | [
"assignment.add",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,008,595 | 1,008,596 | u770161743 | cpp |
p03212 | #include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int judge753(ll a) {
int flag3, flag5, flag7;
int tmp;
flag3 = 0;
flag5 = 0;
flag7 = 0;
while (a > 0) {
tmp = a % 10;
if (tmp == 3)
... | #include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int judge753(ll a) {
int flag3, flag5, flag7;
int tmp;
flag3 = 0;
flag5 = 0;
flag7 = 0;
while (a > 0) {
tmp = a % 10;
if (tmp == 3)
... | [
"assignment.add"
] | 1,008,597 | 1,008,596 | u770161743 | cpp |
p03212 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> vec;
void dfs(ll x, int a, int b, int c, int d) {
if (a > 0 && b > 0 && c > 0)
vec.emplace_back(x);
if (d > 9)
return;
dfs(x * 10 + 7, a + 1, b, c, d + 1);
dfs(x * 10 + 5, a, b + 1, c, d ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> vec;
void dfs(ll x, int a, int b, int c, int d) {
if (a > 0 && b > 0 && c > 0)
vec.emplace_back(x);
if (d > 9)
return;
dfs(x * 10 + 7, a + 1, b, c, d + 1);
dfs(x * 10 + 5, a, b + 1, c, d ... | [
"identifier.change",
"call.function.change"
] | 1,008,603 | 1,008,604 | u126041136 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
multiset<int> st = {};
void f(long long int a) {
if (a > 1000000000)
return;
st.insert(a);
f(10 * a + 3);
f(10 * a + 5);
f(10 * a + 7);
}
void g(long long int a) {
if (a > 1000000000)
return;
st.erase(a);
g(10 * a + 3);
g(10 * a + 5);
}
void h(l... | #include <bits/stdc++.h>
using namespace std;
multiset<long long int> st = {1000000000};
void f(long long int a) {
if (a > 1000000000)
return;
st.insert(a);
f(10 * a + 3);
f(10 * a + 5);
f(10 * a + 7);
}
void g(long long int a) {
if (a > 1000000000)
return;
st.erase(a);
g(10 * a + 3);
g(10 ... | [
"literal.number.change",
"io.output.change"
] | 1,008,611 | 1,008,612 | u572077985 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
int n, ans;
set<int> a;
void dfs(string s) {
int x = 0, y = 0;
stringstream ss;
ss << s;
ss >> x;
y = x;
// cout<<"y="<<y<<endl;
if (x >= n)
return;
set<int> b;
while (x > 0) {
b.insert(x % 10);
x /= 10;
}
if (b == a) {
ans++;
// co... | #include <bits/stdc++.h>
using namespace std;
int n, ans;
set<int> a;
void dfs(string s) {
int x = 0, y = 0;
stringstream ss;
ss << s;
ss >> x;
y = x;
// cout<<"y="<<y<<endl;
if (x > n)
return;
set<int> b;
while (x > 0) {
b.insert(x % 10);
x /= 10;
}
if (b == a) {
ans++;
// cou... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,613 | 1,008,614 | u578038979 | cpp |
p03212 | #include <bits/stdc++.h>
#define rep(i, n, s) for (int(i) = 0; (i) < (n); (i) += (s))
using namespace std;
template <class T> void printv(vector<T> v) {
cout << '[';
for (auto vec : v) {
cout << vec << ' ';
}
cout << ']' << endl;
}
int vector_finder(std::vector<char> vec, char number) {
auto itr = fin... | #include <bits/stdc++.h>
#define rep(i, n, s) for (int(i) = 0; (i) < (n); (i) += (s))
using namespace std;
template <class T> void printv(vector<T> v) {
cout << '[';
for (auto vec : v) {
cout << vec << ' ';
}
cout << ']' << endl;
}
int vector_finder(std::vector<char> vec, char number) {
auto itr = fin... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,620 | 1,008,621 | u471368568 | cpp |
p03212 | #include <iostream>
using namespace std;
long long ruijou(long long m, long long n) {
long long i, a = 1;
for (i = 0; i < n; i++) {
a = a * m;
}
return a;
}
int main(void) {
long long N, n, i, sum;
cin >> N;
n = N;
if (N < 100) {
cout << 0 << endl;
return 0;
}
for (i = 0; n > 9; i++) {
... | #include <iostream>
using namespace std;
long long ruijou(long long m, long long n) {
long long i, a = 1;
for (i = 0; i < n; i++) {
a = a * m;
}
return a;
}
int main(void) {
long long N, n, i, sum;
cin >> N;
n = N;
if (N < 100) {
cout << 0 << endl;
return 0;
}
for (i = 0; n > 9; i++) {
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,008,624 | 1,008,625 | u965103758 | cpp |
p03212 | #include <iostream>
using namespace std;
long long ruijou(long long m, long long n) {
long long i, a = 1;
for (i = 0; i < n; i++) {
a = a * m;
}
return a;
}
int main(void) {
long long N, n, i, sum;
cin >> N;
n = N;
if (N < 100) {
cout << 0 << endl;
return 0;
}
for (i = 0; n > 9; i++) {
... | #include <iostream>
using namespace std;
long long ruijou(long long m, long long n) {
long long i, a = 1;
for (i = 0; i < n; i++) {
a = a * m;
}
return a;
}
int main(void) {
long long N, n, i, sum;
cin >> N;
n = N;
if (N < 100) {
cout << 0 << endl;
return 0;
}
for (i = 0; n > 9; i++) {
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"assignment.add"
] | 1,008,626 | 1,008,625 | u965103758 | cpp |
p03212 | //
// Created by albicilla on 2018/12/03.
//
#include "bits/stdc++.h"
#include <iostream>
#include <string>
using namespace std;
long long N;
long long ans;
void dfs(long long num, bool flag0, bool flag1, bool flag2) {
cerr << num << endl;
if (num < N && flag0 && flag1 && flag2)
ans++;
if (num > N)
re... | //
// Created by albicilla on 2018/12/03.
//
#include "bits/stdc++.h"
#include <iostream>
#include <string>
using namespace std;
long long N;
long long ans;
void dfs(long long num, bool flag0, bool flag1, bool flag2) {
cerr << num << endl;
if (num <= N && flag0 && flag1 && flag2)
ans++;
if (num > N)
r... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,632 | 1,008,633 | u373844230 | cpp |
p03212 | //
// Created by albicilla on 2018/12/03.
//
#include "bits/stdc++.h"
#include <iostream>
#include <string>
using namespace std;
long long N;
int ans;
void dfs(long long num, bool flag0, bool flag1, bool flag2) {
cerr << num << endl;
if (num < N && flag0 && flag1 && flag2)
ans++;
if (num > N)
return;
... | //
// Created by albicilla on 2018/12/03.
//
#include "bits/stdc++.h"
#include <iostream>
#include <string>
using namespace std;
long long N;
long long ans;
void dfs(long long num, bool flag0, bool flag1, bool flag2) {
cerr << num << endl;
if (num <= N && flag0 && flag1 && flag2)
ans++;
if (num > N)
r... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,634 | 1,008,633 | u373844230 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
const ll MOD = 1e9 + 7;
const int maxn = 1e6 + 10;
int main() {
int n;
cin >> n;
string _357 = "357";
if (n < 357) {
cout << 0 << endl;
} else {
vector<int> nums = {357, 375, 537, 573,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
const ll MOD = 1e9 + 7;
const int maxn = 1e6 + 10;
int main() {
int n;
cin >> n;
string _357 = "357";
if (n < 357) {
cout << 0 << endl;
} else {
vector<int> nums = {357, 375, 537, 573,... | [
"identifier.change",
"call.function.change"
] | 1,008,635 | 1,008,636 | u666721654 | cpp |
p03212 | #include <iostream>
#include <string>
using namespace std;
#define CONTAIN357(s) \
((string::npos != s.find('3')) && (string::npos != s.find('5')) && \
(string::npos != s.find('7')))
string s357 = "357";
int f(string s, int n) {
int ans = 0;
... | #include <iostream>
#include <string>
using namespace std;
#define CONTAIN357(s) \
((string::npos != s.find('3')) && (string::npos != s.find('5')) && \
(string::npos != s.find('7')))
string s357 = "357";
int f(string s, int n) {
int ans = 0;
... | [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 1,008,656 | 1,008,657 | u177739577 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
const int maxN = 2000005;
const int INF = 999999999;
vector<int> w[20];
char s[maxN];
int a[20];
int tag[10];
char t[4] = {0, 3, 5, 7};
int n;
b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
const int maxN = 2000005;
const int INF = 999999999;
vector<int> w[20];
char s[maxN];
int a[20];
int tag[10];
char t[4] = {0, 3, 5, 7};
int n;
b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,008,658 | 1,008,659 | u807919574 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.