需要注意几种情况:
1.n为1的时候
2.n为素数的时候
3.n是一个素因子幂的时候
/***********************************************
* Author: fisty
* Created Time: 2015/3/2 13:41:35
* File Name : uva10791.cpp
*********************************************** */
#include <iostream>
#include <cstring>
#include <deque>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <cstdio>
#include <bitset>
#include <algorithm>
using namespace std;
#define Debug(x) cout << #x << " " << x <<endl
#define Memset(x, a) memset(x, a, sizeof(x))
const int INF = 0x3f3f3f3f;
typedef long long LL;
typedef pair<int, int> P;
#define FOR(i, a, b) for(int i = a;i < b; i++)
#define MAX_N 100000
int main() {
//freopen("in.cpp", "r", stdin);
cin.tie(0);
ios::sync_with_stdio(false);
LL n;
int cnt = 1;
while(cin >> n){
if(!n) break;
cout << "Case " << cnt++ << ": ";
if(n == 1) {cout << 2 << endl; continue;}
LL sum = 0;
LL _n = n;
int m = sqrt(n + 0.5);
for(int i = 2;i <= m; i++){
int tem = 1;
while(n % i == 0){
n /= i;
tem *= i;
}
if(tem != 1){
sum += tem;
}
}
if(n > 1) sum += n; //代表n为素数
if(sum == _n) cout << sum+1 << endl;
else cout << sum << endl;
}
return 0;
}