牛客多校第七场

B-Mask Allocation

题意及分析

分析

#include<bits/stdc++.h> 
using namespace std;

vector<int> q;
void dfs(int n, int m) {
	if(m == 0) return;
	for(int i = 0; i < n/m*m; i ++) {
		q.push_back(m);
	}
	dfs(max(n%m, m), min(n%m, m));
} 
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t,n,m;
	cin>>t;
	while(t--) {
		q.clear();
		cin>>n>>m;
		dfs(max(n,m), min(m,n));
		
		int len = q.size();
		cout<<len<<endl;
		for(int i = 0; i < len; i ++)
			cout<<q[i]<<" ";
		cout<<endl;
	}
	return 0;
}

D-Fake News

题意及分析

代码

#include<bits/stdc++.h> 
using namespace std;
const double eps = 1e-6;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t;
	long long n;
	cin>>t;
	while(t--) {
        scanf("%lld", &n);
        if (n == 1 || n == 24)
            printf("Fake news!\n");
        else
           printf("Nobody knows it better than me!\n");

		/*if(f)
			cout<<"Fake news!"<<endl;
		else
			cout<<"Nobody knows it better than me!"<<endl;*/
	}
	return 0;
}

H-Dividing

代码

#include<bits/stdc++.h>
using namespace std;

long long n, k;
void Solve() {
    scanf("%lld %lld",&n, &k);
    long long last = 1, res = k - n;
    res = (res + mod) % mod;
    for(long long i = 1; i <= k && i <= n; i = last + 1ll) {
        last = n / (n / i);
        if(last > k) {
            last = k;
        }
        long long tmp = 1ll * (last - i + 1) % mod * ((n / i) % mod) % mod;
        tmp %= mod;
        res += tmp;
        res %= mod;
    }
    -- n;
    for(long long i = 1; i <= k && i <= n; i = last + 1ll) {
        last = n / (n / i);
        if(last > k) {
            last = k;
        }
        long long tmp = 1ll * (last - i + 1) % mod * ((n / i) % mod) % mod;
        tmp %= mod;
        res += tmp;
        res %= mod;
    }
    printf("%lld\n", res);
}

int main()
{
    solve();
    return 0;
}