Well, although thats not the main issue, CPAL is actually one of the
simplest licenses I found, identical to the MPL with 2 important
additions, especially the one pertaining to SaaS as a form of
distribution. Nothing complicated or special, even when compared to
traditional open source licenses,
I find that once I created an issue i can't change its description. I
checked all the places and still haven't managed to do that. Is this
true? How can you make sure you're always right at the first time?
--~--~-~--~~~---~--~~
You received this message because
Hi,
It is true, there is no way to change the description of an issue.
Instead, you just add comments. You can think of the description as
just the initial report. As you learn more about the problem, you add
comments that describe what you have learned, even if you learn that
part of the
On how many different platforms and browsers can you reproduce this issue?
Your screenshot appears to show Opera on Puppy Linux, but do you still see
the problem in, say, Firefox or Konqueror?-Nathaniel
On Sat, Oct 10, 2009 at 3:19 AM, technosaurus
b...@openplatformeducation.org wrote:
Text
I've increased your quota to 4GB. Happy hacking!
--
Jacob Lee
artd...@gmail.com
On Mon, Oct 12, 2009 at 11:15 AM, kevinwan...@gmail.com
kevinwan...@gmail.com wrote:
Could you please increase quota for this project?
http://code.google.com/p/cyberaide/
Currently we have used around 97% of
This problem is there even now. I wonder how all other projects are
wroking?
--~--~-~--~~~---~--~~
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
My replies inline ...
-Bharath
2009/10/12 Hawston LLH haws...@gmail.com
Can someone explain point 2?
And there are only O(sqrt(N)) palindromes up to N - so the number of
groups of consecutive zeros or ones in the first N characters is O(sqrt(N)).
consider N is some x digit number ...
another question, in point 1, it deals with [0, X], where X from L-1 to R.
In point 2 here, it use [L-1,R], what is the relation or typo error?
On Mon, Oct 12, 2009 at 5:48 PM, Bharath Raghavendran
rbharat...@gmail.comwrote:
My replies inline ...
-Bharath
2009/10/12 Hawston LLH
here are the statements that show the relation :
[L,R] can be represented as [0,R] minus [0,L-1]; thus it contains an even
number of palindromes if and only if [0,L-1] and [0,R] both contain even or
both contain odd number of palindromes.
We can also reduce the number of boundary groups to
Hey .. here is a problem I saw somewhere on net. Can anyone give me
some ideas on its algo ?
There is a tray that contains a row of s slots where biscuits may be
placed. You can have atmost one biscuit per slot. You and your friend
play a game with it. Each of you get to pick biscuits in turns.
hello one request
if any one know how to test the Topcoder problems offline please help me
currently marathin56 is open
i wanted to test my solution
Regards
Jawahar
On Mon, Oct 12, 2009 at 4:41 PM, Brats rbharat...@gmail.com wrote:
Hey .. here is a problem I saw somewhere on net. Can anyone
Some observations:
Every position is either a win for you or your opponent - the game
does not contain draws.
Furthermore, the sub-game played from one consecutive set of biscuits
is entirely independent of the other sub-games.
A single '1' is always winnable (b = 1)
A string of 1s is
2009/10/12 Paul Smith paulsmithena...@gmail.com
Some observations:
Every position is either a win for you or your opponent - the game
does not contain draws.
Furthermore, the sub-game played from one consecutive set of biscuits
is entirely independent of the other sub-games.
A single
2009/10/12 Bharath Raghavendran rbharat...@gmail.com
2009/10/12 Paul Smith paulsmithena...@gmail.com
Some observations:
Every position is either a win for you or your opponent - the game
does not contain draws.
Furthermore, the sub-game played from one consecutive set of biscuits
is
On Mon, Oct 12, 2009 at 1:13 PM, Bharath Raghavendran
rbharat...@gmail.com wrote:
2009/10/12 Bharath Raghavendran rbharat...@gmail.com
2009/10/12 Paul Smith paulsmithena...@gmail.com
Some observations:
Every position is either a win for you or your opponent - the game
does not contain
You should use Sprague-Grundy theory to solve this problem.
On Oct 12, 6:11 pm, Brats rbharat...@gmail.com wrote:
Hey .. here is a problem I saw somewhere on net. Can anyone give me
some ideas on its algo ?
There is a tray that contains a row of s slots where biscuits may be
placed. You can
Our visa specialists have now sent email to the top 30 contestants (the top
25, plus backups in case some of them can't make it) in order to get things
started. Please send me an email if you haven't been contacted.
Note that we still haven't made the results of the round official, pending a
Hi, Code Jam team,
Can you please advise us on what to write in these fields of visa
application form (from https://evisaforms.state.gov/ds156.asp):
22. When Do You Intend To Arrive In The U.S.?
24. At What Address Will You Stay in The U.S.?
25. Name and Telephone Numbers of Person in U.S. Who
18 matches
Mail list logo
