結果
問題 |
No.1653 Squarefree
|
ユーザー |
![]() |
提出日時 | 2021-12-02 16:02:14 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,678 bytes |
コンパイル時間 | 2,046 ms |
コンパイル使用メモリ | 199,480 KB |
最終ジャッジ日時 | 2025-01-26 02:50:41 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 13 WA * 25 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:64:17: warning: ‘S’ may be used uninitialized [-Wmaybe-uninitialized] 64 | for(ll t=S;t<=T;t++)if(L<=t and t<R and t!=1) ban.insert(t*t); | ~^~~ main.cpp:46:8: note: ‘S’ was declared here 46 | ll S; | ^ main.cpp:64:17: warning: ‘T’ may be used uninitialized [-Wmaybe-uninitialized] 64 | for(ll t=S;t<=T;t++)if(L<=t and t<R and t!=1) ban.insert(t*t); | ~^~~ main.cpp:55:8: note: ‘T’ was declared here 55 | ll T; | ^
ソースコード
#include"bits/stdc++.h" using namespace std; #define ALL(x) begin(x),end(x) #define rep(i,n) for(int i=0;i<(n);i++) #define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl; #define mod 1000000007 using ll=long long; const int INF=1000000000; const ll LINF=1001002003004005006ll; int dx[]={1,0,-1,0},dy[]={0,1,0,-1}; // ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;} template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;} struct IOSetup{ IOSetup(){ cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(12); } } iosetup; template<typename T> ostream &operator<<(ostream &os,const vector<T>&v){ for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" "); return os; } template<typename T> istream &operator>>(istream &is,vector<T>&v){ for(T &x:v)is>>x; return is; } signed main(){ ll L,R;cin>>L>>R;R++; ll W=R-L; set<ll> ban; for(ll i=2;i*i<=W+1029418;i++){ ll p=i*i; ll st=((p+L-1)/p)*p; for(ll t=st;t<R;t+=p) ban.insert(t); } ll S; { ll lw=1,hi=1000000000; while(lw<=hi){ ll mid=(lw+hi)/2; if(L<=mid*mid) S=mid,hi=mid-1; else lw=mid+1; } } ll T; { ll lw=1,hi=1000000000; while(lw<=hi){ ll mid=(lw+hi)/2; if(mid*mid<=R) T=mid,lw=mid+1; else hi=mid-1; } } for(ll t=S;t<=T;t++)if(L<=t and t<R and t!=1) ban.insert(t*t); cout<<W-(ll)ban.size()<<endl; return 0; }