Pagini recente » Cod sursa (job #1637477) | Cod sursa (job #2677906) | Cod sursa (job #2373524) | Cod sursa (job #192060) | Cod sursa (job #3128719)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("custi.in");
ofstream g("custi.out");
int n,a[1005][1005];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++) f>>a[i][j];
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++) a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
for(int t=1;t<=n;t++) {
int cnt=0;
for(int i=1;i<=n-t+1;i++){
for(int j=1;j<=n-t+1;j++){
if(a[i+t-1][j+t-1]-a[i+t-1][j-1]-a[i-1][j+t-1]+a[i-1][j-1]==t*t) cnt++;
}
}
g<<cnt<<'\n';
}
return 0;
}