Pagini recente » Cod sursa (job #699947) | Cod sursa (job #2660678) | Cod sursa (job #791558) | Cod sursa (job #2708388) | Cod sursa (job #1746423)
#include <iostream>
int r,q,m,i,j,p,n,lin,a[1001][1001];
using namespace std;
int main()
{
cin>>n>>m;
for (q=1;q<=m;q++)
{
cin>>i>>j>>p;
a[i][j]=1;
for (lin=1;lin<=p;lin++)
{
if (i-lin>0 && j+lin<=n)
a[i-lin][j+lin]=1;
if (i+lin<=n && j-lin>0)
a[i+lin][j-lin]=1;
if (i+lin<=n && j+lin<=n)
a[i+lin][j+lin]=1;
if (i-lin>0 && j-lin>0)
a[i-lin][j-lin]=1;
}
}
r=0;
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
{
if (a[i][j]==0) r++;
}
}
cout<<r;
return 0;
}