| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
| to admin | kostan3 | | 4 сен 2014 02:55 | 13 |
зашол на тимус попытался отправить задачу
такой ид не сушкствует
востановил аккаут посредством е-mail но уже совсем другой ид и не одной решённой задачи из тех которых я решал помогите
Edited by author 03.11.2013 19:20 Нефиг было читерить. P.S. Список твоих друзей радует: http://spaces.ru/friends/?r=friends/index&name=kostan3(ON) ChErEpOk12 (B) (ON) I_HE3HAKOMKA_SU (S) (ON) KOT_B_ZAKOHE (S) (ON) ViP_BJIoHdiHkA (G) (OFF) K__I__S__S__A (G) 15:28 (OFF) vladimir0333 (B) 15:25 (OFF) Jeff_Hardy011 (B) 15:24 (OFF) SpirriT (B) 15:24 (OFF) MUCC_HEBUHHOCTb (B) 15:18 (OFF) P_A_U_T_I_N_A (B) 15:17 (OFF) CEKC_KOPOJIEBA (G) 15:15 (OFF) BuBNuK7 (S) 15:05 (OFF) ivan3258001 (B) 15:04 (OFF) adidas3228 (S) 14:53 (OFF) LEGENDA_CS_1_6 (S) 14:49 (OFF) vint1997 (B) 14:39 Какой класс окончил? Edited by author 03.11.2013 17:37Да ты даже сегодня уже считерил, сдав на задачу 1999 чужой исходник. :) Твоё решение с
ID 5310504 это решение с ID 5308260 by awpris. я просто нашёл этот код в интернете это чит? А ты как думаешь? Сдал код, который не сам написал, и удивляешься, что админы за это удалили аккаунт. :) Решать задачи нужно самому! я просто нашёл этот код в интернете это чит? что делать? зашол на тимус попытался отправить задачу
такой ид не сушкствует
востановил аккаут посредством е-mail но уже совсем другой ид и не одной решённой задачи из тех которых я решал помогите
Edited by author 03.11.2013 19:20 зашол на тимус попытался отправить задачу
такой ид не сушкствует
востановил аккаут посредством е-mail но уже совсем другой ид и не одной решённой задачи из тех которых я решал помогите
Edited by author 03.11.2013 19:20 Иди в дотан поиграй, там как раз минера скоро добавят |
| New tests were added, the problem was rejudged (-) | Samsonov Alex [USU] | 1080. Раскраска карты | 4 сен 2014 02:38 | 1 |
|
| by admins | kostan3 | | 3 сен 2014 18:59 | 6 |
|
| something is wrong with the checker for visual c++ 2010 | the_swede | 1752. Дерево 2 | 3 сен 2014 16:31 | 1 |
My program outputs the following on test 1:
0
1
9
3
4
4
4
4
4
1
and I get WA1. However if I use G++ 2011 on the same code then I pass test 1 and get TLA on test 8. |
| test 22 | Dmitriy Black | 1795. Мужья в магазине | 3 сен 2014 15:54 | 2 |
test 22 Dmitriy Black 28 авг 2011 19:14 Help please. give please test #22. I can't Imagine what can be wrong in my programm hi ,do you konw why it's wrong now? Could you please help me? |
| wa4 | fengrenchang | 1103. Карандаши и окружности | 2 сен 2014 23:51 | 2 |
wa4 fengrenchang 1 июл 2009 08:45 how about the test4???
Edited by author 01.07.2009 09:47 need some hint about this test!
Pls!!! |
| Why WA#4? | TTTD | 1358. Провода | 2 сен 2014 20:05 | 1 |
|
| What's the meaning of hint?? | zylm | 1011. Кондукторы | 2 сен 2014 19:30 | 1 |
|
| I wish you could delete posts. | Otrebus | 1161. Stripies | 2 сен 2014 15:25 | 2 |
But you can't, so here is a meaningless post. Originally it was about not understanding the sample because for some reason I thought there were four stripies, one of them weight 3. I sat for 20 minutes trying to figure out why the sample was correct. :)
Edited by author 29.06.2013 16:13 This post is not meaningless at all. I was sitting, counting stripies weight from the sample with a 3-weight stripie too. So thank you for clarifying! |
| If you have WA 11 / RE 11 | Alexey Dergunov [Samara SAU] | 1992. CVS | 2 сен 2014 03:06 | 1 |
Try this:
Input:
19 5
learn 1 1
learn 1 2
learn 1 3
learn 1 4
rollback 1
rollback 1
relearn 1
clone 1
check 2
relearn 2
check 2
rollback 2
rollback 2
check 2
rollback 2
check 2
check 1
relearn 1
check 1
Expected output:
3
4
2
1
3
4 |
| Java Coders!!! | Evgeniy[VVV] | 1243. Развод семи гномов | 1 сен 2014 23:36 | 1 |
Dear Java Coders, you will solve this problem so easy, if you know what is BigInteger means. |
| why wa #5 | wust_fb | 1998. Старый падаван | 31 авг 2014 21:21 | 2 |
I fixed my WA#5 after investigating with this test:
Input:
3 2 1
2 2 2
2
6
Output:
5 |
| How I fixed WA#2 | Marginean Ciprian | 1998. Старый падаван | 31 авг 2014 20:54 | 1 |
Input:
3 2 1
2 2 2
2
3
Output:
6 |
| what formula for Sprague-Grundy ? I don't understand this sequences solve(i-2) ^ solve(n-i-1),what values in solve[0],solve[1],solve[2]?. Please help me | Anastasia | 1465. Игра в пешки | 31 авг 2014 01:14 | 1 |
Edited by author 31.08.2014 01:20 |
| WA 3 Help me | Robert Khasanov | 1033. Лабиринт | 30 авг 2014 19:34 | 7 |
All test in other topics is OK
But my program WA on Test3.
Why? If you WA3, try use this test:
3
...
.#.
...
my AC program give 108
It's may be help you
if WA4 try
3
...
###
...
ans 108 too
Edited by author 04.11.2009 00:17
Edited by author 04.11.2009 00:17 i have the same problem.
my WA#3 program give 108 on
3
...
.#.
... I had have this probrom before I try WA4's test.
3
...
###
...
Answer is 108
WA5's test:
5
..#..
..#..
#####
..#..
..#..
Answer is 108
And there's a BIG TEST
33
............#........#....##.....
....#..##.........#.....##..#....
.....#.##....#...........#.#####.
#..###.....#..............#.....#
......##......#.##..#.....#.....#
###.##.#.........##.#.....#.#.#..
..#..#.##......#.###.#.....#.###.
##.......##....#.#..##.##.#.#....
....##.....#.............#..#....
#...###.###......#..#..#.....###.
##......##..#..#....#......###...
.#...#.#..#######..#..####.......
....##.#.........##....##........
.......#...#......#....###....#.#
....#.#.........#.#..##......#...
#..##..#...#.#..#.#####..##....#.
#.....#......#.#..##.#...#.###...
..........#...#..##....##...#...#
..##.#..#...#..#..##............#
...........#..#.#.#....#.....##..
#.#.#...####..#...#..#....#.#....
.#.....#.#.......##.#.#.#...##.#.
..#..##....#.................#..#
.......#..#.###......#.....#.....
.#.......#.....#.....#...........
....#.####......#....###.........
.#.#.##.#.....##..##........#.##.
..#......#.#.##....#......#.#....
#..........##....#.#..#####.#....
.....#..#.#.....###.....#...#....
#..........#..#.#...##........#..
.......#....#..#.........#.......
.....#..#.......##.##..#.........
ANSWER 7812 My AC code gives 4626
for this test:
33
............#........#....##.....
....#..##.........#.....##..#....
.....#.##....#...........#.#####.
#..###.....#..............#.....#
......##......#.##..#.....#.....#
###.##.#.........##.#.....#.#.#..
..#..#.##......#.###.#.....#.###.
##.......##....#.#..##.##.#.#....
....##.....#.............#..#....
#...###.###......#..#..#.....###.
##......##..#..#....#......###...
.#...#.#..#######..#..####.......
....##.#.........##....##........
.......#...#......#....###....#.#
....#.#.........#.#..##......#...
#..##..#...#.#..#.#####..##....#.
#.....#......#.#..##.#...#.###...
..........#...#..##....##...#...#
..##.#..#...#..#..##............#
...........#..#.#.#....#.....##..
#.#.#...####..#...#..#....#.#....
.#.....#.#.......##.#.#.#...##.#.
..#..##....#.................#..#
.......#..#.###......#.....#.....
.#.......#.....#.....#...........
....#.####......#....###.........
.#.#.##.#.....##..##........#.##.
..#......#.#.##....#......#.#....
#..........##....#.#..#####.#....
.....#..#.#.....###.....#...#....
#..........#..#.#...##........#..
.......#....#..#.........#.......
.....#..#.......##.##..#......... |
| a mathematical explanantion | akash akash | 1139. Городские кварталы | 30 авг 2014 07:52 | 2 |
|
| Idea[Solution][Java] | Evgeniy[VVV] | 1545. Иероглифы | 29 авг 2014 13:31 | 1 |
So,it's easy problem.
just use array and charAt(0); |
| Accepted C code | Kelsnare | 1068. Сумма | 28 авг 2014 05:49 | 1 |
#include <stdio.h>
int main(){
long int n,sum;
scanf("%ld", &n);
if(n == 0){
printf("%ld\n",1);
return 0;
}
if(n >= 1){
sum = n*(n+1)/2;
}else{
n = n*(-1);
sum = n*(n+1)/2;
sum--;
sum = sum * (-1);
}
printf("%ld\n", sum);
return 0;
} |
| What is "mid in the middle" algorithm for solving this problem? | Squire [Lviv NU] | 1005. Куча камней | 28 авг 2014 04:53 | 4 |
Meet-in-the-middle is algorithm which allows us to solve O(2^n) complexity problems for O(2^n/2) time. In this problem you can use meet-in-the-middle: divide the peal into two peals b = {a1 a2 a3 . . . an/2}, c = {an/2 + 1, a2, . . . an}. Then calculate all subvalues of b and store it in s1, same for c and store in s2.Then sort s1 and s2. Now you must calculate Min(pealsum - 2 * (s1j + s2k)).This algo takes O((2^(n /2))^2) time instead of O(2^n), but O((2^(n /2))^2) = O(2^n). Notice that s2 is sorted then we can use binray_search then we have O(2^(n/2)log(2^n/2))=O(2^(n/2) *(n/2)).
Edited by author 17.10.2011 20:50 Hello, i am learning about meet in the meedle, please explain why Min(pealsum - 2 * (s1j + s2k)) thanks (Sorry for my poor english) I also haven't understood Min(pealsum - 2 * (s1j + s2k)). I'd appreciate if someone explain it. But, you can calculate s1 and s2 as sum of all possible combinations: +/-a1 +/-a2... ++/-an and +/-b1 +/-b2... ++/-bn. Then find min(s1j + s2k). Here `meet in the middle' to reduce complexity, sort s2 and use binary search for lookup. Does it make sense? |
| WA #20 | Dmitry V. | 1910. Руины титанов: сокрытый вход | 26 авг 2014 23:18 | 1 |
WA #20 Dmitry V. 26 авг 2014 23:18 How come that my code passed all tests except this one? What ability is tested there? |
