STL经典例题练习

B - Ignatius and the Princess II

#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1010;
int a[N];
int main()
{
int n,m;
while(cin>>n>>m)
{
for(int i=1;i<=n;i++) a[i]=i;
int cnt=1;
while(cnt!=m)
{
next_permutation(a+1,a+n+1);
cnt++;
}
for(int i=1;i<=n;i++) cout<<a[i]<<(i!=n?" ":"");
cout<<endl;
}
}

D - Where is the Marble? 

#include<bits/stdc++.h>
using namespace std;
const int N = 10010;
int a[N];
int main()
{
int n,m;
int id=1;
while(cin>>n>>m,n||m)
{
cout<<"CASE# "<<id++<<":"<<endl;
for(int i=1;i<=n;i++) cin>>a[i];
sort(a+1,a+1+n);
while(m--)
{
int x;
cin>>x;
bool flag=0;
for(int i=1;i<=n;i++)
{
if(x==a[i])
{
printf("%d found at %d\n",x,i);
flag=1;
break;
}
}
if(!flag) printf("%d not found\n",x);
}
}
}

 

E - Andy's First Dictionary

#include<iostream>
#include<string>
#include<set>
#include <ctype.h>
using namespace std;
int main()
{
	set<string>dic;
	string s1;
	while(cin>>s1)
	{
		string word;
		word.clear();
		for(int i=0;i<s1.length();i++)
		{
			if(isalpha(s1[i]))
			{
				word+=tolower(s1[i]);
			}
			else
			{
				if(word.size()>0)
				{
					dic.insert(word);
					word.clear();
				}
			}
		}
		if(word.size()>0)
		{
			dic.insert(word);
			word.clear();
		}
	}
	for(auto x:dic)
	cout<<x<<"\n";
}