10035 - Primary Arithmetic

/***

            Bismillahir Rahmanir Rahim
            Read the name of Allah, who created you!!!
            Author : Shah Newaj Rabbi Shishir
            Department of CSE, City University, Bangladesh.

***/

#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define scase sf ("%d",&tc)
#define sn sf ("%d",&n)
#define whilecase while (tc--)
#define eof while (cin >> n)
#define forloop for (pos=1; pos<=tc; pos++)
#define arrayloop (i=0; i<n; i++)
#define cinstr cin >> str
#define getstr getline (cin,str)
#define pcase pf ("Case %d: ",pos)
#define pii pair <int,int>
#define pb push_back
#define in insert
#define llu unsigned long long
#define lld long long
#define U unsigned int
#define endl "\n"

const int MOD = 1000000007;
const int MAX = 1000005;

int main (void)
{
    /*
    freopen ("input.txt","r",stdin);
    freopen ("output.txt","w",stdout);
    */

    int len,i,d,c,carry,sum;
    string a,b;

    while (cin >> a >> b)
    {
        string x;

        if (a == "0" && b == "0")
            break;

        if (a.length() > b.length())
        {
            d = a.length()-b.length();

            while (d--)
                x += "0";

            b = x + b;
        }
        else if (a.length() < b.length())
        {
            d = b.length()-a.length();

            while (d--)
                x += "0";

            a = x + a;
        }

        len = a.length(), c = carry = 0;

        for (i=len-1; i>=0; i--)
        {
            sum = (a[i]-'0') + (b[i]-'0') + carry;

            if (sum >= 10)
            {
                ++c;
                carry = 1;
            }
            else
                carry = 0;
        }

        if (c == 0)
            pf ("No carry operation.\n");
        else if (c == 1)
            pf ("1 carry operation.\n");
        else
            pf ("%d carry operations.\n",c);
    }

    return 0;
}

10323 - Factorial! You Must be Kidding!!!

/***

            Bismillahir Rahmanir Rahim
            Read the name of Allah, who created you!!!
            Author : Shah Newaj Rabbi Shishir
            Department of CSE, City University, Bangladesh.

***/

#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define scase sf ("%d",&tc)
#define sn sf ("%d",&n)
#define whilecase while (tc--)
#define eof while (cin >> n)
#define forloop for (pos=1; pos<=tc; pos++)
#define arrayloop (i=0; i<n; i++)
#define cinstr cin >> str
#define getstr getline (cin,str)
#define pcase pf ("Case %d: ",pos)
#define pii pair <int,int>
#define pb push_back
#define in insert
#define llu unsigned long long
#define lld long long
#define U unsigned int
#define endl "\n"

const int MOD = 1000000007;
const int MAX = 1000005;

int main (void)
{
    /*
    freopen ("input.txt","r",stdin);
    freopen ("output.txt","w",stdout);
    */

    lld n,fact,i;

    while (sf ("%lld",&n) != EOF)
    {
        if (n < 0)
        {
            if (n & 1)
                pf ("Overflow!\n");
            else
                pf ("Underflow!\n");
        }
        else
        {
            if (n >= 0 && n <= 7)
                pf ("Underflow!\n");
            else if (n >= 8 && n <= 13)
            {
                fact = 1;

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

                pf ("%lld\n",fact);
            }
            else
                pf ("Overflow!\n");
        }
    }

    return 0;
}

494 - Kindergarten Counting Game

/***

            Bismillahir Rahmanir Rahim
            Read the name of Allah, who created you!!!
            Author : Shah Newaj Rabbi Shishir
            Department of CSE, City University, Bangladesh.

***/

#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define scase sf ("%d",&tc)
#define sn sf ("%d",&n)
#define whilecase while (tc--)
#define eof while (cin >> n)
#define forloop for (pos=1; pos<=tc; pos++)
#define arrayloop (i=0; i<n; i++)
#define cinstr cin >> str
#define getstr getline (cin,str)
#define pcase pf ("Case %d: ",pos)
#define pii pair <int,int>
#define pb push_back
#define in insert
#define llu unsigned long long
#define lld long long
#define U unsigned int
#define endl "\n"

const int MOD = 1000000007;
const int MAX = 1000005;

int main (void)
{
    /*
    freopen ("input.txt","r",stdin);
    freopen ("output.txt","w",stdout);
    */

    char str[1000];
    int i,len,c;
    bool k;

    while (gets(str))
    {
        len = strlen(str);
        c = 0;

        for (i=0; i<len; i++)
        {
            if (i == len-1)
                if (isalpha(str[i]))
                    ++c;

            if (isalpha(str[i]))
                k = true;

            if (!isalpha(str[i]) && k)
            {
                ++c;
                k = false;
            }
        }

        pf ("%d\n",c);
    }

    return 0;
}

914 - Jumping Champion

