第一题:输入1000以内的数字判断是不是回文数
#include<iostream>
#include<algorithm>
using namespace std;
bool iscyclenum(int x) {
int a[9] = { 11,22,33,44,55,66,77,88,99 };
if (x < 100) {
for (int i = 0; i < 10; i++) {
if (a[i] == x) {
return true;
}
}
}
else {
int ge = x % 10;
int bai = x / 100;
if (ge == bai) {
return true;
}
return false;
}
}
int main() {
int x;
cin >> x;
if (iscyclenum(x) ) {
cout << "true" << endl;
}
else
cout << "false" << endl;
return 0;
}
第二题:输入一个不定长度的字符串,若存在大写,请修改为小写
#include<iostream>
using namespace std;
char turn(char a[],int n) {
for (int i = 0; i < n; i++) {
if (a[i] >= 'A' && a[i] <= 'Z') {
a[i] = (char)(a[i] - 'A' + 'a');
}
}
}
int main() {
char a[100] ;
cin.getline(a, 100);
int n = strlen(a);
turn(a,n);
cout << a;
return 0;
}
第三题:求100以内的素数之和
#include<iostream>
using namespace std;
int isprime(int prime[]) {
int p[100] = {0};
int num = 0;
for (int i = 2; i < 100; i++) {
if (p[i] == 0) {
prime[num++] = i;
for (int j = i + i; j < 100; j += i) {
p[j] = 1;
}
}
}
}
int main() {
int prime[100] = { 0 };
isprime(prime);
int primesum = 0;
for (int i = 0; i < 100; i++) {
primesum += prime[i];
}
cout << primesum << endl;
return 0;
}