zoukankan      html  css  js  c++  java
  • 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;
    }
    


    每天早上叫醒你的不是闹钟,而是心中的梦~
  • 相关阅读:
    2018年3月至4月小结
    前端面试中,经常看到垂直居中与水平居中,实际排版用的多吗?
    Hbuilder配置识别逍遥安卓模拟器
    php静态变量与方法与phar的使用
    切面反射获取方法
    Spring:源码解读Spring IOC原理
    怎样批量提取JPG照片的文件名
    如何1秒批量提取电脑文件夹中的所有文件、文件夹名字到txt/excel
    用powermock 方法中new对象
    springboot单元测试自动回滚:@Transactional
  • 原文地址:https://www.cnblogs.com/vintion/p/4117018.html
Copyright © 2011-2022 走看看