OJ Board

I used Tarjan's SCC Algorithm to find the number of SCC in the given graph. The answer is 1 if number of SCC is 1, else the answer is 0. Now this gives WA and I can't find why. So please help me. This is the first time I'm doing SCC.

#include <bits/stdc++.h>

using namespace std;

#ifdef __GNUC ...

Why WA? my code seems to give correct output for all possible input.
#include <stdio.h>
#include <string.h>

int pal_check(char *s)
{
int len=strlen(s),i;
for(i=0;i<len/2;i++) if(s[i]!=s[len-i-1]) return 0;
return 1;
}

char *rev_add(char *s1, int len)
{
char x[1000],s2[1000];
int i,j,tmp ...

#include <stdio.h>
#include <string.h>
void sort(long long int array[], long long int length)
{
long long int i,j,count,pos,min[10000][2];

for(i=0;i<length;i++) {
min[i][1]=0;
}
for(i=0;i<length;i++) {
count=0;
for(j=0;j<length;j++) {
if(array[i]<array[j]) count++;
}
pos=++min[count][1 ...

why do I have to read one character at a time? what's wrong with my current code?

Why do I get WA for this?
#include <stdio.h>
#include <string.h>
int main()
{
char s[32767];
int i,j,k,l,len;
while(scanf("%s",s)!=EOF) {
len=strlen(s);
for(i=0;i<len;i++) {
if(s[i]>=65 && s[i]<68) s[i]='2';
else if(s[i]>=68 && s[i]<71) s[i]='3';
else if(s[i]>=71 && s[i]<74) s[i]='4';
else ...

Thank you very much. got AC!

I tried every single I/O on this forum and got correct for all of them with the following code, which by the way gets WA.
#include <stdio.h>
#include <string.h>

int main()
{
char num1[32767], num2[32767];
int i,j,count,l,min,x,y;
int sum;
while(scanf("%s %s", num1, num2)==2 && !(num1[0]=='0 ...