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 Scala (2.11.7) (judge verdict: Accepted)

import scala.annotation.tailrec
import scala.io.StdIn

object Main extends App {
  val c_price = 7
  val d_price = 4
  val N = StdIn.readInt()

  @tailrec
  def rec(c_count: Int = 0): Boolean = {
    if (c_count * c_price > N) {
      false
    } else {
      if ((N - (c_count * c_price)) % d_price == 0) {
        true
      } else {
        rec(c_count + 1)
      }
    }
  }

  val result = rec()
  if (result) {
    println("Yes")
  } else {
    println("No")
  }
}