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.
Help needed in 1011 — Marriage Ceremonies (lightoj) problem
By Loser_, history, 6 years ago, In English
Help needed in 1011 — Marriage Ceremonies (lightoj) problem Hello, in this problem [1011 &mdash; Marriage Ceremonies](http://lightoj.com/volume_showproblem.php?problem=1011)the **priority index** is not clear to me. I used bottom up manner and calculate the max adjacent values. ~~~~~ 5 5 10 10 2 3 2 11 3 10 10 16 12 1 5 2 4 2 11 5 2 1 8 14 4 13 ~~~~~ Ans:60.Which for me `14 11 12 11 10` total `58`.What am I missing here? Need help with that. <spoiler summary="My code"> ~~~~~ #include<bits/stdc++.h> using namespace std; #define ll long long const int N=2e6+5,mod=1e9+7; int mat[20][20],dp[20][20]; int main() { int t,cnt=1;cin>>t; while(t--) { int n;cin>>n; for(int i=1;i<=n;++i) { for(int j=1;j<=n;++j) { cin>>mat[i][j]; } } memset(dp,0,sizeof(dp)); for(int i=1;i<=n;++i) { for(int j=1;j<=n;++j) { if(n&1) { if(j==(n+1)/2) { int temp=max(max(dp[i-1][j],dp[i-1][j-1]),dp[i-1][j+1]); dp[i][j]=max(dp[i][j],temp)+mat[i][j]; } ...
Help needed in 1011 — Marriage Ceremonies (lightoj) problem, Hello, in this problem [1011 — Marriage Ceremonies](http://lightoj.com/volume_showproblem.php

Full text and comments »

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

2.
LightOj 1011
By joker70, history, 9 years ago, In English
LightOj 1011 I have learn DP recently. I am practicing DP in this OJ. Now, I am stuck on this problem. In this [problem](http://http://lightoj.com/volume_showproblem.php?problem=1011) I have to find the maximum summation of cells such that any two cells don't have the same row or column. So, I will use recursion from top of the matrix. When using recursion I got to check if that cell is available or not, i.e. that cells row and column has not previously been used. How can I do that?
LightOj 1011, this [problem](http://http://lightoj.com/volume_showproblem.php?problem=1011) I have to find the, In this [problem](http://http://lightoj.com/volume_showproblem.php?problem=1011 ) I have to find the

Full text and comments »

Tags #dp
  • Vote: I like it
  • +3
  • Vote: I do not like it

3.
Задачка с LightOJ
By chrome, 13 years ago, In Russian
Задачка с LightOJ Можете помочь с задачкой с LightOJ, динамика по подмножествам, я писал за _O(n ^ 2 * 2 ^ n)_, но TLE. Removed after AC :), [Задача](http://lightoj.com/volume_showproblem.php?problem=1011)
Задачка с LightOJ, Можете помочь с задачкой с LightOJ, динамика по подмножествам, я писал за _O(n ^ 2 * 2 ^ n)_, но

Full text and comments »

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

4.
DP+Bitmask, LightOj
By 13sabernow, 12 years ago, In English
DP+Bitmask, LightOj I got confused in this problem from LightOJ http://lightoj.com/volume_showproblem.php?problem=1011 As i am newbie in DP so i want some help in solving this problem using bitmask . Please explain me the steps so that i can use the technique in future . I cant understand how the calculations are done using DP and bitmasks .
DP+Bitmask, LightOj, I got confused in this problem from LightOJ http://lightoj.com/volume_showproblem.php?problem

Full text and comments »

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