user-0 提问: 百度面试题

回复:
user: user-1
content: 我能够弱弱的问一下： 能够for循环使用stl的count函数实现吗？

user: user-2
content: 数据样本2000个： 41,67,134,100,169,124,78,158,162,64,105,145,81,27,161,91,195,142,27,36,191,4,102 ,153,92,182,21,116,118,95,47,126,171,138,69,112,67,99,35,94,103,11,122,133,73,64 ,141,111,53,68,147,44,62,157,37,59,123,141,129,178,116,35,190,42,88,106,40,142,6 4,48,46,5,90,129,170,150,6,101,193,148,29,23,84,154,156,40,166,176,131,108,144,3 9,26,123,137,138,118,82,129,141,33,115,39,58,104,130,177,106,73,186,21,145,124,7 2,70,29,177,173,97,112,186,90,161,36,155,167,55,174,31,52,150,150,141,124,166,30 ,107,191,7,137,57,87,153,183,145,109,9,158,21,188,22,146,106,30,13,168,100,191,1 62,55,10,159,24,137,148,83,195,41,2,150,91,36,174,20,196,21,148,199,68,84,81,134 ,53,199,18,138,100,188,127,67,128,93,48,83,7,21,110,17,13,114,109,16,135,51,0,49 ,119,156,198,103,24,8,44,9,189,102,195,85,93,143,123,187,114,103,48,0,58,18,180, 196,198,81,189,198,9,157,72,22,138,92,38,179,190,57,158,191,15,88,156,111,2,34,7 2,55,128,46,162,86,75,33,69,142,44,16,81,198,122,51,21,99,157,76,92,189,75,112,0 ,110,3,69,61,88,1,189,55,23,2,185,182,85,88,26,17,157,32,132,169,154,121,189,176 ,129,168,92,25,155,34,149,41,112,145,60,118,153,139,23,79,196,87,129,149,37,66,1 49,193,195,97,16,86,105,88,82,55,134,114,101,116,71,186,63,113,155,185,53,112,8, 32,145,113,156,121,158,46,182,81,144,196,22,129,161,135,50,173,66,44,59,92,39,53 ,24,154,110,145,49,186,113,74,22,168,18,187,105,158,191,2,25,77,14,114,24,134,74 ,172,159,33,70,87,97,118,177,173,70,163,68,192,185,102,80,13,27,2,99,127,25,143, 124,23,172,61,181,3,32,105,193,125,31,92,142,22,86,64,100,187,160,13,174,70,170, 35,33,111,160,96,67,85,150,140,94,95,24,19,125,176,94,58,102,171,66,78,193,51,84 ,18,64,119,152,0,87,60,126,10,157,170,115,176,27,43,158,164,109,82,86,165,87,177 ,74,25,27,29,128,23,120,102,162,123,196,137,61,195,125,64,60,2,116,30,126,11,171 ,11,147,153,120,190,124,188,163,140,51,62,29,100,113,158,178,165,7,77,0,58,39,10 3,160,157,124,77,108,113,87,1,50,60,28,193,184,5,140,111,104,35,156,72,150,23,85 ,156,16,26,157,126,157,137,71,69,161,96,22,17,112,117,96,185,41,23,129,29,165,15 9,132,96,55,53,162,184,134,54,172,57,169,132,163,7,83,111,35,67,48,75,138,23,142 ,154,111,141,175,59,25,21,70,26,134,5,183,50,198,79,101,193,134,37,134,156,193,1 76,105,162,148,81,100,13,41,55,55,142,62,11,77,24,78,152,43,96,73,40,113,75,72,1 8,10,17,132,112,95,169,31,40,88,85,90,97,189,190,145,153,114,51,140,44,58,135,15 9,192,5,64,181,103,29,175,8,92,197,149,156,161,27,67,141,129,40,13,174,1,77,15,8 3,13,192,24,1,192,159,70,28,27,84,75,186,98,170,87,47,4,103,21,63,106,163,10,171 ,89,40,164,142,19,113,191,104,18,32,150,5,175,139,103,22,98,47,184,48,171,64,113 ,75,145,112,146,78,169,62,119,185,89,144,65,140,45,108,118,70,1,123,132,72,152,8 7,170,163,101,103,23,127,0,169,15,165,28,143,147,88,143,37,9,63,49,81,188,142,8, 60,21,158,154,88,146,90,149,43,30,20,148,67,136,183,35,26,185,38,53,29,24,148,12 3,159,57,166,144,155,118,126,11,25,155,1,149,96,184,115,164,142,75,113,142,196,1 48,72,26,6,173,29,4,105,26,12,175,93,165,36,136,141,14,194,56,52,136,38,82,155,1 5,131,30,41,25,11,37,186,90,50,62,34,93,153,16,52,8,62,33,54,103,34,103,56,148,1 24,117,13,109,28,0,80,118,58,50,155,161,64,103,76,43,109,102,161,89,148,82,53,74 ,20,2,123,31,169,78,59,8,19,171,3,145,181,104,192,85,113,98,189,122,138,37,10,61 ,34,108,161,159,93,115,69,137,69,58,100,171,64,117,15,155,15,130,39,12,88,82,154 ,85,110,84,174,180,15,151,141,115,79,110,98,73,188,177,132,156,89,113,8,141,190, 123,163,28,184,178,0,71,85,174,71,133,67,153,95,168,25,76,29,50,198,109,93,86,80 ,116,49,67,128,79,64,21,5,26,16,116,126,66,87,81,164,140,86,21,62,121,64,109,15, 102,73,124,141,145,162,23,131,6,68,118,2,107,107,81,12,136,30,114,9,84,156,90,93 ,196,152,54,145,108,48,91,112,131,114,39,158,122,104,195,52,69,79,38,23,118,66,5 9,98,86,196,62,33,158,22,146,192,37,125,47,58,2,7,98,30,92,0,78,199,152,48,82,14 0,115,175,162,167,136,197,18,97,28,51,16,30,49,125,58,29,120,140,160,147,162,55, 75,192,161,154,198,146,114,146,188,169,38,63,75,115,121,75,15,128,34,170,105,64, 157,162,161,124,149,69,130,123,150,133,125,110,137,136,137,78,193,36,114,164,191 ,149,135,105,137,4,137,23,64,170,8,168,81,85,152,173,52,194,76,26,196,172,49,40, 174,19,143,11,141,89,19,165,5,185,16,50,15,9,64,166,93,74,109,100,95,173,189,161 ,172,168,158,31,68,26,110,22,174,179,110,152,182,191,95,164,74,164,102,55,60,74, 172,21,122,147,177,189,5,195,194,150,143,154,81,12,72,39,28,112,162,167,8,15,108 ,23,159,34,4,86,119,158,145,6,166,100,167,92,187,132,156,174,47,21,83,22,131,176 ,183,148,123,182,18,176,20,111,182,56,90,125,124,86,77,169,43,134,77,68,68,191,1 96,183,28,127,26,71,97,12,103,27,8,145,108,185,38,37,43,113,101,50,128,111,50,14 9,192,54,69,81,65,67,113,193,34,72,172,30,101,42,177,77,170,102,164,181,190,23,3 7,23,179,195,169,127,42,110,182,58,126,87,70,128,51,58,13,60,183,86,142,10,72,12 8,34,41,118,103,67,65,138,81,57,150,14,198,58,61,63,156,7,78,89,35,165,75,186,18 6,33,160,130,48,128,92,33,40,166,135,10,199,37,92,182,128,152,169,44,194,8,52,47 ,32,135,8,64,97,43,49,15,41,189,100,12,48,123,51,74,33,91,0,54,190,97,119,180,17 8,131,144,140,87,99,125,83,138,92,193,52,11,160,34,40,97,185,129,140,5,191,192,1 0,149,178,179,171,77,73,193,20,97,26,76,190,182,178,159,18,89,159,49,124,72,180, 8,167,8,77,103,170,7,196,74,122,11,19,161,56,90,163,83,116,132,52,141,154,13,62, 196,60,15,104,199,136,80,198,32,187,184,40,117,6,70,41,82,49,123,158,105,21,95,9 6,116,78,178,179,58,177,150,7,129,81,195,78,76,153,99,184,165,93,8,172,43,129,11 4,168,55,191,173,122,148,51,186,144,46,177,117,29,116,74,191,69,112,146,93,91,15 ,149,57,40,52,36,151,87,26,162,155,183,194,180,97,65,65,113,61,178,78,78,140,11, 147,45,170,175,89,150,149,133,65,14,82,7,32,96,167,122,82,10,41,31,187,105,79,12 1,138,151,47,8,46,76,159,189,22,66,86,55,28,14,60,53,177,148,103,61,31,82,55,197 ,106,152,21,96,81,21,55,147,124,118,135,176,174,59,198,74,53,122,35,43,88,153,32 ,147,80,126,78,50,1,161,199,55,163,116,173,161,45,73,74,150,153,181,87,99,110,43 ,65,172,129,181,112,76,181,47,90,71,5,172,32,189,120,165,31,58,93,6,178,148,6,17 1,166,196,97,20,94,129,188,109,184,169,178,17,15,26,84,168,106,128,97,118,190,19 9,185,86,199,20,110,71,13,15,85,118,180,131,67,187,44,186,107,160,27,74,31,152,7 1,68,93,85,137,111,4,77,6,168,22,13,0,142,137,38,188,155,89,47,181,93,184,187,16 1,93,17,101,82,47,65,153,104,84,95,125,21,164,181,72,106,56,143,193,80,80,68,11, 113,168,51,16,79,168,40,131,133,179,63,59,53,136,95,165,74,120,35,80,176,55,125, 71,8,159,156,2,32,105,40,175,162,85,162,80,36,197,2,108,80,140,76,58,93,140,146, 74,173,97,80,135,72,0,107,155,66,141,188,81,168,115,196,25,9,12,136,55,162,43,14 2,21,122,112,48,18,168,117,114,50,90,135,159,169,95,103,40,179,199,105,191,61,81 ,52,153,33,29,187,42,53,83,20,14,118,44,63,29,52,64,169,70,5,47,194,87,126,76,12 3,140,79,190,188,110,71,145,21,70,183,189,155,178,179,6,62,135,87,196,33,88,135, 179,193,190,162,165,1,105,7,167,69,134,71,57,198,145,197,18,38,44,172,163,28,64, 1,123,90,4,1,27,197,92,171,163,101,163,121,165,21,45,10,95,141,22,12,151,15,55,1 93,138,79,82, 分析结果： 78出现的次数是：13 158出现的次数是：13 105出现的次数是：13 145出现的次数是：15 81出现的次数是：17 161出现的次数是：15 91出现的次数是：5 195出现的次数是：9 142出现的次数是：13 36出现的次数是：7 191出现的次数是：13 4出现的次数是：7 102出现的次数是：9 92出现的次数是：13 182出现的次数是：9 95出现的次数是：11 47出现的次数是：11 126出现的次数是：9 69出现的次数是：11 112出现的次数是：13 35出现的次数是：9 11出现的次数是：11 133出现的次数是：5 73出现的次数是：7 111出现的次数是：9 53出现的次数是：11 68出现的次数是：9 44出现的次数是：9 157出现的次数是：9 59出现的次数是：7 129出现的次数是：13 178出现的次数是：11 190出现的次数是：11 88出现的次数是：11 106出现的次数是：7 46出现的次数是：5 5出现的次数是：11 90出现的次数是：11 150出现的次数是：13 6出现的次数是：9 148出现的次数是：13 29出现的次数是：13 23出现的次数是：15 154出现的次数是：9 156出现的次数是：13 166出现的次数是：7 176出现的次数是：9 39出现的次数是：7 82出现的次数是：13 33出现的次数是：11 58出现的次数是：15 104出现的次数是：7 72出现的次数是：13 70出现的次数是：11 173出现的次数是：9 167出现的次数是：7 31出现的次数是：9 52出现的次数是：11 30出现的次数是：9 107出现的次数是：5 57出现的次数是：7 87出现的次数是：15 109出现的次数是：9 9出现的次数是：7 22出现的次数是：13 168出现的次数是：13 159出现的次数是：13 2出现的次数是：11 196出现的次数是：15 199出现的次数是：9 18出现的次数是：11 127出现的次数是：5 128出现的次数是：11 93出现的次数是：15 114出现的次数是：11 16出现的次数是：9 135出现的次数是：11 49出现的次数是：9 119出现的次数是：5 198出现的次数是：11 8出现的次数是：17 189出现的次数是：13 143出现的次数是：7 187出现的次数是：9 179出现的次数是：9 15出现的次数是：17 75出现的次数是：11 3出现的次数是：3 25出现的次数是：9 60出现的次数是：9 79出现的次数是：9 66出现的次数是：7 71出现的次数是：11 63出现的次数是：7 113出现的次数是：15 50出现的次数是：11 74出现的次数是：15 77出现的次数是：11 172出现的次数是：11 163出现的次数是：11 192出现的次数是：9 80出现的次数是：11 181出现的次数是：9 160出现的次数是：7 96出现的次数是：9 43出现的次数是：11 164出现的次数是：9 120出现的次数是：5 184出现的次数是：9 54出现的次数是：5 175出现的次数是：7 89出现的次数是：9 136出现的次数是：9 56出现的次数是：5 请按任意键继续. . .

