sb
by 2022135551q @ 2017-05-11 12:55:18
发题解
by 2022135551q @ 2017-05-11 12:55:46
对不起,不是我弄的
by 2022135551q @ 2017-05-11 13:00:41
```cpp
## #include<bits/stdc++.h>
# const int maxn=10010;
using namespace std;
int n;
bool is_prime[maxn];
int pri[2*maxn],priN;
inline int find(int n);
int main()
{
ios::sync_with_stdio(false);
memset(is_prime,1,sizeof(is_prime));
is_prime[1]=0;
cin>>n;
find(n);
for(int i=4;i<=n;i+=2)
{
for(int j=1;j<=priN;j++)
{
if(is_prime[i-pri[j]])
{
cout<<i<<"="<<pri[j]<<"+"<<i-pri[j]<<endl;
break;
}
}
}
return 0;
}
inline int find(int n)
{
for(int i=2;i<=n;i++)
{
if(is_prime[i]==true)
{
pri[++priN]=i;
}
for(int j=1;j<=priN;j++)
{
if(i*pri[j]>n)break;
is_prime[i*pri[j]]=0;
if(i%pri[j]==0)break;
}
}
}
```
by 违规用户名U53900 @ 2017-10-11 17:24:12
不要发题解
by 杨奕辉 @ 2017-11-04 16:52:41