Tracks
/
Scheme
Scheme
/
Exercises
/
Leap
Leap

Leap

Easy
OverviewCommunity Solutions

Introduction

A leap year (in the Gregorian calendar) occurs:

  • In every year that is evenly divisible by 4.
  • Unless the year is evenly divisible by 100, in which case it's only a leap year if the year is also evenly divisible by 400.

Some examples:

  • 1997 was not a leap year as it's not divisible by 4.
  • 1900 was not a leap year as it's not divisible by 400.
  • 2000 was a leap year!
Note

For a delightful, four-minute explanation of the whole phenomenon of leap years, check out this YouTube video.

Instructions

Your task is to determine whether a given year is a leap year.

Running and testing your solutions

From the command line

Simply type make chez if you're using ChezScheme or make guile if you're using GNU Guile. Sometimes the name for the scheme binary on your system will differ from the defaults. When this is the case, you'll need to tell make by running make chez chez=your-chez-binary or make guile guile=your-guile-binary.

From a REPL

  • Enter (load "test.scm") at the repl prompt.
  • Develop your solution in leap.scm reloading as you go.
  • Run (test) to check your solution.

Failed Test Cases

If some of the test cases fail, you should see the failing input and the expected output. The failing input is presented as a list because the tests call your solution by (apply leap input-list). To learn more about apply see The Scheme Programming Language -- Chapter 5

Source

CodeRanch Cattle Drive, Assignment 3The link opens in a new window or tab
Edit via GitHub The link opens in a new window or tab
Scheme Exercism

Ready to start Leap?

Sign up to Exercism to learn and master Scheme with 39 exercises, and real human mentoring, all for free.

Sign up, it’s free! Log in to Exercism
Deep Dive into Leap!

Deep dive into the different algorithms and approaches you can use to solve Leap, as Jeremy and Erik explore interesting Community Solutions across 10 different languages on Exercism.