-
Notifications
You must be signed in to change notification settings - Fork 2
/
1285C.cpp
151 lines (135 loc) · 6.15 KB
/
1285C.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
// @Author: Mars_Coder
// @date: 07-Sep-23 10:48:12 AM +06
// https://codeforces.com/problemset/problem/1285/C
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
using lli = long long int;
using uInt = unsigned int;
using ulli = unsigned long long int;
using vi = vector<int>;
using vii = vector<lli>;
using vc = vector<char>;
using udouble = long double;
using vd = vector<double>;
using vs = vector<string>;
template<typename T> using vv = vector<vector<T>>;
template<typename T> using pq = priority_queue<T>; // high prec., pq<T> p;
template<typename T> using pq_ = priority_queue<T, vector<T>, greater<T>>; // dec. as: pq_<T> x;
template<typename T1, typename T2> using vp = vector<pair<T1, T2>>; // vp<T1, T2> ..
#define ln "\n" // no flush, oppos of endl
#define _flush endl
#define stop_sync ios::sync_with_stdio(false) // not to use c-style io
#define untie_ios cin.tie(nullptr) // no flush
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define Fi(p) get<0>(p)
#define Sc(p) get<1>(p)
#define sz(x) int ((x).size())
#define All(x) (x).begin(), (x).end()
#define scanv(x) for(auto &i: x) cin >> i
#define bin_sc(a, x) binary_search(All(a), x) // 0/1
#define lbd(a, x) lower_bound(All(a), x) // an iter.
#define ubd(a, x) upper_bound(All(a), x) // an iter.
#define eq_seg(a, x) equal_range(All(a), x) // a pair of lb, ub
#define minE(a) (*min_element(All(a)))
#define maxE(a) (*max_element(All(a)))
#define FIXED(x) cout << fixed << setprecision(x)
#define mem(a, v) memset(a, v, sizeof a) // 0,-1 for int, and all char
#define filla(a, n, v) fill(a, a + n, v) // for arr.
#define fillv(a, v) fill(All(a), v) // for vec.
#define _fillv(a, n, v) fill_n(a.begin(), n, v)
#define glue(x, y) x##y
#define msg(x) cout << (#x) << ln
#define bug(x) cout << (#x) << ": " << (x) << ln
#define printv(v) for(auto i: v) cout << i << ' '; cout << ln
#define printvv(v) for(auto i: v) {for(auto j: i) cout << j << ' '; cout << ln;}
#define printm(m) for(auto i: m) cout << Fi(i) << " -> " << Sc(i) << ln
#define prints(s) for(auto i: s) cout << i << ' '; cout << ln
#define uceil(a, b) ((a + b - 1) / (b))
#define unq_v(a) a.resize(distance(a.begin(), unique(All(a)))) // for same valued consec. grp
#define mk_upper(s) transform(s.begin(), s.end(), s.begin(), ::toupper)
#define mk_lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
#define valid(nx, ny) (nx >= 1 && nx <= row && ny >= 1 && ny <= col)
#define dbug(args...) {string s = #args;replace(All(s), ',', ' '); stringstream s2; s2 << s; vs ss;\
while(s2){string now; s2 >> now; ss.pb(now);} debug(ss, args);} // string sucks :(, don't know why!
vector<int> dx = {1,-1,0,0,1,-1,-1,1}; // (4 ed. + 4 dia.)
vector<int> dy = {0,0,1,-1,1,1,-1,-1}; // first four are ed.
const string yms[]{"YES", "Yes", "yes"};
const string nms[]{"NO", "No", "no"};
const double PI = acos(-1.0L);
struct{const int i = (1e9) + 7; const lli l = (lli)(1e9) + 7ll;}MOD;
struct{const int i = INT_MAX; const lli l = LLONG_MAX;}inf;
bool isUp(char ch){locale loc; return isupper(ch, loc);}
void debug(vs s) {cout << "#------------------#\n";}
int ffs(int x){return __builtin_ffs(x);} // 1 based idx from right of one
int ffs(lli x){return __builtin_ffsll(x);}
int clz(uInt x){return __builtin_clz(x);} // leading zeros from left ....
int clz(ulli x){return __builtin_clzll(x);}
int ctz(uInt x){return __builtin_ctz(x);} // trailing zeros from right ....
int ctz(ulli x){return __builtin_ctzll(x);}
int cto(uInt x){return __builtin_popcount(x);} // no of 1 bit
int cto(ulli x){return __builtin_popcountll(x);}
int parity(uInt x){return __builtin_parity(x);} // cto % 2
int parity(ulli x){return __builtin_parityll(x);}
auto pow2(uInt x){return (1u) << x;} /* returning unsigned */
auto pow2(ulli x){return (1ull) << x;} // x <= 63
lli binpow(lli a, lli b){lli ans = 1ll; while(b > 0){if(b & 1) ans *= a; a *= a; b >>= 1;} return ans;}
lli binpow(lli a, lli b, lli m){a %= m; lli ans = 1ll; while(b > 0){if(b & 1) ans = ans * a % m; a = a * a % m; b >>= 1;} return ans;}
lli NcR(lli n, lli r){lli x = 1ll, y = 1ll;if(n - r < r) r = n - r; while(r){x *= n;y *= r;
lli cm = __gcd(x, y);x /= cm;y /= cm;--n;--r;}return x;}
lli NpR(lli n, lli r){lli x = 1ll;while(r){x *= n; --n;--r;}return x;}
template<typename type> type Nsum(type n){return (n * (n + 1)) / (type)2;}
template<typename type> type Round(type a, type b) {if(a < b) return 1; if(a % b) return 1 + a / b; return a / b;}
template<typename T, typename... param> void debug(vs ss, T a, param... args){
cout << ss.front() << " = " << a << '\n'; ss.erase(ss.begin()); debug(ss, args...);
}
// array<T, n> a = {}
lli lcm(lli x, lli y){
return (x * y) / gcd(x, y);
}
int main(void){
stop_sync;
untie_ios;
#ifndef ONLINE_JUDGE
//freopen("generator.txt", "r", stdin);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
int t(1), tcase(0);
//cin >> t;
while(++tcase, t--){
//cout << "--------Case #" << tcase << ": --------\n";
lli n;
cin >> n;
lli ans = inf.l;
for(lli i = 1; i * i <= n; ++i){
if(n % i == 0){
if(lcm(i, n / i) == n && max(i, n / i) < ans) ans = max(i, n / i);
}
}
cout << n / ans << ' ' << ans << ln;
}
return 0;
}
/*
some familiar issues & sugg.:
!----> [RE-READ THE CODE!]
!----> [invariants to array?]
!----> [kinda back-tracking?]
!----> [use clear() at last if resize() used!]
!----> [look at global variables and their values]
!----> [llabs() for long long int type]
!----> [look at input size and time limit]
!----> [No sync with puts fn]
!----> [prefix vs suffix]
!----> [binary search? -> ubd, lbd]
!----> [array contains duplicate values!]
!----> [(a/b+1)*b vs uceil(a,b)*b]
!----> [unq_v for vec only]
!----> [bitmask vs unsigned; (1ull << i) -> pow2]
!----> [use gcd(), NOT __gcd() for ai < 0]
!----> [rec. lambda: function<ret.type(param types,..)>fn_name = ....lambda fn && always dyn arr(vec, ..]
*/