結果
問題 | No.1063 ルートの計算 / Sqrt Calculation |
ユーザー | Laika |
提出日時 | 2020-05-30 00:25:50 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,646 bytes |
コンパイル時間 | 2,211 ms |
コンパイル使用メモリ | 210,024 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-06 09:49:02 |
合計ジャッジ時間 | 2,887 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | AC | 2 ms
6,820 KB |
testcase_05 | AC | 2 ms
6,816 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 2 ms
6,816 KB |
testcase_08 | AC | 2 ms
6,820 KB |
testcase_09 | AC | 2 ms
6,816 KB |
testcase_10 | AC | 2 ms
6,820 KB |
testcase_11 | AC | 2 ms
6,820 KB |
testcase_12 | AC | 2 ms
6,820 KB |
testcase_13 | AC | 2 ms
6,820 KB |
testcase_14 | AC | 2 ms
6,816 KB |
testcase_15 | AC | 2 ms
6,816 KB |
testcase_16 | AC | 2 ms
6,816 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i=0;i<static_cast<int>(n);++i)#define per(i, n) for(int i=static_cast<int>(n)-1;i>=0;--i)#define eee(a) (cerr<<"[@"<<__LINE__<<"] "<<(#a)<<": "<<(a)<<'\n');#define ppp(a) (cout<<(a)<<'\n');#define cop(a) for(auto x:(a)){cerr<<(x)<<'\n';}using ll = long long;constexpr int dx[4]={1,0,-1,0};constexpr int dy[4]={0,1,0,-1};constexpr ll MOD = 1e9+7;constexpr ll Mod = 998244353;constexpr int INF = 1e9;constexpr ll LINF = 1e18;constexpr double phi = (1+sqrt(5))/2;constexpr double pi = 3.14159265358979323846264338327950288;inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}inline ll inverse(ll n,ll m=MOD){ll a=n,b=m,x=1,y=0;while(b){ll t=a/b;a-=t*b;swap(a,b);x-=t*y;swap(x,y);}return (a%m+m)%m;}inline void Yes(){puts("Yes");}inline void No(){puts("No");}inline void Judge(bool b){b?Yes():No();}inline void YES(){puts("YES");}inline void NO(){puts("NO");}inline void JUDGE(bool b){b?YES():NO();}inline ll powmod(ll b, ll e, ll m=MOD){ll r=1;while(e>0){if(e&1)r=(r%m)*(b%m)%m;b=(b%m)*(b%m)%m;e>>=1;}return r;}inline double distance(ll x1, ll y1, ll x2, ll y2){return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}inline double d2r(double d){return d*pi/180;}inline double r2d(double r){return r*180/pi;}template<class T>inline bool chmax(T &a, const T &b){if(a<b){a=b;return 1;}return 0;}template<class T>inline bool chmin(T &a, const T &b){if(b<a){a=b;return 1;}return 0;}template<typename T>inline int bs(int g,int k,T c){while(abs(k-g)>1){int m=(g+k)/2;(c(m)?k:g)=m;}return k;}template<typename T1,typename T2>ostream& operator<<(ostream& s,const pair<T1, T2>& p){return s <<"("<<p.first<<", "<<p.second<<")";}template<typename T> ostream& operator<<(ostream& s,const vector<T>& v){s<<'[';for(size_t i=0;i<v.size();++i){s<<v[i];if(i<v.size()-1)s<<", ";}s<<']';return s;}template<typename T> istream& operator>>(istream& s,vector<T>& v){for(T& x:v)s>>x;return s;}template<typename T>map<T, T> factorization(T n){map<T, T> factor;while (n % 2 == 0){++factor[2];n /= 2;}for (T i = 3; i*i <= n; i += 2){while (n%i == 0){++factor[i];n /= i;}}if (n > 2)++factor[n];return factor;}int main(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(15);ll n; cin >> n;ll a = 1, b = 1;for(auto [x, y] : factorization(n)){if(y/2 > 0)a *= pow(x, y/2);if(y%2)b *= x;}cout << a << ' ' << b << '\n';return 0;}