前言
整数幂
思路 :
暴力
code :
void solve(){
ll k,l;cin>>k>>l;
while(l%k == 0 && l ){
l/=k;
}
if(l == 1) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
. 变成1
模拟
code :
void solve(){
string s;cin>>s;
int len = s.size();
int cnt =0 ;
//最后一位1 也即是2^0
while(len!=1){
++cnt;
if(s[len - 1] == '0') len -- ;
else{
for(int i = len-1;i>=0; i-- ){
if(s[i] == '1') s[i] = '0';//会一直进行+1 操作
else{
s[i] = '1';
break;
}
}
}
}
if(s[0] == '0') cnt++;
cout<<cnt<<endl;
}
最大公约数
数学
code :
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL T;
LL _gcd(LL a, LL b)
{
if (b == 0) return a;
return _gcd(b, a % b);
}
LL phi(LL n)
{
LL res = n;
for (int i = 2; i <= n / i; i ++ )
{
if (n % i == 0) res = res / i * (i - 1);
while (n % i == 0) n /= i;
}
if (n > 1) res = res / n * (n - 1);
return res;
}
int main()
{
scanf("%lld", &T);
while (T -- )
{
LL a, m;
scanf("%lld %lld", &a, &m);
LL gcd = _gcd(a, m);
LL ans = phi(m / gcd);
printf("%lld\n", ans);
}
return 0;
}