fork(1) download
copy 
  1. #include <iostream>
  2. using namespace std;
  3. #define mod 1000000007
  4. long long combination(long long i);
  5. int main() {
  6. 	int n,count;
  7. 	long long i=1,ans=1;
  8. 	cin>>n;
  9. 	if(n<13)
  10. 	cout<<"0";
  11. 	else
  12. 	{
  13. 	count=n-13;
  14. 	for(count;count>=2;count=count-2)
  15. 	{
  16. 		ans=(ans+combination(i))%mod;
  17. 		i++;
  18. 	}
  19. 	cout<<ans;
  20. 	}
  21. 	return 0;
  22. }
  23.  
  24.  
  25. long long combination(long long i)
  26. {
  27.  
  28. 	long long num=1;
  29. 	i=i+5;
  30. 	int j;
  31.  
  32. 	for(j=0;j<5;j++)
  33. 	{
  34. 	num=(num*i)%mod;
  35. 	i--;
  36. 	}
  37. //	cout<<num<<endl;
  38. 	return (num/120)%mod;	
  39. }
Success #stdin #stdout 0s 2736KB
comments (?)
stdin
copy 
20
stdout
copy 
84
https://ideone.com/kJgwsv
language:
C++ 4.3.2 (gcc-4.3.2)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!