toj d.txt

ACM资料大集合

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <stdlib.h>
//#include <time.h>
using namespace std;

#define NMAX 100
char family[NMAX][100];
int num;

int cmpname(const void *a,const void *b)
{
	return strcmp((char *)(a),(char *)(b));
}

int search(char *x)
{
	char *a;
	a=(char *)(bsearch(x,family,num,sizeof(char) * 100,cmpname));
	return (a-(family[0]))/100+1;
}



int main()
{
	int i,qq;
	char ss[100];
	scanf("%d %d",&n,&qq);
	for(i=0;i<n;i++)
	{
		scanf("%s",&family[i]);
		

	}
	qsort(family,num,sizeof(char)*100,cmpname);
	for(i=1;i<num;i++)
	{
		scanf("%s",&ss);
		printf("%d",find(ss));
	}
	return 0;
}