2257061_wa.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>

char str[1000001];
struct node
{
	char ch;
	long p;
}Ins[2001];
int l = 0;

int main()
{
	int i, j, n, mark;
	long p;
	char com[2], ch;

	scanf("%s%d",str,&n);
	for(i = 0; i < n; i++)
	{
		scanf("%s",com);
		if(com[0]=='I')
		{
			scanf("%s%ld",com,&p);
			Ins[l].ch = com[0];
			Ins[l].p = p;
			l++;
		}
		else
		{
			scanf("%ld",&p);
			mark = 0;
			for(j = 0; j < l; j++)
			{
				if(Ins[j].p<p)
					p--;
				else
					if(Ins[j].p==p)
					{
						mark = 1;
						ch = Ins[j].ch;
					}
			}
			if(mark)
				printf("%c\n",ch);
			else
				printf("%c\n",str[p-1]);
		}
	}
	return 1;
}