Input: given n and m
Task : For given n and m we have to calculate (n+m-2)C(n-1) mod 1000000007 where c is binomial coefficient
Constraints : 1 <= T <= 10^3
1 ≤ m,n ≤ 10^6
For the given test case(Which I is used in ideone)
1) Both are passing in ideone
2) My solution is failing on hackerrank(Segmentation fault) other one is passing on hackerrank
Can anyone tell me why my solution is not getting accepted on hackerrank ?
Hmm, the problem seens to be your fmod function, cause when n = 1 or m = 1 she wont stop and will get stack overflow.
But I am doing there if(n==0) return 1;
You are doing if(n == 1) return 1;