Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <iomanip>
- #include <cmath>
- #include <cstdlib>
- using namespace std;
- const int Cmax = 20;
- void Skaityti(int A[],int & n);
- int Min(int A[],int n);
- int Max(int A[],int n);
- int Sum(int A[],int n);
- int Kiek(int A[],int n);
- int main()
- {
- int A[20];
- int n, suma;
- Skaityti(A, n);
- ofstream fr("rez.txt");
- for (int i = 0; i<n; i++)
- cout << A[i] << " ";
- cout << endl;
- suma = Sum(A, n);
- fr << "Skaiciu suma " << suma << endl;
- fr << "Maziausias skaicius " << Min(A, n) << endl;
- fr << "Didziausias skaicius " << Max(A, n) << endl;
- fr << "Didesni uz pirma " << Kiek(A, n) << endl;
- fr.close();
- return 0;
- }
- void Skaityti(int A[],int & n)
- {
- ifstream fd("skaiciai.txt");
- fd >> n;
- for (int i = 0; i<n; i++)
- fd >> A[i];
- fd.close();
- }
- int Min(int A[],int n)
- {
- int mini = 9999;
- for (int i = 0; i<n; i++)
- if(A[i]<mini) mini = A[i];
- return mini;
- }
- int Max(int A[],int n)
- {
- int did = 0;
- for (int i = 0; i<n; i++)
- if(A[i]>did) did = A[i];
- return did;
- }
- int Sum(int A[],int n)
- {
- int s = 0;
- for (int i = 0; i<n; i++)
- s = s + A[i];
- return s;
- }
- int Kiek(int A[],int n)
- {
- int k = 0;
- for (int i = 1; i<n; i++)
- if(A[i]>A[0]) k++;
- return k;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement