c++ STL平常练习-2

最新推荐文章于 2024-10-11 17:31:32 发布

weixin_34289744

最新推荐文章于 2024-10-11 17:31:32 发布

阅读量129

点赞数

文章标签： c/c++ 数据结构与算法

原文链接：http://blog.51cto.com/saibro/1184327

版权

接上一篇：

int weekday(date a)
{
int tm = a.month >= 3 ? (a.month-2) : (a.month + 10);
int ty = a.month >= 3 ? (a.year) : (a.year-1);
return (ty+ty/4-ty/100+ty/400+(int)(2.6*tm-0.2)+a.day)%7;
}
void main65()
{
date d;
d.year = 2013;
d.month = 3;
d.day = 22;
cout<<weekday(d)<<endl;
}
string convertToString(double x)
{
ostringstream o;
if(o<<x)
return o.str();
return "Conversion error";
}
double convertFromString(string s)
{
istringstream i(s);
double x;
if(i>>x)
return x;
return 0.0;
}
struct myComp
{
bool operator() (const int &a,const int &b)
{
return a>b;
}
};
bool myComp1(const int &a,const int &b)
{
return a>b;
}
void main66()
{
/* string s = "abcdefghijklmn";
s.replace(1,3,"good");
cout<<s<<endl;
s.replace(s.begin() ,s.begin()+2,"bct");
cout<<s<<endl;
string ss = "tomcatdogkitty";
cout<<ss.find("cat")<<endl;
int loc;
string s = "My cat's breath smells like cat food.";
loc = s.rfind( "breath", 8 );
cout << "The word breath is at index " << loc << endl;
loc = s.rfind( "breath", 20 );
cout << "The word breath is at index " << loc << endl;
char ch[100];
cin>>ch;
int a,b;
char c;
sscanf(ch,"%d%c%d",&a,&c,&b);
cout<<a<<" "<<b<<" "<<c<<endl;
char c[100];
sprintf(c,"%f",120.33f);
cout<<c<<endl;
cout<<convertToString(44.32)<<endl;
cout<<convertFromString("23.23")<<endl;
set<int,myComp> s;
s.insert(43);
s.insert(54);
s.insert(0);
s.insert(3);
set<int,myComp>::iterator b = s.begin();
copy(s.begin(),s.end(),ostream_iterator<int>(cout," "));
multiset<int> ms;
ms.insert(3);
ms.insert(3);
ms.insert(33);
copy(ms.begin(),ms.end(),ostream_iterator<int>(cout," "));
deque<int> d;
d.push_back(2);
d.push_back(44);
d.push_back(12);
d.push_back(9);
copy(d.begin(),d.end(),ostream_iterator<int>(cout," "));
cout<<endl;
d.push_front(8);
d.push_front(01);
copy(d.begin(),d.end(),ostream_iterator<int>(cout," "));
cout<<endl;
d.insert(d.begin()+4,19);
copy(d.begin(),d.end(),ostream_iterator<int>(cout," "));
cout<<endl;
d.insert(d.begin()+2,20);
copy(d.begin(),d.end(),ostream_iterator<int>(cout," "));
list<int> l,ll;
ll.push_back(12);
ll.push_back(11);
ll.push_back(2);
ll.push_back(9);
ll.push_back(110);
ll.push_back(17);
ll.push_back(42);
ll.push_back(82);
l.push_back(3);
l.push_back(23);
l.push_back(53);
l.push_back(34);
l.push_back(32);
l.push_back(31);
l.push_back(13);
copy(l.begin(),l.end(),ostream_iterator<int>(cout," "));
cout<<endl;
l.sort();
copy(l.begin(),l.end(),ostream_iterator<int>(cout," "));
cout<<endl;
ll.sort();
l.merge(ll);
copy(l.begin(),l.end(),ostream_iterator<int>(cout," "));
cout<<endl;
cout.precision(4);
cout<<23.2323<<endl;
*/
}
bool myComp2(const string &s1,const string &s2)
{
int c1 = count(s1.begin(),s1.end(),'1');
int c2 = count(s2.begin(),s2.end(),'1');
if(c1 != c2)
return c1 < c2; //其中'1'的个数不相等时候，按照'1'的个数进行排序
else
return s1 < s2; //相等的时候，按照字典序排列
}
void main68()
{
vector<string> vs;
string s;
while(cin>>s)
{
vs.push_back(s);
}
sort(vs.begin(),vs.end(),myComp2);
copy(vs.begin(),vs.end(),ostream_iterator<string>(cout,"\n"));
}
class student
{
public:
string name;
double score;
bool operator<(const student s)
{
if(abs(score - s.score) < 10e-6) //认为成绩点相等
return name < s.name;
else
return score > s.score;
}
void output()
{
cout<<fixed<<setprecision(2);
cout<<left<<setw(11);
cout<<name<<score<<endl;
}
};
void main69()
{
int classNum = 0;
int courseNum = 0;
int studentNum = 0;
int courseScore[N];
int tmpcNum = 0;
cin>>classNum;
while(tmpcNum < classNum)
{
cin>>courseNum;
int tmp = 0;
while(tmp<courseNum)
{
cin>>courseScore[tmp];
++tmp;
}
cin>>studentNum;
tmp = 0;
vector<student> vs;
while(tmp<studentNum)
{
student stmp;
cin>>stmp.name;
int ctmp = 0;
int scoretmp;
double totalscore = 0.0;
while(ctmp < courseNum)
{
cin>>scoretmp;
if(scoretmp >= 60)
{
totalscore += ((double)(scoretmp-50) / 10) * courseScore[ctmp];
}
++ctmp;
}
stmp.score = totalscore / 10;
++tmp;
vs.push_back(stmp);
}
sort(vs.begin(),vs.end());
vector<student>::iterator b = vs.begin();
vector<student>::iterator e = vs.end();
cout<<(tmpcNum ? "\n":"");
cout<<"class "<<tmpcNum+1<<" :"<<endl;
while(b != e)
{
b->output();
++b;
}
++tmpcNum;
}
}
void main70()
{
double d = 23.212;
cout<<fixed<<setprecision(0)<<d<<endl
<<setprecision(1)<<d<<endl
<<setprecision(2)<<d<<endl;
}
bool myComp3(const string &s1,const string &s2)
{
if(s1.length() == s2.length()) //若长度相同，则按照字典序排列
{
return s1 < s2;
}else
return s1.length() < s2.length();
}
void main71()
{
vector<string> vs;
string s;
while(cin>>s)
{
string ss = s;
reverse(s.begin(),s.end());
if(ss == s)
vs.push_back(ss);
}
sort(vs.begin(),vs.end(),myComp3);
copy(vs.begin(),vs.end(),ostream_iterator<string>(cout,"\n"));
}
bool isPrime(int n)
{
if(n == 1) return false;
int i,j = (int)sqrt(n);
for(i=2; i<=j; ++i)
if(n % i == 0)
return false;
return true;
}
bool duichen(int n)
{
string s;
ostringstream o(s);
o<<n;
string ss = s;
reverse(s.begin(),s.end());
if(ss == s)
return true;
else return false;
}
void main72()
{
int n;
while(cin>>n)
{
cout<<(isPrime(n)&& duichen(n) ? "yes":"no" )<<endl;
}
}
void main73()
{
int n,sum=1;
for(n=1; n<=12; ++n)
sum *= n;
vector<int> vi;
while(cin>>n)
{
if(sum % n == 0)
{
vi.push_back(n);
}
}
int num = 0;
while(!vi.empty())
{
n = vi.front();
vi.erase(vi.begin());
vector<int>::iterator b = vi.begin();
vector<int>::iterator e = vi.end();
while(b != e)
{
int tmp = sum / n;
if(*b == tmp)
{// cout<<n<<" "<<*b<<endl;
++num;
vi.erase(b);
b = vi.begin();
e = vi.end();
}else
++b;
}
}
cout<<num<<endl;
}
void main75()
{
stack<int> si;
int n;
bool flag;
while(cin>>n)
{
if(n<0)
{
flag = false;
n = -n;
}
else flag = true;
do
{
si.push(n%2);
n/=2;
}while(n!=0);
cout<<(flag?"":"-");
while(!si.empty())
{
cout<<si.top();
si.pop();
}
cout<<endl;
}
}
//一下算法是迷宫求解
class mazeNode
{
public:
int x,y,d; //分别代表坐标和方向
};
#define MAZESIZE 10
int mg[MAZESIZE][MAZESIZE] = {
{1,1,1,1,1,1,1,1,1,1},
{1,0,0,1,0,0,0,1,0,1},
{1,0,0,1,0,0,0,1,0,1},
{1,0,0,0,0,1,1,0,0,1},
{1,0,1,1,1,0,0,0,0,1},
{1,0,0,0,1,0,0,0,0,1},
{1,0,1,0,0,0,1,0,0,1},
{1,0,1,1,1,0,1,1,0,1},
{1,1,0,0,0,0,0,0,0,1},
{1,1,1,1,1,1,1,1,1,1}
}; //迷宫的定义 1表示墙，0表示通道
int dir[4][2] = {{-1,0},{0,1},{1,0},{0,-1}}; //代表上右下左方向
void findPath(int x1,int y1,int x2,int y2)
{
stack<mazeNode> sm;
mazeNode mn ,tmp;
mg[x1][y1] = -1;
mn.x = x1;
mn.y = y1;
mn.d = -1;
sm.push(mn);
while(!sm.empty())
{
mn = sm.top();
sm.pop();
if(mn.x == x2 && mn.y == y2) //表示到了终点
{
cout<<"路径为: "<<endl;
cout<<mn.x<<" "<<mn.y<<endl;
while(!sm.empty())
{
mn = sm.top();
sm.pop();
cout<<mn.x<<" "<<mn.y<<endl;
}
}
bool flag = false;
while((++mn.d) < 4 && !flag)
{
int x = mn.x,y = mn.y;
switch(mn.d)
{
case 0:
x += dir[0][0]; y += dir[0][1];
if(x > 0) //表示没有到外墙。这个方向向上
{
if(mg[x][y] == 0) //表示有通道
{
mg[x][y] = -1;
flag = true;
tmp.x = x;
tmp.y = y;
tmp.d = -1;
sm.push(mn);
sm.push(tmp);
break; //注意此处的break不是中断if而是中断switch
}
}
break;
case 1:
x += dir[1][0]; y += dir[1][1];
if(y < MAZESIZE-1) //表示没有到外墙。这个方向向右
{
if(mg[x][y] == 0)
{
mg[x][y] = -1;
flag = true;
tmp.x = x;
tmp.y = y;
tmp.d = -1;
sm.push(mn);
sm.push(tmp);
break;
}
}
break;
case 2:
x += dir[2][0]; y += dir[2][1];
if(x < MAZESIZE-1) //表示没有到外墙。这个方向向右
{
if(mg[x][y] == 0)
{
mg[x][y] = -1;
flag = true;
tmp.x = x;
tmp.y = y;
tmp.d = -1;
sm.push(mn);
sm.push(tmp);
break;
}
}
break;
case 3:
x += dir[3][0]; y += dir[3][1];
if(y > 0) //表示没有到外墙。这个方向向右
{
if(mg[x][y] == 0)
{
mg[x][y] = -1;
flag = true;
tmp.x = x;
tmp.y = y;
tmp.d = -1;
sm.push(mn);
sm.push(tmp);
break;
}
}
break;
}
}
}
}
void printMaze(int maze[][MAZESIZE])
{
for(int i=0; i<MAZESIZE; ++i)
{
for(int j=0; j<MAZESIZE; ++j)
{
cout<<maze[i][j]<<' ';
}
cout<<endl;
}
}
void main76()
{
for(int i=0; i<100; ++i)
if(true)
{
if(i ==23) break;
}
cout<<i<<endl;
system("pause");
printMaze(mg);
findPath(1,1,8,8);
}
bool mark1[50][50][50];
int maze[50][50][50];
typedef struct N1
{
int x,y,z;
int t;
N1(int xx,int yy,int zz,int tt)
{
x =xx; y =yy; z =zz; t =tt;
}
N1(){}
}N1; //因为此处是广度优先遍历所以不需要保存其方向
int go[6][3] = {
{1,0,0},
{-1,0,0},
{0,1,0},
{0,-1,0},
{0,0,1},
{0,0,-1}
};
queue<N1> q2;
int BFS(int a,int b,int c)
{
N1 tmp;
while(!q2.empty())
{
tmp = q2.front();
q2.pop();
if(tmp.x == a-1 && tmp.y == b-1 && tmp.z == c-1)
{
return tmp.t;
}
for(int i=0; i<6; ++i)
{
int x = tmp.x + go[i][0];
int y = tmp.y + go[i][1];
int z = tmp.z + go[i][2];
if(x < 0 || x >= a || y < 0 || y >= b || z < 0 || z >= c)
continue; //避免出墙
if(mark1[x][y][z]) continue; //表示此点已经遍历过
if(maze[x][y][z] == 1) continue;
//表示此点是墙
q2.push(N1(x,y,z,tmp.t+1));
mark1[x][y][z] = true;
}
}
return 100000;
}
void main77()
{
int T;
cin>>T;
while(T--)
{
int a,b,c,t;
cin>>a>>b>>c>>t;
for(int i=0; i<a; ++i)
for(int j=0; j<b; ++j)
for(int k=0; k<c; ++k)
{
cin>>maze[i][j][k];
mark1[i][j][k] = false;
}
while(!q2.empty()) q2.pop();
mark1[0][0][0] = true;
q2.push(N1(0,0,0,0));
int ret = BFS(a,b,c);
if(ret <= t)
cout<<ret<<endl;
else cout<<"-1"<<endl;
}
}
void AtoB(int &a,int sa,int &b,int sb) //sa sb 表示的是杯子的容积， a,b表示杯子中的液体体积
{ //此函数把A杯子中的水倒入B杯子中
if(sb -b >= a) //B杯子中能够盛下A杯子的水
{
b += a;
a = 0;
}else
{
a -= (sb-b); //这两个顺序千万不能颠倒
b = sb;
}
}
int BFS1(int s,int n,int m)
{
N1 now ;
int x,y,z;
while(!q2.empty())
{
now = q2.front();
q2.pop();
x = now.x;
y = now.y;
z = now.z;
AtoB(x,s,y,n); //a倒向b
// cout<<x<<y<<z<<endl;
if(!mark1[x][y][z]) //表示这种状态没有遇到过
{
mark1[x][y][z] = true;
N1 tmp(x,y,z,now.t+1);
q2.push(tmp);
if(x == s/2 && y == s/2) return now.t+1;
if(y == s/2 && z == s/2) return now.t+1;
if(x == s/2 && z == s/2) return now.t+1;
}
x = now.x;
y = now.y;
z = now.z;
AtoB(y,n,x,s);
if(!mark1[x][y][z])
{
mark1[x][y][z] = true;
N1 tmp(x,y,z,now.t+1);
q2.push(tmp);
if(x == s/2 && y == s/2) return now.t+1;
if(y == s/2 && z == s/2) return now.t+1;
if(x == s/2 && z == s/2) return now.t+1;
}
x = now.x;
y = now.y;
z = now.z;
AtoB(x,s,z,m);
if(!mark1[x][y][z])
{
mark1[x][y][z] = true;
N1 tmp(x,y,z,now.t+1);
q2.push(tmp);
if(x == s/2 && y == s/2) return now.t+1;
if(y == s/2 && z == s/2) return now.t+1;
if(x == s/2 && z == s/2) return now.t+1;
}
x = now.x;
y = now.y;
z = now.z;
AtoB(z,m,x,s);
if(!mark1[x][y][z])
{
mark1[x][y][z] = true;
N1 tmp(x,y,z,now.t+1);
q2.push(tmp);
if(x == s/2 && y == s/2) return now.t+1;
if(y == s/2 && z == s/2) return now.t+1;
if(x == s/2 && z == s/2) return now.t+1;
}
x = now.x;
y = now.y;
z = now.z;
AtoB(y,n,z,m);
if(!mark1[x][y][z])
{
mark1[x][y][z] = true;
N1 tmp(x,y,z,now.t+1);
q2.push(tmp);
if(x == s/2 && y == s/2) return now.t+1;
if(y == s/2 && z == s/2) return now.t+1;
if(x == s/2 && z == s/2) return now.t+1;
}
x = now.x;
y = now.y;
z = now.z;
AtoB(z,m,y,n);
if(!mark1[x][y][z])
{
mark1[x][y][z] = true;
N1 tmp(x,y,z,now.t+1);
q2.push(tmp);
if(x == s/2 && y == s/2) return now.t+1;
if(y == s/2 && z == s/2) return now.t+1;
if(x == s/2 && z == s/2) return now.t+1;
}
}
return -1;
}
void main78()
{
int s,n,m;
while(cin>>s>>n>>m && s)
{
if(s%2 != 0)
{
cout<<"NO"<<endl;
continue;
}
for(int i=0; i<=s; ++i) //注意边界，此题不同于上题，上题是个图。此题是确定的体积，边界就是输出的确定数，不必-1
for(int j=0; j<=n; ++j) //此题中没有图，只需要记录状态就行了
for(int k=0; k<=m; ++k)
mark1[i][j][k] = false;
while(!q2.empty()) q2.pop();
q2.push(N1(s,0,0,0));
mark1[s][0][0] = true;
cout<<BFS1(s,n,m);
}
}
void hanoi(int n,char a,char b,char c) //把盘子借助于b从a移动到c
{
if(n==1)
cout<<a<<" --> "<<c<<endl;
else
{
hanoi(n-1,a,c,b);
cout<<a<<" --> "<<c<<endl;
hanoi(n-1,b,a,c);
}
}
__int64 hanoiIII(int n)
{
if(n == 1) return 2;
else
{
return hanoiIII(n-1)*3+2;
}
}
void main79()
{
hanoi(3,'a','b','c' );
printf("%I64d\n",hanoiIII(12));
}

转载于:https://blog.51cto.com/saibro/1184327

weixin_34289744

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
复制链接

分享到 QQ

分享到新浪微博

扫一扫