user: user-2
content: //有一个很大的整型数组int a[n],里面的每一个数字可能有奇数个，也可能有偶数个，要求找出其中有奇数个的数字。 #include<stdio.h> #include <stdlib.h> #define SIZE 2000 static int data[SIZE]; struct st_num{ 	int num; 	int count; 	bool zero; }arry[SIZE];  static void build_data(){ 		printf("%s","数据样本："); 		printf("\n"); 	for(int a=0;a<SIZE;a++){ 		data[a]=rand()%200;		 		printf("%d%c",data[a],','); 	} }  int main(){ 	build_data(); 	int oflag=0; 	for(int a=0;a<SIZE;a++){ 		int flag=0; 		for(int b=0;b<SIZE;b++){             if(arry[b].zero&&data[a]==0||(data[a]!=0&&data[a]==arry[b].num)){				 				arry[b].count++; 			}else{ 				flag++; 			}		 			if(flag==SIZE){ 				arry[oflag].num=data[a]; 				arry[oflag].count=1; 				if(data[a]==0){ 					arry[oflag].num=0; 					arry[oflag].zero=true; 				} 				oflag++; 			} 		} 	} 	printf("\n"); 	printf("%s","分析结果："); 	printf("\n");  	for(int a=0;a<SIZE;a++){ 		if(arry[a].count%2==1){ 			printf("%d%s%d",arry[a].num,"出现的次数是：",arry[a].count); 			printf("\n"); 		} 	} 	return 0;

user: user-3
content: 建立一个单向顺序链表，然后遍历数组，某个数字在链表里没有出现过就按大小顺序插入，已经有了则删除，遍历结束，这个链表里留下的节点的数据域里就是出现过奇数次的数啦

user: user-2
content: #include<stdio.h> #include <stdlib.h>  #define SIZE 100 static int data[SIZE]; struct st_num{ 	int num; 	int count; 	bool zero; }arry[SIZE]; static void build_data(){ 		printf("%s","数据样本："); 		printf("\n"); 	for(int a=0;a<SIZE;a++){ 		data[a]=rand()%10;		 		printf("%d%c",data[a],','); 	} }  int main(){ 	//有一个很大的整型数组int a[n],里面的每一个数字可能有奇数个，也可能有偶数个，要求找出其中有奇数个的数字。 	build_data(); 	int oflag=0; 	for(int a=0;a<SIZE;a++){ 		int flag=0; 		for(int b=0;b<SIZE;b++){             if(data[a]==0&&arry[b].zero||(data[a]!=0&&data[a]==arry[b].num)){				 				arry[b].count++; 			}else{ 				flag++; 			}		 			if(flag==SIZE){ 				arry[oflag].num=data[a]; 				arry[oflag].count=1; 				if(data[a]==0){ 					arry[oflag].num=0; 					arry[oflag].zero=true; 				} 				oflag++; 			} 		} 	} 	printf("\n"); 	printf("%s","分析结果："); 	printf("\n");  	for(int a=0;a<SIZE;a++){ 		if(arry[a].count%2==1){ 			printf("%d%s%d",arry[a].num,"出现的次数是：",arry[a].count); 			printf("\n"); 		} 	} 	return 0; }

