Pagini recente » Cod sursa (job #2072469) | Cod sursa (job #274518) | Cod sursa (job #3127725) | Cod sursa (job #2009762) | Cod sursa (job #732052)
Cod sursa(job #732052)
#include<stdio.h>
#define LIM 250001
#define N 501
bool numar[LIM];
int a[N][N];
int n;
void parcurg()
{
for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++)
if(a[i][j]!=0)
numar[a[i][j]] = true;
}
}
int minim()
{
int min;
for(int i=1;i<=n*n;i++) {
if(!numar[i]) {
min = i;
break;
}
}
return min;
}
int maxim()
{
int max;
for(int i=n*n;i>=1;i--) {
if(!numar[i]) {
max = i;
break;
}
}
return max;
}
int main()
{
freopen("numere7.in","r",stdin);
freopen("numere7.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
parcurg();
//for (int i=1;i<=n*n;i++)
// printf("numar[%d] = %d\n",i,numar[i]);
int min = minim();
int max = maxim();
printf("%d %d\n",min,max);
return 0;
}