OJ Board

Hi!
Actually, there is a special case : when you don't move (you updated position is the same than your last position), the area should not change.
Regards.

Hi,

I didn't checked your code, but did you test input with 'z' and 'Z' ?

I've got the same problem and solved it like that ...

Regards,

Brainless

Ok,ok ...

Now I got AC. The problem was on overflow of the value "b", which is not a double, but I unsigned long long ...

I submitted totally 8 times ...

For n = 1 000 000, the output I get is :

2030481550920432

Hi,

I think that my algorithm is correct, but I still get WA.

Here is my source code :

#include <iostream>
#include <map>
using namespace std;

typedef unsigned long ul;
typedef unsigned long long ull;
typedef long double ld;

int main()
{
map<ul, ld> S;
//ld S[1000001];
ld R;
S[3] = 0;
S[4 ...

Thank you very much !

My problem was an overflow, because I didn't used doubles.

But now I got accepted

Hello,

I've got the right output for the simple input, but the result of submission is WA.

Can you tell me what is your output with this input ?

Input:
49872
1000000
197324
230
523789
2
998243
0
My output:
Case 1: 3076170 102967095
Case 2: 602381204 3515044760
Case 3: 48180480 1844487282 ...

Hello,

Can somebody post an input and output ?

I get WA but don't know where is the fault.

Thanks !

Hello,

Can someone help me for understanding the problem ?
make this output : So why in the sample output below the first 3 lines are :
Thanks !

Ok, finally I found :

The output was incorrect with 50! : my program output a new line, which should not be .

Hi,

I heve followed your suggestions, but I still get WA.

My code :


#include <iostream>
#include <vector>
#include <map>
#include <iomanip>
#include <list>
using namespace std;

void get_prime_factors(const int& n, vector<int>& v)
{
int k(n);
for(int i=2; k!=1; ++i)
{
while(k%i == 0)
{
v ...