Panasonic Programming Contest (AtCoder Beginner Contest 195) A--C

只AC了三个？？？
是的，只AC了三个，因为今天实在是太疲惫了，上午打蓝桥，中午做科创，下午打CF，晚上打AT,再加上最近没休息好，打到最后我连读题的力气都没有了

连接

A - Health M Death

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
#define ll long long
#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
#define pi acos(-1.0)
using namespace std;
const int mod=1e9+7;
const int M=5e6+5;
const int N=4*1e5+5;//?????????? 4e8
int n,m;
void solve()
{
	cin>>n>>m;
	if(m%n==0)  puts("Yes");
	else  puts("No");
}
signed main()
{
	solve();
    return 0;
}

B - Many Oranges

三层循环会超时，所以可以采取exgcd的方式去做（代码略丑，见谅）

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
#define ll long long
//#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
#define pi acos(-1.0)
using namespace std;
const int mod=1e9+7;
const int M=5e6+5;
const int N=4*1e5+5;//?????????? 4e8
int n,m,w,t;
int ans=1<<30,cnt,flag;
int exgcd(int a,int b,int &x,int &y)
{
	if(!b){x=1,y=0;return a;}
	int d=exgcd(b,a%b,x,y);
	int z=x;
	x=y;
	y=z-y*(a/b);
	return d;
}
void solve()
{
	cin>>n>>m>>w;
	w*=1000;
	for(int i=n;i<=m;i++)  for(int j=n;j<=m;j++)
	{
		if(i==j)
		{
			if(w%i==0)
			{
				ans=min(ans,w/i);
				cnt=max(cnt,w/i); 
			}
			continue;
		}
		int x,y;
		int d=exgcd(i,j,x,y);
		if(w%d!=0)  continue;
		int a=w/d;
		int b=j/d;
		int c=i/d;
		int k1=-a*x/b;
		int k2=a*y/c;
		if(a*x+k1*b<0)  k1++;
		if(a*y-k2*c<0)  k2--;
		if(a*y-k1*c>=0)  ans=min(ans,a*x+k1*b+a*y-k1*c);
		if(a*x+k2*b>=0)  cnt=max(cnt,a*x+k2*b+a*y-k2*c);
	}
	if(!cnt)
	{
		puts("UNSATISFIABLE");
		return;
	}
	cout<<ans<<" "<<cnt<<endl;
}
signed main()
{
	solve();
    return 0;
}

C - Comma

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
#define ll long long
#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
#define pi acos(-1.0)
using namespace std;
const int mod=1e9+7;
const int M=5e6+5;
const int N=4*1e5+5;//?????????? 4e8
int n;
int a[10]={1000000000000000,1000000000000,1000000000,1000000,1000};
void solve()
{
	cin>>n;
	int ans=0;
	for(int i=0;i<=4;i++)  ans+=max(n-a[i]+1,(int)0);
	cout<<ans<<endl;
}
signed main()
{
//	ios::sync_with_stdio(false);
//	cin.tie(0);cout.tie(0);	
	solve();
    return 0;
}