Pagini recente » Cod sursa (job #341657) | Cod sursa (job #1938253) | Cod sursa (job #2693631) | Cod sursa (job #1385233) | Cod sursa (job #42228)
Cod sursa(job #42228)
#include<stdio.h>
#include<stdlib.h>
int cmp(const void *a, const void *b)
{
char * francesca, * natasa;
francesca=(char *) a;
natasa=(char *) b;
for (int i=0; i<128; i++)
if (francesca[i]>natasa[i]) return 1;
return 0;
}
char mat[1024][128];
int main()
{
freopen("regiuni.in", "r", stdin);
freopen("regiuni.out", "w", stdout);
short int dr[1024][3], n, m, i, j, x, y, count=1;
scanf("%hd%hd", &n, &m);
for (i=0; i<n; i++)
scanf("%hd%hd%hd", &dr[0][i], &dr[1][i], &dr[2][i]);
for (i=0; i<m; i++)
{
scanf("%hd%hd", &x, &y);
for (j=0; j<n; j++)
if (dr[0][j]*x+dr[1][j]*y+dr[2][j] > 0) mat[i][j/8]= mat[i][j/8] | ((1<<7)>>j%8);
}
qsort(mat, m, sizeof(mat[0]), cmp);
for (i=0; i<m; i++)
{
for (j=0; j<n; j++)
printf("%d ", mat[i][j]);
printf("\n");
}
for (i=1; i<m; i++)
{
for (j=0; j<128; j++)
if ( mat[i][j]!=mat[i-1][j] ){ count++; break;}
}
printf("%d", count);
return 0;
}