选拔赛题目

这个随机函数：

#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;
#define LL long long

int main()
{
int n;
while(cin >> n)
{
	bool h1,h0;
	h1 = h0 = false;
	int temp;
	for(int i = 0;i<n;i++)
	{
		scanf("%d",&temp);
		if(temp==0)
		h0 = true;
		if(temp==1)
		h1 = true;
	}
	if(h1 && h0)
	{
		printf("YES\n");
		
	}
	else
	{
		printf("NO\n"); 
	}
}
	return 0;
}

我是飙车王：

#include<stdio.h>
#define LL long long
int dat[1000005];
int main()
{
//	freopen("5.in","r",stdin);
//	freopen("5.out","w",stdout);
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		for(int i = 1;i<=n;i++)
		{
			scanf("%d",&dat[i]);
		}
		dat[0] = 0;
		LL ctime = 0;
		double speed = 0;
		for(int i = n;i>0;i--)
		{
			int space = dat[i]-dat[i-1];
			if(i==n)
			{
				speed = space;
				ctime++;
				continue;
			}
			double getint = space/speed;
			if(getint == (int)getint)
			{
				ctime += getint;
			}
			else
			{
				if(space<=speed)
				{
					speed = space;
					ctime++;
				}
				else
				{
					int k = 1;
					while(space*1.0/k > speed)
					{
						k++;
					}
					speed = space*1.0/k;
					ctime+=k;
				}
			}
			
		}
		printf("%lld\n",ctime);
	}

	return 0;
}

同城交友：

#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;
#define LL long long
LL findnum(int n,int m)
{
	if(m==0)
	return 1;
	return findnum(n,m-1)*(n-m+1)/m;
 } 
int main()
{
	int a,b;
	while(scanf("%d%d",&a,&b)!=EOF)
	{
		LL ans = findnum(a+b,a)-2;
		printf("%lld\n",ans);
	}
	return 0;
}

疯狂的老伙计：

#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;
#define LL long long

int main()
{
	LL a,b;
	LL c;
	while(scanf("%lld%lld%lld",&a,&b,&c)!=EOF)
	{
		printf("%lld\n",(a%c)*(b%c)%c);
	}
	return 0;
}

翻转棋升级版：

#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;
#define LL long long

int main()
{
	int n,m,t;
	while(scanf("%d%d%d",&n,&m,&t)!=EOF)
	{
		int r[10005] = {0};
		int c[10005] = {0};
		for(int i = 0;i<t;i++)
		{
			int a,b;
			scanf("%d%d",&a,&b);
			r[a] = (r[a]+1)%2;
			c[b] = (c[b]+1)%2;
		}
		int num = 0;
		for(int i = 1;i<=n;i++)
		num += r[i];
		int ans = 0;
		for(int i = 1;i<=m;i++)
		{
			if(c[i]%2==1)
			{
				ans+=num;
			}
			else
			{
				ans+=(n-num);
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}

乐乐的烦劳之平均：

#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;
#define LL long long

int main()
{
	//freopen("3.in","r",stdin);
	int t;
	cin >> t;
	int _case = 0;
	while(t--)
	{
		int n,k;
		cin >> n >> k;
		LL dat[100005];
		LL sum = 0;
		for(int i = 0;i<n;i++)
		{
			scanf("%lld",&dat[i]);
			sum += dat[i];
		}
		
		if(sum%k!=0)
		{
			printf("Case %d: -1\n",++_case);
			continue;
		}
		LL avg = sum/k;
		LL count = 0;
		LL last = 0;
		for(int i = 0;i<n;i++)
		{
			if(last!=0)
			{
			//	printf("%d %d case\n",last,dat[i]);
				dat[i]+=last;
				last = 0;
				count++;
			}
			if(dat[i]%avg!=0)
			{
				last = dat[i]%avg;
				if(dat[i]/avg>0)
				count+= dat[i]/avg;
				//printf("count = %d\n",count);
			//	printf("%lld\n",count);
			}
			else
			{
				last = 0;
				if(dat[i]/avg>0)
				count+=dat[i]/avg-1;
			}
		}
		printf("Case %d: %lld\n",++_case,count);
		
	}
	return 0;
}

贼娃子喵星人：

#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;
#define LL long long

int main()
{
	int n,l;
//	freopen("2.in","r",stdin);
//	freopen("2.out","w",stdout);
	while(cin >> n >> l)
	{
		LL dp[105] = {0};
		dp[0] = 1;
		for(int i = 1;i<n;i++)
		{
			for(int j = i-1;j>=0;j--)
			{
				dp[i] = (dp[i]+dp[j])%23333;
			}
		}
		for(int i = n;i<=l;i++)
		{
			for(int j = i-1;j>=i-n;j--)
			{
				dp[i] = (dp[i]+dp[j])%23333;
			}
		}
		printf("%lld\n",dp[l]);
	}
	return 0;
}

机不告诉你题目

#include<stdio.h>
#include<string.h>
int main()
{
    char str[105];
    while(scanf("%s",str)!=EOF)
    {
        int i,len=strlen(str),sum=0;
        for(i=0;i<len;i++)
        {
            if(str[i]!='-') sum+=str[i]-'0';
        }
        printf("%d\n",sum);
    }
    return 0;
}