Cod sursa(job #1282416)
Utilizator | Flavius Atanasoae Just2Dr3am | Data | 4 decembrie 2014 10:13:49 |
---|---|---|---|
Problema | Prod | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("prod.in");
ofstream g("prod.out");
int v[10];
int main()
{
int n1,n2,c[10],a[10],tt,p,l,max=0,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;
}
}
}
p=a[1];
for(i=2;i<n;i++)
p=p*a[i]*10+a[i+1];
g<<p;
return 0;
}