北郵oj1-5

1.A+B 2.A+B 3.single  number（位運算法） https://blog.csdn.net/sacainiao/article/details/50785964 #include<stdio.h> int main() {     int n = 0, i = 0;     unsigned long long one, two, three, num;     while

>>阅读原文<<