Submission #384448

Source Code Expand

#include <stdio.h>

int a[2001][1001];

unsigned int combination(int n, int r){
	unsigned int tmp;
 
	if(n-r<r)
		r=n-r;
 
	if(a[n][r]!=0)
		return a[n][r];
	else if(n==r)
		return(1);
	else if(r==0)
		return(1);
	else if(r==1)
		return(n);
	else{
		tmp=(combination(n-1, r-1) + combination(n-1, r))%1000000007; 
		a[n][r]=tmp;
		return tmp;
	}
}



int main(){
	int n,k;

	scanf("%d",&n);
	scanf("%d",&k);

	if(n>1000 || k>1000){
		return 0;
	}

	printf("%u\n",combination(n+k-1,k));
	
	return 0;
}

Submission Info

Submission Time
Task D - 多重ループ
User jonson
Language C (GCC 4.9.2)
Score 99
Code Size 539 Byte
Status WA
Exec Time 55 ms
Memory 8612 KiB

Compile Error

./Main.c: In function ‘main’:
./Main.c:31:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ^
./Main.c:32:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&k);
  ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 99 / 99 0 / 1
Status
AC × 4
WA × 1
AC × 23
AC × 23
WA × 10
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt
Subtask1 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 21 ms 796 KiB
subtask0_sample_02.txt AC 21 ms 796 KiB
subtask0_sample_03.txt AC 25 ms 796 KiB
subtask0_sample_04.txt AC 31 ms 3360 KiB
subtask0_sample_05.txt WA 23 ms 708 KiB
subtask1_01.txt AC 26 ms 1560 KiB
subtask1_02.txt AC 48 ms 6432 KiB
subtask1_03.txt AC 35 ms 3616 KiB
subtask1_04.txt AC 44 ms 5276 KiB
subtask1_05.txt AC 36 ms 4648 KiB
subtask1_06.txt AC 35 ms 3748 KiB
subtask1_07.txt AC 39 ms 4776 KiB
subtask1_08.txt AC 37 ms 4396 KiB
subtask1_09.txt AC 43 ms 5536 KiB
subtask1_10.txt AC 38 ms 4520 KiB
subtask1_11.txt AC 39 ms 4636 KiB
subtask1_12.txt AC 36 ms 4000 KiB
subtask1_13.txt AC 38 ms 4376 KiB
subtask1_14.txt AC 46 ms 5596 KiB
subtask1_15.txt AC 35 ms 4392 KiB
subtask1_16.txt AC 21 ms 788 KiB
subtask1_17.txt AC 47 ms 6568 KiB
subtask1_18.txt AC 21 ms 796 KiB
subtask1_19.txt AC 55 ms 8612 KiB
subtask2_02.txt WA 21 ms 796 KiB
subtask2_03.txt WA 22 ms 796 KiB
subtask2_04.txt WA 21 ms 712 KiB
subtask2_05.txt WA 21 ms 796 KiB
subtask2_06.txt WA 21 ms 796 KiB
subtask2_07.txt WA 22 ms 800 KiB
subtask2_08.txt WA 25 ms 696 KiB
subtask2_09.txt WA 21 ms 796 KiB
subtask2_10.txt WA 25 ms 700 KiB