ACM - DIVSUM - Divisor Summation - SPOJ

DIVSUM - Divisor Summation

#include <iostream>
#include <string>
using namespace std;
int calcpr(int n)
{
	if (n == 1)
		return 0;
	int summ = 0;
	for (int i = 1; i*i <= n; i++)
	{
		if (n%i == 0)
		{
			summ = summ + i ;
			if (i != 1)
			{
				if (n / i == i)
					break;
				summ += n / i;
			}
		}
			
	}
	return summ;
}
int main()
{

	int t, x;
	cin >> t;
	while (t--)
	{
		cin >> x ;
		cout << calcpr(x) << endl;
	}
	return 0;
}