user: user-4
content: 如果是int，用32位的数组，记录每个数字在该位为1的个数，最后选出位置值为奇数的位置，将其余位置置0，十进制后就是要的数字。 不过前提是这个数组里只有一个数字是出现奇数次，其他数字都是出现偶数次

user: user-5
content: 用循环遍历的方法就OK了啊，a【i】%2！=0的时候就输出，就是所有的奇数了

user: user-6
content: 哈哈 可以用字典树实现，内存需求没多少，且看我的代码http://bbs.csdn.net/topics/390602795

user: user-7
content: 引用 13 楼 qq120848369 的回复:全异或啊，老题目啊。记得只有一个奇数的时候可以用这个方法，貌似楼主的意思是奇数个的数也有多个，那异或之后貌似也不好处理啊。

user: user-0
content: 引用 13 楼 qq120848369 的回复:全异或啊，老题目啊。 具有奇数个数的数字只有一个，全异或就可以得到。

user: user-8
content: 全异或啊，老题目啊。

user: user-9
content: 引用 11 楼 aa122333 的回复:不过需要512M内存 照你的作法估计大家都不要用百度搜索了....

user: user-10
content: 无语了，不能编辑，总的修改为以下：  （1）因为int的个数为为2^32，我们可以考虑直接用连续内存的一位来记录对应的一个数出现是偶次数还是奇次数 （2）总共需要的内存是2^32/8 字节 = 2^29 字节 = 2^19 k = 2^9 m = 512 m （3）如果一个数出现一次（奇数次），把该位置1，出现第二次（偶次数），把该位置0 （4）最后再把置上1的位对应的整数输出即可  不过需要512M内存

