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 JavaScript (node.js v5.12) (judge verdict: Accepted)

// B: Cakes & Donuts
"use strict";

const DEBUG_MODE = false;
const rawInput = DEBUG_MODE
  ? "83"
  : require("fs")
    .readFileSync("/dev/stdin", "utf8")
    .trim();

const process = inputRaw => {
  const cash = parseInt(inputRaw);
  let valid = false;

  if (cash%7 === 0 || cash%4 === 0) {
    valid = true;
  } else {
    // check all multiples of 4 and subtract from cash-7 and check if it is divisible by 7
    for (let i=4, lim=cash-7; i<=lim; i+=4) {
      if ((lim-i)%7 === 0) {
        valid = true;
        break;
      }
    }

    // if still not valid, do the reverse
    if (!valid) {
      // check all multiples of 7 and subtract from cash-4 and check if it is divisible by 4
      for (let i=7, lim=cash-4; i<=lim; i+=7) {
        if ((lim-i)%4 === 0) {
          valid = true;
          break;
        }
      }
    }
  }

  console.log(valid ? 'Yes' : 'No');
};

process(rawInput);