P1414 又是毕业季II(数论)

又是毕业季II - 洛谷https://www.luogu.com.cn/problem/P1414

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)

int n;
int t;
int c[MAXN];
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		int x;
		scanf("%d", &x);
		t = max(t, x);
		for (int i = 1; i <= sqrt(x); i++) {
			if (x % i == 0) {
				c[i]++;
				if (x != i * i) {
					c[x / i]++;
				}
			}
		}

	}
	int x = t;
	for (int i = 1; i <= n; i++) {
		while (c[x] < i) {
			x--;
		}
		printf("%d\n", x);
	}
	return 0;
}