# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38581 | oTTo_22 | Sequence (BOI14_sequence) | C++14 | 0 ms | 2364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define se second
#define fi first
using namespace std;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
//for (int i=1; i<=11111; i++)
// cout << 9 << " ";
//return 0;
bool ind=0;
int a[n+1];
cin >> a[1];
for (int i=2; i<=n; i++) {
cin >> a[i];
if (a[i]!=a[i-1])
ind=1;
}
if (!ind) {
int m=0;
int N=n;
while (n>0) {
n/=10;
m++;
}
string ans9;
if (a[1]==9) {
for (int i=1; i<=m; i++)
ans9+='8';
int kk=N/10;
if (N%10<=1)
ans9.erase(ans9.size()-1,1);
ans9+='9';
cout << ans9;
return 0;
}
if (pow(10,m-1)==N)
m--;
string s;
int k=a[1]-1;
for (int i=1; i<=m-1; i++)
s+='0';
if (a[1]==0)
cout << 1 << a[1] << s << 0;
else
cout << a[1] << s << 0;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |