Cod sursa(job #2174149)
Utilizator | Data | 16 martie 2018 10:57:44 | |
---|---|---|---|
Problema | Operatii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("operatii.in");
ofstream g("operatii.out");
long long n, i, j, s, v[2][1000001] ;
bool complet;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[2][i];
while(!complet)
{
complet=1;
for(i=1;i<=n;i++)
{
if(v[1][i]!=v[2][i])
{
complet=0;
j=i;
while(v[1][j]!=v[2][j])
{
v[1][j]++;
j++;
}
s++;
i--;
}
}
}
g<<s;
return 0;
}