hoj Ordered Fractions
2012-06-14 22:25
218 查看
/*主要是快排的模板函数的应用*/ #include <iostream> #include <stdio.h> #include <cstring> #include <algorithm> using namespace std; struct node { int x, y; }num[10000]; int n; int gcd(int a,int b) { if(a%b==0) return b; else return gcd(b,a%b); } int cmp(node a,node b)//模板有return 即定义为int 型。注意结构体在模板中定义的方法。 { return (double)a.x/a.y<(double)b.x/b.y; } int main() { while(scanf("%d",&n)==1) { memset(num,0,sizeof(num)); int c=0; for(int i=1;i<n;i++) { for(int j=i+1;j<=n;j++) { if(gcd(j,i)==1) { num[c].x=i; num[c].y=j; c++; } } } sort(num,num+c,cmp); printf("0/1\n"); for(int i=0;i<c;i++) printf("%d/%d\n",num[i].x,num[i].y); printf("1/1\n"); printf("\n"); } return 0; }
[/code]
相关文章推荐
- [hoj 1076]Ordered Fractions[Farey序列]
- USACO Ordered Fractions
- USACO section 2.1 Ordered Fractions(简单数学求约数加个排序)
- USACO 2.1.3 Ordered Fractions
- 顺序的分数 Ordered Fractions(枚举+排序)
- Usaco 2.1.2 顺序的分数(Ordered Fractions)
- USACO section 2.1 Ordered Fractions(简单数学求约数加个排序)
- USACO-Ordered Fractions
- EOJ 1852 Solution Report --Ordered Fractions
- 【USACO Training】Section 2.1 Ordered Fractions
- Ordered Fractions
- USACO Section 2.1: Prob Ordered Fractions
- USACO 2.1 Ordered Fractions(乱搞)
- [题目] Section 2.1 OrderedFractions(USACO)
- USACO Ordered Fractions(枚举)
- Ordered Fractions
- USACO2.1.2--Ordered Fractions
- USACO Section 2.1: Ordered Fractions
- USACO-Section2.1 Ordered Fractions(简单数据处理)
- HOJ 10027 Longest Ordered Subsequence Extention