HDU_5224 Tom and paper

[code]#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
int Is_Prime(int n)
{
    if(n<2)
        return 0;
    if(n==2||n==3)
        return 1;
    for(int i=2; i*i<=n; i++)
        if(n%i==0)
            return 0;
    return 1;
}
int main()
{
    int T,n,ans;
    cin>>T;
    while(T--)
    {
        cin>>n;
        if(n==0)
        {
            cout<<0<<endl;
            continue;
        }
        if(n==1)
        {
            cout<<4<<endl;
            continue;
        }
        if(Is_Prime(n))
        {
            cout<<(n+1)*2<<endl;
        }
        else
        {
            for(int i=2; i*i<=n; i++)
            {
                if(n%i==0)
                {
                    ans = i;
                }
            }
            cout<<2*ans+2*(n/ans)<<endl;
        }
    }
    return 0;
}