UVA Solution

Sunday, May 20, 2012

UVA Solution for 10346

//10346
#include<stdio.h>
int main()
{
    int x,n,sum,k;
    while(scanf("%d%d",&n,&k)==2)
    {
    x=sum=n;
    while(x>=k)
               {
               sum=sum+(x/k);
               x=x/k+x%k;
               }
    printf("%d\n",sum);
    }
}

UVA Solution for 10302

//10302

#include <stdio.h>
#include <math.h>
int main()
{            long n,xx;
                 while(scanf("%ld",&n)==1)
                 {
                 xx=(n*n*(n+1)*(n+1))/4;
                printf("%ld\n",xx);
                 }
}

UVA Solution for 10300

//10300
#include <stdio.h>
int main()
{
    long int kase,farmer,a,b,c,prem,i,j;

    while(scanf("%ld",&kase)==1)
      {
      for(i=1;i<=kase;i++)
              {
              prem=0;
              scanf("%ld",&farmer);
              {
              for(j=1;j<=farmer;j++)
                 {
                 scanf("%ld%ld%ld",&a,&b,&c);
                 prem=prem+a*c;
                 }
                  printf("%ld\n",prem);
                  }
                  }
                  }
return 0;
}

UVA Solution for 10222

#include<stdio.h>
#include<string.h>
int main()
{
char l[200];
int i,n,k,len;
while(gets(l)){
len=strlen(l);
for(i=0;i<len;i++){
switch(l[i]){
case ']': printf("p"); break;
case '[': printf("o"); break;
case 'p':
case 'P': printf("i"); break;
case 'o':
case 'O': printf("u"); break;
case 'i':
case 'I': printf("y"); break;
case 'u':
case 'U': printf("t"); break;
case 'y':
case 'Y': printf("r"); break;
case 't':
case 'T': printf("e"); break;
case 'r':
case 'R': printf("w"); break;
case 'e':
case 'E': printf("q"); break;
case 'w':
case 'W': printf("w"); break;
case 'q':
case 'Q': printf("q"); break;
case '"': printf("l");break;
case ';':
case ':': printf("k"); break;
case 'l':
case 'L': printf("j"); break;
case 'k':
case 'K': printf("h");break;
case 'j':
case 'J': printf("g");break;
case 'h':
case 'H': printf("f");break;
case 'g':
case 'G': printf("d");break;
case 'f':
case 'F': printf("s");break;
case 'd':
case 'D': printf("a");break;
case '/':
case '?': printf(",");break;
case '.':
case '>': printf("m");break;
case ',':
case '<': printf("n");break;
case 'm':
case 'M': printf("b");break;
case 'n':
case 'N': printf("v");break;
case 'b':
case 'B': printf("c");break;
case 'v':
case 'V': printf("x");break;
case 'c':
case 'C': printf("z");break;
case 'x':
case 'X': printf("x");break;
case 'z':
case 'Z': printf("z");break;
case '\'':printf("l");break;
case '=':printf("0");break;
case '-': printf("9");break;
case '0': printf("8");break;
case '9': printf("7");break;
case '8': printf("6");break;
case '7': printf("5");break;
case '6': printf("4");break;
case '5': printf("3");break;
case '4': printf("2");break;
case '3': printf("1");break;
case '2': printf("`");break;
default:printf("%c",l[i]);
}
}
printf("\n");
}
return 0;
}

*/

//10222
#include<stdio.h>

