OJ Board

Hello,
I have tried all of test cases above, all of them seem correct. But I am still getting WA. Here is my code:


code removed



--- code removed
if(sqrt(strLength)*sqrt(strLength) == strLength) {
--- code removed


Yes, I got AC. The problem is the line above. I think, following situation ...

FINALLY!!

ACed :D

It's such a tedious problem.
Thanks Daveon!
Here's some I/O from my ACed program that I believe will help correct P.E.s and W.A.s:

Input:


5
koala.jpg
australia.exe
kangaroo.txt
foo.bar
homer.simpson



Output ...

Hello, I am getting WA for the problem.
Here is my code, i can't find the error.


#include <iostream>
#include <string>
#include <algorithm>
#include <sstream>
#include <vector>
using namespace std;
string ignores[50];
string titles[200];
struct x {
string potential;
int index;
int indexintitle ...

Hello,

I am getting Presentation Error.
What can be the reason?
Thanks.

edit: It seems ACCEPTED now. :s

-- sefa kilic

Read the problem description:

You might assume that all tests data on this problem:
- will have an answer ,
- will be computable with less than 1000 iterations (additions),
- will yield a palindrome that is not greater than 4,294,967,295.

long is not enough for this problem. Use unsigned long ...

My factorial function calculates the factorials of numbers between 8 and 13 [including them]. But I was getting WA.

I replaced the factorial function with the precalculated values. ( if (x == 8 ) printf("...") .....)

And I got AC.

I've read all posts in this topic.

I believe that I am doing right, but unfortunately I don't. I am getting WA.

Here is my code:

#include "stdio.h"

unsigned long iter_factorial(int n) {
unsigned long accu = 1;
unsigned long i;
for(i = 1; i <= n; i++) {
accu *= i;
}
return accu;
}

int ...