rt，从 $n=400$ 左右开始我的程序输出就会更大了。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#define ll long long
#define ull unsigned long long 
using namespace std;
ll prime[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173};
ll t,n,cnt2;
bool is_luckynumber(ll x){
	ll cnt1=0;
	for(int i=0;i<=39;i++){
		if(x%prime[i]==0)	cnt1++;
		if(cnt1>=3)	return true;
	}
	return false;
}
int main(){
	ios::sync_with_stdio(false);
	cin>>t;
	while(t--){
		cnt2=0;
		cin>>n;
		for(int i=1;i<=30000;i++){
			if(is_luckynumber(i))	cnt2++;
			if(cnt2==n){
				cout<<i<<endl;
				break;
			}
		}
	}
	return 0;
}