Page 49 of 66

UVa – 12626 – I love Pizza

Arunima Mandal Leave a comment 
#include <iostream>
#include <string>

using namespace std;

int main()
{
    int i,j,t,s_l,a,b,c,d,e,f,g,x;
    string s;
    cin>>t;
    for(i=0;i<t;i++)
    {
        cin>>s;
        a=0;
        b=0;
        c=0;
        d=0;
        e=0;
        f=0;
        g=0;

        s_l=s.length();
        for(j=0;j<s_l;j++)
        {
            if(s[j]=='M')
            {
                a++;
            }
        }
        for(j=0;j<s_l;j++)
        {
            if(s[j]=='A')
            {
                b++;
            }
        }
        for(j=0;j<s_l;j++)
        {
            if(s[j]=='R')
            {
                c++;
            }
        }
        for(j=0;j<s_l;j++)
        {
            if(s[j]=='G')
            {
                d++;
            }
        }
        for(j=0;j<s_l;j++)
        {
            if(s[j]=='I')
            {
                e++;
            }
        }
        for(j=0;j<s_l;j++)
        {
            if(s[j]=='T')
            {
                f++;
            }
        }
        x=0;
        for(j=1;;j++)
        {
            if(a>=1*j && b>=3*j && c>=2*j && d>=1*j && e>=1*j && f>=1*j)
            {
                x++;
            }
            else
            {
                break;
            }
        }
        cout<<x<<endl;
    }
    return 0;
}

UVa – 12577 – Hajj-e-Akbar

Leave a comment 
#include <iostream>
#include <string>

using namespace std;

int main()
{
    int i;
    string s1;
    for(i=1;;i++)
    {
        cin>>s1;
        if(s1=="*")
        {
            break;
        }
        else
        {
            if(s1=="Hajj")
            {
                cout<< "Case " << i << ": " << "Hajj-e-Akbar"<<endl;
            }
            else if(s1=="Umrah")
            {
               cout<< "Case " << i << ": " << "Hajj-e-Asghar"<<endl;
            }
        }

    }
    return 0;
}

UVa – 12243 – Flowers Flourish from France

Arunima Mandal Leave a comment 
#include <bits/stdc++.h>

#define ms(a,b)         memset(a,b,sizeof(a))
#define pb(a)           push_back(a)
#define db              double
#define ft              float
#define ll              long long
#define ull             unsigned long long
#define ff              first
#define ss              second
#define sz(x)           x.size()
#define qu              queue
#define pqu             priority_queue
#define vc              vector
#define vi              vector<int>
#define vll             vector<long long>
#define pii             pair<int,int>
#define pis             pair<int,string>
#define psi             pair<string,int>
#define all(x)          x.begin(),x.end()
#define CIN             ios_base::sync_with_stdio(0); cin.tie(0)
#define loop0(i,n)      for(int i=0;i<n;i++)
#define loop1(i,n)      for(int i=1;i<=n;i++)
#define stlloop(x)     for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b)       __gcd(a, b)
#define lcm(a, b)       ((a)*((b)/gcd(a,b)))
#define case(z,x)       cout<<"Case "<<i<<": "<<x<<endl
#define case(z)         cout<<"Case "<<z<<": "
#define PI              3.14159265358979323846264338328
#define valid(tx,ty)    tx>=0 && tx<r && ty>=0 && ty<c
#define MAX             2000

/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

using namespace std;

int main()
{
    //CIN;
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

    string s;
    while(getline(cin,s) && s!="*")
    {
        bool c=1;
        char ch=tolower(s[0]);
        loop0(i,sz(s))
        {
            if(s[i]==' ')
            {
                if(s[i+1]==' ')
                    continue;
                if(tolower(s[i+1])!=ch)
                {
                    c=0;
                    break;
                }
            }
        }
        if(c)
            cout<<"Y"<<endl;
        else
            cout<<"N"<<endl;
    }

    return 0;
}

UVa – 10921 – Find the telephone

Arunima Mandal Leave a comment 
#include <bits/stdc++.h>

