| Task: | Kertoma |
| Sender: | maweiyin24562 |
| Submission time: | 2022-11-09 17:22:46 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | RUNTIME ERROR | 0 |
| #2 | RUNTIME ERROR | 0 |
| #3 | RUNTIME ERROR | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | RUNTIME ERROR | 0.01 s | 1, 2, 3 | details |
| #2 | RUNTIME ERROR | 0.01 s | 1, 2, 3 | details |
| #3 | RUNTIME ERROR | 0.01 s | 1, 2, 3 | details |
| #4 | RUNTIME ERROR | 0.01 s | 1, 2, 3 | details |
| #5 | RUNTIME ERROR | 0.01 s | 1, 2, 3 | details |
| #6 | TIME LIMIT EXCEEDED | -- | 1, 2, 3 | details |
| #7 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #10 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #11 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #12 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #13 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #14 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #16 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include<bits/stdc++.h>
using namespace std;
#define ll unsigned long long
const ll Bor=100000000ull;
const ll N=100010;
struct num{
ll d[N];
ll cnt;
void upgrade(){
d[0]++;
ll i=0;
while(d[i]>=Bor){
d[i]=0;
d[i+1]++;
i++;
cnt=max(cnt,i+1);
}
}
void Init(ll i){
memset(d,0,sizeof(d));
cnt=0;
while(i){
d[cnt]=i%Bor;
cnt++;
i/=Bor;
}
}
void print(){
for(ll i=cnt-1;i>=0;i--){
cout<<d[i];
}
cout<<endl;
}
};
num times(num x,num y){
num nd;
nd.cnt=0;
memset(nd.d,0,sizeof(nd.d));
for(ll i=0;i<x.cnt;i++){
for(ll j=0;j<y.cnt;j++){
nd.d[i+j]+=x.d[i]*y.d[j];
}
}
ll len=x.cnt+y.cnt-1;
for(ll i=0;i<len;i++){
if(nd.d[i]>=Bor){
nd.d[i+1]+=nd.d[i]/Bor;
nd.d[i]%=Bor;
}
}
if(nd.d[len]!=0){
nd.cnt=len+1;
}
else{
nd.cnt=len;
}
return nd;
}
struct lst{
ll d[10];
};
lst aim;
bool cmp(num a,lst b){
ll alst[10];
memset(alst,0,sizeof(alst));
for(ll i=0;i<a.cnt;i++){
ll t=a.d[i];
while(t){
ll now=t%10;
t/=10;
alst[now]++;
}
}
for(ll i=0;i<10;i++){
if(alst[i]!=b.d[i]){
return false;
}
}
return true;
}
num n,tmr;
int main(){
for(ll i=0;i<10;i++){
cin>>aim.d[i];
}
n.Init(1);
n.cnt=1;
tmr.cnt=1;
while(!cmp(n,aim)){
tmr.upgrade();
n=times(n,tmr);
}
tmr.print();
return 0;
}
Test details
Test 1
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 0 0 1 0 0 0 0 0 0 0 |
| correct output |
|---|
| 2 |
| user output |
|---|
| 202345624777712023456247777104... Truncated |
Test 2
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 0 0 0 0 0 0 1 0 0 0 |
| correct output |
|---|
| 3 |
| user output |
|---|
| 302345624777712023456247777104... Truncated |
Test 3
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 0 0 1 0 1 0 0 0 0 0 |
| correct output |
|---|
| 4 |
| user output |
|---|
| 402345624777712023456247777104... Truncated |
Test 4
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 2 0 1 1 0 0 1 0 2 0 |
| correct output |
|---|
| 10 |
| user output |
|---|
| 100234562477771202345624777710... Truncated |
Test 5
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 9 3 1 1 2 2 3 1 6 1 |
| correct output |
|---|
| 27 |
| user output |
|---|
| 270234562477771202345624777710... Truncated |
Test 6
Group: 1, 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 4 3 4 3 2 2 4 3 7 |
| correct output |
|---|
| 36 |
| user output |
|---|
| (empty) |
Test 7
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 71 53 36 30 25 29 42 24 34 29 |
| correct output |
|---|
| 199 |
| user output |
|---|
| (empty) |
Test 8
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 71 33 46 38 27 45 36 21 35 35 |
| correct output |
|---|
| 205 |
| user output |
|---|
| (empty) |
Test 9
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 93 38 35 26 43 54 38 25 41 34 |
| correct output |
|---|
| 222 |
| user output |
|---|
| (empty) |
Test 10
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 33 33 45 36 43 38 54 56 36 |
| correct output |
|---|
| 242 |
| user output |
|---|
| (empty) |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 3419 1797 1845 1849 1879 1791 ... |
| correct output |
|---|
| 5959 |
| user output |
|---|
| (empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 4776 2695 2709 2781 2616 2753 ... |
| correct output |
|---|
| 8391 |
| user output |
|---|
| (empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20097 12282 12229 12214 12406 ... |
| correct output |
|---|
| 32001 |
| user output |
|---|
| (empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 47934 29918 29878 29713 29984 ... |
| correct output |
|---|
| 71718 |
| user output |
|---|
| (empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 84691 54156 54277 54533 54296 ... |
| correct output |
|---|
| 123123 |
| user output |
|---|
| (empty) |
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 99098 63339 63878 64182 63904 ... |
| correct output |
|---|
| 142663 |
| user output |
|---|
| (empty) |