Month: December 2012

Dec

2012

Uva 11777 – Automate the Grades

Problem Link

Solution :-

/*------------------------------------------------*/
//Problem Setter: Sohel Hafiz
//Uva Problem No: 11777
//Problem Name  : Automate the Grades
//Type          : Ad hoc
//Author        : Shipu Ahamed
//University    : BUBT
//E-mail        : shipuahamed01@gmail.com
/*-----------------------------------------------*/

#include<stdio.h>
int main()
{
    int t1,t2,f,at,ct1,ct2,ct3,c,d,n,i;
    while(scanf("%d",&n)==1)
    {
        for(i=1;i<=n;i++)
        {
        scanf("%d%d%d%d%d%d%d",&t1,&t2,&f,&at,&ct1,&ct2,&ct3);
        if(ct1<=ct2 && ct1<=ct3)
        c=(ct2+ct3)/2;
        else if(ct2<=ct1 && ct2<=ct3)
        c=(ct1+ct3)/2;
        else if(ct3<=ct1 && ct3<=ct2)
        c=(ct1+ct2)/2;
        d=t1+t2+f+at+c;
        if(d>=90)
        printf("Case %d: An",i);
        else if(d>=80)
        printf("Case %d: Bn",i);
        else if(d>=70)
        printf("Case %d: Cn",i);
        else if(d>=60)
        printf("Case %d: Dn",i);
        else if(d<60)
        printf("Case %d: Fn",i);
        }
    }
    return 0;
}

/*------------------------------------------------*/

//Problem Setter: Sohel Hafiz

//Uva Problem No: 11777

//Problem Name : Automate the Grades

//Type : Ad hoc

//Author : Shipu Ahamed

//University : BUBT

//E-mail : shipuahamed01@gmail.com

/*-----------------------------------------------*/

#include<stdio.h>

int main()

