# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12058 | woqja125 | Sequence (BOI14_sequence) | C++98 | 72 ms | 1600 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<stdio.h>
int d[100001];
long long getAns(int d[], int n, int dep)
{
int i, start;
int *arg;
long long ans = 10234567890000000ll;
if(n==1 || dep > 6)
{
for(i=2; i<=n; i++)d[1] |= d[i];
if(d[1] == 1) return 10;
if(d[1] %2 == 1)
{
for(i=1; i<=9; i++) if((d[1] >> i)%2 == 1)
{
ans = i*10;
break;
}
for(i++; i<=9; i++) if((d[1] >> i)%2 == 1) ans = ans*10 + i;
return ans;
}
else
{
ans = 0;
for(i=1; i<=9; i++) if((d[1] >> i)%2 == 1) ans = ans*10 + i;
return ans;
}
}
arg = new int[n/10+50];
int fd = 0, N = 1;
# | 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... |