CodeForces - 177B1

题目地址
**题目：**The Smart Beaver from ABBYY decided to have a day off. But doing nothing the whole day turned out to be too boring, and he decided to play a game with pebbles. Initially, the Beaver has n pebbles. He arranges them in a equal rows, each row has b pebbles (a > 1). Note that the Beaver must use all the pebbles he has, i. e. n = a·b.

10 pebbles are arranged in two rows, each row has 5 pebbles
Once the Smart Beaver has arranged the pebbles, he takes back any of the resulting rows (that is, b pebbles) and discards all other pebbles. Then he arranges all his pebbles again (possibly choosing other values of a and b) and takes back one row, and so on. The game continues until at some point the Beaver ends up with exactly one pebble.

The game process can be represented as a finite sequence of integers c1, …, ck, where:

c1 = n
ci + 1 is the number of pebbles that the Beaver ends up with after the i-th move, that is, the number of pebbles in a row after some arrangement of ci pebbles (1 ≤ i < k). Note that ci > ci + 1.
ck = 1
The result of the game is the sum of numbers ci. You are given n. Find the maximum possible result of the game.

Input
The single line of the input contains a single integer n — the initial number of pebbles the Smart Beaver has.

The input limitations for getting 30 points are:

2 ≤ n ≤ 50
The input limitations for getting 100 points are:

2 ≤ n ≤ 109
Output
Print a single number — the maximum possible result of the game.

Examples
Input
10
Output
16
Input
8
Output
15
Note
Consider the first example (c1 = 10). The possible options for the game development are:

Arrange the pebbles in 10 rows, one pebble per row. Then c2 = 1, and the game ends after the first move with the result of 11.
Arrange the pebbles in 5 rows, two pebbles per row. Then c2 = 2, and the game continues. During the second move we have two pebbles which can be arranged in a unique way (remember that you are not allowed to put all the pebbles in the same row!) — 2 rows, one pebble per row. c3 = 1, and the game ends with the result of 13.
Finally, arrange the pebbles in two rows, five pebbles per row. The same logic leads us to c2 = 5, c3 = 1, and the game ends with the result of 16 — the maximum possible result.
**题意：**一开始，海狸有n块鹅卵石。他把它们排成一行，每一行有b个石子(a > 1)注意海狸必须利用他所有的鹅卵石，即n = a·b。10个石子分成两排，每排5个石子。一旦聪明的海狸安排好了鹅卵石，他就会收回任何一行(即b个鹅卵石)，并丢弃所有其他的鹅卵石。然后他再次排列所有的鹅卵石(可能选择a和b的其他值)，拿回一行，以此类推。游戏继续进行，直到海狸最后只得到一块鹅卵石。
**思路：**一步一步的算下来就好了。
代码：#include <stdio.h>
int main()
{
int n,i;
while(~scanf("%d",&n))
{
int sum=n;
while(n!=1)
{
for(i=2;i<=n;i++)
if(n%i==0)
break;
n=n/i;;
sum+=n;
}
printf("%d\n",sum);
}
return 0;
}

**总结：**从大体思考，再一步一步想下来。