上接 第 8 页 [第 76 楼]
//第 8 题解答
//写得有点复杂了
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;
//十进制转二进制
char* DecimalToBinary(char* Dst, int Src)
{
assert(Dst);
assert(Src >= 0);
char* Dest = Dst;
int Itr = 31;
while((Src&(1<<Itr--)) == 0);
++Itr;
while(Itr>=0)
*Dest++ = ((Src&(1<<Itr--)) > 0)?'1':'0';
*Dest = 0;
return Dst;
}
//二进制转十进制
unsigned int BinaryToDecimal(unsigned int& Dst, const char* Src)
{
assert(Src);
Dst = 0;
int Itr = static_cast<int>(strlen(Src)) - 1;
while(Itr >= 0)
Dst |= (*Src++ - '0')<<Itr--;
return Dst;
}
//二进制加法
char* BinaryAdd(char* Result, const char* Lhs, const char* Rhs)
{
assert(Result);
assert(Lhs);
assert(Rhs);
const char* LhsEnd = Lhs + strlen(Lhs) - 1;
const char* RhsEnd = Rhs + strlen(Rhs) - 1;
char* Dest = Result;
char Carry = 0;
while(LhsEnd >= Lhs || RhsEnd >= Rhs)
{
*Dest++ = '0' + ((Carry += ((LhsEnd>=Lhs)?*LhsEnd---'0':0) +
((RhsEnd>=Rhs)?*RhsEnd---'0':0))?(Carry%2):0);
Carry = Carry?(Carry/2):0;
}
if(Carry)
*Dest++ = '0' + Carry;
*Dest = 0;
std::reverse(Result, Dest);
return Result;
}
int main()
{
char Lhs[sizeof(int)*8+1];
char Rhs[sizeof(int)*8+1];
char Result[sizeof(int)*8+1];
char* Operand[] = {Lhs, Rhs};
unsigned int Tmp = 0;
for(int i = 0; i < 2; ++i)
{
cin>>Tmp;
cout<<DecimalToBinary(Operand[i], Tmp)<<endl;
}
cout<<BinaryToDecimal(Tmp, BinaryAdd(Result, Operand[0], Operand[1]))<<endl;
return 0;
}
//第 九 题解答
//输者加所有赢者的火柴数之和的一半，所有赢者手中火柴数减半。
#include <iostream>
using namespace std;
void Play(int Ary[], int nPlayers, int Winner)
{
if(Winner > nPlayers)
return;
for(int i = 0; i < nPlayers; ++i)
if(i != Winner-1)
Ary[Winner-1] += Ary[i] /= 2;
Play(Ary, nPlayers, Winner+1);
}
int main()
{
int Ary[4] = {16, 16, 16, 16};
Play(Ary, 4, 1);
for(int i = 0; i < 4; ++i)
cout<<Ary[i]<<'\t';
return 0;
}
//第 十三 题解答
#include <iostream>
#include <vector>
using namespace std;
ostream& operator<<(ostream& Dst, const vector<bool>& Src)
{
vector<bool>::const_iterator Itr = Src.begin();
while(Itr != Src.end())
Dst<<char((*Itr++)?'*':'0');
return Dst;
}
void Play(vector<bool>& Src)
{
for(unsigned int x = 0; x < Src.size(); ++x)
{
for(unsigned int y = 0; y < Src.size(); ++y)
if(y != x)
Src[y] = !Src[y];
cout<<Src<<endl;
}
}
int main()
{
unsigned n = 100;
if(cin>>n)
{
vector<bool> Src;
Src.assign(n, true);
Play(Src);
}
return 0;
}
//第 十四 题解答
#include <iostream>
#include <algorithm>
using namespace std;
void Move(char Ary[], int Size)
{
for(int x = Size/2-1, Dst = Size-1; x > 0; --x, Dst -=2)
for(int y = x+1; y < Dst; ++y)
cout<<(swap(Ary[y-1], Ary[y]), Ary)<<endl;
}
int main()
{
unsigned int n = 0;
if(cin>>n)
{
char* Buffer = new char[2*n+1];
Buffer[2*n] = 0;
for(int i = 0; i < 2*n; ++i)
Buffer[i] = (i>=n)?'0':'*';
cout<<Buffer<<endl;
Move(Buffer, n*2);
delete [] Buffer;
}
return 0;
}
//第 十七 题解答
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
void Swap(string::iterator Lhs, string::iterator Rhs)
{
char Tmp = *Lhs;
*Lhs = *Rhs;
*Rhs = Tmp;
}
string& Sort(string& Ary)
{
string::iterator FItr = Ary.begin();
string::iterator CItr;
char Alpha = 'A';
while(FItr != Ary.end())
if(*FItr <= 'A' || *FItr >= 'Z')
++FItr;
else
if((CItr = find(FItr, Ary.end(), Alpha))!= Ary.end())
Swap(FItr++, CItr);
else
if(++Alpha > 'Z')
break;
return Ary;
}
const char Delim = '^';//终止符
int main()
{
string Buffer;
if(getline(cin, Buffer, Delim))
cout<<Sort(Buffer)<<endl;
return 0;
}
//下接 第 11 页[第 107 楼]
您所在位置：
GCC
[专家分：14380] 发布于 2006-04-14 11:53:00 
