hdu5778

abs

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 808    Accepted Submission(s): 293

Problem Description

Given a number x, ask positive integer  y≥2, that satisfy the following conditions:
1. The absolute value of y - x is minimal
2. To prime factors decomposition of Y, every element factor appears two times exactly.

 

Input

The first line of input is an integer T (  1≤T≤50)
For each test case，the single line contains, an integer x (  1≤x≤1018)

 

Output #include

For each testcase print the absolute value of y - x

 

Sample Input

5 1112 4290 8716 9957 9095

 

Sample Output

23 65 67 244 70

   

Source

BestCoder Round #85

#include
#include
#include
#include
#include
const long long INF=0x7fffffffffffffll;
using namespace std;
long long ans;
long long n;
bool work(long long x)
{
    if(x<2)
    {
        return false;
    }
    long long t=x;
    for(long long i=2;i*i<=x;i++)
    {
        if(x%i==0)
        {
            if(x%(i*i)==0)
            {
                return false;
            }
            x/=i;
        }
    }
   // cout<>t;
    while(t--)
    {
        scanf("%lld",&n);
        long long x=(long long)(sqrt(n)+0.5);
        cout<