Cod sursa(job #116831)
Utilizator | Data | 19 decembrie 2007 18:12:41 | |
---|---|---|---|
Problema | Operatii | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream.h>
long long a[1000000],gasit=0,nr,n,i,b[1000000],poz;
int main()
{
ifstream f("operatii.in");
ofstream g("operatii.out");
f>>n;
for(i=1;i<=n;i++)
f>>b[i];
while(!gasit)
{
gasit=1;
i=1;
for(i=1;i<=n;i++)
if(a[i]<b[i])
{
poz=i;
i=n+1;
}
while(a[poz]<b[poz])
{
a[poz]++;
poz++;
}
nr++;
for(i=1;i<=n;i++)
if(a[i]!=b[i])
gasit=0;
}
g<<nr;
return 0;
}