C++：判断一个数能否被3,5,7整除各种情况的高效表示

//来自于C++程序设计教程习题及解答0406–钱能

#include<iostream>
#include<fstream>
using namespace std;
int main(){
	ifstream in("abc.txt");
	int d;
	while (in >> d){
		switch ((!(d % 7) << 2) + (!(d % 5) << 1) + (!(d % 3))){
			//**此处的精妙点在于只用了三次求余，把每次求余的结果组合成一个
			//三位二进制数来恰好表示所需要的八种情况**
		case 0:cout << d << "-->none\n"; break;
		case 1:cout << d << "-->3\n"; break;
		case 2:cout << d << "-->5\n"; break;
		case 3:cout << d << "-->3,5\n"; break;
		case 4:cout << d << "-->7\n"; break;
		case 5:cout << d << "-->3,7\n"; break;
		case 6:cout << d << "-->5,7\n"; break;
		case 7:cout << d << "-->3,5,7\n"; break;
		}
	}
	int aa; cin >> aa;
}