Cod sursa(job #3312781)
| Utilizator | Data | 29 septembrie 2025 21:15:01 | |
|---|---|---|---|
| Problema | Aria | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
#define Mod 1000000007
using namespace std;
ifstream fin("aria.in");
ofstream fout("aria.out");
int n;
pair<int, int> a[100005];
int Aria(pair<int, int> A, pair<int, int> B)
{
return A.first * B.second - A.second * B.first;
}
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
fin >> a[i].first >> a[i].second;
int aria = 0;
a[n + 1] = a[1];
for (int i = 2; i <= n + 1; i++)
aria += Aria(a[i - 1], a[i]);
fout << 0.5 * aria << "\n";
return 0;
}
