Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #define M 100
- #define cin fin
- using namespace std;
- ifstream fin ("be.txt");
- void be(int &n, int v[]){//a
- cin>>n;
- for(int i=0;i<n;i++)
- cin>>v[i];
- }
- void ki(int n, int v[]){//b
- for(int i=0;i<n;i++)
- cout<<v[i]<<' ';
- cout<<'\n';
- }
- int legnagyobb_szamjegy(int n){//c
- int maxi=n%10;
- n/=10;
- while(n){
- maxi=max(n%10, maxi);
- n/=10;
- }
- return maxi;
- }
- int legnagyobb_szamjegy_tomb(int n, int v[]){//d
- int maxi=legnagyobb_szamjegy(v[0]);
- for(int i=1;i<n;i++){
- maxi=max(maxi, legnagyobb_szamjegy(v[i]));
- }
- return maxi;
- }
- void novekvo(int n, int v[]){
- int ok=1;
- while(ok){
- ok=0;
- for(int i=0;i<n-1;i++)
- if(v[i]>v[i+1]){
- swap(v[i], v[i+1]);
- ok=1;
- }
- }
- }
- int kozep_meghataroz(int n, int v[]){
- int mini=v[0], maxi=v[0];
- for(int j=0;j<n;j++){
- mini=min(mini, v[j]);
- maxi=max(maxi, v[j]);
- }
- for(int i=0;i<n/2-1;i++){
- int k=maxi;
- for(int j=0;j<n;j++)
- if(v[j]>mini) k=min(k, v[j]);
- mini=k;
- }
- return mini;
- }
- void rendez(int n, int v[]){//e
- int koz=kozep_meghataroz(n, v);
- }
- int main()
- {
- int v[M], n;
- be(n, v);
- ki(n, v);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement