#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
int sqrt(int n, int m) {
int c = 1;
if (m == 0) {
return 1;
}
else {
for (int i = 1; i <= m; i++) {
c *= n;
}
}
return c;
}
int bits(int n) {
int a=1,yu= n / 10;
while (yu != 0) {
yu /= 10;
a++;
}
return a;
}
int daozi(int n) {
int ci = bits(n),a=n/sqrt(10,ci-1),sum=a,f=ci-1;
for (int i = 1; i <= ci-1; i++) {
int d, b = sqrt(10, i), c = sqrt(10, i - 1),e=sqrt(10,f);
d = ((n % b) / c)*e;
sum += d;
f--;
}
return sum ;
}
void solve() {
for (int i = 200; i <= 3000; i++) {
if (i == daozi(i)) {
printf("%d\n", i);
}
}
}
int main(void)
{
solve();
return 0;
}
自己写的回文数代码算法,一起进步
最新推荐文章于 2024-09-04 21:39:45 发布