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

    2095 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

    #include <stdio.h>
    #include <string.h>
    #include <stdlib.h>
    int main()
    {
        int n,m;
        int my_present;
        while(scanf("%d",&n),n)
        {
            scanf("%d",&m);
            my_present = m;
            for(int i =1;i < n;i++)
            {
                scanf("%d",&m);    
                my_present^=m;//异或寻找不同的特殊值
            }
            printf("%d
    ",my_present);
        }
    }
  • 相关阅读:
    1:4 UI标签和通用标签
    1:3访问 servlet API 的两种方式(request,session等内置对象)
    1 :2 Strust2—Demo
    1:1 Struts2概述
    mysql索引原理与慢查询优化1
    mysql流程控制
    mysql函数
    mysql存储过程
    mysql事务
    mysql触发器
  • 原文地址:https://www.cnblogs.com/cheng07045406/p/3187620.html
Copyright © 2011-2022 走看看