zoukankan      html  css  js  c++  java
  • find your present

    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
    
    
    #include<stdio.h>
    void main()
    {
        long n,x,y,i;
        while(scanf("%ld",&n)==1 && n)
        {
            x=0;
            for(i=0;i<n;i++)
            {
                scanf("%ld",&y);
                x^=y;
            }
            printf("%ld
    ",x);
        }
    
    }
    选择了远方,便只顾风雨兼程
  • 相关阅读:
    FastDFS
    MYSQL日常操作
    SVN安装
    mysql主主配置
    MySQL优化
    nginx反向代理tomacat+keepalived实现动静分离、负载均衡、高可用
    nginx故障及处理
    nginx配置检测及安全配置
    nginx基本优化
    大金空调适配器
  • 原文地址:https://www.cnblogs.com/ly-rabbit-wust/p/5575681.html
Copyright © 2011-2022 走看看