1 solutions
-
0
C :
#include<stdio.h> int isPrimeNumber(int n) { int i; for(i=2;i<=n/2;i++) { if(n%i==0) return 0; } return 1; } int gotbaha(int n) { int i; for(i=2;i<n;i++) { if(isPrimeNumber(i)&&isPrimeNumber(n-i)&&(i<=n-i)) { printf("%d=%d+%d\n",n,i,n-i); } } } main() { int n; scanf("%d",&n); gotbaha(n); }C++ :
#include<stdio.h> int isPrimeNumber(int n) { int i; for(i=2;i<=n/2;i++) { if(n%i==0) return 0; } return 1; } int gotbaha(int n) { int i; for(i=2;i<n;i++) { if(isPrimeNumber(i)&&isPrimeNumber(n-i)&&(i<=n-i)) { printf("%d=%d+%d\n",n,i,n-i); } } } main() { int n; scanf("%d",&n); gotbaha(n); }
- 1
Information
- ID
- 17248
- Time
- 1000ms
- Memory
- 2MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By