instruction:
This task is to find the number of 'For' loops present in the given cpp program.
question:
//
//  main.c
//  ???? ? ??????????
//
//  Created by zhaoze on 13-11-5.
//  Copyright (c) 2013? zhaoze. All rights reserved.
//


void next(int c[],int x)
{
    int i,j;
    c[0]++;
    for (i=1; c[0]*c[1]*c[2]*c[3]*c[4]*c[5]*c[6]*c[7]*c[8]*c[9]*c[10]*c[11]*c[12]*c[13]*c[14]>x; i++)
    {
        c[i]++;
        for (j=0; j<i; c[j++]=c[i]);
        if (c[14]==2)  break;
    }
}


int reslove(int x)
{
    int c[15]={1,1,1,1,1,1,1,1,1,1,1,1,1,1,1};
    int p=0;
    while (c[0]*c[1]*c[2]*c[3]*c[4]*c[5]*c[6]*c[7]*c[8]*c[9]*c[10]*c[11]*c[12]*c[13]*c[14]<=x)
    {
        if (c[0]*c[1]*c[2]*c[3]*c[4]*c[5]*c[6]*c[7]*c[8]*c[9]*c[10]*c[11]*c[12]*c[13]*c[14]==x) p++;
        next(c, x);
    }
    return p;
}


void main()
{
    int i=0,n,a;
    scanf("%d",&n);
    while (i++<n)
    {
        scanf("%d",&a);
        printf("%d\n",reslove(a));
    }
    
    
    /*
    *int c[15]={2,2,2,2,1,1,1,1,1,1,1,1,1,1,1};
    *int x=20;
    *{next(c, x);
    *printf("%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d \n",
    *      c[0],c[1],c[2],c[3],c[4],c[5],c[6],c[7],c[8],c[9],c[10],c[11],c[12],c[13],c[14]);}
    */
}
answer:
2


question:
//**********?????????*********************
//**********???????*************************
//**********?????2012?11?27?***************
//**********???1200062701**********************


int ifsushu(int n)                                   //????????????1???
{
	if(n == 1)
	{
		return 1;
	}
	else
	{
		for(int f = n - 1;f >= 2; f--)               //??n?????
		{
			if(n % f == 0) break;
			if (f == 2)
			{ 
				return 1;
			}
		}
	}
	return 0;
}
int sum = 0;
int zhaoyinshu(int x, int max)
{
	if(x == 1)
	{
		sum++;
		return 0;
	}
	for(int i = max; i >= 2; i--)
	{
		if(x % i == 0)                // ??i?????
		{
			zhaoyinshu(x / i, i);
		}
	}
}
int main()
{
	int time, number, t;
	cin >> time;
	for(int j = 0; j < time; j++)
	{
		cin >> number;
		if(ifsushu(number) == 1)
		{
			cout << "1" << endl;
		}
		else
		{
			zhaoyinshu(number , number / 2);
			cout << sum + 1 << endl;       //????????????~
			sum = 0;
		}
	}
	return 0;
}


answer:
3


question:
//1000012915???
int f(int a,int min);
int main()
{
	int n,i,a,A[100];        //????

	cin>>n;
	
	for(i = 0;i < n;i++)     //??
	{
		cin>>a;
		A[i]=f(a,2);         //?2?????
	};

	for(i = 0;i < n;i++)cout<<A[i]<<endl; //??
	return 0;
}


int f(int a,int min)
{ 
	int result = 1; 
	int i;

	if(a < min)                 //?min?a?????????a????????
	{ 
		return 0; 
	} 
	
	for(i = min;i<a;i++)        //???????????????n???
	{ 
		if(a % i == 0)
		{ 
			result += f(a/i,i); //????????????????????????x???
		} 
	} 
	return result; 
} 
answer:

3


