1006 - Hex-a-bonacci

#include<iostream>
#include<stdio.h>
using namespace std;
 
int main()
{
    long long int a,b,c,d,e,f,n,fn[10050],caseno=1,cases;
    scanf("%lld",&cases);
    while(cases--)
    {
        scanf("%lld%lld%lld%lld%lld%lld%lld",&fn[0],&fn[1],&fn[2],&fn[3],&fn[4],&fn[5],&n);
        for(int i=6; i<=n; i++)
            fn[i]=(fn[i-1]+fn[i-2]+fn[i-3]+fn[i-4]+fn[i-5]+fn[i-6])%10000007;
        printf("Case %lld: %lld\n",caseno++,fn[n]%10000007);
    }
 
    return 0;
}

1001 - Opposite Task

#include<iostream>
#include<stdio.h>
using namespace std;
 
int main()
{
    int T,n;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        if(n>10)
            printf("10 %d\n",n-10);
        else
            printf("0 %d\n",n);
    }
    return 0;
}

1000 - Greetings from LightOJ

#include<stdio.h>

int main(void)
{
    int T,a,b,count=0;
    scanf("%d",&T);

    while(T-->0  && (scanf("%d%d",&a,&b)!=EOF))
    {
        if(a<=10 && a>=0 && b<=10 && b>=0)
       {
           count++;
           printf("Case %d: %d\n",count,a+b);
       }
    }
    return 0;
}

11831 - Sticker Collector Robot

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>
using namespace std;

typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;

int main()
{
    freopen("11831 - Sticker Collector Robot.txt","r", stdin);
    int n,m,s,i,j,si,sj,c;
    while(scanf("%d %d %d", &n, &m, &s) && (n || m || s))
    {
        char cell[110][110],d;
        string instruct;
        for(i=0; i<n; i++)
            cin >> cell[i];
        bool flag = false;
        for(i=0; i<n; i++)
        {
            for(j=0; j<m; j++)
                if(cell[i][j] == 'N' || cell[i][j] == 'S' || cell[i][j] == 'L' || cell[i][j] == 'O')
                {
                    si=i;
                    sj=j;
                    d = cell[i][j];
                    flag = true;
                    break;
                }
            if(flag)
                break;
        }
        cin >> instruct;
        c = 0;
        for(i=0; i<s; i++)
        {
            if(instruct[i] == 'D')
            {
                if(d == 'N')
                    d = 'L';
                else if(d == 'S')
                    d = 'O';
                else if(d == 'L')
                    d = 'S';
                else if(d == 'O')
                    d = 'N';
            }
            else if(instruct[i] == 'E')
            {
                if(d == 'N')
                    d = 'O';
                else if(d == 'S')
                    d = 'L';
                else if(d == 'L')
                    d = 'N';
                else if(d == 'O')
                    d = 'S';
            }
            else
            {
                if(d == 'N' && si != 0)
                {
                    if(cell[si-1][sj] != '#')
                        si--;
                    if(cell[si][sj] == '*')
                    {
                        c++;
                        cell[si][sj] = '.';
                    }
                }
                else if(d == 'S' && si != n-1)
                {
                    if(cell[si+1][sj] != '#')
                        si++;
                    if(cell[si][sj] == '*')
                    {
                        c++;
                        cell[si][sj] = '.';
                    }
                }
                else if(d == 'L' && sj != m-1)
                {
                    if(cell[si][sj+1] != '#')
                        sj++;
                    if(cell[si][sj] == '*')
                    {
                        c++;
                        cell[si][sj] = '.';
                    }
                }
                if(d == 'O' && sj != 0)
                {
                    if(cell[si][sj-1] != '#')
                        sj--;
                    if(cell[si][sj] == '*')
                    {
                        c++;
                        cell[si][sj] = '.';
                    }
                }
            }
        }
        printf("%d\n",c);
    }
    return 0;
}

146 - ID Codes

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

int main()
{
    string s;
    while(cin >> s)
    {
        if(s == "#")
            break;
        if(next_permutation(s.begin(),s.end()))
            cout << s << endl;
        else
            cout << "No Successor" << endl;
    }
    return 0;
}

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;
}