mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
Create 1734.c
This commit is contained in:
parent
903fdbe503
commit
8cf7067483
36
QUSTOJ/1734.c
Normal file
36
QUSTOJ/1734.c
Normal file
|
@ -0,0 +1,36 @@
|
|||
#include <stdio.h>
|
||||
|
||||
//Written by Coffee. 判断素数
|
||||
int isPrime(int num)
|
||||
{
|
||||
if (num == 2 || num == 3)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
if (num % 6 != 1 && num % 6 != 5)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
for (int i = 5; i*i <= num; i += 6)
|
||||
{
|
||||
if (num % i == 0 || num % (i+2) == 0)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
return 1;
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
int a;
|
||||
scanf("%d",&a);
|
||||
for(int i=2;i<=a/2;i++)
|
||||
{
|
||||
if(isPrime(i)&&isPrime(a-i))
|
||||
{
|
||||
printf("%d=%d+%d\n",a,i,a-i);
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user