Posts

Showing posts with the label UVa Online Judge Solutions

10591 - Happy Number

#include <stdio.h> int main()   {   long num,num_1,i=0,j,sum=0,c,a[ 999999],N;   scanf("%ld", &N);   for(long k=1;k<=N;k++)      {      scanf("%ld", &num_1);      if(num_1<10)      num=num_1*num_1;      else      num=num_1;      while(1)         {         c=num;         do            {            num=num%10;            a[i]=num;            i++;            c=c/10;            if(c<10)     ...

10812 - Beat the Spread!

#include <stdio.h> int main()    {    long N,s,d,score1,score2;    scanf("%ld", &N);    for(long count=1;count<=N;count++)       {       scanf("%ld%ld", &s, &d);       if(s < d)       printf("impossible\n");       else         {         score1 = (s+d)/2;         score2 = s-score1;         if((s+d)%2 == 0 && score1 >= 0 && score2 >= 0)           printf("%ld %ld\n",score1,score2);         else           printf("impossible\n");         }       }    }

10924 - Prime Words

#include <stdio.h> #include <string.h> int main()   {   char str[50],c;   long i,j,sum;   while(scanf("%s",&str)!=EOF)       {       sum=0;       i=strlen(str);       for(j=0;j<i;j++)          {          for(c=97;c<=122;c++)             if(str[j]==c)              sum=sum+(c-96);          for(c=65;c<=90;c++)             if(str[j]==c)               sum=sum+(c-38);          }//End of 1st for            long r,...

10931 - Parity

#include <stdio.h>  int main()    {    long a,i,b[100],sum;    while(scanf("%ld", &a) && a)      {     sum=0;     i=0;      if(a==1)        printf("The parity of 1 is 1 (mod 2).\n");        else           {            while(1)              {               b[i]=a%2;               a=a/2;               i++;               if(a==1)              ...

11172 - Relational Operator

#include <stdio.h>  int main()    {    long Number,a,b;    scanf("%ld", &Number);    for(int i=1;i<=Number;i++)       {       scanf("%ld%ld", &a, &b);       if(a==b)         printf("=\n");       if(a>b)         printf(">\n");       if(a<b)         printf("<\n");       }    } // End of main

11185 - Ternary

#include <stdio.h>  int main()    {    long a,data[100],i;    while(scanf("%ld", &a) && a>-1)     {     i=0;      if(a==0)       printf("0\n");     else     {     while(1)          {          data[i]=a%3;          a=a/3;          if(a==0)            break;          i++;          } // End of convertion             for(long j=i;j>=0;j--)            printf("%d",data[j]);        printf("\n");   ...

11000 - Bee

#include <stdio.h> int main()     {     long Number,Female,Male,Total, Male1,Female1;     while(scanf("%ld", &Number) && Number != -1)          {          Male1 =1;          Female1 = 1;          Male=1;          Female=1;          if(Number == 0)            printf("0 1\n");          else if(Number ==1)            printf("%ld %ld\n",Male1,Male1+Female1);          else              {            ...

483 - Word Scramble

#include <stdio.h> int main()     {     char line[500000],put[500000], character;     long c,k,i,numberofspace;     while(scanf("%c",&character)!= EOF)          {          c=0;          k=1;          i=0;          numberofspace=0;          line[0]=character;          do           {           if(line[c]==' ' && numberofspace==0)             {             for(long p=i-1;p>=0;p--)          ...

494 - Kindergarten Counting Game

#include <stdio.h> #include <ctype.h> int main()     {     char line[500000],character;     long c,n,p;     while(scanf("%c",&character)!= EOF)          {          c=0;          n=0;          p=0;          line[0]=character;          do            {            if(isalpha(line[c]) > 0)              {              if(p==1)                {         ...

10038 - Jolly Jumpers

#include <stdio.h> #include <stdlib.h> int main()     {     long input,a[3002],p,sum,k[3002], get;     while(scanf("%ld", &input)== 1)          {          sum = 0;          get = 0;          p=input*(input-1)/2;          scanf("%ld",&a[0]);          for(long i=1;i<input;i++)                {                scanf("%ld",&a[i]);                k[i]=abs(a[i-1]-a[i]);                sum += k[i];   ...

136 - Ugly Numbers

#include <stdio.h> int main()     {     long ugly[1500];     long Max=1000000000;     ugly[0]=1;     for(int i=1;i<1500;i++)        {        ugly[i]=Max;        for(int j=0; j < i;j++)           {           if(ugly[j]*2 > ugly[i-1])              {              if(ugly[j]*2 < ugly[i])                 ugly[i]=ugly[j]*2;              } // End of else if           else if(ugly[j]*3 > ugly[i-1])      ...

371 - Ackermann Functions

#include <stdio.h> int main()     {     long L,H,sum,max,track,V,c,temp;     while(scanf("%ld %ld", &L, &H) && L && H)          {          max=-99999999;          sum=0;          if(L > H)              {              temp=L;              L=H;              H=temp;              } // End of if          for(long i=L;i<=H;i++)              {    ...

694 - The Collatz Sequence

#include <stdio.h> int main()     {     long L,H,sum,c,k=1;     while(scanf("%ld %ld", &L, &H) && L && H)          {          if(L == -1 && L==-1) break;          else          sum=0;          c=L;              while(c!=1)                   {                   if(c%2==0)                     {                 ...

10852 - Less Prime

#include <stdio.h> int prime(int x); long sum=1,store[50000]; int main()     {     long Number,N,N1,prime1,prime2[ 50000],a[50000],save[50000];     scanf("%ld",&Number);     for(long i3=1;i3<=Number;i3++)        {         scanf("%ld",&N);         if(N%2==0)            N1=N/2;         else             {             int N2=N+1;             N1=N2/2;             }         for(long i=N1;i<=N;i++)            prime(i);   ...

575 - Skew Binary

#include <stdio.h> #include <string.h> int main()     {     char number[100000];     long Length,mul,pow,sum=0,number1, power;     while(1)          {          scanf("%s",number);          Length=strlen(number);          if(Length==1 && number[0]==48)             break;          else             {             power=Length;             for(long i=0;i<Length;i++)                {        ...