fork download
copy 
  1. #include <bits/stdc++.h>
  2. #define mod 1000000007ll
  3. using namespace std;
  4. int dp[1001][1001];
  5. // Complete the solve function below.
  6. int solve(int k,int n) {
  7.  
  8.       if(k==0)return 1;
  9.       if(n==0) return 0; 
  10.    // if(dp[k][n]!=-1)return dp[k][n];
  11.           long ans=0;
  12.        for(int i=0;i<=1000;i++)
  13.        {
  14.           ans=(ans+solve(k-i,n-1)+mod)%mod;
  15.        }
  16.    //dp[k][n]=ans;
  17.      return ans;
  18. }
  19.  
  20. int main()
  21. {
  22.      int t;
  23.      cin>>t;
  24.       memset(dp,-1,sizeof(dp));
  25.       dp[0][0]=1;
  26.     cout<< solve(1000,1000);
  27.        while(t--)
  28.        {
  29.            int n,k;cin>>n>>k;
  30.            cout<<dp[k][n]<<"\n";
  31.        }
  32.  
  33.     return 0;
  34. }
  35.  
Time limit exceeded #stdin #stdout 5s 7128KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/RdKF5J
language:
C++ (gcc 8.3)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!