Pagini recente » Cod sursa (job #805069) | Cod sursa (job #2297983) | Cod sursa (job #2511742) | Cod sursa (job #2554527) | Cod sursa (job #499046)
Cod sursa(job #499046)
#include<iostream.h>
#include<fstream.h>
//#include<stdio.h>
long long a[10000][10000];
ifstream p("fractii.in");
ofstream v("fractii.out");
void gen(int n){
int i,j,z;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(z=2;z<=n;z++)
a[i*z][j*z]=-1;
}
int nr(int n){
int s=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][j]!=-1)s++;
return s;
}
int main(){
int n;
p>>n;
p.close();
gen(n);
v<<nr(n);
v.close();
return 0;
}