buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k |
|---|---|---|---|---|
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
///////////////////////////////////////////////////
int n = in.nextInt();
int k = in.nextInt();
String[] hate ... | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
///////////////////////////////////////////////////
int n = in.nextInt();
int k = in.nextInt();
String[] hate ... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 31, 22], ["-", 0, 195, 8, 196, 0, 7, 15, 16, 17, 18], ["-", 0, 195, 8, 196, 0, 7, 15, 16, 12, 499], ["-", 0, 195, 8, 196, 0, 1, 0, 492, 500, 22], ["-", 0, 195, 8, 196, 0, 1, 0, 492, 0, 131], ["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["-"... | 3 | 352 |
#include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define ALL(c) c.begin(), c.end()
#define LOOP(i) while (i--)
#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 LOOP(i) while (i--)
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << '... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 91, 17, 111], ["+", 15, 339, 51, 16, 12, 91, 28, 23, 0, 24], ["+", 28, 23, 0, 16, 31, 16, 31, 91, 17, 111], ["+", 28, 23, 0, 16, 31, 16, 31, 91, 28, 22], ["+", 12, 91, 28, 23, 0, 16, 31, 16, 17, 98], ["+", 0, 16, 31, 16, 12, 16, 31, 69, 28,... | 1 | 390 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) ((v).begin(), (v).... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) ((v).begin(), (v).... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, ... | 1 | 202 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> d(k);
rep(i, k) { cin >> d[i]; }
for (int i = n; i < 10000; i++) {
int num = i;
bool ans = true;
while (n... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> d(k);
rep(i, k) { cin >> d[i]; }
for (int i = n; i < 100000; i++) {
int num = i;
bool ans = true;
while (... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 17, 90], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, ... | 1 | 153 |
import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int K = Integer.p... | import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int K = Integer.p... | [["+", 8, 498, 0, 195, 8, 196, 0, 503, 39, 523], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 141, 22], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 0, 32], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 51, 147], ["+", 8, 498, 0, 195, 8, 196, 0, 503, 0, 35], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 15, 0... | 3 | 334 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> mp(10);
bool valid(int n) {
while (n) {
int tmp = n % 10;
for (int i : mp)
if (i == tmp)
return false;
n /= 10;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k, ans ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int k;
vector<int> mp(10);
bool valid(int n) {
while (n) {
int tmp = n % 10;
for (int i = 0; i < k; ++i)
if (mp[i] == tmp)
return false;
n /= 10;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NU... | [["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["-", 8, 9, 0, 52, 8, 9, 0, 338, 0, 102], ["-", 8, 9, 0, 52, 8, 9, 0, 338, 12, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 52, 8, ... | 1 | 147 |
#include <bits/stdc++.h>
using namespace std;
#define f(i, a, b) for (int(i) = int(a); i <= int(b); i++)
#define ff(i, a, b) for (int(i) = int(a); i < int(b); i++)
#define F(i, a, b) for (int(i) = int(a); i >= int(b); i--)
#define foreach(i, x) \
for (typeof((c... | #include <bits/stdc++.h>
using namespace std;
#define f(i, a, b) for (int(i) = int(a); i <= int(b); i++)
#define ff(i, a, b) for (int(i) = int(a); i < int(b); i++)
#define F(i, a, b) for (int(i) = int(a); i >= int(b); i--)
#define foreach(i, x) \
for (typeof((c... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-"... | 1 | 267 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
scanf("%d %d", &N, &K);
int tmp;
vector<bool> D(10, true);
for (int i = 0; i < K; i++) {
scanf("%d", &tmp);
D[tmp] = false;
}
int j, i10;
start:
for (int i = 1; i <= 5; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
scanf("%d %d", &N, &K);
int tmp;
vector<bool> D(10, true);
for (int i = 0; i < K; i++) {
scanf("%d", &tmp);
D[tmp] = false;
}
int j, i10;
start:
for (int i = 4; i >= 0; i--) {
... | [["-", 0, 97, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 97, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 97, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 97, 0, 7, 15, 16, 12, 13], ["+", 8, 9, 0, 97, 0, 7, 15, 16, 17, 20], ["+", 8, 9, 0, 97, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 97, 0, 7, 26, 27, 17, 29], ["+", 8, 9, 0, 97, 0,... | 1 | 193 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
#define rep0(i, j) for (int i = 0; i < j; i++)
#define rep1(i, j) for (int i = 1; i <= j; i++)
#define rep0d(i, j) for (int i = j - 1; i >= 0; i--)
#define MOD 1000000007
#define M... | #include <bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
#define rep0(i, j) for (int i = 0; i < j; i++)
#define rep1(i, j) for (int i = 1; i <= j; i++)
#define rep0d(i, j) for (int i = j - 1; i >= 0; i--)
#define MOD 1000000007
#define M... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 9, 0, 45], ["-", 8, 9, 0, 9, 0, 1, 0, 16, 31, 22], ["-", 8, 9, 0, 9, 0, 1, 0, 16, 17, 152], ["-", 8, 9, 0, 9, 0, 1, 0, 16... | 1 | 1,390 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
int dn[10];
rep(i, 10) dn[i] = 0;
int di;
rep(i, k) {
cin >> di;
dn[di] = 1;
}
int x = n;
while (true) {
for (char c : to_string(x... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
int dn[10];
rep(i, 10) dn[i] = 0;
int di;
rep(i, k) {
cin >> di;
dn[di] = 1;
}
int x = n;
while (true) {
bool flg = true;
for... | [["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 146], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["+", 0, 338, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1,... | 1 | 130 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i... | [["+", 36, 36, 36, 36, 0, 656, 0, 686, 0, 314], ["+", 36, 36, 0, 656, 0, 686, 687, 673, 0, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 686, 0, 487], ["+", 36, 36, 0, 656, 0, 686, 141, 673, 0, 22], ["+", 64, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 2... | 5 | 287 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i... | [["+", 0, 662, 12, 206, 51, 206, 206, 663, 0, 102], ["+", 0, 1, 0, 662, 12, 206, 51, 206, 0, 73], ["+", 64, 196, 0, 1, 0, 662, 12, 206, 0, 70], ["+", 8, 196, 0, 1, 0, 662, 12, 206, 0, 70], ["+", 0, 1, 0, 662, 12, 206, 206, 663, 0, 102], ["+", 8, 196, 0, 1, 0, 662, 12, 206, 0, 73], ["-", 0, 656, 0, 52, 8, 196, 0, 7, 0, ... | 5 | 287 |
/*
author: Salam_35
Created at :
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define sc(n) scanf("%d", &n)
#define Max 100005
#define scan(n) scanf("%lld", &n)
#define pi acos(-1.0)
#define _fastio ... | /*
author: Salam_35
Created at :
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define sc(n) scanf("%d", &n)
#define Max 100005
#define scan(n) scanf("%lld", &n)
#define pi acos(-1.0)
#define _fastio ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 0, 32], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 30, 0, 14, 8, 9... | 1 | 330 |
import sys
input_methods=['clipboard','file','key']
using_method=1
input_method=input_methods[using_method]
IN=lambda : map(int, input().split())
mod=1000000007
#+++++
def next(v, cu):
for i in cu:
if i >= v:
return i
else:
return -1
def main():
n, k = IN()
al = list(IN())
cu=[]
for i in range(10):
... | import sys
input_methods=['clipboard','file','key']
using_method=1
input_method=input_methods[using_method]
IN=lambda : map(int, input().split())
mod=1000000007
#+++++
def next(v, cu):
for i in cu:
if i > v:
return i
else:
return -1
def main():
n, k = IN()
al = list(IN())
cu=[]
for i in range(10):
i... | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 667, 20], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["+", 0, 57, 75, 76, 8, 196, 0, 57, 0, 102], ["+", 8, 196, 0, 57, 64, 196, 0, 57, 0, 121], ["+", 0, 57, 64, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 57, 64, 196, 0, 57, 15, 666, 667, 79], ["+", 0, 57, 64, 196, 0, 57, 15, 666, 0, 6... | 5 | 478 |
#include <bits/stdc++.h>
using namespace std;
int n, k, d[9];
int main() {
cin >> n >> k;
for (int i = 0; i < k; ++i)
cin >> d[i];
for (int i = n; i < 10000; ++i) {
string s = to_string(i);
bool ok = true;
for (int p = 0; p < s.size(); ++p) {
for (int q = 0; q < k; ++q) {
if (s[p... | #include <bits/stdc++.h>
using namespace std;
int n, k, d[9];
bool ok;
int main() {
cin >> n >> k;
for (int i = 0; i < k; ++i)
cin >> d[i];
for (int i = n;; ++i) {
string s = to_string(i);
ok = true;
for (int p = 0; p < s.size(); ++p) {
for (int q = 0; q < k; ++q) {
if (s[p] == (... | [["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 15, 339, 51, ... | 1 | 151 |
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_upper... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_upper... | [["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 3, 4, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, ... | 5 | 297 |
def function(m, set1):
set2 = set(str(m))
if len(set1 & set2) > 0:
return False
else:
return True
def function(n, set1):
m = n
while not function(m, set1):
m += 1
return m
line1 = input().split()
n = int(line1[0])
k = int(line1[1])
list1 = []
for i in range(k):
list1.append(int(input()))
set1... | def function1(m, set1):
set2 = set(str(m))
if len(set1 & set2) > 0:
return False
else:
return True
def function(n, set1):
m = n
while not function1(m, set1):
m += 1
return m
line1 = input().split()
n = int(line1[0])
k = int(line1[1])
list1 = input().split()
set1 = set(list1)
print(function(n, ... | [["-", 36, 36, 36, 36, 0, 656, 0, 14, 141, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 14, 141, 22], ["-", 8, 196, 0, 52, 15, 681, 28, 652, 63, 22], ["+", 8, 196, 0, 52, 15, 681, 28, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 662, 12, 634, 0, 70], ["-", 0, 656, 0, 1, 0, 662, 12, 634, 0, 73], ["-", 36, 36, 36, 36, 0, 656, 0, 7, 0, ... | 5 | 123 |
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a... | [["-", 0, 2, 3, 4, 0, 16, 31, 74, 0, 24], ["-", 3, 4, 0, 16, 31, 74, 39, 77, 39, 40], ["-", 0, 2, 3, 4, 0, 16, 31, 74, 0, 25], ["-", 3, 4, 0, 16, 31, 74, 51, 2, 63, 22], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 17, 131], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["-", 0, 16, 31, 74, ... | 1 | 312 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#def... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#def... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ... | 1 | 376 |
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.Comparator;
import java.util.Map.*;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner(System.in);
Long N = sc.nextLong();
int K = sc.nextIn... | import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.Comparator;
import java.util.Map.*;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner(System.in);
Long N = sc.nextLong();
int K = sc.nextIn... | [["-", 8, 196, 0, 7, 8, 196, 0, 514, 0, 88], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["-", 8, 196, 0, 7, 8, 196, 0, 514, 39, 78], ["-", 8, 196, 0, 7, 8, 196, 0, 514, 141, 22], ["-", 8, 196, 0, 7, 8, 196, 0, 514, 0, 102], ["+", 0, 57, 15, 15, 0, 492, 500, 492, 500, 22], ["+", 0, 57, 15, 15, 0, 492, 500, 492, 0, 131]... | 3 | 1,741 |
import itertools
n,k = map(int,input().split())
unlike = list(map(int,input().split()))
like = []
for i in range(0,10):
if not(i in unlike):
like.append(i)
if unlike == [0]:
print(n)
exit()
i = 1
ans = 0
while(i < 99):
current = list(itertools.product(like,repeat=i))
for j in range(len(curre... | import itertools
n,k = map(int,input().split())
unlike = list(map(int,input().split()))
like = []
for i in range(0,10):
if not(i in unlike):
like.append(i)
i = 1
ans = 0
while(i < 99):
current = list(itertools.product(like,repeat=i))
for j in range(len(current)):
h = int("".join(map(str,(lis... | [["-", 36, 36, 36, 36, 0, 656, 0, 57, 0, 121], ["-", 36, 36, 0, 656, 0, 57, 15, 666, 0, 22], ["-", 36, 36, 0, 656, 0, 57, 15, 666, 667, 60], ["-", 0, 656, 0, 57, 15, 666, 0, 634, 0, 70], ["-", 0, 656, 0, 57, 15, 666, 0, 634, 0, 612], ["-", 0, 656, 0, 57, 15, 666, 0, 634, 0, 73], ["-", 36, 36, 36, 36, 0, 656, 0, 57, 0, ... | 5 | 156 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, k, i, j, keta = 0, num;
vector<int> d;
void dfs(int);
int main() {
cin >> n >> k;
d.resize(k);
for (i = 0; i < k; i++) {
cin >> d[i];
}
dfs(n);
return 0;
}
void dfs(int x) {
int dis, div = 1;
num = x;
while (num > 0) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, k, i, j;
vector<int> d;
void dfs(int);
int main() {
cin >> n >> k;
d.resize(k);
for (i = 0; i < k; i++) {
cin >> d[i];
}
dfs(n);
return 0;
}
void dfs(int x) {
int dis, div = 1, keta = 0, num = x;
while (num > 0) {
n... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["-", 36, 36, 0, 30, 0, 43, 49, 50, 49, 22], ["-", 36, 36, 0, 30, 0, 43, 49, 50, 0, 32], ["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 14, 8... | 1 | 219 |
#include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
int main() {
ll N, K, a, b, c, d, e;
cin >> N >> K;
vector<int> D;
for... | #include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdlib.h>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
int main() {
ll N, K, a, b, c, e;
string d;
cin >> N >> K;
vector<int>... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11,... | 1 | 210 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S sec... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S sec... | [["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 0, 35], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 12, 74, 51, 2, 3, 4, 0, 16, 17, 72], ["-", 12, 74, 51, 2, 3, 4, 0, 16, 12, 13], ["+", 12, 74, 51, 2, 3, 4, 0, 16, 17, 33], ["+", 12, 74, 51, 2, 3, 4, 0,... | 1 | 323 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
vector<bool> data(10, true);
for (int i = 0; i < k; i++) {
int a;
cin >> a;
data[a] = false;
}
for (int i = n; i <= 1000000; i++) {
s = to_string(i);
bool ok = true;
for (int j = 0; j < s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<bool> d(10, true);
for (int i = 0; i < k; i++) {
int a;
cin >> a;
d[a] = false;
}
for (int i = n; i <= 1000000; i++) {
string s = to_string(i);
bool ok = true;
for (int j = 0; j < s.size(); j+... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 8, 9, 0, 7, 8, 9, ... | 1 | 153 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#d... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#d... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["-", 0, 52, 8, 9, 0, 57, 15, 339, 0, 24], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 0, 52, 8, ... | 1 | 302 |
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define ir... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define ir... | [["+", 0, 14, 8, 9, 0, 9, 0, 57, 0, 121], ["+", 8, 9, 0, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 9, 0, 57, 15, 339, 51, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 69, 341, 342, 0, 70], ["+", 0, 57, 15, 339, 51, 69, 341, 342, 0, 22], ["+", 0, 57, 15, 339, 51, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 9, 0, 57, 15, 339, 0, 25]] | 1 | 457 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["+", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ... | 1 | 618 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 24], ["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 21], ["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 25], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 51, 16, 31, 2, 3, 4, 0, 16, 17, 72], ["-", 51, 16, 31, 2, 3, 4, 0, 16... | 1 | 714 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
int d[k];
rep(i, k) { cin >> d[i]; }
for (int i = n; i <= 10 * n; i++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
int d[k];
rep(i, k) { cin >> d[i]; }
for (int i = n; i <= 10 * n; i++... | [["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 0, 35], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22], ["-", 0, 57, 15, 339, 51,... | 1 | 154 |
import functools
n,k=map(int,input().split())
d=list(map(int,input().split()))
for i in range(n,n*11):
l = [int(x) for x in list(str(i))]
for j in l:
#print(j)
if j in d :
break
print( int(functools.reduce(lambda x, y: x + y, [str(x) for x in l])))
exit() | import functools
n,k=map(int,input().split())
d=list(map(int,input().split()))
for i in range(n,n*11):
count=0
l = [int(x) for x in list(str(i))]
for j in l:
#print(j)
if j not in d :
count+=1
if count==len(l):
print( int(functools.reduce(lambda x, y: x + y, [str(x... | [["+", 0, 7, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 12, 612], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 699], ["-", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 17, 107], ["+", 0... | 5 | 110 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String n = sc.next();
int k = sc.nextInt();
Set<Integer> digitSet = new HashSet<>();
for (int i = 0; i < k; i++)
digitSet.add(sc.nextInt());
char[] charArr = n.toCharAr... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String n = sc.next();
int k = sc.nextInt();
Set<Integer> digitSet = new HashSet<>();
for (int i = 0; i < k; i++)
digitSet.add(sc.nextInt());
char[] charArr = n.toCharAr... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 31, 22], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 31, 22], ["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 0, 57, 15, 15, 0, 16, 12, 504, 516, 22], ["+", 0, 57, 15, 15, 0, 16, 12, 504, 0, 70], ["+", 0, 57, 15, 15, 0, 16, 12, 504, 71, 22], ["+", 0, 57, 15, 15, 0, 16, 12, 504, 0, 73], ... | 3 | 383 |
#include <iostream>
using namespace std;
int main(void) {
int n, k;
int d;
int kirai[11] = {0};
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> d;
kirai[d] = 1;
}
while (true) {
int man = n / 10000;
int sen = (n / 1000) % 10;
int hyaku = (n / 100) % 10;
int juu = (n / 10)... | #include <iostream>
using namespace std;
int main(void) {
int n, k;
int d;
int kirai[11] = {0};
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> d;
kirai[d] = 1;
}
while (true) {
int man = n >= 10000 ? n / 10000 : 10;
int sen = n >= 1000 ? (n / 1000) % 10 : 10;
int hyaku = n >... | [["+", 0, 43, 49, 50, 51, 41, 15, 16, 17, 20], ["+", 0, 43, 49, 50, 51, 41, 15, 16, 12, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 41, 0, 101], ["+", 0, 43, 49, 50, 51, 41, 64, 16, 31, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 41, 0, 102], ["+", 8, 9, 0, 43, 49, 50, 51, 41, 75, 13], ["+", 0, 43, 49, 50, 51, 41, 15, 16, 31, 22], ["+... | 1 | 157 |
n, k = map(int, input().split())
ds = input().split()
for i in range(n, 10001):
ok = True
for s in str(i):
if s in ds:
ok = False
break
if ok:
print(i)
break | n, k = map(int,input().split())
ds = set(input().split())
for i in range(n, n + 100000):
ok = True
for j in str(i):
if j in ds:
ok = False
break
if ok:
print(i)
break | [["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 31, 22], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612], ["-", 0, 6... | 5 | 63 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
/**
* for (int i = 0; i < N; i++) {}
* System.out.println();
* HashMap<Integer, Integer> hm = new HashMap<>();
* int[] s = new int[M];
* ArrayDeque<Integer> ... |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
/**
* for (int i = 0; i < N; i++) {}
* System.out.println();
* HashMap<Integer, Integer> hm = new HashMap<>();
* int[] s = new int[M];
* ArrayDeque<Integer> ... | [["-", 8, 196, 0, 1, 0, 492, 500, 509, 500, 22], ["-", 8, 196, 0, 1, 0, 492, 500, 509, 0, 131], ["-", 8, 196, 0, 1, 0, 492, 500, 509, 119, 22], ["-", 0, 246, 8, 196, 0, 1, 0, 492, 0, 131], ["-", 0, 246, 8, 196, 0, 1, 0, 492, 141, 22], ["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], [... | 3 | 625 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int power(int n) {
int res = 1;
whil... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int power(int n) {
int res = 1;
whil... | [["-", 8, 9, 0, 14, 8, 9, 0, 1, 0, 22], ["-", 8, 9, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 7, 10, 43, 49, 50, 51, 2, 63, 22], ["-", 10, 43, 49, 50, 51, 2, 3, 4, 0, 24], ["-", 51, 2, 3, 4, 0, 16, 31, 2, 63, 22], ["-", 3, 4, 0, 16, 31, 2, 3, 4, 0, 24], ["-", 3, 4, 0, 16, 31, 2, 3, 4, 0, 25], ["-", 49, 50, 51, 2, 3, 4, 0, 16... | 1 | 308 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
#define str(n) to_string(n)
#define int(w) stoi(w)
#define len(l) l.size()
#define append(l, i) l.push_back(i)
int main() {
int n, k, n1;
cin >> n >> k;
map... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
#define str(n) to_string(n)
#define int(w) stoi(w)
#define len(l) l.size()
#define append(l, i) l.push_back(i)
int main() {
int n, k, n1;
cin >> n >> k;
map... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 14, 8, 9, 0, 57, 0, 121], ["-", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["-", 51, 16, 31, 69, 341, 342, 0, 2, 63, 22], ["-", 31,... | 1 | 213 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
#define ff first
#define ss second
#define pb push_back
#define mp mak... | #pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
typedef long double ld;
typ... | [["+", 36, 36, 36, 36, 0, 30, 0, 181, 182, 183], ["+", 36, 36, 36, 36, 0, 30, 0, 181, 28, 59], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 49, 53, 54, 55, 0, 56, 49, 84, 0, 48], ["-", 49, 53, 54, 55, 0, 56, 49, 84, 49, 22], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 49, 53, 54, 55, 0, 56, 49, 352, 0, 67]... | 1 | 860 |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
List<Integer> hatenum = new ArrayList<>();
List<Integer> oneToTen =
new ... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
List<Integer> hatenum = new ArrayList<>();
List<Integer> oneToTen =
new ... | [["-", 8, 196, 0, 7, 15, 16, 31, 91, 17, 33], ["-", 8, 196, 0, 7, 15, 16, 31, 91, 439, 499], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 31, 22], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 12, 499], ["+", 8, 196, 0, 52, 8, 196, 0, 7, 0, 35], ["+", 0, 52, 8, 196, 0, 7, 26, 27, 0, 22], ["+", 0, 52, 8, 196, 0, 7, 26, 27, 0, 29], ["+", 8, ... | 3 | 331 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int pay = sc.nextInt();
int len = sc.nextInt();
boolean[] disable = new boolean[10];
for (int i = 0; i < len; i++) {
disable[sc.nextInt()] = true;
}
sc.nextLi... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int pay = sc.nextInt();
int len = sc.nextInt();
boolean[] disable = new boolean[10];
for (int i = 0; i < len; i++) {
disable[sc.nextInt()] = true;
}
sc.nextLi... | [["+", 64, 196, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 31, 22], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 17, 109], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 12, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25], ["+", 8, 196, 0, 57, 64, 196, 0, 1, 0, 35], ["+", 0,... | 3 | 153 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
bool judge_f(int N, int K, vector<int> D) {
bool judge = false;
while (!judge && N > 0) {
rep(i, K) {
if (N % 10 == D.at(i)) {
judge = true; // trueなら入っている
return judge;
}
}
N ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
bool judge_f(int N, int K, vector<int> D) {
bool judge = false;
while (!judge && N > 0) {
rep(i, K) {
if (N % 10 == D.at(i)) {
judge = true; // trueなら入っている
return judge;
}
}
N ... | [["-", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 27, 17, 29], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16... | 1 | 160 |
n,k = map(int, input().split())
li = list(map(int, input().split()))
Li = list(n)
while len(set(Li)&set(li)):
n += 1
Li = list(n)
else: print("".join(Li)) | n,k = map(str, input().split())
li = list(map(str, input().split()))
Li = list(n)
while len(set(Li)&set(li)):
n = int(n)+1
Li = list(str(n))
else: print("".join(Li)) | [["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["-", 0, 52, 8, 196, 0, 1, 0, 677, 17, 107], ["+", 0, 52, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 1, 0, 662, 12, 657, 31, 652, 63, 22], ["+", 0, 662... | 5 | 74 |
#include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) cout << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
int main() {
string N;
int K;
cin >> N >> K;
set<int> ds;
for (int i = 0; i < K; ++i) {
int d;
cin >> d;
ds.insert(d);
}
int min_not_in_ds = -1;
for ... | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) cout << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
int main() {
string N;
int K;
cin >> N >> K;
set<int> ds;
for (int i = 0; i < K; ++i) {
int d;
cin >> d;
ds.insert(d);
}
int min_not_in_ds = -1;
for ... | [["+", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["+", 64,... | 1 | 375 |
N,K=input().split()
D=input().split()
while True:
for s in D:
if N.count(s)!=0:
frag=1
else:
pass
if frag==1:
a=int(N)+1
N=str(a)
frag=0
else:
break
print(N) | N,K=input().split()
D=input().split()
frag=0
while True:
for s in D:
if N.count(s)!=0:
frag=1
else:
pass
if frag==1:
a=int(N)+1
N=str(a)
else:
break
frag=0
print(N) | [["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 12, 612], ["-", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["-", 0, 57, 64, 196, 0, 1, 0, 662, 0, 32], ["-", 0, 57, 64, 196, 0, 1, 0, 662, 12, 612], ["+", 0, 52, 8, 196, 0, 1, 0, 662, 31, 22], ["+",... | 5 | 73 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> v;
v = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
for (int i = 0; i < K; i++) {
int value_to_remove;
cin >> value_to_remove;
v.erase(remove(v.begin(), v.end(), value_to_remove), v.end());
} // v内は使える数字に変化
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> v;
v = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
for (int i = 0; i < K; i++) {
int value_to_remove;
cin >> value_to_remove;
v.erase(remove(v.begin(), v.end(), value_to_remove), v.end());
} // v内は使える数字に変化
for... | [["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 146], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 147], ["-", 0, 7, 15, 16, 12, 16, 31, 2, 63, 22], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 17, 131], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 119, 120], ["-", 15, 16, 12, 16, 31, 2, 3, 4, 0, 22], ["-", 8,... | 1 | 238 |
<?php
fscanf(STDIN, '%d %d', $n,$k);
$d = explode(' ', rtrim(fgets(STDIN),PHP_EOL));
for ($i=$n;$i<10000;$i++) {
$str = str_split($i);
$cnt = 0;
foreach($str as $value){
if(in_array($value, $d)){
continue 2;
};
$cnt += 1;
if($cnt == count($str)){
... | <?php
fscanf(STDIN, '%d %d', $n,$k);
$d = explode(' ', trim(fgets(STDIN)));
for ($i=$n;$i<=100000;$i++) {
$na = str_split($i);
$cnt = 0;
foreach($na as $value){
if(in_array($value, $d)){
continue 2;
};
$cnt += 1;
if($cnt == count($na)){
print($... | [["-", 12, 613, 3, 3, 0, 28, 0, 613, 63, 141], ["+", 12, 613, 3, 3, 0, 28, 0, 613, 63, 141], ["-", 3, 3, 0, 28, 0, 613, 3, 3, 0, 21], ["-", 0, 28, 0, 613, 3, 3, 0, 28, 0, 141], ["-", 36, 36, 0, 493, 0, 7, 0, 16, 17, 18], ["-", 36, 36, 0, 493, 0, 7, 0, 16, 12, 612], ["+", 36, 36, 0, 493, 0, 7, 0, 16, 17, 19], ["+", 36, ... | 6 | 122 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, buf, ans;
bool flag;
cin >> N >> K;
vector<int> D(K);
for (int i = 0; i < K; i++) {
cin >> D.at(i);
}
for (int i = N; i < 10000; i++) {
buf = i;
flag = true;
while (buf != 0) {
for (int j = 0; j < K; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, buf, ans;
bool flag;
cin >> N >> K;
vector<int> D(K);
for (int i = 0; i < K; i++) {
cin >> D.at(i);
}
for (int i = N;; i++) {
buf = i;
flag = true;
while (buf != 0) {
for (int j = 0; j < K; j++) {
if (D[j] =... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111], ["+", 8, 9, 0, 57, 15, 339, 51, 91, 28, 22], ["+", 0, 52, 8, 9,... | 1 | 153 |
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
private static boolean isValid(int n, Set<Integer> valid) {
while (n > 0) {
if (!valid.contains(n % 10)) {
return false;
}
n /= 10;
}
return true;
}
public... | import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
private static boolean isValid(int n, Set<Integer> valid) {
while (n > 0) {
if (!valid.contains(n % 10)) {
return false;
}
n /= 10;
}
return true;
}
public... | [["-", 8, 196, 0, 7, 502, 503, 39, 506, 0, 507], ["-", 8, 196, 0, 7, 502, 503, 49, 200, 141, 22], ["-", 8, 196, 0, 7, 502, 503, 49, 200, 0, 32], ["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 22], ["-", 0, 530, 8, 196, 0, 7, 502, 503, 0, 35], ["-", 0, 530, 8, 196, 0, 7, 15, 16, 31, 22], ["-", 0, 530, 8, 196, 0, 7, 15, 16, ... | 3 | 228 |
N,K=map(int,input().split())
D=list(map(str,input().split()))
for k in range(100*N):
N += 1
for j in range(len(str(N))):
if str(N)[j] in D:
break
else:
print(N)
exit()
| N,K=map(int,input().split())
D=list(map(str,input().split()))
for k in range(9*N):
N += 1
for j in range(len(str(N-1))):
if str(N-1)[j] in D:
break
else:
print(N-1)
exit()
| [["-", 0, 7, 12, 652, 3, 4, 0, 657, 31, 612], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 31, 612], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 33], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 12, 612], ["+", 0, 206, 51, 652, 3, 4, 0, 657, 17, 33], ["+", 0, 206, 51, 652, 3, 4, 0, 657, 12, 612], ["+", 0, 1, 0, 652, 3, 4, 0, 657, 17, 33], ["+", ... | 5 | 81 |
n, k = map(int, input().split())
list_num = [input() for i in range(k)]
price = n
while True :
i = 0
for i in range(len(str(price))) :
if str(price)[i] in list_num :
price += 1
break
else :
print(price)
break | n, k = map(int, input().split())
list_num = [i for i in input().split()]
price = n
while True :
i = 0
for i in range(len(str(price))) :
if str(price)[i] in list_num :
price += 1
break
else :
print(price)
break | [["-", 0, 1, 0, 662, 12, 658, 8, 652, 63, 22], ["-", 0, 662, 12, 658, 8, 652, 3, 4, 0, 24], ["-", 0, 662, 12, 658, 8, 652, 3, 4, 0, 25], ["+", 0, 656, 0, 1, 0, 662, 12, 658, 8, 22], ["-", 0, 662, 12, 658, 0, 659, 12, 652, 63, 22], ["+", 0, 659, 12, 652, 63, 319, 500, 652, 63, 22], ["-", 12, 658, 0, 659, 12, 652, 3, 4, ... | 5 | 75 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = INT_MAX;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = INT_MAX;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107], ["-", 64, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["-", 12, 2, 3, 4, 0, 16, 31, 16, 31, 22], ["-", 12, 2, 3, 4, 0, 16, 31,... | 1 | 333 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = INT_MAX;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = INT_MAX;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["-", 0, 30, 0, 14, 8, 9,... | 1 | 217 |
from functools import lru_cache
N, K = map(int, input().split())
D = input().split()
O = []
for c in "0123456789":
if c not in D:
O.append(c)
# N = 523
# D = 2 3
#@lru_cache()
def func(s, i, over):
if i == len(s):
return ""
# d < N[0]
if over:
return O[0] + func(s, i+1, over=... | from functools import lru_cache
N, K = map(int, input().split())
D = input().split()
O = []
for c in "0123456789":
if c not in D:
O.append(c)
# N = 523
# D = 2 3
#@lru_cache()
def func(s, i, over):
if i == len(s):
return ""
# d < N[0]
if over:
return O[0] + func(s, i+1, over=... | [["-", 0, 656, 0, 14, 8, 196, 0, 7, 0, 88], ["-", 0, 656, 0, 14, 8, 196, 0, 7, 31, 22], ["-", 0, 656, 0, 14, 8, 196, 0, 7, 0, 267], ["-", 0, 14, 8, 196, 0, 7, 12, 652, 63, 22], ["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 24], ["-", 0, 7, 12, 652, 3, 4, 0, 652, 63, 22], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["-", 12, 652... | 5 | 232 |
n, k = map(int, input().split())
d = set(map(int, input().split()))
inf = 10 * n + 1
stop = len(str(n)) + 1
num = []
for i in range(10):
if i in d:
pass
else:
num.append(i)
def dfs(pos, x):
if pos == stop:
if x >= n:
return x
else:
return inf
re... | n, k = map(int, input().split())
d = set(map(int, input().split()))
inf = 10 * n + 1
stop = len(str(n))
num = []
for i in range(10):
if i in d:
pass
else:
num.append(i)
def dfs(pos, x):
if pos == stop:
if x >= n:
return x
else:
return inf
ret = ... | [["-", 0, 656, 0, 1, 0, 662, 12, 657, 17, 72], ["-", 0, 656, 0, 1, 0, 662, 12, 657, 12, 612], ["+", 8, 196, 0, 37, 0, 652, 3, 4, 0, 25], ["+", 36, 36, 36, 36, 0, 656, 0, 57, 0, 121], ["+", 0, 656, 0, 57, 15, 666, 0, 652, 63, 22], ["+", 0, 57, 15, 666, 0, 652, 3, 4, 0, 24], ["+", 0, 57, 15, 666, 0, 652, 3, 4, 0, 612], [... | 5 | 135 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int price = sc.nextInt();
int ngnum = sc.nextInt();
String[] ng = new String[ngnum];
for (int i = 0; i < ngnum; i++) {
ng[i] = sc.next();
}
boolean isOk = true;
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String price = sc.next();
int pricenum = Integer.parseInt(price);
int num = sc.nextInt();
String[] ng = new String[num];
for (int i = 0; i < num; i++) {
ng[i] = sc... | [["-", 36, 36, 0, 493, 0, 454, 0, 525, 0, 48], ["+", 36, 36, 0, 493, 0, 454, 0, 522, 141, 22], ["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 8, 498, 0, 195, 8, 196, 0, 503, 39, 78], ["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["-", 0, 195, 8, 196, 0, 503, ... | 3 | 174 |
N, _ = list(map(int, input().split()))
d = set(list(input().replace(" ", "")))
for i in range(1,1000001):
n = str(N*i)
ns = set(list(n))
flg = False
for t in ns:
if t in d:
flg = True
break
if flg == False:
print(n)
exit()
print(0) | N, _ = list(map(int, input().split()))
d = set(list(input().replace(" ", "")))
for i in range(N,10*N+1):
n = str(i)
ns = set(list(n))
flg = False
for t in ns:
if t in d:
flg = True
break
if flg == False:
print(n)
exit()
print(0) | [["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 22], ["+", 12, 652, 3, 4, 0, 657, 31, 657, 31, 612], ["+", 12, 652, 3, 4, 0, 657, 31, 657, 17, 48], ["+", 12, 652, 3, 4, 0, 657, 31, 657, 12, 22], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612], [... | 5 | 100 |
N, K = map(int, input().split())
D = list(map(int, input().split()))
flg = True
while True:
num = str(N)
for i in range(len(num)):
if num[i] in D:
flg = False
break
if fig is True:
print(int(num))
break
N += 1
| N, K = map(int, input().split())
D = list(map(str, input().split()))
while True:
flg = True
num = str(N)
for i in range(len(num)):
if num[i] in D:
flg = False
break
if flg is True:
print(int(num))
break
N += 1 | [["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 12, 146], ["+", 0, 52, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 52, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 52... | 5 | 84 |
import sys
input = sys.stdin.readline
N, K = [int(x) for x in input().split()]
D = [str(x) for x in input().rstrip()]
D = set(D)
for i in range(N, N + 10 ** 4):
i_list = list(str(i))
for j in i_list:
if j in D:
break
print(i)
sys.exit()
| import sys
input = sys.stdin.readline
N, K = [int(x) for x in input().split()]
D = [str(x) for x in input().rstrip().split()]
D = set(D)
for i in range(N, N + 10 ** 6):
i_list = list(str(i))
flag = 1
for j in i_list:
if j in D:
flag = 0
break
if flag:
print(i)
... | [["+", 12, 658, 0, 659, 12, 652, 63, 319, 0, 131], ["+", 12, 658, 0, 659, 12, 652, 63, 319, 319, 22], ["+", 12, 658, 0, 659, 12, 652, 3, 4, 0, 24], ["+", 12, 658, 0, 659, 12, 652, 3, 4, 0, 25], ["-", 12, 652, 3, 4, 0, 657, 12, 657, 12, 612], ["+", 12, 652, 3, 4, 0, 657, 12, 657, 12, 612], ["+", 0, 7, 8, 196, 0, 1, 0, 6... | 5 | 96 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> D(K);
for (int i = 0; i < K; i++) {
cin >> D.at(i);
}
while (1) {
bool flag = true;
do {
int x = N % 10;
for (int i = 0; i < K; i++) {
if (x == D.at(i)) {
flag = false;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> D(K);
for (int i = 0; i < K; i++) {
cin >> D.at(i);
}
int y = N;
while (1) {
N = y;
bool flag = true;
do {
int x = N % 10;
for (int i = 0; i < K; i++) {
if (x == D.at(i)) {... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0... | 1 | 150 |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
ArrayList<Integer> li = new ArrayList<Integer>();
for (int i = 0; i < k; i++) {
... | import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
ArrayList<Integer> li = new ArrayList<Integer>();
for (int i = 0; i < k; i++) {
... | [["-", 0, 52, 8, 196, 0, 52, 15, 15, 0, 146], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 31, 22], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 17, 79], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 12, 499], ["-", 0, 52, 8, 196, 0, 1, 0, 11, 31, 22], ["-", 0, 52, 8, 196, 0, 1, 0, 11, 17, 90], ["-", 0, 52, 8, 196, 0, 1, 0, 11, 12, 499], ["-", 8,... | 3 | 198 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
int main(int argc, char *argv[]) {... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
int main(int argc, char *argv[]) {... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 147], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 8, 9, 0, 7, 8, 9,... | 1 | 215 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
vector<int> d{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
int i, j, dl, n, k, h, m;
dl = 10;
cin >> n >> k;
int s[k];
for (i = 0; i < k; i++) {
cin >> s[i];
for (j = 0; j < dl; j++) {
if (s[i] == d[j]) {
d.erase(d.be... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
vector<int> d{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
int i, j, dl, n, k, h, m;
dl = 10;
cin >> n >> k;
int s[k];
for (i = 0; i < k; i++) {
cin >> s[i];
for (j = 0; j < dl; j++) {
if (s[i] == d[j]) {
d.erase(d.be... | [["+", 31, 16, 31, 16, 31, 16, 31, 16, 31, 13], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 17, 48], ["+", 31, 16, 31, 16, 31, 16, 12, 69, 28, 22], ["+", 31, 16, 31, 16, 12, 69, 341, 342, 0, 70], ["+", 31, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 31, 16, 31, 16, 12, 69, 341, 342, 0, 73], ["+", 12, 16, 31, 16, 31, 16, 31, ... | 1 | 735 |
N,K=map(int,input().split())
D=list(map(str,input().split()))
flg=True
while flg:
for i in range(len(str(N))):
#print(str(N)[i])
if str(N)[i] in D:
#print("S",str(N)[i])
N+=1
break
else:
flg=False
break
print(N)
| N,K=map(int,input().split())
D=list(map(str,input().split()))
while True:
flg=True
for i in range(len(str(N))):
#print(str(N)[i])
if str(N)[i] in D:
#print("S",str(N)[i])
N+=1
flg=False
break
if flg:
break
print(N)
| [["+", 36, 36, 36, 36, 0, 656, 0, 52, 0, 89], ["+", 36, 36, 36, 36, 0, 656, 0, 52, 15, 146], ["+", 36, 36, 36, 36, 0, 656, 0, 52, 0, 102], ["-", 36, 36, 36, 36, 0, 656, 0, 52, 0, 89], ["-", 36, 36, 36, 36, 0, 656, 0, 52, 15, 22], ["-", 36, 36, 36, 36, 0, 656, 0, 52, 0, 102], ["-", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94],... | 5 | 80 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s, n) for (int i = s; i < n; i++)
int n, k;
vector<int> d(10);
vector<int> flag;
int ans = 1000000;
bool check(int num) {
if (num >= n) {
// cout << num << endl;
ans = min(ans, n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s, n) for (int i = s; i < n; i++)
int n, k;
vector<int> d(10);
vector<int> flag;
int ans = 10000000;
bool check(int num) {
if (num >= n) {
ans = min(ans, num);
// cout << "ans_w:... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 17, 131], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["-", 0, 2, 3, 4, 0, 2, ... | 1 | 265 |
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int D[100] = {};
for (int i = 0; i < K; ++i) {
int d;
cin >> d;
for (int j = 0; j < 10; ++j)
D[d + 10 * j] = 1;
if (0 != d)
for (int j = 0; j < 10; ++j)
D[j + 10 * d] = 1;
}
bool head = true;... |
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int D[100] = {};
for (int i = 0; i < K; ++i) {
int d;
cin >> d;
for (int j = 0; j < 10; ++j)
D[d + 10 * j] = 1;
if (0 != d)
for (int j = 0; j < 10; ++j)
D[j + 10 * d] = 1;
}
for (;; ++N) {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 146], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 7, 8, 9, 0, 43, ... | 1 | 203 |
#include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#else
#define debug(x)
#endif
#define all(s) begin(s), end(s)
#define rall(s) rbegin(s),... | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#else
#define debug(x)
#endif
#define all(s) begin(s), end(s)
#define rall(s) rbegin(s),... | [["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["+", 8, 9, 0, 43, 39, 344, 3, 347, 0, 18], ["+", 8, 9, 0, 43, 39, 344, 3, 347, 0, 47], ["+", 0, 14, 8, 9, 0, 43, 49, 53, 49, 22], ["+", 8, 9, 0, 43, 49, 53, 54, 55, 0, 24], ["+", 0,... | 1 | 915 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dl(k), l;
for (auto &&x : dl)
cin >> x;
sort(dl.begin(), dl.end());
for (int i = 0; i <= 9; i++) {
if (count(dl.begin(), dl.end(), i) == 0)
l.pu... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dl(k), l;
for (auto &&x : dl)
cin >> x;
sort(dl.begin(), dl.end());
for (int i = 0; i <= 9; i++) {
if (count(dl.begin(), dl.end(), i) == 0)
l.pu... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 147], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 146], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 146], ["-", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 57... | 1 | 220 |
// clang-format off
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
#define rrep(i,n) for(ll i=n-1; i>=0; --i)
#define rrep1(i,n) for(ll i=n; i>0; --i)
#define all(x) (x).begin(),(x)... | // clang-format off
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
#define rrep(i,n) for(ll i=n-1; i>=0; --i)
#define rrep1(i,n) for(ll i=n; i>0; --i)
#define all(x) (x).begin(),(x)... | [["-", 39, 343, 141, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 343, 141, 344, 3, 347, 0, 77, 39, 78], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["-", 0, 7, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 7, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 146], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 0, 35], ["-", 8, 9, 0, 3... | 1 | 364 |
/*#include <bits/stdc++.h>
using namespace std;
int a,b,c,fr[11];
int main()
{
cin>>a>>b>>c;
fr[a]++;
fr[b]++;
fr[c]++;
if(fr[5]==2 && fr[7]==1)
cout<<"YES";
else cout<<"NO";
return 0;
} A
*/
/*
#include <bits/stdc++.h>
using namespace std;
int n,l,i,j;
char sir[110... | /*#include <bits/stdc++.h>
using namespace std;
int a,b,c,fr[11];
int main()
{
cin>>a>>b>>c;
fr[a]++;
fr[b]++;
fr[c]++;
if(fr[5]==2 && fr[7]==1)
cout<<"YES";
else cout<<"NO";
return 0;
} A
*/
/*
#include <bits/stdc++.h>
using namespace std;
int n,l,i,j;
char sir[110... | [["+", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ... | 1 | 283 |
from itertools import *
if __name__=="__main__":
n,k = map(int,input().split(' '))
d = list(map(int,(input().split(' '))))
d = [i for i in range(10) if i not in d]
ans = 1e10
keta = len(str(n))
for perm in product(d,repeat=keta):
num = 0
for v in perm:
num = 10*num+v... | from itertools import *
if __name__=="__main__":
n,k = map(int,input().split(' '))
d = list(map(int,(input().split(' '))))
d = [i for i in range(10) if i not in d]
ans = 1e10
keta = len(str(n))
for k in range(1,keta+2):
for perm in product(d,repeat=k):
num = 0
fo... | [["+", 0, 656, 0, 57, 64, 196, 0, 7, 31, 22], ["+", 0, 656, 0, 57, 64, 196, 0, 7, 0, 267], ["+", 0, 57, 64, 196, 0, 7, 12, 652, 63, 22], ["+", 64, 196, 0, 7, 12, 652, 3, 4, 0, 24], ["+", 64, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 64, 196, 0, 7, 12, 652, 3, 4, 0, 21], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 31, 22], ["+", ... | 5 | 124 |
#include <stdio.h>
#include <string.h>
void minimize(int *N, int digit, int min) {
int i;
for (i = 0; i <= digit; i++) {
N[i] = min;
}
}
void calc(int *N, int K, int *D, int digit, int digit_max, int *moveup, int min,
int max) {
if (digit > 0 && N[digit] <= max)
calc(N, K, D, digit - 1, digit... | #include <stdio.h>
#include <string.h>
void minimize(int *N, int digit, int min) {
int i;
for (i = 0; i <= digit; i++) {
N[i] = min;
}
}
void calc(int *N, int K, int *D, int digit, int digit_max, int *moveup, int min,
int max) {
if (digit > 0 && N[digit] <= max)
calc(N, K, D, digit - 1, digit... | [["+", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8... | 0 | 483 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<char> d(k);
for (auto &e : d)
cin >> e;
for (int i = n; i < 1e5; i++) {
string ns = to_string(i);
string tmp;
set_intersection(begin(ns), end(ns), begin(d), end(d), back_inserter(tmp));
if ((int)tm... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<char> d(k);
for (auto &e : d)
cin >> e;
for (int i = n; i < 1e5; i++) {
string ns = to_string(i);
sort(begin(ns), end(ns));
string tmp;
set_intersection(begin(ns), end(ns), begin(d), end(d), back_i... | [["+", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0... | 1 | 123 |
import java.util.*;
public class Main {
public static int ans[];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
// int a = sc.nextInt();
// int b = sc.nextInt();
// int c = sc.nextInt();
// ... | import java.util.*;
public class Main {
public static int ans[];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
// int a = sc.nextInt();
// int b = sc.nextInt();
// int c = sc.nextInt();
// ... | [["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["-", 0, 492, 3, 4, 0, 16, 31, 509, 500, 22], ["-", 0, 492, 3, 4, 0, 16, 31, 509, 0, 131], ["-", 0, 492, 3, 4, 0, 16, 31, 509, 119, 22], ["-", 0, 1, 0, 492, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 492, 3, 4, 0, 16, 12, 499], ["-", 8, ... | 3 | 396 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(k);
for (int i = 0; i < k; i++) {
cin >> a.at(i);
}
int num = n;
int num2 = n;
bool flag = true;
bool flag2 = false;
vector<int> b;
while (flag) {
num = num2;
int sz = to_string(num).size... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(k);
for (int i = 0; i < k; i++) {
cin >> a.at(i);
}
int num = n;
int num2 = n;
bool flag = true;
bool flag2 = false;
vector<int> b;
while (flag) {
num = num2;
int sz = to_string(num).size... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 146], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 146... | 1 | 213 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<char> s(K);
for (int i = 0; i < K; ++i)
cin >> s[i];
for (int i = N;; ++i) {
string t = to_string(i);
for (int j = 0; j < K; ++j)
if (t.find(s[j], 0) != -1) {
co... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K, j, i;
cin >> N >> K;
vector<char> s(K);
for (i = 0; i < K; ++i)
cin >> s[i];
for (i = N;; ++i) {
string t = to_string(i);
for (j = 0; j < K; ++j)
if (t.find(s[j], 0) != -1)
break;
... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["-", 0, 7, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 8, 57, 15, 339, 0, 25], ["+", 8, 9, 0, 7, 8, 57, 64, 93, 0, 94], ["+", 8, 9, 0, 7, 8, 57, 64, 93, 0, 35], ["+", 8, 9, 0, 7, 8, 9, 0, 57... | 1 | 119 |
#include "bits/stdc++.h"
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> VL;
typedef vector<int> VI; //... | #include "bits/stdc++.h"
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> VL;
typedef vector<int> VI; //... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 146], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 14, 8, 9, 0, 52, 15, 339, 51, 22], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 8, 9, 0, 57, 15,... | 1 | 535 |
#include <bits/stdc++.h>
using namespace std;
int dislike(int n, int *d, int k) {
int i, j, p, m = n, digit = 0;
while (m != 0) {
m /= 10;
digit++;
}
for (i = 0; i < k; i++) {
p = n;
for (j = 0; j < digit; j++) {
for (int i2 = 0; i2 < j; i2++) {
p /= 10;
}
if (p % 10 !... | #include <bits/stdc++.h>
using namespace std;
int dislike(int n, int *d, int k) {
int i, j, p, m = n, digit = 0;
while (m != 0) {
m /= 10;
digit++;
}
for (i = 0; i < k; i++) {
p = n;
for (j = 0; j < digit; j++) {
if (p % 10 == d[i])
return 1;
p /= 10;
}
}
return 0;
}... | [["-", 8, 9, 0, 7, 8, 9, 0, 7, 0, 88], ["-", 8, 9, 0, 7, 8, 9, 0, 7, 0, 24], ["-", 0, 7, 8, 9, 0, 7, 10, 43, 39, 40], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 0, 32], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 7, 10, 43, 0, 35], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 31... | 1 | 212 |
import bisect
N,K = map(int,input().split())
N = [int(n) for n in str(N)]
D = set(map(int,input().split()))
nums = []
for i in range(10):
if i not in D:nums.append(i)
nums.sort()
i = len(N)-1
while i>=0:
if N[i] not in nums:
if nums[-1] < N[i]:
prv_len = len(N)
tmp_N = [int(s) for s in str(int(''.... | import bisect
N,K = map(int,input().split())
N = [int(n) for n in str(N)]
D = set(map(int,input().split()))
nums = []
for i in range(10):
if i not in D:nums.append(i)
nums.sort()
i = len(N)-1
while i>=0:
if N[i] not in nums:
if nums[-1] < N[i]:
prv_len = len(N)
tmp_N = [int(s) for s in str(int(''.... | [["-", 0, 662, 12, 657, 31, 657, 12, 634, 0, 73], ["-", 64, 196, 0, 1, 0, 662, 12, 657, 17, 72], ["-", 0, 1, 0, 662, 12, 657, 12, 206, 51, 22], ["-", 0, 1, 0, 662, 12, 657, 12, 206, 0, 70], ["+", 0, 662, 12, 657, 12, 658, 0, 659, 0, 88], ["+", 0, 662, 12, 657, 12, 658, 0, 659, 31, 22], ["+", 0, 662, 12, 657, 12, 658, 0... | 5 | 250 |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
public class Main {
private static List<Integer> acceptableDigits =
Arrays.stream(new int[] {0, 1, 2, 3, 4, 5, 6, 7, 8, 9})
.collect(ArrayList::new, List::add, Lis... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
public class Main {
private static List<Integer> acceptableDigits =
Arrays.stream(new int[] {0, 1, 2, 3, 4, 5, 6, 7, 8, 9})
.collect(ArrayList::new, List::add, Lis... | [["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 499], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 215], ["+", 0, 195, 8, 196, 0, 37, 0, 91, 17, 111], ["+", 8, 196, 0, 82, 8, 196, 0, 57, 0, 121], ["+", 0, 82, 8, 196, 0, 57, 15, 15, 0, 24], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 31, 22], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 60], ["+", 8,... | 3 | 549 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int K = scanner.nextInt();
// Listにうまく変換するため
Integer[] dislikeNumberInteger = new Integer[K];
for (int i = 0; i < K; i++) {
dislikeNumb... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int K = scanner.nextInt();
// Listにうまく変換するため
Integer[] dislikeNumberInteger = new Integer[K];
for (int i = 0; i < K; i++) {
dislikeNumb... | [["-", 0, 503, 49, 200, 51, 227, 497, 505, 0, 499], ["+", 0, 503, 49, 200, 51, 227, 497, 505, 0, 499], ["-", 64, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 64, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["-", 12, 16, 31, 16, 31, 16, 31, 16, 31, 499], ["-", 12, 16, 31, 16, 31, 16, 31, 16, 17, 48], ["-", 31, 16, 31, 16, ... | 3 | 404 |
#include <stdio.h>
int Num[11];
int N, K;
int Flag;
int Min;
void DFS(int d, int s);
int main(void) {
int i, tmp, m, min;
Min = 987654321;
scanf("%d %d", &N, &K);
for (i = 0; i < 10; i++) {
scanf("%d", &tmp);
Num[tmp] = 1;
}
for (m = 1; Num[m]; m++)
;
if (Num[0] == 0)
min = m * 1000... | #include <stdio.h>
int Num[11];
int N, K;
int Flag;
int Min;
void DFS(int d, int s);
int main(void) {
int i, tmp, m, min;
Min = 987654321;
scanf("%d %d", &N, &K);
for (i = 0; i < 10; i++) {
scanf("%d", &tmp);
Num[tmp] = 1;
}
for (m = 1; Num[m]; m++)
;
if (Num[0] == 0)
min = m * 1000... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0... | 0 | 306 |
#include <stdio.h>
int chk[10];
int nums[] = {1, 10, 100, 1000, 10000};
int possibleNum[10];
int N;
int K;
int jari;
int idx;
int min = 0x7fff0000;
void DFS(int L, int num) {
int i;
if (L > jari) {
if (num >= N && num < min)
min = num;
if (num % nums[jari] >= N && num % nums[jari] < min)
min ... |
#include <stdio.h>
int chk[10];
int nums[] = {1, 10, 100, 1000, 10000};
int possibleNum[10];
int N;
int K;
int jari;
int idx;
int min = 0x7fff0000;
void DFS(int L, int num) {
int i;
if (L > jari) {
if (num >= N && num < min)
min = num;
if (num % nums[jari] >= N && num % nums[jari] < min)
min ... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0... | 0 | 297 |
import itertools
N,K=map(int,input().split())
D=set(list(map(str,input().split())))
U=list({'0','1','2','3','4','5','6','7','8','9'}^D)
U.sort()
PRD1 = list(itertools.product(U, repeat=len(str(N))))
PRD2 = list(itertools.product(U, repeat=len(str(N))+1))
import sys
for i in range(len(PRD1)):
T=int(''.join(PRD1[i]... | import itertools
N,K=map(int,input().split())
D=set(list(map(str,input().split())))
U=list({'0','1','2','3','4','5','6','7','8','9'}^D)
U.sort()
PRD1 = list(itertools.product(U, repeat=len(str(N))))
PRD2 = list(itertools.product(U, repeat=len(str(N))+1))
import sys
for i in range(len(PRD1)):
T=int(''.join(PRD1[i]... | [["-", 0, 652, 3, 4, 0, 657, 31, 557, 0, 654], ["-", 0, 652, 3, 4, 0, 657, 31, 557, 0, 6], ["-", 0, 652, 3, 4, 0, 657, 31, 557, 0, 655], ["-", 0, 1, 0, 652, 3, 4, 0, 657, 17, 72], ["-", 0, 652, 3, 4, 0, 657, 12, 652, 63, 22], ["-", 3, 4, 0, 657, 12, 652, 3, 4, 0, 24], ["-", 3, 4, 0, 657, 12, 652, 3, 4, 0, 25]] | 5 | 215 |
#include <stdio.h>
int N, K;
int C[10], D;
int a[4] = {1000, 100, 10, 1};
int ans;
void func(int L, int num) {
int i;
if (ans != 0)
return;
if (L >= 4) {
if (num >= N)
ans = num;
return;
}
if (N / a[L] == 0)
func(L + 1, num * 10);
for (i = 0; i < 10; ++i) {
if (C[i])
cont... | #include <stdio.h>
int N, K;
int C[10], D;
int a[] = {10000, 1000, 100, 10, 1};
int ans;
void func(int L, int num) {
int i;
if (ans != 0)
return;
if (L >= 5) {
if (num >= N)
ans = num;
return;
}
if (N / a[L] == 0)
func(L + 1, 0);
for (i = 0; i < 10; ++i) {
if (C[i])
conti... | [["-", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 21], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["-", 64, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 64, 1, 0, 2, 3, 4, 0, 16, 17, 48], ["-", 64, 1, 0, 2,... | 0 | 209 |
kingaku,=gets.chomp.split.map(&:to_i)
i=kingaku+1
kirai_array=gets.chomp.split.map(&:to_i)
while TRUE
if (i.split("").map(&:to_i) - kirai_array).size == i.split("").map(&:to_i).size
puts i
break
end
i+=1
end
| kingaku,=gets.chomp.split.map(&:to_i)
i=kingaku
kirai_array=gets.chomp.split.map(&:to_i)
while 1
if (i.to_s.split("").map(&:to_i) - kirai_array).size == i.to_s.split("").map(&:to_i).size
puts i
break
end
i+=1
end | [["-", 36, 36, 0, 493, 0, 662, 12, 738, 17, 72], ["-", 36, 36, 0, 493, 0, 662, 12, 738, 12, 612], ["-", 36, 36, 36, 36, 0, 493, 0, 89, 15, 743], ["+", 36, 36, 36, 36, 0, 493, 0, 89, 15, 612], ["+", 0, 738, 31, 652, 486, 652, 486, 652, 17, 131], ["+", 0, 738, 31, 652, 486, 652, 486, 652, 735, 22], ["+", 12, 652, 486, 65... | 4 | 78 |
N,K = map(int,input().split())
D = list(map(str,input().split()))
ans = 0
for j in range(N,10*N+1):
for k in D:
if str(k) in str(j):
break
ans = j
if ans != 0:
break
print(ans) | N,K = map(int,input().split())
D = list(map(str,input().split()))
ans = 0
for j in range(N,10*N+1):
f = True
for k in D:
if str(k) in str(j):
f = False
break
if f:
ans = j
break
print(ans)
| [["+", 0, 7, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 12, 146], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 12, 147], ["+", 0, 656, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 65... | 5 | 80 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int d[n];
for (int i = 0; i < k; ++i)
cin >> d[i];
while (true) {
int x = n;
bool f = 1;
while (x > 0) {
for (int i = 0; i < k; ++i) {
if (x % 10 == d[i]) {
f = 0;
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> d(k);
for (int i = 0; i < k; ++i)
cin >> d[i];
while (true) {
int x = n;
bool f = 1;
while (x > 0) {
for (int i = 0; i < k; ++i) {
if (x % 10 == d[i])
f = 0;
}
x... | [["+", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["+", 8, 9, 0, 43, 39, 344, 3, 347, 0, 18], ["+", 8, 9, 0, 43, 39, 344, 3, 347, 0, 47], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 0, 70], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 0, 73], ["+", 8, 9, 0, 43, 49, 53, 54, 55, 0, 24], ["+", 0, 43, 49,... | 1 | 143 |
N, K = map(int,input().split())
D = list(map(int,input().split()))
a = 10
b = 10
c = 10
d = 10
e = 10
ans = 100000
for i in range(N,100000):
if i >= 10000:
a = i//10000
if i >= 1000:
b = i//1000
if i >= 100:
c = i//100
if i >= 10:
d = i//10
e = i
S = D.count(a) +... | N, K = map(int,input().split())
D = list(map(int,input().split()))
a = 10
b = 10
c = 10
d = 10
e = 10
ans = 100000
for i in range(N,100000):
if i >= 10000:
a = i//10000
if i >= 1000:
b = (i//1000)%10
if i >= 100:
c = (i//100)%10
if i >= 10:
d = (i//10)%10
e = i%10
... | [["+", 0, 1, 0, 662, 12, 657, 31, 23, 0, 24], ["+", 0, 1, 0, 662, 12, 657, 31, 23, 0, 25], ["+", 64, 196, 0, 1, 0, 662, 12, 657, 17, 109], ["+", 64, 196, 0, 1, 0, 662, 12, 657, 12, 612], ["+", 0, 662, 12, 657, 31, 23, 0, 657, 12, 612], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 17, 109], ["+", 8, 196, 0, 1, 0, 662, 12, 657, ... | 5 | 157 |
#include <bits/stdc++.h>
using namespace std;
int DisNum[15];
void init() {
for (int i = 0; i < 15; i++) {
DisNum[i] = 0;
}
}
bool checkNumber(int Number) {
while (Number > 0) {
int LastDigit = Number % 10;
if (DisNum[LastDigit] == 1) {
return false;
}
Number = Number / 10;
... | #include <bits/stdc++.h>
using namespace std;
int DisNum[15];
void init() {
for (int i = 0; i < 15; i++) {
DisNum[i] = 0;
}
}
bool checkNumber(int Number) {
while (Number > 0) {
int LastDigit = Number % 10;
if (DisNum[LastDigit] == 1) {
return false;
}
Number = Number / 10;
... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 189 |
#include <bits/stdc++.h>
#include <boost/algorithm/string/replace.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using namespace boost::algorithm;
using namespace boost::multiprecision;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(... | #include <bits/stdc++.h>
#include <boost/algorithm/string/replace.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using namespace boost::algorithm;
using namespace boost::multiprecision;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 8, 9, 0, 52, 8, ... | 1 | 390 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll INF = 9223372036854... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll INF = 9223372036854... | [["-", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["-", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["-", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51... | 1 | 370 |
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = Integer.parseInt(scanner.next());
int K = Intege... | import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = Integer.parseInt(scanner.next());
int K = Intege... | [["+", 0, 195, 8, 196, 0, 1, 0, 492, 500, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 0, 131], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 25], ["+", 8, 498, 0, 195, 8, 196, 0, 1, 0, 35], ["-", 0, 195, 8, 196, 0, 7, 15, 16, 12, 499], ["+", 0,... | 3 | 251 |
N, K = map(int, input().split())
d = list(map(int, input().split()))
a = []
for i in range(10):
if d.count(i) == 0:
a.append(i)
ans = []
def dfs(s):
if int(s) >= N or len(s) > len(str(N)):
return s
for i in a:
S = dfs(s + str(i))
if int(S) >= N:
ans.append(int(S))... | N, K = map(int, input().split())
d = list(map(int, input().split()))
a = []
for i in range(10):
if d.count(i) == 0:
a.append(i)
ans = []
def dfs(s):
if int(s) >= N or len(s) > 6:
return s
for i in a:
S = dfs(s + str(i))
if int(S) >= N:
ans.append(int(S))
retur... | [["-", 0, 57, 15, 679, 12, 666, 0, 652, 63, 22], ["-", 15, 679, 12, 666, 0, 652, 3, 4, 0, 24], ["-", 12, 666, 0, 652, 3, 4, 0, 652, 63, 22], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25], ["-", 15, 679, 12, 666, 0, 652, 3, 4, 0, 25], ["+", 8... | 5 | 142 |
val, size = map(int, input().split())
disabledList = [int(x) for x in input().split()] # number
enableList = list(set(range(10)) - set(disabledList)) # number
resultList = [] # str, must reverse
isTenOver = False
for char in reversed(list(str(val))):
targetInt = int(char)
if isTenOver:
targetInt += 1
if int(c... | val, size = map(int, input().split())
disabledList = [int(x) for x in input().split()] # number
enableList = list(set(range(10)) - set(disabledList)) # number
resultList = [] # str, must reverse
isTenOver = False
for char in reversed(list(str(val))):
targetInt = int(char)
if isTenOver:
targetInt += 1
if targe... | [["-", 8, 196, 0, 57, 15, 666, 0, 652, 63, 22], ["-", 0, 57, 15, 666, 0, 652, 3, 4, 0, 24], ["-", 0, 57, 15, 666, 0, 652, 3, 4, 0, 22], ["-", 0, 57, 15, 666, 0, 652, 3, 4, 0, 25], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 652, 3, 4, 0, 652, 63, 22], ["-", 64, ... | 5 | 221 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> D;
for (int i = 0; i < K; i++) {
int temp;
cin >> temp;
D.push_back(temp);
}
int result = 0;
for (int i = N; i < 100000; i++) {
int current_num = i;
bool find = true;
for (int j = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> D;
for (int i = 0; i < K; i++) {
int temp;
cin >> temp;
D.push_back(temp);
}
int result = 0;
for (int i = N; i < 100000; i++) {
int current_num = i;
bool find = true;
while (current_... | [["-", 8, 9, 0, 7, 8, 9, 0, 7, 0, 88], ["+", 8, 9, 0, 7, 8, 9, 0, 52, 0, 89], ["-", 0, 7, 8, 9, 0, 7, 10, 43, 39, 40], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 79], ["-", 0, 7, 8, 9, 0, 7, 10... | 1 | 177 |
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 8, 9, 0, 52, 8, 9, 0, 52, 0, 89], ["+", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["-", 8, 9, 0, 52, 8, 1, 0,... | 1 | 201 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
vector<bool> vec(10, true);
int n, k;
cin >> n >> k;
rep(i, k) {
int x;
cin >> x;
vec[x] = false;
}
for (int i = n; i < 10000; i++) {
int x = i;
bool flag = true;
while (x > 0)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
vector<bool> vec(10, true);
int n, k;
cin >> n >> k;
rep(i, k) {
int x;
cin >> x;
vec[x] = false;
}
for (int i = n; i < 100000; i++) {
int x = i;
bool flag = true;
while (x > 0... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 64, 9, 0, 57, 1... | 1 | 144 |
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
using namespace std;
int main() {
int K, flag = 0;
unsigned long ans = 0;
char tmp;
string N;
string n = "npos";
cin >> N >> K;
string D;
rep(i, K) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
using namespace std;
int main() {
int K, flag = 0;
unsigned long ans = 0;
char tmp;
string N;
string n = "npos";
cin >> N >> K;
string D;
rep(i, K) ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 2, 63, 22], ["+", 10, 43, 49, 50, 51, 2, 3, 4, 0, 24], ["+", 51, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["+", 51, 2, 3, 4, 0, 2, 63, 118, 17, 131], ["+", 51, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["+", 51, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 51, 2, 3, 4,... | 1 | 176 |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
typedef long long ll;
ll GCD(ll x, ll y) { return y ? GCD(y, x % y) : x; }
ll LCM(ll x, ll y) { return x * y / GCD(x, y); }
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<char> d(k);
for (int i = 0; i < k; i++) {
cin >> d[i];
... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
typedef long long ll;
ll GCD(ll x, ll y) { return y ? GCD(y, x % y) : x; }
ll LCM(ll x, ll y) { return x * y / GCD(x, y); }
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> d(k);
for (int i = 0; i < k; i++) {
cin >> d[i];
}... | [["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 146], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 147], ["-", 0, 30, 0, 14, 8, 9, 0, 7, 15, 22], ["+", 0, 14,... | 1 | 207 |
import java.util.*;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int K = sc.nextInt();
Integer[] d = new Integer[K];
for (int i = 0; i < K; i++) {
d[i] = sc.nextInt();
}
boolean ok ... | import java.util.*;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int K = sc.nextInt();
Integer[] d = new Integer[K];
for (int i = 0; i < K; i++) {
d[i] = sc.nextInt();
}
boolean ok ... | [["+", 0, 52, 8, 196, 0, 503, 49, 200, 141, 22], ["+", 0, 52, 8, 196, 0, 503, 49, 200, 0, 32], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 31, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 17, 85], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 12, 499], ["+", 8, 196, 0, 52, 8, 196, 0, 503, 0, 35], ["+", 0, 52, 8, 196, 0, 503, 39, 50... | 3 | 258 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.