zoukankan      html  css  js  c++  java
  • find your present (2)

    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

    解释:

    只有一个数字出现了奇数次,然后需要找到这个数字。异或,异或,异或就可以了

     1 #include<stdio.h>
     2 int main()
     3 {
     4      int a,b,c,d,i;
     5      while(1)
     6      { 
     7      b=0;
     8      scanf("%d",&a);
     9      if(a==0)break;
    10         
    11         for(i=0;i<a;i++)
    12         { scanf("%d",&c);
    13         b=b^c;
    14            }  
    15            printf("%d
    ",b);
    16 }
    17 return 0;
    18 }
    View Code
  • 相关阅读:
    Django目录介绍、路由系统、 ORM表的创建、XSS攻击、分页、 CBV & FBV
    正宗Django框架(Bootstrap 、Django母版、Cookie)
    索引快速查询
    前端学习之jquery
    关于vertical-align和line-height的真知灼见
    js BOM对象 DOM对象
    JS基础学习(一)
    html5实现尖角号
    装饰器
    Win8.1离线安装.Net Framework 3.5
  • 原文地址:https://www.cnblogs.com/gznb/p/11213654.html
Copyright © 2011-2022 走看看