0
Your rating: None

CodeChef submission 491186 (C++ 4.0.0-8)

CodeChef submission 491186 (C++ 4.0.0-8) plaintext list. Status: WA, problem MARCHA1, contest . By anantc (anantc), 2011-03-18 19:26:22.
  1. #include<stdio.h>
  2. int a[21]={0};
  3. int n=0,r=0;
  4. using namespace std;
  5. int sum(int k) {
  6. int s=0,i=0;
  7. while (i<=k) {s=s+a[i];i++;}
  8. return s;  
  9.     }
  10. int pos(int m) {
  11.     int j=-1,sumi,sumii,i=0;
  12.     while(i<n){
  13.                sumi=sum(i);
  14.                sumii=sum(i+1);
  15.                if((sumi<m)&&(m<sumii)){return i;j++;break;}
  16.                if((sumi==m)||(sumii==m)){r=1;j++;return i;break;}
  17.                i++;
  18.                }
  19.                if(j==-1){r=-1;return 0;}
  20.     
  21.     }
  22. int lim(int m,int k) {
  23.     int i=0,f=0;
  24.     while(i<=k){
  25.                if(a[i]>m){
  26.                        if(i==0){r=-1;
  27.                        return 0; } else {  return (i-1);
  28.                f=1;
  29.                break;}
  30.                
  31.                }
  32.               
  33.                i++;
  34.     
  35.     
  36. }
  37.  if(f==0){return k;}
  38.   }
  39.   
  40.   int check(int m,int k) {
  41.       int i=0,j,q;
  42.       if(r==0) {
  43.       while(i<=k) {
  44.                  if(a[i]==m){r=1;break;}
  45.                  i++;
  46.                  }
  47.                  i=0;
  48.                  if(r==0){j=pos(m);}
  49.                 if(r==0){
  50.                        i=j+1;
  51.                 while(i<=k){
  52.                    q=m-a[i];
  53.                 if(r==1){break;}
  54.                 check(q,j);
  55.                 i++;
  56.                                }
  57.       
  58.       }
  59. }
  60. return 0;
  61. }
  62.  
  63. int main()
  64. {
  65.     a[20]=1001;
  66.     int j,m,i=0,t,at=0;
  67.     int o,p,temp;
  68. scanf("%d",&t);
  69. while(at<t){
  70.             r=0;
  71.             i=0;
  72. scanf("%d",&n);
  73. scanf("%d",&m);
  74.  
  75. while(i<n){
  76.            
  77.            scanf("%d",&a[i]);
  78.            i++;
  79.            }    
  80.            
  81.     for(o=0;o<n;o++)
  82.     {
  83.         for(p=0;p<o;p++)
  84.         {
  85.             if(a[o]<a[p])
  86.             {
  87.                 temp=a[o]; //swap 
  88.                 a[o]=a[p];
  89.                 a[p]=temp;
  90.             }
  91.  
  92.         }
  93.  
  94.     }
  95.            j=lim(m,(n-1));
  96.     check(m,j);
  97.     if(r==1){printf("Yes\n");}
  98.     else if(r==-1){printf("No\n");}
  99.     at++;
  100. }
  101.    
  102.     return 0;
  103.     }
  104.

Comments