栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

zoj 1933 Dead Fraction

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

zoj 1933 Dead Fraction

#include <iostream>#include <string.h>#include <limits>#include <stdlib.h>using namespace std;typedef unsigned long long ULL;ULL gcd(ULL a, ULL b){if (b == 0)return a;return gcd(b, a%b);}ULL ten_pow(unsigned int x){ULL result = 1;for (unsigned int i = 0; i < x; ++i){result *= 10;}return result;}int main(int argc, char *argv[]){string line;while (cin >> line){if (line == "0"){break;}string digit = line.substr(2, line.length() - 5);unsigned int length = digit.length();const ULL n = atoi(digit.c_str());if (n == 0){cout << "0/1" << endl;continue;}ULL min_x = numeric_limits<ULL>::max();ULL min_y = 0;for (int i = 1; i <= length; ++i){string first = digit.substr(0, length - i);ULL x = ten_pow(length) - ten_pow(length - i);ULL y = n - atoi(first.c_str());ULL d = gcd(x, y);x /= d;y /= d;if (min_x > x){min_x = x;min_y = y;}}cout << min_y << '/' << min_x << endl;}return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/379211.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号