Problem8 111111111111

You might also like

Download as txt, pdf, or txt
Download as txt, pdf, or txt
You are on page 1of 2

#include <iostream>

#include <random>
#include <chrono>

using namespace std;


using namespace std::chrono;

int *a(int n){

unsigned seme = system_clock::now().time_since_epoch().count();


default_random_engine generator(seme);

uniform_int_distribution<int> por(1,100);

int *polje = new int[n];

int index = 1;

polje[0] = por(generator);

while(index < n){


int polnilo = por(generator);
if(polnilo >= polje[index-1]){
polje[index] = polnilo;
index++;
}
}

return polje;
}

bool ponavljanje(int *p, int n){

for(int i = 1; i < n; i++){


if(p[i] == p[i-1])
return true;

}
return false;

int main()
{

cout << "Vnesi dolzino";


int n;
cin >> n;

int *t = a(n);

for(int i = 0; i < n; i++){


cout << t[i] << " ";
}

cout << endl;


if(ponavljanje(t, n)){
cout << "Polje se ponavlja!";
}else{
cout << "Polje se ne ponavlja :(";
}

cout << endl;

for(int i = n -1; i >= 0; i--){


cout << t[i]<< endl;
}

return 0;
}

You might also like