Pagini recente » Cod sursa (job #2506126) | Cod sursa (job #433221) | Cod sursa (job #183236) | Cod sursa (job #2916910) | Cod sursa (job #2706392)
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <fstream>
using namespace std;
ifstream fin("aria.in");
ofstream fout("aria.out");
struct p{
long double x,y;
}Punct[100010];
int n;
long double arie;
int main()
{
fin >> n;
for(int i=1;i<=n;i++)
{
fin >> Punct[i].x >> Punct[i].y;
}
Punct[n+1]=Punct[1];
for(int i=1;i<=n;i++)
{
arie+=(Punct[i].x*Punct[i+1].y-Punct[i].y*Punct[i+1].x);
}
if(arie<0) arie=-arie;
fout << fixed << setprecision(10) << arie/2.0;
return 0;
}