int main()
{
    char ch,x;

    while(scanf("%c",&x)==1)
    {
    if((x=='?')||(x=='/'))
    printf(",");
    if((x=='>')||(x=='.'))
    printf("m");

    if((x=='<')||(x==','))
    printf("n");

    if((x=='M')||(x=='m'))
    printf("b");

    if((x=='n')||(x=='N'))
    printf("v");

    if((x=='B')||(x=='b'))
    printf("c");

    if((x=='v')||(x=='V'))
    printf("x");

    if((x=='C')||(x=='c'))
    printf("z");

    if((x=='x')||(x=='X'))
    printf("x");

    if((x=='Z')||(x=='z'))
    printf("z");

    if((x=='"')||(x=='\''))
    printf("l");

    if((x==';')||(x==':'))
    printf("k");

    if((x=='l')||(x=='L'))
    printf("j");

    if((x=='K')||(x=='k'))
    printf("h");

    if((x=='j')||(x=='J'))
    printf("g");

    if((x=='H')||(x=='h'))
    printf("f");

    if((x=='g')||(x=='G'))
    printf("d");

    if((x=='F')||(x=='f'))
    printf("s");

    if((x=='d')||(x=='D'))
    printf("a");

    if((x=='S')||(x=='s'))
    printf("s");

    if((x=='a')||(x=='A'))
    printf("a");

    if((x==']')||(x=='}'))
    printf("p");

    if((x=='{')||(x=='['))
    printf("o");

    if((x=='p')||(x=='P'))
    printf("i");

    if((x=='O')||(x=='o'))
    printf("u");

    if((x=='i')||(x=='I'))
    printf("y");

    if((x=='U')||(x=='u'))
    printf("t");

    if((x=='y')||(x=='Y'))
    printf("r");

    if((x=='T')||(x=='t'))
    printf("e");

    if((x=='r')||(x=='R'))
    printf("w");

    if((x=='e')||(x=='E'))
    printf("q");

    if((x=='w')||(x=='W'))
    printf("w");

    if((x=='Q')||(x=='q'))
    printf("q");

    if((x=='|')||(x=='\\'))
    printf("-");

    if((x=='=')||(x=='+'))
    printf("0");

    if((x=='-')||(x=='_'))
    printf("9");

    if((x=='0')||(x==')'))
    printf("8");

    if((x=='9')||(x=='('))
    printf("7");

    if((x=='*')||(x=='8'))
    printf("6");

    if((x=='&')||(x=='7'))
    printf("5");

    if((x=='6')||(x=='^'))
    printf("4");

    if((x=='5')||(x=='%'))
    printf("3");

    if((x=='$')||(x=='4'))
    printf("2");

    if((x=='#')||(x=='3'))
    printf("1");

    if((x=='@')||(x=='2'))
    printf("`");

    if((x=='!')||(x=='1'))
    printf("1");

    if((x=='`')||(x=='`'))
    printf("`");
    if(x==' ')
    printf(" ");

     }
}

*/

UVA Solution for 10110

//10110
#include<stdio.h>
#include<math.h>

int main()
{
long int r;
double num,root;

while(scanf("%lf",&num)==1)
    {
    if(num==0)
    break;

    r=sqrt(num);
    root=pow(r,2);

    if(root==num)
    printf("yes\n");
    else
    printf("no\n");
    }
return 0;
}

UVA Solution for 10079

//10079
#include<stdio.h>
int main()
{
long int pics,cut;
while(scanf("%ld",&cut)==1)
{
if(cut<0)
break;

pics=(cut*(cut+1)/2)+1;
printf("%ld\n",pics);

}
}

UVA Solution for 10071

//10071
#include <stdio.h>
int main()
{
    long int s,v,t;
    while(scanf("%ld%ld",&v,&t)==2)
    {
    s=v*t*2;
    printf("%ld\n",s);
    }

}

UVA Solution for 10055

//10055
#include <stdio.h>
#include <math.h>

int main()
{
long int has,opp,diff;
while(scanf("%ld%ld",&has,&opp)==2)
{
    //printf("\nInput the number of soldiers in Hashmat's army\n");
// scanf("%ld",&has);
   // printf("\nEnter the number of soldiers in opponent's army");
   // scanf("%ld",&opp);
    diff=(has-opp);
    if(diff<0)
    diff=diff*-1;
    printf("%ld\n",diff);
}
//getch();
}

UVA Solution for 10018

//10018
#include <stdio.h>
long int reverse(long int n)
{
    long int sum=0;
while(n>0)
     {
     sum=sum*10+n%10;
     n=n/10;
     }
     return sum;
}

int main(int argc, char *argv[])
{
    long int tot,i,iter,n,sum=0,sum1=0,x=0;

while(scanf("%ld",&tot)==1)
{
for(i=1;i<=tot;i++)
{
iter=0;
    scanf("%ld",&n);

    for(;;)
    {
sum1=reverse(n);
if (sum1==n)
break;
else
n=n+sum1;
iter++;
    }

    printf("%ld %ld\n",iter,sum1);
}
   }
   return 0;

}

UVA Solution for 913

//913
#include <stdio.h>
int main()
{
    long int n,sum,odd;
    while(scanf("%ld",&n)==1)
    {
    odd=(n*(n+2))/2;
    sum=(3*odd)-6;
    printf("%ld\n",sum);
    }
}

UVA Solution for 591

//591
#include<stdio.h>

int main()
{
int n,x[102],i,j,set=0,mov,sum,avg;

while(scanf("%d",&n)==1)
    {

   if(n==0)
   break;
set++;
    sum=0;
   mov=0;
   for(i=0;i<n;i++)
       {
      scanf("%d",&x[i]);
      sum+=x[i];
      }

   avg=sum/n;

   for(j=0;j<n;j++)
       {
      if(avg<x[j])
       mov+=x[j]-avg;
      }

// printf("Set #%d\nThe minimum number of moves is %d\n",set,mov);
printf("Set #%d\nThe minimum number of moves is %d.\n\n",set,mov);
   }
   return 0;
}

