POJ 1942 Paths on a Grid G++ double求组合数背

xiaoxiao2021-02-28  100

#include <iostream> #include <cstdio> using namespace std; //英语 看博友分析 抄博友程序 double求组合数 背 int main() { long long n,m; while(1) { cin>>n>>m; if(n==0 && m==0) { break; } long long x; if(n>m) { x=m; }else { x=n; } long long y=m+n; double jg=1.0; while(x) { jg=(jg*y)/x; x--; y--; } cout<<(long long)(jg+0.5)<<endl; } return 0; }

 

转载请注明原文地址: https://www.6miu.com/read-61783.html

最新回复(0)