Search found 7 matches

by assasin
Mon Sep 14, 2009 5:36 am
Forum: Volume 4 (400-499)
Topic: 490 - Rotating Sentences
Replies: 212
Views: 20363

Re: 490 - Rotating Sentences

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
by assasin
Thu Mar 19, 2009 3:28 am
Forum: Volume 101 (10100-10199)
Topic: 10194 - Football (aka Soccer)
Replies: 119
Views: 36869

Re: 10194 - Football (aka Soccer)

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 goalAgainst; }tea...
by assasin
Mon Jul 28, 2008 10:38 am
Forum: Volume 1 (100-199)
Topic: 190 - Circle Through Three Points
Replies: 126
Views: 19945

190 Getting WA

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(){ double coun...
by assasin
Mon Jul 28, 2008 10:34 am
Forum: Volume 7 (700-799)
Topic: 727 - Equation
Replies: 156
Views: 34807

727 - Equation Getting RUNTIME Error

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; char ch...
by assasin
Mon Jul 28, 2008 10:30 am
Forum: Algorithms
Topic: Getting TLE again and again
Replies: 1
Views: 753

Getting TLE again and again

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,branch; bool o...
by assasin
Mon Mar 24, 2008 5:02 pm
Forum: Volume 3 (300-399)
Topic: 306 - Cipher
Replies: 74
Views: 18538

306 - Cipher getting TLE

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 string[201...
by assasin
Sun Mar 09, 2008 2:21 am
Forum: Volume 7 (700-799)
Topic: 706 - LCD Display
Replies: 221
Views: 35120

706

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(int si...

Go to advanced search