Cod sursa(job #2520125)
Utilizator | Data | 8 ianuarie 2020 23:15:34 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
using namespace std;
int main()
{
int n,v[202];
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
for(int i=1;i<=n+1;i++){
if(v[i]%2==0 && v[i+1]%2==0)
v[i+1]=(v[i]+v[i+1])/2;
n++;
}
for(int i=1;i<=n;i++)
cout<<v[i]<<' ';
}