UVA Solution for 438

//438
#include<stdio.h>
#include<math.h>
#define pi 3.141592653589793
int main()
{
double x1,x2,y1,y2,x3,y3;
double i,j,s,a,b,c,r;
double cir;
while(scanf("%lf%lf%lf%lf%lf%lf",&x1,&y1,&x2,&y2,&x3,&y3)==6)
{

a=sqrt(pow((x1-x2),2)+pow((y1-y2),2));
b=sqrt((x1-x3)*(x1-x3)+(y1-y3)*(y1-y3));
c=sqrt((x2-x3)*(x2-x3)+(y2-y3)*(y2-y3));
s=(a+b+c)/2;

r=a*b*c/(4*sqrt((s*(s-a)*(s-b)*(s-c))));
cir=2*pi*r;
printf("%.2lf\n",cir);
}
}

UVA Solution for 458

//458
#include<stdio.h>
int main()
    {
     char ch,x;
     while(scanf("%c",&ch)==1)
          {
           if(ch=='\n')
           printf("\n");
           else
               {
                x=ch-7;
                //to code x=ch+7;
                printf("%c",x);
               }
          }
    return 0;
    }

UVA Solution for 369

//369
#include<stdio.h>
double fact(double n)
       {
        if(n==0)
        return 1;
        else
        return (n*fact(n-1));
       }


int main()

   {
double n,k,r;
while(scanf("%lf%lf",&n,&r)==2)
{
     if(n==0 && r==0)break;
k=fact(n)/(fact(n-r)*fact(r));
printf("%.0lf things taken %.0lf at a time is %.0lf exactly.\n",n,r,k);
}
   }

UVA Solution for 299

//299
#include <cstdlib>
#include <iostream>

using namespace std;

int main(int argc, char *argv[])
{
   int temp,i,j,k,kase,len,x[100]={0};
   int swap;
   while(scanf("%d",&kase)!=0)
       {
        scanf("%d",&len);
        for(i=0;i<len;i++)
           {
            scanf("%d",&x[i]);
            }
        swap=0;

          for(i=0;i<len;i++)
          {
          for(j=0;j<len;j++)
          {
           if( ( x[j]>x[j+1])&& (j!=len))
              {
               temp=x[j];
               x[j]=x[j+1];
               x[j+1]=temp;
               swap++;
              }
          }
          }

                     printf("Optimal train swapping takes %d swaps.\n",swap);

       }

}

UVA Solution for 299

UVA Solution for 272

//272 uva
#include <stdio.h>
#include <string.h>
int main()
{
   int a=0;
    char ch;
    while(scanf("%c",&ch)==1)
             {
                             if(ch=='"')
                                        {
                                           a++;
                                           if((a%2)==1)
                                           printf("``");
                                           else if ((a%2)==0)
                                           printf("''");
                                        }
                             else
                             printf("%c",ch);
             }
}

UVA Solution for 100

#include
int main()
{
long int i,j,n1,n2,max=0,l,temp;

while(scanf("%ld %ld",&n1,&n2)==2){
printf("%ld",n1);
printf(" %ld",n2);
max=0;

if(n2>1;
else i=3*i+1;
l++;
}
if(l>max) max=l;

}
printf(" %ld\n",max);
}
return 0;
}

UVA Solution for 113

//113
#include
#include

int main()
{
double n,p,k,t;

while(scanf("%lf %lf",&n,&p)==2)
{

t=1/n;
k=pow(p,t);
printf("%.0lf\n",k);

}
}

/*
#include
#include

int main()
{
double x,k,n,p;

while(scanf("%lf%lf",&n,&p)==2){

x=1/n;
k=pow(p,x);
printf("%.0lf\n",k);

}
return 0;
}
*/

Monday, May 16, 2011

Make libraries for yourself

Do you program on a daily basis? Do you find yourself using the same methods, classes or constants in multiple programs? Do you find yourself copying macro's constantly? Well use a library file instead.. Most compiler's I have used allow you to make a .cpp or .c(etc) file and then compile it and link it into any application that contains the corresponding .h file with the function or class declarations. For example- I have produced nearly 30 METHOD headers for my programs. One might deal with input/output manipulations. Another might define iterator macro's. Yet another might deal with variable manipulation or streaming. Then include them all into yet another header file and include it in all of your work, so you don't have to redefine these methods/variables/macro's in seperate files.
:: as a note :: The extraneous header files must be saved into your includes folder(for dev-cpp) or into the includes directory.