Don't use (int)log10(n)+1 to count the length of n.
It may cause error because of accuracy.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Don't use (int)log10(n)+1 to count the length of n.
It may cause error because of accuracy.
Name |
---|
Instead, try this:
It's just a few lines of code. I know speed is crucial here, but this can be typed in 15 seconds. Using floating point arithmetic for things that can be done with integer arithmetic is not recommended.
Here's an even faster way :)
Integer.valueOf(x).toString().length();
(""+x).toString().length();
even faster and in C:
len=sprintf(buf,"%d",x);
Quite elegant, but, the code i posted works in every base and takes a lot less time because it doesn't rely on string operations. Whatever suits people's needs.
Yours is shorter, but it takes longer to type.
Integer.toString(x).length();
Integer.toString(x,17).length(); // Different base
Since it's a string operation I use it when I know it won't effect too much on the speed.