Pagini recente » Cod sursa (job #2076550) | Istoria paginii utilizator/ngocphuong912k | Statistici Calin David (rockah0lic) | Rating Alex Tudor (alextudor227227) | Cod sursa (job #1795079)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("aria.in");
ofstream out("aria.out");
const int maxn = 100005;
pair <double, double> v[maxn];
inline double mod(double x)
{
if(x >= 0)
return x;
return -x;
}
inline double det(double x1, double y1, double x2, double y2, double x3, double y3)
{
double x = (x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1);
return mod(x / 2);
}
int main()
{
int n;
in >> n;
for(int i = 1; i <= n; i++)
in >> v[i].first >> v[i].second;
v[n + 1] = v[1];
double sum = 0;
for(int i = 1; i <= n; i++)
sum += det(v[i].first, v[i].second, v[i + 1].first, v[i + 1].second, 0, 0);
out << sum << "\n";
return 0;
}