Re: No source code Error retrieving directory contents.

2009-08-12 Thread Jacob Lee

As you can see from http://code.google.com/p/supay/source/list, you
haven't pushed any source code to your Mercurial repository. (You can
clone https://supay.googlecode.com/hg, but you'll be cloning an empty
repository.) There isn't any automatic import from your Subversion
repository to Mercurial. You can either just import the file contents
of your subversion repository with hg addremove, or if you want to
preserve your revision history, you can use a tool like hgsubversion.
Anyhow, once you have your local repository set up to your
satisfaction, you can push it to https://supay.googlecode.com/hg and
it'll be on Google Code.

Hope this helps.
-- 
Jacob Lee
artd...@gmail.com



On Wed, Aug 12, 2009 at 8:23 PM, alfredodezaarufuredo...@gmail.com wrote:

 After switching a project from SVN to Mercurial I can't browse the
 source code or clone the repository.

 The project is:

 http://code.google.com/p/supay

 And you can see the error when trying to browse at:
 http://code.google.com/p/supay/source/browse/#hg%3Fstate%3Dclosed

 Is the State Closed in the url above mean anything related to the
 project?

 This has been the case with this project since switching more than 2
 months ago.

 Thanks.

 


--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups 
Hosting at Google Code group.
To post to this group, send email to google-code-hosting@googlegroups.com
To unsubscribe from this group, send email to 
google-code-hosting+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/google-code-hosting?hl=en
-~--~~~~--~~--~--~---



Re: help

2009-08-12 Thread Bartholomew Furrow
Those won't help; there's currently no way to change your nickname.

On Tue, Aug 11, 2009 at 11:09 PM, arjun mamulla arjun.mamu...@gmail.comwrote:

 Hi Shreyas

 Go through these links to change your nick name.

 http://code.google.com/codejam/contest/irc_info
 http://code.google.com/codejam/rules.html

 Hope it will solve your problem.



 Thanks  Regards

 Mallikarjun M
 MS in Software Engineering
 JNTU Hyderabad
 India
 Mobile: 91 96423 35550


 I have big dreams in my small eyes ..



 On Tue, Aug 11, 2009 at 8:23 AM, shreyas shreyas...@gmail.com wrote:


 Somebody pls tell me how to change my nickname in my profile of Code
 Jam.



 


--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups 
google-codejam group.
To post to this group, send email to google-code@googlegroups.com
To unsubscribe from this group, send email to 
google-code+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/google-code?hl=en
-~--~~~~--~~--~--~---



What Language?

2009-08-12 Thread Matthew

Would you be using in the Code Jam 2009?

I'm thinking VB.Net as this is my first time in the Jam and only my
2nd year coding in general.


--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups 
google-codejam group.
To post to this group, send email to google-code@googlegroups.com
To unsubscribe from this group, send email to 
google-code+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/google-code?hl=en
-~--~~~~--~~--~--~---



Pls provide language filter in solutions section

2009-08-12 Thread Himanshu Sachdeva
Dear Google Code Jam Team,
For this year's competition, when results are out for a particular round,
please provide filter by programming language in the solutions section. You
already have that information from participant's registration information.
I believe this would be a big improvement over last year's contest and
really helpful too for the participants.
And I think this would be the request of lots of other people also.

Cheers!
Himanshu Sachdeva

--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups 
google-codejam group.
To post to this group, send email to google-code@googlegroups.com
To unsubscribe from this group, send email to 
google-code+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/google-code?hl=en
-~--~~~~--~~--~--~---



Where is the colombian coder?

2009-08-12 Thread zaratan

Let's talk i think is a great oportunity to meet people with the same
pasion. good luck in this google Code Jam

--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups 
google-codejam group.
To post to this group, send email to google-code@googlegroups.com
To unsubscribe from this group, send email to 
google-code+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/google-code?hl=en
-~--~~~~--~~--~--~---



Re: Where is the colombian coder?

2009-08-12 Thread santiago v

I am a  colombian coder

On Aug 12, 6:09 pm, zaratan chess...@gmail.com wrote:
 Let's talk i think is a great oportunity to meet people with the same
 pasion. good luck in this google Code Jam
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups 
google-codejam group.
To post to this group, send email to google-code@googlegroups.com
To unsubscribe from this group, send email to 
google-code+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/google-code?hl=en
-~--~~~~--~~--~--~---



Re: Where is the colombian coder?

2009-08-12 Thread Camilo S.
me too :D.

On Wed, Aug 12, 2009 at 8:26 PM, santiago v svelezsaf...@gmail.com wrote:


 I am a  colombian coder

 On Aug 12, 6:09 pm, zaratan chess...@gmail.com wrote:
  Let's talk i think is a great oportunity to meet people with the same
  pasion. good luck in this google Code Jam
 


