OJ Board

Can this problem be solved by Topological Sort?
According to the cardinal principle, we can use TS on this problem.

I solved "Longest Paths" by Topological Sort, but got TLE.

Certainly It was written the input wasn't a cyclic graph at all.

I don't think I got TLE because that.
What's wrong? Please help me.


#include <cstdio>

bool adj[101][101] = {false};
// adj[i][j] : Are I and J connected?
int indegree ...

#include <iostream>
#include <cstdio>

using namespace std;

bool adj[3001][3001] = {false};
// Graph will be transformed into adjacently matrix.

void reset(); // Reset after each test case.

int main()
{
int t, n, m, a, b, i, j, k;

cin >> t;

while(t--) {
int triangle = 0; // The number of ...

HaHaHa!

Guys, Now I'm winning!

Finally, I got AC.

I appreciate your help.

Thanks!

Sample inputs : I tried input sample inputs into my program, and it outputed correct answer in that inputs.
But I got WA.
I really don't know what's wrong.
Please help me. Please!

My list...
1. PHP
2. HTML
3. C++
4. English
5. Korean

Which programming language are you useing more often?
Please Vote.

Check your E-mail First.(If you checked 'The host I used to send that program' on 'You want to receive the replies from the Online Judge to : ', when you registered)

Your E-mail account maybe received the mail from Online Judge.
Just check the E-mail. Then, you will see what's the problem.

(Sorry ...