Cod sursa(job #2825753)
| Utilizator | Data | 5 ianuarie 2022 09:46:47 | |
|---|---|---|---|
| Problema | A+B | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("xor3.in");
ofstream g("xor3.out");
const int maxn = 1005;
int a[maxn][maxn];
int n, i, j;
int main()
{
f >> n;
g << "0 ";
for(i = 1; i <= n; i ++) {
a[0][i] = i;
g << a[0][i] << ' ';
}
g << '\n';
for(i = 1; i <= n; i ++) {
g << "0 ";
for(j = 1; j <= n; j ++) {
a[i][j] = a[i-1][j] ^ a[i][j-1];
g << a[i][j] << ' ';
}
g << '\n';
}
return 0;
}
