Saturday, August 06, 2016

SOLUTION OF UVA 10071

// Question of 10071 - Back to High School Physics
// Mahmud_Jamil

#include<stdio.h>
int main()
{
int s,v,t;
while (scanf("%d%d",&v,&t)!=EOF)
{
s=2*v*t;
printf("%d\n",s);
}
return 0;
}

SOLUTION OF UVA 10055

UVA SOLUTIONS

// Question of 10055 - Hashmat the Brave Warrior
// Mahmud_Jamil

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

SOLUTION OF UVA 10783

UVA SOLUTIONS

// Question of 10783 - Odd Sum
//    Mahmud_Jamil

#include<stdio.h>
int main()
{
int a,b,c,sum,i,j;
while(scanf("%d",&c)==1)
{
    for(j=1;j<=c;j++)
    {scanf("%d%d",&a,&b);
    sum=0;
    if(a%2==0)
    a=a+1;
    if(b%2==0)
    b=b-1;
    for(i=a;i<=b;i=i+2)
    sum=sum+i;
    printf("Case %d: %d\n",j,sum);}
}
return 0;
}

SOLUTION OF UVA 11172

UVA SOLUTIONS

//   Question of 11172 Relational Operator
//   Mahmud_Jamil

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

SOLUTION OF UVA 11479

UVA SOLUTIONS

//   Question of 11479 - Is this the easiest problem?
// Mahmud_Jamil (BRUR)

#include<stdio.h>
int main()
{
    long int a,b,c,d,i;
    while(scanf("%ld",&d)==1)
{
    i=1;
    while(i<=d)
{
    scanf("%ld %ld %ld",&a,&b,&c);
    if((a+b)<=c || (b+c)<=a || (c+a)<=b)
    {
        printf("Case %ld: Invalid\n",i);
    }
    else if(a<=0 || b<=0 || c<=0)
    {
        printf("Case %ld: Invalid\n",i);
    }
    else if(a==b && b==c)
    {
        printf("Case %ld: Equilateral\n",i);
    }
    else if(a==b || b==c || c==a)
    {
        printf("Case %ld: Isosceles\n",i);
    }
    else
    {
        printf("Case %ld: Scalene\n",i);
    }

    i++;
}

}
return 0;
}