This task is to find the number of 'For' loops present in the given cpp program.

Input: Consider Input: 
int f(int a,int x)
{
	int count=1,i;
	for(i=x;i<a;i++)
		if(a%i==0)
			count+=f(a/i,i);
	if(i==a)
		return count;
	else
		return 0;
}

void main()
{
	int n,a;
	scanf("%d",&n);
	for(;n>0;n--)
	{
		scanf("%d",&a);
		if(a==1||a==2)
			printf("1\n");
		else
			printf("%d\n",f(a,2));
	}
}


Output: 2


Input: Consider Input: /*
 * ????@.cpp
 *
 *  Created on: 2011-11-27
 *      Author: Administrator
 */
int num0;//????
int factor(int x, int y)//?????
{
	int countn = 1;//????????1
	if ( x == 1 )
		return 0;
	if ( x == 2 )
		return 1;//??1,2?????
	for ( int i = y; i <= sqrt(x); i ++)
		if ( x % i == 0 )
			countn += factor(x / i, i);//?????
	return countn;
}
int main()//?????
{//?????
	int n, j;//????
	cin >> n;//????
	for ( j = 1; j <= n; j++)
	{
		cin >> num0;//???????
		cout << factor(num0, 2) << endl;//??????
	}
	return 0;//???????????????????
}//????



Output: 2


Input: Consider Input: int prime(int n, int m )
{ 
	int i,total=1;
	if(n<m)return 0;
  
	for(i=m;i<=n;i++)
	{
		if(n%i==0)
			total+=prime(n/i,i);
	}
	return total;
}
void main()
{  
	int n,b[2000],b0,i;
	scanf("%d",&n);
	for(i=0;i<=n-1;i++)
	{	
		scanf("%d",&b0);
		b[i]=prime(b0,2);
	}
	for(i=0;i<=n-2;i++)
	{
		printf("%d\n",b[i]);
	}
		printf("%d",b[n-1]);
}



Output: 3


