void into2() // x 2
{
for(int i=len;i>0;i--) s[i]=s[i-1];
s[0]=0;
len++;
}
bool plus1() // + 1 : returns true on overflow
{
int i=0;
while(i
if(i==len) return true;
for(i=0;i
{
if(s[i]==0){ s[i]=1; break; }
s[i]=0;
}
return false;
}
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment