CSES - Datatähti 2023 alku - Results
Submission details
Task:Kertoma
Sender:maweiyin24562
Submission time:2022-11-09 22:47:22 +0200
Language:C++17
Status:READY
Result:46
Feedback
groupverdictscore
#1ACCEPTED22
#2ACCEPTED24
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 2, 3details
#4ACCEPTED0.00 s1, 2, 3details
#5ACCEPTED0.00 s1, 2, 3details
#6ACCEPTED0.00 s1, 2, 3details
#7ACCEPTED0.00 s2, 3details
#8ACCEPTED0.00 s2, 3details
#9ACCEPTED0.00 s2, 3details
#10ACCEPTED0.00 s2, 3details
#110.01 s3details
#120.01 s3details
#13ACCEPTED0.01 s3details
#14ACCEPTED0.01 s3details
#15ACCEPTED0.02 s3details
#16ACCEPTED0.02 s3details

Code

#include<bits/stdc++.h>
using namespace std;
struct num{
	int d[1010];
	int cnt; 
	void upgrade(){
		d[0]++;
		int i=0;
		while(d[i]>=10){
			d[i]=0;
			d[i+1]++;
			i++;
			cnt=max(cnt,i+1);
		}
	}
	void Init(int i){
		memset(d,0,sizeof(d));
		cnt=0;
		while(i){
			d[cnt]=i%10;
			cnt++;
			i/=10;
		}
	}
	void print(){
		for(int 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(int i=0;i<x.cnt;i++){
		for(int j=0;j<y.cnt;j++){
			nd.d[i+j]+=x.d[i]*y.d[j];
		}
	}
	int len=x.cnt+y.cnt-1;
	for(int i=0;i<len;i++){
		if(nd.d[i]>=10){
			nd.d[i+1]+=nd.d[i]/10;
			nd.d[i]%=10; 
		}
	}
	if(nd.d[len]!=0){
		nd.cnt=len+1;
	}
	else{
		nd.cnt=len;
	}
	return nd;
}
struct lst{
	int d[10];
};
lst aim;
bool cmp(num a,lst b){
	int alst[10];
	memset(alst,0,sizeof(alst));
	for(int i=0;i<a.cnt;i++){
		int now=a.d[i];
		alst[now]++;
	}
	for(int i=0;i<10;i++){
		if(alst[i]!=b.d[i]){
			return false;
		}
	}
	return true;
}
num n,tmr;
typedef long long ll;
typedef long double ld;
ld Pi=3.14159265;
ld E=2.71828182;
const ll Border=205023;
ld LgStiring(ll n){
	ld N=ld(n);
	return ll(0.5*(log10(2*Pi)+log10(N))+N*log10(N/E))+1;
}
ll sum;
//6 3 2 1 2 1 1 0 2 0
int main(){
	for(int i=0;i<10;i++){
		cin>>aim.d[i];
		sum+=aim.d[i];
	}
	if(sum>=100010)goto G;
	n.Init(1);
	n.cnt=1;
	tmr.cnt=1;
	while(!cmp(n,aim)){
		tmr.upgrade();
		n=times(n,tmr);
	}
	tmr.print();
	return 0;
	G:
	ll l=1,r=Border,mid;
	for(ll i=l;i<=r;i++){
		if(LgStiring(i)==sum){
			mid=i;
			break;
		}
	}
	cout<<mid<<endl;
	return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
0 0 1 0 0 0 0 0 0 0

correct output
2

user output
2

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
0 0 0 0 0 0 1 0 0 0

correct output
3

user output
3

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
0 0 1 0 1 0 0 0 0 0

correct output
4

user output
4

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
2 0 1 1 0 0 1 0 2 0

correct output
10

user output
10

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
9 3 1 1 2 2 3 1 6 1

correct output
27

user output
27

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
10 4 3 4 3 2 2 4 3 7

correct output
36

user output
36

Test 7

Group: 2, 3

Verdict: ACCEPTED

input
71 53 36 30 25 29 42 24 34 29

correct output
199

user output
199

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
71 33 46 38 27 45 36 21 35 35

correct output
205

user output
205

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
93 38 35 26 43 54 38 25 41 34

correct output
222

user output
222

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
100 33 33 45 36 43 38 54 56 36

correct output
242

user output
242

Test 11

Group: 3

Verdict:

input
3419 1797 1845 1849 1879 1791 ...

correct output
5959

user output
(empty)

Test 12

Group: 3

Verdict:

input
4776 2695 2709 2781 2616 2753 ...

correct output
8391

user output
(empty)

Test 13

Group: 3

Verdict: ACCEPTED

input
20097 12282 12229 12214 12406 ...

correct output
32001

user output
32001

Test 14

Group: 3

Verdict: ACCEPTED

input
47934 29918 29878 29713 29984 ...

correct output
71718

user output
71718

Test 15

Group: 3

Verdict: ACCEPTED

input
84691 54156 54277 54533 54296 ...

correct output
123123

user output
123123

Test 16

Group: 3

Verdict: ACCEPTED

input
99098 63339 63878 64182 63904 ...

correct output
142663

user output
142663