m.khooryani's blog

By m.khooryani, history, 8 years ago, In English

How to sort the problems in order of number of tries or number of fails?

I just know sort the problems in order of solved:

http://codeforces.com/problemset/?order=BY_SOLVED_DESC

Full text and comments »

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

By m.khooryani, 8 years ago, In English

Happy Programmer's day every body :)

wish the best for all

Full text and comments »

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

By m.khooryani, history, 8 years ago, In English

why my solution got TLE?

problem?

isn't sortedlist operations in lg n?

Full text and comments »

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

By m.khooryani, history, 8 years ago, In English

anyone can give me useful link which contains recursive best first search algorithm pseudo code?

like this (for IDDFS)

thanks for your help

Full text and comments »

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

By m.khooryani, history, 8 years ago, In English

can someone explain more for this problem (510C - Лиса и имена)?

I read editorial but I didn't get that

Thanks for your help

Full text and comments »

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

By m.khooryani, history, 8 years ago, In English
        int limit = 1 << n;
        for (int i = 0; i < limit; i++) {
            if (Integer.bitCount(i) >= 3) {
                System.out.println(i);
            }
        }

Full text and comments »

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

By m.khooryani, history, 8 years ago, In English

can some one help to solve the problem with good time complexity?

Full text and comments »

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

By m.khooryani, history, 9 years ago, In English
  • Vote: I like it
  • +5
  • Vote: I do not like it

By m.khooryani, history, 9 years ago, In English

Hi every one

my code runs in my computer and every thing is OK, but I got runtime error in judge. what's wrong?

Full text and comments »

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