洛谷 B4036 [GESP202409 二级] 数位之和

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
	LL n;
	cin >> n;
	vector<LL> arry(n,0);
	for (LL i = 0; i < n; i++) {
		cin >> arry[i];
	}
	for (LL i = 0; i < n; i++) {
		LL digt = 0, sum = 0;
		while(arry[i] > 0) {
			digt = arry[i] % 10;
			arry[i] /= 10;
			sum += digt;
		}
		if (sum % 7 == 0) {
			cout << "Yes" << endl; 
		} else {
			cout << "No" << endl;
		}
	}
	return 0;
}