CodeM资格赛5

早上起床太晚，最后没时间了。。

不是ac代码，下次题目在oj上线的时候再去做一下。。

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<vector>
 #include<algorithm>
 #include<cmath>
 #include<set>
 using namespace std;

 int map[];
 int getHigh(int a) {
     while (a >= ) {
         a /= ;
     }
     return a;
 }
 void count(vector<int>& p, vector<int>& u, int size, int pos) {
     if (u.size() == size) {
         int sum = ;
         for (int j = ;j < size;j++)
             sum *= u[j];
         map[getHigh(sum)]++;
         return;
     }
     if (pos >= p.size()) return;
     //if (size - u.size() > p.size() - pos) return;
     for (int i = pos;i < p.size();i++) {
         u.push_back(p[i]);
         if (size - u.size() > p.size() - i-) {
             u.pop_back();
             /*while (i + 1 < p.size() && p[i + 1] == p[i]) i++;
             continue;*/
             return;
         }
         count(p, u, size, i + );
         u.pop_back();
         while (i+<p.size()&&p[i + ] == p[i]) i++;
     }
 }
 void getAllPrime(int k)
 {
     vector<int> prime;
     int temp = k;
     //prime.push_back(1);

     if (k < ) return;
     else if (k == )
         prime.push_back();
     else
     {
         for (int i = ;i<=sqrt(k);i++)
         {
             while (k != i) //这里用while循环是考虑到质因子中有可能有重复个i的情况
             {
                 if (k%i == )
                 {
                     prime.push_back(i);
                     k = k / i;
                 }
                 else
                     break;
             }
         }
         prime.push_back(k);
     }

     //for (int i = 0;i<prime.size();i++)
     //    cout << prime[i] << endl;

     for (int i = ;i <= prime.size();i++) {
         vector<int> u;
         count(prime, u, i, );
     }
 }

 int main()
 {
     int l, r;
     cin >> l >> r;
     memset(map, , sizeof(map));

     //1直接算
     map[] = r - l + ;
     for (int i = l;i <= r;i++) {
         getAllPrime(i);
     }
     for (int j = ;j <= ;j++)
         cout << map[j] << endl;
     //PrimeDecomposition(l);
     return ;
 }