Submission #60519789


Source Code Expand

Copy
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define re register
#define il inline
#define pii pair<int,int>
#define x first
#define y second
#define gc getchar()
#define rd read()
#define debug() puts("------------")
namespace yzqwq{
il int read(){
int x=0,f=1;char ch=gc;
while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=gc;}
while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=gc;
return x*f;
}
il int qmi(int a,int b,int p){
int ans=1;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define re register
#define il inline
#define pii pair<int,int>
#define x first
#define y second
#define gc getchar()
#define rd read()
#define debug() puts("------------")

namespace yzqwq{
    il int read(){
        int x=0,f=1;char ch=gc;
        while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=gc;}
        while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=gc;
        return x*f;
    }
    il int qmi(int a,int b,int p){
        int ans=1;
        while(b){
            if(b&1) ans=ans*a%p;
            a=a*a%p,b>>=1;
        }
        return ans;
    }
    il auto max(auto a,auto b){return (a>b?a:b);}
    il auto min(auto a,auto b){return (a<b?a:b);}
    il int gcd(int a,int b){
        if(!b) return a;
        return gcd(b,a%b);
    }
    il int lcm(int a,int b){
        return a/gcd(a,b)*b;
    }
    il void exgcd(int a,int b,int &x,int &y){
        if(!b) return x=1,y=0,void(0);
        exgcd(b,a%b,x,y);
        int t=x;
        x=y,y=t-a/b*x;
        return ;
    }
    il int F(int n,int a,int b,int c){
        //sum{|_ (ai+b)/c _| i:0~n}
        if(!n) return b/c;
        if(!a) return (n+1)*(b/c);
        if(a>=c||b>=c){
            int x=a/b,y=b/c;
            return n*(n+1)/2*x+(n+1)*y+F(n,a%c,b%c,c);
        }
        int m=(a*n+b)/c;
        return n*m+F(m-1,c,c-b+1,a);
    }
    struct lb{
        int d[64];
        il void print(){
            for(re int i=0;i<63;++i)
            if(d[i]) printf("%lld:%lld\n",i,d[i]);
            return ;
        }
        lb(){memset(d,0,sizeof(d));}
        il void operator +=(int x){
            for(re int i=62;i>=0;--i){
                if(!(x&(1ll<<i))) continue;
                if(d[i]) x^=d[i];
                else return d[i]=x,void(0);
            }
            return ;
        }
        int& operator [](int x){
            return d[x];
        }
        il void operator +=(lb &x){
            for(re int i=62;i>=0;--i)
            if(x[i]) *this+=x[i];
            return ;
        }
        il friend lb operator +(lb &x,lb &y){
            lb z=x;
            for(re int i=62;i>=0;--i)
            if(y[i]) z+=y[i];
            return z;
        }
        il int Max_calc(){
            int ans=0;
            for(re int i=62;i>=0;--i)
            if((ans^d[i])>ans) ans^=d[i];
            return ans;
        }
    };
    mt19937 rnd(time(0));
}
using namespace yzqwq;

const int N=2e6+10;
int n,cnt;
int pri[N],Cnt;
bool vis[N];

il void init(){
	for(re int i=2;i<N;++i){
		if(vis[i]) continue;
		pri[++Cnt]=i;
		for(re int j=1;j*i<N;++j){
			vis[j*i]=1;
		}
	}
	return ;
}

il void solve(){
	n=rd,init();
	for(re int i=1;i<=Cnt;++i){
		int x=pri[i];
		int w=qmi(x,8,1000000000000000000);
		if(w>n) break;
//		cout<<x<<" ";
		++cnt;
	}
	for(re int i=1;i<=Cnt;++i){
		int x=pri[i]*pri[i];
		if(x>n) break;
		for(re int j=i+1;j<=Cnt;++j){
			int y=pri[j]*pri[j];
			if(y>n||x*pri[j]>n) break;
//			if(x==y) debug();
			if(x*y<=n) ++cnt;
			else break;
		}
	}cout<<cnt;
    return ;
}

signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
    int t=1;while(t--)
    solve();
    return 0;
}

Submission Info

Submission Time
Task D - 9 Divisors
User fzitb7912
Language C++ 20 (gcc 12.2)
Score 400
Code Size 3304 Byte
Status AC
Exec Time 12 ms
Memory 6844 KB

Compile Error

Main.cpp: In member function ‘void yzqwq::lb::print()’:
Main.cpp:58:24: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   58 |             for(re int i=0;i<63;++i)
      |                        ^
Main.cpp: In member function ‘void yzqwq::lb::operator+=(long long int)’:
Main.cpp:64:24: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   64 |             for(re int i=62;i>=0;--i){
      |                        ^
Main.cpp: In member function ‘void yzqwq::lb::operator+=(yzqwq::lb&)’:
Main.cpp:75:24: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   75 |             for(re int i=62;i>=0;--i)
      |                        ^
Main.cpp: In function ‘yzqwq::lb yzqwq::operator+(lb&, lb&)’:
Main.cpp:81:24: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   81 |             for(re int i=62;i>=0;--i)
      |                        ^
Main.cpp: In member function ‘long long int yzqwq::lb::Max_calc()’:
Main.cpp:87:24: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   87 |             for(re int i=62;i>=0;--i)
      |                        ^
Main.cpp: In function ‘void init()’:
Main.cpp:102:20: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
  102 |         for(re int i=2;i<N;++i){
      |                    ^
Main.cpp:105:28: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
  105 |                 for(re int j=1;j*i<N;++j){
      |                            ^
Main.cpp: In function ‘void solve()’:
Main.cpp:114:20: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
  114 |         for(re int i=1;i<=Cnt;++i){
      |                    ^
Main.cpp:121:20: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
  121 |         for(re int i=1;i<=Cnt;++i){
      |                    ^
Main.cpp:124:28: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
  124 |                 for(re int j=i+1;j<=Cnt;++j){
      |                            ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 34
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt
All 00_sample_01.txt, 00_sample_02.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt, 01_test_32.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 11 ms 6632 KB
00_sample_02.txt AC 11 ms 6636 KB
01_test_01.txt AC 11 ms 6648 KB
01_test_02.txt AC 11 ms 6696 KB
01_test_03.txt AC 11 ms 6700 KB
01_test_04.txt AC 11 ms 6712 KB
01_test_05.txt AC 11 ms 6780 KB
01_test_06.txt AC 11 ms 6712 KB
01_test_07.txt AC 11 ms 6664 KB
01_test_08.txt AC 11 ms 6664 KB
01_test_09.txt AC 11 ms 6656 KB
01_test_10.txt AC 11 ms 6712 KB
01_test_11.txt AC 11 ms 6632 KB
01_test_12.txt AC 11 ms 6656 KB
01_test_13.txt AC 11 ms 6588 KB
01_test_14.txt AC 11 ms 6780 KB
01_test_15.txt AC 11 ms 6792 KB
01_test_16.txt AC 11 ms 6680 KB
01_test_17.txt AC 11 ms 6844 KB
01_test_18.txt AC 11 ms 6656 KB
01_test_19.txt AC 12 ms 6844 KB
01_test_20.txt AC 11 ms 6660 KB
01_test_21.txt AC 11 ms 6788 KB
01_test_22.txt AC 11 ms 6784 KB
01_test_23.txt AC 11 ms 6592 KB
01_test_24.txt AC 11 ms 6660 KB
01_test_25.txt AC 12 ms 6676 KB
01_test_26.txt AC 11 ms 6652 KB
01_test_27.txt AC 11 ms 6664 KB
01_test_28.txt AC 11 ms 6668 KB
01_test_29.txt AC 11 ms 6696 KB
01_test_30.txt AC 11 ms 6720 KB
01_test_31.txt AC 11 ms 6764 KB
01_test_32.txt AC 12 ms 6712 KB


2025-03-05 (Wed)
18:09:58 +00:00