Advertisement
Guest User

Untitled

a guest
Nov 21st, 2019
94
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.60 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. #define MOD 666013
  4.  
  5. using namespace std;
  6.  
  7. int dp[1003][9003],n,s;
  8.  
  9.  
  10. int main()
  11. {
  12. int i, j, x, suma, k;
  13. cin >> n >> s;
  14. if(n == 1)
  15. {
  16. cout << 1;
  17. return 0;
  18. }
  19.  
  20. for(j = 1; j <= 9; j++)
  21. dp[1][j] = 1;
  22. for(i = 2; i <= n; i++)
  23. {
  24. x = min(s, 9*i);
  25. for(j = 1; j <= x; j++)
  26. {
  27. suma = 0;
  28. for(k = 0; k <= 9 && k < j ; k++)
  29. suma += dp[i - 1][j - k];
  30. dp[i][j] = suma % MOD;
  31. }
  32. }
  33. cout << dp[n][s];
  34. return 0;
  35. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement