1161
#include <bits/stdc++.h> // 万能头文件
using namespace std;int main()
{
int n, a[1000], x, y;
cin >> y >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
x = n;
for (int i = 0; i < n; i++)
{
if (a[i] >= y)
{
x = i;
break;
}
}
for (int i = n - 1; i >= x; i--)
{
a[i + 1] = a[i];
}
a[x] = y;
n++;
for (int i = 0; i < n; i++)
{
cout << a[i] << " ";
}
return 0;
}
1135
#include <bits/stdc++.h>
using namespace std;bool sushu(int n)
{
bool r = true;
for (int i = 2; i <= sqrt(n); i++)
{
if (n % i == 0)
{
r = false;
break;
}
}
if (n <= 1)
{
r = false;
}
return r;
}void caixiang(int n)
{
for (int i = 2; i <= n / 2; i++)
{
if (sushu(i) == true && sushu(n - i) == true)
{
cout << n << "="<< i << "+" << n - i << endl;
}
}
}int main()
{
int n;
cin >> n;
for (int i = 4; i <= n; i += 2)
{
caixiang(i);
}
return 0;
}
1140
#include <iostream>
#include <cmath>
using namespace std;int he(int n)
{
int r = 0;
for (int i = 2; i <= sqrt(n); i++)
{
if (n % i == 0)
{
if (i != n / i)
{
r = r + i + n / i;
}
else
{
r += i;
}
}
}
return r;
}int main()
{
int n, x;
cin >> n;
for (int i = 1; i <= n; i++)
{
x = he(i);
if (he(x) == i && i != x && x <= n)
{
cout << i << " " << x << endl;
}
}
return 0;
}