Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #define MOD 666013
- using namespace std;
- int dp[1003][9003],n,s;
- int main()
- {
- int i, j, x, suma, k;
- cin >> n >> s;
- if(n == 1)
- {
- cout << 1;
- return 0;
- }
- for(j = 1; j <= 9; j++)
- dp[1][j] = 1;
- for(i = 2; i <= n; i++)
- {
- x = min(s, 9*i);
- for(j = 1; j <= x; j++)
- {
- suma = 0;
- for(k = 0; k <= 9 && k < j ; k++)
- suma += dp[i - 1][j - k];
- dp[i][j] = suma % MOD;
- }
- }
- cout << dp[n][s];
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement