fork download
copy 
  1. #include <stdio.h>
  2.  
  3. int main()
  4. {
  5.  
  6.     int N[15];
  7.     int count_even = 0;
  8.     int count_odd = 0;
  9.  
  10.     for (int i = 0; i < 15; i++)
  11.     {
  12.  
  13.         scanf("%d", &N[i]); // 15 ta man nibe..
  14.     }
  15.     for (int i = 0; i < 15; i++)
  16.     {
  17.         if (N[i] % 2 == 0)
  18.         {
  19.             count_even++; // even koyta count korbe...
  20.         }
  21.         else
  22.         {
  23.             count_odd++; // odd koyta count korbe...
  24.         }
  25.     }
  26.  
  27.     int even[count_even];
  28.     int odd[count_odd];
  29.     int j = 0, k = 0;
  30.  
  31.     for (int i = 0; i < 15; i++)
  32.     {
  33.         if (N[i] % 2 == 0)
  34.         {
  35.             even[j] = N[i];
  36.             j++;
  37.         }
  38.         else
  39.         {
  40.             odd[k] = N[i];
  41.             k++;
  42.         }
  43.     }
  44.  
  45.     // for (int j = 0; j < count_even; j++)
  46.     // {
  47.     //     printf("%d\n", even[j]);
  48.     // }
  49.     // for (int k = 0; k < count_odd; k++)
  50.     // {
  51.     //     printf("%d\n", odd[k]);
  52.     // }
  53.     // int total_even_loop = count_even / 5;
  54.     // int total_odd_loop = count_odd / 5;
  55.     j = 0;
  56.     k = 0;
  57.  
  58.     for (int i = 0; i < 3; i++) // 3 because total 15 , each portion highest 3 loop to cheack all
  59.     {
  60.  
  61.         for (int i = 0; i < count_even; i++)
  62.         {
  63.             if (i < 5 && count_even >= 5)
  64.             {
  65.                 printf("par[%d] = %d\n", i, even[j]);
  66.                 j++;
  67.                 count_even--;
  68.                 }
  69.             else
  70.             {
  71.                 break;
  72.             }
  73.         }
  74.         for (int i = 0; i < count_odd; i++)
  75.         {
  76.             if (i < 5 && count_odd >= 5)
  77.             {
  78.  
  79.                 printf("impar[%d] = %d\n", i, odd[k]);
  80.                 k++;
  81.                 count_odd--;
  82.             }
  83.             else
  84.             {
  85.                 break;
  86.             }
  87.         }
  88.     }
  89.     if (count_odd < 5 && count_odd != 0)
  90.     {
  91.         for (int i = 0; i < count_odd; i++)
  92.         {
  93.             printf("impar[%d] = %d\n", k, odd[k]);
  94.             k++;
  95.             count_odd--;
  96.         }
  97.     }
  98.     if (count_even < 5 && count_even != 0)
  99.     {
  100.         for (int i = 0; i < count_even; i++)
  101.         {
  102.             printf("par[%d] = %d\n", i, even[j]);
  103.             j++;
  104.             count_even--;
  105.         }
  106.     }
  107.  
  108.     return 0;
  109. }
  110.  
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
par[0] = 0
par[1] = 0
par[2] = 0
par[3] = 0
par[4] = 0
par[0] = 0
par[1] = 0
impar[0] = 15774463
impar[1] = 32765
par[0] = 194
par[1] = 0
https://ideone.com/hoJRuY
language:
C (gcc 8.3)
created:
4 hours 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!