/***

            Bismillahir Rahmanir Rahim
            Read the name of Allah, who created you!!!
            Author : Shah Newaj Rabbi Shishir
            Department of CSE, City University, Bangladesh.

***/

#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define scase sf ("%d",&tc)
#define sn sf ("%d",&n)
#define whilecase while (tc--)
#define eof while (cin >> n)
#define forloop for (pos=1; pos<=tc; pos++)
#define arrayloop (i=0; i<n; i++)
#define cinstr cin >> str
#define getstr getline (cin,str)
#define pcase pf ("Case %d: ",pos)
#define pb push_back
#define in insert
#define llu unsigned long long
#define lld long long
#define U unsigned int

const int MAX = 1000005;
bool prime[MAX];
vector <int> v;

void sieve ()
{
    int i,j;

    v.pb(2);
    prime[0] = prime[1] = true;

    for (i=4; i<=MAX; i+=2)
        prime[i] = true;

    for (i=3; i*i<=MAX; i+=2)
        if (!prime[i])
            for (j=i*i; j<=MAX; j+=2*i)
                prime[j] = true;

    for (i=3; i<MAX; i+=2)
        if (!prime[i])
            v.pb(i);
}

int main (void)
{
    /*freopen ("input.txt","r",stdin);
    freopen ("output.txt","w",stdout);*/

    sieve ();

    int tc,l,u,i,len,d,mx,k,ans,x;

    sf ("%d",&tc);

    while (tc--)
    {
        sf ("%d %d",&l,&u);

        vector <int> F;

        if (l <= 2)
        {
            F.pb(2);
            l = 3;
        }

        if (!(l & 1))
            ++l;

        if (!(u & 1))
            --u;

        for (i=l; i<=u; i+=2)
            if (!prime[i])
                F.pb(i);

        len = F.size();

        if (len < 2)
            pf ("No jumping champion\n");
        else if (len == 2)
            pf ("The jumping champion is %d\n",F[1]-F[0]);
        else
        {
            map <int,int> mp;
            map <int,int> :: iterator it;

            for (i=1; i<len; i++)
            {
                d = F[i]-F[i-1];
                mp[d]++;
            }

            mx = k = ans = x = 0;
            len = mp.size();

            for (it=mp.begin(); it!=mp.end(); ++it)
            {
                if (it->second == 1)
                    ++k;

                if (it->second > mx)
                {
                    mx = it->second;
                    ans = it->first;
                }
            }

            for (it=mp.begin(); it!=mp.end(); ++it)
                if (it->second == mx)
                    ++x;

            if (k == len || x > 1)
                pf ("No jumping champion\n");
            else
                pf ("The jumping champion is %d\n",ans);
        }
    }

    return 0;
}

877A. Alex and broken contest

/***

            Bismillahir Rahmanir Rahim
            Read the name of Allah, who created you!!!
            Author : Shah Newaj Rabbi Shishir
            Department of CSE, City University, Bangladesh.

***/

#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define scase sf ("%d",&tc)
#define sn sf ("%d",&n)
#define whilecase while (tc--)
#define eof while (cin >> n)
#define forloop for (pos=1; pos<=tc; pos++)
#define arrayloop (i=0; i<n; i++)
#define cinstr cin >> str
#define getstr getline (cin,str)
#define pcase pf ("Case %d: ",pos)
#define pii pair <int,int>
#define pb push_back
#define in insert
#define llu unsigned long long
#define lld long long
#define U unsigned int
#define endl "\n"

const int MOD = 1000000007;
const int MAX = 1000005;

int main (void)
{
    /*
    freopen ("input.txt","r",stdin);
    freopen ("output.txt","w",stdout);
    */
    char str[105];
    int len,i,k;

    while (sf("%s",str) != EOF)
    {
        k = 0;
        len = strlen(str);

        for (i=0; i<len; i++)
        {
            if (str[i] == '_')
                continue;

            if (str[i] == 'D' && str[i+1] == 'a' && str[i+2] == 'n' && str[i+3] == 'i' && str[i+4] == 'l')
            {
                i += 4;
                ++k;
            }
            else if (str[i] == 'O' && str[i+1] == 'l' && str[i+2] == 'y' && str[i+3] == 'a')
            {
                i += 3;
                ++k;
            }
            else if (str[i] == 'S' && str[i+1] == 'l' && str[i+2] == 'a' && str[i+3] == 'v' && str[i+4] == 'a')
            {
                i += 4;
                ++k;
            }
            else if (str[i] == 'A' && str[i+1] == 'n' && str[i+2] == 'n')
            {
                i += 2;
                ++k;
            }
            else if (str[i] == 'N' && str[i+1] == 'i' && str[i+2] == 'k' && str[i+3] == 'i' && str[i+4] == 't' && str[i+5] == 'a')
            {
                i += 5;
                ++k;
            }
        }

        if (k == 1)
            pf ("YES\n");
        else
            pf ("NO\n");
    }

    return 0;
}