Bash’s Big Day

Bash has set out on a journey to become the greatest Pokemon master. To get his first Pokemon, he went to Professor Zulu’s Lab. Since Bash is Professor Zulu’s favourite student, Zulu allows him to take as many Pokemon from his lab as he pleases.

But Zulu warns him that a group of k > 1 Pokemon with strengths {s1, s2, s3, …, sk} tend to fight among each other if gcd(s1, s2, s3, …, sk) = 1 (see notes for gcd definition).

Bash, being smart, does not want his Pokemon to fight among each other. However, he also wants to maximize the number of Pokemon he takes from the lab. Can you help Bash find out the maximum number of Pokemon he can take?

Note: A Pokemon cannot fight with itself. Input The input consists of two lines.

The first line contains an integer n (1 ≤ n ≤ 105), the number of Pokemon in the lab.

The next line contains n space separated integers, where the i-th of them denotes si (1 ≤ si ≤ 105), the strength of the i-th Pokemon. Output Print single integer — the maximum number of Pokemons Bash can take. Examples

Note gcd (greatest common divisor) of positive integers set {a1, a2, …, an} is the maximum positive integer that divides all the integers {a1, a2, …, an}.

In the first sample, we can take Pokemons with strengths {2, 4} since gcd(2, 4) = 2.

In the second sample, we can take Pokemons with strengths {2, 4, 6}, and there is no larger group with gcd ≠ 1.

#include <stdio.h>
int a[100010],max[100010];
int main() 
{
	int n;
	scanf("%d",&n);
	int i,j;	
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);  
		for(j = 1 ; j * j <= a[i] ; j++)  /*因數不大於自己的開方，所以j*j<=a[i]*/
        if(a[i] % j == 0)
		{
            max[j]++;                /*記錄因數的個數，比如，如果輸入2，4，8， 2就被記錄了3次
			                         如果，3，6，9，2，4，  3被記錄3次，2被記錄2次，3記錄的多*/
            if(j * j != a[i])     
                max[a[i] / j]++;  /*這裡的話，比如8/2=4，這樣能記錄所有的因數*/ 
        }
	}
	int temp = 1;                   
    for(i = 2 ; i < 100001; i++)  /*i從2開始，因為gcd!=1
	                              如果輸入的都是1，temp就起了作用，
								  輸出1，因為自己不會和自己打架*/ 
	{
    	if(temp<max[i])
		temp=max[i];
	}
    printf("%d\n",temp);
	return 0;
}

（哎，問大佬的，不知道自己的錯在哪裡，我看了好久，只能把它翻譯一下，也翻譯的不太準確） （私はいったいどこが間違って） （後續，問學長說是我的寫法超時了，那也好開心啊，如果想法是沒有錯的，是我還要學習）