hdu 1230 字符串 

  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string>
  4. #include <string.h>
  5. #include <iostream>
  6. #define MAX(a,b) a>b? a:b
  7. using namespace std;
  8. int in[30]={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101};
  10. /*http://acm.hdu.edu.cn/showproblem.php?pid=1230*/
  12. int main()
  13. {
  14. 	char one[1000], two[100];
  15. 	int one_seat[50], two_seat[50], three_seat[50];
  16. 	int one_num, two_num;
  17. 	memset(one, '\0', sizeof(one) );
  18. 	memset(two, '\0', sizeof(two) );
  19. 	while(~scanf("%s%s", one, two) )
  20. 	{
  21. 		char *p = one, *q = two;
  22. 		one_num = two_num = 1;
  23. 		memset(one_seat, 0, sizeof(one_seat) );
  24. 		memset(two_seat, 0, sizeof(two_seat) );
  25. 		memset(three_seat, 0, sizeof(three_seat) );
  27. 		while(1)
  28. 		{
  29. 			while( (*p) == ',')		p++;
  30. 			if( (*p) != '\0')
  31. 			{
  32. 				one_seat[one_num++]	= atoi(p);	
  33. 				while( (*p) != ',' && (*p) !='\0')		{p++;		if( (*p) =='\0') break;	}	p++;
  34. 			}
  35. 			else break;
  36. 		}
  37. 		while(1)
  38. 		{
  39. 		if( (*q) != '\0')
  40. 			{
  41. 				two_seat[two_num++]	= atoi(q);	
  42. 				while( (*q) != ',' && (*q) != '\0')		{q++;		if( (*q) =='\0') break;	}	q++;
  43. 			}
  44. 			else break;
  45. 		}
  47. 		if(one_seat[1] + two_seat[1] == 0 && one_seat[2]+ two_seat[2] ==0)	break;
  49. 		int carry=0, seat=0;
  51. 		for(int i= one_num-1, j= two_num-1; i>=0 || j>=0 || carry != 0; i--,j--)
  52. 		{
  53. 			if(i <= 0)	i=0;
  54. 			if(j <= 0)	j=0;
  55. 			three_seat[i] = (one_seat[i] + two_seat[j] +carry) % in[seat];
  56. 			carry = (one_seat[i] + two_seat[j] + carry) / in[seat++];
  57. 			
  58. 		}
  60. 		int i=0;
  62. 		while(	three_seat[i] == 0)
  63. 			i++;
  64. 		
  65. 		for(; i<seat-1; i++)
  66. 			printf("%d,", three_seat[i] );
  68. 		printf("%d\n", three_seat[i]);
  70. 		memset(one, '\0', sizeof(one) );
  71. 		memset(two, '\0', sizeof(two) );
  72. 	}
  73. 	return 0;
  74. }





附件列表

     

    posted @ 2015-01-29 15:29  sober_reflection  阅读(106)  评论(0)  编辑  收藏  举报