质数

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace  std;

int midFactor1(int n)
{
    vector<int> factors;

    for(int i = 1; i <= n; i++)
    {
        if(n % i == 0)
        {
            factors.push_back(i);
        }
    }
    return factors[factors.size()/2];
}

bool isPrime(int n)
{
    for(int i = 2; i < n; i++)
    {
        if(n % i == 0)
        {
            return true;
        }
    }

    return false;
}

int midFactor(int n)
{
    int sqrt_n = sqrt(n);
    
    if (n == sqrt_n * sqrt_n) {
        return sqrt_n;
    }

    for (int i = sqrt_n + 1; i <= n; ++i) {
        if (n % i == 0) {
            return i;
        }
    }
}


int main()
{
    // cout<<midFactor(3)<<endl;
    // cout<<midFactor(9)<<endl;
    // cout<<midFactor(12)<<endl;

    // cout<<isPrime(3)<<endl;
    // cout<<isPrime(7)<<endl;
    // cout<<isPrime(9)<<endl;
    int n[][3]={10,20,30,40,50,60};
    int (*p)[3];
    p=n;
    cout<<p[0][0]<<","<<*(p[0]+1)<<","<<(*p)[2]<<endl;
    getchar();
    return 0;
}