Thymus gives an error on test 53. What should I do? How do you even check what’s wrong? I enter the number 26584441929064321 and the program returns 26584441929064321, but another person on the forum wrote that this is the correct answer. What's the problem then? Please help

Edited by author 08.03.2024 22:12

Can this problem be solved in python?

Can't pass test 39

U HAVE VERY VERY VERY STUPID ERROR IN YOUR CODE

Some hints please. My algo takes too much time.

I understood my problem. It is about calculating sqrt, import math in python doing it wrong with very big numbers.

Edited by author 03.05.2020 00:55

My solution pass's all tests presented here in the forum.
But i get WA at 36 test, authors please help what's there????

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

int main()
{
    __int64 n, i, a, b, c, maxC1 = 1, maxC2 = 1, maxC = 1;
    cin >> n;
    for (i = 1; i*i < 1000000; i += 2)
    {
        if (n % i == 0)
        {
            a = n/i;
            b = sqrtl((long double)a);
            c = sqrtl((long double)i);

            if (b*b == a && a > maxC1) {
                maxC1 = a;
            }

            if (c*c == i && i > maxC2) {
                maxC2 = i;
            }

            maxC = max(maxC1, maxC2);
        }
    }

    cout << maxC;
    return 0;
}
</code>
Do I need to write own sqrt ? What the problem is ?



Edited by author 22.01.2015 17:54

Write your own sqrt function (with blackjack and hookers) with supporting __int64 and it'll be OK. It helped me.


Edited by author 15.09.2013 16:35

All tests on this forum gave the correct results ... I do not know what the problem is. Please, help!!!!

n=p*q. (p>1000000 and q>1000000).
p and q are two big different primes.

Edited by author 28.02.2012 02:02

Help! Any tests?

Edited by author 04.10.2011 00:02

I think tests for this problem are incomplete or too simple (or invalid), they should be more strict. For instance, my AC code returns output "1" for input "363" but it's incorrect - obviously output should be "121" since it's valid and bigger than 1.

In general, test cases (big_prime * big_prime * relatively_small_prime) and/or similar should be added.

Edited by author 26.09.2011 05:51

I get WA on test 11. Why is that ? I run a loop from 1 to sqrt(n) ,for each i , i check if
i is odd or n/i is odd and a perfect square , if yes i store it in ans.
int main()
{
long long n,i;
   long long ans=1;
   scanf(" %lld",&n);
   for(i=3;i*i<=n;i++){

      if((n%i)==0){
         long long j=sqrtl(i);
        if (j*j==i and (i&1)) ans=max(ans,i);
        j=sqrtl(n/i);
        if (j*j==(n/i) and ((n/i) &1) ) ans=max(ans,n/i);


      }
   }
   printf("%lld\n",ans);
   return 0;
}