反素数打表

//#include<bits/stdc++.h>
#define _CRT_SBCURE_NO_DEPRECATE
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
//#define UP(i,x,y) for(int i=x;i<=y;i++)
//#define DOWN(i,x,y) for(int i=x;i>=y;i--)
//#define sd(x,y,z) scanf("%d%d%d", &x, &y, &z)
//#define sd(x,y) scanf("%d%d", &x, &y)
#define sd(x) scanf("%d", &x)
//#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
#define MOD 1000000007
const int maxn = 502000;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;

int n, m, t, _n;
int vec[maxn];
int main()
{
	freopen("out.txt", "w", stdout);
	fill(vec, vec+maxn, 1);
	int temp = 0;int cnt = 0;
	for(int i = 2; i < maxn; i++)
    {
        for(int j = i; j < maxn; j+=i)
        {
            vec[j] += 1;
        }
    }
    int tc = 0;
    for(int i = 1; i < maxn; i++)
    {
        if(vec[i] > tc)
        {
            printf("{%d,%d},",i,vec[i]);
            tc = vec[i];
        }
    }
	return 0;
}