fork download
copy 
  1. #include <stdio.h>
  2. #include <math.h>
  3.  
  4. int isPrime(int num) {
  5.     if (num <= 1) return 0;
  6.     if (num == 2) return 1;
  7.     for (int i = 2; i <= sqrt(num); i++) {
  8.         if (num % i == 0) return 0;
  9.     }
  10.     return 1;
  11. }
  12.  
  13. int main() {
  14.     int N, H;
  15.     scanf("%d %d", &N, &H);
  16.  
  17.     int A[50];
  18.     int prime[50];
  19.     int primeCount = 0;
  20.  
  21.  
  22.     for (int i = 0; i < N; i++) {
  23.         scanf("%d", &A[i]);
  24.         if (isPrime(A[i])) {
  25.             prime[primeCount++] = A[i];
  26.         }
  27.     }
  28.  
  29.  
  30.     if (primeCount == 0) {
  31.         printf("Wah angkanya ngga cocok nih!\n");
  32.         return 0;
  33.     }
  34.  
  35.  
  36.  
  37.     for (int i = 0; i < primeCount; i++) {
  38.         int sum = 0;
  39.         for (int j = i; j < primeCount; j++) {
  40.             sum += prime[j];
  41.             if (sum >= H) {
  42.                 printf("Wah angkanya cocok nih! Angkanya adalah");
  43.                 for (int k = i; k <= j; k++) {
  44.                     printf(" %d", prime[k]);
  45.                 }
  46.                 printf("\n");
  47.                 return 0;
  48.             }
  49.         }
  50.     }
  51.  
  52.     // Tidak ada kombinasi yang cukup
  53.     printf("Waduh angkanya kurang nih, minta Bedul dulu deh!\n");
  54.     return 0;
  55. }
  56.  
  57.  
Success #stdin #stdout 0s 5316KB
comments (?)
stdin
copy 
8 7
2 10 71 55 2 500 111 3
stdout
copy 
Wah angkanya cocok nih! Angkanya adalah 2 71
https://ideone.com/Txti8h
language:
C (gcc 8.3)
created:
2 days 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!