Cod sursa(job #421262)
Utilizator | Data | 21 martie 2010 12:48:57 | |
---|---|---|---|
Problema | Copii | Scor | 0 |
Compilator | c | Status | done |
Runda | Algoritmiada 2010, Runda 4, Clasele 5-8 | Marime | 0.43 kb |
#include <stdio.h>
char a[21][21], sp;
int n, i, j;
int unu, rez;
int main()
{
FILE *f = fopen ("copii.in","r");
FILE *g = fopen ("copii.out","w");
fscanf (f,"%d", &n);
for (i=1; i<=n; ++i)
{
fscanf (f,"%c", &sp);
for (j=1; j<=n; ++j)
{
fscanf (f,"%c", &a[i][j]);
if (a[i][j] == '1')
unu ++;
}
}
fclose(f);
rez = (int) (unu+1) / 2;
fprintf (g,"%d", rez);
fclose(g);
return 0;
}