# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
398959 | faresbasbs | Sequence (BOI14_sequence) | C++14 | 1088 ms | 10632 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>
using namespace std;
long long mini = 1000000000000000000;
bool ok[1000001][10],num[10];
int n,arr[100001];
int func(int a , int b){
while(a){
if(a%10 == b){
return true;
}
a /= 10;
}
return false;
}
bool ok2(int val){
for(int i = 0 ; i < n ; i += 1){
if(!func(val+i,arr[i])){
return 0;
}
}
return 1;
}
int main(){
for(int i = 1 ; i <= 1000000 ; i += 1){
int j = i;
while(j){
ok[i][j%10] = 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... |