首页 > 代码库 > USACO frac1直接排序
USACO frac1直接排序
/* ID:kevin_s1 PROG:frac1 LANG:C++ */ #include <iostream> #include <cstdio> #include <string> #include <cstring> #include <vector> #include <map> #include <set> #include <algorithm> #include <cstdlib> #include <list> #include <cmath> using namespace std; #define MAXN 20000 //gobal variable==== struct frac{ int a; int b; double c; }; vector<frac> fracs; int hash[170][170]; //hash去重 int N; //================== //function========== int gcd(int a, int b){ while(a = a % b){ a ^= b; b ^= a; a ^= b; } return b; } int cmp(frac a, frac b){ return a.c < b.c; } //================== int main(){ freopen("frac1.in","r",stdin); freopen("frac1.out","w",stdout); cin>>N; int index = 0; memset(hash, 0 ,sizeof(hash)); frac fr1,fr2; fr1.a = 0; fr1.b = 1; fr1.c = 0; fracs.push_back(fr1); fr2.a = 1; fr2.b = 1; fr2.c = 1; fracs.push_back(fr2); hash[0][1] = 1; hash[1][1] = 1; for(int i = 2; i <= N; i++){ for(int j = 1; j < i; j++){ int x = i; int y = j; int m = gcd(x, y); if(m > 1){ x = x / m; y = y / m; } if(hash[y][x] == 0){ frac fr; fr.a = y; fr.b = x; fr.c = (double)y / (double)x; fracs.push_back(fr); hash[y][x] = 1; } } } sort(fracs.begin(), fracs.end(), cmp); vector<frac>::iterator iter = fracs.begin(); for(; iter != fracs.end(); iter++){ cout<<iter->a<<"/"<<iter->b<<endl; } return 0; }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。