Pagini recente » Cod sursa (job #183270) | Cod sursa (job #799088) | Cod sursa (job #2556659) | Cod sursa (job #2706391) | Cod sursa (job #2705367)
#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{
double x,y;
}Punct[100002];
int n;
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);
}
double sol=abs(arie/2.0)*100000;
sol=int(sol);
fout << sol/100000;
return 0;
}