UVA10494 - If We Were a Child Again

问题描述

输入两个数求余和求模的结果

思路

套用大数模板。。

代码

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn=1000;
struct bign
{int len,s[maxn];bign(){memset(s,0,sizeof(s));len=1;}bign(int num){*this=num;}bign(const char *num){*this=num;}bign operator = (const int num){char s[maxn];sprintf(s,"%d",num);*this=s;return *this;}bign operator = (const char *num){len=strlen(num);for(int i=0;i<len;i++)s[i]=num[len-i-1]-'0';return *this;}//输出string str() const{string res="";for(int i=0;i<len;i++){res=(char)(s[i]+'0')+res;}if(res=="")res="0";return res;}void clean(){while(len>1&&!s[len-1])len--;}bign operator + (const bign &b) const{bign c;c.len=0;for(int i=0,g=0;g||i<max(len,b.len);i++){int x=g;if(i<len) x+=s[i];if(i<b.len) x+=b.s[i];c.s[c.len++]=x%10;g=x/10;}return c;}bign operator - (const bign& b) const{bign c;c.len=0;for(int i=0,g=0;i<len;i++){int x=s[i]-g;if(i<b.len) x-=b.s[i];if(x>=0)g=0;else{g=1;x+=10;}c.s[c.len++]=x;}c.clean();return c;}bign operator * (const bign& b) const{bign c;c.len=len+b.len;for(int i=0;i<len;i++){for(int j=0;j<b.len;j++)c.s[i+j]+=s[i]*b.s[j];}for(int i=0;i<c.len-1;i++){c.s[i+1]+=c.s[i]/10;c.s[i]%=10;}c.clean();return c;}bign operator / (const bign &b)const{bign ret,cur=0;ret.len=len;for(int i=len-1;i>=0;i--){cur=cur*10;cur.s[0]=s[i];while(cur>=b){cur-=b;ret.s[i]++;}}ret.clean();return ret;}bign operator %(const bign &b) const{bign c=*this/b;return *this-c*b;}bool operator <(const bign& b) const{if(len!=b.len) return len<b.len;for(int i=len-1;i>=0;i--)if(s[i]!=b.s[i])return s[i]<b.s[i];return false;}bool operator >(const bign& b) const{return b < *this;}bool operator <=(const bign& b) const{return !(b < *this);}bool operator >=(const bign& b) const{return !(*this <b);}bool operator ==(const bign& b) const{return !(b< *this)&&!(*this<b);}bool operator !=(const bign& b) const{return *this >b || *this <b;}bign operator +=(const bign& b){*this= *this + b;return *this;}bign operator -=(const bign& b){*this= *this - b;return *this;}bign operator *=(const bign& b){*this= *this * b;return *this;}bign operator /=(const bign& b){*this= *this / b;return *this;}bign operator %=(const bign& b){*this= *this % b;return *this;}
};istream& operator >> (istream &in, bign& x)
{string s;in >> s;x = s.c_str();return in;
}ostream& operator << (ostream &out, const bign& x)
{out << x.str();return out;
}int main()
{bign a,b;string s;while(cin>>a>>s>>b){a.clean();   //考虑清除前导0b.clean();if(s=="/")cout<<a/b<<endl;elsecout<<a%b<<endl;}return 0;
}

UVA10494 - If We Were a Child Again相关推荐

UVA10494 If We Were a Child Again【大数除法】
"Oooooooooooooooh! If I could do the easy mathematics like my school days!! I can guara ...
题目梳理（一）(2019.07.06~2019.07.20)
一.字典树类型 A HihoCoder1014 Trie树(已做) 题目链接 https://hihocoder.com/problemset/problem/1014 B HDU12 ...
AOAPC I: Beginning Algorithm Contests 题解
AOAPC I: Beginning Algorithm Contests 题解 AOAPC I: Beginning Algorithm Contests (Rujia Liu) - Virtual ...
oracle 提示:ORA-02292:integrity constraint(xxxxxxx) violated - child record found
当我们删除数据的时候 oracle 提示:ORA-02292:integrity constraint(xxxxxxx) violated - child record found 这种情况呢是因为 ...
CF438E The Child and Binary Tree（有意思的生成函数 + 多项式求逆 + 多项式开方）
整理的算法模板合集: ACM模板点我看多项式全家桶(●^◡_◡◡^●) CF438E The Child and Binary Tree 简单的黑题首先我们发现模数为99824435399824 ...
存在就不插入_DOM 插入节点和三个Child方法
插入节点 insertBefor(); 插入格式:父节点.insertBefor( 插入节点,旧节点 )功能:将插入的节点插入到旧节点之前举个小例子:创建一个strong节点,将这个节点插入到span ...
[翻译]AKKA笔记 - CHILD ACTORS与ACTORPATH -6
原文:http://rerun.me/2014/10/21/akka-notes-child-actors-and-path/ Actor是完全的继承结构.你创建的任何Actor肯定都是一个其他Act ...
【转】Silverlight 3 Beta 新特性解析（7）- Child Window和Shader Effect篇
前提条件: 阅读本文之前请确认你已经安装了如下软件 Visual Studio 2008 (Express) SP1 Silverlight 3 Tools For Visual Studio Mic ...
mongodb启动不了：child process failed, exited with err
2019独角兽企业重金招聘Python工程师标准>>> [摘要:本日正在设置装备摆设mongodb时产生了以下几个毛病, 已被我办理了,供应给人人. 2015-05-12T09:30 ...

UVA10494 - If We Were a Child Again

问题描述

思路

代码

UVA10494 - If We Were a Child Again相关推荐

最新文章

热门文章