1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | CrossFire, A Multiplayer game for X-windows |
3 | |
3 | |
|
|
4 | Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | |
7 | This program is free software; you can redistribute it and/or modify |
8 | This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by |
9 | it under the terms of the GNU General Public License as published by |
… | |
… | |
125 | } |
126 | } |
126 | return (char *) s; |
127 | return (char *) s; |
127 | } |
128 | } |
128 | |
129 | |
129 | /* |
130 | /* |
130 | * Based on (n+1)^2 = n^2 + 2n + 1 |
|
|
131 | * given that 1^2 = 1, then |
|
|
132 | * 2^2 = 1 + (2 + 1) = 1 + 3 = 4 |
|
|
133 | * 3^2 = 4 + (4 + 1) = 4 + 5 = 1 + 3 + 5 = 9 |
|
|
134 | * 4^2 = 9 + (6 + 1) = 9 + 7 = 1 + 3 + 5 + 7 = 16 |
|
|
135 | * ... |
|
|
136 | * In other words, a square number can be express as the sum of the |
|
|
137 | * series n^2 = 1 + 3 + ... + (2n-1) |
|
|
138 | */ |
|
|
139 | int |
|
|
140 | isqrt (int n) |
|
|
141 | { |
|
|
142 | int result, sum, prev; |
|
|
143 | |
|
|
144 | result = 0; |
|
|
145 | prev = sum = 1; |
|
|
146 | while (sum <= n) |
|
|
147 | { |
|
|
148 | prev += 2; |
|
|
149 | sum += prev; |
|
|
150 | ++result; |
|
|
151 | } |
|
|
152 | return result; |
|
|
153 | } |
|
|
154 | |
|
|
155 | /* |
|
|
156 | * returns a char-pointer to a static array, in which a representation |
131 | * returns a char-pointer to a static array, in which a representation |
157 | * of the decimal number given will be stored. |
132 | * of the decimal number given will be stored. |
158 | */ |
133 | */ |
159 | char * |
134 | char * |
160 | ltostr10 (signed long n) |
135 | ltostr10 (signed long n) |