Pagini recente » Cod sursa (job #3000203) | Borderou de evaluare (job #1782912) | Cod sursa (job #108457) | Cod sursa (job #3261082) | Cod sursa (job #2607496)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("aria.in");
ofstream fout("aria.out");
int n;
double arie, p[100010][2];
int main() {
fin >> n;
for (int i = 1; i <= n; i++)
fin >> p[i][0] >> p[i][1];
p[n + 1][0] = p[1][0];
p[n + 1][1] = p[1][1];
for (int i = 2; i <= n + 1; i++)
arie += (p[i][1] * p[i - 1][0] - p[i][0] * p[i - 1][1]) / 2.00000;
fout << abs(arie);
return 0;
}