Re: Printf problem with big numbers....

well, the problem was that these numbers are supposed to be converted
in base 2 later on....
So if 1234567890987654321 becomes 1234567890987654400, that is a big
problem isn't it ?
But I changed my algorithm, and now work directly in base 2, and
instead of printing the results in base 10 or base 2, I just print the
bits that are == 1 (for example x0x3x5x45x62), so now I deal with
strings, and not with numbers, so it is ok.

Thank U all for your help.

.

Relevant Pages

  • Re: Ada bench
    ... Matthew Heaney writes: ... > That was my source for the algorithm (in fact there's a comment to that ... The rotate of 1 was not good for small strings. ... Prev by Date: ...
    (comp.lang.ada)
  • Re: Fibonacci string
    ... > If we're allowed to change the algorithm as long as the same strings ... I think we should *always* consider a change in algorithm when playing ... Anno ... Prev by Date: ...
    (comp.lang.perl.misc)
  • Re: Fibonacci string
    ... > If we're allowed to change the algorithm as long as the same strings ... I think we should *always* consider a change in algorithm when playing ... Anno ... Prev by Date: ...
    (comp.lang.perl.misc)
  • Re: Print to printer
    ... HTML file, so your solution is good, but doesn't really work for me. ... Just reading the HTML file and the printing the content obviously ... but apparently this function only takes strings as parameters. ... Prev by Date: ...
    (comp.lang.python)
  • Re: Best Job Skill --> .NET or Java
    ... strings, ... But the same basic brute-force algorithm was ... It compiled a histogram of trigrams, ... finds one random trigram that is unique, it expands that one, ...
    (comp.programming)