Cod sursa(job #2974554)
Utilizator | Data | 4 februarie 2023 10:36:14 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
///ifstream in("adiacenta1.in");
///ofstream out("adiacenta1.out");
bool a[105][105];
int n;
void citire()
{
int i,x,y;
while(cin>>x>>y)
{
a[x][y]=a[y][x]=1;
}
n=max(n,y);
n=max(n,x);
}
int main()
{
citire();
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}