OJ Board

Is there anyone who can help me?

But, what about my WA??

I am very very disappointed with this problem... I am getting WA. But I have solved similar problem like #10008. I can't find any mistake here. Can anyone help me?? Thanks in advance!

[c]#include<stdio.h>
#include<string.h>
#define N 10000
#define M 160

struct {
char ch;
int c;
}chrs[M ...

Now please tell me... why i am getting TLE....

[c]#include<stdio.h>
#include<ctype.h>
#include<string.h>
#define N 1500000

char str[N],tmp;
int i,j,k;

int isvowel(char ch1)
{
char ch = tolower(ch1);
if(ch!='a'&&ch!='e'&&ch!='i'&&ch!='o'&&ch!='u')
return 0;
else
return 1;
}

void main(void ...

turuthok, thanks. I have started thinking in your way... Thanks again!

Why I always get WA????????

[c]#include<stdio.h>
#define SIZE 20

struct letter{
char chr;
int freq;
};

struct letter in[SIZE];
char str1[20000];
unsigned long long i,j,flag,countStruct,n,k,sum,cur;

unsigned long long fact(unsigned long long d)
{
unsigned long long s,b;
s=1;
for(b=1;b<=d;b ...

So, how can I avoid TLE???? I haven't start Algorithm course... so can't I solve this without using Algo??? Thanks.

Please can anyone help me on this code? Why WA? Where is my mistake??

[c]#include<stdio.h>
#include<ctype.h>
#include<string.h>

char str[32000];

void main(void)
{
char high,low;
int i,flag;
while(gets(str))
{
high = 0, flag = 0;
for(i=0;i<strlen(str);i++)
{
if(!(isupper(str )||islower ...