Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
[b][red]This message was edited by DarQ at 2004-2-4 11:20:34[/red][/b][hr]
i just started a week ago coding C, and i love it already! especially the fact that what i code in winNT, can be compiled on my linux box without a problem
But i have a question now to which i haven't found an answer yet.
today i made a thing that finds prime numbers. As the numbers grow larger, the proccess takes longer, but there is a trick for that
The problem now is, that i want to exceed the storage capacity of unsigned longs.. use numbers of about 10 MILLION digits.
now, 10 million might be a bit too much for now, but an unsigned long has certainly not enough digits.
can anyone kick my in the right direction?
NEW url--> http://mark.space.servehttp.com
0 · ·