zoukankan      html  css  js  c++  java
  • A . Find the Twins -UCF Local Programming Contest 2015

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

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

    代码

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<bitset>
    #include<cassert>
    #include<cctype>
    #include<cmath>
    #include<cstdlib>
    #include<ctime>
    #include<deque>
    #include<iomanip>
    #include<list>
    #include<map>
    #include<queue>
    #include<set>
    #include<stack>
    #include<vector>
    #include <vector>
    #include <iterator>
    #include <utility>
    #include <sstream>
    #include <limits>
    #include <numeric>
    #include <functional>
    using namespace std;
    #define gc getchar()
    #define mem(a) memset(a,0,sizeof(a))
    //#define sort(a,n,int) sort(a,a+n,less<int>())
    
    #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<int,int> 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 <<member[i];
    			if(i<9)cout<<" ";
    			if(member[i] == 18){
    				mack = 1;
    			}
    			if(member[i] == 17){
    				zack = 1;
    			}
    		}
    		cout<<endl;
    		if(zack)
    		{
    			if(mack)
    				cout<<"both"<<endl;
    			else
    				cout<<"zack"<<endl;
    		}
    		else
    		{
    			if(mack)
    				cout<<"mack"<<endl;
    			else
    				cout<<"none"<<endl;
    		}
    		cout<<endl;
    	}
    	
        return 0;
    }
    

      

    作者:YukiRinLL

    出处:YukiRinLL的博客--https://www.cnblogs.com/SutsuharaYuki/

    您的支持是对博主最大的鼓励,感谢您的认真阅读。

    本文版权归作者所有,欢迎转载,但请保留该声明。

  • 相关阅读:
    window.clearInterval与window.setInterval的用法
    <a href=“#”>
    DIV+CSS 中的 overflow:hidden
    @media screen
    VS2010程序打包操作--超详细
    Easy CHM使用简明教程
    垃圾纸盒的叠法-超级实用
    IOS 3D UI --- CALayer的transform扩展
    CGContextAddArc
    CGPathAddArc
  • 原文地址:https://www.cnblogs.com/SutsuharaYuki/p/12443306.html
Copyright © 2011-2022 走看看