ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board
Discussion of Problem
1915
. Titan Ruins: Reconstruction of Bygones
green_smile
if array [1..16600000](longint) then crash(acces violation) if array[1..17000000] then memory exceed.... What to do????
[3] // Problem
1915. Titan Ruins: Reconstruction of Bygones
20 Oct 2012 14:06
What to do with this problem???
XQuader
Re: if array [1..16600000](longint) then crash(acces violation) if array[1..17000000] then memory exceed.... What to do????
[2] // Problem
1915. Titan Ruins: Reconstruction of Bygones
20 Oct 2012 14:10
Same problem, test#24
Pegasus
Re: if array [1..16600000](longint) then crash(acces violation) if array[1..17000000] then memory exceed.... What to do????
[1] // Problem
1915. Titan Ruins: Reconstruction of Bygones
1 Dec 2012 21:54
Me too, always access violation
LyanA
Re: if array [1..16600000](longint) then crash(acces violation) if array[1..17000000] then memory exceed.... What to do????
// Problem
1915. Titan Ruins: Reconstruction of Bygones
22 Dec 2012 15:33
if type 0 10^6-2 times, and 2 first elements would be nums, so num of elements in array would be 2^(10^6-2). I think that's the problem
© 2000–2026
Timus Online Judge Team
. All rights reserved.