--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups 
google-codejam group.
To post to this group, send email to google-code@googlegroups.com
To unsubscribe from this group, send email to 
google-code+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/google-code?hl=en
-~--~~~~--~~--~--~---



Re: Is there any coder from Israel Here?

2009-08-12 Thread samuel jawahar
R u Jew ?

On Wed, Aug 12, 2009 at 5:37 PM, Raphael Fogel foge...@gmail.com wrote:


 I am looking for an Israeli coder for a blog post

 Best,
 Raphael Fogel
 www.startupmania.co.il

 


--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups 
google-codejam group.
To post to this group, send email to google-code@googlegroups.com
To unsubscribe from this group, send email to 
google-code+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/google-code?hl=en
-~--~~~~--~~--~--~---



MOUSETRAP PROBLEM from GCJ 2008 ROUND 1B

2009-08-12 Thread Shoubhik



Problem

Mousetrap is a simple card game for one player. It is played with a
shuffled deck of cards numbered 1 through K, face down. You play by
revealing the top card of the deck and then putting it on the bottom
of the deck, keeping count of how many cards you have revealed. If you
reveal a card whose number matches the current count, remove it from
the deck and reset the count. If the count ever reaches K+1, you have
lost. If the deck runs out of cards, you win.

Suppose you have a deck of 5 cards, in the order 2, 5, 3, 1, 4. You
will reveal the 2 on count 1, the 5 on count 2, then the 3 on count 3.
Since the value matches the count, you remove the 3 from the deck, and
reset the count. You now have 4 cards left in the order 1, 4, 2, 5.
You then reveal the 1 on count 1, and remove it as well (you're doing
great so far!). Continuing in this way you will remove the 2, then the
4, and then finally the 5 for victory.

You would like to set up a deck of cards in such a way that you will
win the game and remove the cards in increasing order. We'll call a
deck organized in this way perfect. For example, with 4 cards you
can organize the deck as 1, 4, 2, 3, and you will win by removing the
cards in the order 1, 2, 3, 4.

Input

The first line of input gives the number of cases, T. Each test case
starts with a line containing K, the number of cards in a deck. The
next line starts with an integer n, which is followed by n integers
(d1,d2, ...), indices into the deck.

Output

For each test case, output one line containing Case #x:  followed by
n integers (k1,k2, ...), where ki is the value of the card at index di
of a perfect deck of size K. The numbers in the output should be
separated by spaces, and there must be at least one space following
the colon in each Case #x: line.

Limits

Small dataset

T = 100, 1 ≤ K ≤ 5000, 1 ≤ n ≤ 100, 1 ≤ di ≤ K.

Large dataset

T = 10, 1 ≤ K ≤ 100, 1 ≤ n ≤ 100, 1 ≤ di ≤ K.

Sample

INPUT

2

5
5 1 2 3 4 5

15
4 3 4 7 10


OUTPUT

Case #1: 1 3 2 5 4
Case #2: 2 8 13 4


http://code.google.com/codejam/contest/dashboard?c=agxjb2RlamFtLXByb2RyEAsSCGNvbnRlc3RzGJH6AQw#s=p2

The above is the 'cut-out' from the MOUSETRAP problem which appeared
in Google Code Jam 2008 ROUND 1B

I would request all of you to go through it first.

I  could not understand the the difference between 'K' and 'n'
consequently  test cases.(see the second input case 4 3 4 7 10, the
OUTPUT consists of 2 8 13 4 ) From where did these numbers come . im
confused . please help.



--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups 
google-codejam group.
To post to this group, send email to google-code@googlegroups.com
To unsubscribe from this group, send email to 
google-code+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/google-code?hl=en
-~--~~~~--~~--~--~---



Re: MOUSETRAP PROBLEM from GCJ 2008 ROUND 1B

2009-08-12 Thread Luiz Ribeiro

I haven't solved this one yet, but this is my interpretation of the problem:

As the problem states, K is the number of cards in the deck (and
the cards are all numbered from 1 to K).

Basically, the problem wants you to compute a perfect deck with K
cards. Then it asks for the value of N cards on the D_i indices of the
deck.

For example, if it asks for the indices 1, 3 and 4 for K = 10, you
should compute a perfect deck with 10 cards (numbered from 1 to 10)
and just output the cards that are on the indices 1, 3 and 4 of the
deck.

For example for a perfect deck with K = 4, we have the following cards
on the following indices:
Indice 1: 1
Indice 2: 4
Indice 3: 2
Indice 4: 3

If it asks you for the indices 1 and 4, you should just output 1 3,
since for a perfect deck with 4 cards has the card 1 on the top and
the card 3 at the bottom.

Hope my interpretation was useful somehow and please, correct me if I'm wrong.

