fork download
copy 
  1. //#pragma GCC optimize("O3", "unroll-loops")
  2. //#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
  3.  
  4. #include <bits/stdc++.h>
  5. #define ldb long double
  6. //#define double ldb
  7. #define db double
  8. #define unomap unordered_map
  9. #define unoset unordered_set
  10. #define endl '\n'
  11. #define str string
  12. #define strstr stringstream
  13. #define sz(a) (int)a.size()
  14. #define ll long long
  15. //#define int ll
  16. #define pii pair <int, int>
  17. #define pll pair <ll, ll>
  18. #define Unique(a) a.resize(unique(all(a)) - a.begin())
  19. #define ull unsigned ll
  20. #define fir first
  21. #define sec second
  22. #define idc cin.ignore()
  23. #define lb lower_bound
  24. #define ub upper_bound
  25. #define all(s) s.begin(), s.end()
  26. #define rev reverse
  27. #define gcd __gcd
  28. #define pushb push_back
  29. #define popb pop_back
  30. #define pushf push_front
  31. #define popf pop_front
  32. #define mul2x(a, x) a << x
  33. #define div2x(a, x) a >> x
  34. #define lcm(a, b) (a / __gcd(a, b) * b)
  35. #define log_base(x, base) log(x) / log(base)
  36. #define debug cerr << "No errors!"; exit(0);
  37. #define forw(i, a, b) for (int i = a; i <= b; ++i)
  38. #define forw2(i, a, b) for (ll i = a; i <= b; ++i)
  39. #define fors(i, a, b) for (int i = a; i >= b; --i)
  40. #define fors2(i, a, b) for (ll i = a; i >= b; --i)
  41. #define pqueue priority_queue
  42. #define sqrt sqrtl
  43. #define i128 __int128
  44. #define popcount __builtin_popcountll
  45. #define BIT(x, i) (((x) >> (i)) & 1)
  46. #define MASK(x) ((1LL) << (x))
  47. #define want_digit(x) cout << fixed << setprecision(x);
  48. #define excuting_time 1000.0 * clock() / CLOCKS_PER_SEC
  49. #define mapa make_pair
  50. using namespace std;
  51. const int MOD = 1e9 + 7; // 998244353
  52. const int inf = 1e9;
  53. const ll INF = 1e18;
  54. const int N = 15;
  55.  
  56. mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  57. ll random(const ll &L, const ll &R) {
  58.     return uniform_int_distribution<ll> (L, R) (rng);
  59. }
  60.  
  61. const int LIM = 48;
  62. vector <int> prime;
  63. bool is_prime[LIM + 5];
  64. void sieve() {
  65.     is_prime[0] = is_prime[1] = 1;
  66.     for (int i = 2; i * i <= LIM; ++i) if (!is_prime[i])
  67.         for (int j = i * i; j <= LIM; j += i) is_prime[j] = 1;
  68.  
  69.     forw (i, 2, LIM) if (!is_prime[i])
  70.         prime.pushb(i);
  71. }
  72.  
  73. ll n, res[N + 5];
  74.  
  75. void build() {
  76.     res[0] = 1;
  77.     forw (i, 1, 15) {
  78.         res[i] = res[i - 1] * prime[i - 1];
  79.     }
  80. }
  81.  
  82. void solve() {
  83.     cin >> n;
  84.     int pos = ub(res + 1, res + N + 1, n) - res - 1;
  85.     cout << pos << endl;
  86. }
  87.  
  88. signed main() {
  89.     ios::sync_with_stdio(false), cin.tie(nullptr);
  90.     srand(time(NULL));
  91.     #define name "test"
  92.     /*
  93.     if (fopen(name".INP", "r")) {
  94.         freopen(name".INP", "r", stdin);
  95.         freopen(name".OUT", "w", stdout);
  96.     }
  97.     */
  98.     sieve();
  99.     build();
  100.     bool testCase = false;
  101.     int numTest = 1;
  102.     cin >> numTest;
  103.     forw (i, 1, numTest) {
  104.         if (testCase) cout << "Case " << i << ": ";
  105.         solve();
  106.     }
  107.     return 0;
  108. }
  109.  
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
6
1
2
3
500
5000
10000000000
stdout
copy 
0
1
1
4
5
10
https://ideone.com/wxlcpZ
language:
C++14 (gcc 8.3)
created:
5 days 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!