Cod sursa(job #1379245)
| Utilizator | Data | 6 martie 2015 17:09:19 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#define f cin
#define g cout
#define NMAX 1000005
using namespace std;
int n,i,c[NMAX];
void ciur()
{
int i,j;
for(i=2;i*i<=NMAX;i++)
{
if(c[i]==0)
{
for(j=i*i;j<=NMAX;j+=i)
{
c[j]=1;
}
}
}
}
int main()
{
f>>n;
ciur();
for(i=2;i<=n;i++)
{
if(c[i]==1 && c[n-i]==1)
{
g<<i<<" "<<n-i;
return 0;
}
}
return 0;
}
