B.Mask Allocation

队友签的到

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sc(a) scanf("%d",&a)
#define pf printf
#define pi acos(-1)
#define pb push_back
const int mod=1e9+7;
const int N=1e6+10;
int n,m;
int ans;
void dfs1(int x,int y)
{
	if(!y)return ;
	if(y==1){
		ans+=x;
		return ;
	}
	ans+=x/y*y;
	dfs1(y,x%y);
}
void dfs(int x,int y)
{
	if(!y)return ;
	if(y==1){
		for(int i=1;i<=x;i++)
			pf("%d ",y);
		return ;
	}
	for(int i=1;i<=x/y*y;i++)
		pf("%d ",y);
	dfs(y,x%y);
}
int main()
{
	int t;sc(t);
	while(t--)
	{
		ans=0;
		sc(n),sc(m);
		if(n%m==0){
			pf("%d\n",n);
			for(int i=1;i<=n;i++)
				pf("%d ",m);
			puts("");
		}
		else {
			if(n<m)swap(n,m);
			int x=n,y=m;
			dfs1(x,y);
			pf("%d\n",ans);
			dfs(x,y);
			puts("");
		}
	}
	return 0;
}

D.Fake News

猜结论。。。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sc(a) scanf("%d",&a)
#define pf printf
#define pi acos(-1)
#define pb push_back
const int mod=1e9+7;
const int N=1e6+10;
ll n;

int main()
{
	int t;sc(t);
	while(t--)
	{
		scanf("%lld",&n);
		if(n==1||n==24)puts("Fake news!");
		else puts("Nobody knows it better than me!");
	}
	return 0;
}