https://vjudge.net/contest/387998#problem/I
题意:
判断证明:任意进制数y,如果y%x = 0,那么 (y所有位数之和)%x = 0
思路:
思维题 可以通过观察证明
参考证明方法:https://blog.csdn.net/m0_46209312/article/details/107869765
代码:
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<bitset> #include<cassert> #include<cctype> #include<cmath> #include<cstdlib> #include<ctime> #include<deque> #include<iomanip> #include<list> #include<map> #include<queue> #include<set> #include<stack> #include<vector> #include <vector> #include <iterator> #include <utility> #include <sstream> #include <limits> #include <numeric> #include <functional> using namespace std; #define gc getchar() #define mem(a) memset(a,0,sizeof(a)) #define debug(x) cout<<"debug:"<<#x<<" = "<<x<<endl; #define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int,int> pii; typedef char ch; typedef double db; const double PI=acos(-1.0); const double eps=1e-6; const int inf=0x3f3f3f3f; const int maxn=1e5+10; const int maxm=100+10; const int N=1e6+10; const int mod=1e9+7; int main() { long long b = 0 , x = 0; int T = 0; cin >> T; while(T--) { cin >> b >> x; if (b % x == 1) { cout << "T" << endl; } else { cout << "F" << endl; } } return 0; }