哈尔滨理工大学软件与微电子学院第八届程序设计竞赛同步赛（高年级）

传送门

A:

#include<iostream>
#include<algorithm>
#define N 0x3f3f3f3f
#define ll long long
using namespace std;
int a[1000010];
int main()
{
	int n,m;
	cin>>n>>m;
	ll h=0;
	for(int i=1;i<=n;i++)
	{
		h+=(m+i)/7-i/7;
	}
	cout<<h<<endl;
}

C:

#include<iostream>
#include<algorithm>
#define N 0x3f3f3f3f
#define ll long long
using namespace std;
int a[10];
int main()
{
	int n,s;
	cin>>n>>s;
	int minn=N;
	for(int i=0;i<n;i++)
	{
		int c;
		cin>>c;
		minn=min(c,minn);
	}
	cout<<minn*s<<endl;
}

D:

#include<iostream>
#include<algorithm>
#define N 0x3f3f3f3f
#define ll long long
using namespace std;
int a[1010];
int cmp(int x,int y)
{
	return x>y;
}
int main()
{
	int n,s;
	cin>>n>>s;
	int minn=N;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
	}
	sort(a,a+n,cmp);
	cout<<a[2]*s<<endl;
}

I:

#include<iostream>
#include<algorithm>
#define N 0x3f3f3f3f
#define ll long long
using namespace std;
int main()
{
    ll n,m,k;
    while(cin>>n>>m>>k)
    {
    int flag1=1,flag2=1;
    int x=n/k,y=m/k;
    if(n%k!=0)
    x++;
    if(m%k!=0)
    y++;
    x=x+y;
    if(x%2)
    {
        cout<<"HAI YOU SEI!"<<endl;
    }
    else
    {
        cout<<"LAOZI CHUI SI NI!"<<endl;
    }
 	}
 	return 0;
}

J:

#include<iostream>
#include<algorithm>
#define N 0x3f3f3f3f
#define ll long long
using namespace std;
int a[10010];
int n;
int mx=50;
ll f0,f00,f2,f5,f7;
int find(int b[],int m)
{
	for(int i=1;i<=n;i++)
	{
		if(b[i]==m)
		return i-1;
	}
	return mx;
}
int find1(int b[],int m)
{
	int flag=0;
	for(int i=1;i<=n;i++)
	{
		if(b[i]==m)
		{
			flag++;
		}
		if(flag==2)
		return i-1;
	}
	return mx;
}
void di()
{
	ll minn=5000000000;
	if(f0!=50&&f00!=50)
	{
		minn=min(minn,f0+f00-1);
	}
	if(f0!=50&&f5!=50)
	{
		if(f0>f5)
		{
			minn=min(minn,f0+f5);
		}
		else
		{
				minn=min(minn,f0+f5-1);
		}
	}
	if(f2!=50&&f5!=50)
	{
		if(f5>f2)
		{
			minn=min(minn,f2+f5);
		}
		else
		{
				minn=min(minn,f2+f5-1);
		}
	}
	if(f7!=50&&f5!=50)
	{
		if(f5>f7)
		{
			minn=min(minn,f7+f5);
		}
		else
		{
				minn=min(minn,f7+f5-1);
		}
	}
	if(minn!=5000000000)
	cout<<minn<<endl;
	else
	cout<<-1<<endl;
}
int main()
{
	string s;
	while(cin>>s)
	{
	f0=f00=f2=f5=f7=mx;
	n=s.length();
	for(int i=0;i<n;i++)
	{
		a[n-i]=s[i]-'0';
		//cout<<a[n-i]<<" ";
	}
	f0=find(a,0);
	f00=find1(a,0);
	f2=find(a,2);
	f5=find(a,5);
	f7=find(a,7);
	di();
	}
	return 0;
}