Pagini recente » Cod sursa (job #1456029) | Cod sursa (job #2961114) | Cod sursa (job #122959) | Cod sursa (job #1454150) | Cod sursa (job #270045)
Cod sursa(job #270045)
#include<stdio.h>
#include<math.h>
#define N 1000003
int v[N]={0};
void phi(){
for(int i=2; i<N;++i)
v[i]=i;
for(int i=2; i<N;++i){
if(v[i]==i){
for(int j=i; j<N ; j+=i){
v[j]/=i;
v[j]*=i-1;
}
}
}
}
int main(){
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
int n;
long long s;
scanf("%d", &n);
s=n*n;
// phi();
//v[1]=1;
// for(int i=1; i<=n;++i){
// if(n%i!=0&&(n-1)%i!=0)
// s+=v[i];
// }
// s+=1;
// s+=s-1;
// printf("%lld", s);
printf("%lld", (long long)floor(s*0.30396355));
return 0;
}