OJ Board

Do you think if(count[j]>len[j][0]) is ok?

What if count[j] = len[j][0]?
Reconsider this and I think you are done.

Good Luck

Mahfuz

I do not understand what to do with this problem. Getting WA continuously.
Here goes my code
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>


typedef struct{
char name[32];
int point;
int numGame;
int numWin;
int numTie;
int numLoss;
int goalScored;
int ...

I don't know why I am getting WA
In fact , i am not clear about the problem
if any coefficient gets zero then what has to be done?

Please give some critical input and output
and why i am getting WA?

Here is my code:

#include <stdio.h>
#include <math.h>

#define epsilon 0.00001

int main ...

I ran my code in my pc , also for multiple inputs , but never got any runtime error
Can anyone help me to take input in the right way avoiding RunTime error

Here is the Code:
#include <stdio.h>
#include <stack>
using namespace std;


int main(){

stack<char> st;
int cases,count = 0,newline = 0 ...

I could not figure out why my code is getting TLE?
Plese someone help me to find it out and give me some input so that my code runs infinitely

Here is my code:

#include <stdio.h>
#include <math.h>

#define epsilon 0.0000001

int main(){

double root,leaf;
double lazy,height;
double level ...

I just cannot find the reason of getting TLE
I have checked for cycle if k is large enough to produce a cycle
Otherwise I just went through O(nk) times to print result
Is there any way to improve performance
please Help.


#include <stdio.h>
#include <string.h>

int n,k;
int array[201];
char ...

Here is my code


#include <stdio.h>

char sign0[25][15];
char sign1[25][15];
char sign2[25][15];
char sign3[25][15];
char sign4[25][15];
char sign5[25][15];
char sign6[25][15];
char sign7[25][15];
char sign8[25][15];
char sign9[25][15];
//s+2 rows and 2*s+3 columns
//s is at most 10

void print0 ...