user: user-11
content: 火线刘明

user: user-12
content: 我汉语太差了，看不懂中文了都。

user: user-10
content: int型最大为2^31 - 1，粗心了

user: user-10
content: 最后一句修改：需要256M内存

user: user-10
content: （1）因为是int型，所以最大为2^31，我们可以考虑直接用连续内存的一位来记录对应的一个数出现是偶次数还是奇次数 （2）总共需要的内存是2^31/8 字节 = 2^28 字节 = 2^18 k = 2^8 m = 256 m （3）如果一个数出现一次（奇数次），把该位置1，出现第二次（偶次数），把该位置0 （4）最后再把置上1的位对应的整数输出即可  不过需要255M内存

user: user-13
content: 很高端的样子  引用 4 楼 zhao4zhong1 的回复:仅供参考//随机产生100000000个取值范围为[0～2的32次方减1]的数据， //然后让用户输入一个数据，判断用户输入的数据是不是包含在前面随机产生的数据中。 //要求：当用户输入完成后，必须在1毫秒(千分之一秒)之内完成判断。 #include <stdio.h> #include <stdlib.h> #include <time.h> #include <malloc.h> long int i; unsigned long ul; unsigned long *d; unsigned long ulrand(void) {     return (      (((unsigned long)rand()<<24)&0xFF000000ul)     |(((unsigned long)rand()<<12)&0x00FFF000ul)     |(((unsigned long)rand()    )&0x00000FFFul)); } void main() {     d=(unsigned long *)calloc(1<<(32-5),sizeof(unsigned long));     if (NULL==d) {         printf("Can not calloc(%d,%d)!\n",1<<(32-5),sizeof(unsigned long));         return;     }     srand(time(NULL));     for (i=0;i<100000000;i++) {         while (1) {             ul=ulrand();             if (0==(d[ul>>5]&(1lu<<(ul%32)))) {                 d[ul>>5]|=1<<(ul%32);                 break;             }         }         if (0==i%1000000) printf("%09d,%10lu\n",i,ul);     }     while (1) {         printf("\nInput a number:");         fflush(stdout);         rewind(stdin);         if (1==scanf("%lu",&ul)) break;     }     if (d[ul>>5]&(1<<(ul%32))) printf("Include.\n"    );     else                       printf("Not include.\n");     free(d); } //000000000,2135468533 //001000000,2465805973 //002000000,3844079964 //003000000,1883232874 //004000000,1204697784 //005000000,4050838287 //006000000,3802081245 //007000000,1586042671 //008000000,3119931368 //009000000, 251096899 //010000000,3491239701 //011000000,3365323844 //012000000,2191846708 //013000000,1879478195 //014000000,1112631457 //015000000,1927301519 //016000000,1717332861 //017000000,2922278240 //018000000, 694854106 //019000000, 273255526 //020000000, 398518467 //021000000,3270756812 //022000000,1500289424 //023000000,1502241936 //024000000,1770380660 //025000000,3668842116 //026000000,3255869879 //027000000,1299184024 //028000000,1072990028 //029000000, 242094712 //030000000,3789344297 //031000000,2599365925 //032000000, 962754138 //033000000,2055075654 //034000000,4083452879 //035000000, 489250842 //036000000, 611455230 //037000000, 277350616 //038000000,1597410795 //039000000,3224173662 //040000000,2291446877 //041000000,2546280575 //042000000,2509145642 //043000000,2371773252 //044000000, 635555963 //045000000,2674538666 //046000000,4253690312 //047000000,2675755514 //048000000,1269320296 //049000000,3172516920 //050000000,1430265210 //051000000, 196156173 //052000000,2470825669 //053000000,2536750977 //054000000,1182829949 //055000000,3202826434 //056000000,2263336265 //057000000, 313302924 //058000000,3630264578 //059000000,1154892716 //060000000,2985304230 //061000000,1252204837 //062000000,1292076720 //063000000, 242249250 //064000000,3999999961 //065000000, 431166416 //066000000,1366947236 //067000000,1414387330 //068000000,2143784481 //069000000,3242175409 //070000000,4158065163 //071000000,1425449573 //072000000,2493600232 //073000000,1316783455 //074000000,3723170478 //075000000,3064111466 //076000000, 408557403 //077000000,3722586955 //078000000,3801652651 //079000000,3788160154 //080000000,3329440047 //081000000,1408976868 //082000000, 471838899 //083000000,2145198260 //084000000,3781081738 //085000000,3439027738 //086000000,1150808750 //087000000,2782578638 //088000000,  85604584 //089000000,2704078162 //090000000, 584840269 //091000000,3854577719 //092000000,2823653537 //093000000, 797877025 //094000000,2248017755 //095000000,1787038685 //096000000,2816548567 //097000000, 489107494 //098000000, 911680090 //099000000,3677777147 // //Input a number:3677777147 //Include.

