牛客周赛round29

链接：登录—专业IT笔试面试备考平台_牛客网
来源：牛客网

小红希望你构造一个数组，满足以下三个条件：
1. 数组的元素都是素数。
2. 数组所有元素相乘恰好等于xxx。
3. 数组任意相邻两个元素不等。

//最气人的一道题，以我的思路想了快一天了还没做出来

md先记下等以后有能力了在研究

折磨我一天

#include<stdio.h>
#include<math.h>
int panduansushu(long long int x) {

    int count = 2;
    int a = 1;

    while (count <= sqrt(x)) {
        if (x % count == 0)
            a = 0;
        count++;
    }
    //if (a == 0)
        //printf("不是素数");  
    //else
        //printf("是素数");
    return a;
}

int shuzu[10000];
int shuzu2[10000];
int xiabiao = 0;
int main() {
    long long int d;
    scanf("%lld", &d);

    int bq1 = 0;
    int geshu = 0;
    if (panduansushu(d) == 1)printf("1\n%lld", d);
    else {
        do {
            long long int m = 1;
            int bq = 1;
            while (bq == 1) {
                m++;
                if (d % m == 0 && panduansushu(m) == 1) {
                    bq = 0;
                }
            }
            shuzu[xiabiao] = m;
            d = d / m;

            xiabiao++;
        } while (panduansushu(d) == 0);
        int gs = xiabiao;
        shuzu[xiabiao] = d;
        if (shuzu[(xiabiao + 1) / 2] != shuzu[(xiabiao - 1) / 2] || (xiabiao + 1) % 2 == 0) {
            for (int i = 0; i <= xiabiao; i++) {
                if (i < (xiabiao + 1) / 2)shuzu2[2 * i + 1] = shuzu[i];
                else shuzu2[2 * (i - (xiabiao + 1) / 2)] = shuzu[i];

            }
        }
        else {
            for (int i = 0; i <= xiabiao; i++) {
                if (i <= (xiabiao + 1) / 2)shuzu2[2 * i] = shuzu[i];
                else shuzu2[2 * (i - (xiabiao + 1) / 2) - 1] = shuzu[i];
            }
        }
        int geshu = 0;
        int bq = 1;
        int u = shuzu[gs / 2];
        if (xiabiao % 2 == 0) {
            if (u == shuzu[xiabiao/ 2 -1] && u == shuzu[xiabiao / 2 +1]) {
                for (int i = 0; i <= xiabiao; i++) {
                    if (shuzu2[i] == u)
                        geshu++;
                }
                if (geshu == xiabiao / 2+1 )bq = 0;
            }
        }
        for (int i = 0; i < xiabiao; i++) {
            if (shuzu2[i] == shuzu2[i + 1] && bq == 1) {
                printf("-1");
                return 0;
            }
            else if (shuzu2[i] == shuzu2[i + 1] && bq == 0) {

                printf("%d\n", xiabiao + 1);
                for (int t = 0; t <= xiabiao; t++) {
                    if (t == 0) {
                        printf("%d %d ", u, shuzu2[t]);
                    }
                    else if (t == i);
                    else printf("%d ", shuzu2[t]);

                }
                return 0;
            }
        }
        printf("%d\n", xiabiao + 1);
        for (int i = 0; i <= xiabiao; i++) {
            printf("%d ", shuzu2[i]);
        }
    }
    return 0;

}

等若干年后自己翻自己的博客的时候，诶呀再想想这个思路怎么拿满分

直接跳槽去别

#include<math.h>
#include<stdio.h>
#include<stdlib.h>
#define N ((int)1e5 + 4)
struct st{
    long long val;
    long long key;
};
long long st_cmp(const struct st *p1, const struct st *p2){
    return p2->key - p1->key;
}
int main(){
    long long x;
    scanf("%lld", &x);
    if(x == 1){
        printf("-1");
        return 0;
    }
    struct st s[N] = {0};
    long long sindex = 0;
    long long i;
    for(i = 2; i * i <= x; i++){
        if(x % i == 0){
            while(x % i == 0){
                s[sindex].val = i;
                s[sindex].key++;
                x /= i;
            }
            sindex++;
        }
    }
    if(x != 1 && x == i){
        s[sindex - 1].key++;
    }
    if(i != x && x != 1){
        s[sindex].val = x;
        s[sindex].key++;
        sindex++;
    }
    qsort(s, sindex, sizeof(struct st),
         (long long(*)(const void *, const void *))st_cmp);
    long long sum = 0;
    for(long long i = 1; i < sindex; i++){
        sum += s[i].key;
    }
    if(s[0].key > sum + 1){
        printf("-1");
        return 0;
    }
    printf("%d\n",sum + s[0].key);
    for(long long i = 0; i < sindex; i++){
        while(s[i].key >= 1){
            printf("%lld ", s[i].val);
            s[i].key--;
            for(long long j = sindex - 1; j >= i; j--){
                if(s[j].key >= 1){
                    printf("%lld ", s[j].val);
                    s[j].key--;
                    break;
                }
            }
            qsort(s, sindex, sizeof(struct st),
                (long long(*)(const void *, const void *))st_cmp);
        }
    }
    return 0;

人的地方学习代码

看的眼花撩乱的 勉勉强强看得懂