You can use several words in query to find by all of them at the same time. In addition, if you are lucky search understands word forms and some synonyms. It supports search by title and author. Examples:

  • 305 — search for 305, most probably it will find blogs about the Round 305
  • andrew stankevich contests — search for words "andrew", "stankevich" and "contests" at the same time
  • user:mikemirzayanov title:testlib — search containing "testlib" in title by MikeMirzayanov
  • "vk cup" — use quotes to find phrase as is
  • title:educational — search in title

Results

 
 
 
 
1.
By tonho, 9 years ago, In English
Help on File Retrieval — Livearchive 5794 Hi there! I'm trying to develop a solution for this problem, but I'm not sure what the problem really wants. Could someone help me? I've already did my research, I've found this [post](http://www.codeforces.com/blog/entry/3452) and it gives me a hint about suffix array and stack. Someone told me to read this [article](http://www.cs.iastate.edu/~cs548/references/linear_lcp.pdf) and think how to build the suffix tree with a stack (not explicity build the suffix tree) and that should give me a big hint about the problem. But I really didn't understand. Can someone help me? Not asking for the answer, but another hint. Thanks in advance! And sorry about my poor English. Edit: Sorry, I forgot to give the problem link, [here](http://livearchive.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=531&page=show_problem&problem=3805)
Help on File Retrieval — Livearchive 5794

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

 
 
 
 
2.
By M.Dawwas, history, 6 years ago, In English
prime switch — livearchive Hello everybody I am trying to solve this problem https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4924 my code give me wrong answer code : http://ideone.com/pkXHX9 any help please?
prime switch — livearchive

Read more »

 
 
 
 
  • Vote: I like it
  • -12
  • Vote: I do not like it

 
 
 
 
3.
By AlexanderBolshakov, 10 years ago, In Russian
Subset Sum Problem - оптимизация <p>Собственно, расскажу о своей проблеме. SSP мне попалась в задаче J с финала ACM 2011 года. Я написал динамику по аналогии с рюкзаком за O(n) памяти и O(n * k) = O(n ^ (4/3)) времени (n - максимальное число, которое нужно разложить на слагаемые, k - количество элементов во множестве). Каким образом можно улучшить асимптотику? Можно ли как-то использовать две следующих вещи: а) множество состоит из квадратно-пирамидальных чисел, б) для разложения произвольного числа из промежутка [1; 1000000] требуется в худшем случае 6 чисел?</p><p>UPD. Буду особенно рад услышать финалистов :).</p><p>UPD2. От NEERC'а в прошлом году в финал вышли 13 команд, если не ошибаюсь, все они J решили. Почему такая гробовая тишина?</p><p>UPD3. По <a href="http://codeforces.ru/blog/entry/3485#comment-69863">комментарию</a> Артема я понял, что мое решение на финале бы прошло. Теперь буду рад услышать тех, кто загнали задачу <a href="http://livearchive.onlinejudge.org/">на испанском сервере</a> в ТЛ 3 секунды.</p>...
UPD4. Судя по топ20 решивших задачу на livearchive, наличие кого-то из русскоговорящих среди

Read more »

 
 
 
 
  • Vote: I like it
  • -7
  • Vote: I do not like it

 
 
 
 
4.
By caustique, 10 years ago, In Russian
LiveArchive - задачи финала <p>На&nbsp;<a href="http://livearchive.onlinejudge.org/">http://livearchive.onlinejudge.org/</a>&nbsp;уже появились задачи финала.</p><div>Попробовал засабмитить одну на Java - получил Runtime Error.</div><div>Вопрос: в какой поток выводить результат? Стандартный? Вроде так и делал. Если в файл, то с каким именем?</div><div>Где можно почитать справку про этот сайт?</div><p></p>
LiveArchive - задачи финала

Read more »

 
 
 
 
  • Vote: I like it
  • +18
  • Vote: I do not like it

 
 
 
 
