TASK DEFINITION: This task is to find the number of 'For' loops present in the given cpp program.
PROBLEM: void account (int ,int);
int p;
int main()
{
	int m;
	int n;
	cin>>n;
	while(n>0)
	{
		p=0;
    cin>>m;
account(m,1);
cout<<p<<endl;
n--;
	}
return 0;
}
void account (int m,int i)
{
if(m==1)
    p++;
else for(int j=2;j<=m;j++)
	{
	if((m%j==0)&&(j>=i))
     account(m/j,j);
	}
}

SOLUTION: 1

PROBLEM: /*************************************************************************************************************
* @file .cpp
* @author ????
* @date 
* @description
*         ????
*/

int i;
int fenjie( int x, int t)
{
	int j;
	if(x == 1 || x == 2)
		return 1;
	int s = 1;
	for (j = t; j <= sqrt(x); j++)
	{
		if (x % j == 0)
			s += fenjie((x / j), j);
	}
	return s;
}

int main()
{
	int n, a[100],x,t;
	cin >> n;
	for (i = 0; i < n; i++)
	{
		cin >> x;
		a[i] = fenjie(x,2);
	}
	for(i = 0; i < n; i++)
		cout << a[i] << endl;
	return 0;
}

SOLUTION: 3

PROBLEM: //*********************************
//* file?1.cpp
//* description: ????
//* author: ?? 1200012858		
//* date: 2012-12-1
//*********************************
int decompose(int x, int y);
int main ()
{
	int n, m;
	cin >> n;
	for (int j = 1; j <= n; j++)
	{
		cin >> m;		
		cout << decompose(m, 2) << endl;
	}
	return 0;
}
int decompose(int x, int y)
{
	int sum = 1,b;
	b = (int)sqrt(x);
	if (x == 1) return 0;
	for (int i = y; i <= b; i++)
	{
		if (x % i == 0)
		{	
			 sum = sum + decompose(x / i, i);
		}
	}
	return sum;
}


SOLUTION:
2

