Pagini recente » Cod sursa (job #2236135) | Cod sursa (job #1344205) | Cod sursa (job #566784) | Cod sursa (job #2775757) | Cod sursa (job #2775771)
#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n, s = 0;
vector<double> a;
int cmmdc(int a, int b){
while(a != b){
if(a > b)
a /= b;
else
b /= a;
}
return a;
}
int main(){
f >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
{
double x = (double)i / j;
if(find(a.begin(), a.end(), x) == a.end()) {
s++; a.push_back(x);}
}
g << s;
f.close();
g.close();
}