学步园

// BEGIN CUT HERE</p> <p>// END CUT HERE<br /> #include <vector><br /> #include <list><br /> #include <map><br /> #include <set><br /> #include <deque><br /> #include <queue><br /> #include <stack><br /> #include <bitset><br /> #include <algorithm><br /> #include <functional><br /> #include <numeric><br /> #include <utility><br /> #include <sstream><br /> #include <iostream><br /> #include <iomanip><br /> #include <cstdio><br /> #include <cmath><br /> #include <cstdlib><br /> #include <cctype><br /> #include <string><br /> #include <cstring><br /> #include <cstdio><br /> #include <cmath><br /> #include <cstdlib><br /> #include <ctime><br /> using namespace std;<br /> // BEGIN CUT HERE<br /> //Begin Sosi TopCoder<br /> //const double EPS=1e-11;<br /> //const double PI=acos(-1.0);<br /> //const short INF=32767,NF= -32768;<br /> //const int INF=2147483647,NF= -2147483648;<br /> //const long long INF=9223372036854775807,NF=-9223372036854775808;<br /> //const long double INF=99999999.99999999;</p> <p>//Numberic Functions</p> <p>//Translator<br /> //template<class T> string toString(T n){ostringstream ost;ost<<n;ost.flush();return ost.str();}<br /> //int toInt(string s){int r=0;istringstream sin(s);sin>>r;return r;}//NOTES:toInt(<br /> //long long toInt64(string s){long long r=0;istringstream sin(s);sin>>r;return r;}<br /> //double toDouble(string s){double r=0;istringstream sin(s);sin>>r;return r;}//NOTES:toDouble(<br /> //template<class T> void stoa(string s,int &n,T A[]){n=0;istringstream sin(s);for(T v;sin>>v;A[n++]=v);}<br /> //template<class T> void atos(int n,T A[],string &s){ostringstream sout;for(int i=0;i<n;i++){if(i>0)sout<<' ';sout<<A[i];}s=sout.str();}<br /> //template<class T> void atov(int n,T A[],vector<T> &vi){vi.clear();for (int i=0;i<n;i++) vi.push_back(A[i]);}<br /> //template<class T> void vtoa(vector<T> vi,int &n,T A[]){n=vi.size();for (int i=0;i<n;i++)A[i]=vi[i];}<br /> //template<class T> void stov(string s,vector<T> &vi){vi.clear();istringstream sin(s);for(T v;sin>>v;vi.push_bakc(v));}<br /> //template<class T> void vtos(vector<T> vi,string &s){ostringstream sout;for (int i=0;i<vi.size();i++){if(i>0)sout<<' ';sout<<vi[i];}s=sout.str();}</p> <p>//Fraction<br /> //template<class T> struct Fraction{T a,b;Fraction(T a=0,T b=1);string toString();};<br /> //template<class T> Fraction<T>::Fraction(T a,T b){T d=gcd(a,b);a/=d;b/=d;if (b<0) a=-a,b=-b;this->a=a;this->b=b;}<br /> //template<class T> string Fraction<T>::toString(){ostringstream sout;sout<<a<<"/"<<b;return sout.str();}<br /> //template<class T> Fraction<T> operator+(Fraction<T> p,Fraction<T> q){return Fraction<T>(p.a*q.b+q.a*p.b,p.b*q.b);}<br /> //template<class T> Fraction<T> operator-(Fraction<T> p,Fraction<T> q){return Fraction<T>(p.a*q.b-q.a*p.b,p.b*q.b);}<br /> //template<class T> Fraction<T> operator*(Fraction<T> p,Fraction<T> q){return Fraction<T>(p.a*q.a,p.b*q.b);}<br /> //template<class T> Fraction<T> operator/(Fraction<T> p,Fraction<T> q){return Fraction<T>(p.a*q.b,p.b*q.a);}</p> <p>//STL<br /> //bool comp(T A,T B){return A<B?1:0; }<br /> //do{ } while(next_permutation(T.begin(), T.end()));<br /> //End Sosi TopCoder<br /> // END CUT HERE<br /> template<class T> T gcd(T a,T b){ if(a<0) return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);}<br /> template <class T> T lcm(T a,T b){ return a*(b/gcd(a,b));}<br /> template<class T> inline vector<pair<T,int> > factorize(T n)<br /> {vector<pair<T,int> > R;for (T i=2;n>1;){if (n%i==0){int C=0;for (;n%i==0;C++,n/=i);R.push_back(make_pair(i,C));}<br /> i++;if (i>n/i) i=n;}if (n>1) R.push_back(make_pair(n,1));return R;}<br /> template<class T> inline bool isPrimeNumber(T n)<br /> {if(n<=1)return false;for (T i=2;i*i<=n;i++) if (n%i==0) return false;return true;}<br /> template<class T> inline T eularFunction(T n)<br /> {vector<pair<T,int> > R=factorize(n);T r=n;for (size_t i=0;i<R.size();i++)r=r/R[i].first*(R[i].first-1);return r;}</p> <p>bool judge(int a,int b)<br /> {<br /> vector<int > Ta;<br /> vector<int > Tb;<br /> while (a>0)<br /> {<br /> Ta.push_back(a%10);<br /> a/=10;<br /> }<br /> while(b>0)<br /> {<br /> Tb.push_back(b%10);<br /> b/=10;<br /> }<br /> sort(Ta.begin(),Ta.end());<br /> sort(Tb.begin(),Tb.end());<br /> if(Ta==Tb)<br /> return true;<br /> return false;<br /> }<br /> int main()<br /> {<br /> double min=10000;<br /> int flag;<br /> for(int i=2;i<10000000;i++)<br /> {<br /> int j=eularFunction(i);<br /> if(judge(i,j))<br /> {<br /> if(i*1.0/j<min)<br /> {<br /> min=i*1.0/j;<br /> flag=i;<br /> cout<<i<<endl;<br /> }<br /> }<br /> }<br /> cout<<flag<<endl;<br /> }

21
291
2817
2991
4435
20617
45421
69271
75841
162619
176569
284029
400399
474883
732031
778669
783169
1014109
1288663
1504051
1514419
1924891
1956103
2006737
2044501
2094901
2239261
2710627
2868469
3582907
3689251
4198273
4696009
5050429
5380657
5886817
6018163
6636841
7026037
7357291
7507321
8316907
8319823
8319823