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 |
|---|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
V<> a(n);
for (auto &&e : a)
cin >> e;
sort(rbegin(a), rend(a))... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
V<> a(n);
for (auto &&e : a)
cin >> e;
sort(rbegin(a), rend(a))... | [["-", 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, 43, 49, 50, 51, 16, 31, 2, 63, 22], ["-", 49, 50, 51, 16, 31, 2, 3, 4, 0, 24], ["-", 51, 16, 31, 2, 3, 4, 0, 2, 63, 22], ["-", 31, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 31, 2, 3, 4, 0, 2,... | 1 | 358 |
// Zory-2019
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
// #include<unordered_map>
using namespace std;
int bin[40]... | // Zory-2019
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
// #include<unordered_map>
using namespace std;
int bin[40]... | [["+", 31, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 31, 23, 0, 16, 31, 23, 0, 16, 17, 33], ["+", 31, 23, 0, 16, 31, 23, 0, 16, 12, 13], ["+", 31, 16, 31, 23, 0, 16, 31, 23, 0, 25], ["-", 0, 11, 12, 23, 0, 16, 31, 16, 17, 79], ["+", 0, 11, 12, 23, 0, 16, 31, 16, 17, 60], ["-", 0, 1, 0, 11, 12, 23, 0, 16, 17, 355], ["+",... | 1 | 664 |
#include <bits/stdc++.h>
#define Pair pair<int, double>
#define MP(x, y) make_pair(x, y)
#define fi first
#define se second
//#define int long long
#define LL long long
#define Fin(x) \
{ freopen(#x ".in", "r", stdin); }
#define Fout(x) ... | #include <bits/stdc++.h>
#define Pair pair<int, double>
#define MP(x, y) make_pair(x, y)
#define fi first
#define se second
//#define int long long
#define LL long long
#define Fin(x) \
{ freopen(#x ".in", "r", stdin); }
#define Fout(x) ... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 16, 31, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 7, 8, 1, 0, 35], ["+", 64, 9, 0, 57, 15, 339, 51, 91, 17, 111], ["+", 51, 91, 28, 23, 0, 16, 31, 23, 0, 24], ["+", 0... | 1 | 630 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define Re register
#define LL long long
#define U unsigned
#define FOR(i, a, b) for (Re int i = a; i <= b; ++i)
#define RO... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define Re register
#define LL long long
#define U unsigned
#define FOR(i, a, b) for (Re int i = a; i <= b; ++i)
#define RO... | [["-", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["-", 0, 1, 0, 2, 3, 4, 0, 41, 0, 101], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 41,... | 1 | 239 |
#include <algorithm>
#include <iostream>
using namespace std;
int hrpe[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> hrpe[i];
sort(hrpe, hrpe + n);
int zadnji = -1;
for (int i = 0; i < n; i++) {
int b = hrpe[i] - 1;
int u = n - i - 1;
if ((b + u) % 2 == 0) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int hrpe[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> hrpe[i];
sort(hrpe, hrpe + n);
int zadnji = -1;
for (int i = 0; i < n; i++) {
int b = hrpe[i] - 1;
int u = n - i - 1;
if ((b + u) % 2 == 0) {
... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["+", 0, 11, 12, 16, 31, 23, 0, 16, 31, 22], ["+", 0, 11, 12, 16, 31, 23, 0, 16, 17, 72], ["+", 0, 11, 12, 16,... | 1 | 294 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#define rg register
#define ll long long
#define LDB long double
#define ull unsigned long long
#define view(i, x) for (rg int i = hd[x]; i != -1; i = e[i].nt)
#define go(i, x, a) for (rg int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#define rg register
#define ll long long
#define LDB long double
#define ull unsigned long long
#define view(i, x) for (rg int i = hd[x]; i != -1; i = e[i].nt)
#define go(i, x, a) for (rg int... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 20], ["-", 51, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["-", 51, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["-", 15, 339, 51, 16, 12, 16, 31, 23, 0, 2... | 1 | 328 |
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | [["+", 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], ["+", 0, 1, 0, 2, 3, 4, 0, 83, 0, 45], ["+", 0, 1, 0, 2, 3, 4, 0, 83, 0, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 83, 0, 21], ["+", 0, 2, 3, 4, 0, 83, 0, 16, 31,... | 1 | 1,794 |
#include <stdio.h>
#include <stdlib.h>
signed compare(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int N, i;
scanf("%d", &N);
int *a = (int *)malloc(sizeof(int) * N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
a[i]--;
}
qsort(a, N, sizeof(int), compare);
for (i... | #include <stdio.h>
#include <stdlib.h>
signed compare(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int N, i;
scanf("%d", &N);
int *a = (int *)malloc(sizeof(int) * N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
a[i]--;
}
qsort(a, N, sizeof(int), compare);
for (i... | [["-", 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 | 250 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#define inf 20021225
#define ll long long
#define mxn 100010
using namespace std;
int n, a[mxn];
bool cmp(int x, int y) { return x > y; }
void work(int id) {
int i;
for (i = id; i < n; i++)
if (a[i] < a[id])
break;
if ((a[id] - ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#define inf 20021225
#define ll long long
#define mxn 100010
using namespace std;
int n, a[mxn];
bool cmp(int x, int y) { return x > y; }
void work(int id) {
int i, qaq = 0;
for (i = id + 1; a[i] == id && i < n; i++)
qaq ^= 1;
if ((a[... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 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], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13], ["+", 0, 7, 15, 16, 31, 16, 31, 69, 28, 22], ["+", 15, 16, 31, 1... | 1 | 230 |
#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;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<bool> vb;
typedef vector<ld> vld;
typedef vector<pii> vpii;
typedef vector<pll> vpll... | #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;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<bool> vb;
typedef vector<ld> vld;
typedef vector<pii> vpii;
typedef vector<pll> vpll... | [["-", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 31, 22], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 17, 33], ["+", 0, 16, 31, 23, 0, 16, 12, 69, 28, 22], ["+", 31, 23, 0, 16, 12, 69, 341, 342, 0, 70], ["+", 31, 23, 0, 16,... | 1 | 1,810 |
#include <algorithm>
#include <bitset>
#include <cassert>
#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 <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#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 <queue>
#include ... | [["-", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["-", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 57, 15, 339, 0, 25], ["-", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 57, 64... | 1 | 362 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using dbl = double;
using pii = pair<int, int>;
using pl4 = pair<ll, ll>;
using tl6 = tuple<ll, ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
using vll = vector<ll>;
using vvll = vector<vl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using dbl = double;
using pii = pair<int, int>;
using pl4 = pair<ll, ll>;
using tl6 = tuple<ll, ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
using vll = vector<ll>;
using vvll = vector<vl... | [["+", 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], ["+", 64, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 51, 22], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 57, 64, 1... | 1 | 6,084 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
#define SF scanf
#define PF printf
#define MAXN 100010
using namespace std;
int a[MAXN];
bool cmp(int x, int y) { return x > y; }
int main() {
int n, m, q;
SF("%d", &n);
for (int i = 1; i <= n; i++) {
SF("%d", &a[i]);
a[i]++;
}
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
#define SF scanf
#define PF printf
#define MAXN 100010
using namespace std;
int a[MAXN];
bool cmp(int x, int y) { return x > y; }
int main() {
int n, m, q;
SF("%d", &n);
for (int i = 1; i <= n; i++)
SF("%d", &a[i]);
sort(a + 1, a + ... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 1, 0, 27, 28, 69, 28, 22], ["-", 0, 1, 0, 27, 28, 69, 341, 342, 0, 70], ["-", 0, 1, 0, 27, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 27, 28, 69, 341, 342, 0, 73], ["-", 0, 7, 8, 9, 0, 1, 0, 27, 17, 29], ["-", 0, 14, 8, 9, 0, 7, ... | 1 | 223 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int MAXN = 100005;
int a[MAXN], n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
sort(a + 1, a + n + 1, greater<int>());
int p = 0;
for (int i = 1; i <= n; ++i) {
i... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int MAXN = 100005;
int a[MAXN], n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
sort(a + 1, a + n + 1, greater<int>());
int p = 0;
for (int i = 1; i <= n; ++i) {
i... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 60], ["-", 0, 52, 15, 339, 51, 16, 12, 69, 28, 22], ["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 70], ["-", 51, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 52, 15, 339, 51, 16, ... | 1 | 199 |
// waz
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef uns... | // waz
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef uns... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 64, 9, 0, 43, 0, 21], ["+", 0, 57, 64, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 57, 64, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 57, 64, 9, 0, 43, 49, 50, 51, 13], ["-", 64, 9, 0, 7, 15, 16, 12, 69, 28, 22], ["-", 0, 7, 1... | 1 | 380 |
#include <algorithm>
#include <cstdio>
#define neko 100010
#define f(i, a, b) for (register int i = (a); i <= (b); i = -(~(i)))
#define rf(i, a, b) for (register int i = (a); i >= (b); i = ~(-(i)))
int a[neko], ans, n;
bool cmp(int a, int b) { return a > b; }
int main() {
scanf("%d", &n);
f(i, 1, n) scanf("%d", &a[... | #include <algorithm>
#include <cstdio>
#define neko 100010
#define f(i, a, b) for (register int i = (a); i <= (b); i = -(~(i)))
#define rf(i, a, b) for (register int i = (a); i >= (b); i = ~(-(i)))
int a[neko], ans, n;
bool cmp(int a, int b) { return a > b; }
int main() {
scanf("%d", &n);
f(i, 1, n) scanf("%d", &a[... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 1, 0, 27, 17, 68], ["-", 0, 57... | 1 | 202 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
typedef unsigned long long ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
typedef unsigned long long ... | [["-", 0, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["-", 0, 57, 64, 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], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17... | 1 | 389 |
#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
sort(a + 1, a + n + 1, greater<int>());
int p = 1;
while (p < n && a[p + 1] >= p + 1)
++p;
if (p < n && a[p + 1] == p || (a[p] - p & 1))
puts("First");
... | #include <bits/stdc++.h>
using namespace std;
int n, a[100005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
sort(a + 1, a + n + 1, greater<int>());
int p = 1;
while (p < n && a[p + 1] >= p + 1)
++p;
int q = p;
while (q < n && a[q + 1] == p)
++q;
if ((q - p ... | [["-", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["-", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 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, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52,... | 1 | 141 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000005;
int n, a[MAXN];
int main() {
scanf("%d", &n);
a[0] = 2e9;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
auto fun = [&](int v) {
int s = 0, e = n + 1;
while (s != e) {
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000005;
int n, a[MAXN];
int main() {
scanf("%d", &n);
a[0] = 2e9;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
auto fun = [&](int v) {
int s = 0, e = n + 1;
while (s != e) {
... | [["-", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 51, 16, 31, 69, 341, 342, 0, 16, ... | 1 | 234 |
/// {{{ Author: Wang, Yen-Jen
// include
#include <bits/stdc++.h>
// using
using namespace std;
// types
typedef long long ll;
typedef pair<int, int> pii;
// macro
#define SZ(x) ((int)x.size())
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i =... | /// {{{ Author: Wang, Yen-Jen
// include
#include <bits/stdc++.h>
// using
using namespace std;
// types
typedef long long ll;
typedef pair<int, int> pii;
// macro
#define SZ(x) ((int)x.size())
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i =... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 8, 1, 0, 11, 31, 22], ["+", 8, 9, 0, 7, 8, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 8,... | 1 | 730 |
#include <bits/stdc++.h>
#define maxx 330100
using namespace std;
int a[maxx], n, ans = 1;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
if (i >= a[i + 1]) {
for (int j = i + 1; j <= n && a[j] ==... | #include <bits/stdc++.h>
using namespace std;
int n, ans, a[100100];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
if (i >= a[i + 1]) {
for (int j = i + 1; a[j] == i; j++)
ans ^= 1;
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["-", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 49, 22], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 0, 70], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 22], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 0, 73], ["-",... | 1 | 171 |
#include <algorithm>
#include <cstdio>
const int MaxN = 1e6 + 10;
int F[MaxN], A[MaxN];
int N;
bool Cmp(int A, int B) { return A > B; }
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++)
scanf("%d", &A[i]);
std::sort(A + 1, A + 1 + N, Cmp);
/*SG函数 ↓*/
int P = 0;
while (P + 1 <= N && P + 1 <= A[P... | #include <algorithm>
#include <cstdio>
const int MaxN = 1e6 + 10;
int F[MaxN], A[MaxN];
int N;
bool Cmp(int A, int B) { return A > B; }
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++)
scanf("%d", &A[i]);
std::sort(A + 1, A + 1 + N, Cmp);
/*SG函数 ↓*/
int P = 0;
while (P + 1 < N && P + 1 < A[P +... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 19], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 18], ["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 18], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 31, 22], ["-"... | 1 | 199 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int i = 0, j = 0;
while (i < n - 1 && a... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
sort(a.begin(), a.end(), greater<int>());
int i = 0, j = 0;
while (i < n - 1 && a[i + 1] > j) {
... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 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, 3, 4, 0, 2... | 1 | 211 |
#include <algorithm>
#include <iostream>
using namespace std;
long long n, a[(1 << 20)];
pair<long long, long long> proj(long long y, long long x) {
long long c = min(x, y);
return make_pair(y - c, x - c);
}
void printS(long long c) {
if (c % 2) {
cout << "First\n";
} else {
cout << "Second\n";
}
}... | #include <algorithm>
#include <iostream>
using namespace std;
long long n, a[(1 << 20)];
pair<long long, long long> proj(long long y, long long x) {
long long c = min(x, y);
return make_pair(y - c, x - c);
}
void printS(long long c) {
if (c % 2) {
cout << "First\n";
} else {
cout << "Second\n";
}
}... | [["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 0, 57, 75, 76, 0, 9, 0, 57, 0, 121], ["+", 75, 76, 0, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 109], ["... | 1 | 606 |
#include <algorithm>
#include <cstdio>
using namespace std;
int n, p, t, a[100005];
bool bz;
bool cmp(int a, int b) { return a > b; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1, cmp);
for (; a[p] >= p; p++)
;
p--;
for (; a[p + t] >= p; t++)
... | #include <algorithm>
#include <cstdio>
using namespace std;
int n, p, t, a[100005];
bool bz;
bool cmp(int a, int b) { return a > b; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1, cmp);
for (; a[p + 1] >= p + 1; p++)
;
for (; a[p + t] >= p; t++)
... | [["+", 15, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 15, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 2, 3, ... | 1 | 169 |
#include <algorithm>
#include <cstdio>
using namespace std;
int n, p, t, a[100005];
bool bz;
bool cmp(int a, int b) { return a > b; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1, cmp);
for (; a[p] >= p; p++)
;
p--;
for (; a[p + t] >= p; t++)
... | #include <algorithm>
#include <cstdio>
using namespace std;
int n, p, t, a[100005];
bool bz;
bool cmp(int a, int b) { return a > b; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1, cmp);
for (; a[p + 1] >= p + 1; p++)
;
for (; a[p + t] >= p; t++)
... | [["+", 15, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 15, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 2, 3, ... | 1 | 173 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef double LD;
typedef long long LL;
typedef pair<int, int> PII;
#define MP make... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef double LD;
typedef long long LL;
typedef pair<int, int> PII;
#define MP make... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 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, 25], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-... | 1 | 267 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define sz(x) (int)(x.size())
#define fi(a, b) for (int i = a; i < b; ++i)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
/////////////////////
int const ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define sz(x) (int)(x.size())
#define fi(a, b) for (int i = a; i < b; ++i)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
/////////////////////
int const ... | [["+", 0, 43, 49, 50, 51, 118, 28, 69, 28, 22], ["+", 49, 50, 51, 118, 28, 69, 341, 342, 0, 70], ["+", 49, 50, 51, 118, 28, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 43, 49, 50, 51, 118, 17, 131], ["+", 8, 9, 0, 43, 49, 50, 51, 118, 119, 120], ["-", 0, 2, 3, 4, 0, 16, 31, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72],... | 1 | 641 |
#include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tup... | #include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tup... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 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], ["+", 3, 4, 0, 69, 341, 342, 0, ... | 1 | 688 |
#include <bits/stdc++.h>
#define N 100100
using namespace std;
int a[N], n, sg = 1;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
if (i >= a[i]) {
for (int j = i + 1; j <= n && a[j]... | #include <bits/stdc++.h>
#define N 100100
using namespace std;
int a[N], n, sg = 1;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
if (i >= a[i + 1]) {
for (int j = i + 1; j <= n && ... | [["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 64, 9, 0, 1, 0, 11, 12, 23, 0, 24], ["+", 64, 9, 0, 1, 0, 11, 12, 23, 0, 25], ["-", 0, 2, 3, 4, 0, 41, 15, 23, 0, 24], ["-", 3, 4, 0, 41, 15, 23, 0, 16, 17, 67], ["-", 3, 4, 0, 41, 15, 23, 0, 16, 12, 13], ["-", 0, 2, ... | 1 | 180 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | [["+", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["+", 0, 7, 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], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79]... | 1 | 452 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end(), greater<lli>());
int pivo = n - 1;
r... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end(), greater<lli>());
int pivo = n - 1;
r... | [["-", 0, 16, 31, 16, 31, 16, 31, 16, 31, 22], ["-", 0, 16, 31, 16, 31, 16, 31, 16, 17, 151], ["-", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 0, 1, 0, 16, 31, 16, 31, 16, 17, 151], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-",... | 1 | 202 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int l = 0, r = n - 1;
for (int i = n - 1; i >= 1; i--)
a[i] -= a[i - 1];
while (1) {
int nl = l, nr = r - 1;
a[l]--;
while (!a[nl] && nl <= n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100000], sum = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int l = 0, r = n - 1;
for (int i = n - 1; i >= 1; i--)
a[i] -= a[i - 1];
while (1) {
int nl = l, nr = r - 1;
a[l]--;
while (!a[nl] &... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 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, 7, 0, 88], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 24], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 10, 43, 49... | 1 | 208 |
#include "algorithm"
#include "climits"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "queue"
#include "set"
#include "stack"
#include "string"
using namespace std;
const long long int MOD = 1000000007;
long long int N, M, K, H, W, L, R;
int ma... | #include "algorithm"
#include "climits"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "queue"
#include "set"
#include "stack"
#include "string"
using namespace std;
const long long int MOD = 1000000007;
long long int N, M, K, H, W, L, R;
int ma... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0... | 1 | 254 |
// This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ... | // This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 17, 72], ... | 1 | 526 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, K, d;
bool D[10];
cin >> N >> K;
for (int i = 0; i < K; i++) {
cin >> d;
D[d] = false;
}
for (int i = N; i <= 99999; i++) {
bool check = true;
int j = i;
while (j != 0) {
if (!D[j % 10]) {
check = false;
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, K, d;
bool D[10];
for (int i = 0; i < 10; i++) {
D[i] = true;
}
cin >> N >> K;
for (int i = 0; i < K; i++) {
cin >> d;
D[d] = false;
}
for (int i = N; i <= 99999; i++) {
bool check = true;
int j = i;
while (j != 0... | [["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 88], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 24], ["+", 0, 14, 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, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 7, 15,... | 1 | 132 |
N,K=map(int,input().split())
D=list(input().split())
for i in range(N,100000):
for j in str(i):
if(str(j) in D):
break
print(i)
exit()
| N,K=map(int,input().split())
D=list(input().split())
for i in range(N,100000):
ans=True
for j in str(i):
if(str(j) in D):
ans=False
break
if(ans):
print(i)
exit()
| [["+", 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, 7,... | 5 | 64 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
char d[15];
cin >> n >> k;
for (int i = 0; i < k; i++)
cin >> d[i];
string s;
for (long long i = n;; i++) {
s = to_string(i);
bool flag = false;
for (int j = 0; j < s.size(); j++) {
for (int l = 0; l < ... | #include <iostream>
#include <string>
using namespace std;
int main() {
long long n, k;
char d[15];
cin >> n >> k;
for (int i = 0; i < k; i++)
cin >> d[i];
for (long long i = n;; i++) {
string s = to_string(i);
bool flag = false;
for (int j = 0; j < s.size(); j++) {
for (int l = 0; l <... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 8, 1, 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, 7, 8, 9, 0, 43, 39, 78], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 8, 9, 0, 57, 15, 339, 51, 91... | 1 | 155 |
n,k=map(int,input().split())
x = list(map(int,input().split()))
t = 1
s = n
while t:
for i in range(k):
if str(x[i]) in str(s):
break
t = 0
s+=1
print(s-1) | n,k=map(int,input().split())
x = list(map(int,input().split()))
t = 1
s = n
f=0
while t:
for i in range(k):
f = 0
if str(x[i]) in str(s):
break
elif i == k -1:t = 0
s+=1
print(s-1)
| [["+", 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, 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, 75, 665, 0, 683], ["+", 8, 1... | 5 | 77 |
#include <bits/stdc++.h>
using namespace std;
int k, d, a[15];
string n;
set<int> s;
int main() {
cin >> n >> k;
for (int i = 0; i <= 9; ++i)
s.insert(i);
for (int i = 1; i <= k; ++i) {
cin >> d;
s.erase(d);
}
for (int i = 1; i <= n.size(); ++i)
a[i] = int(n[i - 1] - '0');
int id = n.siz... | #include <bits/stdc++.h>
using namespace std;
int k, d, a[15];
string n;
set<int> s;
int main() {
cin >> n >> k;
for (int i = 0; i <= 9; ++i)
s.insert(i);
for (int i = 1; i <= k; ++i) {
cin >> d;
s.erase(d);
}
for (int i = 1; i <= n.size(); ++i)
a[i] = int(n[i - 1] - '0');
int id = n.siz... | [["-", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29], ["-", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["-", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 0, 9, 0, 7, 1... | 1 | 344 |
def ceil(n, i):
dec = 10 ** i
return n // dec * dec
(n, k) = list(map(int, input().split()))
d = list(map(int, input().split()))
l = []
for i in range(0, 10):
if i not in d:
l.append(i)
i = 1
while len(str(n)) + 1 >= i:
nown = n // (10 ** (i - 1)) % 10
ok = False
for j in l:
if ... | def ceil(n, i):
dec = 10 ** i
return n // dec * dec
(n, k) = list(map(int, input().split()))
d = list(map(int, input().split()))
l = []
for i in range(0, 10):
if i not in d:
l.append(i)
i = 1
while len(str(n)) >= i:
nown = n // (10 ** (i - 1)) % 10
ok = False
for j in l:
if j ==... | [["-", 0, 656, 0, 52, 15, 666, 0, 657, 17, 72], ["-", 0, 656, 0, 52, 15, 666, 0, 657, 12, 612], ["-", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22], ["-", 0, 57, 64, 196, 0, 1, 0, 677, 17, 107], ["-", 0, 57, 64, 196, 0, 1, 0, 677, 12, 612], ["-", 75, 665, 64, 196, 0, 1, 0, 677, 31, 22], ["-", 75, 665, 64, 196, 0, 1, 0, 677, 17... | 5 | 216 |
//#include <bits/stdc++.h>
//
// using namespace std;
//
// const int maxn = 2000;
// int d[maxn];
// string str;
// bool vis[20];
// int main() {
// while(cin >> k >> str) {
// memset(vis,0,sizeof(vis));
// for(int i = 1; i <= k; i++) cin >> d[i],vis[d[i]] = 1;
// int ans = 0;
// int len... | //#include <bits/stdc++.h>
//
// using namespace std;
//
// const int maxn = 2000;
// int d[maxn];
// string str;
// bool vis[20];
// int main() {
// while(cin >> k >> str) {
// memset(vis,0,sizeof(vis));
// for(int i = 1; i <= k; i++) cin >> d[i],vis[d[i]] = 1;
// int ans = 0;
// int len... | [["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 78], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 49, 22], ["-", 8, 9... | 1 | 247 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define INF 1 << 30
#define LINF 1ll << 60ll
#define MOD 1000000007
#define pb(a) push_back(a)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define INF 1 << 30
#define LINF 1ll << 60ll
#define MOD 1000000007
#define pb(a) push_back(a)
... | [["+", 0, 30, 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, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], [... | 1 | 342 |
import java.io.BufferedInputStream;
import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(new BufferedInputStream(System.in));
String N = scan.next();
int K = scan.nextInt();
HashSet<Integer> dis = new HashSet<>();
... | import java.io.BufferedInputStream;
import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(new BufferedInputStream(System.in));
String N = scan.next();
int K = scan.nextInt();
HashSet<Integer> dis = new HashSet<>();
... | [["+", 8, 498, 0, 195, 8, 196, 0, 57, 0, 121], ["+", 0, 195, 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], ["+", 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], ... | 3 | 442 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
int k;
int a[10] = {0};
for (int i = 0; i < k; i++) {
int x;
cin >> x;
a[x] = 1;
}
long long ans = n;
while (1) {
long long v = ans;
int y = 1;
while (v > 0) {
if (a[v % 10]) {
y = 0;
brea... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
int k;
cin >> n >> k;
int a[10] = {0};
for (int i = 0; i < k; i++) {
int x;
cin >> x;
a[x] = 1;
}
long long ans = n;
while (1) {
long long v = ans;
int y = 1;
while (v > 0) {
if (a[v % 10]) {
y ... | [["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 17, 107], ["-", 0, 52, 8, 9, 0, 1, 0,... | 1 | 125 |
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int N, K;
int D[10] = {0};
int main() {
cin >> N >> K;
string S = to_string(N);
for (int i = 0; i < K; i++) {
int a;
cin >> a;
D[a] = 1;
}
bool judge = false;
int i = 1;
int A = N;
while (1) {
... | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int N, K;
int D[11] = {0};
int main() {
cin >> N >> K;
string S = to_string(N);
for (int i = 0; i < K; i++) {
int a;
cin >> a;
D[a] = 1;
}
bool judge = false;
int A = N;
while (1) {
int j = 10;... | [["-", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 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], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 51, 16, 31, ... | 1 | 162 |
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
int needleX[4] = {-1, 0, 1, 0};
int needleY[4] = {0, 1, 0, -1};
int main(void) {
int n, k;
std::cin >> n >> k;
std::set<int> d;
int ... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
int needleX[4] = {-1, 0, 1, 0};
int needleY[4] = {0, 1, 0, -1};
int main(void) {
int n, k;
std::cin >> n >> k;
std::set<int> d;
int ... | [["+", 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, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 147], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 52, 8, 9, 0, 57, 64, 93, 0, 94], ["+", 0, 52, 8... | 1 | 209 |
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
bool digits[10];
vector<int> numDig;
vector<int> loved;
void funct(int n) {
while (n != 0) {
numDig.push_back(n % 10);
n = n / 10;
}
}
bool check(int n) {
funct(n);
for (int i = 0; i < numDig.size(); ... | #include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
bool digits[10];
vector<int> numDig;
vector<int> loved;
void funct(int n) {
while (n != 0) {
numDig.push_back(n % 10);
n = n / 10;
}
}
bool check(int n) {
funct(n);
for (int i = 0; i < numDig.size(); ... | [["-", 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 | 308 |
import bisect
n,K = map(str,input().split(" "))
D = list(map(int,input().split(" ")))
N = list(n)
D_bar = []
for i in range(10):
if not i in D:
D_bar.append(i)
mv = str(D_bar[0])
ld = 10 - int(K)
l = len(N)
index = -1
for i in range(l):
if int(N[i]) in D:
index = i
break
if index == (-1):
print(n)
exit(0)
... | import bisect
n,K = map(str,input().split(" "))
D = list(map(int,input().split(" ")))
N = list(n)
D_bar = []
for i in range(10):
if not i in D:
D_bar.append(i)
mv = str(D_bar[0])
ld = 10 - int(K)
l = len(N)
index = -1
for i in range(l):
if int(N[i]) in D:
index = i
break
if index == (-1):
print(n)
exit(0)
... | [["+", 36, 36, 36, 36, 0, 656, 0, 7, 0, 88], ["+", 36, 36, 36, 36, 0, 656, 0, 7, 31, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 7, 0, 267], ["+", 36, 36, 0, 656, 0, 7, 12, 652, 63, 22], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 24], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 31, 22], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0,... | 5 | 269 |
n,k=map(int,input().split())
dislike=list(map(int,input().split()))
while 1:
for i in range(len(str(n))):
if int(str(n)[i]) in dislike:
break
print(n)
exit()
n+=1 | n,k=map(int,input().split())
dislike=list(map(int,input().split()))
while 1:
for i in range(len(str(n))):
if int(str(n)[i]) in dislike:
break
if i==len(str(n))-1:
print(n)
exit()
n+=1 | [["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 60], ["+", 0, 57, 15, 666, 0, 657, 31, 652, 63, 22], ["+", 15, 666, 0, 657, 31, 652, 3, 4, 0, 24], ["+", 0, 657, 31, 652, 3, 4, 0, 652, 63, 22], ["+", 31, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["... | 5 | 75 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
static const int INF = 1000010000;
static const int NIL = -1;
static const i... | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
static const int INF = 1000010000;
static const int NIL = -1;
static const i... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89],... | 1 | 572 |
// +-- -- --++-- +-In the name of ALLAH-+ --++-- -- --+ \\
#include <bits/stdc++.h>
#define F first
#define S second
#define _sz(x) (int)x.size()
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
int n, k;
bool bad[30];
inline bool ok(int x) {
... | // +-- -- --++-- +-In the name of ALLAH-+ --++-- -- --+ \\
#include <bits/stdc++.h>
#define F first
#define S second
#define _sz(x) (int)x.size()
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
int n, k;
bool bad[30];
inline bool ok(int x) {
... | [["-", 8, 9, 0, 52, 15, 339, 51, 27, 28, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 27, 28, 22], ["+", 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, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 175 |
// +-- -- --++-- +-In the name of ALLAH-+ --++-- -- --+ \\
#include <bits/stdc++.h>
#define F first
#define S second
#define _sz(x) (int)x.size()
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
int n, k;
bool bad[30];
inline bool ok(int x) {
... | // +-- -- --++-- +-In the name of ALLAH-+ --++-- -- --+ \\
#include <bits/stdc++.h>
#define F first
#define S second
#define _sz(x) (int)x.size()
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
int n, k;
bool bad[30];
inline bool ok(int x) {
... | [["-", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 52, 15, 339, 51, 27, 28, 22], ["-", 8, 9, 0, 52, 15, 339, 51, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["+", 0, 52, 8, 9, 0, 57, 64, 37, 0, 35], ["+", 0, 52, 8, 9, 0,... | 1 | 175 |
#include <bits/stdc++.h>
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define forn(i, o, n) for (int i = o... | #include <bits/stdc++.h>
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define forn(i, o, n) for (int i = o... | [["+", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 15, 339, 51, 16, 31, 2, 63, 118, 28, 22], ["+", 15, 339, 51, 16, 31, 2, 63, 118, 17, 131], ["+", 15, 339, 51, 16, 31, 2, 63, 118, 119, 120], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 24], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 25],... | 1 | 700 |
#include <iostream>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define pb(x) push_back(x)
#define F first
#define S second
using namespace std;
bool com[10];
int main() {
... | #include <iostream>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define pb(x) push_back(x)
#define F first
#define S second
using namespace std;
bool com[10];
int main() {
... | [["-", 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, 1, 0, 27, 28, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 27, 17, 29], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 196 |
N, K = map(int, input().split())
D = list(input().split())
for i in range(N, 10*N+1):
s = str(i)
for j in range(len(str(i))):
if(s[j] in D):
break
print(i)
quit() | N, K = map(int, input().split())
D = list(input().split())
for i in range(N, 10*N+1):
s = str(i)
for j in range(len(str(i))):
if(s[j] in D):
break
if(j == len(str(i))-1):
print(i)
quit() | [["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 23, 0, 24], ["+", 8, 196, 0, 57, 15, 23, 0, 666, 0, 22], ["+", 8, 196, 0, 57, 15, 23, 0, 666, 667, 60], ["+", 15, 23, 0, 666, 0, 657, 31, 652, 63, 22], ["+", 0, 666, 0, 657, 31, 652, 3, 4, 0, 24], ["+", 0, 657, 31, 652, 3, 4, 0, 652, 63, 22], [... | 5 | 80 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0;... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["+", 0, 14, 8, 9, 0, 14, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 14, 8, 9, 0, 46], ["+", 0, 30, 0, 14,... | 1 | 302 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>... | [["+", 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], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 13], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 6... | 1 | 347 |
#include <bits/stdc++.h>
using namespace std;
#define sqr(x) ((x) * (x))
#define cube(x) ((x) * (x) * (x))
#define GCD(a, b) __gcd(a, b)
#define LCM(a, b) ((a) * (b) / GCD(a, b))
#define MP make_pair
#define n1 first
#define n2 second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define SI set<int>
#define SL s... | #include <bits/stdc++.h>
using namespace std;
#define sqr(x) ((x) * (x))
#define cube(x) ((x) * (x) * (x))
#define GCD(a, b) __gcd(a, b)
#define LCM(a, b) ((a) * (b) / GCD(a, b))
#define MP make_pair
#define n1 first
#define n2 second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define SI set<int>
#define SL s... | [["-", 0, 30, 0, 14, 8, 9, 0, 171, 0, 184], ["-", 0, 30, 0, 14, 8, 9, 0, 171, 141, 22], ["-", 8, 9, 0, 171, 0, 1, 0, 2, 63, 22], ["-", 0, 171, 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, 171, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 171, 0, 1, 0, 2, 3, 4, 0, 2... | 1 | 356 |
n, k = map(int, input().split())
Ds = list(map(int, input().split()))
for i in range(n, n*11):
for d in Ds:
if d in list(str(i)):
break
else:
print(i)
exit(0) | n, k = map(int, input().split())
Ds = list(map(int, input().split()))
for i in range(n, n*11):
for d in Ds:
if d in list(map(int, list(str(i)))):
break
else:
print(i)
exit(0) | [["+", 15, 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, 21], ["+", 3, 4, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 72 |
#include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (ll(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (ll(i) = 1; (i) < (n); ++(i))
#define rrep1(i, n) for (ll(i) = (n)-1; (i) >= 1; --(i))
#define nfor(i, a, b) for (ll(i) = (a); (i) < (b); ++(... | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (ll(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (ll(i) = 1; (i) < (n); ++(i))
#define rrep1(i, n) for (ll(i) = (n)-1; (i) >= 1; --(i))
#define nfor(i, a, b) for (ll(i) = (a); (i) < (b); ++(... | [["-", 0, 14, 8, 9, 0, 14, 49, 53, 49, 22], ["+", 0, 14, 8, 9, 0, 14, 49, 53, 49, 22], ["-", 8, 9, 0, 57, 64, 9, 0, 126, 0, 127], ["-", 8, 9, 0, 57, 64, 9, 0, 126, 128, 129], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 8, 9, 0, 57, 1... | 1 | 270 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define prin(arg) std::cout <... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define prin(arg) std::cout <... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35], ["+", 64, 9, 0, 1, 0, 16, 31, 2, 63, 22], ["+", 0, 1, 0, 16, 31, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 16, 31, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 16, 31, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 16, 31, 2, 3, 4, 0, 25], ["+", 64, 9, 0, 1, 0, 16, 12, 69, 2... | 1 | 558 |
#include <bits/stdc++.h>
using namespace std;
char d[10];
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < k; i++) {
char f;
cin >> k;
d[f - '0'] = 1;
}
for (int i = n;; i++) {
string s = to_string(i);
for (int j = 0; j < s.size(); j++)
if (d[(s[j] - '0')] == 1)
goto E... | #include <bits/stdc++.h>
using namespace std;
char a[10];
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < k; i++) {
char f;
cin >> f;
a[f - '0'] = 1;
}
for (int i = n; i < 100000; i++) {
string s = to_string(i);
for (int j = 0; j < s.size(); j++)
if (a[(s[j] - '0')] == 1)
... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 49, 22], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 49, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7... | 1 | 137 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define inf 1000000007
int main(void) {
int n, k;
cin >> n >> k;
int d[k];
int a, b, c, e;
int count;
for (int i = 0; i < k; i++)
cin >> d[i];
for (int i = n; i <= 10000; i++) {
count = 0;
a = i /... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define inf 1000000007
int main(void) {
int n, k;
cin >> n >> k;
int d[k];
int a, b, c, e, x;
int count;
for (int i = 0; i < k; i++)
cin >> d[i];
for (int i = n; i < 100000; i++) {
count = 0;
x = ... | [["+", 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, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 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, 1, 0, 35], ["+", 0, 7, 8, 9, 0, 1, 0, 11,... | 1 | 227 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int $(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
signed main() {
int a, b, e = 0;
cin >> a >> b;
vector<char> c(b);
string d;
for (int i = 0; i < b; i++)
cin >> c.at(i);
for (int i = a; i < 10000... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int $(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
signed main() {
int a, b, e = 0;
cin >> a >> b;
vector<char> c(b);
string d;
for (int i = 0; i < b; i++)
cin >> c.at(i);
for (int i = a; i < 10000... | [["+", 15, 339, 51, 16, 12, 2, 63, 118, 28, 22], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 17, 131], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 119, 120], ["+", 15, 339, 51, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", ... | 1 | 199 |
#include <bits/stdc++.h>
#define endl '\n'
#define INF (1 << 21)
typedef long long ll;
const int MOD = 1000000007;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
string ans;
int k;
int ng[10] = {};
int d;
bool big = false;
cin >> s >> k;
for (int i = 0; i < k;... | #include <bits/stdc++.h>
#define endl '\n'
#define INF (1 << 21)
typedef long long ll;
const int MOD = 1000000007;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
string ans;
int k;
int ng[10] = {};
int d;
bool big = false;
cin >> s >> k;
for (int i = 0; i < k;... | [["-", 8, 9, 0, 57, 64, 9, 0, 7, 0, 88], ["-", 8, 9, 0, 57, 64, 9, 0, 7, 0, 24], ["+", 8, 9, 0, 57, 64, 9, 0, 43, 0, 35], ["+", 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, 60], ["+", 64, 9, 0, 57, ... | 1 | 324 |
#include <bits/stdc++.h>
#define F first
#define S second
#define endl '\n'
#define lcm(a, b) ((a) / __gcd(a, b) * (b))
#define MP make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> i_P;
typedef pair<LL, LL> L_... | #include <bits/stdc++.h>
#define F first
#define S second
#define endl '\n'
#define lcm(a, b) ((a) / __gcd(a, b) * (b))
#define MP make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> i_P;
typedef pair<LL, LL> L_... | [["-", 0, 30, 0, 14, 8, 9, 0, 7, 0, 88], ["-", 0, 30, 0, 14, 8, 9, 0, 7, 0, 24], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 88], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 24], ["-", 0, 14, 8, 9, 0, 7, 26, 27, ... | 1 | 292 |
#include <bits/stdc++.h>
using namespace std;
int arr[15];
int N, k;
int ans = 0;
int check(int x) {
while (x) {
if (arr[x % 10] == 1) {
return 0;
}
x /= 10;
}
return 1;
}
int main() {
scanf("%d%d", &N, &k);
for (int i = 0; i < k; i++) {
int temp;
scanf("%d", &temp);
arr[temp] = ... | #include <bits/stdc++.h>
using namespace std;
int arr[15];
int N, k;
int ans = 0;
int check(int x) {
while (x) {
if (arr[x % 10] == 1) {
return 0;
}
x /= 10;
}
return 1;
}
int main() {
for (int i = 0; i < 15; i++) {
arr[i] = 0;
}
scanf("%d%d", &N, &k);
for (int i = 0; i < k; i++) {
... | [["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 88], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 24], ["+", 0, 14, 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, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 7, 15,... | 1 | 153 |
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, K, D, A[10] = {};
cin >> N >> K;
for (int i = 0; i < K; i++) {
cin >> A[i];
}
M = N;
while (N != 0) {
for (int i = 0; i < K; i++) {
if (N % 10 == ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, K, D, A[10] = {};
cin >> N >> K;
for (int i = 0; i < K; i++) {
cin >> A[i];
}
N *= 10;
M = N;
while (N != 0) {
for (int i = 0; i < K; i++) {
if ... | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 108], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 85], ["+", 0, 1, 0, 16, 31, 16, 12,... | 1 | 127 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> d(k);
for (auto &e : d)
cin >> e;
int ans = n;
while (true) {
int tmp = ans, cnt = 0;
bool j = true;
while (tmp) {
int t = tmp % 10;
tm... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> d(k);
for (auto &e : d)
cin >> e;
int ans = n;
while (true) {
int tmp = ans;
bool j = true;
while (tmp) {
int t = tmp % 10;
tmp /= 10;
... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 21], ["-", 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, 13], ["-", 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, 57, 0, 121], ["+", 0, 52, 8, 9, 0, 57, 15... | 1 | 154 |
#include <cstdio>
#include <iostream>
using namespace std;
int n, k;
bool v[15];
bool f(int p) {
for (; p; p /= 10)
if (v[p % 10])
return 0;
return 1;
}
int main() {
int t;
freopen("input.txt", "r", stdin);
cin >> n >> k;
while (k--)
scanf("%d", &t), v[t] = 1;
for (;; n++)
if (f(n))
... | #include <cstdio>
#include <iostream>
using namespace std;
int n, k;
bool v[15];
bool f(int p) {
for (; p; p /= 10)
if (v[p % 10])
return 0;
return 1;
}
int main() {
int t;
cin >> n >> k;
while (k--)
scanf("%d", &t), v[t] = 1;
for (;; n++)
if (f(n))
return !printf("%d", n);
retu... | [["-", 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 | 129 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
using namespace std;
const int INF = 1e9;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
bool num[10];
for (int i = 0; i < 10; i++)
num[i] = true;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
using namespace std;
const int INF = 1e9;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
bool num[10];
for (int i = 0; i < 10; i++)
num[i] = true;
... | [["+", 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 | 346 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define ... | [["+", 0, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 9, 0, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 9, 0, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 9, 0, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 9, 0, 9, 0, 9, 0, 57, 0, 121], ["+", 0, 9, 0, 9, 0, 5... | 1 | 210 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define... | [["-", 8, 9, 0, 42, 0, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 74, 0, 24], ["+", 0, 2, 3, 4, 0, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 2, 3, 4, 0, 74, 0, 25], ["+", 3, 4, 0, 74, 51, 2, 63, 118, 28, 22], ["+", 3, 4, 0, 74, 51, 2, 63, 118, 17, 131], ["+", 3, 4, 0, 74, 51, 2, 63, 118, 119, 120], ["+", 3, 4, 0, 74, 51, 2,... | 1 | 333 |
#! /usr/bin/env python3
import itertools
def main():
N, K = input().split()
l = list(set(list('0123456789')) - set(input().split()))
t = int(N)
for i in itertools.product(l, repeat=len(N)):
if int(''.join(i)) >= t:
print(''.join(i))
return
for i in itertools.product(... | #! /usr/bin/env python3
import itertools
def main():
N, K = input().split()
l = list(set(list('0123456789')) - set(input().split()))
t = int(N)
m = 100000
for i in itertools.product(l, repeat=len(N)):
if int(''.join(i)) >= t:
m = min(m, int(''.join(i)))
for i in itertools.pr... | [["+", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 12, 612], ["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 0, 32], ["+", 64, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", ... | 5 | 146 |
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <sstream>
using namespace std;
int main() {
int i, n, m, flag = 1;
string ans, kirai[10][2];
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> kirai[i][0];
}
while (1) {
ostringstream stream;
stream << n;
a... | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <sstream>
using namespace std;
int main() {
int i, j = 0, n, m, flag = 1;
string kirai[10][2], ans;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> kirai[i][0];
}
while (1) {
ostringstream stream;
stream << n... | [["+", 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, 21], ["-", 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, 49, 22], ["-", 8, 9, 0, 57, 15, 33... | 1 | 160 |
#include <bits/stdc++.h>
using namespace std;
int N, K;
vector<int> V;
bool mem[20] = {0};
int main() {
scanf("%d%d", &N, &K);
for (int i = 0; i < K; i++) {
int d;
scanf("%d", &d);
mem[d] = true;
}
sort(V.begin(), V.end());
for (int i = 0; i < 10; i++) {
if (mem[i] && i != 0)
continue;... | #include <bits/stdc++.h>
using namespace std;
int N, K;
vector<int> V;
bool mem[20] = {0};
int main() {
scanf("%d%d", &N, &K);
for (int i = 0; i < K; i++) {
int d;
scanf("%d", &d);
mem[d] = true;
}
sort(V.begin(), V.end());
for (int i = 0; i < 10; i++) {
if (mem[i] && !(i == 0))
contin... | [["+", 0, 57, 15, 339, 51, 16, 12, 91, 17, 111], ["+", 15, 339, 51, 16, 12, 91, 28, 23, 0, 24], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 51, 16, 12, 91, 28, 23, 0, 16, 17, 60], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 25], ["-", 51, 16, 12, 23, 0, 16, 12, 16, 17, 79], ["+", 12, 91, 28, 23, 0, 16, 12, 16, 17, 60... | 1 | 321 |
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static boolean like(int n, List<Integer> d_lst) {
while (n > 0) {
int mod = n % 10;
int q = n / 10;
if (... | import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static boolean like(int n, List<Integer> d_lst) {
while (n > 0) {
int mod = n % 10;
int q = n / 10;
if (... | [["-", 0, 195, 8, 196, 0, 503, 49, 200, 51, 499], ["-", 8, 498, 0, 195, 8, 196, 0, 503, 0, 35], ["-", 8, 498, 0, 195, 8, 196, 0, 7, 0, 88], ["-", 8, 498, 0, 195, 8, 196, 0, 7, 0, 24], ["-", 0, 195, 8, 196, 0, 7, 502, 11, 31, 22], ["-", 0, 195, 8, 196, 0, 7, 502, 11, 17, 32], ["-", 8, 498, 0, 195, 8, 196, 0, 7, 0, 35], ... | 3 | 280 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
int n, K;
set<int> mySet;
vector<int> v;
vector<int> getDigits(int x) {
vector<int> v;
while (x) {
v.pb(x % 10);
x /= 10;
}
reverse(v.begin(), v.end());
return v;
}
void faCelMaiMic() {
... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
int n, K;
set<int> mySet;
vector<int> v;
vector<int> getDigits(int x) {
vector<int> v;
while (x) {
v.pb(x % 10);
x /= 10;
}
reverse(v.begin(), v.end());
return v;
}
void faCelMaiMic() {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 171, 0, 184], ["-", 0, 30, 0, 14, 8, 9, 0, 171, 141, 22], ["-", 8, 9, 0, 171, 0, 1, 0, 2, 63, 22], ["-", 0, 171, 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, 171, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 171, 0, 1, 0, 2, 3, 4, 0, 2... | 1 | 668 |
#include <bits/stdc++.h>
using namespace std;
vector<int> d, kouho;
int digit[4];
void dfs(int n, int i, bool flag) {
if (i == 4) {
int res = digit[0] * 1000 + digit[1] * 100 + digit[2] * 10 + digit[3];
if (res >= n)
kouho.push_back(res);
return;
}
if (flag) {
digit[i] = 0;
dfs(n, i + ... | #include <bits/stdc++.h>
using namespace std;
vector<int> d, kouho;
int digit[5];
void dfs(int n, int i, bool flag) {
if (!kouho.empty())
return;
if (i == 5) {
int res = digit[0] * 10000 + digit[1] * 1000 + digit[2] * 100 +
digit[3] * 10 + digit[4];
if (res >= n)
kouho.push_back(re... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111], ["+", 15, 339, 51, 91, 28, 2, 63, 118, 28, 22], ["+", 15, 339, 51, 91, 28, 2, 63, 118, 17, 131], ["+", 15, 339, 51, 91, 28, 2, 63, 118, 119,... | 1 | 283 |
#include "math.h"
#include <algorithm>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ifor(i, a, b) for (int i = (a); i < (b); i++)
#define rfor(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n)... | #include "math.h"
#include <algorithm>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ifor(i, a, b) for (int i = (a); i < (b); i++)
#define rfor(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n)... | [["-", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["+", 8, 9, 0, 52, 8, 9, 0, 52, 0, 89], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 73],... | 1 | 230 |
#include <iostream>
using namespace std;
int check(int *d, int n, int k) {
while (n / 10 > 0) {
n /= 10;
for (int i = 0; i < k; i++) {
if ((n % 10) == d[i]) {
return -1;
}
}
}
return 0;
}
int main() {
int n, k;
cin >> n >> k;
int *d = new int[k];
for (int i = 0; i < k;... | #include <iostream>
using namespace std;
int check(int *d, int n, int k) {
while (n > 0) {
for (int i = 0; i < k; i++)
if ((n % 10) == d[i])
return -1;
n /= 10;
}
return 0;
}
int main() {
int n, k;
cin >> n >> k;
int *d = new int[k];
for (int i = 0; i < k; i++)
cin >> d[i];... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 85], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 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, 12, 13], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 57,... | 1 | 150 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#includ... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#includ... | [["+", 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], ["-", 341, 342, 0, 16, 31, 23, 0, 16, 31, 22], ["+", 341, 342, 0, 16, 31, 23, 0, 16, 31, 22], ["-", 0, 57, 6... | 1 | 235 |
#include <algorithm>
#include <iostream>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
#define NUM_KETA (4 + 1 + 1) /* strlen('9999\0') + carry */
bool incr(char N[NUM_KETA], const uint32_t idx) {
bool f = false;
for (int32_t i = idx; i >= 0; i--) {
if (N[... | #include <algorithm>
#include <iostream>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
#define NUM_KETA (4 + 1 + 1) /* strlen('9999\0') + carry */
bool incr(char N[NUM_KETA], const uint32_t idx) {
bool f = false;
for (int32_t i = idx; i >= 0; i--) {
if (N[... | [["+", 64, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 70], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 73], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 64, 9, 0, 1, 0, 11, 12, 103, 0, 104], ["+", 64, 9, 0, 1, 0, 11, 12, 103, 0, 125], ["+", 8, 9,... | 1 | 406 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> d;
for (int i = 0; i < k; i++) {
int tmp;
cin >> tmp;
d.push_back(tmp);
}
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> d;
for (int i = 0; i < k; i++) {
int tmp;
cin >> tmp;
d.push_back(tmp);
}
... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 7, 0, 88], ["+", 8, 9, 0, 57, 64, 9, 0, 7, 0, 24], ["+", 0, 57, 64, 9, 0, 7, 10, 43, 39, 40], ["+", 64, 9, 0, 7, 10, 43, 49,... | 1 | 331 |
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n;
bool bad[10];
bool check(int x) {
while (x > 0) {
if (bad[x % 10])
return false;
x /= 10;
}
return true;
}
int main() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
int... | #include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n;
bool bad[10];
bool check(int x) {
while (x > 0) {
if (bad[x % 10])
return false;
x /= 10;
}
return true;
}
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
... | [["-", 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 | 160 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int k, num[11] = {};
cin >> str >> k;
str = '0' + str;
for (int i = 0, a; i < k; i++)
cin >> a, num[a] = 1;
string ans;
int m = 0, flg = 1;
while (num[m])
m++;
for (int i = str.size() - 1; i >= 0; i--) {
int cnt = str... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int k, num[11] = {};
cin >> str >> k;
str = '0' + str;
for (int i = 0, a; i < k; i++)
cin >> a, num[a] = 1;
string ans;
int m = 0;
while (num[m])
m++;
for (int i = str.size() - 1; i >= 0; i--) {
if (i == 0 && str[i] =... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 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], ["+", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339,... | 1 | 282 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
int main() {
int n, k;
char a;
set<char> S;
string s;
stringstream ss;
cin >> n >> k;
for (int i = 0; i < k;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
int main() {
int n, k;
char a;
set<char> S;
string s;
stringstream ss;
cin >> n >> k;
for (int i = 0; i < k;... | [["-", 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, 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,... | 1 | 196 |
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAX_N = 100005;
int A[MAX_N], N;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i)
scanf("%d", &A[i]);
sort(A + 1, A + N + 1);
reverse(A + 1, A + N + 1);
for (int i = 1, last = 1; i <= N; ++i) {
int ... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAX_N = 100005;
int A[MAX_N], N;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i)
scanf("%d", &A[i]);
sort(A + 1, A + N + 1);
reverse(A + 1, A + N + 1);
for (int i = 1, last = 1; i <= N; ++i) {
int ... | [["+", 51, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 49, 50, 51, 16, 31, 23, 0, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 16, 31, 23, 0, 25], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 67], ["-", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["-", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25], ["+", 0, 43, 49, 50, 51, 16, 31, 23, 0, 24], ... | 1 | 333 |
#include <bits/stdc++.h>
using namespace std;
int n, a[100009];
int main() {
scanf("%d", &n);
int i, x, y;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
for (i = 1; i <= n; i++) {
if (i == 1) {
x = 1;
y = a[i] & 1 ^ 1;
} else if (a[i] == a[i - 1]) {
if (x ... | #include <bits/stdc++.h>
using namespace std;
int n, a[100009];
int main() {
scanf("%d", &n);
int i, x, y;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
for (i = 1; i <= n; i++) {
if (i == 1) {
x = 1;
y = a[i] & 1 ^ 1;
} else if (a[i] == a[i - 1]) {
if (x ... | [["-", 75, 76, 0, 9, 0, 57, 15, 339, 0, 25], ["-", 0, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["-", 0, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 15, 339, 51, 16, 12, 16, 31, 69, 28, 22], ["+", 51, 16, 12, 16, 31, 69, 341, 342, 0, 70], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["... | 1 | 254 |
#include <bits/stdc++.h>
using namespace std;
int n, a[100005], b[100005];
void Get(int x) {
puts(x ? "Second" : "First");
exit(0);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
if (a[i] != a[i - 1])
b[i]... | #include <bits/stdc++.h>
using namespace std;
int n, a[100005], b[100005];
void Get(int x) {
puts(x ? "Second" : "First");
exit(0);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
if (a[i] != a[i - 1])
b[i]... | [["+", 0, 7, 8, 9, 0, 57, 64, 57, 0, 121], ["+", 8, 9, 0, 57, 64, 57, 15, 339, 0, 24], ["+", 64, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["+", 0, 57, 64, 57, 15, 339, 51, 16, ... | 1 | 246 |
#include <bits/stdc++.h>
using namespace std;
#define N 111116
int n, a[N];
int read() {
int x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -f;
for (; isdigit(ch); ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
int main() {
n = read();
f... | #include <bits/stdc++.h>
using namespace std;
#define N 111116
int n, a[N];
int read() {
int x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -f;
for (; isdigit(ch); ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
int main() {
n = read();
f... | [["+", 15, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 23, 0, 16, 31, 69, 28, 22], ["+", 31, 23, 0, 16, 31, 69, 341, 342, 0, 70], ["+", 31, 23, 0, 16, 31, 69, 341, 342, 0, 73], ["+", 31, 23, 0, 16, 31, 23, 0, 16, 17, 33], ["+", 31, 23, 0, 16, 31, 23, 0, 16, 12, 22], ["+", 15, 16, 31, 23, 0, 16, 31, 23, 0, 25]] | 1 | 228 |
#include <bits/stdc++.h>
using namespace std;
const int N = 110000;
int n;
int a[N];
int cmp(int x, int y) { return x > y; }
int main() {
// freopen("tt.in","r",stdin);
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + 1 + n, cmp);
for (int i = 1, j; i <= n; i++) {
if (... | #include <bits/stdc++.h>
using namespace std;
const int N = 110000;
int n;
int a[N];
int cmp(int x, int y) { return x > y; }
int main() {
// freopen("tt.in","r",stdin);
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + 1 + n, cmp);
for (int i = 1, j; i <= n; i++) {
if (... | [["+", 64, 9, 0, 7, 10, 11, 12, 16, 17, 72], ["+", 64, 9, 0, 7, 10, 11, 12, 16, 12, 13], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 49, 50, 51, 16, 31, 23, 0, 16, 17, 33], ["+", 49, 50, 51, 16, 31, 23, 0, 16, 12, 13], ["+", 49, 50, 51, 16, 12, 23, 0, 16, 17, 33... | 1 | 303 |
#include <bits/stdc++.h>
#define For(i, j, k) for (int i = j; i <= k; i++)
#define Forr(i, j, k) for (int i = j; i >= k; i--)
using namespace std;
const int N = 100010;
int A[N], n;
int main() {
scanf("%d", &n);
For(i, 1, n) scanf("%d", &A[i]);
sort(A + 1, A + n + 1);
int ans = true, now = false;
Forr(r,... | #include <bits/stdc++.h>
#define For(i, j, k) for (int i = j; i <= k; i++)
#define Forr(i, j, k) for (int i = j; i >= k; i--)
using namespace std;
const int N = 100010;
int A[N], n;
int main() {
scanf("%d", &n);
For(i, 1, n) scanf("%d", &A[i]);
sort(A + 1, A + n + 1);
int ans = false, now = false;
Forr(r... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 146], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 147], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25], ["+", 64, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["+", 64, 9, 0, 57, 64, 1, 0, 11, 17, 130], ["+", 64, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 57, 64, 1, 0, 35], ["+", 75, 76, 0... | 1 | 259 |
#include <bits/stdc++.h>
using namespace std;
int n, a[100010];
int main() {
#ifdef h10
freopen("E.in", "r", stdin);
freopen("E.out", "w", stdout);
#endif
int i, k;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1, greater<int>());
for (k = 1; k <= a[k] && k <= n; ... | #include <bits/stdc++.h>
using namespace std;
int n, a[100010];
int main() {
#ifdef h10
freopen("E.in", "r", stdin);
freopen("E.out", "w", stdout);
#endif
int i, k;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1, greater<int>());
for (k = 1; k <= a[k] && k <= n; ... | [["-", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 7, 10, 34, 31, 11, 31, 22], ["+", 8, 9, 0, 7, 10, 34, 31, 11, 17, 110], ["+", 8, 9, 0, 7, 10, 34, 31, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 34, 0, 21], ["-", 8, 9, 0, 52, 15, 339... | 1 | 231 |
// Candy Piles
// * frank_c1
// * 2017 / 09 / 29
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)(1e5) + 5;
int a[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1, greater<int>());
int pt = 0;
for (; pt < n && pt < ... | // Candy Piles
// * frank_c1
// * 2017 / 09 / 29
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)(1e5) + 5;
int a[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1, greater<int>());
int pt = 0;
for (; pt < n && pt < ... | [["+", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111], ["+", 0, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 31, 23, 0, 16, 31, 23, 0, 16, 17, 72], ["+", 31, 23, 0, 16, 31, 23, 0, 16, 12, 13], ["-", 15, 339, 51, 16, 31, 23, 0, 16, 17, 140], ["+", 28, 23, 0, 16, 31, 23, 0, 16, 17, 67], ["+", 28, 23, 0, 16, 31, 23, 0, 16, 12, 13], [... | 1 | 185 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const int MAXN = 100000 + 100;
int n, a[MAXN];
int main() {
ios::sync_with_stdio(false);
// freopen("1.in", "r", stdin);
//... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const int MAXN = 100000 + 100;
int n, a[MAXN];
int main() {
ios::sync_with_stdio(false);
// freopen("1.in", "r", stdin);
//... | [["-", 8, 57, 64, 9, 0, 43, 49, 50, 49, 22], ["+", 8, 57, 64, 9, 0, 43, 49, 50, 49, 22], ["-", 64, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 8, 57, 64, 9, 0, 43, 0, 21], ["+", 8, 57, 64, 9, 0, 43, 49, 50, 0, 32], ["-", 64, 9, 0, 7, 8, 1, 0, 27, 28, 22], ["+", 64, 9, 0, 7, 8, 1, 0, 27, 28, 22], ["-", 64, 9, 0, 57, ... | 1 | 191 |
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define... | [["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 18], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 20], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16,... | 1 | 293 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 100002
int n;
vector<int> v;
struct st {
int first;
int second;
int id;
};
bool same(st a, st b) {
bool f1 = (a.first & 1) ^ (a.second & 1) ^ (a.id & 1);
bool f2 = (b.second & 1) ^ (b.first & 1) ^ (b.id & 1);
return f1 == f2;
}
int main() {
cin >... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100002
int n;
vector<int> v;
struct st {
int first;
int second;
int id;
};
bool same(st a, st b) {
bool f1 = (a.first & 1) ^ (a.second & 1) ^ (a.id & 1);
bool f2 = (b.second & 1) ^ (b.first & 1) ^ (b.id & 1);
return f1 == f2;
}
int main() {
cin >... | [["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 68], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 75, 76, 0, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 9, 0, 57, 15, 339, 5... | 1 | 316 |
// Copyright 2017 wu_qing
#include <algorithm>
#include <cstdio>
const int N = 1e5 + 10;
int n, b[N], h[N], l[N], tar = 1, end;
bool cmp(int a, int b) { return a > b; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", b + i);
std::sort(b + 1, b + n + 1, cmp);
b[0] = b[1];
for (int i ... | // Copyright 2017 wu_qing
#include <algorithm>
#include <cstdio>
const int N = 1e5 + 10;
int n, b[N], h[N], l[N], tar = 1, end;
bool cmp(int a, int b) { return a > b; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", b + i);
std::sort(b + 1, b + n + 1, cmp);
b[0] = b[1];
for (int i ... | [["+", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 70], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 73], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+",... | 1 | 256 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.