Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- START: 9.4
- Imamo n celih števil, ki so si po velikosti zelo blizu(se ponavljajo), npr imamo 15 števil med 1 in 10()%10+1
- Program naj poišèe vse maksimume(èe jih je veè).
- */
- #include <iostream>
- #include<time.h>
- #include<stdlib.h>
- using namespace std;
- int napolni(int stevila[],int n){
- for(int i=0;i<n;i++)
- stevila[i] = rand()%10+1;
- }
- int izpis(int stevila[],int n){
- for(int i=0;i<n;i++)
- cout<<stevila[i]<<" ";
- }
- int en_maks(int stevila[],int n){
- int maks = 0;
- for(int i=0;i<n;i++){
- if(stevila[i] > maks)
- maks = stevila[i];
- }
- return maks;
- }
- int vsi_max(int stevila[], int n,int max_stevilo){
- for(int i=0;i<n;i++){
- if(stevila[i] == max_stevilo){
- cout<<"\nMax "<<max_stevilo<<" je na indexu "<<i;
- }
- }
- }
- int main(){
- int n;
- srand(time(0));
- cout<<"Vnesi n: ";
- cin>>n;
- int stevila[n];
- napolni(stevila, n);
- izpis(stevila, n);
- cout<<"\nMaksimum: "<<en_maks(stevila, n);
- int max_stevilo = en_maks(stevila, n);
- vsi_max(stevila, n, max_stevilo);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement