Pagini recente » Istoria paginii runda/preonigim2015/clasament | Istoria paginii runda/probleme_oji_2/clasament | Istoria paginii runda/test.nou/clasament | Istoria paginii runda/sim1/clasament | Cod sursa (job #2018368)
#include<fstream>
#include<cmath>
#include<iostream>
using namespace std;
ifstream fin("aria.in");
ofstream fout("aria.out");
int n;
double x[100005],y[100005],mx,my,a;
double arie(int a,int b)
{
return abs(x[a]*y[b]+x[b]*my+mx*y[a]-mx*y[b]-my*x[a]-y[a]*x[b]);
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>x[i]>>y[i];
mx+=x[i];
my+=y[i];
}
mx/=n;
my/=n;
// cout<<mx<<' '<<my;
n++;
x[n]=x[1];
y[n]=y[1];
for(int i=2;i<=n;i++)
{
a+=arie(i,i-1)/2;
//cout<<arie(i,i-1,i-2)/2<<'\n';
}
fout<<a;
}