結果

問題 No.1653 Squarefree
ユーザー n_vipn_vip
提出日時 2021-08-20 22:39:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 278 ms / 2,000 ms
コード長 6,111 bytes
コンパイル時間 2,209 ms
コンパイル使用メモリ 140,700 KB
実行使用メモリ 19,800 KB
最終ジャッジ日時 2023-08-04 11:31:02
合計ジャッジ時間 10,971 ms
ジャッジサーバーID
(参考情報)
judge15 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 262 ms
19,472 KB
testcase_01 AC 14 ms
7,884 KB
testcase_02 AC 15 ms
7,836 KB
testcase_03 AC 15 ms
8,052 KB
testcase_04 AC 15 ms
7,824 KB
testcase_05 AC 15 ms
7,932 KB
testcase_06 AC 15 ms
8,096 KB
testcase_07 AC 14 ms
8,052 KB
testcase_08 AC 15 ms
8,048 KB
testcase_09 AC 15 ms
7,988 KB
testcase_10 AC 15 ms
7,824 KB
testcase_11 AC 200 ms
19,600 KB
testcase_12 AC 181 ms
19,648 KB
testcase_13 AC 267 ms
19,756 KB
testcase_14 AC 264 ms
19,480 KB
testcase_15 AC 278 ms
19,596 KB
testcase_16 AC 239 ms
19,584 KB
testcase_17 AC 252 ms
19,624 KB
testcase_18 AC 246 ms
19,576 KB
testcase_19 AC 268 ms
19,752 KB
testcase_20 AC 260 ms
19,472 KB
testcase_21 AC 260 ms
19,468 KB
testcase_22 AC 248 ms
19,660 KB
testcase_23 AC 263 ms
19,476 KB
testcase_24 AC 249 ms
19,580 KB
testcase_25 AC 278 ms
19,800 KB
testcase_26 AC 249 ms
19,540 KB
testcase_27 AC 261 ms
19,472 KB
testcase_28 AC 247 ms
19,756 KB
testcase_29 AC 241 ms
19,544 KB
testcase_30 AC 249 ms
19,668 KB
testcase_31 AC 244 ms
19,668 KB
testcase_32 AC 257 ms
19,616 KB
testcase_33 AC 240 ms
19,660 KB
testcase_34 AC 248 ms
19,464 KB
testcase_35 AC 260 ms
19,460 KB
testcase_36 AC 14 ms
7,836 KB
testcase_37 AC 15 ms
7,884 KB
testcase_38 AC 15 ms
8,028 KB
testcase_39 AC 14 ms
8,024 KB
testcase_40 AC 14 ms
8,088 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))
#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))
#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto

using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}
template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}
template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}
template<class T=ll> T read(){ T re; cin>>re; return re;}
template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return re;}
template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return re;}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return g;}
vv<int> readG(const int &n){ return readG(n,n-1);}
vv<int> readD(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); } return g;}
vv<int> readD(const int &n){ return readD(n,n-1);}
template<class T> vv<pair<int,T>> readG(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); g[b].eb(a,c);} return g;}
template<class T> vv<pair<int,T>> readG(const int &n){ return readG<T>(n,n-1);}
template<class T> vv<pair<int,T>> readD(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); } return g;}
template<class T> vv<pair<int,T>> readD(const int &n){ return readD<T>(n,n-1);}
#ifdef __cpp_init_captures
template<typename T> vector<T> readT(int n, T v){ return readV(n,v);}
template <class... Args> auto readT(int n, Args... args){ vector re(1,readT(args...));rep(_,n-1) re.eb(readT(args...));	return re;}
template<typename T, size_t... Is> void addadd(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) += get<Is>(t2), 0)... }; (void)l;}
template <typename...T>tuple<T...>& operator += (tuple<T...>& lhs, const tuple<T...>& rhs){	addadd(lhs, rhs, index_sequence_for<T...>{});	return lhs;}
template <typename...T>tuple<T...> operator +(tuple<T...> lhs, const tuple<T...>& rhs){ return lhs += rhs;}
template<typename T, size_t... Is> void subsub(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) -= get<Is>(t2), 0)... }; (void)l;}
template <typename...T>tuple<T...>& operator -= (tuple<T...>& lhs, const tuple<T...>& rhs){	subsub(lhs, rhs, index_sequence_for<T...>{});	return lhs;}
template <typename...T>tuple<T...> operator - (tuple<T...> lhs, const tuple<T...>& rhs){ return lhs -= rhs;}
template<class Tuple, size_t... Is> void read_tuple_impl(istream &is, Tuple& t, index_sequence<Is...>){((is >> get<Is>(t)), ...);}
template<class... Args> auto& operator>>(istream &is, tuple<Args...>& t){ read_tuple_impl(is, t, index_sequence_for<Args...>{}); return is;}
#endif
#define TT cauto TTT=read();rep(_,TTT)
const ll MOD=1e9+7; //998244353;

vector<int> primes,prime;
vv<pii> facts;
class PRPRPR{
public:
  PRPRPR(int PRIME_MAX){
    prime.resize(PRIME_MAX);
    for(int i=2;i<PRIME_MAX;i++)if(!prime[i]){
				primes.pb(i);
				for(int j=i*2;j<PRIME_MAX;j+=i)
					prime[j]=1;
      }
		// fact();
  }
	void fact(){
		facts.resize(prime.size());
		for(cauto &p:primes){
			for(ll i=p;i<(int)facts.size();i+=p) facts[i].eb(p,1);
			for(ll pp=1ll*p*p;pp<(int)facts.size();pp*=p){
				for(ll i=pp;i<facts.size();i+=pp)	++facts[i].back().Y;
			}
		}
	}
} prprprpr(1123456);

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cout<<fixed<<setprecision(0);
	cauto l=read();
	cauto r=read()+1;
	vector<ll> vs(r-l); iota(all(vs),l);
	vector<int> ok(r-l,1);
	for(cauto &p:primes)for(ll i=(l+p-1)/p*p;i<r;i+=p){
			if(vs[i-l]/p%p==0) ok[i-l]=0;
			while(vs[i-l]%p==0) vs[i-l]/=p;
		}
	rep(i,r-l)if(ok[i]){
		cauto rem=vs[i];
		if(rem==1) continue;
		ll l=1,r=MOD;
		while(r-l>1){
			cauto m=(l+r)/2;
			(m*m<rem?l:r)=m;
		}
		if(r*r==rem) ok[i]=0;
	}
	out(vs,ok,1);
	cout<<accumulate(all(ok),0) NL;
	return 0;
}
0