Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <algorithm>
- #include <cstring>
- #include <string>
- #include <cctype>
- #include <stack>
- #include <queue>
- #include <list>
- #include <vector>
- #include <map>
- #include <set>
- #include <sstream>
- #include <stdlib.h>
- #include <cmath>
- #define LL unsigned long long
- using namespace std;
- const int mod=1000000;
- int dp[110][110];
- void ini(){
- dp[0][0]=1;
- for(int k=1;k<=100;k++){
- for(int sum=0;sum<=100;sum++){
- for(int i=0;i<=sum;i++){
- dp[sum][k]+=(dp[i][k-1]);
- }
- dp[sum][k]=dp[sum][k]%mod;
- }
- }
- }
- int main(){
- ini();
- int n,k;
- while(cin>>n>>k && (n||k)){
- cout<<dp[n][k]<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement