## Search found 28 matches

Tue Nov 22, 2005 6:20 pm
Forum: Volume 100 (10000-10099)
Topic: 10058 - Jimmi's Riddles
Replies: 22
Views: 6597
had a little refresh problem.
got AC.
Mon Nov 21, 2005 7:13 pm
Forum: Volume 100 (10000-10099)
Topic: 10058 - Jimmi's Riddles
Replies: 22
Views: 6597

### 10058-need I/O

please give me some I/O.

Wed Nov 16, 2005 11:19 pm
Forum: Off topic (General chit-chat)
Topic: In the CSE course list which course is the toughest?
Replies: 1
Views: 1575

### In the CSE course list which course is the toughest?

waiting for my 5th semister final.
just feel curious.
by the word "toughest" i mean the course for which u spent much time & labour.

my pick.....

course name:

Mathetical Analysis For Computer Science.(3 credit)

course material:

probability models &
concrete mathematics.
Wed Nov 02, 2005 7:24 pm
Forum: C++
Topic: Plz help me to "BigIntegers"
Replies: 7
Views: 2978
hi actually u dont need a compact biginteger class found & discussed in the board. u need a structure with only addition function. so declare a structure(take help from ur c++ book) with the variables. take input as a string. & for each character in the string subtruct '0' to get the desired number....
Wed Nov 02, 2005 7:01 pm
Forum: Algorithms
Topic: Expression Evaluator and Parsing
Replies: 2
Views: 2058
i havnt tested ur code just had a look at it.
i dont think u need a post fix form.
because if u r building tree u can evaluate on the process.
if u havnt solved it yet i can help.
Sat Jul 09, 2005 8:07 pm
Forum: Volume 107 (10700-10799)
Topic: 10719 - Quotient Polynomial
Replies: 51
Views: 17617
no string copy is required.
after p=strtok(params)
you can use temp=atol(p);
i think this is the easiest way to parse a line for
unknown number of inputs.
Sat Jul 09, 2005 4:38 am
Forum: Volume 107 (10700-10799)
Topic: 10719 - Quotient Polynomial
Replies: 51
Views: 17617

### Re: 10719 Quotient Polynomial getting TLE

soumit wrote:
sscanf(&input,"%ld",&p[n++]);

use only input as the first param.
i havnt tested your code.
but looking at it i think there may be some problem in input
parsing.
try to use strtok().
Tue Jun 28, 2005 10:26 pm
Forum: Volume 108 (10800-10899)
Topic: 10841 - Lift Hopping in the Real World
Replies: 9
Views: 6140
Thanks.

my code gives the same output.
but still WA.
Sun Jun 12, 2005 11:08 pm
Forum: Volume 108 (10800-10899)
Topic: 10841 - Lift Hopping in the Real World
Replies: 9
Views: 6140
I got wrong answer.
Can someone give me some I/O.
Tue Feb 15, 2005 11:02 pm
Forum: Volume 4 (400-499)
Topic: 410 - Station Balance
Replies: 41
Views: 15715

### 410-station balance

I used greedy for this proble.
but got WA.
please give me some I/O.
Mon Jan 31, 2005 3:48 am
Forum: Volume 101 (10100-10199)
Topic: 10182 - Bee Maja
Replies: 9
Views: 3286
had a little problem.
Got accepted.
Sun Jan 30, 2005 9:52 pm
Forum: Volume 101 (10100-10199)
Topic: 10182 - Bee Maja
Replies: 9
Views: 3286

### 10182-Bee problem

I simply generated the whole table for the maximum size.
and after reading a number print positionX[number],positionY[number].
got wrong ans.

please give me some I/O.
Sun Jan 30, 2005 9:37 pm
Forum: Volume 108 (10800-10899)
Topic: 10801 - Lift Hopping
Replies: 56
Views: 28041
get the lines by string & learn how to use the C library function strtok()
that will help.
Fri Jan 21, 2005 6:04 pm
Forum: Volume 108 (10800-10899)
Topic: 10801 - Lift Hopping
Replies: 56
Views: 28041
hmm changed a bit & got the correct ans .
but this time got TLE.
what is the faster method to solve it.
can you explain please.

thanks for the help.
Tue Jan 18, 2005 5:14 pm
Forum: Volume 108 (10800-10899)
Topic: 10801 - Lift Hopping
Replies: 56
Views: 28041

### 10801 - Lift Hopping

I used modified floyd-warshall & managed a wrong ans.
please give me some I/O.