Follow the instructions in the Source-Checkout tab of the project.
You'll need a version control client.
well um.. ok for now i used a internet html spider to download all the
ocntents of my project directory...
thaanks!
--
You received this message because you are subscribed to the Google
On May 7, 9:48 pm, zwetan zwe...@gmail.com wrote:
Is there any way to link the README file in a project to its front
page on Google Code, in the way that GitHub does? I realise you can
copy and paste the README file, but then you need to do that every
time the file is changed and the
dear google code group:
I found cannot visit my project，http://leonardocheng.googlecode.com。
I've checked the Google Code Term of Use and I think this is probably
the reason why I'm banned. I'm deeply sorry for the mistakes I made
before, and I promise I will not violate the Term of Use of
If you submit sensitive information and do a repository reset the
sensitive changes you made earlier still show up in your project
updates. I know it's important to retain project history, etc. But,
it's also important for those users to be able to do what they want
with their project history.
I don't think we understand what you're looking at when you say you're
trying to download all the source. Which project are you looking at? Give
us a URL that demonstrates what you mean.
On May 9, 2010 6:31 AM, Rafal Grasman grasmane...@gmail.com wrote:
Follow the instructions in the
I believe we gave reached our quota in the miranda project as we are getting
an error on svn commits. Could we have our quota increased?
http://code.google.com/p/miranda/
Robert Rainwater
--
You received this message because you are subscribed to the Google Groups
Project Hosting on Google
On Sun, May 9, 2010 at 9:20 AM, Robert Rainwater rainwa...@gmail.comwrote:
I believe we gave reached our quota in the miranda project as we are
getting an error on svn commits. Could we have our quota increased?
http://code.google.com/p/miranda/
According to
Maybe you got the same problem Commit failed unexpectedly --- please
try again later as some others here
http://code.google.com/p/support/issues/detail?id=3927
--
You received this message because you are subscribed to the Google Groups
Project Hosting on Google Code group.
To post to this
SVN experienced a commit outage this morning from approximately
7:00-8:20AM pacific time. The issue has been corrected
and all projects should be able to commit again. Sorry for the
inconvenience!
--
You received this message because you are subscribed to the Google Groups
Project Hosting on
On Sun, May 9, 2010 at 10:12 AM, blobsnarf pieter.vang...@gmail.com wrote:
I just made a new google code project but when trying to access the
svn repository I get a Could not open the requested SVN filesystem
error.
It looks like there was an error in creating your repository, possibly
Your welcome. No, I am from Venezuela.
Carlos Guía
On Sun, May 9, 2010 at 1:25 AM, Mathias Grimm mathiasgr...@gmail.comwrote:
Thanks Carlos.
Are you from brazil to?
On Sun, May 9, 2010 at 1:43 AM, Carlos Guia zyx3d...@gmail.com wrote:
I recommend you check www.topcoder.com/tc, they
AFAIK, it is ok to use additional modules as long as they are also
freely available for everyone else. Probably a good idea include the
URL to it in a comment.
I think I saw solutions that used psyco last year.
On May 9, 2:29 am, Dario Cangialosi dario.cangial...@gmail.com
wrote:
What if I use
On Sat, May 8, 2010 at 13:48, giri seshagiri...@gmail.com wrote:
I have solved the small input but the time for submitting large input
expired. The code I submitted works for both, as far as I know. Will
it be run against large inputs too during evaluation or I lost the 23
points already?
Were there any time-contraints on the solutions for large data sets?
especially Theme Park.
Some programs that I tried took upto 4-5 minutes to produce output
files.
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send
Or you can quickly find solutions to each problem in a specific programming
language here:
http://www.go-hero.net/jam/10/solutions
On Sun, May 9, 2010 at 01:47, Carlos Guia zyx3d...@gmail.com wrote:
On the scoreboard, you can select the Download solutions check, then you
can download anyone's
Yes, I have this problem with the first Snapper Chain and I suggest
to give the large input another try to recognize and enhance the
problem performance
On May 8, 9:12 pm, goutham goutham...@gmail.com wrote:
well I got the prob with Theme Park... the small inputs were solving
good but the large
It was needed N events... 2 wasn't enough...
2010/5/9 Bharath Raghavendran rbharat...@gmail.com
Its so easy to prove that the prophecy is wrong ... Take the
chronologically first distinct two occurrences of the apocalypse. Now, if
you consider the prophecy one slarbosecond after the second
By classes I don't mean just data structures, but also some basic algorithms
(like intersections and such), that are not usually hard to implement, but
it saves you a considerable amount of time if you have it done. Not to
mention regular expressions operations.
On Sun, May 9, 2010 at 12:07 AM,
On Sun, May 9, 2010 at 1:43 AM, Carlos Guia zyx3d...@gmail.com wrote:
They also have a yearly big contest, www.topcoder.com/tco10, the next
qualification round is this Wednesday if I remember correctly.
If I am not mistaken, the registration period has ended for tco10. But the
advice is
The apocalypse can't happen before the day of reckoning, can it?
On Sun, May 9, 2010 at 2:43 PM, Gustavo Pacianotto Gouveia
gustavo.paciano...@gmail.com wrote:
It was needed N events... 2 wasn't enough...
2010/5/9 Bharath Raghavendran rbharat...@gmail.com
Its so easy to prove that the
Mathematics is base for all algorithms. Algorithm is Mathematics!
Someone indicate a book, tutorial or anything for help me?
I've read an Top Coder tutorial, but a need more.
--
Att.
Mathias Grimm
http://mathiasgrimm.com.br
http://phpempregos.com.br
--
You received this message because you
If you want to learn Maths I recommend you to read Problem Solving
Strategies from Arthur Engel. You can search for the e-book on the web.
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to
There is not A BOOK of Mathematics. But if you want a good one to help on
algorithm design, I'd recommend *Concrete Mathematics: A Foundation for
Computer Science, by Knuth et al.*
On Sun, May 9, 2010 at 11:27 AM, Mathias Grimm mathiasgr...@gmail.comwrote:
Mathematics is base for all
On Sun, May 9, 2010 at 7:29 AM, Rahul Gulati (Phoenix)
rahul.neot...@gmail.com wrote:
Is there a way that I could see my who all have been selected from my
country except for putting in the usernames of all in the add friend box?
http://www.go-hero.net/jam/10/regions
On Sun, May 9, 2010
Me too was wondering that :)
On Sun, May 9, 2010 at 7:59 AM, Rahul Gulati (Phoenix)
rahul.neot...@gmail.com wrote:
Is there a way that I could see my who all have been selected from my
country except for putting in the usernames of all in the add friend box?
On Sun, May 9, 2010 at 7:45 AM,
That means compiling the program several times (one for the test, one
for the small input, one for the large input...). You can compile one
time using the standard input and output
#include
#include
#include
#include
...
(defines)
using namespace std;
int main()
{
string
Well, I've thought of some solutions and I think maybe solution 4
would be the best :)
1. O(RN)naive search
naive.
2. O(RlgN) binary search
well, quite easy to think of. but according to the size of the test
data, it is quite risky.
3. O(R+N) queue
just
I went through the same thing while wanting to submit the large input for C.
I hope in the future there will be a solution for this kind of problems.
2010/5/9 Douglas Drumond drumond.doug...@gmail.com
On Sat, May 8, 2010 at 14:43, cstechguy ms.cs.e...@gmail.com wrote:
I successfully completed
Hello all,
Is anyone interested in discussing the algorithm for Snapper Chain.
What was the right approach to it?
PS: I have seen some solved source code. But, would like to know about the
approach.
Thanks,
Varun
--
You received this message because you are subscribed to the Google Groups
yeah Thanks! :)
On Sun, May 9, 2010 at 10:42 AM, Dhruva Sagar dhruva.sa...@gmail.comwrote:
Hi Prateek, you can simply download the solution of someone who solved it
correctly and run his program to get the correct output.
On Sun, May 9, 2010 at 07:54, Prateek Tambi
Thanks mate!
Regards,
Rahul Gulati
On Sun, May 9, 2010 at 10:19 AM, Carlos Guia zyx3d...@gmail.com wrote:
You can here, http://go-hero.net/jam/
http://go-hero.net/jam/
Carlos Guía
On Sat, May 8, 2010 at 10:29 PM, Rahul Gulati (Phoenix)
rahul.neot...@gmail.com wrote:
Is there a way
Yeah!
On 9 May 2010 05:39, Nikaustr nikau...@gmail.com wrote:
Definitely!
On May 9, 12:53 am, Luke Pebody luke.peb...@gmail.com wrote:
I really like the new website layout. The archive sections look awesome
now.
--
You received this message because you are subscribed to the Google
When we willl get confirmation mail that we have qualified
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
Yep, agree
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googlegroups.com.
For more options, visit this
Even i faced the same problem...!
On Sat, May 8, 2010 at 11:42 PM, goutham goutham...@gmail.com wrote:
well I got the prob with Theme Park... the small inputs were solving
good but the large inputs contained loops for 100,000,000 which are
huge and time consuming and all my 8 min
@ Felipe
Is the competition for international teams as well? If so, could you please
post a link related with the competition.
On Sun, May 9, 2010 at 7:41 PM, Felipe Sodré Silva fso...@gmail.com wrote:
On Sun, May 9, 2010 at 1:43 AM, Carlos Guia zyx3d...@gmail.com wrote:
They also have a
A good book for algorithms is Introduction to Algorithms by Cormen.
On Sun, May 9, 2010 at 7:57 PM, Mathias Grimm mathiasgr...@gmail.comwrote:
Mathematics is base for all algorithms. Algorithm is Mathematics!
Someone indicate a book, tutorial or anything for help me?
I've read an Top Coder
I just made the large input case for problem C by storing 'next
position' and 'cash' arrays, then just iterating over them R times.
This seems to be O(N+R). But I've been wondering about possible
optimizations to this. I can think of an O(NlogR) solution in which I
nest the 'next position' and
Can anybody explain how the problem can be optimized to O(N) as
mentioned in the the last of contest analysis for this problem.
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
hey all..
my first time in GCJ.. it was really nice experience.. but i had
terrible luck :(
In problem C i first used brute force method n solved for small
input.. it worked.. but then realized that it wont be able to process
the large input data set..
So changed the whole code n tested it a lot..
Guys,
I am wondering what all optimization we can really do.
Though, in the qualification, for the theme park problem, i could not
solve the large input problem in the given time frame, i optimized it
latter in the practice mode.
These are the optimization that I did.
for each test case,
1. if
Hi,
My source code for Problem C in qualification round GCJ 2010 is
rejected for some unknown reason!
At the time of submission i got submission successful message. Now,
i see ' 1 wrong try' message.
I have downloaded a correct source code written by 'epsalon' (Rank
2360) for large input data.
maratona.ime.usp.br
On Sun, May 9, 2010 at 11:13 AM, Rahul Gulati (Phoenix)
rahul.neot...@gmail.com wrote:
@ Felipe
Is the competition for international teams as well? If so, could you please
post a link related with the competition.
On Sun, May 9, 2010 at 7:41 PM, Felipe Sodré Silva
http://code.google.com/codejam/contest/dashboard?c=433101#s=aa=2
On Sun, May 9, 2010 at 4:09 PM, Chethan B chethu1...@gmail.com wrote:
Hi,
My source code for Problem C in qualification round GCJ 2010 is
rejected for some unknown reason!
At the time of submission i got submission successful
Looking at it from the other side, though, you can see how people
might think that this could be abused by people, say, switching off
their router immediately after downloading the data.
On Sun, May 9, 2010 at 8:13 AM, Mario Ynocente Castro ycma...@gmail.com wrote:
I went through the same thing
http://code.google.com/codejam/contest/dashboard?c=433101#s=aa=2
On Sun, May 9, 2010 at 12:33 PM, Pakku lingada...@gmail.com wrote:
Guys,
I am wondering what all optimization we can really do.
Though, in the qualification, for the theme park problem, i could not
solve the large input
I can see O(N log r), but O(N) seems pretty tough.
On May 9, 12:21 pm, coder.ankur guptaank...@gmail.com wrote:
Can anybody explain how the problem can be optimized to O(N) as
mentioned in the the last of contest analysis for this problem.
--
You received this message because you are
Here's a simple analysis:
Imagine 3 lights plugged into a wall at the right and the state is 1 if it
is on, and 0 if it is off.
so for each 'click' the states will be:
00 0 0
10 0 1
20 1 0
30 1 1
41 0 0
51 0 1
61 0 1
7
@Felipe : Thanks for the link. That's pretty much what i have done..
My code takes couple of seconds to process large data set.
On May 10, 12:17 am, Felipe Sodré Silva fso...@gmail.com wrote:
http://code.google.com/codejam/contest/dashboard?c=433101#s=aa=2
On Sun, May 9, 2010 at 4:09 PM,
*i think you had same issue as me*
*
*
*i use Int32 in C# to calculate the result *
*i wasn't enough :)*
*
*
*and as i did it, the compiler didn't warned me*
*
*
*
*
*i rechecked that with int 64 and the result was correct.*
*
*
On Sun, May 9, 2010 at 10:10 PM, Chethan B chethu1...@gmail.com
@Hassan : Hmmm.. I used perl.. I dont think perl has any such
restrictions in size of variables. or is there any?? The point is my
output exactly matches with the supposedly 'correct' output..
On May 10, 1:17 am, Hassan . torlk...@gmail.com wrote:
*i think you had same issue as me*
*
*
*i
You can download your own submissions, and check if you did send the right
file.
64 bits are indeed needed.
Carlos Guía
On Sun, May 9, 2010 at 4:17 PM, Hassan . torlk...@gmail.com wrote:
*i think you had same issue as me*
*
*
*i use Int32 in C# to calculate the result *
*i wasn't enough
@Carlos: I would really like to do that, download my own submission
and check if i have sent the right file... but the problem is, its not
available for download.. as i mentioned earlier, i had to do lots of
optimization for large data and hence my source code for small data is
different from my
On May 9, 9:57 pm, Brian Watkins wildu...@gmail.com wrote:
I can see O(N log r), but O(N) seems pretty tough.
http://pastebin.com/z8h82e99 is a Python implementation of the O(N)
algorithm. The difference is in the jump table calculation: instead of
calculating each entry independently, use a
*check this link*
*http://code.google.com/codejam/contest/scoreboard?c=433101#st=nbrvf=1
*
*you will find their there
*
On Sun, May 9, 2010 at 10:32 PM, Chethan B chethu1...@gmail.com wrote:
@Carlos: I would really like to do that, download my own submission
and check if i have sent the right
Hi Chethan,
I replied to the other thread, but don't know why it did not get
through:
- About your output, it is not exactly the same as the others. Here is
one line from your submission:
Case #32: 1.46888007111242e+015
This will not be accepted, since the problem is expecting the exact
answer,
Thanks very much Hassan. I am also trying at that same link. The
source code for Problem C, large data is not available in my case. It
simply says, 1 wrong try.
On May 10, 1:39 am, Hassan . torlk...@gmail.com wrote:
*check this link*
oops! I meant bear* with me :)
On May 10, 1:57 am, Chethan B chethu1...@gmail.com wrote:
Thanks Benetin. Thats mighty nice of you. That piece of info is really
helpful.
Now i just have to find out why i am getting the same Case #32:
1.46888007111242e+015 output when i try to run epsalon's
It seems to be the difference in configuration. I don't know Perl.
Maybe some Perl experts can help. Or Google about Perl 64 bit
integers.
On May 9, 5:00 pm, Chethan B chethu1...@gmail.com wrote:
oops! I meant bear* with me :)
On May 10, 1:57 am, Chethan B chethu1...@gmail.com wrote:
Ok I'm want really to discuss it
because I solve it using a very simple way.
only single operation!!! :D :D
I deduced a formula relates the number of snappers by the number of clicks
if it satisfy the formula so the lamp is ON ;otherwise the lamp is off
Indeed this method is sooo
Chethan,
You need to use diff to see if the output is exactly the same, except
for some trailing spaces.
Here is the one of the output line I found from yours:
Case #32: 1.46888007111242e+015
This will not be accepted, since the problem is expecting the exact
answer, as epsalon's solution does.
Hi Chethan,
I replied to the other thread, but don't know why it did not get
through:
- About your output, it is not exactly the same as the others. Here is
one line from your submission:
Case #32: 1.46888007111242e+015
This will not be accepted, since the problem is expecting the exact
answer,
I think it's related to the output format
in c++ I'm casting the double to long integer so that the answer is exact
without floating point or exponent
On Sun, May 9, 2010 at 11:00 PM, Chethan B chethu1...@gmail.com wrote:
oops! I meant bear* with me :)
On May 10, 1:57 am, Chethan B
take a look here
http://en.wikipedia.org/wiki/Pigeonhole_principle
what you have to do is to get a cycle on the groups and the cycle will
always be found in O(N)(this is proofed by the Pigeonhole Principle).
then the answer will be something like that = before cycle+(cost of
cycle*number of
You forgot 2 solutions.
X. O(N^2) - calculate next[i] and value[i] for O(N^2), then find a cycle for
O(N) and what happens before it for O(N).
Y. O(NlogN) - as previous, but calculate next and value for O(NlogN)
On Sun, May 9, 2010 at 10:47 AM, guest naieel...@gmail.com wrote:
Well, I've
Is you use double, then are you sorry that your answer is exact?
On Mon, May 10, 2010 at 1:10 AM, Abdelrhman Abotaleb
profvip.abota...@gmail.com wrote:
I think it's related to the output format
in c++ I'm casting the double to long integer so that the answer is exact
without floating point
Hi.
I think, my solution for Problem C will work not correctly, if R (number
of step when we enter to a cycle).
But I couldn't find an example, when we enter to a cycle later then after
the first running. In small and large inputs there is no such example, too.
Can anybody find it, or it doesn't
I used that same formula to solve the problem too (I was looking the
interval of clicks the lamp switched on) and it worked perfect. But reading
the contest analisys... i think analisys' solution is more elegant and
simply than mine... :)
Well, the problem was solved and that's the important :D
You can't find incorrect solutions at the scoreboard, but if you go the
contest page, where the problem statements are. Below the ask a question
link on the left, there is a view my submissions, there you should be able
to download the input, output and source you sent.
Carlos Guía
On Sun, May
both are exactly the same solution.. think.. how to calculate this?
... The solution to the problem is then very simple. The answer is ON if
and only if the rightmost *N* bits of *K* are 1. ...
the rightmost N bits are represented as: 2^{N}-1 = 000...0...11 (N
ones)
(2^N-1) (K) ==
Do you mean like this?
1
5 7 5
1 1 5 6 5
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
Ooops...
1
1 7 5
1 1 5 6 5
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googlegroups.com.
For more
Ok, it seems that the logic I happened to deduce was a little (subtle)
different than everyone elses.
For 2 snappers this is how the state changes
0 0
snap
1 0
snap
0 1
snap
1 1
So the above shows that for 2 snappers the light turns on in 3 snaps = 2^N-1
snaps. But then when you look at the
I was thinking the same way as Jacob to treat it as a N-bit binary
number, then thing will be much easier.
So N is number of snappers and K0 is a mount of time the finger snaps
to turn on the lights
So
N:K
1:2
2:4
3:8
4:16
This way I can check if the snaps actually make the lights on or not.
I
hi,
in C, normally we use printf(%0.0lf,n) to ignore the decimal part..
while printing..
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send
yeah, You are right, even I got a bit confused.. as my theme park
source code didn't work on the large input set..
I was considering running it on another computer with a higher
config( I have Core2Duo with 1GB RAM) .
But nevertheless,.. I realised after submitting my Snapper Chain
output that
i have downloaded a 30-day trial version of mathematica 6.0 for gcj
which is available freely over the internet. so can i use it to solve
problems in gcj 2010?
On May 10, 6:14 am, Bartholomew Furrow fur...@gmail.com wrote:
Doesn't this mean that Mathematica isn't allowed?
Yes, it does (unless
hi, this is a general question to all coding fans...for running
programs fairly fast what kind of computer should one use? what should
be the minimum processor and memory requirement? i am currently using
1gb of ram but i am planning on increasing this. is this going to help
solving problems
I use a netbook and ideone.com
Sent on the TELUS Mobility network with BlackBerry
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
i have downloaded a 30-day trial version of mathematica 6.0 for gcj
which is available freely over the internet. so can i use it to solve
problems in gcj 2010?
From the rules:
Time-limited trials for compilers and interpreters are disallowed.
The reason for this is that if I've previously
hi,
in C, normally we use printf(%0.0lf,n) to ignore the decimal part..
while printing..
Though if you're doing a floating-point calculation for something with an
exact integer answer, you're probably doing something wrong, and should
consider using long long instead.
--
You received this
printf(0.0lf,n) doesn't ignore decimal part, it rounds up to the nearest
integer value, to really discard (truncate) you should use
printf(%d,(int)n);
On Mon, May 10, 2010 at 12:33 AM, Bartholomew Furrow fur...@gmail.comwrote:
hi,
in C, normally we use printf(%0.0lf,n) to ignore the decimal
The same thing happened with my program. It looks as if the official
data is only concerned with checking efficiency for large cases, not
smaller border cases.
On May 10, 8:13 am, Mikhail Dektyarev
mihail.dektya...@googlemail.com wrote:
Hi.
I think, my solution for Problem C will work not
or type cast your final result
(long)Double_Var
On Mon, May 10, 2010 at 5:33 AM, Bartholomew Furrow fur...@gmail.comwrote:
hi,
in C, normally we use printf(%0.0lf,n) to ignore the decimal part..
while printing..
Though if you're doing a floating-point calculation for something with an
But Already there are about Five participants submitted their solutions
using mathmatica
Is it allowed only in the qualification round but not for the next rounds
or what!?
On Mon, May 10, 2010 at 5:31 AM, Bartholomew Furrow fur...@gmail.comwrote:
i have downloaded a 30-day trial version of
Then could I use MATLAB Code [Its equivalent octave is free and the code is
the same]??!!
On Mon, May 10, 2010 at 6:09 AM, Abdelrhman Abotaleb
profvip.abota...@gmail.com wrote:
But Already there are about Five participants submitted their solutions
using mathmatica
Is it allowed only in the
86 matches
Mail list logo
