Cod sursa(job #2088933)
Utilizator | Data | 16 decembrie 2017 09:13:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("cal.in");
ofstream fout ("cal.out");
int mod (int n)
{
if (n>=0)
return n;
else
return -n;
}
int main()
{
int Sx, Sy, S, n, x, y, contor;
fin>>Sx>>Sy>>S>>n;
contor=0;
for (int i=1;i<=n;i++)
{
fin>>x>>y;
if (mod(Sx-x)+mod(Sy-y)==S)
contor++;
}
fout<<contor;
return 0;
}