UVa 10892

本题我找了下规律然后就结束了

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cmath>
#include <vector>
#include <deque>
#include <algorithm>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<=(n);i++)
#define FOR(i,a,b) for (int i=(a);i<=(b);i++)
#define CLR(x,n) memset(x,n,sizeof(x))
#define PN printf("\n")
#define read(x) scanf("%d",&x)
#define read2(x,y) scanf("%d%d",&x,&y)
#define read3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define write(x) printf("%d",x)
#define write1(x) printf("%d ",x)
#define writeln(x) printf("%d\n",x)
#define write2(x,y) printf("%d %d",x,y)
#define writeln2(x,y) printf("%d %d\n",x,y)
#define write3(x,y,z) printf("%d %d %d",x,y,z)
#define writeln3(x,y,z) printf("%d %d %d\n",x,y,z)
#define delta 1e-5
#define INF 1<<30
using namespace std;



int main()
{
    int n;
    while (read(n)==1 && n){
        int ans=1,fir=1,lim=(int)( sqrt((double)n)+0.5),m=n;
        FOR(i,2,lim)if(m%i==0){
            fir=0;
            int k=0;while (m%i==0){++k;m/=i;}
            ans*=(2*k+1);
        }            
        if (n==1)writeln2(1,1);
        else if (fir) writeln2(n,2);
        else if (m!=1)writeln2(n,(ans*3+1)/2);
        else writeln2(n,(ans+1)/2);
    }        
    system("pause");
    return 0;
}