Disclaimer: haven't read the problem nor your code.
You need to download the input and run your solution to create the output
file, then you only upload the output file. That file is expected to start
with 'Case #1' per the problem statement.
In live contests, there'll be another box For you to
One place to look at algorithms and structures typically found in these
type of contests is the tutorials section at topcoder:
https://www.topcoder.com/community/data-science/data-science-tutorials/
Carlos Guía
On Mon, Apr 20, 2015 at 2:11 PM, Anton Popov popov...@gmail.com wrote:
+1
This
You have to download the input file, run your program against it to
generate the output file and submit that output file. The judge will
determine the correctness based on your output file.
During practice mode, that's all you have to do. It will tell you if it's
correct or not.
During a live
I haven't read your code, but you could download a solution from:
https://code.google.com/codejam/contest/32003/scoreboard?c=32003#vf=1 and
use it to find a case where your code produces a different answer.
Carlos Guía
On Sat, Feb 28, 2015 at 11:12 PM, 欧阳晕 pits...@gmail.com wrote:
I've been
Have you read the editorial?
http://community.topcoder.com/tc?module=Staticd1=match_editorialsd2=tco03_online_rd_4
It's not very detailed, but should give enough insight.
Carlos Guía
On Mon, Mar 2, 2015 at 11:08 PM, Rajesh Kumar rajeshraj@gmail.com
wrote:
Hi,
I am trying very hard to
Maybe there's a typo, but that input case is invalid because '4' is not
part of the source language.
Carlos Guía
On Thu, Mar 5, 2015 at 5:45 AM, Dinesh Kumar dsahu1...@gmail.com wrote:
Here is a question of google code jam alien numbers.
I tried this question many times but was not able to
I recommend learning as much as you can from TopCoder's tutorials as a
starting point:
http://community.topcoder.com/tc?module=Staticd1=tutorialsd2=alg_index
As Ritesh said, we don't know what you already know. But I'd recommend you
to check previous years problems, the analysis will usually say
warningLong email ahead/warning
It's hard to have much before hand because you don't know the problems yet.
I usually do everything, in the case generating department, during the
contest; but you could have some template with some utility functions if
you feel your language is lacking something
Just to clarify, the times are actually 4 minutes for small and 8 minutes
for large. In that time you have to download the input, run your code
against it and upload the output + source code.
You can read more about it here:
https://code.google.com/codejam/faq.html#submissions
However, other
You can download any accepted solution to generate the correct output. For
the main contests, you can use http://www.go-hero.net/jam to find a
solution in a language of your preference.
Carlos Guía
On Tue, Mar 25, 2014 at 10:23 AM, Anubhav Sethi anubhavseth...@gmail.comwrote:
After I submit
And I'd like to add that, even when you make a legitimate question for
something you're simply trying to learn. Just asking won't get you close to
getting help.
Most people here (and similar groups/forums) will expect that whoever asks
a questions shows that has spent some time on solving the
While I wouldn't answer questions of this type (ongoing contest) the prize
money is not really important. Who came to this forum asking for help in
this way is not going to win.
Carlos Guía
On Tue, Aug 13, 2013 at 10:17 AM, Malay Keshav malay.kes...@gmail.comwrote:
Its from an ongoing contest
. But that doesn't mean the group should be
spammed with everything anyone is not trying to do by themselves.
Carlos Guía
On Tue, Aug 13, 2013 at 10:20 AM, Carlos Guia carlos.guia.v...@gmail.comwrote:
While I wouldn't answer questions of this type (ongoing contest) the prize
money is not really important. Who
Agree. I was just saving the trouble of replying when
people ask What will you gain by cheating ?
On Tue, Aug 13, 2013 at 6:55 PM, Carlos Guia
carlos.guia.v...@gmail.comwrote:
For the person saying that everything on the web was put by humans. This
group is not the web, in the about page
It's unlikely admins will give out participants emails, you have a better
chance of getting to him trough this list, he/she (or someone who knows
him/her) may read it so you get contacted.
Carlos Guía
On Mon, Jun 3, 2013 at 1:56 PM, Qasim Zeeshan newbillga...@gmail.comwrote:
Ahan. Who is that
I liked coursera's algorithms: design and analysis by Roughgarden.
There's one by Sedgewick, that while I haven't took, I suspect is good
(given the professor).
On May 11, 2013 11:45 AM, umang shukla umangshuc...@gmail.com wrote:
Stanislav Zholnin wrote:
A) study. If you are studying
I haven't read the editorial, but the OP was talking about the div 1
version of the problem while you seem to be taking about the div 2 one.
Based only on the class names provided in the posts.
Carlos Guia
On May 11, 2013 9:43 PM, Leandro Coutinho lescoutinh...@gmail.com wrote:
Hello,
Reading
, you can check in http://www.topcoder.com/tc and look on the left side
navigation for algorithm tutorials there are many tutorials on important
topics, I recommend checking dynamic programming and graph theory.
Carlos Guia
On Apr 28, 2013 5:20 AM, Guillermo Sahonero gamol2...@gmail.com wrote:
Can
Others have reported no analysis yet, sorry for leading you there without
checking but have been busier than usual and took a wills guess at it. The
analysis will come, check TopCoder in the meantime.
Carlos Guia
On Apr 28, 2013 9:33 PM, Carlos Guia carlos.guia.v...@gmail.com wrote:
I haven't
Visual studio is the best in my opinion, mainly because of it's debugger.
Carlos Guia
On Apr 24, 2013 8:44 AM, champ cham3...@gmail.com wrote:
visual c++ express is best
On Wed, Apr 24, 2013 at 12:19 PM, porker2008 zhangxion...@gmail.comwrote:
Dev-C++ is buggy for debugging
Also, I recommend checking TopCoder tutorials:
http://www.topcoder.com/tc?d1=tutorialsd2=alg_indexmodule=Static
There are many tutorials there, but in the problems, TopCoder is very DP
oriented in general
Carlos Guía
On Wed, Apr 24, 2013 at 11:10 PM, Samuel Jawahar insidej...@gmail.comwrote:
accepted.
Bill
On Tue, Apr 16, 2013 at 12:52 PM, Carlos Guia carlos.guia.v...@gmail.com
wrote:
Source code is not checked during the live round either.
Carlos Guía
On Tue, Apr 16, 2013 at 3:49 PM, ankush agarwal
ankushagarwa...@gmail.com wrote:
In practice mode only outputs are checked
containis it the
output cases generated by the program..and if it is so then my output file
isnt accepted...what to do?
On Wed, Apr 17, 2013 at 9:08 PM, Carlos Guia
carlos.guia.v...@gmail.comwrote:
You can try contacting the codejam team at code...@google.com to ask
them, I know
Don't worry, if you scored over 35 and didn't cheat, you'll be on round 1.
They are probably doing all the checks to detect cheating and will send
mails after everything is confirmed.
Carlos Guía
On Wed, Apr 17, 2013 at 2:37 PM, Jugesh Sundram jugeshsund...@gmail.comwrote:
I scored an easy 40
Yes you can
Carlos Guía
On Tue, Apr 16, 2013 at 10:26 AM, Damian dmore...@gmail.com wrote:
Can I compete in round 1B if I fail in 1A?
Similarly, can I compete in 1C if I fail in 1A and 1B?
Thanks.
--
You received this message because you are subscribed to the Google Groups
Google Code
Source code is not checked during the live round either.
Carlos Guía
On Tue, Apr 16, 2013 at 3:49 PM, ankush agarwal
ankushagarwa...@gmail.comwrote:
In practice mode only outputs are checked not source code so still the
error in source code may be there.
On Tue, Apr 16, 2013 at 4:15 PM,
You can download the source code of anyone who got accepted and compare the
outputs yourself. I recommend using go-hero to find a solution on your
preferred language.
http://www.go-hero.net/jam/13/solutions
Carlos Guía
On Tue, Apr 16, 2013 at 4:41 PM, Bill Bruns bruns.b...@gmail.com wrote:
, Leandro Coutinho
lescoutinh...@gmail.comwrote:
Can I participate in rounds 2 and 3 if I fail in 1abc? I know that I
will not be able to advance for the subsequent rounds, but it would be cool
if I could at least participate. =D
On Tue, Apr 16, 2013 at 11:32 AM, Carlos Guia
carlos.guia.v
What I understand about the rules is that you must give the full source
used, to precompute and generate the output. So, if you have a precomputing
code that dumps the values to a file and your output generator uses the
values directly from the file (not inside the code). You should be fine, as
Codejam used to run inside TopCoder, my guess is they felt it was better to
run it themselves. That allowed them to change the competition format and
rules to what they like. I doubt PC^2 can handle the amount of traffic the
codejam generates, obviously I have never tried a contest this big in
As most have said. Think of your source code as a proof you solved the
problem. They won't run it unless your case looks suspicious for some
reason, if you submit code that generates the output for the given input,
it's fine if it reads it directly or with redirection or whatever.
Carlos Guía
Although not an official solution, you can use http://www.go-hero.net/jam to
find solution in the language you want.
Carlos Guía
On Thu, Apr 4, 2013 at 2:23 PM, KhalifaBond rahulsharm...@gmail.com wrote:
Not sure if this was already asked, but is it possible that the correct
output for
In that (and most) contest you can click on Contest analysis that will
take to admins analysis of the contest, it includes an explanation on how
to solve the problem.
Carlos Guía
On Sat, Mar 30, 2013 at 12:26 PM, amit amitm...@gmail.com wrote:
Thanks a lot,
Though i dont know python, i'll
create them in visual studio with add new item on the
project.
You would paste the downloaded input file on problem.in and you'd upload
problem.out after running the program.
Or, you can use freopen top redirect streams, two lines of code.
Carlos Guia
On Mar 29, 2013 3:30 PM, jitendra shah
You can DFS or BFS, they run linear time with respect the graph size. There
are faster ways, the terms Joseph used(combine sets) strongly indicates
he's hinting on using disjoint-sets (aka. union-find).
Search for: number of connected components
Carlos Guia
On Mar 28, 2013 9:09 AM, mandeep
is
anther thing.
Carlos Guia
On Mar 28, 2013 9:45 AM, Carlos Guia carlos.guia.v...@gmail.com wrote:
You can DFS or BFS, they run linear time with respect the graph size.
There are faster ways, the terms Joseph used(combine sets) strongly
indicates he's hinting on using disjoint-sets (aka. union-find
have used module
above...
On 28 March 2013 18:23, Carlos Guia carlos.guia.v...@gmail.com wrote:
Could paste a link top the problem? I see your code is using modulo
17 arithmetic, I don't expect a connected components problem top
have that requirement as the graph would have
thing i find that many of programming problem are
mathematical and it don't use standered algorithm and i'm not good in
mathematical algo..so pls provide some good reference...
thanks a lot
On 28 March 2013 20:30, Carlos Guia carlos.guia.v...@gmail.com wrote:
I see, that makes sense since
Since you mention fstream I'll guess you are using C++.
You can use freopen to redirect input/output in code.
Or, in a terminal you can run your program (called program here) as:
program problem.in problem.out
Carlos Guía
On Tue, Mar 26, 2013 at 4:45 PM, champ cham3...@gmail.com wrote:
The output is a text file you have to generate, you download an input file,
run your code on it, and put the results on another file, that's the output
file. In real contest you'll have to also upload the .c file as the source
file.
To redirect, in C/C++ you can use
If I run your code with 100 and 500 I get 156.
Carlos Guía
On Wed, Mar 20, 2013 at 2:42 AM, ash kumar.ashutosh...@gmail.com wrote:
I wrote a program in C for recycled numbers(the problem of previous
codejam contest) .it outputs a value of 96 for A=100, B=500 whereas the
correct answer is
Hi, I've never used light oj, but if they have some form or similar you'll
have better odds off getting help there. Here a lot of people is willing to
help, but many may be unfamiliar with particular online judges.
Good luck,
Carlos Guia
On Mar 16, 2013 3:02 PM, anup1pma anupsingh@gmail.com
Most contests in Nisarg's link have an analysis link next to them, that
will take you to an explanation on how to solve them.
For more general algorithms tutorials, I recommend TopCoders tutorials:
http://www.topcoder.com/tc?d1=tutorialsd2=alg_indexmodule=Static
Carlos Guía
On Wed, Mar 13,
check the countdown clock
https://code.google.com/codejam
6 hours from now
Carlos Guía
On Tue, Mar 12, 2013 at 3:23 AM, Registered user
imregistere...@gmail.comwrote:
12 hours to go ...
On Tue, Mar 12, 2013 at 11:28 AM, ADEGEYE MAYOWA mayox4ever2...@gmail.com
wrote:
when is the
From: https://code.google.com/codejam/terms.html
ENVIRONMENT. Contestants may use any programming language to solve the
problems, using any development environment or text editor as long as the
compiler or interpreter used for that language is freely available. Use of
time-limited free trials
Hi Ransara,
I'll answer your questions as good as I can. However, I'd prefer you ask
trough GCJ's maillist (I'll add it as CC here) or TopCoder's forums next
time, that would allow more people with the same doubts to also benefit
from the answers.
1. TCO is having many competitions, i hope you
Check the codejam's parctice section:
https://code.google.com/codejam/contests.html
And for common algorithms and techniques, I recommend you start with
TopCoder's tutorials:
http://community.topcoder.com/tc?module=Staticd1=tutorialsd2=alg_index
TopCoder Open, another big annual programming
that this is an important
subject in both programming contests and real life, so forgive me my lousy
explanation but go learn it anyway,
Carlos Guia
On Aug 25, 2012 7:21 AM, Paul Smith p...@pollyandpaul.co.uk wrote:
But the comet has a max length of 6 characters, so the worst case is
ZZ = 26^6 which I think fits
From http://en.wikipedia.org/wiki/Modular_arithmetic read the Ring of
congruence classes section for useful relations. For this problem, how to
define multiplications should suffice.
Carlos Guía
On Fri, Aug 24, 2012 at 2:50 PM, Bonethug tejeshwa...@gmail.com wrote:
I am having a problem
You're welcome. For what is worth, I enjoyed reading your link quite a bit.
Carlos Guia
On May 23, 2012 2:18 AM, Chan Pruksapha chanp.cont...@gmail.com wrote:
I find your work around very good idea. Thanks Carlos.
On May 15, 2012, at 9:30 PM, Carlos Guia wrote:
Depends on your exact needs
Depends on your exact needs, if all you care about is accessing elements as
mat[i][j] you can do something like this:
int** matrix;
...
matrix = new int*[M]; // create an array of pointers to int
for (int i = 0; i M; ++i)
matrix[i] = new int[N]; // create an array of integers for each row
Same as linux.
executable.exe file.in file.out
In visual studio you can put the last part in the program arguments in the
debug section. The file.in file.out without the quotes.
In c++, you can use the function freopen to explicitly redirect.
Carlos Guia
On Apr 28, 2012 4:41 PM, Sudhir
No
Carlos Guia
On Apr 28, 2012 4:41 PM, Vilius Zaikauskas zaika...@gmail.com wrote:
Just as the title says: do points carry over to the next rounds or do
we start fresh in each round?
--
You received this message because you are subscribed to the Google Groups
Google Code Jam group
Use more than 5 and you're safe. Something like %.7f that way you would get
a bunch 0s and sometimes some low order decimals. But the important thing
is that the difference is less than 1e-5.
Carlos Guia
On Apr 28, 2012 4:43 PM, Eric Kulcyk erickul...@gmail.com wrote:
Hello,
I had a partial
Google Lehman and Leighton mathematics for computer science. There's a
newer one, with Meyer as an author too, haven't read it but should be at
least as goods, likely better.
It's not only about probability, but all its good and has probability too.
Carlos Guia
On Apr 28, 2012 6:23 PM, Mario
http://www.topcoder.com/tc?d1=tutorialsd2=alg_indexmodule=Static
Carlos Guía
On Tue, Apr 3, 2012 at 9:32 PM, Harish mharis...@gmail.com wrote:
Hi
Can someone suggest me a good reference to learn about different problem
solving techniques and algorithms. Thanks a lot!
Sent from my HTC
, trying it by yourself is the
way to learn it.
Is k^2 is too big, well I haven't given it enough thought to know if I can
or cannot do it better.
Regards,
Carlos Guia
On Apr 2, 2012 1:28 PM, vivek dhiman vivek4dhi...@gmail.com wrote:
+ I am only looking at the count..
for k=1 ans = 1
k=2 ans
Did you use a file named .c or some C++ file extension (.cpp, .cxx,
etc)?
For me, in C++ it returns 1, in C returns 4.
Carlos Guía
On Tue, Jan 10, 2012 at 1:31 AM, Shahadat Sarker me.sar...@gmail.comwrote:
Hi
my gcc (Ubuntu 10.0.4) give the below output:
a
ch= 1 a=1 char=1
I guess the compiler treats 'a' as an integral constant and ends up using
int to represent it.
Carlos Guía
On Mon, Jan 2, 2012 at 2:51 AM, Shoubhik sbos...@gmail.com wrote:
#includestdio.h
int main()
{
char ch;
fflush(stdin);
ch=getchar();
It's hard to spot, but you have read a little bit more carefully.
Your method is named getDivison instead of getDivis*i*on.
Carlos Guía
On Thu, Oct 20, 2011 at 7:48 AM, mandeep mandeep...@gmail.com wrote:
getting this error again and again...
Correct Return Value: No
Execution Time:
This aren't videos, but topcoder tutorials are full of useful knowledge.
http://community.topcoder.com/tc?module=Staticd1=tutorialsd2=alg_index
Carlos Guía
On Thu, Sep 22, 2011 at 12:35 PM, Pavan Kishore
pavankishore1...@gmail.comwrote:
I found one from harvard extension school.. check this
What Amahdy said is true, however, I guess you are trying to use sizeof to
get the size (in elements) of the array, that won't work anyway.
sizeof(array) will give the size in bytes of the array, most likely 20 for
your example. If you want the number of elements in a static array (as
yours) you
...@gmail.com wrote:
Addytheboss, asked for explanation of the code and i gave the same. The
code is working there is no problem in the code in the current program which
is being discussed my dear Carlos Guia.
On Sat, Sep 3, 2011 at 1:49 PM, Carlos Guia
carlos.guia.v...@gmail.comwrote:
What Amahdy
I had exactly that mistake during the round.
Sean also discards
jwvhww
wwwhuw
jwhjww
hwuhww
because they *don't* match _ w _ _ _ w
if they would have been the words, other ws would have been discovered.
Carlos Guía
On Sat, May 21, 2011 at 1:53 AM, Eugene ehomya...@gmail.com wrote:
Can
I don't think the problem is push_back, passing vectors as value,clearing
memory or anything like that. The program hits an stack overflow because of
the algorithm itself.
You can't solve the large dataset with such a naive approach, I recommend
you read the contest analysis for a way to solve
If you mean how are they implemented, the standard doesn't not specify how
it has to be done, just some complexity restrictions are imposed. However,
most implementations use some kind of binary tree and specifically Microsoft
Visual Studio's implementation uses red-black trees.
Carlos Guía
On
I'd like to add the link to topcoder's tutorials page,
http://www.topcoder.com/tc?module=Staticd1=tutorialsd2=alg_index, with the
tutorials you can get a sort of guided way to learn and practice new stuff.
Read an article you didn't completely know and try the problems they say can
be solve with
And you can join the TopCoder open, http://community.topcoder.com/tco11/, so
you get some nice programming contest opportunity this year as well.
http://community.topcoder.com/tco11/
Carlos Guía
On Tue, May 10, 2011 at 5:13 AM, Asmaa Magdi asmaa.ma...@gmail.com wrote:
While by anymore Julien
I agree, that line had me laughing for a long time.
Carlos Guía
On Mon, May 9, 2011 at 9:54 PM, royappa roya...@gmail.com wrote:
.. for the line, Algorithms are not Goro's strength; strength is
Goro's strength.
It still makes me laugh every time I think about it!
:-)
--
You received
if your code works reading from standard input and writing to standard
output, you can use files by redirection, if your program is called prog,
and have input file test.in do this in a console
prog test.in
That will use test.in as input, but still prints to the console, you can do
this
prog
Are you sending the source code or the output file? You should download the
input file and submit the output file you generate, in that file it should
be easy to see if it starts with case #... or not.
Carlos Guía
On Sat, Apr 23, 2011 at 8:03 AM, chase studious.hem...@gmail.com wrote:
my code
thanks
On Apr 13, 2:37 am, Carlos Guia zyx3d...@gmail.com wrote:
You can do that, but remember you have 4 (8 for large) minutes from the
moment you start downloading to the moment submit both output and source.
However, if your code works like that, from standard input to standard
output
When they say 1 N 100, you can assume that's true. They can, as humans,
make a mistake. In that case you should report it as soon as you realize the
dataset is invalid. However, this is rather rare since they have more than
one person testing problems, so it's better strategy to assume the input
I'm not from Google, but you can submit using 2 languages, many people has
done it in past years. The only rule is that they are both freely and easily
available for anyone to test your code, if you want to be super safe, add a
text file explaining how to get the output from the input using your
You can do that, but remember you have 4 (8 for large) minutes from the
moment you start downloading to the moment submit both output and source.
However, if your code works like that, from standard input to standard
output, you can simply redirect files instead doing it manually. Let's say
you
I'm not sure I understand your question. But M is a maximum, not a minimum.
The array is smooth if the distance between neighboring pixels is *at most*
M. In any case 46 and 50 are also less than 5 away.
Carlos Guía
On Tue, Apr 12, 2011 at 3:30 AM, Cody prajay.shet...@gmail.com wrote:
I'm almost certain the rules say that when using multiple source files you
should zip them and send the zip file.
Carlos Guía
On Mon, Apr 11, 2011 at 3:45 AM, Julien Dubois
julien.dubois...@gmail.comwrote:
Ooops little mistake here, I meant the dashboard, not the scoreboard :)
Anyway I mean
C:\program file.in file.out
Carlos Guía
On Sun, Apr 10, 2011 at 6:25 AM, BOUNAIM Oussama
bounaim.ouss...@gmail.comwrote:
how to do the redirection in windows
On Sat, Apr 9, 2011 at 8:06 PM, ravi shanker ravishanker@gmail.comwrote:
Hi Bruno,
There is an easy way to handle the I/O
I'm not an organizer, but I think you can use freely available libraries,
I'd recommend you placed some comments at the beginning of the code or use a
zip file which contains a README like text file to provide links to the
libraries required.
Carlos Guía
On Thu, Apr 7, 2011 at 10:26 AM, yedtoss
The only problem I see is that you are not initializing the contents of the
decrypted c-string. You allocate the memory calling malloc, but as the
reference says: http://www.cplusplus.com/reference/clibrary/cstdlib/malloc/,
that memory is not initialized and values are whatever.
Try adding:
reach the other. So, if I mark node 1 as visited at first, the program will
start from 1 and lets say it touches 2 and then it ll touch 3. From 3, it
has to go to 1 and by that time node 1 is marked as visited. So program 'll
halt there and 'll give wrong result.
This part, for that example,
I think usually time limit is set so even a relatively inefficient
implementation of the correct algorithm still passes, so I'd advise you to
learn more algorithms and when can they be used. I suggest you read some (or
all) the topcoder tutorials.
I almost had a heart attack a few minutes ago, ranked 610 in 1A.
Seems Sub Round 1A was a trap, we all fell for it
Carlos Guía
2010/6/1 Vinícius Santos vinicius.san...@gmail.com
+1
[]´s
Vinícius Fernandes dos Santos
On Tue, Jun 1, 2010 at 10:30 PM, Hernan Badenes her...@gmail.com
Got it too, heart rate has been stabilized again.
Carlos Guía
On Tue, Jun 1, 2010 at 9:51 PM, Enric cus...@gmail.com wrote:
I replied to programmingcontest-feedb...@google.com and they have now
answered (pretty fast) saying it was a mistake, and that their
system recognized me as a
I'm pretty sure Bharath is right on that one. A.at(A.size()) is going to
throw an exception no matter the size or values of A. Changing that may not
make the algorithm right, but that instruction is wrong nevertheless, it is
always accessing an element outside A's range.
The algorithm itself has
code...
or right algorithm...
by the way thanks to everybody who helped me...
On May 28, 11:14 pm, Carlos Guia zyx3d...@gmail.com wrote:
I'm pretty sure Bharath is right on that one. A.at(A.size()) is going to
throw an exception no matter the size or values of A. Changing that may
Or have a team solving problems in parallel, so the total time to solve all
problems is the time it takes to solve only the hardest problem.
You need to submit your source or whatever you used to solve the problem to
have something to back your output up. Think of it a receipt, Google may or
may
?
On Tue, May 25, 2010 at 6:13 AM, Carlos Guia zyx3d...@gmail.com wrote:
I uploaded both small and large output files I get using your code, with a
minimal modification, I had to change the includes.
You had
#includestdio.h
#includeconio.h
#includeprocess.h
#includefstream.h
I changed
I use VC++ 2008, and I do so specially for it's debugging capabilities.
I could of course use printf and find the problems, but it takes some time
and have to be careful to remove them or use stderr.
It is also true you can only find problems in the algorithm you chose, but I
usually spend
13 is nice looking, is easy to see that is close 10^5 and seems very
prime-ish with a quick glance. And primes are good for modular arithmetic.
Carlos Guía
On Tue, May 25, 2010 at 11:42 PM, Bharath Raghavendran rbharat...@gmail.com
wrote:
why did google choose 13 and not some nice
In my computer it has no difference, thought it may in some systems, but the
standard format for long int is %ld. In my computer long and int are
both 32 bits long so there's no difference, maybe on a 64-bit system long is
64 bits long and there is. Other than that I don't see how that code could
...@gmail.comwrote:
Thank you for response.
But I would like to tell you that the same problem occurs in my code when i
execute problem B of the qualification round. Could you please attached the
output of my code which comes in your system.
On Tue, May 25, 2010 at 3:10 AM, Carlos Guia zyx3d...@gmail.com
First of all, do your Masters in whatever field is going to be relevant to
your life or work, not based on this competitions. Practicing for this
competitions will improve your performance in any task, since is a brain
stimulating activity, but your career will be richer if you choose your
Master
jaysi...@gmail.com
oh, thanks
On May 22, 9:58 pm, Carlos Guia zyx3d...@gmail.com wrote:
You are missing
{3, 4, 5, 6, 7}
Carlos Guía
On Sat, May 22, 2010 at 3:41 PM, JaySicks jaysi...@gmail.com wrote:
Hi all!
Could you please help me? Maybe I'm missing something in the 'Pure
I don't know much python, but you can probably write it recursively to make
it look even simpler.
Carlos Guía
On Sun, May 23, 2010 at 4:42 AM, Luke Pebody luke.peb...@gmail.com wrote:
Depends on your programming language. In python it would be:
a = 1
k = 1
while (k = 500):
a *= k
k +=
at
http://code.google.com/codejam
http://code.google.com/codejamclick on practice and learn, there's the
score and everything of old contests.
Carlos Guía
On Sun, May 23, 2010 at 10:40 PM, Qasim Zeeshan newbillga...@gmail.comwrote:
How can I access the scoreboards of Round 1A and Round 1B?
I just tried wata's code with practice input, and your are right. Compare
the codes for small and large, and large has a fix for it if ( need 0 )
need = 0.
For wata's sake, maybe the system is giving the source of his first wrong
try. Though, it is more likely that he uploaded the wrong source
I think it is, how would they remove points for people with wrong source
code then?
If not, I could write a not working code and have a friend sending a good
solution, then I generate the output with his solution and send mine.
If you do it by hand, you have to submit how you did it, not a code,
You are missing
{3, 4, 5, 6, 7}
Carlos Guía
On Sat, May 22, 2010 at 3:41 PM, JaySicks jaysi...@gmail.com wrote:
Hi all!
Could you please help me? Maybe I'm missing something in the 'Pure'
problem.
I downloaded a solution, and the answer for the input '7' was 14.
however, I only found 13
I have no idea what language is that, but I assume its using some big
integer data type which makes slow, but you don't have to do % 13 at the
end
using this two properties of modular arithmetic the values never grow big
(x + y) % M == (x % M + y % M) % M
(x * y) % M == (x % M * y % M) % M
1 - 100 of 146 matches
Mail list logo
