破防
代码如下——
#include<iostream>
using namespace std;
int main()
{
int n;cin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
int t = n / 2;
if (i == 1 || i == n)cout << "*";
else if (j == 1 || j == n)cout << "*";
else if (i <=t + 1)
{
if (j == t + i||j == t - i + 2 )cout << "*";
else cout << " ";
}
else if (i > t + 1 && i <= n)
{
if (j == i - t || j == t - i + n + 1)cout << "*";
else cout << " ";
}
}
cout << endl;
}
}
代码如下——
#include<iostream>
using namespace std;
int main()
{
int n; cin >> n;
while (n--)
{
int a, b, c, t;
cin >> a >> b >> c;
if (a > b) {
t = a; a = b; b = t;
}
if (a > c) {
t = a; a = c; c = t;
}
if (b > c) {
t = b; b = c; c = t;
}
if (c - b == b - a)cout << "Yes" << endl;
else cout << "No" << endl;
}
}
代码如下——
#include <iostream>
#include <cmath>
using namespace std;
bool isPrime(int a) {
if(a < 2) return false;
if(a == 2) return true;
if(a % 2 == 0) return false;
for(int i = 3; i <= sqrt(a); i += 2) {
if(a % i == 0) return false;
}
return true;
}
int getNextPrime(int a) {
if(a % 2 == 0) a++;
else a += 2;
while(!isPrime(a)) {
a += 2;
}
return a;
}
int main() {
int n;
cin >> n;
while(n--) {
int a;
cin >> a;
if(a < 2) {
cout << "2 3 5" << endl;
} else if(isPrime(a)) {
cout << a << endl;
} else {
for(int i = 0; i < 3; i++) {
a = getNextPrime(a);
if(i != 0) cout << " ";
cout << a;
}
cout << endl;
}
}
return 0;
}
代码如下——真的觉得没有错555555
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
while (n--)
{
int a, b, c, d;
cin >> a >> b >> c >> d;
if ((a <= d && b <= c))
{
if (a + b > d)
{
cout << "2" << endl;
}
else
{
cout << "-1" << endl;
}
}
else
{
int cnt = 1;
int i = a;
while (i <= d)
{
cnt++;
if (cnt % 2 != 0)
{
i = i - c;
}
else
{
i = i + b;
}
if (i <= 0)
{
cnt = -1;
break;
}
}
cout << cnt << endl;
}
}
return 0;
}
这样的循环了10多遍