Timeline for Codility Frog Jump - Count minimal number of jumps from position X to Y
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 3, 2016 at 15:15 | comment | added | Vitaliy A | This ansver get score of 100: public int solution(int X, int Y, int D) { if(X == Y) return 0; int dist = Y - X; return dist%D == 0? dist/D: dist/D + 1; } | |
| Feb 20, 2015 at 9:32 | history | protected | CommunityBot | ||
| Apr 9, 2014 at 13:45 | answer | added | Marc-Andre | timeline score: 8 | |
| Apr 9, 2014 at 12:16 | answer | added | janos | timeline score: 24 | |
| Apr 9, 2014 at 7:09 | answer | added | PKopachevsky | timeline score: 6 | |
| Apr 9, 2014 at 6:15 | comment | added | Jerry Coffin | One word hint: "division". | |
| Apr 9, 2014 at 5:43 | history | edited | Jamal | CC BY-SA 3.0 |
deleted 21 characters in body; edited tags
|
| Apr 9, 2014 at 5:40 | history | asked | Sabarish | CC BY-SA 3.0 |