Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- const int MAX = 100;
- void szukaj(double T[], int n)
- {
- double lider=T[0];
- int pom=1, ilosc=0;
- for (int i=1;i<n;i++)
- if (pom==0)
- {
- lider=T[i];
- pom=1;
- }
- else if(T[i]==lider) pom++;
- else pom--;
- if(pom==0) cout<<"W zbiorze nie ma lidera"<<endl;
- else
- {
- for(int i=0;i<n;i++)
- if (T[i]==lider) ilosc++;
- if (ilosc>n/2) cout<<"liczba "<<lider<<" jest liderem"<<endl;
- else cout<<"w zbiorze nie ma lidera"<<endl;
- }
- }
- main(){
- int n;
- cout<<"Podaj n = ";
- cin>>n;
- double T[n];
- for (int i=0;i<n;i++){
- cout<<"T["<<i<<"] = ";
- cin>>T[i];
- cout<<"\n";
- }
- szukaj(T,n);
- return 0;
- cin.get();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement