OJ Board

I'm having WA with this approach. I search for the repeated factors of the number and check if can be a power (factors exponent have to be equal). Can anyone help me please?

[cpp]#include <stdio.h>
#include <iostream.h>

long long inp,n,i,c; /*change to long lon*/
long act,maxim;

int main()
{
cin ...