Minimum Sum LCM

http://www.bnuoj.com/bnuoj/contest_show.php?cid=2322#problem/25805

// File Name: bo_jwolf7.cpp// Author: rudolf// Created Time: 2013年08月26日 星期一 09:19:48#include<vector>#include<list>#include<map>#include<set>#include<deque>#include<stack>#include<bitset>#include<algorithm>#include<functional>#include<numeric>#include<utility>#include<sstream>#include<iostream>#include<iomanip>#include<cstdio>#include<cmath>#include<cstdlib>#include<cstring>#include<ctime>using namespace std;int main(){int Case = 1 ;long long n , sum , temp1 , temp2 ;while( cin >> n && n ){temp1 = n ; sum = 0 ;int  count = 0 ;cout << "Case " << Case++ << ": " ;for( int i = 2 ; i <= sqrt( n ) ; ++i ){//temp2 = 1 ; if( temp1 % i == 0 ){count ++ ;temp2 = 1 ;while( temp1 % i == 0 ){temp2 *= i ;temp1 /= i ;}sum += temp2 ;}}if( n == temp1 )sum = n + 1 ;else if( count == 1 || temp1 != 1 )sum += temp1 ;cout << sum << endl ;}return 0;}