OJ Board

sazzadcsedu

Rather than doing-
m= (n* 100), do this:
m = (int) (n * 100 + 0.5) to avoid floating point error.

sazzadcsedu

you should get memory limit exceed.How much memory you used- int mark[10000][10000]; int store[10000][10000]; Its a simple 1-dimentional DP problem.look at the sample input 4 1 2 4 6 Declare an array A[50000] because highest value may be 100*500=50000 and and fill it by 0. now add all element .Sum=1...

sazzadcsedu

Your program even don't pass the sample input.

sazzadcsedu

Your ans is right.
Correct output-

Code: Select all

The nicest part of route 1 is between stops 1 and 4
The nicest part of route 2 is between stops 4 and 7

sazzadcsedu

First Ans-
There exist a thread for problem no. 392.So why you are creating a new thread.

And then try this-

Code: Select all

-1 -1 2 3 4 5 0 0 0

your output:-

Code: Select all

-x^8 - x^7 + x^6 + x^5 + x^4 + x^3

Actual output:-

Code: Select all

-x^8 - x^7 + 2x^6 + 3x^5 + 4x^4 + 5x^3

sazzadcsedu

Try this-

Code: Select all

your code output-
The nicest part of route 1 is between stops 5 and 7

Answer-
The nicest part of route 1 is between stops 1 and 4

sazzadcsedu

@shafaet_du, Some of your input is wrong.Because the problem statement clearly says-

There is always a space (ASCII #32) immediately after each operand.

sazzadcsedu

Ok,tell me what will be the output of

Code: Select all

salim1233sazzad

your code produce 1.And the correct answer is 2.

sazzadcsedu

You have problem in reading input.When you have to consider empty string you need to use gets().So use gets.and when you use gets() keep one thing in mind you have to read a dummy string if you take input before for taking newline.Like : scanf("%d",&n); gets(text); //dummy input for(j=1;j<=n;j++) { ...

sazzadcsedu

what is the number of composite prime less than 2^20(1048556).Is it 227886??

sazzadcsedu

No, I don't think so.Here is an efficient way-

Code: Select all

 code removed

I have no time to explain my code.So its upto you to understand the code.Dont submit it without understanding.And let me know after copying so that i can remove it.

sazzadcsedu

This problem can be solved in many ways.I have solved it in the following way:- 1.Create a suffix array. 2.Sort the suffix array using qsort(). 3.Find the longest match(pattern) from suffix array. 4.Then using Knuth-Moris-Pratt find the no. of occurrence of pattern in the given string. It takes 0.11...

sazzadcsedu

nishith wrote- rifayat samee_du wrote:I think the given graph can be disconnected !! :D My code handled that and got AC. try this case : Code: Select all input: 7 1 2 3 2 3 5 6 6 7 0 0 output : 2 I don't think so. My accepted code gives the output 1. Because the the graph has two subgraph, in which ...

sazzadcsedu

You are printing an extra space here:

Code: Select all

 
        s[j] = '\0';
        reverse(s, s+j);
        printf("%s(space)", s);

        Here you printing extra space,replace space with another character,you will find the problem.

OJ Board

Search found 136 matches

Re: 11223 - O: dah dah dah!

Re: 147 __int64 can't hold big results.Please help

Re: 562 - Dividing Coins

Re: Skew Binary: got WA

Re: 507 - Jill rides again

Re: 392 WA

Re: 507 - Jill rides again

Re: 11148 - Moliu Fractions

Re: 494 WA

Re: 673 - Parentheses Balance

11086 - Composite Prime

Re: 884 - Factorial Factors

Re: 11512 - GATTACA

Re: 315 Network

Re: 483 Word Scramble PE!!!!!!!!!!!!!