On Thu, Aug 13, 2009 at 12:46 AM, Shoubhiksbos...@gmail.com wrote:
 http://code.google.com/codejam/contest/dashboard?c=agxjb2RlamFtLXByb2RyEAsSCGNvbnRlc3RzGJH6AQw#s=p2

 I would request all of you to go through it first.

 I  could not understand the the difference between 'K' and 'n'
 consequently  test cases.(see the second input case 4 3 4 7 10, the
 OUTPUT consists of 2 8 13 4 ) From where did these numbers come . im
 confused . please help.

-- 
Luiz Ribeiro
http://luizribeiro.org/

--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups 
google-codejam group.
To post to this group, send email to google-code@googlegroups.com
To unsubscribe from this group, send email to 
google-code+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/google-code?hl=en
-~--~~~~--~~--~--~---



Re: MOUSETRAP PROBLEM from GCJ 2008 ROUND 1B

2009-08-12 Thread joel lopes
2 8 13 4 are cards at position 3 4 7 10 and 4 is total number of input
present. But I am still confused with question like what if i have only 2
cards 5 4 in deck after 3 iterations and now count will never reach 5 and 4
how do I get them out. This is example from question.

Regards and Thanks,

Joel Lopes

On Wed, Aug 12, 2009 at 10:46 PM, Shoubhik sbos...@gmail.com wrote:




 Problem

 Mousetrap is a simple card game for one player. It is played with a
 shuffled deck of cards numbered 1 through K, face down. You play by
 revealing the top card of the deck and then putting it on the bottom
 of the deck, keeping count of how many cards you have revealed. If you
 reveal a card whose number matches the current count, remove it from
 the deck and reset the count. If the count ever reaches K+1, you have
 lost. If the deck runs out of cards, you win.

 Suppose you have a deck of 5 cards, in the order 2, 5, 3, 1, 4. You
 will reveal the 2 on count 1, the 5 on count 2, then the 3 on count 3.
 Since the value matches the count, you remove the 3 from the deck, and
 reset the count. You now have 4 cards left in the order 1, 4, 2, 5.
 You then reveal the 1 on count 1, and remove it as well (you're doing
 great so far!). Continuing in this way you will remove the 2, then the
 4, and then finally the 5 for victory.

 You would like to set up a deck of cards in such a way that you will
 win the game and remove the cards in increasing order. We'll call a
 deck organized in this way perfect. For example, with 4 cards you
 can organize the deck as 1, 4, 2, 3, and you will win by removing the
 cards in the order 1, 2, 3, 4.

 Input

 The first line of input gives the number of cases, T. Each test case
 starts with a line containing K, the number of cards in a deck. The
 next line starts with an integer n, which is followed by n integers
 (d1,d2, ...), indices into the deck.

 Output

 For each test case, output one line containing Case #x:  followed by
 n integers (k1,k2, ...), where ki is the value of the card at index di
 of a perfect deck of size K. The numbers in the output should be
 separated by spaces, and there must be at least one space following
 the colon in each Case #x: line.

 Limits

 Small dataset

 T = 100, 1 ≤ K ≤ 5000, 1 ≤ n ≤ 100, 1 ≤ di ≤ K.

 Large dataset

 T = 10, 1 ≤ K ≤ 100, 1 ≤ n ≤ 100, 1 ≤ di ≤ K.

 Sample

 INPUT

 2

 5
 5 1 2 3 4 5

 15
 4 3 4 7 10


 OUTPUT

 Case #1: 1 3 2 5 4
 Case #2: 2 8 13 4



 http://code.google.com/codejam/contest/dashboard?c=agxjb2RlamFtLXByb2RyEAsSCGNvbnRlc3RzGJH6AQw#s=p2

 The above is the 'cut-out' from the MOUSETRAP problem which appeared
 in Google Code Jam 2008 ROUND 1B

 I would request all of you to go through it first.

 I  could not understand the the difference between 'K' and 'n'
 consequently  test cases.(see the second input case 4 3 4 7 10, the
 OUTPUT consists of 2 8 13 4 ) From where did these numbers come . im
 confused . please help.



 


--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups 
google-codejam group.
To post to this group, send email to google-code@googlegroups.com
To unsubscribe from this group, send email to 
google-code+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/google-code?hl=en
-~--~~~~--~~--~--~---



Re: MOUSETRAP PROBLEM from GCJ 2008 ROUND 1B

2009-08-12 Thread Luiz Ribeiro

Just to clarify the second case on the sample input.

The perfect deck for K = 15 is:
1, 11, 2, 8, 7, 3, 13, 9, 6, 4, 15, 14, 12, 10, 5.

Hence the cards on the indices 3, 4, 7 and 10 are, respectively 2, 8, 13 and 4.

-- 
Luiz Ribeiro
http://luizribeiro.org/

--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups 
google-codejam group.
To post to this group, send email to google-code@googlegroups.com
To unsubscribe from this group, send email to 
google-code+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/google-code?hl=en
-~--~~~~--~~--~--~---