A.Social Distancing

B.Mask Allocation

const int N=1e6+10;
const int mod=1e9+7;
int n,m,k;
int main(){
    int T,x,y;
    scanf("%d",&T);
    while (T--){
        scanf("%d%d",&n,&m);
        if (n>m)swap(n,m);
        queue<int>q;
        while (n!=0&&m!=0){
            for (int i=1;i<=m/n*n;i++){
                q.push(n);
            }
            m=m%n;
            swap(n,m);
        }
        printf("%d\n",q.size());
        while (!q.empty()){
            printf("%d ",q.front());
            q.pop();
        }
        puts("");
    }
    return 0;
}
 

C.A National Pandemic

D.Fake News

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

E.NeoMole Synthesis

F.Tokens on the Tree

G.Topo Counting

H.Dividing

typedef long long ll;
const int mod=1e9+7;
int main(){
    ll n,k;
    scanf("%lld%lld",&n,&k);
    ll ans=0;
    for(ll l=1,r;l<=min(n,k);l=r+1){
        r=min(n/(n/l),min(n,k));
        ans+=(r-l+1)*(n/l);
    }
    for(ll l=1,r;l<=min(n-1,k);l=r+1){
        r=min((n-1)/((n-1)/l),min(n-1,k));
        ans+=(r-l+1)*((n-1)/l);
    }
    printf("%lld\n",((ans-(n-1)+k-1)%mod+mod)%mod);
    return 0;
}
 

I.Valuable Forests

J.Pointer Analysis