Pregled posta

#include

#define MAXN 100
#define MAXM (MAXN*(MAXN-1)/2)
#define INFILE "trokuti.in"
#define MAXLINE 80

int m, n;
int g[MAXN][MAXN];
int vrh[MAXN][MAXM];

int kolinearni(int a, int b, int c)
{
int i;

for (i = 0; i < m; ++i)
if (vrh[a][i] && vrh[b][i] && vrh[c][i])
return 1;

return 0;
}

int spojeni(int a, int b)
{
int i;

for (i = 0; i < m; ++i)
if (vrh[a][i] && vrh[b][i])
return 1;

return 0;
}

main()
{
int i, j, k, l;
int trokut;
char line[MAXLINE+1];
FILE *in;

in = fopen(INFILE, "rt");

if (in == NULL)
{
printf("File not found!n");
return 1;
}

for (i = 0; i < MAXN; ++i)
for (j = 0; j < MAXM; ++j)
vrh[i][j] = 0;

m = n = 0;
while (!feof(in))
{
fgets(line, MAXLINE, in);

for (i = 0; line[i]; i++)
{
if (line[i] < '0' || line[i] > '9')
continue;

l = 0;
while (line[i] >= '0' && line[i] <= '9')
{
l = l*10 + line[i]-'0';
i++;
}

if (l >n) n = l;
vrh[l-1][m] = 1;
}

m++;
}

for (i = 0; i < n; ++i)
for (j = i+1; j < n; ++j)
g[i][j] = spojeni(i, j);

trokut = 0;
for (i = 0; i < n; ++i)
for (j = i+1; j < n; ++j)
for (k = j+1; k < n; ++k)
if ( (g[i][j] && g[j][k] && g[i][k]) && (!kolinearni(i, j, k)) )
{
printf("(%d, %d, %d)n", i+1, j+1, k+1);
trokut++;
}

printf("%dn", trokut);

getch();
fclose(in);
return 0;
}


Post je objavljen 26.02.2009. u 20:10 sati.