• hdu2095


    说明:

    1. a^a=0, 0^a=a

    2. 如果一组数中,只有一个是奇数个,那么全部异或后就找出来了


    /*
     * =====================================================================================
     *
     *       Filename:  hdu2095.c
     *
     *    Description:  
     *
     *        Version:  1.0
     *        Created:  2013年11月19日 11时58分34秒
     *       Revision:  none
     *       Compiler:  gcc
     *
     *         Author:  Wenxian Ni (Hello World~), niwenxianq@qq.com
     *   Organization:  AMS/ICT
     *find your present (2)
    
    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/1024 K (Java/Others)
    Total Submission(s): 13411    Accepted Submission(s): 5047
    
    
    Problem Description
    In the new year party, everybody will get a "special present".Now it's your turn to get your special present, a lot of presents now putting on the desk, and only one of them will be yours.Each present has a card number on it, and your present's card number will be the one that different from all the others, and you can assume that only one number appear odd times.For example, there are 5 present, and their card numbers are 1, 2, 3, 2, 1.so your present will be the one with the card number of 3, because 3 is the number that different from all the others.
     
    
    Input
    The input file will consist of several cases. 
    Each case will be presented by an integer n (1<=n<1000000, and n is odd) at first. Following that, n positive integers will be given in a line, all integers will smaller than 2^31. These numbers indicate the card numbers of the presents.n = 0 ends the input.
     
    
    Output
    For each case, output an integer in a line, which is the card number of your present.
     
    
    Sample Input
    5
    1 1 3 2 2
    3
    1 2 1
    0
     
    
    Sample Output
    3
    2
    
    Hint
    Hint
     
    use scanf to avoid Time Limit Exceeded
     * =====================================================================================
     */
    
    #include <stdio.h>
    
    int main()
    {
    	int n,s,a;
    	while(scanf("%d",&n),n) {
    		s = 0;
    		while(n--) {
    			scanf("%d",&a);
    			s ^= a;
    		}
    		printf("%d
    ",s);
    	}
    	return 0;
    }
    


    每天早上叫醒你的不是闹钟,而是心中的梦~
  • 相关阅读:
    python 协程
    python 进程池的使用
    python 多进程数据交互及共享
    python 多进程
    技术博客与技术日记
    理解闭包
    jWriter一个基于jQuery的阅读写作网站的效果库
    ubuntu下phpmyadmin配置问题解决
    避免明文保存用户密码
    如何用css实现类似简书的纵向导航/竖排导航
  • 原文地址:https://www.cnblogs.com/vintion/p/4117018.html
Copyright © 2020-2023  润新知