HDOJ2095 ( find your present (2) ) 【异或运算】

 

Problem : 2095 ( find your present (2) )     Judge Status : AcceptedRunId : 6068462    Language : G++    Author : qq1203456195Code Render Status : Rendered By HDOJ G++ Code Render Version 0.01 Beta

#include <stdio.h> int main() { int n,r,t; while (scanf("%d",&n),n) { r=0; while (n--) { scanf("%d",&t); r^=t; } printf("%d\n",r); } return 0; }

1 #include <stdio.h> 2 int main() 3 { 4 int n,r,t; 5 while (scanf("%d",&n),n) 6 { 7 r=0; 8 while (n--) 9 { 10 scanf("%d",&t); 11 r^=t; 12 } 13 printf("%d\n",r); 14 } 15 return 0; 16 }

转载于:https://www.cnblogs.com/CheeseZH/archive/2012/06/15/2550530.html

相关资源：数据结构—成绩单生成器