#include<iostream>
#include<string>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<iomanip>
#include<map>
#include<algorithm>
#include<queue>
#include<set>
#define inf 10000000
#define pi acos(-1.0)
#define eps 1e-8
#define seed 131
using namespace std;
typedef pair<int,int> pii;
typedef unsigned long long ULL;
typedef long long LL;
const int maxn=100005;
int N;
int main()
{
LL ans;
int cas=1;
while(~scanf("%d",&N))
{
if(N==0)
break;
ans=0;
int m=sqrt(N+0.5);
int num=0;
LL tmp;
int n=N;
for(int i=2;i<=m;i++)//分解
{
if(n%i==0)
{
num++;
tmp=1;
while(n%i==0)
{
n=n/i;
tmp*=i;
}
ans+=tmp;
}
}
if(n>1)
{
num++;
ans+=n;
}
if(num==0)
ans=N+1;
if(num==1)
ans++;
printf("Case %d: %lld\n",cas++,ans);
}
return 0;
}
uva10791 Minimum Sum LCM
最新推荐文章于 2018-03-06 16:44:33 发布