# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
843942 | mihaibun | Soccer Stadium (IOI23_soccer) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <soccer.h>
using namespace std;
int biggest_stadium(int N, int[][] F)
{
int i,j,x;
for(i = 0; i < N; i++)
for(j = 0; j < N; j++)
if(F[i][j]==0) x++;
return x;
}