{

int t1,t2,f,at,ct1,ct2,ct3,c,d,n,i;

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

{

for(i=1;i<=n;i++)

{

scanf("%d%d%d%d%d%d%d",&t1,&t2,&f,&at,&ct1,&ct2,&ct3);

if(ct1<=ct2 && ct1<=ct3)

c=(ct2+ct3)/2;

else if(ct2<=ct1 && ct2<=ct3)

c=(ct1+ct3)/2;

else if(ct3<=ct1 && ct3<=ct2)

c=(ct1+ct2)/2;

d=t1+t2+f+at+c;

if(d>=90)

printf("Case %d: An",i);

else if(d>=80)

printf("Case %d: Bn",i);

else if(d>=70)

printf("Case %d: Cn",i);

else if(d>=60)

printf("Case %d: Dn",i);

else if(d<60)

printf("Case %d: Fn",i);

}

return 0;

}

Dec

2012

Uva 11875 – Brick Game

Problem Link

Solution :-

/*------------------------------------------------*/
//Problem Setter: Md. Arifuzzaman Arif
//Uva Problem No: 11875
//Problem Name  : Brick Game
//Type          : Ad hoc
//Author        : Shipu Ahamed
//University    : BUBT
//E-mail        : shipuahamed01@gmail.com
/*--------------------------------------------*/

#include<stdio.h>
#include<algorithm>
#include<stdlib.h>
using namespace std;
int main()
{
    int n,i,a[12],t,p,mem;
    while(scanf("%d",&n)==1)
    {
        t=1;
        while(n--)
        {
            scanf("%d",&mem);
            for(i=0;i<mem;i++)
            scanf("%d",&a[i]);
            sort(a,a+i);
            p=mem/2;
            printf("Case %d: %dn",t++,a[p]);
        }
    }
    return 0;
}

/*------------------------------------------------*/

//Problem Setter: Md. Arifuzzaman Arif

//Uva Problem No: 11875

//Problem Name : Brick Game

//Type : Ad hoc

//Author : Shipu Ahamed

//University : BUBT

//E-mail : shipuahamed01@gmail.com

/*--------------------------------------------*/

#include<stdio.h>

#include<algorithm>

#include<stdlib.h>

using namespace std;

int main()

{

int n,i,a[12],t,p,mem;

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

{

t=1;

while(n--)

{

scanf("%d",&mem);

for(i=0;i<mem;i++)

scanf("%d",&a[i]);

sort(a,a+i);

p=mem/2;

printf("Case %d: %dn",t++,a[p]);

}

return 0;

}

Dec

2012

Uva 11878 – Homework Checker

Problem Link

Solution :-

/*------------------------------------------------*/
//Problem Setter: Rujia Liu
//Uva Problem No: 11878
//Problem Name  : Homework Checker
//Type          : Ad hoc
//Author        : Shipu Ahamed
//University    : BUBT
//E-mail        : shipuahamed01@gmail.com
/*--------------------------------------------*/

#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<iostream>
#include<cctype>
#include<map>
#include<stack>
#include<cstdlib>
#include <queue>
#include <vector>
#include<algorithm>
#define ll long long
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
using namespace std;
int main()
{
    int a,b,count=0;
    char sine,c[1000];
    while(sc("%d%c%d=%s",&a,&sine,&b,c)==4)
    {
        if(sine=='+')
        {
            if(a+b==atoi(c))
            count++;
        }
        else if(sine=='-')
        {
            if(a-b==atoi(c))
            count++;
        }
    }
    pf("%dn",count);
    return 0;
}

/*------------------------------------------------*/

//Problem Setter: Rujia Liu

//Uva Problem No: 11878

//Problem Name : Homework Checker

//Type : Ad hoc

//Author : Shipu Ahamed

//University : BUBT

//E-mail : shipuahamed01@gmail.com

/*--------------------------------------------*/

#include<cstdio>

#include<cstring>

#include<string>

#include<cmath>

#include<iostream>

#include<cctype>

#include<map>

#include<stack>

#include<cstdlib>

#include <queue>

#include <vector>

#include<algorithm>

#define ll long long

#define sc scanf

#define pf printf

#define Pi 2*acos(0.0)

using namespace std;

int main()

{

int a,b,count=0;

char sine,c[1000];

while(sc("%d%c%d=%s",&a,&sine,&b,c)==4)

{

if(sine=='+')

{

if(a+b==atoi(c))

count++;

}

else if(sine=='-')

{

if(a-b==atoi(c))

count++;

}

pf("%dn",count);

return 0;

}

Dec

2012

Uva 11879 – Multiple of 17

Problem Link

Solution :-

/*------------------------------------------------*/
//Problem Setter: Rujia Liu
//Uva Problem No: 11879
//Problem Name  : Multiple of 17
//Type          : Ad hoc
//Author        : Shipu Ahamed
//University    : BUBT
//E-mail        : shipuahamed01@gmail.com
/*--------------------------------------------*/

#include<stdio.h>
#include<string.h>
int main()
{
    int i,sum,r,l;
    char s[1020];
    while(gets(s))
    {
        r=0;
        l=strlen(s);
        if(l==1 && s[0]=='0')
        break;
        for(i=0;i<l;i++)
        {
        sum=r*10+(s[i]-'0');
        r=sum%17;
        }
        if(r==0)
        printf("1n");
        else
        printf("0n");
    }
    return 0;
}

/*------------------------------------------------*/

//Problem Setter: Rujia Liu

//Uva Problem No: 11879

//Problem Name : Multiple of 17

//Type : Ad hoc

//Author : Shipu Ahamed

//University : BUBT

//E-mail : shipuahamed01@gmail.com

/*--------------------------------------------*/

#include<stdio.h>

#include<string.h>

int main()

{

int i,sum,r,l;

char s[1020];

while(gets(s))

{

r=0;

l=strlen(s);

if(l==1 && s[0]=='0')

break;

for(i=0;i<l;i++)

{

sum=r*10+(s[i]-'0');

r=sum%17;

}

if(r==0)

printf("1n");

else

printf("0n");

}

return 0;

}

Dec

2012

Uva 11942 – Lumberjack Sequencing

Problem Link

Solution :-

/*------------------------------------------------*/
//Uva Problem No: 11942
//Problem Name  : Lumberjack Sequencing
//Type          : Ad hoc.
//Author        : Shipu Ahamed
//University    : BUBT
//E-mail        : shipuahamed01@gmail.com
/*--------------------------------------------*/

#include<stdio.h>
int main()
{
    int n,c,i,a[15],up,down;
    printf("Lumberjacks:n");
    while(scanf("%d",&n)==1)
    {
        while(n--)
        {
            for(i=0;i<10;i++)
            {
                scanf("%d",&a[i]);
            }
            up=a[0];
            down=a[1];

            if(up>down)
            {
                c=0;
                for(i=0;i<9;i++)
                {
                if(a[i]>a[i+1])
                {
                c++;
                }
                }
            }
            else if(up<down)
            {
                c=0;
                for(i=0;i<9;i++)
                {
                if(a[i]<a[i+1])
                {
                c++;
                }
                }
            }

            if(c==9)
            printf("Orderedn");
            else
            printf("Unorderedn");

        }
    }
    return 0;
}

/*------------------------------------------------*/

//Uva Problem No: 11942

//Problem Name : Lumberjack Sequencing

//Type : Ad hoc.

//Author : Shipu Ahamed

//University : BUBT

//E-mail : shipuahamed01@gmail.com

/*--------------------------------------------*/

#include<stdio.h>

int main()

{

int n,c,i,a[15],up,down;

printf("Lumberjacks:n");

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

{

while(n--)

{

for(i=0;i<10;i++)

{

scanf("%d",&a[i]);

}

up=a[0];

down=a[1];

if(up>down)

{

c=0;

for(i=0;i<9;i++)

{

if(a[i]>a[i+1])

{

c++;

}

else if(up<down)

{

c=0;

for(i=0;i<9;i++)

{

if(a[i]<a[i+1])

{

c++;

}

if(c==9)

printf("Orderedn");

else

printf("Unorderedn");

}

return 0;

}

Dec

2012

Uva 12015 – Google is Feeling Lucky

Problem Link

Spoj Problem Link

Solution :-

/*------------------------------------------------*/
//Uva Problem No: 12015
//Problem Name  : Google is Feeling Lucky
//Type          : Ad hoc
//Author        : Shipu Ahamed
//University    : BUBT
//E-mail        : shipuahamed01@gmail.com
/*--------------------------------------------*/

#include<stdio.h>
#include<string.h>
int main()
{
    char a[1000],b[1000],c[1000],d[1000],e[1000],f[1000],
    g[1000],h[1000],i[1000],j[1000];
    int n,k[1000],max,p,t=1;
    while(scanf("%d",&n)==1)
    {
        while(n--)
        {
            scanf("%s%d",a,&k[0]);
            scanf("%s%d",b,&k[1]);
            scanf("%s%d",c,&k[2]);
            scanf("%s%d",d,&k[3]);
            scanf("%s%d",e,&k[4]);
            scanf("%s%d",f,&k[5]);
            scanf("%s%d",g,&k[6]);
            scanf("%s%d",h,&k[7]);
            scanf("%s%d",i,&k[8]);
            scanf("%s%d",j,&k[9]);
            max=0;
            for(p=0;p<10;p++)
            {
                if(k[p]>max)
                max=k[p];

            }
            printf("Case #%d:n",t++);
            for(p=0;p<10;p++)
            {
               if(k[p]==max)
               {
                   if(p==0)
                   puts(a);
                   if(p==1)
                   puts(b);
                   if(p==2)
                   puts(c);
                   if(p==3)
                   puts(d);
                   if(p==4)
                   puts(e);
                   if(p==5)
                   puts(f);
                   if(p==6)
                   puts(g);
                   if(p==7)
                   puts(h);
                   if(p==8)
                   puts(i);
                   if(p==9)
                   puts(j);
               }
            }
        }
    }
    return 0;
}

/*------------------------------------------------*/

//Uva Problem No: 12015

//Problem Name : Google is Feeling Lucky

//Type : Ad hoc

//Author : Shipu Ahamed

//University : BUBT

//E-mail : shipuahamed01@gmail.com

/*--------------------------------------------*/

#include<stdio.h>

#include<string.h>

int main()

{

char a[1000],b[1000],c[1000],d[1000],e[1000],f[1000],

g[1000],h[1000],i[1000],j[1000];

int n,k[1000],max,p,t=1;

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

{

while(n--)

{

scanf("%s%d",a,&k[0]);

scanf("%s%d",b,&k[1]);

scanf("%s%d",c,&k[2]);

scanf("%s%d",d,&k[3]);

scanf("%s%d",e,&k[4]);

scanf("%s%d",f,&k[5]);

scanf("%s%d",g,&k[6]);

scanf("%s%d",h,&k[7]);

scanf("%s%d",i,&k[8]);

scanf("%s%d",j,&k[9]);

max=0;

for(p=0;p<10;p++)

{

if(k[p]>max)

max=k[p];

}

printf("Case #%d:n",t++);

for(p=0;p<10;p++)

{

if(k[p]==max)

{

if(p==0)

puts(a);

if(p==1)

puts(b);

if(p==2)

puts(c);

if(p==3)

puts(d);

if(p==4)

puts(e);

if(p==5)

puts(f);

if(p==6)

puts(g);

if(p==7)

puts(h);

if(p==8)

puts(i);

if(p==9)

puts(j);

}

return 0;

}

Dec

2012

Uva 12136 – Schedule of a Married Man

Problem Link

Solution :-

/*------------------------------------------------*/
//Problem Setter: S.Manzoor, M. M. Rahman
//Uva Problem No: 12136
//Problem Name  : Schedule of a Married Man
//Type          : Ad hoc.
//Author        : Shipu Ahamed
//University    : BUBT
//E-mail        : shipuahamed01@gmail.com
/*--------------------------------------------*/

#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<bitset>
#include<string>
#include <sstream>
#include <fstream>
#include<cctype>
#include<cstring>
#include<cmath>
#include<algorithm>
#define pi 2*acos(0.0)
using namespace std;

int main()
{
    int test,t=0,h1,h2,h3,h4,m1,m2,m3,m4,no=0;
    char c;
    scanf("%d",&test);
    while(test--)
    {
        int a=0,b=0,c=0,d=0;
        scanf("%d%:%d%d:%d",&h1,&m1,&h2,&m2);
        scanf("%d:%d%d:%d",&h3,&m3,&h4,&m4);
        a=(h1*60)+m1;
        b=(h2*60)+m2;
        c=(h3*60)+m3;
        d=(h4*60)+m4;
        if(h1<a&&d<a)
        {
            if(c<b)
            printf("Case %d: Hits Meetingn",++no);
            else
            printf("Case %d: Mrs Meetingn",++no);
        }
        else if(c>a&&d>a)
        {
            if(c>b)
            printf("Case %d: Hits Meetingn",++no);
            else
            printf("Case %d: Mrs Meetingn",++no);
        }
        else
        printf("Case %d: Mrs Meetingn",++no);

    }
    return 0;
}

/*------------------------------------------------*/

//Problem Setter: S.Manzoor, M. M. Rahman

//Uva Problem No: 12136

//Problem Name : Schedule of a Married Man

//Type : Ad hoc.

//Author : Shipu Ahamed

//University : BUBT

//E-mail : shipuahamed01@gmail.com

/*--------------------------------------------*/

#include<cstdio>

#include<iostream>

#include<vector>

#include<map>

#include<stack>

#include<queue>

#include<bitset>

#include<string>

#include <sstream>

#include <fstream>

#include<cctype>

#include<cstring>

#include<cmath>

#include<algorithm>

#define pi 2*acos(0.0)

using namespace std;

int main()

{

int test,t=0,h1,h2,h3,h4,m1,m2,m3,m4,no=0;

char c;

scanf("%d",&test);

while(test--)

{

int a=0,b=0,c=0,d=0;

scanf("%d%:%d%d:%d",&h1,&m1,&h2,&m2);

scanf("%d:%d%d:%d",&h3,&m3,&h4,&m4);

a=(h1*60)+m1;

b=(h2*60)+m2;

c=(h3*60)+m3;

d=(h4*60)+m4;

if(h1<a&&d<a)

{

if(c<b)

printf("Case %d: Hits Meetingn",++no);

else

printf("Case %d: Mrs Meetingn",++no);

}

else if(c>a&&d>a)

{

if(c>b)

printf("Case %d: Hits Meetingn",++no);

else

printf("Case %d: Mrs Meetingn",++no);

}

else

printf("Case %d: Mrs Meetingn",++no);

}

return 0;

}

Dec

2012

Uva 12554 – A Special “Happy Birthday” Song!!!

Problem Link

Solution :-

/*----------------------------------------------------*/
//Problem Setter: Rujia Liu
//Uva Problem No: 12554
//Problem Name  : A Special "Happy Birthday" Song!!!
//Type          : Ad hoc.
//Author        : Shipu Ahamed
//University    : BUBT
//E-mail        : shipuahamed01@gmail.com
/*---------------------------------------------------*/

#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<iostream>
#include<cctype>
#include<map>
#include<stack>
#include<cstdlib>
#include <queue>
#include <vector>
#include<algorithm>
#define ll long long
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
using namespace std;
int main()
{
    int n,p;
    char s[100][100];
    char c[16][100]={"Happy","birthday","to","you","Happy","birthday",
    "to","you","Happy","birthday","to","Rujia","Happy","birthday","to","you"};
    while(sc("%d",&n)==1)
    {
        int k=0,p=1;
        for(int i=0;i<n;i++)
        sc("%s",s[i]);
        if(n>16)
        p=ceil(n/16)+1;
        for(int j=0,i=0;j<16*p;j++,i++,k++)
        {
            if(i==n)
            i=0;
            if(j==16)
            k=0;
            pf("%s: %sn",s[i],c[k]);
        }
    }
    return 0;
}

/*----------------------------------------------------*/

//Problem Setter: Rujia Liu

//Uva Problem No: 12554

//Problem Name : A Special "Happy Birthday" Song!!!

//Type : Ad hoc.

//Author : Shipu Ahamed

//University : BUBT

//E-mail : shipuahamed01@gmail.com

/*---------------------------------------------------*/

#include<cstdio>

#include<cstring>

#include<string>

#include<cmath>

#include<iostream>

#include<cctype>

#include<map>

#include<stack>

#include<cstdlib>

#include <queue>

#include <vector>

#include<algorithm>

#define ll long long

#define sc scanf

#define pf printf

#define Pi 2*acos(0.0)

using namespace std;

int main()

{

int n,p;

char s[100][100];

char c[16][100]={"Happy","birthday","to","you","Happy","birthday",

"to","you","Happy","birthday","to","Rujia","Happy","birthday","to","you"};

while(sc("%d",&n)==1)

{

int k=0,p=1;

for(int i=0;i<n;i++)

sc("%s",s[i]);

if(n>16)

p=ceil(n/16)+1;

for(int j=0,i=0;j<16*p;j++,i++,k++)

{

if(i==n)

i=0;

if(j==16)

k=0;

pf("%s: %sn",s[i],c[k]);

}

return 0;

}

Dec

2012

Uva 10921 – Find the Telephone

Problem Link

Solution :-

/*------------------------------------------------*/
//Problem Setter: S�rgio Queiroz de Medeiros
//Uva Problem No: 10921
//Problem Name  : Find the Telephone
//Type          : Ad hoc
//Author        : Shipu Ahamed
//University    : BUBT
//E-mail        : shipuahamed01@gmail.com
/*-----------------------------------------------*/

#include<stdio.h>
#include<string.h>
int main()
{
    char s[50],l;
    int i,j;
    while(scanf("%s",&s)==1)
    {
        l=strlen(s);
        for(i=0;i<l;i++)
        {
        if((s[i]=='A')||(s[i]=='B')||(s[i]=='C'))
        printf("2");
        else if((s[i]=='D')||(s[i]=='E')||(s[i]=='F'))
        printf("3");
        else if((s[i]=='G')||(s[i]=='H')||(s[i]=='I'))
        printf("4");
        else if((s[i]=='J')||(s[i]=='K')||(s[i]=='L'))
        printf("5");
        else if((s[i]=='M')||(s[i]=='N')||(s[i]=='O'))
        printf("6");
        else if((s[i]=='P')||(s[i]=='Q')||(s[i]=='R')||(s[i]=='S'))
        printf("7");
        else if((s[i]=='T')||(s[i]=='U')||(s[i]=='V'))
        printf("8");
        else if((s[i]=='W')||(s[i]=='X')||(s[i]=='Y')||(s[i]=='Z'))
        printf("9");
        else
        printf("%c",s[i]);
        }
        printf("n");
        }

return 0;
}

/*------------------------------------------------*/

//Problem Setter: S�rgio Queiroz de Medeiros

//Uva Problem No: 10921

//Problem Name : Find the Telephone

//Type : Ad hoc

//Author : Shipu Ahamed

//University : BUBT

//E-mail : shipuahamed01@gmail.com

/*-----------------------------------------------*/

#include<stdio.h>

#include<string.h>

int main()

{

char s[50],l;

int i,j;

while(scanf("%s",&s)==1)

{

l=strlen(s);

for(i=0;i<l;i++)

{

if((s[i]=='A')||(s[i]=='B')||(s[i]=='C'))

printf("2");

else if((s[i]=='D')||(s[i]=='E')||(s[i]=='F'))

printf("3");

else if((s[i]=='G')||(s[i]=='H')||(s[i]=='I'))

printf("4");

else if((s[i]=='J')||(s[i]=='K')||(s[i]=='L'))

printf("5");

else if((s[i]=='M')||(s[i]=='N')||(s[i]=='O'))

printf("6");

else if((s[i]=='P')||(s[i]=='Q')||(s[i]=='R')||(s[i]=='S'))

printf("7");

else if((s[i]=='T')||(s[i]=='U')||(s[i]=='V'))

printf("8");

else if((s[i]=='W')||(s[i]=='X')||(s[i]=='Y')||(s[i]=='Z'))

printf("9");

else

printf("%c",s[i]);

}

printf("n");

}

return 0;

}

Dec

2012

Uva 10424 – Love Calculator

Problem Link

Solution :-

/*------------------------------------------------*/
//Problem Setter: Niaz Morshed Chowdhury (Shanto)
//Uva Problem No: 10424
//Problem Name  : Love Calculator
//Type          : Ad hoc
//Author        : Shipu Ahamed
//University    : BUBT
//E-mail        : shipuahamed01@gmail.com
/*------------------------------------------------*/

#include<stdio.h>
#include<string.h>
int main()
{
    char n1[30],n2[30];
    int i,l1,l2,t1,t2,s1,s2;
    float s;
    while(gets(n1))
    {
        gets(n2);
        l1=strlen(n1);
        l2=strlen(n2);
        t1=0;
        for(i=0;i<l1;i++)
        {
            if(n1[i]>='a'&&n1[i]<='z')
            t1+=n1[i]-96;
            else if(n1[i]>='A'&&n1[i]<='Z')
            t1+=n1[i]-64;
        }
        s1=0;
        while(t1!=0)
        {
            s1+=t1%10;
            t1/=10;
        }
            if(s1>9)
            {
              t1=s1;
              s1=0;
                while(t1!=0)
                {
                    s1+=t1%10;
                    t1/=10;
                }
            }
        t2=0;
        for(i=0;i<l2;i++)
        {
            if(n2[i]>='a'&&n2[i]<='z')
            t2+=n2[i]-96;
            else if(n2[i]>='A'&&n2[i]<='Z')
            t2+=n2[i]-64;
        }
        s2=0;
        while(t2!=0)
        {
            s2+=t2%10;
            t2/=10;
        }
            if(s2>9)
            {
              t2=s2;
              s2=0;
                while(t2!=0)
                {
                    s2+=t2%10;
                    t2/=10;
                }
            }
        if(s1>s2)
        s=(float)s2*100/(float)s1;
        else
        s=(float)s1*100/(float)s2;
        printf("%0.2f %%n",s);
    }
}

/*------------------------------------------------*/

//Problem Setter: Niaz Morshed Chowdhury (Shanto)

//Uva Problem No: 10424

//Problem Name : Love Calculator

//Type : Ad hoc

//Author : Shipu Ahamed

//University : BUBT

//E-mail : shipuahamed01@gmail.com

/*------------------------------------------------*/

#include<stdio.h>

#include<string.h>

int main()

{

char n1[30],n2[30];

int i,l1,l2,t1,t2,s1,s2;

float s;

while(gets(n1))

{

gets(n2);

l1=strlen(n1);

l2=strlen(n2);

t1=0;

for(i=0;i<l1;i++)

{

if(n1[i]>='a'&&n1[i]<='z')

t1+=n1[i]-96;

else if(n1[i]>='A'&&n1[i]<='Z')

t1+=n1[i]-64;

}

s1=0;

while(t1!=0)

{

s1+=t1%10;

t1/=10;

}

if(s1>9)

{

t1=s1;

s1=0;

while(t1!=0)

{

s1+=t1%10;

t1/=10;

}

t2=0;

for(i=0;i<l2;i++)

{

if(n2[i]>='a'&&n2[i]<='z')

t2+=n2[i]-96;

else if(n2[i]>='A'&&n2[i]<='Z')

t2+=n2[i]-64;

}

s2=0;

while(t2!=0)

{

s2+=t2%10;

t2/=10;

}

if(s2>9)

{

t2=s2;

s2=0;

while(t2!=0)

{

s2+=t2%10;

t2/=10;

}

if(s1>s2)

s=(float)s2*100/(float)s1;

else

s=(float)s1*100/(float)s2;

printf("%0.2f %%n",s);

}

Month: December 2012

Uva 11777 – Automate the Grades

Problem Link

Solution :-

Uva 11875 – Brick Game

Problem Link

Solution :-

Uva 11878 – Homework Checker

Problem Link

Solution :-

Uva 11879 – Multiple of 17

Problem Link

Solution :-

Uva 11942 – Lumberjack Sequencing

Problem Link

Solution :-

Uva 12015 – Google is Feeling Lucky

Problem Link

Spoj Problem Link

Solution :-

Uva 12136 – Schedule of a Married Man

Problem Link

Solution :-

Uva 12554 – A Special “Happy Birthday” Song!!!

Problem Link

Solution :-

Uva 10921 – Find the Telephone

Problem Link

Solution :-

Uva 10424 – Love Calculator

Problem Link

Solution :-

Subscription + Connect with:

Shipu’s Blog on Facebook

Top Posts & Pages

Archives

Recent comments

Subscribe to Blog via Email