It's not possible to rename a project, sorry. So you can easily
delete the old project yourself and create the new one yourself. You
appear to have no content yet, so there's no data to migrate. Very
easy. :-)
On Tue, Sep 8, 2009 at 1:30 AM, Jeroenjeroen.vansteirteg...@gmail.com wrote:
I
Hi,
I don't wanna be rude but...I kinda need a little bit more space for
my kaiser-hero (Android on HTC TyTN II) project -
http://code.google.com/p/kaiser-hero/.
The latest archive right now has 130MB, so I suppose 200MB will be
great. The maximum file-size that I suppose I will have (in distant
We currently only support a maximum file size of 200MB. I've increased
your quota to that maximum but unfortunately you will need to find an
alternative for your files if they grow beyond 200MB.
Nathan
On Tue, Sep 8, 2009 at 8:39 AM, Razvarazvan.ro...@gmail.com wrote:
Hi,
I don't wanna be
Your email said that you'd create a new project and that name is taken.
So...what are you asking for?
Chris
On Tue, Sep 8, 2009 at 2:30 AM, Jeroen jeroen.vansteirteg...@gmail.comwrote:
I hope that is not a problem? :$
-Jeroen
On Sep 6, 5:51 pm, Jeroen jeroen.vansteirteg...@gmail.com wrote:
Sorry for all confusion, I want to rename project jap, because a
similar project with the same project name already exists (that
project is not hosted on google code though).
Since I cannot rename project jap, I will create a new project
apjp and delete project jap.
Thanks!
-Jeroen
On Sep 8,
Ben, thank you, I'll look into that!
On Tue, Sep 8, 2009 at 3:51 PM, Ben Collins-Sussman suss...@google.comwrote:
On Tue, Sep 8, 2009 at 1:40 PM, Jorge Handljha...@gmail.com wrote:
# svnsync init https://project.googlecode.com/svn file:///svnrepo
svnsync: Unrecognized URL scheme for
I am displeased with the way Google code displays almost my entire
email address. I want to hide my entire email address. Because Google
Code does not allow this, I want to delete my Google Code account.
However, I do not want to delete my entire Google account (Google
Voice, in particular).
Which display of your email address are you objecting to? There is a
privacy section of your user settings page at
http://code.google.com/hosting/settings
Your email address format is controlled by the first option in that
section, so it could be either seen as x0zero or x0z...@gmail.com.
Thank you for your reply. As you point out, the only two options are:
1. show my entire email address with no privacy
2. show most of my email address, which includes my full domain name
and enough of the user name to give spammers plenty of clues about my
full email address.
I object to both
Ok, that fixed the unrecognized URL scheme error. But now I'm getting
another error:
svnsync: DAV request failed; it's possible that the repository's
pre-revprop-change hook either failed or is non-existent
I checked my local repository and it does hace a pre-revprop-change hook
that is not
The *destination* repository is what's being complained about here,
not your source repository. Try doing 'svn proplist -v --revprop -r0
destinationURL'. If you see svnsync properties there, remove them.
Then re-run 'svnsync init'.
On Tue, Sep 8, 2009 at 3:12 PM, Jorge Handljha...@gmail.com
Thanks Ben, that was it. I had a svn:date unversioned property here, which I
deleted and now I was able to init the google repository. I'm confident that
I can sync the repository now.
On Tue, Sep 8, 2009 at 5:35 PM, Ben Collins-Sussman suss...@google.comwrote:
The *destination* repository is
*(This is a question for subversion experts. I know it doesn't
strictly belong **here, but the subversion users mailing list seems to be
orphan, I've been *
*waiting for five days for the admins to approve my subscription).
*
I'm trying to prepare a project for uploading into google code. This
No. You have to write the code yourself. If you understand the code.
You'll be able to write it from scratch easily ;)Check
http://en.wikipedia.org/wiki/Disjoint-set_data_structure
On Sep 8, 12:51 am, Satyajit Malugu malugu.satya...@gmail.com wrote:
I think that it's harder to do it that
The No was meant to which I think uses this Union find mechanism..
Those Set classes allows you to insert, delete or find in an efficient
way, mas not merging which is what this problem is really about.
On Sep 8, 9:49 am, Miguel Oliveira mr.miguel.olive...@gmail.com
wrote:
No. You have to write
Ops, the last frase should be but not merging which is what this
problem is really about.
On Sep 8, 10:57 am, Miguel Oliveira mr.miguel.olive...@gmail.com
wrote:
The No was meant to which I think uses this Union find mechanism..
Those Set classes allows you to insert, delete or find in an
Yes smloh you are right. Hash map does not return objects in order they
inserted. Thats why I have used Array List inside hash map. I have made
Character, ArrayList pair inside hash map. The Character key will hold all
distinct characters from welcome to google code jam string. The
corresponding
Thank u very much for ur reply
On Tue, Sep 8, 2009 at 3:08 AM, gis...@utumno.pl wrote:
On Sun, 6 Sep 2009 20:07:47 -0700 (PDT), decor avdb...@gmail.com wrote:
Can anyone explain How to solve 2008 Practice Round Square Fields
Problem? I m not getting even the slightest of idea of how to go
But please tell me how are u varying length?
On Tue, Sep 8, 2009 at 3:08 AM, gis...@utumno.pl wrote:
On Sun, 6 Sep 2009 20:07:47 -0700 (PDT), decor avdb...@gmail.com wrote:
Can anyone explain How to solve 2008 Practice Round Square Fields
Problem? I m not getting even the slightest of idea
The sample input has 2 test cases. The first, 3 3 3, tell you that
Solvable(3,3,3) is true. So, you are asked,
what is the maximum number F such that Solveable(F,3,3) is true,
what is the minimum number D such that Solveable(3,D,3) is true,
what is the minimum number B such that
When I was learning C++, I used this reference site a lot (still use):
http://www.cplusplus.com/reference/algorithm/
I believe the most important to learn are STL algorithms and containers.
P.S. I can link to other sites right?
On Tue, Sep 8, 2009 at 1:09 PM, blue
Then why not the number is 8? Using your logic, 3 attempts and 3 broken eggs
can be used on a 8 floor building.
Part of the explanation.
Attempt on 4, does not break, attempt on 6- does not break, attempt on 8. If
breaks answer is 7 does not answer is 8.
Attemp on 4, breaks, attempt on 2,
I don't understand how 7 is achieved for max F in the first test case. Since
S(3,3,3) is true, it is determined that within three drops, allowing 3 breaks,
it's known whether or not the egg will break at all floors less than or equal
to 3. Right?
The leap to 7 is foggy for me. I could see
No. With 3 drops, allowing 3 breaks, you can test 7 floors. 3,3,3
doesn't come into the solution, it's just a starting point.
You drop the first egg at floor 4. If it breaks then you try floor 2
next, else you try floor 6. The 3rd egg goes either at floor 1, 3, 5,
or 7. It's a simple binary
http://www.cplusplus.com/reference/algorithm/
I believe the most important to learn are STL algorithms and containers.
P.S. I can link to other sites right?
You seem to be able to!
Please feel free to link to them and use them -- as long as a site isn't
about the current round
Attempt on 4, does not break, attempt on 6- does not break, attempt on 8.
If breaks answer is 7 does not answer is 8.
If breaks answer is 7 -- or 6, if you're looking for the highest floor
from which it doesn't break.
--~--~-~--~~~---~--~~
You received this
In case, you have used recursion, just try and check if you have used
dynamic programming/ memoization or not..
In case you haven't, your code will run for years and not show an
output.. :P
Regards,
Pratyush
On Sep 5, 1:59 am, Bey baltc...@gmail.com wrote:
Hi
I noticed that there are a large
May I ask when the estimating date of sending the mail is ?
On Sep 8, 4:11 am, Bartholomew Furrow fur...@gmail.com wrote:
I make 33 points in the qualification round.. I can participate in the
round 1?? Google don't send emails to notify this?
Yes, with 33 points you qualified. We will
The problem statement looks quite clear to me. Specifically, it tells
that every test case in input file is solvable, which means that
there is an algorythm for determining the lowest floor where the egg
breaks...
However I discovered an inconsistency in the first (small) input file.
It contains
Решай в лоб с кешированием - это называется динамическое
программирование.
Misha Marchenko wrote:
Смотрел. Мне интереснее какой алгоритм был использован, какого его
название?
В том году я узнал, например, про венгерский алгоритм
7 сентября 2009 г. 22:08 пользователь Satyajit Malugu
Well, I had the same problem but in the example input the last case
is:
8 8 8 8 8 8 8 8 8 8 8 8 8
8 8 8 8 8 8 8 8 8 8 8 8 8
The answer is:
a b c d e f g h i j k l m
n o p q r s t u v w x y z
That made it pretty clear for me.
On Sep 7, 4:55 am, jz cmpdebug...@gmail.com wrote:
hey folks, good
Thanks
On Sat, Sep 5, 2009 at 6:17 AM, Bartholomew Furrow fur...@gmail.com wrote:
http://code.google.com/codejam/contest/registration?cmd=Update
On Fri, Sep 4, 2009 at 7:49 AM, Yura Znovyak oberon...@gmail.com wrote:
Hello,
I forgot which sub-rounds I selected during registration. Is
Paul,
That makes sense and I appreciate it! That's what I was missing. Cheers!
On Tue, Sep 8, 2009 at 9:41 AM, Paul Smithpaulsmithena...@gmail.com wrote:
No. With 3 drops, allowing 3 breaks, you can test 7 floors. 3,3,3
doesn't come into the solution, it's just a starting point.
You
@Vivek
I recommend you play around with Firebug. Its is a nice place to start
investigating websites.
Check this:
http://code.google.com/codejam/contest/scoreboard/do?cmd=GetScoreboardcontest_id=90101show_type=allstart_pos=1views_time=0views_file=0csrfmiddlewaretoken=
Have fun
Regards,
Siddiq
Oh, seems like some JSON. Is it?
On Wed, Sep 9, 2009 at 5:59 AM, Siddiq Akbar sid...@gmail.com wrote:
@Vivek
I recommend you play around with Firebug. Its is a nice place to start
investigating websites.
Check this:
will this makes the logic simple.
want to find F(D,B)
I drop an egg from some floor, if it breaks it will break on some
floor below, and I have left B-1 breaks and D-1 drops. If it doesn't
break I have to find a floor above the current floor and have B breaks
and D-1 drops.
so total breaks
Scratch that, I actually tried again, and it was right.
Don't know what was wrong the first time...
-V
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to
We've decided to allow all contestants to compete in all subrounds of Round
1 -- unless they qualified for Round 2 in an earlier subround. Good luck to
everyone in Round 1!
*FAQ*
Q: Where is my qualification email!?
A: We haven't sent them yet, because we're still dealing with cheaters.
Sorry
We've decided to allow all contestants to compete in all subrounds (unless
they've previously qualified for Round 2).
The email will hopefully come out tomorrow (UTC -7), but hopefully now it
has no more useful information.
Regards,
Bartholomew
can i change my programming language now?
On Wed, Sep 9, 2009 at 9:20 AM, Bartholomew Furrow fur...@gmail.com wrote:
We've decided to allow all contestants to compete in all subrounds of Round
1 -- unless they qualified for Round 2 in an earlier subround. Good luck to
everyone in Round 1!
So what will happen to the top 1000 scorers of each round? Since the
competitors will not be distributed equally, will this mean that some
rounds will be better than others in terms of qualifying? Or will the
3000 top scorers qualify?
On Sep 8, 8:50 pm, Bartholomew Furrow fur...@gmail.com wrote:
Dear Furrow,
Ultimately, as per your definition, is memoization a DP technique or
not?
I could not understand that.
Thanks in advance!
Eagle
On Sep 6, 2:48 am, Bartholomew Furrow fur...@gmail.com wrote:
Why you said that?
Recursion is part of dynamic programming (top down approach), am i
Hi Mustafa,
From what I understand, each of the rounds are not going to be considered
separate anymore. We can participate in any of the rounds or all if we wish
to or need to and we would compete with all the others.
How many people will qualify for further rounds is something I can't comment
can i change my programming language now?
When we asked you about programming languages, that was as an indication of
preference rather than locking you in to a language. You can use whatever
language you like, as long as it falls within our rules.
44 matches
Mail list logo
