Pagini recente » Cod sursa (job #1831467) | Cod sursa (job #3250280) | Cod sursa (job #2934519) | Cod sursa (job #2011407) | Cod sursa (job #2665068)
#include <fstream>
using namespace std;
ifstream in("panou.in");
ofstream out("panou.out");
int l[500], c[500];
int main()
{
bool A[500][500], B[500][500] ;
int n, cnt = 0 ;
in >> n;
for (int i=0 ;i < n;i++)
{
for(int j = 0;j < n;j++)
in >> A[i][j];
}
for (int i=0 ;i < n;i++)
{
for(int j = 0;j < n;j++)
in >> B[i][j];
}
for(int i = n-1 ;i >= 0;i--)
{
if( (A[i][i] + l[i] + c[i])%2 != B[i][i])
{
l[i]++;
c[i]++;
cnt++;
}
for(int j = i-1; j >= 0 ;j--)
{
if( (A[j][i] + c[i] + l[j]) %2!=B[j][i] )
{
l[j]++;
c[i]++;
cnt++;
}
if( (A[i][j] + l[i] + c[j]) %2!=B[i][j] )
{
l[i]++;
c[j]++;
cnt++;
}
}
}
out << cnt;
return 0;
}