Submission #1595303


Source Code Expand

#include <stdio.h>
#define int long long
#define p (int)(1e9 + 7)

int MOD(int a){
	if(a >= 0){
		return a % p;
	}
	else{
		return p + a % p;
	}
}

int power(int a, int n){
	if(n == 0){
		return 1;
	}
	else if(n % 2 == 0){
		return power(MOD(a * a), n / 2);
	}
	else{
		return MOD(a * power(a, n - 1));
	}
}

int inverse(int a){
	return power(a, p - 2);
}

int comb(int n, int k){
	int numerator, denominator;
	for(numerator = 1, denominator = 1; k > 0; n--, k--){
		numerator = MOD(numerator * n);
		denominator = MOD(denominator * k);
	}
	return MOD(numerator * inverse(denominator));
}

signed main(){
	int N, K;
	scanf("%lld%lld", &N, &K);
	if(N > K){
		printf("%lld\n", comb(N + K - 1, K));
	}
	else{
		printf("%lld\n", comb(N, K % N));
	}
	return 0;
}

Submission Info

Submission Time
Task B - 高橋幼稚園
User abc050
Language C (GCC 5.4.1)
Score 100
Code Size 805 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:41:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld", &N, &K);
  ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 80 / 80 20 / 20
Status
AC × 3
AC × 21
AC × 33
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_sample_01.txt, subtask0_sample_02.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 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.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_01.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, subtask2_11.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 1 ms 128 KB
subtask0_sample_02.txt AC 0 ms 128 KB
subtask0_sample_03.txt AC 0 ms 128 KB
subtask1_01.txt AC 0 ms 128 KB
subtask1_02.txt AC 0 ms 128 KB
subtask1_03.txt AC 0 ms 128 KB
subtask1_04.txt AC 0 ms 128 KB
subtask1_05.txt AC 0 ms 128 KB
subtask1_06.txt AC 0 ms 128 KB
subtask1_07.txt AC 0 ms 128 KB
subtask1_08.txt AC 0 ms 128 KB
subtask1_09.txt AC 0 ms 128 KB
subtask1_10.txt AC 0 ms 128 KB
subtask1_11.txt AC 0 ms 128 KB
subtask1_12.txt AC 0 ms 128 KB
subtask1_13.txt AC 0 ms 128 KB
subtask1_14.txt AC 0 ms 128 KB
subtask1_15.txt AC 0 ms 128 KB
subtask1_16.txt AC 0 ms 128 KB
subtask1_17.txt AC 0 ms 128 KB
subtask1_18.txt AC 0 ms 128 KB
subtask1_19.txt AC 0 ms 128 KB
subtask2_01.txt AC 0 ms 128 KB
subtask2_02.txt AC 0 ms 128 KB
subtask2_03.txt AC 0 ms 128 KB
subtask2_04.txt AC 0 ms 128 KB
subtask2_05.txt AC 0 ms 128 KB
subtask2_06.txt AC 0 ms 128 KB
subtask2_07.txt AC 0 ms 128 KB
subtask2_08.txt AC 0 ms 128 KB
subtask2_09.txt AC 0 ms 128 KB
subtask2_10.txt AC 0 ms 128 KB
subtask2_11.txt AC 0 ms 128 KB