## Fizz Fuzz

View as PDF

Points: 5 (partial)
Time limit: 2.0s
Memory limit: 16M

Authors:
Problem types
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig
##### Prep 2

While doing homework for computer science class, you stumble across an interesting problem asking you to simulate the popular game Fizz Fuzz. The rules for Fizz Fuzz is as follows: Simultaneously keep track of two numbers, both starting from 1, the first number increasing by one each round, the other number increasing by two each round. Every time you reach a number that is divisible by 7, output Fizz. Every time you reach a number divisible by 13, output Fuzz. If the number is divisible by both 13 and 7, instead of outputting Fizz or Fuzz, output Fizz Fuzz (the output might get confusing!). Otherwise, output the number. Can you simulate this game for rounds?

#### Input Specification

The first and only line of input has one integer, .

#### Output Specification

You should output lines. the line should correspond with the round. That is, output the two numbers (or strings) space separated.

#### Sample Input

9

#### Sample Output

1 1
2 3
3 5
4 Fizz
5 9
6 11
Fizz Fuzz
8 15
9 17

Note: As a further example, if the 2 numbers happen to be 91 and 91, you need to print Fizz Fuzz Fizz Fuzz.