Submission #2857262


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int a[100010]={0},b[1000010]={0};
void dachengxiao(int a[],int x){
	for(int i=1;i<=a[0];i++){
		a[i]*=x;
		
	}
	for(int i=1;i<=a[0];i++){
		a[i+1]+=a[i]/10;
		a[i]%=10;
	}
	while(a[a[0]+1]){
		a[0]++;
		a[a[0]+1]+=a[a[0]]/10;
		a[a[0]]%=10;
	}
}
void jianfa(int a[],int b[]){
	for(int i=1;i<=a[0];i++){
		a[i]-=b[i];
	}
	for(int i=1;i<=a[0];i++){
		if(a[i]<0){
			a[i+1]--;
			a[i]+=10;
		}
	}
	while(a[0]>1&&a[a[0]]==0){
		a[0]--;
	}
}
void shuchu(int a[]){
	for(int i=a[0];i>=1;i--){
		cout<<a[i];
	}
	cout<<endl;
}
int main(){
	int n;
	cin>>n;
	
	a[0]=a[1]=b[0]=b[1]=1;
	for(int i=1;i<=n;i++){
		dachengxiao(a,10);
		dachengxiao(b,9);
	}
	jianfa(a,b);
	
	shuchu(a);
    return 0;
}

Submission Info

Submission Time
Task C - 有向グラフ
User luogu_bot4
Language C++ (GCC 5.4.1)
Score 0
Code Size 780 Byte
Status WA
Exec Time 2 ms
Memory 2304 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 4
WA × 32
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_manual01.txt, subtask1_manual02.txt, subtask1_manual03.txt, subtask1_manual04.txt, subtask1_manual05.txt, subtask1_manual06.txt, subtask1_manual07.txt, subtask1_manual08.txt, subtask1_random01.txt, subtask1_random02.txt, subtask1_random03.txt, subtask1_random04.txt, subtask1_random05.txt, subtask1_special01.txt, subtask1_special02.txt, subtask1_special03.txt, subtask1_special04.txt, subtask1_special05.txt, subtask1_special06.txt, subtask1_special07.txt, subtask1_special08.txt, subtask1_special09.txt, subtask1_special10.txt, subtask1_special11.txt, subtask1_special12.txt, subtask1_special13.txt, subtask1_special14.txt, subtask1_special15.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt WA 2 ms 2304 KB
subtask0_sample_02.txt WA 2 ms 2304 KB
subtask0_sample_03.txt WA 2 ms 2304 KB
subtask0_sample_04.txt WA 2 ms 2304 KB
subtask1_manual01.txt WA 2 ms 2304 KB
subtask1_manual02.txt WA 2 ms 2304 KB
subtask1_manual03.txt WA 2 ms 2304 KB
subtask1_manual04.txt WA 2 ms 2304 KB
subtask1_manual05.txt WA 2 ms 2304 KB
subtask1_manual06.txt WA 2 ms 2304 KB
subtask1_manual07.txt WA 1 ms 2304 KB
subtask1_manual08.txt WA 2 ms 2304 KB
subtask1_random01.txt WA 2 ms 2304 KB
subtask1_random02.txt WA 2 ms 2304 KB
subtask1_random03.txt WA 2 ms 2304 KB
subtask1_random04.txt WA 2 ms 2304 KB
subtask1_random05.txt WA 2 ms 2304 KB
subtask1_special01.txt WA 2 ms 2304 KB
subtask1_special02.txt WA 2 ms 2304 KB
subtask1_special03.txt WA 2 ms 2304 KB
subtask1_special04.txt WA 2 ms 2304 KB
subtask1_special05.txt WA 2 ms 2304 KB
subtask1_special06.txt WA 2 ms 2304 KB
subtask1_special07.txt WA 2 ms 2304 KB
subtask1_special08.txt WA 2 ms 2304 KB
subtask1_special09.txt WA 2 ms 2304 KB
subtask1_special10.txt WA 2 ms 2304 KB
subtask1_special11.txt WA 2 ms 2304 KB
subtask1_special12.txt WA 2 ms 2304 KB
subtask1_special13.txt WA 2 ms 2304 KB
subtask1_special14.txt WA 2 ms 2304 KB
subtask1_special15.txt WA 2 ms 2304 KB