Advertisement
GrachFedr

Homework_num_2_from_16_09_2021

Sep 16th, 2021 (edited)
1,115
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 2.80 KB | None | 0 0
  1. //----------------------------------------------------------------------------
  2. //pasted by GrachFedr (Shokhin Fedor Sergeevich) https://pastebin.com/LDWKWkwP
  3. //----------------------------------------------------------------------------
  4.  
  5. #include <stdio.h>
  6.  
  7. main(){
  8.    
  9. ////////////////////////////////[obyavlenie peremennih]////////////////////////////////
  10.    
  11.     int a = 0; //chislo
  12.     int n = 0; //kolichestvo chisel
  13.     int max = -2147483647; //maximalnoe chislo (znachenie iznachalno ravno minimalnomu znacheniu int)
  14.     int min = 2147483647; //minimalnoe chislo (znachenie iznachalno ravno maximalnomu znacheniu int)
  15.     int sum = 0; //summa chisel
  16.     int multipl = 1; //umnozhenie chisel
  17.     float arif_mean = 0; //srednee arifmeticheskoe
  18.     float sum_for_AM = 0; //summa dlya srednego arifmeticheskogo
  19.    
  20. ////////////////////////////////[cod]////////////////////////////////
  21.    
  22.     while((n < 1)||(n > 2147483647)){ //proverka na sobludenie usloviya polsovatelem (1.1)
  23.        
  24.         printf("Enter steps count:\n"); //vvedenie polzovatelem kolichestva chisel
  25.         scanf("%i", &n);
  26.        
  27.         if((n < 1)||(n > 2147483647)){ //proverka na sobludenie usloviya polsovatelem (1.2)
  28.            
  29.             printf("\nIncorrect! ");
  30.            
  31.         }
  32.        
  33.     }
  34.    
  35.     printf("------------------------------------\n");
  36.    
  37.     for(int i = 0; i < n; i++){ //cikl dlya rascheta znachenii
  38.        
  39.         printf("\nEnter your %i-st value:\n", i+1); //vvedenie chisla polzovatelem na i-om shage
  40.         scanf("%i", &a);
  41.        
  42.         if((a < -2147483647)||(a > 2147483647)){ //proverka na sobludenie usloviya polsovatelem (2)
  43.            
  44.             while((a < -2147483647)||(a > 2147483647)){
  45.            
  46.                 printf("\nIncorrect! Enter your %i-st count:\n", i+1);
  47.                 scanf("%i", &a);
  48.            
  49.             }
  50.            
  51.         }
  52.        
  53.         printf("\n");
  54.        
  55.         if(a > max){
  56.        
  57.             max = a; //nahozhdenie maximalnogo znacheniya
  58.        
  59.         }
  60.        
  61.         if(a < min){
  62.        
  63.             min = a; //nahozhdenie minimalnogo znacheniya
  64.        
  65.         }
  66.        
  67.         sum += a; //nahozhdenie summi
  68.        
  69.         multipl *= a; //nahozhdenie umnozheniya
  70.        
  71.         float af = float(a); //perevod chisla iz tipa peremennoi int v peremennuiu tipa float
  72.         sum_for_AM += af; //nahozhedie summi dlya srednego aridmeticheskogo
  73.        
  74.     }
  75.    
  76.     printf("\n------------------------------------\n");
  77.    
  78.     float nf = float(n); //perevod kolichestva chisel iz tipa peremennoi int v peremennuiu tipa float
  79.     arif_mean = sum_for_AM / nf; //nahozhdenie srednego arifmeticheskogo
  80.    
  81. ////////////////////////////////[vivod resultatov]////////////////////////////////
  82.    
  83.     printf("The biggest count is %i\n", max); //vivod maximalnogo znacheniya
  84.     printf("The smallest count is %i\n", min); //vivod minimalnogo znacheniya
  85.     printf("Summ of all counts is %i\n", sum); //vivod summi
  86.     printf("Multiplication of all counts is %i\n", multipl); //vivod umnozheniya
  87.     printf("Arifmetic mean of all counts is %f", arif_mean); //vivod srednego arifmeticheskogo
  88.    
  89. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement