Test on 2018.10.21

说是数组超了。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<string>
#include<string.h>
using namespace std;
long long a[1010], b[1010], c[10100000] = { 0 };
bool zhi(int x)
{
    if (x <= 1)    return 0;
    if (x == 2)    return 1;
    for (int i = 2; i*i <= x; i++)
        if (x%i == 0)    return 0;
    return 1;
}
int main()
{
    int n, l;
    cin >> n >> l;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n - l + 1; i++)
    {
        b[i] = 0;
        for (int j = 1; j <= l; j++)
            b[i] = b[i] * 10 + a[i + j - 1];
    }
    for (int i = 1; i <= n - l + 1; i++)
        if (zhi(b[i]))
            c[b[i]] = 1;
    int kk = 0, sum = 0;
    int yy = 1;
    for (int i = 1; i < l; i++)
        yy = yy * 10;
    for (int i = yy; i <= yy * 10 - 1; i++)
        if (c[i])    kk++;
    for (int i = yy; i <= yy * 10 - 1; i++)
        if (c[i]) {
            sum++;
            cout << i;
            if (sum == kk)    cout << endl;
            else    cout << ",";
        }
    return 0;
}

 

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
bool zhi(int x)
{
    if(x<=1)    return 0;
    if(x==2)    return 1;
    for(int i=2;i*i<=x;i++)
        if(x%i==0)    return 0;
    return 1;
}
void fenjie(int x)
{
    for(int i=2;i<=x;i++)
        if(x%i==0)
        {
            if(x==i)    cout<<i<<endl;
            else {cout<<i<<"*";
            fenjie(x/i);}
            return ;
        }
}
int main()
{
    int n;
    while(cin>>n){
    cout<<n<<"=";
    fenjie(n);}
    return 0;
}

 

不会写占坑

占坑 

占坑

占坑

占坑