結果

問題 No.1653 Squarefree
ユーザー snukesnuke
提出日時 2021-08-21 19:41:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 281 ms / 2,000 ms
コード長 3,995 bytes
コンパイル時間 2,594 ms
コンパイル使用メモリ 216,820 KB
実行使用メモリ 19,344 KB
最終ジャッジ日時 2024-10-15 10:19:29
合計ジャッジ時間 10,750 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 281 ms
19,208 KB
testcase_01 AC 13 ms
7,560 KB
testcase_02 AC 13 ms
7,568 KB
testcase_03 AC 13 ms
7,564 KB
testcase_04 AC 11 ms
7,564 KB
testcase_05 AC 12 ms
7,680 KB
testcase_06 AC 13 ms
7,692 KB
testcase_07 AC 13 ms
7,568 KB
testcase_08 AC 13 ms
7,564 KB
testcase_09 AC 12 ms
7,568 KB
testcase_10 AC 13 ms
7,680 KB
testcase_11 AC 148 ms
19,208 KB
testcase_12 AC 152 ms
19,208 KB
testcase_13 AC 276 ms
19,208 KB
testcase_14 AC 278 ms
19,216 KB
testcase_15 AC 275 ms
19,340 KB
testcase_16 AC 265 ms
19,336 KB
testcase_17 AC 272 ms
19,312 KB
testcase_18 AC 273 ms
19,212 KB
testcase_19 AC 281 ms
19,216 KB
testcase_20 AC 280 ms
19,212 KB
testcase_21 AC 276 ms
19,208 KB
testcase_22 AC 272 ms
19,216 KB
testcase_23 AC 275 ms
19,216 KB
testcase_24 AC 281 ms
19,148 KB
testcase_25 AC 273 ms
19,344 KB
testcase_26 AC 272 ms
19,212 KB
testcase_27 AC 271 ms
19,216 KB
testcase_28 AC 269 ms
19,120 KB
testcase_29 AC 267 ms
19,212 KB
testcase_30 AC 271 ms
19,208 KB
testcase_31 AC 271 ms
19,336 KB
testcase_32 AC 278 ms
19,332 KB
testcase_33 AC 276 ms
19,212 KB
testcase_34 AC 266 ms
19,212 KB
testcase_35 AC 271 ms
19,216 KB
testcase_36 AC 12 ms
7,564 KB
testcase_37 AC 13 ms
7,564 KB
testcase_38 AC 12 ms
7,688 KB
testcase_39 AC 12 ms
7,568 KB
testcase_40 AC 12 ms
7,564 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define dsrep(i,t,s) for(int i = (t)-1; i >= (s); --i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define bn(x) ((1<<(x))-1)
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T> >;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using P = pair<int,int>;
using T3 = tuple<int,int,int>;
using vi = vc<int>;
using vvi = vv<int>;
using vl = vc<ll>;
using vp = vc<P>;
using vt = vc<T3>;
int getInt(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
vc<string> split(const string& s,char d=' '){vc<string> r(1);for(char c:s)if(c==d)r.pb("");else r.back()+=c;return r;}
string operator*(const string& s,int t){return join(vc<string>(t,s));}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 1000005;
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}

// floor(sqrt(a))
ll floorSqrt(ll a) {
  ll b = a, x = 0, y = 0;
  for (int e = (63 - __builtin_clzll(a)) & ~1; e >= 0; e -= 2) {
    x <<= 1; y <<= 1;
    if (b >= (y | 1) << e) { b -= (y | 1) << e; x |= 1; y += 2;}
  }
  return x;
}
// linear sieve
vi ps, pf;
void sieve(int mx) {
  pf = vi(mx+1);
  rep(i,mx+1) pf[i] = i;
  for (int i = 2; i <= mx; ++i) {
    if (pf[i] == i) ps.pb(i);
    for (int j = 0; j < sz(ps) && ps[j] <= pf[i]; ++j) {
      int x = ps[j]*i;
      if (x > mx) break;
      pf[x] = ps[j];
    }
  }
}
inline bool isp(int x) { return pf[x] == x && x >= 2;}
vp factor(int x) { // asc
  if (x == 1) return {};
  vp res(1, P(pf[x], 0));
  while (x != 1) {
    if (res.back().fi == pf[x]) res.back().se++;
    else res.pb(P(pf[x],1));
    x /= pf[x];
  }
  return res;
}
//

struct Solver {
  void solve() {
    sieve(MX);
    ll l, r;
    cin>>l>>r;
    ++r;
    int n = r-l;
    vl x(n);
    rep(i,n) x[i] = l+i;
    vi ok(n,1);
    for (int p : ps) {
      for (int j = dup(l,p)*p-l; j < n; j += p) {
        int cnt = 0;
        while (x[j]%p == 0) x[j] /= p, ++cnt;
        if (cnt >= 2) ok[j] = 0;
      }
    }
    rep(i,n) {
      if (x[i] == 1) continue;
      ll s = floorSqrt(x[i]);
      if (s*s == x[i]) ok[i] = 0;
    }
    int ans = suma(ok);
    cout<<ans<<endl;
  }
};

int main() {
  int ts = 1;
  // scanf("%d",&ts);
  rrep(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0