Pagini recente » Cod sursa (job #2551806) | Cod sursa (job #2087838) | Cod sursa (job #2989211) | Istoria paginii runda/de_placere | Cod sursa (job #2188767)
#include <fstream>
#include <iomanip>
#include <cmath>
#define Nmax 100009
using namespace std;
ifstream f("aria.in");
ofstream g("aria.out");
typedef pair<double,double> point;
#define x first
#define y second
int n;
point v[Nmax];
void ReadInput() {
f>>n;
for (int i=1; i<=n; ++i) {
f>>v[i].x>>v[i].y;
}
}
double arie(point v[Nmax]) {
double sum=0;
for (int i=1; i<n; ++i) {
sum += ( (v[i].x * v[i+1].y) - (v[i+1].x * v[i].y) );
}
sum += ( (v[n].x * v[1].y) - (v[1].x * v[n].y) );
sum=sum * 0.5;
return fabs(sum);
}
void Solve() {
int sol= (int) arie(v);
// int nrc=0;
// while(sol>0) {
// ++nrc;
// sol=sol/10;
// }
g<<setprecision(5)<<fixed<<arie(v);
}
int main() {
ReadInput();
Solve();
f.close(); g.close();
return 0;
}