fork download
  1. #include <iostream>
  2. #include <cmath>
  3. #include <vector>
  4. #include <string.h>
  5. #include <bits/stdc++.h>
  6. #include <cstdlib>
  7. #include <time.h>
  8. #include <fstream>
  9. #include <iterator>
  10. #include <utility>
  11. #include <algorithm>
  12. #include <set>
  13. #include <map>
  14. #include <bitset>
  15. using namespace std;
  16.  
  17. #define ll long long
  18. #define ld long double
  19. typedef vector<int> vi;
  20. typedef vector<ll> vll;
  21. typedef vector<bool> vb;
  22. #define all(v) ((v).begin()), ((v).end())
  23. #define sz(v) ((ll)((v).size()))
  24.  
  25. #define vinp(v, n) \
  26.   for (ll i = 0; i < (n); i++) \
  27.   cin >> (v)[i]
  28. #define printv(v) \
  29.   for (auto i : (v)) \
  30.   cout << i << " "
  31. #define Bustany \
  32.   ios::sync_with_stdio(0); \
  33.   cin.tie(0); \
  34.   cout.tie(0);
  35. #define fl0(i, n) for (int(i) = 0; (i) < (n); (i)++)
  36. #define fl1(i, n) for (int(i) = 1; (i) < (n); (i)++)
  37. #define _CRT_SECURE_NO_WARNING
  38. const ll MOD = 1000000007;
  39.  
  40. void solve()
  41. {
  42. ll n;
  43. cin >> n;
  44. vll dev;
  45.  
  46. for (ll i = 2; i*i <= n; i++)
  47. {
  48. while (n % i == 0)
  49. {
  50. dev.push_back(i);
  51. n /= i;
  52. }
  53. }
  54. if(n!=1){
  55. dev.push_back(n);
  56. }
  57. if(dev.size()<=1){
  58. cout << 1<<endl<<0;
  59. }
  60. else if(dev.size()==2){
  61. cout << 2;
  62. }
  63. else{
  64. cout << 1<<endl<<dev[0]*dev[1];
  65. }
  66. }
  67.  
  68. int main()
  69. {
  70. Bustany;
  71. int t = 1;
  72. // cin >> t;
  73. while (t--)
  74. {
  75. solve();
  76. }
  77. }
Success #stdin #stdout 0s 5300KB
stdin
Standard input is empty
stdout
1
4