Advertisement
Guest User

Untitled

a guest
Jun 29th, 2017
107
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.48 KB | None | 0 0
  1. #include <stdio.h>
  2. int n,i,j,t,f[1111][1111],md=1000003;
  3. int main() {
  4. f[1][1]=1;
  5. for (i=1; i<=1000; i++) for (j=1; j<=1000; j++) if (i!=1 || j!=1) {
  6. f[i][j]=f[i-1][j-1]+f[i-1][j];
  7. if (f[i][j]>md) f[i][j]-=md;
  8. f[i][j]=f[i][j]+f[i][j-1];
  9. if (f[i][j]>md) f[i][j]-=md;
  10. }
  11. for (i=1; i<=100; i++,puts("")) for (j=1; j<=100; j++) printf("%5d ",f[i][j]);
  12. scanf("%d",&t);
  13. while (t--) {
  14. scanf("%d",&n);
  15. printf("%d\n",f[n][n]);
  16. }
  17. return 0;
  18. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement