Cod sursa(job #1880347)

Utilizator Coroian_DavidCoroian David Coroian_David Data 15 februarie 2017 18:15:50
Problema Tablete Scor 40
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.97 kb
#include <cstdio>

using namespace std;

FILE *f, *g;

const int buffSize = 4096;

int crChar = 4096;

char buff[4100];

bool isDigit[300];

void getIsDigit()
{
    int i;
    for(i = '0'; i <= '9'; i ++)
        isDigit[i] = 1;
}

void refillBuff()
{
    crChar = 0;

    fread(buff, 1, buffSize, f);
}

char getCr()
{
    if(crChar == 4096)
        refillBuff();

    return buff[crChar ++];
}

int getNr()
{
    char c = getCr();

    int nr = 0;
    int sign = 1;

    while(isDigit[c] == 0 && c != '-')
        c = getCr();

    while(c == '-')
    {
        c = getCr();

        sign *= (-1);
    }

    while(isDigit[c] == 1)
    {
        nr = nr * 10 + c - '0';

        c = getCr();
    }

    return nr * sign;
}

int n, m;

bool used[1000001];

int a[1001][1001];

void readFile()
{
    getIsDigit();

    f = fopen("tablete.in", "r");

    n = getNr();
    m = getNr();

    fclose(f);
}

int firstUnused()
{
    int i;
    for(i = 1; i <= n * n; i ++)
        if(used[i] == 0)
        {
            used[i] = 1;

            return i;
        }
}

int firstEvenUnused()
{
    int i;
    for(i = 2; i <= n * n; i += 2)
        if(used[i] == 0)
        {
            used[i] = 1;

            return i;
        }
}

void solve()
{
    int i, j;
    int k = m;
    for(i = 1; i <= n; i ++)
    {
        for(j = 1; j < k; j ++)
            a[i][j] = firstUnused();

        a[i][k] = firstEvenUnused();
    }

    for(i = 1; i <= n; i ++)
    {
        for(j = k + 1; j <= n; j ++)
        {
            a[i][j] = firstUnused();
        }
    }
}

void printFile()
{
    g = fopen("tablete.out", "w");

    int i, j;
    for(i = 1; i <= n; i ++)
    {
        for(j = 1; j <= n; j ++)
            fprintf(g, "%d ", a[i][j]);

        fprintf(g, "\n");
    }

    fclose(g);
}

int main()
{
    readFile();

    solve();

    printFile();

    return 0;
}