UVa 834 - Continued Fractions
2014-03-14 10:14
330 查看
题目:将一个分数转化成连分数形式。
分析:辗转相除,直接利用GCD算法求解即可。
分析:辗转相除,直接利用GCD算法求解即可。
#include <iostream> #include <cstdlib> using namespace std; int s[100]; int main() { int b,k; while ( cin >> b >> k ) { int count = 0; while ( b%k ) { s[count ++] = b/k; b = b%k; swap( b, k ); } s[count ++] = b; cout << "[" << s[0]; for ( int i = 1 ; i < count ; ++ i ) { if ( i == 1 ) cout << ";"; else cout << ","; cout << s[i]; } cout << "]" << endl; } return 0; }
相关文章推荐
- uva 834 - Continued Fractions
- UVa834 Continued Fractions【连分数】
- UVa 11054 - Wine trading in Gergovia
- UVA 10557 XYZZY 结题报告
- uva10474 简单排序查找 一次AC
- uva297 - Quadtrees
- UVA - 12036 Stable Grid
- UVA - 12325 Zombie's Treasure Chest
- UVA - 10396 Vampire Numbers 暴力+打表
- UVa 12569:Planning mobile robot on Tree(EASY Version)(BFS)
- uva 436 Arbitrage (II)
- UVA - 193 Graph Coloring
- UVA 120 Stacks of Flapjacks ——思路题
- 天平难题 UVa 1354
- uva 165 - Stamps
- UVa 10069 - Distinct Subsequences
- UVa 297 - Quadtrees
- uva712 - S-Trees
- UVa 11806 - Cheerleaders (组合数学 容斥原理)
- UVA - 1642 Magical GCD(nlogn传统算法思想 序列较短的维护队列)