Cod sursa(job #1193009)
Utilizator | Data | 30 mai 2014 16:43:38 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f;
ofstream g;
long int i,j,n,p,z;
long long k;
long int t[1000002];
void nr(int i)
{
for(p=2;p<=i;p++)
if(t[p]==0)
if(i%p==0||p%i==0)
for(j=p;j<=n;j+=p)t[j]=1;
for(p=1;p<=n;p++){if(t[p]==0)k++;t[p]=0;}
}
int main()
{
f.open("fractii.in");
g.open("fractii.out");
f>>n;
k=n;
for(i=2;i<=n;i++)nr(i);
g<<k;
g.close();
}