Pagini recente » Cod sursa (job #352665) | Cod sursa (job #844077) | Borderou de evaluare (job #1792847) | Cod sursa (job #809832) | Cod sursa (job #452706)
Cod sursa(job #452706)
#include<iostream.h>
#include<fstream.h>
long long a[2000000],i,t,n;
int main()
{ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=1;i<=n-1;i++)
a[i]=i+1;
for(i=1;i<=n;i++){
if((a[i]!=2)&&(a[i]%2==0))a[i]=0;
if((a[i]!=3)&&(a[i]!=0)&&(a[i]%3==0))a[i]=0;
if((a[i]!=5)&&(a[i]!=0)&&(a[i]%5==0))a[i]=0;
if((a[i]!=7)&&(a[i]!=0)&&(a[i]%7==0))a[i]=0;
}
for(i=1;i<=n;i++)
if(a[i]!=0)t++;
g<<t;
}