View Code of Problem 119

#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;

bool isPrime(long long num)
{
    if (num <= 3)
        return true;
    for (long long i = 2; i <= sqrt(num); i++)
    {
        if (num % i == 0)
            return false;
    }
    return true;
}

int main()
{
    long long n;
    int cnt = 1;
    while (cin >> n)
    {
        if (isPrime(n))
            printf("Case #%d: I'm richer than any one\n", cnt);
        else
            printf("Case #%d: What a fxcking day\n", cnt);
        cnt++;
    }
    return 0;
}