2179.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2179 on 2006-03-21 at 13:51:38 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int R_MAX = 1024;

class Rotate {
public:
	int b, e;
	void make();
	int act(int) const;
};
void Rotate::make() {
	scanf("%d %d", &b, &e);
}
int Rotate::act(int p) const {
	if(p < b || p > e) return p;
	else return e+b-p;
}

int main()
{
	Rotate r[R_MAX];
	int t, i, j, n;
	
	for(t = 1; scanf("%d", &n) != EOF && n != 0; t++) {
		int rn; scanf("%d", &rn);
		for(i = 0; i < rn; i++) r[i].make();
		printf("Genome %d\n", t);
		int qn; scanf("%d", &qn);
		for(i = 0; i < qn; i++) {
			int p; scanf("%d\n", &p);
			for(j = 0; j < rn; j++) p = r[j].act(p);
			printf("%d\n", p);
		}
	}
	
	return 0;
}