A . Find the Twins -UCF Local Programming Contest 2015

https://nanti.jisuanke.com/t/43386

A . Find the Twins -UCF Local Programming Contest 2015_第1张图片

A . Find the Twins -UCF Local Programming Contest 2015_第2张图片

水题 zack和mack有对应的球员数字 从序列中找出是否存在

代码

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
#define gc getchar()
#define mem(a) memset(a,0,sizeof(a))
//#define sort(a,n,int) sort(a,a+n,less())

#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair pii;
typedef char ch;
typedef double db;

const double PI=acos(-1.0);
const double eps=1e-6;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
const int maxn=1e5+10;
const int maxm=100+10;


bool compare(int a, int b)
{
	return a < b;//升序
}


int member[10] = {0};
int main(){
	int n = 0;
	cin >> n;
	bool zack = 0;
	bool mack = 0;
	while(n--)
	{
		zack = 0;
		mack = 0;
		for(int i = 0;i<10;i++)
		{
			cin >>member[i];
		}
		for(int i = 0;i<10;i++)
		{
			cout <

  

你可能感兴趣的:(A . Find the Twins -UCF Local Programming Contest 2015)