Cod sursa(job #1765852)

Utilizator sergiuspiridonsergiu spiridon sergiuspiridon Data 27 septembrie 2016 01:33:41
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include <iostream>
#include <math.h>
#include <fstream>

using namespace std;
  ifstream in("cmap.in");
  ofstream out("cmap.in");
int main()
{
int n,v[100],c[100],i,j,ok,x,p,u,a,o;
float m;
in>>n;
for(i=1;i<=n;i++)
    in>>v[i]>>c[i];
    for(i=1;i<=n;i++)
    {
        for(j=2;j<=n;j++)
 { x=(v[i]-v[j])*(v[i]-v[j])+(c[i]-c[j])*(c[i]-c[j]);
if(ok==0){
m=x;
ok=1;}
else if(x<m&&v[i]!=v[j])
    {
    m=sqrt(x);
    p=v[i];
    a=v[j];
    u=c[i];
    o=c[j];
    }
    }
    }out<<m<<" "<<p<<" "<<a<<" "<<u<<" "<<o;
    in.close();out.close();
 return 0;
}