OJ Board

You can't get AC with KMP in this problem! Actually you don't need KMP :) Fortunately ( or unfortunately :-? ) the judge data is wrong and funny ( sorry to say that ) You can get AC just by checking whether t is a prefix of st or not! Just check the first strlen(t) characters of st . By the way, you...

I think you have to change your method of "input taking" for second input line. you can use the value of i to take the second line. Note that, you will be given exactly i floating point numbers. So, you don't need to worry about the white spaces. You get the value of i from the while loop ...

well... I got AC by printing blank line after each testcases, but got WA by printing blank line between testcases.

"Print a single blank line after each equation pair."

Try this: Output:

I am having an impression that, you did the same mistake as I did. At first, I misunderstood the problem statement. The problem asks to find the highest number of unique snowflakes that comes one after another , not just the number of total unique snowflakes. It can be restated as follows: Given a s...

I was working on https://www.spoj.pl/problems/BRCKTS/ My half solution : Replace all the '(' with 1 and ')' with -1 and construct a new array A[ ]. ( A = 1 or -1 ) calculate C[ ]. ( C is the sum of the values A[0]...A ) Now, for determining whether the word is correct or not you need to check if A[ ...

You don't need to use this complex and error prone long long method any more...
The very straightforward approach using doubles is enough to get AC. I think the judge data is ok now

I made the following change in your second while loop and got AC:
good luck!

for the input: your program returns 4. when the correct answer should be 2.

try to do some memoization.

Don't calculate for the same input again, just save the cycle length in an array...

reply for adhoc17...... Your program returns 62 Carmichael Numbers in the input range, while there are only 15 for example 341,645,....60787 are not a Carmichael Numbers, but your program says they are also Carmichael numbers your isprime() function does not work for numbers which are a power of two...

You must print blank lines between testcases also....

read the problem statement again carefully.....

I love solving any kind of problems. But specially I like,

1. number theoritic problems
2. bfs, dfs related graph problems
3. any problem that has a recursive solution.