总结:不知不觉过去了一个月,怪感慨的,感觉学的不够扎实,时间太少;尾椎骨受伤,感冒,影响了很长时间的情绪;
思路: 用归并判断是哪一个排序更简单,因为归并排序前一段从小到大,后一段顺序和原数组一样;随后重点是如果是插入排序,如何写出下一个序列,这时候用非递归的插入排序,与递归版的有点不一样,递归是一半一半分,非递归次数和递归一样,但是细节有些不同;比如10个元素,分为2 2 2 2 2-->4 4 2-->8 2-->10;而递归则是2 2 1 2 2 1-->2 3 2 3-->5 5-->10;
#include<iostream>
#include<cmath>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
int judge(int original[], int middle[],int n) {
//middle 找到不符合从小到大的第一个位置
int id = 0;
for (int i = 0; i < n-1; i++) {//n-1
if (middle[i] > middle[i + 1]) {
id = i;
break;
}
}
//对比id往后数字和original,都相同就是插入排序
for (int i = id+1; i < n; i++) {//id+1
if (middle[i] != original[i]) {
return -1;
}
}
return id;
}
void print(int arr[],int n) {
for (int i = 0; i < n; i++) {
if (i != 0) {
cout << ' ';
}
cout << arr[i];
}
}
bool is_same1(int arr[], int middle[],int n) {
for (int i = 0; i < n; i++) {
if (arr[i] != middle[i]) {
return false;
}
}
return true;
}
int main() {
int n;
cin >> n;
int* original = new int[n];
int* middle = new int[n];
for (int i = 0; i < n; i++) {
cin >> original[i];
}
for (int i = 0; i < n; i++) {
cin >> middle[i];
}
int rv = judge(original, middle, n);
if (rv!=-1) {
cout << "Insertion Sort\n";
sort(middle, middle + rv + 2);//rv后一位,再后一位为sort的end()
print(middle,n);
}
else
{
cout << "Merge Sort\n";
//非递归的归并排序,有些不同,attn
int flag = 0;
for (int step = 2; step / 2 <= n; step *= 2) {
if (step != 2 && is_same1(original, middle,n)) {
flag = 1;
}
for (int i = 0; i < n; i += step) {
sort(original + i, original + min(i + step, n));
}
if (flag) {
print(original, n);
break;
}
}
}
return 0;
}
思路:打表,判断即可;答案的思路更简单,利用只有奇数可能是素数,一个判断函数判断i和i+2是否同时为素数即可;
#include<iostream>
#include<cmath>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
int prime[100001];//默认0
int arr[100001];
int id = 0;
int main() {
int n;//打表<=n
cin >> n;
for (int i = 2; i <= n; i++) {
if (prime[i] == 0) {
arr[id++] = i;
}
for (int j = i + i; j <= n; j += i) {
prime[j] = 1;
}
}
int ctn = 0;
for (int i = 0; i < id-1; i++) {
if (arr[i + 1] - arr[i] == 2) {//相邻且差为2
ctn++;
}
}
cout << ctn;
return 0;
}
题目详情 - 1015 Reversible Primes (pintia.cn)
思路:看清题目,判断n和n在d进制下反转后的数再反转回10进制是否都为素数;注意要用long long,10^5在2进制有17个数,不然无法通过测试点3;判断素数时注意1不是素数,不然无法通过测试点1;
值得一提的是,trans可以通过数组来转换,更为简洁,可以参考答案;
又值得一提的是,进制转换需要更加熟悉!
#include<iostream>
#include<cmath>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
long long trans(int n, int d) {//attn
//十进制转换为d进制
long long res = 0;
long long i = 1;//个,十,百,测试点3,long long
do {
res += i * (n % d);
n /= d;
i *= 10;
} while (n != 0);
//d进制反转
long long res2 = 0;
do {
res2 = res2 * 10 + res % 10;
res /= 10;
} while (res != 0);
//d-->10
long long res3 = 0;
long long j = 1;//个,十,百
do {
res3 += j * (res2 % 10);
res2 /= 10;
j *= d;
} while (res2 != 0);
return res3;
}
bool is_prime(long long n) {
if (n < 2) {
return false;
}
long long sqr = (long long)sqrt(n * 1.0);
for (long long i = 2; i <= sqr; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
int main() {
int n, d;
while (scanf("%d", &n) && n >= 0) {
scanf("%d", &d);
long long res = trans(n, d);
if (is_prime(n)&&is_prime(res)) {
cout << "Yes\n";
}
else
{
cout << "No\n";
}
}
return 0;
}