Pagini recente » Cod sursa (job #1043211) | Cod sursa (job #1220295) | Cod sursa (job #430200) | Cod sursa (job #1394143) | Cod sursa (job #1095429)
#include <stdlib.h>
#include <stdio.h>
int a[100][100];
#define INT_MAX 1000;
n = 20;
int valid(int i, int j, int k)
{
int x,check = 1;
//verifica linia
for (x = 1; x <= n; x++){
if (a[i][x] == k)
check = 0;
if (a[x][j] == k)
check = 0;
}
if (check == 0)
return 0;
else
{
a[i][j] = k;
return 1;
}
}
int main()
{
int i,j,x,y,p,k = 0;
a[1][1] = 0;
for (i = 0; i <= n; i++)
for (j = 0; j<=n; j++)
a[i][j] = INT_MAX;
for (i = 1; i <= n; i++) { k =0;
for (j = 1; j <= n; j++)
{
if (i == 1 && j == 1)
a[i][j] = 0;
else {
k = 0;
p = valid(i,j,k);
while (p != 1){
k++;
p = valid(i,j,k);
}
}
} }
FILE *in;
in = fopen("tabela.in","r");
fscanf(in,"%d %d",&x,&y);
fclose(in);
in = fopen("tabela.out","w");
fprintf(in,"%d",a[x][y]);
fclose(in);
return 0;
}