Friday, August 19, 2016
SOLUTION OF UVA 11044
// Question of uva 11044 - Searching for Nessy
// Mahmud_Jamil
#include<stdio.h>
int main()
{
int t,n,m;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&n,&m);
printf("%d\n",(n/3)*(m/3));
}
}
SOLUTION OF UVA 12468
// Question of uva 12468 - Zapping
// Mahmud_Jamil
#include<stdio.h>
int main()
{
int a,b,s;
while(scanf("%d %d",&a,&b)==2 && (a!=-1 && b!=-1))
{
s=abs(a-b);
if(s>50)
s=100-s;
printf("%d\n",s);
}
return 0;
}
Saturday, August 13, 2016
SOLUTION OF UVA 11547
// Question of uva 11547 - Automatic Answer
// Mahmud_Jamil
#include<stdio.h>
int main()
{
int ans,t,n,i;
while(scanf("%ld",&t)==1)
{
for(i=0;i<t;i++)
{
scanf("%d",&n);
n*=567;
n/=9;
n+=7492;
n*=235;
n/=47;
n-=498;
n/=10;
ans=n%10;
if(ans<0)
ans*=(-1);
printf("%d\n",ans);
}
}
return 0;
}
SOLUTION OF UVA 136
// Question of uva 136 - Ugly Numbers
// Mahmud_Jamil
#include <stdio.h>
int main()
{
printf("The 1500'th ugly number is 859963392.\n");
return 0;
}
SOLUTION OF UVA 12952
// Question of 12952 - Tri-du
// Mahmud_Jamil
#include<stdio.h>
#define MAX(a,b) ((a)>(b)?(a):(b))
int main()
{
int a,b;
while(scanf("%d%d",&a,&b)!=EOF)
printf("%d\n", MAX(a,b));
return 0;
}
