SPOJ 5449. Seinfeld December 5, 2009

SPOJ 5449. Seinfeld
Problem code: ANARC09A
TODOLIST;

SPOJ 5451. Not So Flat After All December 5, 2009

SPOJ 5451. Not So Flat After All
Problem code: ANARC09C
TODOLIST:

SPOJ 5450. Tiles of Tetris, Not! November 30, 2009

SPOJ 5450. Tiles of Tetris, Not!
Problem code: ANARC09B

--AC--
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>

long long int gcd(long long int n1,long long int n2)
{
  if(n1==0) return n2;
  else if(n2==0) return n1;

  if(n1>n2)
    return gcd(n1%n2,n2);
  else
    return gcd(n1,n2%n1);

return 0;

}

int main()
{
  long long int i,j,k,lcm;
  long long int W,H;
  
  while(1)
  {
   scanf("%lld%lld",&W,&H);
   if(W==0&&H==0) break;
  
   if(W==H) 
       printf("1\n");
   else if(W>H)
   {
        if(W%H==0) 
           printf("%lld\n",W/H);
        else
          {
           lcm=(W*H)/gcd(W,H);
           printf("%lld\n",lcm);
          }
    }
    else if(H>W)
    {
        if(H%W==0)
          printf("%lld\n",H/W);
        else
          {
            lcm=(W*H)/gcd(W,H);
            printf("%lld\n",lcm);
          }
     }
   
   }

return 0;
}

SPOJ 5447. Probability One November 30, 2009

SPOJ 5447. Probability One
Problem code: ANARC09E

--AC--
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>

int main()
{
  int i,j;
  int k,B,Q;
  k=0;
  while(1)
  {
    
    scanf("%d",&B);
    if(B==0) break;
    if(B%2==0)
      printf("%d. even %d\n",++k,B/2);
    else
      printf("%d. odd %d\n",++k,(B-1)/2);
  }
return 0;
}