| Title |
User |
Message |
Place |
Date Posted |
| ... |
Cassian_g |
WTF i got WA on subtasks 5 and 6. Then I added this to the code: if (pos[i] < 1 || pos[i] > n) { cout |
ioi1421 |
Jul 16, 2016 - 1:51:45 pm UTC |
| What's S |
Cassian_g |
The task description doesn't say what S is. It is the sum of values of M. |
ioi1513 |
Jul 15, 2016 - 10:16:42 am UTC |
| My code |
jimpix |
I only get 40/90, but my code passes on ideone. What's wrong? |
ccc15j1 |
Jul 14, 2016 - 6:27:55 pm UTC |
| FYI to everybody |
kobortor |
The dominos aren't sorted by position. |
domino |
Jul 09, 2016 - 2:48:14 am UTC |
| What's wrong? |
jimpix |
My output is 4MISPELLROGRAMMINGCONTESBALOON. Can anyone give me a hint to what is wrong with my code? |
a1 |
Jul 06, 2016 - 9:27:42 am UTC |
| Problem |
jimpix |
What's wrong with my submission? I only get 10/30. |
p140ex3 |
Jul 06, 2016 - 7:59:31 am UTC |
| Re: Problem |
spencereir |
this happens when the judge is busy, you simply need to wait for the other problems to grade. this is usually something that takes less than a minute. just keep refreshing the page. |
p129ex3 |
Jul 04, 2016 - 1:00:11 am UTC |
| Re: Question |
spencereir |
use getline(cin, stringname); then you can just check if stringname == " " |
a2 |
Jul 04, 2016 - 12:59:16 am UTC |
| Re: Too Easy |
spencereir |
this is a junior 1 problem try this one instead http://wcipeg.com/problem/ccc13s2p6 |
ccc13j1 |
Jul 04, 2016 - 12:58:11 am UTC |
| Too Easy |
jimpix |
Is this really a question for the Canadian Computing Competition? It's far too easy compared to IOI problems. |
ccc13j1 |
Jul 03, 2016 - 1:03:13 pm UTC |
