Cod sursa(job #2588090)
Utilizator | Data | 24 martie 2020 14:00:39 | |
---|---|---|---|
Problema | Ciclu Eulerian | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
#define N 1025
using namespace std;
static const
int di[]={-1, 0, 1, 0},
dj[]={0, 1, 0, -1};
int a[N][N];
int main () {
ifstream fin ("alpin.in");
ofstream fout ("alpin.out");
ios::sync_with_stdio(false);
fin.tie(NULL);
fout.tie(NULL);
int n, i, j;
fin >> n;
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
return 0;
}