Cod sursa(job #1364034)
Utilizator | Data | 27 februarie 2015 13:46:31 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
using namespace std;
int v[9999][9999];
int main()
{
int S=0;
int n;
cin>>n;
for(int i=2;i<=n;i++){
for(int c=i+i;c<=n;c+=i){
if(v[i][c]==0){
v[i][c]=1;
S++;
}
for(int j=i+i; j<c; j+=i){
if(v[j][c]==0){
v[j][c]=1;
S++;
}
}
}
}
//S=7;
S=n*n-(2*S)-n+1;
cout<<S;
return 0;
}