Submission #644139


Source Code Expand

#include<stdio.h>

int main(void)
{
	long int num[10][100000]={};
	long int n;
	int i,j;
	
	//num[0][0]=0;
	//num[0][1]=0;
	//num[0][2]=1;
	
	scanf("%ld",&n);
	
	for(i=0;i<10;i++)
	{
		for(j=0;j<100000;j++)
		{
			num[i][j]=num[i][j-1]+num[i][j-2]+num[i][j-3];
		
			if(i==0 && j==0)
			{
				num[i][j]=0;
			}
		
			else if(i==0 && j==1)
			{
				num[i][j]=0;
			}
		
			else if(i==0 && j==2)
			{
				num[i][j]=1;
			}
			
			else if(i>0 && j==0)
			{
				num[i][j]=num[i-1][99997]+num[i-1][99998]+num[i-1][99999];
			}
			
			else if(i>0 && j==1)
			{
				num[i][j]=num[i-1][99998]+num[i-1][99999]+num[i][j-1];
			}
			
			else if(i>0 && j==2)
			{
				num[i][j]=num[i-1][99999]+num[i][j-1]+num[i][j-2];
			}
		}
	}
		
	if(n<=100000)
	{
		printf("%ld\n",num[0][n-1]%10007);
	}
	
	else if(n>100000 && n<=200000)
	{
		printf("%ld\n",num[1][n-1]%10007);
	}
	
	else if(n>200000 && n<=300000)
	{
		printf("%ld\n",num[2][n-1]%10007);
	}
	
	else if(n>300000 && n<=400000)
	{
		printf("%ld\n",num[3][n-1]%10007);
	}
	
	else if(n>400000 && n<=500000)
	{
		printf("%ld\n",num[4][n-1]%10007);
	}
	
	else if(n>500000 && n<=600000)
	{
		printf("%ld\n",num[5][n-1]%10007);
	}
	
	else if(n>600000 && n<=700000)
	{
		printf("%ld\n",num[6][n-1]%10007);
	}
	
	else if(n>700000 && n<=800000)
	{
		printf("%ld\n",num[7][n-1]%10007);
	}
	
	else if(n>800000 && n<=900000)
	{
		printf("%ld\n",num[8][n-1]%10007);
	}
	
	else if(n>900000 && n<=1000000)
	{
		printf("%ld\n",num[9][n-1]%10007);
	}
	
	return 0;
}

	

Submission Info

Submission Time
Task B - トリボナッチ数列
User unko114514
Language C++ (G++ 4.6.4)
Score 0
Code Size 1596 Byte
Status WA
Exec Time 315 ms
Memory 8812 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 9
WA × 19
RE × 5
Set Name Test Cases
All test_1.txt, test_1000000.txt, test_1002.txt, test_104.txt, test_107843.txt, test_10980.txt, test_1212.txt, test_1238.txt, test_13194.txt, test_14.txt, test_16.txt, test_2.txt, test_210782.txt, test_21694.txt, test_243.txt, test_24916.txt, test_278.txt, test_3.txt, test_31.txt, test_32.txt, test_42.txt, test_5555.txt, test_567914.txt, test_61868.txt, test_765671.txt, test_8195.txt, test_8353.txt, test_9.txt, test_9625.txt, test_97.txt, test_998.txt, test_999998.txt, test_999999.txt
Case Name Status Exec Time Memory
sample_01.txt AC 54 ms 8672 KB
sample_02.txt AC 51 ms 8632 KB
sample_03.txt WA 50 ms 8624 KB
test_1.txt AC 49 ms 8692 KB
test_1000000.txt RE 306 ms 8624 KB
test_1002.txt WA 49 ms 8688 KB
test_104.txt WA 50 ms 8672 KB
test_107843.txt WA 49 ms 8620 KB
test_10980.txt WA 47 ms 8692 KB
test_1212.txt WA 51 ms 8656 KB
test_1238.txt WA 55 ms 8800 KB
test_13194.txt WA 47 ms 8684 KB
test_14.txt AC 50 ms 8620 KB
test_16.txt AC 48 ms 8812 KB
test_2.txt AC 49 ms 8780 KB
test_210782.txt WA 49 ms 8636 KB
test_21694.txt WA 50 ms 8692 KB
test_243.txt WA 48 ms 8624 KB
test_24916.txt WA 48 ms 8628 KB
test_278.txt WA 50 ms 8628 KB
test_3.txt AC 46 ms 8688 KB
test_31.txt AC 47 ms 8620 KB
test_32.txt AC 49 ms 8808 KB
test_42.txt AC 51 ms 8620 KB
test_5555.txt WA 50 ms 8672 KB
test_567914.txt RE 307 ms 8688 KB
test_61868.txt WA 48 ms 8700 KB
test_765671.txt RE 307 ms 8628 KB
test_8195.txt WA 47 ms 8688 KB
test_8353.txt WA 48 ms 8632 KB
test_9.txt AC 49 ms 8644 KB
test_9625.txt WA 50 ms 8716 KB
test_97.txt WA 49 ms 8688 KB
test_998.txt WA 50 ms 8692 KB
test_999998.txt RE 314 ms 8628 KB
test_999999.txt RE 315 ms 8656 KB