Guest User

Untitled

a guest
Jun 19th, 2018
101
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.90 KB | None | 0 0
  1. int stk[2<<14];
  2. int ps=0;
  3.  
  4. int kofi(){
  5. char a[2<<15];
  6. int c[2<<15];
  7. int n;
  8. int s;
  9. unsigned char d[2<<14];
  10. int p;
  11. int jm;
  12.  
  13. int i,j,k;
  14.  
  15. char msg[] = {0x2A,0x2A,0x57,0x65,0x6c,0x63,0x6f,0x6d,0x65,0x20,0x74,0x6f,0x20,0x4b,0x2d,0x6f,0x6e,0x20,0x46,0x78,0x78,0x6b,0x21,0x2A,0x2A,0x0A};
  16. int len = 26;
  17.  
  18. for(i=0;i<len;i++) putchar(msg[i]);
  19.  
  20. while(1){
  21. char ppt[] = {0x3e,0x20};
  22. for(i=0;i<2;i++) putchar(ppt[i]);
  23.  
  24. gets(a);
  25.  
  26. ps=s=p=jm=0;
  27.  
  28. for(n=0;a[n]!='\0';n++);
  29. n/=12;
  30.  
  31. for(i=0;i<n;i++){
  32. k=0;
  33. for(j=0;j<3;j++){
  34. k*=2;
  35. if(a[i*12+j*4] == -126 && a[i*12+j*4+1] == -67) k+=1;
  36. }
  37. c[i] = k;
  38. }
  39.  
  40. for(i=0;i<(2<<14);i++) d[i] = 0;
  41.  
  42. for(s=0;s<n;s++){
  43. k=c[s];
  44. if(jm){
  45. if(k == 6) jm++;
  46. else if(k == 7) jm--;
  47. }else{
  48. if(k==0)++p;
  49. else if(k==1) {--p;}
  50. else if(k==2) {++d[p];}
  51. else if(k==3) {--d[p];}
  52. else if(k==4) {putchar(d[p]);}
  53. else if(k==5) {d[p] = getchar();}
  54. else if(k==6){
  55. if(d[p]) stk[ps++]=s-1;
  56. else jm = 1;
  57. }else{if(d[p]) {s = stk[--ps];}}
  58. }
  59. }
  60.  
  61. puts("");
  62. }
  63. }
  64.  
  65.  
  66. main(int ac,char *av[]){
  67. (ac > 1 && av[1][0] == 97)? a537():kofi();
  68. }
  69.  
  70.  
  71. int dp[3001][2001];
  72.  
  73. int a537(){
  74. int n,m,s,i,j,k;
  75.  
  76. char a[256];
  77. gets(a);
  78. for(j=n=m=s=i=0,skp=1;a[i]!='\0';i++){
  79. if(48 <= a[i] & a[i] <= 57) {
  80. skp=0;
  81. if(j==0) n=n*10+a[i]-48;
  82. else if(j==1) m=m*10+a[i]-48;
  83. else s=s*10+a[i]-48;
  84. }else if(!skp) ++j,skp=1;
  85. }
  86.  
  87. for(k=1;k<=s;k++) for(i=1;i<=m;i++) dp[k][i] = (i>=k)? 1:0;
  88.  
  89. for(i=1;i<n*n;i++)
  90. for(k=s;k>=1;k--)
  91. for(j=1;j<=m;j++)
  92. if(k>=j) dp[k][j] = (dp[k-j][j-1]+dp[k][j-1])%100000;
  93. else dp[k][j] = dp[k][j-1];
  94.  
  95. for(j=dp[s][m],i=1;j/10>0;a[i-1]=j%10+48,i++,j=j/10);a[i-1]=j%10+48;
  96. for(j=i-1;j>=0;j--)putchar(a[j]);
  97. puts("");
  98. }
Add Comment
Please, Sign In to add comment