Advertisement
Ahmed_Negm

Untitled

Dec 3rd, 2022
543
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.30 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #include <ext/pb_ds/assoc_container.hpp>
  3. #include <ext/pb_ds/tree_policy.hpp>
  4. using namespace std;
  5. using namespace __gnu_pbds;
  6. #define ll long long
  7. #define OO 2'000'000'000
  8. #define ull unsigned long long
  9. #define nl '\n'
  10. #define sz(x) (ll)(x.size())
  11. #define all(x) x.begin(),x.end()
  12. #define rall(s)  s.rbegin(), s.rend()
  13. #define getline(s) getline(cin>>ws,s)
  14. #define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  15. #define pi  3.141592653589793
  16. #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
  17. #define multi_ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
  18.  
  19.  
  20. void Fast_IO(){
  21. ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  22. // freopen("filename.in", "r", stdin);
  23. // freopen("filename.txt", "w", stdout);
  24. #ifndef ONLINE_JUDGE
  25. freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  26. #endif
  27. }
  28.  
  29. int dx[] = { 2, 1, -1, -2, -2, -1, 1, 2 };
  30. int dy[] = { 1, 2, 2, 1, -1, -2, -2, -1 };
  31.  
  32.  
  33.  
  34. void solve(){
  35.   ll n; cin>>n;
  36.   for(int i=1;i<=2e6; i++){
  37.     n/= gcd(n,i);
  38.     if(n==1){
  39.       cout<<i<<nl;
  40.       return;
  41.     }
  42.   }
  43.   cout<<n<<nl;
  44.  
  45.  
  46.  
  47.  
  48. }
  49.  
  50. int main(){
  51.     Fast_IO();
  52. int t =1;
  53. //cin>>t;
  54. while(t--){
  55. solve();
  56. }
  57. return 0;
  58. }  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement