Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // 1
- #include <iomanip>
- #include <iostream>
- #include <cmath>
- using namespace std;
- void nuskaitymas (int &n, int A[]);
- int suma (int n, int A[]);
- int main () {
- int n;
- int A[100000];
- nuskaitymas(n, A);
- cout << suma(n, A) << endl;
- return 0;
- }
- void nuskaitymas (int &n, int A[]){
- cin >> n;
- for (int i = 0; i < n; i++){
- cin >> A[i];
- }
- }
- int suma (int n, int A[]){
- int sum = 0;
- for (int i = 0; i < n; i++){
- sum += A[i];
- }
- return sum;
- }
- ////////////////////////////////
- //2
- #include <iomanip>
- #include <iostream>
- #include <cmath>
- using namespace std;
- int main () {
- int n;
- int A[11];
- int suma = 0, x = 0;
- double vidurkis = 0;
- cin >> n;
- for (int i = 0; i < n; i++){
- cin >> A[i];
- if (A[i] < 0){
- suma += A[i];
- x++;
- }
- }
- if (x == 0) cout << "NO";
- else {
- vidurkis = suma * 0.1 * 10 / x;
- cout << fixed << setprecision(2) << vidurkis;
- }
- return 0;
- }
- //////////////////
- // 3
- #include <iomanip>
- #include <iostream>
- #include <cmath>
- using namespace std;
- void skaitymas (int A[], int &n);
- int main () {
- int n;
- int A[11];
- int vieta = 0;
- int x = 0;
- int kint = 1000001;
- skaitymas(A, n);
- for (int i = 0; i < n; i++){
- if ((A[i] != 0) && (A[i] % 2 == 0)){
- if (A[i] < kint){
- kint = A[i];
- vieta = i;
- x++;
- }
- }
- }
- if (x > 0) cout << A[vieta];
- else cout << "No";
- return 0;
- }
- void skaitymas (int A[], int &n)
- {
- cin >> n;
- for (int i = 0; i < n; i++){
- cin >> A[i];
- }
- }
- //////////////////////
- // 5
- #include <iomanip>
- #include <iostream>
- #include <cmath>
- using namespace std;
- int main ()
- {
- int n;
- int A[11];
- int x = 0;
- cin >> n;
- for (int i = 0; i < n; i++){
- cin >> A[i];
- }
- for (int i = 0; i < n; i++){
- for (int j = i+1; j < n; j++){
- if (A[i] == A[j]) x++;
- }
- }
- if (x > 0) cout << "NE";
- else cout << "TAIP";
- return 0;
- }
- //////////////////////////////////
- // 8
- #include <iomanip>
- #include <iostream>
- #include <cmath>
- using namespace std;
- void input (int A[][12], int &n, int &m, int &k);
- int suma (int A[][12], int n, int m, int k);
- int main ()
- {
- int n, m, k;
- int A[12][12];
- int sum;
- input(A, n, m, k);
- sum = suma(A, n, m, k);
- if (k < m) cout << sum;
- else cout << "NO";
- return 0;
- }
- void input (int A[][12], int &n, int &m, int &k)
- {
- cin >> n >> m >> k;
- for (int i = 0; i < n; i++){
- for (int j = 0; j < m; j++){
- cin >> A[i][j];
- }
- }
- }
- int suma (int A[][12], int n, int m, int k)
- {
- int suma = 0;
- for (int i = 0; i < n; i++){
- for (int j = k; j < m; j++){
- suma += A[i][j];
- }
- }
- return suma;
- }
- /////////////////////////////
- // 9
- #include <iomanip>
- #include <iostream>
- #include <cmath>
- using namespace std;
- void input (int A[][12], int &n, int &m);
- int didzVieta (int A[][12], int n, int m);
- double vidurkis (int A[][12], int n, int m, int max);
- int main ()
- {
- int n, m;
- int A[12][12];
- int max;
- double vid;
- input(A, n, m);
- max = didzVieta(A, n, m);
- vid = vidurkis(A, n, m, max);
- cout << fixed << setprecision(2) << vid;
- return 0;
- }
- void input (int A[][12], int &n, int &m)
- {
- cin >> n >> m;
- for (int i = 0; i < n; i++){
- for (int j = 0; j < m; j++){
- cin >> A[i][j];
- }
- }
- }
- int didzVieta (int A[][12], int n, int m)
- {
- int x = 0, y = 0;
- for (int i = 0; i < n; i++){
- for (int j = 0; j < m; j++){
- if (A[i][j] > A[x][y]){
- x = i;
- y = j;
- }
- }
- }
- return x;
- }
- double vidurkis (int A[][12], int n, int m, int max)
- {
- int suma = 0;
- double vid = 0;
- for (int j = 0; j < m; j++){
- suma += A[max][j];
- vid++;
- }
- vid = suma * 0.1 * 10 / vid;
- return vid;
- }
- /////////////////////////////////
- // 10
- #include <iomanip>
- #include <iostream>
- #include <cmath>
- using namespace std;
- void input (int A[][12], int &n);
- int suma (int A[][12], int n);
- int main ()
- {
- int n;
- int A[12][12];
- int sum;
- input(A, n);
- sum = suma(A, n);
- if (n > 1) cout << sum;
- else cout << "No";
- return 0;
- }
- void input (int A[][12], int &n)
- {
- cin >> n;
- for (int i = 0; i < n; i++){
- for (int j = 0; j < n; j++){
- cin >> A[i][j];
- }
- }
- }
- int suma (int A[][12], int n)
- {
- int suma = 0;
- for (int i = 0; i < n; i++){
- for (int j = 0; j < n; j++){
- if (i > j) suma += A[i][j];
- }
- }
- return suma;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement