Pagini recente » Cod sursa (job #30503) | Cod sursa (job #2103065) | Cod sursa (job #2029384) | Cod sursa (job #2901285) | Cod sursa (job #2024212)
#include <fstream>
#include <iostream>
#define Nmax 1000111
using namespace std;
int indeuler[Nmax],ciur[Nmax];
long long int n,s=0;
int main()
{
ifstream fin ("fractii.in");
ofstream fout ("fractii.out");
//fin>>n;
ciur[0]=1;
ciur[1]=1;
for (long long int i=2;i<=Nmax;++i)
{
if (ciur[i]==0)
{
cout<<"i ";
for (long long j=2*i;j<=n;j+=i)
{
ciur[j]=1;
}
}
}
/*
for (int i=1;i<=n;++i)
{
indeuler[i]=indicatoreuler(i);
}
*/
long long x=9;
long long int rasp=1;
long long int marime=x;
for (int i=1;i<=x;++i)
{
if (ciur[i]==0)
{
fout<<i<<" ";
}
}
for (long long int i=1;i<=marime;++i)
{
if (ciur[i]==0)
{
if (x&i==0)
{
while (x&i==0)
{
x/=i;
rasp=rasp*i;
}
rasp/=i;
rasp*=(i-1);
}
}
}
fout<<rasp;
}