Cod sursa(job #2283680)
Utilizator | Data | 15 noiembrie 2018 19:04:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
using namespace std;
int main(){
int n , v[10005], i , aux ,sortat=0;
cin>>n;
for(i=1 ; i<=n ; i++){
cin>>v[i];
}
while(sortat==0){
sortat=1;
for(i=1 ; i<n ; i++){
if(v[i]<v[i+1]){
sortat=0;
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
}
}
}
for(i=1 ; i<=n ; i++){
cout<<v[i]<<" ";
}
return 0;
}