Problem:
Score : 200 points

Problem Statement

La Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.
Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.

Constraints

N is an integer between 1 and 100, inclusive.

Input

Input is given from Standard Input in the following format:

N

Output

If there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.

Sample Input 1

11

Sample Output 1

Yes

If you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.

Sample Input 2

40

Sample Output 2

Yes

If you buy ten cakes, the total will be 4 \times 10 = 40 dollars.

Sample Input 3

3

Sample Output 3

No

The prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <iomanip>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <sstream>
#include <complex>

using namespace std;

using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
using vvi = vector<vi>;
using iii = pair<int, ii>;
using viii = vector<iii>;

using ll = long long int;
using vc = vector<char>;
using vb = vector<bool>;
using ib = pair<int, bool>;
using vib = vector<ib>;

#define MOD 1000 * 1000 * 1000 + 7
#define INF 1000 * 1000 * 1000
#define X real()
#define y imag()

bool resuelveCaso(vb const& res) {
	int n;
	cin >> n;
	if (!cin) return false;
	if (res[n]) cout << "Yes\n";
	else cout << "No\n";

	return true;
}

int main() {
	vb res(101);
	res[0] = true;

	for (int i = 0; i <= 100; i = i+4) {
		res[i] = true;
	}

	for (int i = 7; i <= 100; i = i + 4) {
		res[i] = true;
	}

	for (int i = 14; i <= 100; i = i + 4) {
		res[i] = true;
	}

	for (int i = 21; i <= 100; i = i + 4) {
		res[i] = true;
	}

	for (int i = 0; i <= 100; i = i + 7) {
		res[i] = true;
	}

	for (int i = 4; i <= 100; i = i + 7) {
		res[i] = true;
	}

	for (int i = 8; i <= 100; i = i + 7) {
		res[i] = true;
	}

	for (int i = 12; i <= 100; i = i + 7) {
		res[i] = true;
	}

	for (int i = 16; i <= 100; i = i + 7) {
		res[i] = true;
	}

	for (int i = 20; i <= 100; i = i + 7) {
		res[i] = true;
	}

	for (int i = 24; i <= 100; i = i + 7) {
		res[i] = true;
	}

	while (resuelveCaso(res)) {}
	return 0;
}