Codeforces Round #818 (Div. 2) 参考代码_codeforces 代码示例-CSDN博客

本文提供了Codeforces Round #818 (Div. 2) 比赛中，题目A到E的详细解题思路和C++参考代码，包括Madoka遇到的奇怪想法、地下竞赛、正式声明、腐败计划以及最佳大学问题。

A. Madoka and Strange Thoughts

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
    return x*f;
}

void solve()
{
	ll n;scanf("%lld",&n);
	printf("%lld\n",((n/3)*3+((n/2)-(n/3))*2+(n-(n/2)))*2-n);
}

int main()
{
	int T=read();
	while(T--)solve();
	return 0;
}

B. Madoka and Underground Competitions

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
    return x*f;
}

void solve()
{
	char ans[600][600];
	string a[600],b[600];
	int n=read(),k=read(),r=read(),c=read();
	int d=(((c-1)-(r-1)%k)+k)%k;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			if((j-1)%k==d)printf("X");
			else printf(".");
		}
		printf("\n");
		d++;
		if(d==k)d=0;
	}
	
}

int main()
{
	int T=read();
	while(T--)solve();
	return 0;
}

C. Madoka and Formal Statement

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
    return x*f;
}
const int N=2e5+10;
int a[N],b[N];
void solve()
{
	int n=read();
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=n;i++)b[i]=read();
	for(int i=1;i<=n;i++)
	{
		if(a[i]>b[i])
		{
			printf("NO\n");
			return;
		}
		if(a[i]==b[i])continue;
		int x=i+1;
		if(x==n+1)x=1;
		if(b[i]>b[x]+1)
		{
			printf("NO\n");
			return;			
		}
	}
	printf("YES\n");
}

int main()
{
	int T=read();
	while(T--)solve();
	return 0;
}

D. Madoka and The Corruption Scheme

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
    return x*f;
}

ll quickpow(ll a,ll b)
{
    ll s=1;
    while(b)
    {
        if(b&1)s=s*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    
    return s;
}
const int N=1e5+10;
ll in[N],nin[N],c[N];
void solve()
{
	int n=read(),k=read();
	in[0]=nin[0]=1;
	for(int i=1;i<=n;i++)in[i]=in[i-1]*i%mod;
	nin[n]=quickpow(in[n],mod-2);
	for(int i=n-1;i>=1;i--)nin[i]=nin[i+1]*(i+1)%mod;
	for(int i=0;i<=n;i++)c[i]=in[n]*nin[i]%mod*nin[n-i]%mod;
	ll ans=0;
	for(int i=0;i<=min(n,k);i++)ans=(ans+c[i])%mod;
	printf("%lld\n",ans);
}

int main()
{
	int T=1;
	while(T--)solve();
	return 0;
}

E. Madoka and The Best University

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
    return x*f;
}
const int N=1e5+10;
ll n;
ll m[N],phi[N],p[N];
void init()
{
	int nump=0;
    phi[1]=1;
    for (int i=2;i<=n;i++)
    {
        if (!m[i])//i为素数
        {
            p[++nump]=i;//将i加入素数数组p中
            phi[i]=i-1;//因为i是素数,由特性得知    
        }    
        for (int j=1;j<=nump&&p[j]*i<=n;j++)  //用当前已得到的素数数组p筛,筛去p[j]*i
        {
            m[p[j]*i]=1;//可以确定i*p[j]不是素数 
            if (i%p[j]==0) //看p[j]是否是i的约数,因为素数p[j],等于判断i和p[j]是否互质 
            {
                phi[p[j]*i]=phi[i]*p[j]; //特性2
                break;
            }
            else phi[p[j]*i]=phi[i]*(p[j]-1); //互质,特性3其,p[j]-1就是phi[p[j]]   
        }
	}
	phi[1]=0;
}
ll gcd1(ll x,ll y){return y==0?x:gcd1(y,x%y);}
void solve()
{
	scanf("%lld",&n);
	init();
//	for(int i=1;i<=n;i++)cout<<phi[i]<<" ";
//	cout<<endl;
	ll ans=0;
	for(ll gcd=1;gcd<=n;gcd++)
	{
		for(ll i=1;i*gcd<=n;i++)
		{
			ll c=n-gcd*i;
			ll lcm=c/gcd1(c,gcd)*gcd%mod;
			//cout<<lcm<<endl;
			ans=(ans+lcm*phi[i]%mod)%mod;
		}
	}
	printf("%lld\n",ans);
}

int main()
{
	int T=1;
	while(T--)solve();
	return 0;
}