#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p);
string to_string(const string &s)
{
return '"' + s + '"';
}
string to_string(const char *s)
{
return to_string((string)s);
}
string to_string(bool b)
{
return (b ? "true" : "false");
}
// string to_string(vector<bool> v)
// {
// bool first = true;
// string res = "{";
// for (ll i = 0; i < static_cast<ll>(v.size()); i++)
// {
// if (!first)
// {
// res += ", ";
// }
// first = false;
// res += to_string(v[i]);
// }
// res += "}";
// return res;
// }
template <size_t N> string to_string(bitset<N> v)
{
string res = "";
for (size_t i = 0; i < N; i++)
{
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A> string to_string(A v)
{
bool first = true;
string res = "{";
for (const auto &x : v)
{
if (!first)
{
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B> string to_string(pair<A, B> p)
{
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p)
{
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p)
{
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " +
to_string(get<3>(p)) + ")";
}
void dbg_out()
{
cout << endl;
}
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T)
{
cout << " " << to_string(H);
dbg_out(T...);
}
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]:", dbg_out(__VA_ARGS__)
#define edl() cout << endl;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define pf push_front
#define F first
#define S second
#define max_self(x, y) x = max(x, y)
#define min_self(x, y) x = min(x, y)
typedef long long ll;
ll const INF = 2147483647, R_INF = 9223372036854775807, MOD = 1e9 + 7;
// const ll mxN =
int main()
{
FAST_IO;
ll n;
cin >> n;
vector<ll> input(n);
rep(i, 0, n) cin >> input[i];
ll val = input.front() + !input.front(), ctr = 0;
vector<ll> po(12);
po[0] = 1;
rep(i, 1, 12) po[i] = po[i - 1] * 10;
if (input.front() == 9 && n > 1 && n <= 11)
return cout << 89, 0;
while (po[ctr] < n)
val *= 10, ctr++;
if (input.front() == 9)
{
int sz = to_string(val).size();
rep(i, 1, sz) cout << 8;
cout << 9;
}
else if (!input.front())
{
ll val2 = val, val3 = val;
ctr = 0;
while (1 <= val3)
{
if (val3 % 10 == 0)
val2 += po[ctr];
val3 /= 10;
ctr++;
}
val2 -= val;
cout << val * (val2 >= n ? 1 : 10);
}
else
cout << val;
}
/*
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
