Cod sursa(job #3002792)

Utilizator AndreidreiGresoiu Liviu-Andrei Andreidrei Data 15 martie 2023 10:41:29
Problema Tije Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 2.12 kb
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#define din cin
#define dout out
#define pi 3.14159265359
#define sw(x,y) x^=y,y^=x,x^=y
#define bmin(a,b)((a<b)?(a):(b))
#define bmax(a,b)((a>b)?(a):(b))
#define bminify(a,b)a=bmin(a,b)
#define bmaxify(a,b)a=bmax(a,b)
#define forq(i,ii,n)for(i=ii;i<n;i++)
using namespace std;
typedef long long ll;
class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};
ifstream in("tije.in");
//ofstream out("tije.out");
OutParser out("tije.out");
int n,i,j,k,l,s,y;
int main()
{
in>>n;
for(i=2;i<=n;i++)
{
    for(j=1;j<i;j++)
    {
    if(j==1)y=2;else y=1;
    out<<y<<' '<<n+1<<'\n';
    for(k=1;k<i;k++)out<<j<<' '<<n+1<<'\n';
    out<<j<<' '<<y<<'\n';
    for(k=1;k<i;k++)out<<n+1<<' '<<j<<'\n';
    out<<y<<' '<<j<<'\n'<<n+1<<' '<<y<<'\n';
    }
    for(j=1;j<i;j++)out<<i<<' '<<n+1<<'\n';
    for(j=1;j<i;j++)out<<j<<' '<<i<<'\n';
    for(j=1;j<i;j++)out<<n+1<<' '<<j<<'\n';
}
}