nCr table | Editorial by aksingh007

Here we dynamically calculate nCr using following recurrence relation and store it to use.
 C(n,r)=C(n-1,r-1)+C(n-1,r);

```

import java.util.*;
import java.lang.*;
import java.io.*;
// NOTE : USE MEMOIZATION FOR OPTIMIZATION
class NcR {
    
    static public void nCr(long ncr[][]){
        int n=ncr.length;
        long MOD=1000000000L;
        for(int i=0;i<n;i++)
            ncr[i][0]=1L;
        for(int i=1;i<n;i++)
            for(int j=1;j<=i;j++)
                ncr[i][j]=(ncr[i-1][j-1]+ncr[i-1][j])%MOD;
                // Recurrence Used : nCr(n, r) = nCr(n-1, r-1) + nCr(n-1, r)
        
    } 
    
    public static void main (String[] args) {
        Scanner sc=new Scanner(System.in);
        int t=sc.nextInt();
        long ncr[][]=new long[1001][1001];
        nCr(ncr);
        while(t-->0){
            int n=sc.nextInt();
            int j=0;
            while(ncr[n][j]!=0){
                System.out.print(ncr[n][j]+" ");
                j++;
            }
            System.out.println();
        }
    }
}

```

nCr table | Editorial by aksingh007

Download submission

All caught up!

View submission

Is your resume even shortlisted?