5.
By aajjbb, 8 years ago, In English
A* Optimization Hello, I'm trying to solve this problem [Link](http://br.spoj.com/problems/RAPREGUI/). The problem statement is available in [LiveArchive](https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=&problem=1653&mosmsg=Submission+received+with+ID+1253271) in English. In the Brazilian SPOJ, the time-limit is quite strict, as the problem resumes to a grid shortest path, I choose the A* algorithm, which generally is faster than Djikstra and it's heuristics fits perfectly in 2-dimensional grids, but my solution isn't fast enough. How can I optimize more the A* ? The current code is: ~~~~~ struct MyLess { bool operator () (int x, int y) { return f[x] > f[y]; } }; int func (void) { int i, j; dist[conv(RF,CF)] = 0; vis[conv(RF,CF)] = 0; priority_queue<int, vector<int>, MyLess> q; q.push(conv(RF, CF)); for ( ; !q.empty(); ) { int now = q.top(); q.pop(); if (vis[n...
statement is available in [LiveArchive ](https://icpcarchive.ecs.baylor.edu/index.php?option

Read more »

 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it

 
 
 
 
6.
By dj3500, 8 years ago, In English
Training for World Finals - virtual participation Hi everyone, I have a training problem and I think many of you have had it already, so I thought I'd ask. Our team from Wrocław qualified for the ICPC World Finals (yay!) and it would be good to practice on the past problems. Is there any way to do this as _virtual participation_ in the past finals? Specifically, I'd like to have as many as possible of the following: - online judge with the problems (UVa LiveArchive satisfies this) - which is lenient on whitespace (it usually doesn't) - ghost participants, live ranklist, seeing which problems have been solved up to this point etc. I have found it hard to even find a precise ranklist (who solved which problem) for finals older than 2-3 years. There are no WF problemsets on acm.sgu.ru, nor here on CF Gym, and test data is only downloadable from ICPC website for 2011 up. Am I too spoiled by the modern methods of preparation? :)
with the problems (UVa LiveArchive satisfies this) - which is lenient on whitespace (it usually doesn't, - online judge with the problems (UVa LiveArchive satisfies this) - which is lenient on whitespace

Read more »

 
 
 
 
  • Vote: I like it
  • +36
  • Vote: I do not like it

 
 
 
 
7.
By Noureldin, history, 18 months ago, In English
Did we lose ICPC live archive ? **UPDATE: it's back ^_^** so it came to my attention a few days ago by [user:fegla,2020-03-13] that [icpcarchive](https://icpcarchive.ecs.baylor.edu/index.php) only gives WA or CE verdicts ([judging status](https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=19)) to make sure I submitted a couple of my already AC codes and they gave WA ... so it seems that it's not functioning properly. I don't know if it's down for good or temporarily but livearchive (though admittedly not the nicest of OJs, I mean who didn't get frustrated because of WA due to \n or a space or a weird I/O format or corrupted testing data) was a great repository of regional CPC and ICPC contests (with contests dating from 1988 from all over the world) and it's really sad to lose it. so is there anything that can or is being done to save it -and while at it improve it- ?
not functioning properly. I don't know if it's down for good or temporarily but livearchive (though, I don't know if it's down for good or temporarily but livearchive (though admittedly not the nicest

Read more »

 
 
 
 
  • Vote: I like it
  • +13
  • Vote: I do not like it

 
 
 
 
8.
By jonathanirvings, history, 2 months ago, In English
93389
На Livearchive еще не закинули тесты. Так, к сведению: зеленая галочка возле названия задачи

Read more »

 
 
 
 
  • Vote: I like it
  • +140
  • Vote: I do not like it

 
 
 
 
9.
By rrpaim, 7 years ago, In English
Growing Strings [South America Regional 2010] Hello, I'm having a hard time trying to solve [this problem](https://www.urionlinejudge.com.br/judge/en/problems/view/1141). I've already tried three different solutions, using Hash, Aho-Corasick and Suffix Array (O(n) implementation + Longest Common Prefix) respectively. However, I keep getting TLE, as the time limit is too tight and they don't use optimization flags to compile on this site. Notice that this problem is also available on [LiveArchive](https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2812). I got AC there using Hash or Aho-Corasick and even managed to be among the top solutions. However, apparently there is a much faster way of solving this problem. Could anyone help me with other ideas? Thanks!
Notice that this problem is also available on [LiveArchive ](https://icpcarchive.ecs.baylor.edu

Read more »

 
 
 
 
  • Vote: I like it
  • +4
  • Vote: I do not like it

 
 
 
 
10.
By Pancake, 9 years ago, In English
looking for testcases for an ACM regional Hello :) . I have encountered a nice ACM regional contest problemset ( Kanpur site , year 2010) , but I can neither find test data for that contest , nor use livearchive as it doesn't seem to have testcases ready , either. Can anyone help ? Thanks
) , but I can neither find test data for that contest , nor use livearchive as it doesn't seem to have

Read more »

 
 
 
 
  • Vote: I like it
  • +8
  • Vote: I do not like it