user: user-14
content: 仅供参考//随机产生100000000个取值范围为[0～2的32次方减1]的数据， //然后让用户输入一个数据，判断用户输入的数据是不是包含在前面随机产生的数据中。 //要求：当用户输入完成后，必须在1毫秒(千分之一秒)之内完成判断。 #include <stdio.h> #include <stdlib.h> #include <time.h> #include <malloc.h> long int i; unsigned long ul; unsigned long *d; unsigned long ulrand(void) {     return (      (((unsigned long)rand()<<24)&0xFF000000ul)     |(((unsigned long)rand()<<12)&0x00FFF000ul)     |(((unsigned long)rand()    )&0x00000FFFul)); } void main() {     d=(unsigned long *)calloc(1<<(32-5),sizeof(unsigned long));     if (NULL==d) {         printf("Can not calloc(%d,%d)!\n",1<<(32-5),sizeof(unsigned long));         return;     }     srand(time(NULL));     for (i=0;i<100000000;i++) {         while (1) {             ul=ulrand();             if (0==(d[ul>>5]&(1lu<<(ul%32)))) {                 d[ul>>5]|=1<<(ul%32);                 break;             }         }         if (0==i%1000000) printf("%09d,%10lu\n",i,ul);     }     while (1) {         printf("\nInput a number:");         fflush(stdout);         rewind(stdin);         if (1==scanf("%lu",&ul)) break;     }     if (d[ul>>5]&(1<<(ul%32))) printf("Include.\n"    );     else                       printf("Not include.\n");     free(d); } //000000000,2135468533 //001000000,2465805973 //002000000,3844079964 //003000000,1883232874 //004000000,1204697784 //005000000,4050838287 //006000000,3802081245 //007000000,1586042671 //008000000,3119931368 //009000000, 251096899 //010000000,3491239701 //011000000,3365323844 //012000000,2191846708 //013000000,1879478195 //014000000,1112631457 //015000000,1927301519 //016000000,1717332861 //017000000,2922278240 //018000000, 694854106 //019000000, 273255526 //020000000, 398518467 //021000000,3270756812 //022000000,1500289424 //023000000,1502241936 //024000000,1770380660 //025000000,3668842116 //026000000,3255869879 //027000000,1299184024 //028000000,1072990028 //029000000, 242094712 //030000000,3789344297 //031000000,2599365925 //032000000, 962754138 //033000000,2055075654 //034000000,4083452879 //035000000, 489250842 //036000000, 611455230 //037000000, 277350616 //038000000,1597410795 //039000000,3224173662 //040000000,2291446877 //041000000,2546280575 //042000000,2509145642 //043000000,2371773252 //044000000, 635555963 //045000000,2674538666 //046000000,4253690312 //047000000,2675755514 //048000000,1269320296 //049000000,3172516920 //050000000,1430265210 //051000000, 196156173 //052000000,2470825669 //053000000,2536750977 //054000000,1182829949 //055000000,3202826434 //056000000,2263336265 //057000000, 313302924 //058000000,3630264578 //059000000,1154892716 //060000000,2985304230 //061000000,1252204837 //062000000,1292076720 //063000000, 242249250 //064000000,3999999961 //065000000, 431166416 //066000000,1366947236 //067000000,1414387330 //068000000,2143784481 //069000000,3242175409 //070000000,4158065163 //071000000,1425449573 //072000000,2493600232 //073000000,1316783455 //074000000,3723170478 //075000000,3064111466 //076000000, 408557403 //077000000,3722586955 //078000000,3801652651 //079000000,3788160154 //080000000,3329440047 //081000000,1408976868 //082000000, 471838899 //083000000,2145198260 //084000000,3781081738 //085000000,3439027738 //086000000,1150808750 //087000000,2782578638 //088000000,  85604584 //089000000,2704078162 //090000000, 584840269 //091000000,3854577719 //092000000,2823653537 //093000000, 797877025 //094000000,2248017755 //095000000,1787038685 //096000000,2816548567 //097000000, 489107494 //098000000, 911680090 //099000000,3677777147 // //Input a number:3677777147 //Include.