Pagini recente » Borderou de evaluare (job #3161259) | Cod sursa (job #532989) | Cod sursa (job #479002) | Borderou de evaluare (job #3193981) | Cod sursa (job #925152)
Cod sursa(job #925152)
#include <iostream>
using namespace std;
int fractii[10001][10001];
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
int n;cin>>n;
int i,j,k,Ans=0;
for(k=2;k<=n;++k)
for(i=k;i<=n;i+=k)
for(j=k;j<=n;j+=k)
fractii[i][j]=1;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if(!fractii[i][j])
Ans++;
cout<<Ans;
return 0;
}