B:Basic Gcd Problem
观察公式,fc (x) 是 c 的若干次方,且指数要尽量大,即n经过尽可能多的到1
如6:
6->1: c
6->3->1:c^2
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int mod=1e9+7;
int p[1000100];
void pr()
{
p[1]=1;
for(int i=2;i<=1000000;i++)
if(p[i]==0)
{
for(int j=i;j<=1000000;j+=i)
if(p[j]==0)
p[j]=i;
}
}
ll qp(ll x,int y)
{
ll ans=1;
while(y)
{
if(y%2) ans=(ans*x)%mod;
y/=2;x=(x*x)%mod;
}
return ans;
}
int main()
{
ios::sync_with_stdio(false);
int t,n,sum;
ll c;
pr();
cin>>t;
while(t--)
{
sum=0;
cin>>n>>c;
while(n!=1)
{
n/=p[n];sum++;
}
cout<<qp(c,sum)<<endl;
}
return 0;
}
F:Finding the Order
三角形任意两边之和大于第三边
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios::sync_with_stdio(false);
int t,AC,AD,BC,BD;
cin>>t;
while(t--)
{
cin>>AC>>AD>>BC>>BD;
if(AD+BC>AC+BD)
cout<<"AB//CD"<<endl;
else cout<<"AB//DC"<<endl;
}
return 0;
}
H:Harder Gcd Problem
容易得到m=(n-1-所有大于n/2的质数)/2
难在怎么构造一一配对关系
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int p[200100],ans[200100],bo[200100],a[200100];
int ok(int x)
{
for(int i=2;i*i<=x;i++)
if(x%i==0)
return 0;
return 1;
}
int main()
{
ios::sync_with_stdio(false);
int t,n,m,sum;
p[1]=1;ans[1]=1;
for(int i=2;i<=200100;i++)
{
ans[i]=ans[i-1];
if(ok(i))
{
p[i]=1;ans[i]++;
}
}
cin>>t;
while(t--)
{
cin>>n;
m=(n-(ans[n]-ans[n/2]+1))/2;
cout<<m<<endl;
memset(bo,0,sizeof(bo));
for(int i=n/2;i>=2;i--)
if(p[i])
{
sum=0;
for(int j=i;j<=n;j+=i)
if(bo[j]==0)
{
sum++;
a[sum]=j;
}
if(sum%2==0)
{
for(int i=1;i<=sum;i+=2)
{
cout<<a[i]<<" "<<a[i+1]<<endl;
bo[a[i]]=bo[a[i+1]]=1;
}
}
else
{
if(sum>2)
{
cout<<a[1]<<" "<<a[3]<<endl;
bo[a[1]]=bo[a[3]]=1;
}
for(int i=4;i<=sum;i+=2)
{
cout<<a[i]<<" "<<a[i+1]<<endl;
bo[a[i]]=bo[a[i+1]]=1;
}
}
}
}
return 0;
}