fast fast TLE
查看原帖
fast fast TLE
390770
S0CRiA楼主2021/4/9 19:26

rt

//P5535
#include <cstdio>

inline bool prime(long long k){
	for(register int i=2; i*i<=k; ++i)
		if(k%i==0) return false;
	return true;
}

int main(){
	long long n,k;
	scanf("%lld%lld",&n,&k);
	putchar(prime(k+1)&&k<<1>=n?'1':'2');
	return 0;
}
2021/4/9 19:26
加载中...