In how many ways can you choose k elements out of n elements, not taking order into account?

Write a program to compute this number.
Input Specification
The input file will contain one or more test cases.

Each test case consists of one line containing two integers n () and k ( ).

Input is terminated by two zeroes for n and k.
Output Specification
For each test case, print one line containing the required number. This number will always fit into an integer, i.e. it will be less than 231.


Warning: Don't underestimate the problem. The result will fit into an integer - but if all intermediate results arising during the computation will also fit into an integer depends on your algorithm. The test cases will go to the limit.我的代码如下：#include<iostream>
using namespace std;
long F(int);
int main()
{
    int n,k;
    while(1)
    {
        cin>>n>>k;
        if(n==0&&k==0) break;
        else
            cout<<F(n)/(F(k)*F(n-k))<<endl;
    }
    return 0;
}
 long F(int m)
{
    int sum=1,i;
    for(i=1;i<=m;i++)
        sum=sum*i;
    return(sum);
}
求高手解答：当我输入49和6之后运行发生崩溃，可能是内存越界了，没有考虑到大数据，该怎么改？？？急啊~~
 

这个是计算组合数的 程序吧。。

C(n,k)=C(n-1,k)+C(n-1,k-1)

大数运算

一个int 4个字节，能保存的最大整数 4 294 967 296，49！=6*10^62,早就越界了

是的啊，但是改怎么来处理数据越界的问题呢？

你指的是用递归来处理吗？但是算出的结果应该是一样的，还是会溢出啊？

所以我才问该怎么处理嘛~~~

大数运算，即用数组来存储数的每一位，然后用循环模拟加减乘法和进位

挺复杂的说，，，，，能给个类似的代码例子吗？谢谢啦！