Pagini recente » Cod sursa (job #1936882) | Cod sursa (job #1513170) | Cod sursa (job #2305944) | Cod sursa (job #2917845) | Cod sursa (job #1126763)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#define xx first
#define yy second
using namespace std;
ifstream fin("aria.in");
ofstream fout("aria.out");
const int NMAX = 1e5 + 100;
int N;
typedef pair <int, int> pct;
pct P[NMAX];
long long Sign(pct A, pct B)
{
return A.xx * B.yy - A.yy * B.xx;
}
int main()
{
fin >> N;
for(int i = 1; i <= N; i++)
fin >> P[i].xx >> P[i].yy;
P[N + 1] = P[1];
long long Arie = 0;
for(int i = 2; i <= N + 1; i++)
Arie += Sign(P[i - 1], P[i]);
double sol = Arie;
fout.precision(5);
fout << fixed << (sol / 2.0);
return 0;
}