fork download
  1. #include <iostream>
  2. //using namespace std;
  3. int IsPrime(int n)
  4. {
  5. if (n < 2)
  6. return 0;
  7. int k = n / 2;
  8. while (n % k)
  9. {
  10. k--;
  11. }
  12. return(k > 1)?0:n;
  13. }
  14. main()
  15. {
  16. int a, b, c, s;
  17. std::cin >> a >> b >> c;
  18. s=IsPrime(a)+IsPrime(b)+IsPrime(c);
  19. std::cout << s << "\n";
  20. std::cout << ((IsPrime(s))?"Yes":"No");
  21. }
Success #stdin #stdout 0.01s 5540KB
stdin
3 5 11
stdout
19
Yes