Cod sursa(job #1827883)
Utilizator | Data | 12 decembrie 2016 14:32:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int a[50005];
int main()
{
int n,p,i;
ifstream fin("pba.in");
ofstream fout("pba.out");
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
sort(a+1,a+n+1);
p=(1LL*a[n]*a[n-1])%MOD*a[n-2]%MOD;
fout<<p;
fout.close();
return 0;
}