Pagini recente » Cod sursa (job #2329666) | Cod sursa (job #3148215) | Cod sursa (job #2598377) | Cod sursa (job #780616) | Cod sursa (job #2348227)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz size()
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int mod=1e9+7;
const int inf=2e9+100;
const double eps=1e-9;
int main() {
#ifdef LOCAL_
freopen("inp.txt","r",stdin);
#endif
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
int n,res;
cin>>n;
res = n*2-1;
for(int i=2;i<=n;i++){
for(int j=2;j<=n;j++){
if (i!=j && i%j && j%i) res++;
}
}
cout<<res<<endl;
return 0;
}