/* ID: lucien23 PROG: frac1 LANG: C++ */ #include <iostream> #include <fstream> #include <vector> #include <algorithm> using namespace std; typedef struct Fraction { int numerator; int denominator; Fraction(){} Fraction(int x, int y) { numerator = x; denominator = y; } } Fraction; bool isPrimes(int x, int y); bool compFrac(Fraction frac1, Fraction frac2) { if (frac1.numerator/(double)frac1.denominator < frac2.numerator/(double)frac2.denominator) { return true; } return false; } int main() { ifstream infile("frac1.in"); ofstream outfile("frac1.out"); if(!infile || !outfile) { cout << "file operation failure!" << endl; return -1; } int N; infile >> N; vector<Fraction> fractions; fractions.push_back(Fraction(0, 1)); fractions.push_back(Fraction(1, 1)); for (int i=1; i<=N; i++) { for (int j=1; j<i; j++) { if (isPrimes(j, i)) { fractions.push_back(Fraction(j, i)); } } } sort(fractions.begin(), fractions.end(), compFrac); for (vector<Fraction>::iterator it=fractions.begin(); it!=fractions.end(); it++) { outfile << it->numerator << "/" <<it->denominator << endl; } return 0; } /* *推断两数是否互质 */ bool isPrimes(int x, int y) { for (int i=2; i<=x; i++) { if (x%i == 0 && y%i == 0) { return false; } } return true; }
USACO Section 2.1 Ordered Fractions
转载本文章为转载内容,我们尊重原作者对文章享有的著作权。如有内容错误或侵权问题,欢迎原作者联系我们进行内容更正或删除文章。
提问和评论都可以,用心的回复会被更多人看到
评论
发布评论
相关文章
-
71Ordered fractions
#include<bits/stdc++.h>
数学 法里数列 #include c++ -
USACO Section 2.1 - Healthy Holsteins 二进制枚举
这道题写了很久~用了好多方法~~最开始想要先按长度再按从小
c #include i++ ios -
USACO section 2.1 Healthy Holsteins(枚举,二进制存储)
Healthy HolsteinsBurch & Kolstad Farmer John prides himself on having th
存储 combinations each integer output -
USACO Section 2.1 Hamming Codes - 题意相当坑爹..很无聊..
就算AC了我也弄不明白输入里的B到底是要干啥~~我的程
c #include i++ ios -
POJ1164 + USACO Section 2.1 The Castle - 简单的DFS...
两个题是一个题~~只不过POJ的更弱些,只要找到房间数以及最大房间的面积就ok了... 首先是构造墙~~我是用个4位的bool数
search struct c #include i++