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

zoj 1210 Reciprocals

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

zoj 1210 Reciprocals

#include<iostream>#include<cstdio>#include<algorithm>using namespace std;namespace{string power(int base, int p){string res = "1", temp;int carry, t;while (p--){temp.clear();carry = 0;for (size_t i = 0; i < res.size(); i++){t = base * (res[i] - '0') + carry;carry = t / 10;temp += t % 10 + '0';}if (carry)temp += carry + '0';res = temp;}reverse(res.begin(), res.end());return res;}string& remove_leading_zero(string &s){while (s[0] == '0')s.erase(0, 1);return s;}int calc(const string &str, int base){string temp, s = str;int res = 0;while (s != "1"){temp.clear();int rem = 0;for (size_t i = 0; i < s.size(); i++){rem = rem * 10 + (s[i] - '0');temp += (rem / base + '0');rem = rem % base;}remove_leading_zero(temp);s = temp;res++;}return res;}int remove_tail_zero(string &s){int end = s.size(), count = 0;while (s[--end] == '0')count++;s.erase(end + 1, count);return count;}void print_zero(int n){while (n--)putchar('0');}}int main(){puts("Problem 4 by team x");string s;while (cin >> s){printf("n1 / %s =n", s.c_str());int tail = remove_tail_zero(s);putchar('0');putchar('.');if (s[s.size() - 1] == '1'){print_zero(tail - 1);puts("1");}else{int base = s[s.size() - 1] == '5' ? 5 : 2;int p = calc(s, base);string pow = power(10 / base, p);print_zero(tail + p - pow.size());puts(pow.c_str());}}puts("End of problem 4 by team x");return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/371918.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

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

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