#define ms(a,b)         memset(a,b,sizeof(a))
#define pb(a)           push_back(a)
#define db              double
#define ft              float
#define ll              long long
#define ull             unsigned long long
#define ff              first
#define ss              second
#define sz(x)           x.size()
#define qu              queue
#define pqu             priority_queue
#define vc              vector
#define vi              vector<int>
#define vll             vector<long long>
#define pii             pair<int,int>
#define pis             pair<int,string>
#define psi             pair<string,int>
#define all(x)          x.begin(),x.end()
#define CIN             ios_base::sync_with_stdio(0); cin.tie(0)
#define loop0(i,n)      for(int i=0;i<n;i++)
#define loop1(i,n)      for(int i=1;i<=n;i++)
#define stlloop(x)     for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b)       __gcd(a, b)
#define lcm(a, b)       ((a)*((b)/gcd(a,b)))
#define case(z,x)       cout<<"Case "<<i<<": "<<x<<endl
#define case(z)         cout<<"Case "<<z<<": "
#define PI              3.14159265358979323846264338328
#define valid(tx,ty)    tx>=0 && tx<r && ty>=0 && ty<c
#define MAX             2000

/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

using namespace std;

int main()
{
    CIN;
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

    string s,str;
    while(cin>>s)
    {
        loop0(i,sz(s))
        {
            if(s[i]>='A' && s[i]<='C')
            {
                str+='2';
            }
            else if(s[i]>='D' && s[i]<='F')
            {
                str+='3';
            }
            else if(s[i]>='G' && s[i]<='I')
            {
                str+='4';
            }
            else if(s[i]>='J' && s[i]<='L')
            {
                str+='5';
            }
            else if(s[i]>='M' && s[i]<='O')
            {
                str+='6';
            }
            else if(s[i]>='P' && s[i]<='S')
            {
                str+='7';
            }
            else if(s[i]>='T' && s[i]<='V')
            {
                str+='8';
            }
            else if(s[i]>='W' && s[i]<='Z')
            {
                str+='9';
            }
            else
            {
                str+=s[i];
            }
        }
        cout<<str<<endl;
        str.clear();
    }
    return 0;
}

UVa – 11734 – Big number of teams will solve this

Arunima Mandal Leave a comment 
#include <bits/stdc++.h>

#define ms(a,b)         memset(a,b,sizeof(a))
#define pb(a)           push_back(a)
#define db              double
#define ft              float
#define ll              long long
#define ull             unsigned long long
#define ff              first
#define ss              second
#define sz(x)           x.size()
#define qu              queue
#define pqu             priority_queue
#define vc              vector
#define vi              vector<int>
#define vll             vector<long long>
#define pii             pair<int,int>
#define pis             pair<int,string>
#define psi             pair<string,int>
#define all(x)          x.begin(),x.end()
#define CIN             ios_base::sync_with_stdio(0); cin.tie(0)
#define loop0(i,n)      for(int i=0;i<n;i++)
#define loop1(i,n)      for(int i=1;i<=n;i++)
#define stlloop(x)     for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b)       __gcd(a, b)
#define lcm(a, b)       ((a)*((b)/gcd(a,b)))
#define case(z,x)       cout<<"Case "<<i<<": "<<x<<endl
#define case(z)         cout<<"Case "<<z<<": "
#define PI              3.14159265358979323846264338328
#define valid(nx,ny)    nx>=0 && nx<r && ny>=0 && ny<c
#define MAX             2000

/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

using namespace std;

int main()
{
//    CIN;
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

    int t;
    cin>>t;
    loop1(z,t)
    {
        getchar();
        string s1,s2;
        getline(cin,s1);
        cin>>s2;
        string s3;
        loop0(i,sz(s1))
        {
            if(s1[i]!=' ') s3+=s1[i];
        }
        case(z);
        if(s1==s2)
            cout<<"Yes"<<endl;
        else if(s2==s3)
            cout<<"Output Format Error"<<endl;
        else
            cout<<"Wrong Answer"<<endl;
    }

    return 0;
}