Skip to content
This repository was archived by the owner on Jun 26, 2025. It is now read-only.

Commit 0278895

Browse files
committed
up to and incl
1 parent 42ead55 commit 0278895

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

competition/02-fuzzbuzz/prob.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -23,12 +23,12 @@ In this problem, you will be given a number `N`, and you will output:
2323
- `FuzzBuzz` if the number is divisible by both 3 and 5,
2424
- the number itself if it is not divisible by either 3 or 5.
2525

26-
Your solution should count from 1 to `N`, and output the appropriate value for each number. Each output should be on a new line.
26+
Your solution should count from 1 up to and including `N`, and output the appropriate value for each number. Each output should be on a new line.
2727

2828
## Input format
2929

3030
The input is simply a single integer `N`, which is the maximum number to count to. `N` will be at least 1 and at most 1000.
3131

3232
## Output format
3333

34-
Output the appropriate value for each number from 1 to `N`, each on a new line.
34+
Output the appropriate value for each number from 1 up to and including `N`, each on a new line.

0 commit comments

Comments
 (0)