UVA 10219 - Find the ways ! UVA • Sep 1, 2020 Problem PDFSolution:#include #include int main() { long long n, r,i; long double res; while(scanf("%lld %lld",&n,&r)==2) { res = 0; for(i=n;i>n-r;i--) res+=log10(i); for(i=1;i<=r;i++) res-=log10(i); printf("%d\n",(int)floor(res)+1); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10219/10219.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 2 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 2 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 2 years ago • 3 min read