BMJ - Bee Maja
Maja is a bee. She lives in a bee hive with thousands of other bees. This bee hive consists of many hexagonal honey combs where the honey is stored in.
But bee Maja has a problem. Willi told her where she can meet him, but because Willi is a male drone and Maja is a female worker they have different coordinate systems.
| |
|
|---|---|
Maja who often flies directly to a special honey comb has laid an advanced two dimensional grid over the whole hive.
|
Willi who is more lazy and often walks around just numbered the cells clockwise starting from 1 in the middle of the hive.
|
Help Maja to convert Willi's system to hers. Write a program which for a given honey comb number gives the coordinates in Maja's system.
Input
The input contains one or more integers which represent Willi's numbers. Each number stands on its own in a separate line, directly followed by a newline. The honey comb numbers are all less than 100 000.
Output
You should output the corresponding Maja coordinates to Willi's numbers, each coordinate pair on a separate line.
Sample Input
1
2
3
4
5
Sample Output
0 0
0 1
-1 1
-1 0
0 -1
hide comments
|
surayans tiwari(http://bit.ly/1EPzcpv):
2016-06-22 17:32:09
while(scanf("%d",&n) == 1) for EOF |
|
VenkateshP:
2014-05-25 14:22:48
any tricky test case please, I checked for all numbers(1 to 100000) it ran fine, but submitting here i'm getting NZEC |
|
saket diwakar:
2013-01-18 22:12:48
cool one...:) |
|
Romal Thoppilan:
2011-07-27 18:56:31
corrected it .... //A.C//
|
|
|
Romal Thoppilan:
2011-07-15 13:45:19
getting all testcases right.. but WA after 0.08 sec .... is it due to incorrect ending of the program |
|
vimal raj sharma old account:
2010-01-13 21:30:56
@ Troy
|
|
Troy:
2010-01-07 11:04:33
what is the terminating condition of the program? |
| Added by: | Andrés Leonardo Rojas Duarte |
| Date: | 2007-08-04 |
| Time limit: | 3.409s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
| Resource: | Ulm Local 1999 |
RSS