ProjectEluer 70

最新推荐文章于 2019-08-07 14:59:00 发布

原创最新推荐文章于 2019-08-07 14:59:00 发布 · 845 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#string #permutation #pair #ini #struct #class

Algorithm Competition 专栏收录该内容

22 篇文章

订阅专栏

本文探讨了素数判断及欧拉函数的应用，并通过一个示例程序展示了如何寻找特定条件下最小比值的整数。涉及算法包括素数判断、欧拉函数计算等。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

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