uva 10943 - How do you add?

找规律。

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<list>
using namespace std;

long long nk[110][110];
int main()
{
    int n,k;
    for(int i = 1; i <= 100; i++)
        nk[1][i] = i;
    for(int i = 1; i <= 100; i++)
        nk[i][1] = 1;
    for(int i = 2; i <= 100; i++)
        for(int j = 2; j <= 100; j++)
            nk[i][j] = (nk[i-1][j] + nk[i][j-1])%1000000;
    while(cin >> n >> k, k+n)
        cout << nk[n][k] << endl;
    return 0;
}