Pagini recente » Cod sursa (job #1201023) | Cod sursa (job #1823158) | Cod sursa (job #999929) | Cod sursa (job #1935638) | Cod sursa (job #2913151)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
void rezolvare (string fileInput, string fileOutput){
ifstream fileIn; fileIn.open(fileInput, ios::in);
ofstream fileOut; fileOut.open(fileOutput, ios::out);
// From here we start the problem.
fileIn >> number;
for (int i = 1; i <= number; i++) {
for (int q = 1; q <= number; q++) {
if (find(fractii.begin(), fractii.end(), (double)i/q) == fractii.end()) {
fractii.push_back((float)i/q);
countFractii++;
}
}
}
fileOut << countFractii;
fileIn.close(); fileOut.close();
}
private:
int number{0};
vector<double> fractii;
int countFractii = 0;
};
int main()
{
Solution s;
s.rezolvare("fractii.in", "fractii.out");
return 0;
}