fork download
copy 
  1. // Question:06 Divisible 3 or Divisible by 5 ?
  2.  
  3. #include <stdio.h>
  4.  
  5. int divisible_1(int x[], int y);
  6. int divisible_2(int x[], int y);
  7. int divisible_3(int x[], int y);
  8.  
  9. int main()
  10. {
  11.    int h, i, num = 0;
  12.    scanf("%d", &h);
  13.  
  14.    int x[h];
  15.    for (i = 0; i < h; i++)
  16.    {
  17.       scanf("%d ", &x[i]);
  18.    }
  19.  
  20.    int sum1 = divisible_1(x, h);
  21.    int sum2 = divisible_2(x, h);
  22.    int sum3 = divisible_3(x, h);
  23.  
  24.    num = sum1 + sum2 + sum3;
  25.  
  26.    if (num == 0)
  27.       printf("-1");
  28.  
  29.    else
  30.       printf("%d", num);
  31.  
  32.    return 0;
  33. }
  34.  
  35. int divisible_1(int x[], int y)
  36. {
  37.    int j, num = 0;
  38.  
  39.    for (j = 0; j < y; j++)
  40.    {
  41.       if (x[j] % 3 == 0 && x[j] % 5 != 0)
  42.          num++;
  43.    }
  44.    return num;
  45. }
  46.  
  47. int divisible_2(int x[], int y)
  48. {
  49.    int k, num = 0;
  50.  
  51.    for (k = 0; k < y; k++)
  52.    {
  53.       if (x[k] % 5 == 0 && x[k] % 3 != 0)
  54.          num++;
  55.    }
  56.    return num;
  57. }
  58.  
  59. int divisible_3(int x[], int y)
  60. {
  61.    int l, num = 0;
  62.  
  63.    for (l = 0; l < y; l++)
  64.    {
  65.       if (x[l] % 3 == 0 && x[l] % 5 == 0)
  66.          num++;
  67.    }
  68.  
  69.    return num;
  70. }
Success #stdin #stdout 0s 5420KB
comments (?)
stdin
copy 
7
13 9 9 25 6 17 30
stdout
copy 
5
https://ideone.com/8XW0Sh
language:
C (gcc 8.3)
created:
1 year 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!