#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; namespace { using Integer = long long; //__int128; template istream& operator >> (istream& is, pair& p){return is >> p.first >> p.second;} template istream& operator >> (istream& is, vector& vec){for(T& val: vec) is >> val; return is;} template istream& operator , (istream& is, T& val){ return is >> val;} template ostream& operator << (ostream& os, const pair& p){return os << p.first << " " << p.second;} template ostream& operator << (ostream& os, const vector& vec){for(size_t i=0; i ostream& operator , (ostream& os, const T& val){ return os << " " << val;} template void print(const H& head){ cout << head; } template void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); } template void println(const T& ... values){ print(values...); cout << endl; } template void eprint(const H& head){ cerr << head; } template void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); } template void eprintln(const T& ... values){ eprint(values...); cerr << endl; } class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } }; inline string operator "" _s (const char* str, size_t size){ return move(string(str)); } constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);} constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);} constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); } inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed mt19937 mt(chrono::duration_cast(chrono::steady_clock::now().time_since_epoch()).count()); template string join(const vector& v, const string& sep){ stringstream ss; for(size_t i=0; i0) ss << sep; ss << v[i]; } return ss.str(); } inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; } } constexpr long long mod = 9_ten + 7; #include using cc = complex; int main(){ long long a_,b_,c_; cin >> a_,b_,c_; cc a(a_, 0); cc b(b_, 0); cc c(c_, 0); auto f = [&](cc x){ return x*x*x + a*x*x + b*x + c; }; auto g = [&](cc x){ return cc(3.0,3.0)*x*x + cc(2.0,2.0)*a*x + b; }; auto start_time = chrono::steady_clock::now(); set ans; uniform_real_distribution dd(-1e9, 1e9); while(ans.size() < 3){ long double x = dd(mt) + dd(mt) + dd(mt) + dd(mt) + dd(mt) + dd(mt); long double y = dd(mt) + dd(mt) + dd(mt) + dd(mt) + dd(mt) + dd(mt); cc z(x,y); // if( ans.size() == 2 ){ // if( mt()&1 ){ // x = uniform_real_distribution(*ans.begin(), *ans.rbegin())(mt); // } // } for(int t=0; t<3000; t++){ cc z_ = z - f(z) / g(z); z = z_; } eprintln((double)z.real()); if( abs(round(z.real()) - z.real()) < 1e-4 ){ ans.insert( round(z.real()) ); } int tt = chrono::duration_cast(chrono::steady_clock::now() - start_time).count(); if( tt > 1900 ) break; } auto end_time = chrono::steady_clock::now(); eprintln( "elapsed time : ", chrono::duration_cast(end_time - start_time).count() , "[ms]"); vector unko(ans.begin(), ans.end()); println(unko); return 0; }