| Show all threads Hide all threads Show all messages Hide all messages |
| wa3 hint - floating poing error | svg2003 | 1139. City Blocks | 3 Dec 2013 13:09 | 1 |
For whom who use floating K = n / m, try to this test:
3 99 - right answer is 98
99 3 - right answer is 98 |
| WHAT'S TEST 7? | invokerj | 1517. Freedom of Choice | 3 Dec 2013 12:00 | 1 |
my solution WA7, anyone post more test? thanks! |
| WHAT'S TEST 7? | invokerj | 1517. Freedom of Choice | 3 Dec 2013 12:00 | 1 |
my solution WA7, anyone post more test? thanks! |
| WA 8. Can anybody give me some tests or hints, thanks in anticipation! | YurecMolodec | 1592. Chinese Watches | 3 Dec 2013 04:02 | 1 |
|
| Challenge | Henry | 1788. On the Benefits of Umbrellas | 1 Dec 2013 22:31 | 1 |
Anybody have the code on the C?
I thought about it for a long time and i have no ideas how to do this task.
I would be very grateful if somebody help me with it. |
| Hint for greedy | Leonid | 1826. Minefield | 1 Dec 2013 12:22 | 1 |
There is no single optimal move. There is exactly two moves, one of which is optimal. On every step of greedy, you must choose best of them. |
| ADMINU | sokol[TSOGU] | 1683. Fridge | 1 Dec 2013 03:14 | 3 |
ADMINU sokol[TSOGU] 9 May 2009 22:45 not correct first sample!
12
4
5 3 2 1
correct:
12
4
6 3 2 1 Yes. Because 5 3 2 1 is a bit confusing...
Better, if it will 6 3 2 1 :)
Edited by author 01.12.2013 03:16 |
| Help! WA#5! | wyyyl | 1452. Pascal vs. C++ | 30 Nov 2013 21:00 | 3 |
Who can give me some tests(include#5) or hints? Try this test
16
1 3 4 5 7 9 10 11 12 13 14 16 18 19 21 22
The answer is
8
1 3 5 7 10 12 14 16
Hope it helps!
Edited by author 30.11.2013 21:02 |
| Could anyone sent his program to me? | Tony | 1141. RSA Attack | 30 Nov 2013 18:54 | 4 |
|
| What is WA 2 ? | ProTreo | 1054. Tower of Hanoi | 29 Nov 2013 23:51 | 1 |
What's the test number 2 ? |
| in n=5 ? | Dusayarov Alisher | 1985. Prime Square | 29 Nov 2013 20:17 | 1 |
in n=5 ? Dusayarov Alisher 29 Nov 2013 20:17 1 20 19 18 17
2 21 22 15 16
3 24 23 14 13
4 25 8 9 12
5 6 7 10 11 |
| Why WA5? | Bakhtiyorbek Begmatov | 1985. Prime Square | 29 Nov 2013 20:05 | 1 |
Why WA5? Bakhtiyorbek Begmatov 29 Nov 2013 20:05 I have WA5. Give me some explanation and tests please |
| Help me! I try to solve and got WA#5 | Ont | 1507. Difficult Decision | 29 Nov 2013 17:32 | 2 |
In any case, you have forgotten to sum up after powering matrices. |
| ADMINS, error in problem statement | ile | 1106. Two Teams | 29 Nov 2013 13:24 | 2 |
I think following phrase should be changed:
"Every member of each team must have friends in another team."
Because firstly I thought that every member must have more than 1 friend, since it is "friends".
so something like
"Every member of each team must have at least one friend in another team"
should work |
| WA #1 | beginner1010 | 1641. Duties | 29 Nov 2013 06:10 | 3 |
WA #1 beginner1010 8 Jul 2011 13:30 that's so strange
I`m getting WA on test 1
my code prints for sample input #1
1
2
3
1
2
1 2
1 3
1 5
2 3
and for second :
1
2
1
2
1 2
1 4
2 3
3 4
please help me !
thank you Accepted after reread the problem statement
problem says :
"Each student is assigned one classroom he is responsible for"
My output was wrong for test #1 Re: WA #1 Spatarel Dan Constantin 29 Nov 2013 06:10 In your output for sample #1 student no. 4 is never on duty!
"Each of the students should be on duty at least once during these [m] days." |
| wa test 4 | Shohin | 1786. Sandro's Biography | 28 Nov 2013 23:37 | 1 |
|
| проблема с задачей | SamGTU7Gorkova | 1895. Steaks on Board | 28 Nov 2013 21:01 | 3 |
|
| My AC | Kleninz | 1873. GOV Chronicles | 28 Nov 2013 17:32 | 6 |
My AC Kleninz 25 Oct 2011 09:56 int main()
{
int n;
scanf("%d", &n);
d[0] = 5;
d[1] = 20;
d[2] = 12;
d[3] = 2;
d[4] = 1;
d[5] = 4;
d[6] = 6;
d[7] = 1;
d[8] = 4;
d[9] = 4;
d[10] = 1;
d[11] = 0;
printf("%d", d[n]);
return 0;
} Re: My AC Savchenkov (NNSTU) 26 Oct 2011 21:59 Yeah, I solved it without looking into discussions.
int n, p[]={5,20,12,2,1,4,6,1,4,4,1,0};
int main()
{
cin >> n;
cout << p[n];
return 0;
}
P.S. this problem is EVIL! (o_O) Hey, let others also solve it, don't just post here the solution! Why Sasha is 2, he didnt visit 1 contest Re: My AC Alexey Dergunov [Samara SAU] 15 May 2012 23:18 Thank you for your solution, I didn't want to read these megabytes of letters by myself. + + + - - - - - - - - -
+ + + - - - - - - - - -
+ + + - - - - - - - - -
+ + + - - - - - - - - -
+ + + - - - - - - - - -
// Dissolution of Alarm
- + + - - - - - - - - -
- + + + - - - - - - - -
- + + - + - - - - - - -
- + + - - + - - - - - -
- + - - - + - - - - - -
// Next year
- + + - - - + - - - - -
- + + - - - + - - - - -
- + + - - - + - - - - -
- + - - - - + + - - - -
// Lesha gone
- - - - - + + - - - - -
- + - - - + + - - - - -
// Nikita & Fedya gone
- + - - - - - - + + - -
- + - - - - - - + + - -
- + - - - - - - + + - -
- + - - - - - - + + - -
// One more dissolution of team
- + - - - - - - - - + + // UNCOUNT
- + - + - - - - - - + - |
| there is a polynolyal time solution, my is O(N^3) | Alias aka Alexander Prudaev | 1431. Diplomas | 28 Nov 2013 00:00 | 4 |
sorting array can help improving O(N^3) to O(N^2) |
| To admins: typo in statement | Smilodon_am [Obninsk INPE] | 1032. Find a Multiple | 27 Nov 2013 11:18 | 1 |
There is a typo in statement in the first part of it. The sentence:
"This numbers are not necessarily different"
should be written as:
"These numbers are not necessarily different". |
