mathematics, the noldbach problem

阅读量：

Noldbach problem

题面翻译

当某一素数能够被表示为比它小且与其相邻的两个素数之和加1时，该素数被称为"好素数"。
若给定两个正整数n与k，且在2至n的范围内，满足条件的好素数数量不少于k，则输出"YES"，否则输出"NO"。

2<=n<=1000
0<=k<=1000

题目描述

Nick is interested in prime numbers. Once he read about Goldbach problem. It states that every even integer greater than $2$ can be expressed as the sum of two primes. That got Nick’s attention and he decided to invent a problem of his own and call it Noldbach problem. Since Nick is interested only in prime numbers, Noldbach problem states that at least $k$ prime numbers from $2$ to $n$ inclusively can be expressed

全部评论 (0)

还没有任何评论哟~