POJ 1006 Biorhythms (入门)

POJ 1006


#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main() {
	int p, e, i, d;
	int n = 1;
	while(~scanf("%d %d %d %d", &p, &e, &i, &d)) {
		if(p == -1 && e == -1 && i == -1 && d == -1) break;
		p %= 23, e %= 28, i %= 33;
		int j;
		for(j = 1; j <= 21252; j++) {
			if((j + d) % 23 == p && (j + d) % 28 == e && (j + d) % 33 == i) {
				printf("Case %d: the next triple peak occurs in %d days.\n", n++, j);
				break;
			}
		}
	}
	return 0;
}


你可能感兴趣的:(POJ 1006 Biorhythms (入门))