1 solutions

  • -1
    @ 2025-3-29 11:34:28
    #include<bits/stdc++.h>
    using namespace std;
    const int N=2010,P=1e9+7;
    int c[N][N];
    int main()
    {
    	int n;
    	cin>>n;
    	for(int i=0;i<N;i++)
    	{
    		for(int j=1;j<=i;j++)
    		{
    			if(j==0) c[i][j]=1;
    			c[i][j]=(c[i-1][j-1],c[i-1][j])%P
    		}
    	}
    	while(n--)
    	{
    		int a,b;
    		cin>>a>>b;
    		cout<<c[a][b]<<endl;
    	}
        return 0;
    }
    
    
    • @ 2026-1-18 16:29:02
      #include<bits/stdc++.h>
      using namespace std;
      const int N=2010,P=1e9+7;
      int c[N][N];
      int main(){
      	int n;
      	cin>>n;
      	for(int i=0;i<N;i++){
      		for(int j=0;j<=i;j++){
      			if(j==0) c[i][j]=1;
      			else c[i][j]=(c[i-1][j-1]+c[i-1][j])%P;
      		}
      	}
      	while(n--){
      		int a,b;
      		cin>>a>>b;
      		cout<<c[a][b]<<endl;
      	}
      	return 0;
      }
      
      
  • 1

Information

ID
192
Time
1000ms
Memory
256MiB
Difficulty
3
Tags
(None)
# Submissions
54
Accepted
16
Uploaded By