回文对称数 多方法
作者:
WindSkyEnd
,
2024-10-30 16:30:16
,
所有人可见
,
阅读 2
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
using ll = long long int;
using namespace std;
int main()
{
int n ;
cin >> n;
for(int i = 1 ; i <= n ; i++)
{
string str;
char ch;
int temp = i;
while(temp!=0)
{
ch = temp%10+'0';
str += ch;
temp /= 10;
}
string copy_str = str;
reverse (copy_str.begin(), copy_str.end());
if(str == copy_str) cout << i << endl;
}
return 0;
}
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
using ll = long long int;
using namespace std;
int main()
{
int n ;
cin >> n;
for(int i = 1 ; i <= n ; i++)
{
string str;
char ch;
int temp = i;
while(temp!=0)
{
ch = temp%10+'0';
str += ch;
temp /= 10;
}
string copy_str = str;
for(int i = 0 ; i < str.length() ; i++)
{
copy_str[i]=str[str.length()-i-1];
}
if(str == copy_str) cout << i << endl;
}
return 0;
}
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
using ll = long long int;
using namespace std;
int main()
{
int n ;
cin >> n;
for(int i = 1 ; i <= n ; i++)
{
int cnt = i;
int rever = 0;
while(cnt!=0)
{
ll temp = cnt%10;
rever = rever*10 + temp;
cnt /= 10;
}
if(i == rever) cout << i << endl ;
}
return 0;
}