Pagini recente » Istoria paginii runda/simulare_oji_2016/clasament | Istoria paginii runda/ioi/clasament | Istoria paginii runda/omg_am_revenit/clasament | Istoria paginii runda/simulare_oji_2023_clasa_9_12_martie/clasament | Cod sursa (job #2080979)
#include <fstream>
#include <iomanip>
using namespace std;
int N,i;
float A[2][100005],Total;
int main()
{
ifstream fin("aria.in");
ofstream fout("aria.out");
fin>>N;
for(i=1;i<=N;i++)
fin>>A[0][i]>>A[1][i];
A[0][N+1]=A[0][1];
A[1][N+1]=A[1][1];
Total=0;
for(i=1;i<=N;i++)
Total+=(A[0][i]*A[1][i+1]-A[0][i+1]*A[1][i])/2.0;
fout<<fixed<<setprecision(5)<<Total;
fin.close ();
fout.close();
return 0;
}