# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
118688 | imyujin | 수열 (BOI14_sequence) | C++14 | 202 ms | 1784 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>
#include<vector>
using namespace std;
#define MAXK 100005
const long long LINF=1ll<<58;
int B[MAXK];
long long f(vector<int> v){
vector<int> vv;
long long ans=LINF;
bool b=true;
for(int i=0; i<v.size(); i++) if(v[i]!=0) b=false;
if(b) return 0;
if(v.size()==1){
ans=0;
int j=1;
while((v[0]&(1<<j))==0&&j<10) j++;
if(j==10) return (v[0]&1)==0?0ll:10ll;
else ans=j;
if((v[0]&1)!=0) ans*=10;
for(j++; j<10; j++) if((v[0]&(1<<j))!=0) ans=ans*10+j;
return ans;
}
for(int i=0; i<10; i++){
bool a=true;
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... |