DWITE '11 R2 #1 - Wandering Billy

View as PDF

Submit solution

Points: 5
Time limit: 2.0s
Memory limit: 64M

Problem type
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
DWITE, November 2011, Problem 1

Once upon a time, Little Billy romped about, passing by candy stores. However, that candy store has since shut down, and he has been deprived of the very essence of his life. In light of this existential crisis, his walks have never been quite the same. Today, he is aimlessly walking from his home (0, 0) to infinity, in search of his lost soul.

Billy's concerned parents would like to know where Billy is after N steps. They know that he can take two types of steps: one unit down or one unit to the right. He follows a predictable pattern: 1 step right, 2 steps down, 3 steps right, 4 steps down, and so on. That is, the sequence of steps begins as follows: R D D R R R D D D D.

The input will contain 5 test cases, each consisting of one line, containing the number of steps 0 \le N \le 100\,000.

Your output should contain 5 lines with two space-separated integers each, representing Billy's coordinates after N steps in the corresponding test case.

Sample Input

0
1
2
3
4

Sample Output

0 0
1 0
1 -1
1 -2
2 -2

Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0) Problem Resource: DWITE


Comments

There are no comments at the moment.