2024-08-23 13:44:31 +00:00
|
|
|
#include<bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
|
2024-08-24 09:20:59 +00:00
|
|
|
// bool is_pf(int n){
|
|
|
|
// int a = sqrt(n);
|
|
|
|
// if(a*a==n){
|
|
|
|
// return true;
|
|
|
|
// }else{
|
|
|
|
// return false;
|
|
|
|
// }
|
|
|
|
// }
|
2024-08-23 13:44:31 +00:00
|
|
|
|
|
|
|
bool is_huiwen(int n){
|
|
|
|
stringstream ss;
|
|
|
|
ss<<std::oct<<n;
|
|
|
|
string bjz(ss.str());
|
|
|
|
int j=bjz.size()-1;
|
|
|
|
for(int i=0;i<bjz.size();++i,--j){
|
|
|
|
if(bjz[i]!=bjz[j]){
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
int main(){
|
|
|
|
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
|
|
|
|
|
|
|
|
int n;
|
|
|
|
cin>>n;
|
|
|
|
|
2024-08-24 09:20:59 +00:00
|
|
|
const int sqrt_n = sqrt(n);
|
|
|
|
for(int i=1;i<=sqrt_n;i++){
|
|
|
|
if(is_huiwen(i*i)){
|
|
|
|
cout<<i*i<<" ";
|
2024-08-23 13:44:31 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
cout<<endl;
|
|
|
|
}
|