Dinner
Time limit 1000 ms Memory limit 32768 kB
3 basketball fork chopsticks
2 bowl letter
Sample Output
fork chopsticks
bowl
Hint
The tableware only contains: bowl, knife, fork and chopsticks.
題解:題意很簡單,就是單純的字符串比較和輸出,這裏我用了map容器……
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<stdlib.h>
#include<time.h>
#include<string>
#include<math.h>
#include<map>
#include<queue>
#include<stack>
#define INF 0x3f3f3f3f
#define ll long long
#define For(i,a,b) for(int i=a;i<b;i++)
#define sf(a) scanf("%d",&a)
#define sff(a,b) scanf("%d%d",&a,&b)
#define pf(a) printf("%d\n",a)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
char x[100];
int main()
{
int n;
map<string,int>m;
m.clear();
m["bowl"]=1;m["knife"]=1,m["fork"]=1,m["chopsticks"]=1;
while(~sf(n))
{
int flag=0;
For(i,0,n)
{
scanf("%s",x);
if(m[x]==1)
{
if(flag)
printf(" %s",x);
else
printf("%s",x);
flag=1;
}
}
printf("\n");
}
}