0
Your rating: None

CodeChef submission 108634 (C++ 4.0.0-8)

CodeChef submission 108634 (C++ 4.0.0-8) plaintext list. Status: RE, problem H5, contest OCT09. By rajul884 (rajul884), 2009-10-11 11:30:06.
  1. #include<stdio.h>
  2. #include<iostream.h>
  3. #include<stdlib.h>
  4. long  line(long,long *,long *);
  5. int main()
  6. {
  7. int d;
  8. long ans[5000],h,k=0,r;
  9. long t,j;
  10. long m,n,l[50],i,q,lnumber,lnumber1,ln;
  11. char f[20],*endptr,*endptr1;
  12. char g[50];
  13. int s;
  14. char nm;
  15. do
  16.   {
  17.     scanf("%ld \n",&t);
  18.   }while(t>50||t<0);
  19.  
  20. r=100000;
  21. for(j=0;j<t;j++)
  22.   {
  23.  
  24.    do {
  25.        scanf("%ld",&m);
  26.       }while((m<1)||(m>100000));
  27.  
  28.    do{
  29.        scanf("%ld",&n);
  30.      }while((n>=m)||(n>50000)||(n<1));
  31.  
  32.  
  33. //cout<<"enter l1";
  34. //gets(g);
  35. gets(&g[0]);
  36.  
  37. s=0;
  38. gets(g);
  39. for(i=0;i<n;i++)
  40. {
  41.  lnumber=strtol(g+s+i,&endptr,10);
  42.  //cout<<"\n lnumber="<<lnumber;
  43.  ln=lnumber;
  44.  //cout<<"\n ln="<<ln;
  45.  while(1)
  46.    {
  47.  
  48.     ln=(ln/10);
  49.     s++;
  50.     if(ln==0)
  51.     break;
  52.    }
  53.  
  54.  
  55.  l[i]=lnumber;
  56.  
  57. }
  58.  
  59.  
  60. f[0]='a';
  61. r=r+k;
  62.  
  63.  while(f[0]!='E'&&k<r)
  64.   {
  65.  
  66.    gets(f);
  67.    if(f[0]=='E')
  68.      {
  69.       ans[k]=0;
  70.       k++;
  71.      }
  72.  
  73.    if(f[0]!='E')
  74.      {
  75.       if(f[0]=='l')
  76.        {
  77. 	lnumber = strtol(f+1, &endptr, 10);
  78. 	ans[k]=line(lnumber,&m,&l[0]);
  79. 	k++;
  80.  
  81.        }
  82.  
  83.       else if(f[0]=='c')
  84.        {
  85. 	lnumber=strtol(f+1,&endptr,10);
  86. 	s=0;
  87. 	ln=lnumber;
  88. 	while(1)
  89. 	 {
  90. 	  ln=(ln/10);
  91. 	  s++;
  92. 	   if(ln==0)
  93. 	    break;
  94. 	 }
  95.  
  96. 	lnumber1=strtol(f+s+2,&endptr,10);
  97. 	if(lnumber1>=1&&lnumber1<=m)
  98. 	 {
  99. 	  l[lnumber-1]=lnumber1;
  100. 	 }
  101. 	 else
  102. 	 exit(0);
  103.  
  104.       }
  105.    }
  106.  }
  107.  
  108. printf("\n");
  109.  
  110.  }
  111.  
  112.  printf("case #1 \n");
  113.  d=1;
  114.   for(h=0;h<k;h++)
  115.    {
  116.     if(ans[h]==0)
  117.      {
  118.       printf("\n");
  119.       d++;
  120.       h++;
  121.       if(h<k)
  122.        {
  123. 	printf("case #%d\n",d);
  124.        }
  125.      }
  126.     if(h<k)
  127.      printf("%ld \n",ans[h]);
  128.     }
  129.  
  130. return 0;
  131. }
  132.  
  133.  
  134. long line(long li,long *m,long *l)
  135. {
  136. long a,i,x;
  137. long ln=0;
  138. a=li-1;
  139. i=0;
  140. while((ln<=200)&&(i<=a))
  141. {
  142. x=0;
  143. do{
  144. x=x+l[i];
  145. x=x+1;
  146. i=i+1;
  147. }while(*m>=(x+l[i])) ;
  148. ln++;
  149.  
  150. }
  151.  return ln;
  152. }
  153.  
  154.

Comments