fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. const int mx = 1e3 + 10;
  4. const int mod = 1e8 + 7;
  5.  
  6. int dp[mx][151];
  7. int sum[mx][151];
  8. int main() {
  9. int t, c = 0;
  10. cin >> t;
  11. while(t--){
  12. int n, k , s ;
  13. scanf("%d %d %d", &n, &k, &s);
  14. for(int i = 0 ; i <= s; i++)
  15. dp[0][i] = 0, sum[0][i] = 0;
  16. for(int i = 1; i <= n; i++){
  17. for(int j = 0 ; j <= s; j++ ){
  18. if(i - 1 >= 0 && j-1 >= 0 && j-k-1 >= 0)
  19. dp[i][j] = sum[i-1][j-1] - sum[i-1][j-k-1], sum[i][j] = sum[i][j-1] + dp[i][j];
  20. else
  21. dp[i][j] = sum[i][j] = 0;
  22. }
  23. }
  24. printf("Case %d: %d\n", ++c, dp[n][s]);
  25. }
  26. // your code goes here
  27. return 0;
  28. }
Success #stdin #stdout 0s 17248KB
stdin
2
6 6 6 
5 5 5
stdout
Case 1: 0
Case 2: 0