Pagini recente » Cod sursa (job #2504575) | Cod sursa (job #329574) | Cod sursa (job #2780950) | Cod sursa (job #401952) | Cod sursa (job #1224511)
#include <fstream>
using namespace std;
int dis(int p, int q)
{int s;
if (p+q<0) s=-p-q;
else s=p+q;
return s;
}
int main()
{
long int n,x,y,i,j,k,v[500],w[500],m=500,e;
fstream fin("tribute.in");
fstream fout("tribute.out");
fin>>n;
fin>>x;
fin>>y;
for (i=1; i<=n; i++) fin>>v[i]>>w[i];
for (i=1; i<=x; i++)
for(j=1; j<=y; j++)
for(k=1; k<=n; k++)
{
e=dis(i, v[k])+dis(j, w[k]);
if (m>=e) m=e;
}
fout<<m;
}