OJ Board

Moshiur Rahman

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...

Moshiur Rahman

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 that takes...

Moshiur Rahman

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

Moshiur Rahman

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

Try this:

Code: Select all

0.0 0.0 1.0 0.0 0.0 2.0

Output:

Code: Select all

(x - 0.500)^2 + (y - 1.000)^2 = 1.118^2
x^2 + y^2 - 1.000x - 2.000y - 0.000 = 0

Moshiur Rahman

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...

Moshiur Rahman

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[ ...

Moshiur Rahman

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

Moshiur Rahman

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

Code: Select all

while(1)
{
     int ret = scanf("%d%c",&c[i++],&a);
     if(ret != 2) return 0;
     if(a==10)break;
}

good luck!

Moshiur Rahman

for the input:

Code: Select all

0 2
0 0

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

Moshiur Rahman

try to do some memoization.

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

Moshiur Rahman

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...

Moshiur Rahman

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

read the problem statement again carefully.....

Moshiur Rahman

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.

OJ Board

Search found 13 matches

Re: 10679 - I love Strings!!!

Re: 482 Permutation Arrays

Re: 190-Circle Through Three Points

Re: 190-Circle Through Three Points

Re: 11572 - Unique Snowflakes

SPOJ BRCKTS Using segment tree (help!)

Re: 10589 - Area

Re: 498 TLE

Re: 10183 - How many Fibs?

Re: 371 - Ackermann Functions #TLE. Please Help!

Re: 10006 - Carmichael Numbers

Re: 488wa!!!!!!!please help me!!!!!!!!where is the problem

Re: What kinds of problems do you solve most ?