fork download 
  1. #include <iostream>
  2. #include <string.h>
  3. using namespace std;
  4. void m_print(void) // для печати файла 
  5. {
  6.     const int count = 4;
  7.     char oldmax_name[count][32];
  8.     char oldmin_name[count][32];
  9.     struct people
  10.     {
  11.         char name[32];
  12.         int old;
  13.     };
  14.     struct J_GEO_1
  15.     {
  16.         char city[32];
  17.         char ulitsa[32];
  18.         int kv;
  19.         int dom;
  20.     };
  21.     struct Family
  22.     {
  23.         char name[32];
  24.         people fd[5];
  25.         J_GEO_1 ad;
  26.     };
  27.  
  28.     Family families[count] = { 
  29.         { "F1",
  30.         {{ "dima", 15 },
  31.         { "egor", 20 },
  32.         { "misha" , 30 },
  33.         { "ola" , 29 },
  34.         { "masha" , 70 }},
  35.         { "moskva", "perovo" , 16 , 140 }},
  36.         { "F2",
  37.         {{ "sasha", 35 },
  38.         { "dasha" , 34 },
  39.         { "oleg" , 15 },
  40.         { "kostya" , 70 },
  41.         { "ira" , 68 }},
  42.         { "moskva",  "akdemicheskaya" , 15 , 10 }},
  43.         { "F3",
  44.         {{ "kira" , 15 },
  45.         { "karina" , 34 },
  46.         { "nikita" , 35 },
  47.         { "vova" , 60 },
  48.         { "dima" , 70 }},
  49.         { "ekaterinburg", "puskina", 29 , 140 }},
  50.         { "F4",
  51.         {{ "stas" , 29 },
  52.         { "nastya" , 33 },
  53.         { "vera", 40 },
  54.         { "mikle" , 67 },
  55.         { "luda" , 63 }},
  56.         { "anapa", "ianovo", 16 , 48 }}
  57.     };
  58.  
  59.     // сравнение номеров домов вывод одинаковых семей 
  60.     // сравнение квартир вывод одинаковых семей 
  61.     // сравнение имен в семьях вывод одинаковых имен в семьях 
  62.  
  63.     int oldMaxIndex = 0, oldMinIndex = 0;
  64.     for (int i = 0; i < count; ++i) {
  65.         int oldmax = 0;
  66.         int oldmin = 1000;
  67.         for (int j = 0; j < 5; ++j) {
  68.             if (families[i].fd[j].old > oldmax) {
  69.                 oldmax = families[i].fd[j].old;
  70.                 oldMaxIndex = j;
  71.             }
  72.             if (families[i].fd[j].old < oldmin) {
  73.                 oldmin = families[i].fd[j].old;
  74.                 oldMinIndex = j;
  75.             }
  76.         }
  77.         strcpy(oldmax_name[i], families[i].fd[oldMaxIndex].name);
  78.         strcpy(oldmin_name[i], families[i].fd[oldMinIndex].name);
  79.  
  80.         cout << oldmax_name[i] << " " << oldmin_name[i] << endl;
  81.     }
  82. }
  83.  
  84. int main()
  85. {
  86.     setlocale(LC_ALL, "Ru");
  87.     m_print();
  88. }
Success #stdin #stdout 0s 4888KB
comments (?)
stdin 
Standard input is empty
stdout 
masha dima
kostya oleg
dima kira
mikle stas
https://ideone.com/b78JSn
language:
C++ (gcc 8.3)
created:
5 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!