Pagini recente » Cod sursa (job #1955650) | Cod sursa (job #1759408) | Cod sursa (job #1461287) | Cod sursa (job #2744834) | Cod sursa (job #2528036)
#include <bits/stdc++.h>
using namespace std;
ifstream f("infasurare.in");
ofstream g("infasurare.out");
int main()
{
int n, i, a=0, b=0, c=0, d=0;
float x[120001], y[120001], xmin=1000000000, ymin=1000000000, xmax=0, ymax=0;
f>>n;
stack <float> s;
for(i=1; i<=n; i++)
{
f>>x[i]>>y[i];
if(x[i]<xmin)
{
xmin=x[i];
a=1;
}else if(x[i]==xmin)
{
a++;
}
if(x[i]>xmax)
{
xmax=x[i];
b=1;
}else if(x[i]==xmax)
{
b++;
}
if(y[i]<ymin)
{
ymin=y[i];
c=1;
}else if(y[i]==ymin)
{
c++;
}
if(y[i]>ymax)
{
ymax=y[i];
d=1;
}else if(y[i]==ymax)
{
d++;
}
}
g<<a+b+c+d<<endl;
for(i=1; i<=n; i++)
{
if(y[i]==ymin)
{
g<<fixed<<setprecision(6)<<x[i]<<" "<<ymin<<endl;
}
}
for(i=1; i<=n; i++)
{
if(x[i]==xmax)
{
g<<xmax<<" "<<y[i]<<endl;
}
}
for(i=n; i>=1; i--)
{
if(y[i]==ymax)
{
g<<x[i]<<" "<<ymax<<endl;
}
}
for(i=n; i>=1; i--)
{
if(x[i]==xmin)
{
g<<xmin<<" "<<y[i]<<endl;
}
}
}