uva 11172 (Relational Operator)

Algorithm used : Ad hoc

#include <stdio.h>
int main(){
unsigned long long int a,b,c,d;
scanf("%llu",&a);
for(b=0;b<a;b++){
scanf("%llu %llu",&c,&d);
if(c>d)printf(">\n");
else if(c<d)printf("<\n");
else if(c==d)printf("=\n");
}
return 0;

}

uva 10783 (Odd Sum)

Algorithm used : Ad hoc

#include <stdio.h>
int main(){
unsigned long long int a,b,c,d,e,sum,x,y;
scanf("%llu",&a);
for(b=0;b<a;b++){
scanf("%llu %llu",&c,&d);
sum=0;
if(c>d){
    x=d;
    y=c;
}
else if(c<d){
x=c;
y=d;

}
else if(c==d){
x=c;
y=d;
}
for(e=x;e<=y;e++){
if(e%2==1){
sum=sum+e;
}
else if(e%2==0)sum=sum;

}
printf("Case %llu: %llu\n",(b+1),sum);

}
return 0;



}

uva 10424 (Love Calculator)

Algorithm used : Ad hoc (my First uva solved problem… so manual 😛

#include < stdio.h >
#include < string.h >
int main(void){
    char name[2000],name1[2000];
    int a,i,b,sum,sum1,d,e,f,g,j,m1,m2,m3,m4,m5,m,n,n1,n2,n3,n4,n5,m0,m01,n0,n01,um,um1;
    float final,final1;
    while(gets(name)){
    gets(name1);
    sum=0;
    sum1=0;
    a=strlen(name);
    b=strlen(name1);
    for(i=0;i<a;i++){
      d=(int)name[i];
      if(d>=65 && d<=91){
        e=d-64;
        }
      else if(d>=97 && d<=123){
        e=d-96;
        }
        else e=0;
        sum=sum+e;
        }
      for(j=0;j<b;j++){
        f=(int)name1[j];
        if(f>=65 && f<=91){
          g=f-64;
          }
          else if(f>=97 && f<=123){
          g=f-96;
          }
          else g=0;
          sum1=sum1+g;
          }
          if(sum<10)m=sum;
          else if(sum>=10 && sum<100){
               m1=sum/10;
               m2=sum%10;
               m3=m1+m2;
               if(m3>=10){
                  m4=m3/10;
                  m5=m3%10;
                  m=m4+m5;
                  }
                  else m=m3;
                  }
               else if(sum>=100 && sum<1000){
               m0=sum/100;
               m01=sum%100;
               um=m01;
               m1=um/10;
               m2=um%10;
               m3=m1+m2+m0;
               if(m3>=10){
                  m4=m3/10;
                  m5=m3%10;
                  m=m4+m5;
                  }
                  
                  
                  
                  else if(m3<10)m=m3;
                  
                  }
               if(sum1<10)n=sum1;
               else if(sum1>=10 && sum1<100){
               n1=sum1/10;
               n2=sum1%10;
               n3=n1+n2;
               if(n3>=10){
                  n4=n3/10;
                  n5=n3%10;
                  n=n4+n5;
                  }
                  else if(n3<10)n=n3;
                  }
                  else if(sum1>=100 && sum1<1000){
               n0=sum1/100;
               n01=sum1%100;
               um1=n01;
               n1=um1/10;
               n2=um1%10;
               n3=n1+n2+n0;
               if(n3>=10){
                  n4=n3/10;
                  n5=n3%10;
                  n=n4+n5;
                  }
                  
                  else if(n3<10){
                       n=n3;
                  }
                  }
                   
          if(m>n){
             final=(float)n/(float)m;
             }
             else {
               final=(float)m/(float)n;
             }
          final1=final*100;
          printf("%.2f %%\n",final1);  
          } 
          
                           
          return 0;
} 



           
        
        
        
      
    

uva 10055 (Hasmat the brave …)

Algorithm used : Ad hoc…. so simple

#include < stdio.h >
#include < conio.h >
int main(){
    unsigned long long int a,b,c;
    while(scanf("%llu %llu",&a,&b)==2){
              if(a>b)c=a-b;
              else c=b-a;
              printf("%llu\n",c);
    }
 getch();
return 0;
}                     

uva 10921 (Find The Telephone)

Algorithm used : Ad hoc

#include <stdio.h>
#include <string.h>
int main(){
int i,j,k;
char ch[100],ch1[100];
freopen("in.txt","r",stdin);
while(gets(ch)){
i=strlen(ch);
for(j=0;j<i;j++){
if(ch[j]>='A' && ch[j]<='C')ch1[j]='2';
else if(ch[j]>='D' && ch[j]<='F')ch1[j]='3';
else if(ch[j]>='G' && ch[j]<='I')ch1[j]='4';
else if(ch[j]>='J' && ch[j]<='L')ch1[j]='5';
else if(ch[j]>='M' && ch[j]<='O')ch1[j]='6';
else if(ch[j]>='P' && ch[j]<='S')ch1[j]='7';
else if(ch[j]>='T' && ch[j]<='V')ch1[j]='8';
else if(ch[j]>='W' && ch[j]<='Z')ch1[j]='9';
else ch1[j]=ch[j];
}
for(j=0;j<i;j++){
printf("%c",ch1[j]);
}
printf("\n");
}
return 0;


}

uva 10300 (Ecology)

Algorithm used : Ad hoc

#include < stdio.h >
int main(){
    unsigned long long int a,b,c,d,e,f,g,i,h;
    scanf("%llu",&a);
    for(b=0;b<a;b++){
        i=0;
       scanf("%llu",&c);
       for(d=0;d<c;d++){
         scanf("%llu %llu %llu",&e,&f,&g);
         h=e*g;
         i=i+h;
         }
         printf("%llu\n",i);
         }
         return 0;
         }
         
         
         
         
         

uva 591 (Box of Bricks)

Algorithm used : Ad hoc

#include < stdio.h >
int main(){
int i,j,k[200],sum,avg,a,b=0,sum1;
freopen("in.txt","r",stdin);
while(scanf("%d",&i)==1 && i!=0){
    b++;
    sum=0;
    sum1=0;
for(j=0;j < i;j++){
scanf("%d",&k[j]);
sum=sum+k[j];

}
avg=sum/i;
for(j=0;j < i;j++){
if(avg>k[j]){
    a=avg-k[j];
sum1=sum1+a;}
}
printf("Set #%d\n",b);
printf("The minimum number of moves is %d.\n",sum1);
printf("\n");
}

return 0;

}

uva 11900 (Boiled Eggs)

Algorithm used : Adhoc

#include <stdio.h>
int main(){
    int a,b,c,d,e,f[50],g,sum,i,h;
    scanf("%d",&a);
    for(b=0;b<a;b++){
        i=0;
        sum=0;
        scanf("%d %d %d",&c,&d,&e);
        for(h=0;h<c;h++){
            scanf("%d",&f[h]);
        }
        for(g=0;g<d&&g<c;g++){
            sum=sum+f[g];
            if(sum<=e){
                i++;
            }
        }
        printf("Case %d: %d\n",(b+1),i);
    }
    return 0;

}

uva 10370 (Above Average)

Algorithm used : Ad hoc

#include <stdio.h>
int main(){
int i,j,k,l,n,m[1015],sum;
float avg,res;
freopen("in.txt","r",stdin);
scanf("%d",&i);
for(j=0;j<i;j++){
sum=0;
n=0;
scanf("%d",&k);
for(l=0;l<k;l++){
scanf("%d",&m[l]);
sum=sum+m[l];
}
avg=(float)sum/(float)k;
for(l=0;l<k;l++){
if(m[l]>avg)n++;
}
res=(float)n/(float)k;
printf("%.3f%%\n",res*100);
}

return 0;
}

uva 100 (3n+1)

Algorithm used : Math,Adhoc

#include <stdio.h>
int main()
{
int a,b,c,d,max,f,x,y;

 while(scanf("%d %d",&x,&y)==2){
     if(x<y){
     c=x;
     d=y;
     }
     else {
     c=y;
     d=x;
     }

        max=0;
 for(f=c;f<d+1;f++){

    a=f;
   b=1;
   while(a>1){
     if(a%2==0)a=a/2;
     else if(a%2==1)a=3*a+1;
     b++;
   }
   if(max<b)max=b;
 }
 printf("%d %d %d\n",x,y,max);
}
 return 0;
}