I had the same solution in Java (except I used the Sieve of Atkin and instead of a boolean[][] I changed the original input array directly), but I kept getting WA :/.
Can somebody check my solution to see what’s wrong? I tried several test cases, but all of them printed out the right answer…
Actually i did the same solution described above in Python but it didn’t work (i got Time Limit Exceeded), you can check my attempt here and here.
But actually, i was able to find another algorithm for this problem that got accepted, the idea was that i only check for immediate neighbors of any server to know if it should be included or not, of course this may lead to count a server while it shouldn’t (i.e. it should have been already cracked), but to be aware of this case i created a Python dictionary that hold information about which server cracked which one (cracked_by) and then each time i visit a server i check if i should update the cracked_by of the immediate neighbors to know if i added wrongly a server if yes i discard the value from the result.
You can check my solution here, feel free to post any feedback.
I got AC after using Sieve of Eratosthenes but I want to implement it by another method by which I couldn’t. We can find all prime numbers less than 10^7 by simply making another prime number program and copy the output and assign it to array in our program arr[]={all prime numbers less than 10^7 that we already have.}. Now just apply a for loop
for(i=0;i<arr.size;i++)
arr1[arr[i]]=i;
now just find if any number is a prime by
if(arr1[num]!=0)
return arr1[num];
but In the above approach I couldn’t assign the whole set of prime numbers to arr[] manually by copy paste. I am getting error “/usr/lib/gcc/i486-linux-gnu/4.3.2/…/…/…/…/lib/crt1.o: In function _start': /home/aurel32/tmp/glibc/glibc-2.9/csu/../sysdeps/i386/elf/start.S:115: undefined reference tomain’ collect2: ld returned 1 exit status” when I am submitting my code.
i have checked all the test cases which u have provided in the editorial and it gives right answer.I am unable to figure out the problem. CodeChef: Practical coding for everyone
I habe a problem in my solution http://www.codechef.com/viewsolution/1745646 based on the editorial which seems to be more a compiler/c++ problem then an algorithmic problem.
I got the error “Access violation reading location 0x01A4B7A4” when trying to read from my big prime array. Can anyone help?
It gave correct results for the test cases mentioned in the editorial here, those in the problem statement and some cases generated by myself. But still it displays ‘Wrong Result’ here.
Hi, I just studied DFS and then searched this problem through question tags.
I passed the given test cases and also the cases given in editorial.
But still couldn’t get AC.
struggling from a day with my code here
it gives correct answer to all cases ever in discussion or editorial but still getting a WA.
help would be greatly appreciated
Did you test you program at least somehow?
They produce wrong result on any possible test.
I don’t know. Consider for example this one:
1
1
3
The correct answer is 1, while you return -0 (yeah, with this crappy minus sign)
One suggestion is that you should use long long type for unsec and print it as printf("%lld ",unsec).
are you sure this test case my program give wrong answer because in my computer answer is 1 not -0.are you sure that you check correct submit my program id is:1681905