12157 Tarif Plan

#include<iostream>
using namespace std;

int main()
{
    int T,N,a,Mile,Juice,c=1;
    cin >> T;
    while(T--)
    {
        Mile = 0;
        Juice = 0;
        cin >> N;
        while(N--)
        {
            cin >> a;
            if((a+1)%30==0)
                Mile+=(a+1)/30*10;
            else
                Mile+=((a+1)/30+1)*10;
            if((a+1)%60==0)
                Juice+=(a+1)/60*15;
            else
                Juice+=((a+1)/60+1)*15;
        }
        if(Mile<Juice)
            cout << "Case " << c++ << ": Mile " << Mile;
        else if(Juice<Mile)
            cout << "Case " << c++ << ": Juice " << Juice;
        else
            cout << "Case " << c++ << ": Mile Juice " << Mile;

        cout << "\n";
    }
    return 0;
}

12289 - One-Two-Three

#include<iostream>
#include<string>

using namespace std;

int main()
{
    int n;
    string letter;
    cin >> n;
    while(n--)
    {
        cin >> letter;
        if(letter.length()==5)
            cout << 3;
        else if((letter[0]=='o'&&letter[1]=='n')||(letter[1]=='n'&&letter[2]=='e')||(letter[0]=='o'&&letter[2]=='e'))
            cout << 1;
        else
            cout << 2;
        cout << "\n";
    }
    return 0;
}

10189 - Minesweeper

#include <iostream>
using namespace std;
int main()
{
    int m,n,i,j,c,a=1;
    cin >> m >> n;
    while(1)
    {
        if(m==0 && n==0)
            break;
        char str[m+1][n+1];
        for(i=1; i<=m; i++)
            for(j=1; j<=n; j++)
                cin >> str[i][j];
        cout << "Field #" << a++ <<":\n";
        for(i=1; i<=m; i++)
        {
            for(j=1; j<=n; j++)
            {
                if(str[i][j]=='*')
                {
                    cout << "*";
                    continue;
                }
                c=0;
                if(i-1>0 && j-1>0)
                    if(str[i-1][j-1]== '*')
                        c++;
                if(i-1>0)
                    if(str[i-1][j]== '*')
                        c++;
                if(i-1>0 && j+1<=n)
                    if(str[i-1][j+1]== '*')
                        c++;
                if(j-1>0)
                    if(str[i][j-1]== '*')
                        c++;
                if(j+1<=n)
                    if(str[i][j+1]== '*')
                        c++;
                if(i+1<=m && j-1>0)
                    if(str[i+1][j-1]== '*')
                        c++;
                if(i+1<=m )
                    if(str[i+1][j]== '*')
                        c++;
                if(i+1<= m && j+1<=n)
                    if(str[i+1][j+1]== '*')
                        c++;
                cout << c ;
            }
            cout << endl;
        }
        cin >> m >> n;
        if(m!=0 && n!=0)
            cout << endl;
    }
    return 0;
}

10035 - Primary Arithmetic

#include <cstdio>
using namespace std;
int main()
{
    unsigned long int m,n;
    int c,d;
    while(1)
    {
        scanf("%lu%lu",&m,&n);
        if(m==0&&n==0)
            break;
        c=0;
        d=0;
        while(1)
        {
            if((m%10+n%10+d) >= 10)
            {
                c++;
                d=1;
            }
            else
                d=0;
            m/=10;
            n/=10;
            if(m<10&&n<10)
            {
                if((m+n+d) >= 10)
                    c++;
                break;
            }
        }
        if(c==0)
            printf("No carry operation.");
        else if(c==1)
            printf("1 carry operation.");
        else
            printf("%d carry operations.",c);
        printf("\n");
    }
    return 0;
}