算法协会公开课第二讲

算法协会公开课第二讲

A - Pseudoprime numbers

在判断素数的基础上运用快速幂判断是否：a^p = a (mod p)，是则输出yes，不是输出no。

#include <iostream>
#include <cmath>
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;

int p, a;
int pd(int n){
    long long k=sqrt(n)+1;
    for(int i=2;i<=k;i++)
        if(n%i == 0) return 0;
    return 1;
}
ll qpow(ll m, ll k, ll p){
    ll res = 1 % p;
    while (k){
        if (k&1) res = res * m % p;
        m = m * m % p;
        k >>= 1;
    }
    return res;
}

int main(){
    ios;
    while(cin >> p >> a && (p + a)){
        if(!pd(p) && qpow(a, p, p) == a)
            cout << "yes" << '\n';
        else cout << "no" << '\n';
    }

    return 0;
}

B - Raising Modulo Numbers

这个题是典型的快速幂的应用，简单适当地运用快速幂即可通过。

#include <iostream>
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;

int T, M, H, a, b, num;
ll pow(ll m, ll k, ll p){
    ll num = 1 % p;
    while (k){
        if (k&1) num = num * m % p;
        m = m * m % p;
        k >>= 1;
    }
    return num;
}

int main(){
    cin >> T;
    while (T --){
        num = 0;
        cin >> M >> H;
        while (H --){
            cin >> a >> b;
            num = (num + pow(a, b, M)) % M;
        }
        cout << num << '\n';
    }
    return 0;
}

C - Key Set

数据比较大，运用快速幂。求{1，2，····n}用公式2^(n-1)-1求非空子集个数

#include <iostream>
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;
int n, T;
ll pow (ll m,ll k,ll p)
{
	ll num = 1 % p;
	while (k) {
		if ( k & 1)  num = num * m % p;
		m = m * m % p;
		k >>= 1;
	}
	return num;
}
int main()
{
	cin >> T;
	while(T--){
		cin >> n;
		cout << pow(2, n - 1, 1000000007 ) - 1 << '\n';
	}
	return 0;
}

D - Distribution money

这道题是听同学讲的，总钱数为x，一个人分的钱是n，那么其他的人就是x-n，若n>x-n,那么就要输出这个人的工号了。

#include <iostream>
#include <cstring>
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;
int n, x, arr[10005], fly;
int main(){
    ios;
    while (cin >> n){
        fly = 1;
        memset(arr, 0, sizeof(arr));
        for (int i = 1; i <= n; i ++){
            cin >> x;
            arr[x] ++;
        }
        for (int i = 1; i <= 10000; i ++){
            if(arr[i] > n / 2){
                cout << i << '\n';
                fly = 0;
                break;
            }
        }
        if (fly) cout << -1 << '\n';
    }
    return 0;
}

E - Rightmost Digit

运用快速幂求次方，再对10取余就可。

#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
typedef long long ll;
int N , x;

ll dpow (ll m,ll k,ll p)
{
	ll res = 1 % p;
	while (k ) {
		if(k&1)		res = res * m % p;
		m = m * m % p;
		k >>= 1;
	} 
	return res; 
}
int main ()
{
	cin>>N; 
	while (N--){
	 	cin>>x;
	 	cout<<dpow(x,x,10)<<'\n';
	}
	return 0;
}

F - 人见人爱A^B

和E题类似，运用快速幂求A的B次方，在对1000取余。

#include<cstdio>
int fastpow(int a,int b,int k){
    int ans=1;
    while(b > 0){
        if(b & 1){
            ans = ans*a%k;
        }
        b >>= 1;
        a= a*a%k;
    }
    return ans;
}
int main()
{
    int a,b;
    int sum;
    while(scanf("%d %d",&a,&b)!=EOF&&(a!=0&&b!=0)){
        sum = fastpow(a,b,1000);
        printf("%d\n",sum);
    }

    return 0;
}

G - Trailing Zeroes (III)

找零的个数的方法：一个零可以分为5*2，即想知道末尾存在几个零，只需知道末尾有几个五。运用二分查找找出五的个数即可。

#include <iostream>
#define ios ios::sync_with_stdio(false);
using namespace std;
typedef long long ll;
int T, Q, flag, x, l, r;
ll check(int m) {     
    ll cnt = 0;
    while (m) {
        cnt += m / 5;
        m /= 5;
    }
    return cnt;
}                               // 检查m的阶乘里有多少个5，即阶乘后零的个数 
int bsearch(int l, int r){
    while (l < r){
        int mid = l + r >> 1;
        if (check(mid) >= Q) r = mid;
        else l = mid + 1;
    }
    return l;
}                             //  二分法 ，确定上下限、搜索是否有符合条件即阶乘结果含Q个零的mid 
int main() {
    ios;
    cin >> T;
    flag = 1;
    while (T --) {
    	cin >> Q;
        cout << "Case " << flag ++ << ": ";
        l = 5, r = 5 * Q;
        x = bsearch(l, r);
        if (check(x) == Q)
            cout << x << '\n';
        else
            cout << "impossible\n";
    }
    return 0;
}

H - Pie

#include
#include
#include
#include
#define PI acos(-1)
using namespace std;
typedef long long ll;
const ll maxn = 1e6 + 10;

int T, N, F;
double arr[maxn];

bool judge(double x) {
int cnt = 0;
for (int i = 1; i <= N; i++) {
cnt += int(arr[i] / x);
}
return cnt >= F;
}
int main() {
cin >> T;
while (T–) {
double l = 0, r = 0, mid;
scanf("%d %d", &N, &F);
F++;
for (int i = 1; i <= N; i++) {
int R;
scanf("%d", &R);
arr[i] = R * R * PI;
r = max(r, arr[i]);
}
l = r / F;
while (r - l > 1e-5) {
mid = (l + r) / 2;
if (judge(mid))
l = mid;
else
r = mid;
}
printf("%.4lf\n", l);
}
return 0;
}

I - Can you solve this equation?

运用二分查找，不难找到x的值

#include <iostream>
#include <cmath>
using namespace std;

int T, y;
double x, l, r, mid, flag;
double check(double x){
    return 8*x*x*x*x+7*x*x*x+2*x*x+3*x+6;
}
int main(){
    cin >> T;
    while (T --){
        cin >> y;
        l = 0, r = 100, flag = -1;
        for(int i = 0; i < 100; i ++){
            mid = (l + r) / 2;
            if(abs(check(mid) - y) <= 1e-6){
                flag = mid;
                break;
            }
            else if(check(mid) > y)
                r = mid;
            else l = mid;
        }
        if(flag == -1)
            printf("No solution!\n");
        else
            printf("%.4lf\n",flag);
    }
    return 0;
}

J - Subsequence

二分题，先做前缀和，，再用二分查找子序列的终点，取最小长度即可。

#include <iostream>
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

int T, arr[100005], n, S, flag;
int main() {
    ios;
    cin >> T;
    while (T --) {
        cin >> n >> S;
        flag = n + 1;
        for (int i = 1; i <= n; i++) cin >> arr[i];
        int s = 1, t = 1, sum = 0;
        while (1) {
            while (t <= n && sum < S)
                sum += arr[t++];
            if (sum < S)
                break;
            flag = min(flag, t - s);
            sum -= arr[s++];
        }
        if (flag == n + 1)
            cout << 0 << '\n';
        else cout << flag << '\n';
    }
    return 0;
}