fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define int             long long int
  5. #define ld              long double
  6. #define ff              first
  7. #define ss              second
  8. #define mp              make_pair
  9. #define pb              push_back
  10. #define si              set <int>
  11. #define vi              vector <int>
  12. #define pii             pair <int, int>
  13. #define vpii            vector <pii>
  14. #define vpp             vector <pair<int, pii>>
  15. #define mii             map <int, int>
  16. #define mpi             map <pii, int>
  17. #define msi             map < string, int >
  18. #define loop(i,s,e)     for(int i=s;i<e;i++)
  19. #define rloop(i,e,s)    for(int i=e;i>=s;i--)
  20. #define mset(a,f)       memset(a,f,sizeof(a))
  21. #define spi             set <pii>
  22. #define endl            "\n"
  23. #define M               1000000007
  24. #define sz(x)           ((int) x.size())
  25. #define all(p)          p.begin(), p.end()
  26. #define que_max         priority_queue <int>
  27. #define que_min         priority_queue <int, vi, greater<int>>
  28. #define bug(...)        __f (#__VA_ARGS__, __VA_ARGS__)
  29. #define print(a)        for (auto x : a) cout << x << " "; cout << endl
  30. #define Print(a,x,y)    for (int i=x; i<y; i++) cout<< a[i]<< " "; cout << endl
  31.  
  32. inline int power(int a, int b)
  33. {
  34. 	int x = 1;
  35. 	while (b)
  36. 	{
  37. 		if (b & 1) x *= a;
  38. 		a *= a;
  39. 		b >>= 1;
  40. 	}
  41. 	return x;
  42. }
  43.  
  44. template <typename Arg1>
  45. void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
  46. template <typename Arg1, typename... Args>
  47. void __f (const char* names, Arg1&& arg1, Args&&... args)
  48. {
  49. 	const char* comma = strchr (names + 1, ',');
  50. 	cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
  51. }
  52.  
  53. const int N = 200005;
  54. int arr[N];
  55.  
  56. void solve()
  57. {
  58. 	int n;
  59. 	cin >> n;
  60. 	//int mx;
  61. 	//bug(n);
  62. 	int ans = INT_MAX;
  63. 	for (int i = 2; i * i <= n; i++)
  64. 	{
  65. 		//bug(i);
  66.  
  67. 		if (n % i == 0)
  68. 		{
  69. 			int x = i;
  70. 			int y = n / i;
  71.  
  72. 			int mx = max(x, y);
  73.  
  74. 			ans = min(ans, mx);
  75. 		}
  76. 	}
  77. 	cout << ans << " " << n / ans;
  78. 	return;
  79. }
  80.  
  81. int32_t main()
  82. {
  83. 	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  84.  
  85. #ifndef ONLINE_JUDGE
  86. 	freopen("input.txt",  "r",  stdin);
  87. 	freopen("output.txt", "w", stdout);
  88. #endif
  89.  
  90. 	//cout << setprecision(9) << fixed;
  91. 	clock_t z = clock();
  92. 	int t = 1;
  93. 	//cin >> t;
  94. 	while (t--)
  95. 	{
  96. 		solve();
  97. 	}
  98. 	cerr << "Total Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);
  99.  
  100. 	return 0;
  101. }
Success #stdin #stdout #stderr 0s 4340KB
comments (?)
stdin
copy 
2
stdout
copy 
2147483647 0
stderr
copy 
Total Time : 2.8e-05
https://ideone.com/q6XaTK
language:
C++14 (gcc 8.3)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!