UVA 369 - Combinations
Problem PDF
Solution:
#include
long long nCr(long long n,long long m)
{
long long res=1,i;
if(n-mhttps://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/369/369.cpp#include
long long nCr(long long n,long long m)
{
long long res=1,i;
if(n-mhttps://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/369/369.cpp
