Cod sursa(job #2114733)
Utilizator | Data | 25 ianuarie 2018 20:12:07 | |
---|---|---|---|
Problema | Prod | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("prod.in");
ofstream g("prod.out");
int a[1001],i,x,j,n;
long long nr1,nr2;
int main()
{
for(i=1;i<=9;i++)
{
f>>x;
for(j=1;j<=x;j++)
a[++n]=i;
}
i=n;
nr1=0;
nr2=0;
while(i>=1)
{
if(nr1<=nr2)
nr1=nr1*10+a[i];
else
nr2=nr2*10+a[i];
i--;
}
g<<(long long)nr1*nr2;
return 0;
}