HDU4768 Flyer

Flyer

问题描述 :

The new semester begins! Different kinds of student societies are all trying to advertise themselves, by giving flyers to the students for introducing the society. However, due to the fund shortage, the flyers of a society can only be distributed to a part of the students. There are too many, too many students in our university, labeled from 1 to 2^32. And there are totally N student societies, where the i-th society will deliver flyers to the students with label A_i, A_i+C_i,A_i+2*C_i,…A_i+k*C_i (A_i+k*C_i<=B_i, A_i+(k+1)*C_i>B_i). We call a student "unlucky" if he/she gets odd pieces of flyers. Unfortunately, not everyone is lucky. Yet, no worries; there is at most one student who is unlucky. Could you help us find out who the unfortunate dude (if any) is? So that we can comfort him by treating him to a big meal!

输入:

There are multiple test cases. For each test case, the first line contains a number N (0 < N <= 20000) indicating the number of societies. Then for each of the following N lines, there are three non-negative integers A_i, B_i, C_i (smaller than 2^31, A_i <= B_i) as stated above. Your program should proceed to the end of the file.

输出:

There are multiple test cases. For each test case, the first line contains a number N (0 < N <= 20000) indicating the number of societies. Then for each of the following N lines, there are three non-negative integers A_i, B_i, C_i (smaller than 2^31, A_i <= B_i) as stated above. Your program should proceed to the end of the file.

样例输入:

2
1 10 1
2 10 1
4
5 20 7
6 14 3
5 9 1
7 21 12

样例输出:

1 1
8 1

#include <iostream>

using namespace std;
const int N = 20010;

long long a[N], b[N], c[N];

int main(){
    int n;
    while(cin>>n){
        long long num = 0;
        for(int i = 1; i <= n; i++){
            cin>>a[i]>>b[i]>>c[i];
            for(long long j = a[i]; j <= b[i]; j+=c[i]){
                num ^= j;
            }
        }
        long long sum = 0;
        for(int i = 1; i <= n; i++){
            if((num-a[i])%c[i]==0 && (num>=a[i])&&(num<=b[i]))
                sum++;
        }
        if(num==0){
             cout<<"DC Qiang is unhappy."<<endl;
            continue;
        }
        cout << num << " " << sum << endl;
    }
    return 0;
}