提出 #41049262

---

ソースコード 拡げる

//This code is written by hmz,and hmz is cute!!!
#include<bits/stdc++.h>
using namespace std;
#define TY long long
#define umap unordered_map
#define ull unsigned long long
#define pq priority_queue
#define mp make_pair
#define mod (TY)(1e9+7)
#define MAXN 50000005
#define MAXM 200005
#define MAXK 27
#define INF (TY)1e9
#define Birthday 20090321
#define Read(name) freopen(#name,"r",stdin);
#define Write(name) freopen(#name,"w",stdout);
#define For(i,a,b) for(TY i=(a);i<=(b);++i)
#define FOR(i,a,b) for(TY i=(a);i<(b);++i)
#define Rof(i,a,b) for(TY i=(a);i>=(b);--i)
#define ROF(i,a,b) for(TY i=(a);i>(b);--i)
inline TY qr(){
	TY x=0,f=1;char op=getchar();
	for(;op<'0'||op>'9';op=getchar())if(op=='-')f=-1;
	for(;op>='0'&&op<='9';op=getchar())x=x*10+(op^48);
	return x*f;
}inline bool ischar(char op){
	if(op>='a'&&op<='z')return true;
	if(op>='A'&&op<='Z')return true;
	return false;
}inline char getc(){
	char op=getchar();
	while(!ischar(op))op=getchar();
	return op;
}inline string qs(){
	string op="";char u=getchar();
	while(!ischar(u))u=getchar();
	while(ischar(u))op+=u,u=getchar();
	return op;
}inline void qw(TY x){
	if(!x){putchar('0');return;}
	if(x<0)putchar('-'),x=-x;
	if(x>=10)qw(x/10);putchar(x%10+'0');
}inline void qw(TY x,char op){qw(x),putchar(op);}
inline void ws(string s){FOR(i,0,s.size())putchar(s[i]);}
inline TY Ceil(TY a,TY b){return a/b+(a%b!=0);}
inline TY Mod(TY a){return (a>=mod?a-mod:a);}
inline TY Abs(TY a,TY b){return a>b?a-b:b-a;}
inline TY Pow(TY a,TY b){
	TY ans=1,base=a;
	while(b){
		if(b&1)ans=ans*base%mod;
		base=base*base%mod;b>>=1;
	}return ans;
}TY n,p,ans,have[100001],cnt,a[MAXN],b[MAXN],ca,cb;
inline bool isprime(TY now){
	FOR(i,2,now)if(now%i==0)return false;
	return true;
}inline void dfs(TY now,TY sum,bool op){
	if((op==0&&now==cnt/2+1)||(op==1&&now==cnt+1))return;
	dfs(now+1,sum,op);TY k=sum*have[now];
	if(k<=n){
		if(op==0)a[++ca]=k;else b[++cb]=k;
		dfs(now,k,op);
	}
}
int main(){
	n=qr();p=qr();
	For(i,2,p)if(isprime(i))have[++cnt]=i;
	random_shuffle(have+1,have+1+cnt);
	dfs(1,1,0);dfs(cnt/2+1,1,1);a[++ca]=1;b[++cb]=1;
	sort(a+1,a+1+ca);sort(b+1,b+1+cb);
	TY id=cb;
	For(i,1,ca){
		while(id&&b[id]*a[i]>n)--id;
		ans+=id;
	}qw(ans);
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘void qw(long long int)’:
./Main.cpp:42:2: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   42 |  if(x>=10)qw(x/10);putchar(x%10+'0');
      |  ^~
./Main.cpp:42:20: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   42 |  if(x>=10)qw(x/10);putchar(x%10+'0');
      |                    ^~~~~~~
./Main.cpp: In function ‘void ws(std::string)’:
./Main.cpp:18:34: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   18 | #define FOR(i,a,b) for(TY i=(a);i<(b);++i)
      |                                  ^
./Main.cpp:44:26: note: in expansion of macro ‘FOR’
   44 | inline void ws(string s){FOR(i,0,s.size())putchar(s[i]);}
      |                          ^~~

ジャッジ結果