CodeM资格赛5

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

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

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

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

    if (k < 2) return;
    else if (k == 2)
        prime.push_back(2);
    else
    {
        for (int i = 2;i<=sqrt(k);i++)
        {
            while (k != i) //这里用while循环是考虑到质因子中有可能有重复个i的情况
            {
                if (k%i == 0)
                {
                    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 = 1;i <= prime.size();i++) {
        vector<int> u;
        count(prime, u, i, 0);
    }
}


int main()
{
    int l, r;
    cin >> l >> r;    
    memset(map, 0, sizeof(map));
    
    //1直接算
    map[1] = r - l + 1;
    for (int i = l;i <= r;i++) {
        getAllPrime(i);
    }
    for (int j = 1;j <= 9;j++)
        cout << map[j] << endl;
    //PrimeDecomposition(l);
    return 0;
}