Pagini recente » Cod sursa (job #1590644) | Cod sursa (job #3210247) | Cod sursa (job #943112) | Cod sursa (job #2246428) | Cod sursa (job #1334684)
#include <fstream>
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
ifstream in("infasuratoare.in");
ofstream out("infasuratoare.out");
struct punct
{
double x,y;
} p[120001],minp,rasp[120001];
bool det(punct a,punct b,punct c)
{
if((a.x*b.y + b.x*c.y + c.x*a.y - a.y*b.x - b.y*c.x - c.y*a.x)>0) return true;
else return false;
}
int main()
{
int n,i,poz,poz2,j,k=2;
in>>n;
for(i=1; i<=n; i++)
in>>p[i].x>>p[i].y;
minp.y=p[1].y;
poz=1;
for(i=2; i<=n; i++)
if(p[i].y<minp.y)
{
minp.y=p[i].y;
poz=i;
}
minp.x=p[poz].x;
for(i=2; i<=n; i++)
if(p[i].y==minp.y && p[i].x<minp.x)
{
minp.x=p[i].x;
poz=i;
}
swap(p[poz].y,p[n].y);
swap(p[poz].x,p[n].x);
n--;
for(i=1; i<n; i++)
for(j=i+1; j<=n; j++)
if(det(minp,p[i],p[j]))
{
swap(p[i],p[j]);
}
rasp[1]=minp;
rasp[2]=p[1];
for(i=2; i<=n; i++)
{
while(det(rasp[k-1],rasp[k],p[i]))
k--;
rasp[++k].x=p[i].x;
rasp[k].y=p[i].y;
}
out<<k<<'\n';
out<<fixed<<setprecision(6)<<rasp[1].x<<" "<<rasp[1].y<<'\n';
for(i=k;i>1;i--)
out<<fixed<<setprecision(6)<<rasp[i].x<<" "<<rasp[i].y<<'\n';
}