Kertoma

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll Bor=1000000000;
const ll N=1010;
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 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED