Cod sursa(job #2255591)
Utilizator | Data | 7 octombrie 2018 12:05:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("tsunami.in");
ofstream fout("tsunami.out");
int N,M,H,i,j,a[1001][1001],t=0;
fin>>N>>M>>H;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
{
fin>>a[i][j];
}
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
{
if(a[i][j]<H && (a[i-1][j]==0 || a[i+1][j]==0 || a[i][j-1]==0 || a[i][j+1]==0))
{
t++;
}
}
fout<<t;
fin.close();
fout.close();
return 0;
}