COJ Forum

I solve this problem… and I think the answer is not the solution to the question…

I got only WA in this problem, and I proved it even with negatives values in the center. I cannot understand…. Who is wrong, the COJ or me?? Can anybody help me? This is my code in C++(is not AC): #include <cstdlib> #include <iostream> using namespace std; int max(int, int); int min(int, int); int m...

Ok, C#, good idea, I like this language too, no many as Python and Ruby, but I like it. I can say this is the language in where I am better. If you know something about C, C++ or Java, C# will be very easy for you. C# is upswing of the languages before mentioned. If you want I teach you C#, I’ll do ...

Yes, thank you Robbin for help me to complement my arguments. That is one of the things I love of Python, your program in Python is naturally beautiful because the language force you to program beautiful. That make me remind the Zen of Python. One of the things the Zen of Python say is (beside is th...

Ah!!! I know what program you are talking about… Its icon is a demitasse. This program is in Linux too. My friends said that it is e good text editor. In Windows, the text editor that I use is the Notepad++. If I can program in C# with geany, it sound perfect.

I am agreeing with adrianc, because personally, I know program C++, but I dislike it very much. I generally program in Python, C# and Ruby; and for me, get TLE whit good algorithms, now is something normal. I think these problems mustn’t exist. And… specially in this problem, I got a TLE too. We are...

Thank you very very much!!

What is that?? An IDE??

Here an example of DFS in Ruby: def DFS(graph, pos) marks = [false] * graph.size marks[pos] = true __DFS(graph, pos, marks){ |i| yield i } end def __DFS(graph, pos, marks) for i in graph[pos]: if !marks[i] marks[i] = true yield i __DFS(graph, i, marks){ |j| yield j } end end end #Example: graph = [[...

Here an example of BFS in Ruby(my implementation): def BFS(graph, pos) marks, queue = [false] * graph.length, [pos] marks[pos] = true while !queue.empty? act = queue.delete_at(0) for i in graph[act]: if !marks[i]: marks[i] = true queue.push(i) yield i end end end end #Example: graph = [[3], [0, 2, 5...