Pagini recente » Cod sursa (job #1197074) | Cod sursa (job #162607) | Cod sursa (job #1032966) | Cod sursa (job #1829310) | Cod sursa (job #2746632)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main() {
// p - numarator
// q - numitor
int n;
fin >> n;
bool found = true;
int ans = 0;
for(int numarator = 1; numarator <= n; ++numarator) {
for(int numitor = 1; numitor <= n; ++numitor) {
found = true;
for(int i = 2; i <= numitor; ++i) {
if(numarator % i == 0 && numitor % i == 0) {
found = false;
break;
}
}
if(found) {
ans++;
}
}
}
fout << ans;
return 0;
}