Pagini recente » Cod sursa (job #2414079) | Cod sursa (job #2600176) | Cod sursa (job #1274800) | Cod sursa (job #2463733) | Cod sursa (job #1282429)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("prod.in");
ofstream g("prod.out");
int main()
{
int n1,n2=0,c[10],a[10],tt,p,l,i,aux,t,s,n;
for(i=1;i<=9;i++)
f>>c[i];
for(i=1;i<=9;i++)
a[i]=i*c[i];
tt=0;
while(tt==0)
{
tt=1;
for(i=9;i>=1;i--)
{
if(a[i]>a[i-1])
{
aux=a[i];
a[i]=a[i-1];
a[i-1]=aux;
tt=0;
}
}
}
n1=a[1];
for(i=2;i<n;i++)
{
if(a[i]>0)
n2=n2*10+a[i];
}
p=n1*n2;
g<<p;
return 0;
}