In C , how do i create an array of size 10^9 ???
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To post to this group, send email to google-code@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googleg
It looks not easy to create that size array.
try to solve the problem without using larger arrays(use smaller arrays
with optimizations or try to find some trick)
Thanks
Kumar Anurag
On Sun, Jan 27, 2013 at 4:26 PM, Registered user
wrote:
> In C , how do i create an array of size 10^9 ???
>
> -
I had solved the *Watersheds* problem in the qualification round of GCJ
2009 using object-oriented programming style. I have dissected my solution
here - http://wp.me/p2e877-f .
I hope that at least new comers to GCJ may find it useful, if not the
veterans.
Please have a look.
--
You received
use malloc to create u wont be allocate this much size for integers
even if u use malloc,only for characters this much space will be
allocated
On Sun, Jan 27, 2013 at 5:06 PM, kumar anurag wrote:
> It looks not easy to create that size array.
>
> try to solve the problem without using larger arra
You can Create array upto Size 10^8
like this
long long int *arr = (long long int *)malloc( sizeof(long long int
)*(1) );
On 1/27/13, kumar anurag wrote:
> It looks not easy to create that size array.
>
> try to solve the problem without using larger arrays(use smaller arrays
> with opt
use some other logic don't try to manipulate with the storage logic
On Sun, Jan 27, 2013 at 11:36 AM, kumar anurag wrote:
> It looks not easy to create that size array.
>
> try to solve the problem without using larger arrays(use smaller arrays
> with optimizations or try to find some trick)
>
>
I guess you are trying HackerCup problem 3? The truth is that you do
not need 10^9, think of some O(k) algorithm instead of storing 10^9,
some patterns can be discovered.
Regards,
phunter
On Sun, Jan 27, 2013 at 2:56 AM, Registered user
wrote:
> In C , how do i create an array of size 10^9 ???
>
Thanks all for the reply ... :)
Really that was not needed, got the trick :))
On Sun, Jan 27, 2013 at 7:52 PM, Hongliang Liu wrote:
> I guess you are trying HackerCup problem 3? The truth is that you do
> not need 10^9, think of some O(k) algorithm instead of storing 10^9,
> some patterns can be
> I guess you are trying HackerCup problem 3? The truth is...
Please don't discuss problems from contests that are ongoing.
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, sen
