fork download
  1. #include <stdio.h>
  2.  
  3. // Helper function to check if a number is prime
  4. int isPrime(int x) {
  5. if (x < 2) {
  6. return 0; // Not prime
  7. }
  8. for (int i = 2; i * i <= x; i++) {
  9. if (x % i == 0) {
  10. return 0; // Not prime
  11. }
  12. }
  13. return 1; // Prime
  14. }
  15.  
  16. // Function to check if a number is a super prime
  17. int isSuperPrime(int n) {
  18. if (isPrime(n) == 1 && isPrime(n - 2) == 1) {
  19. return 1; // Yes, it is a super prime
  20. }
  21. return 0; // No
  22. }
  23.  
  24. int main() {
  25. int n;
  26. scanf("%d", &n);
  27.  
  28. if (isSuperPrime(n) == 1) {
  29. printf("Yes\n");
  30. } else {
  31. printf("No\n");
  32. }
  33.  
  34. return 0;
  35. }
  36.  
Success #stdin #stdout 0s 544KB
stdin
50
stdout
No