Форум Всеукраїнської інтернет-олімпіади NetOI

#include <iostream>

using namespace std;

unsigned long long int a, b, result = 0;
short int c[18];
short int numbers = 0;

int rekuw_pow(short int number, short int power);

int main()
{
    //cout << "Input numbers: ";
    cin >> a >> b;

    for(short int i = 0; b != 0; i++, b=b/10)
    {
        c[i] = b%10;
        numbers++;
    }

    for(short int j = 0; j < numbers; j++)
    {
    //    cout << c[j];
    }
    //cout << endl;

    for(short int n = 2; n < 10; n++)
    {
        result = 0;
        //cout << "For module " << n << endl;
        for(short int i = numbers-1, j=1; i >= 0; i--, j++)
        {
            result = result + c[i] * rekuw_pow(n, numbers-j);
            //cout << c[i] * rekuw_pow(n, numbers-j) << " ";
        }
        //cout << endl;
        if(result == a)
        {
            cout //<< endl 
                << n;
            break;
        }
    }

    return 0;
}

int rekuw_pow(short int number, short int power)
{
    unsigned long long int tempNum = 1;
    for(int i = 0; i < power; i++)
    {
        tempNum = tempNum * number;
    }
    return tempNum;
}

#include <iostream>

using namespace std;

int main()
{
    int x1, y1, x2, y2, x3, y3, x4, y4, x5, y5, x6, y6 = 0;
    //cout << "Input: ";
    cin >> x1 >> y1 >> x2 >> y2;
    cin >> x3 >> y3 >> x4 >> y4;

    x5 = max(x1, x3); 
    y5 = min(y1, y3); 
    x6 = min(x2, x4); 
    y6 = max(y2, y4);
    if(x5 >= x6 && y5>=y6)
        cout << "0";
    else
    cout << abs (x6 - x5) *  abs (y6 - y5);
    
    return 0;
}

#include <iostream>

using namespace std;

short int N, M, K, rul = 1, ost= 0;

int main()
{
    //cout << "Input N, M, K: ";
    cin >> N >> M >> K;

    short int tempK = K;
    while(M>0)
    {
        if(tempK >= N)
        {
            tempK = tempK - N;
            M--;
        }
        if(tempK < N && tempK >= 0)
        {
            rul++;
            ost = tempK + ost;
            tempK = K - N;
            M--;
        }
        if(M == 0)
            ost = tempK + ost;
    }
    cout << rul << " " << ost;

    return 0;
}

#include <iostream>

using namespace std;

bool tanks[200][200];
short int N, M, K, MAX = 0;
short int c = 0;

int main()
{
    //cout << "Input M, N, K: ";
    cin >> M >> N >> K;

    for(short int i = 0; i < M; i++)
    {
        for(short int j = 0; j < N; j++)
            tanks[i][j] = true;
    }

    for(int i = 0; i < K; i++)
    {
        short int tempX, tempY;
    //    cout << "Input X, Y: " << i+1 << endl;
        cin >> tempX >> tempY;
        tanks[tempX-1][tempY-1] = false;
    }
///Right
    for(short int m = 0; m < M; m++)
    {
        for(short int n = 0; n < N; n++)
        {
            if(tanks[m][n] == false)
                break;
            c++;
        }
    }
    if(c > MAX)
        MAX = c;
//Left
    c = 0;
    for(short int m = 0; m < M; m++)
    {
        for(short int n = N-1; n >= 0; n--)
        {
            if(tanks[m][n] == false)
                break;
            c++;
        }
    }
    if(c > MAX)
        MAX = c;
//Up
    c = 0;
    for(short int n = 0; n < N; n++)
    {
        for(short int m = 0; m < M; m++)
        {
            if(tanks[m][n] == false)
                break;
            c++;
        }
    }
    if(c > MAX)
        MAX = c;
//Down
    c = 0;
    for(short int n = 0; n < N; n++)
    {
        for(short int m = M-1; m >= 0; m--)
        {
            if(tanks[m][n] == false)
                break;
            c++;
        }
    }
    if(c > MAX)
        MAX = c;
        
    cout << MAX;
    return 0;
}

#include <iostream>

using namespace std;

int main()
{
    unsigned int N = 1000000;
    short int a[8][8] = {0};
    short int tempA, tempB = 0;
    unsigned int max = 0;
    //cout << "Input N: ";
    cin >> N;

    for(short int i = 0; i<N; i++)
    {
        cin >> tempA >> tempB;
        a[tempA-1][tempB-1]++;
    }

    for(short int i = 0; i<8; i++)
    {
        for(short int j = 0; j<8; j++)
        {
            if(max < a[i][j])
                max = a[i][j];
        }
    }
    cout << max;
    return 0;
}