标签:stdio.h php limit display line nbsp define closed clu
题目代号:HDU 1106
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1106
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 60824 Accepted Submission(s):
18013
1 # include <stdio.h> 2 # include <string.h> 3 # include <stdlib.h> 4 # include <iostream> 5 # include <fstream> 6 # include <vector> 7 # include <queue> 8 # include <stack> 9 # include <map> 10 # include <math.h> 11 # include <algorithm> 12 using namespace std; 13 # define pi acos(-1.0) 14 # define mem(a,b) memset(a,b,sizeof(a)) 15 # define FOR(i,a,n) for(int i=a; i<=n; ++i) 16 # define For(i,n,a) for(int i=n; i>=a; --i) 17 # define FO(i,a,n) for(int i=a; i<n; ++i) 18 # define Fo(i,n,a) for(int i=n; i>a ;--i) 19 typedef long long LL; 20 typedef unsigned long long ULL; 21 22 int a[1005]; 23 char b[1005]; 24 25 int main() { 26 while (~scanf("%s", b)) { 27 mem(a, 0); 28 int ans = 0, num = 0, flag = 0; 29 for (int i = 0; i < strlen(b); i++) { 30 if (b[i] != ‘5‘) { 31 num = num * 10 + b[i] - ‘0‘, flag = 1; 32 } else if (flag) 33 a[ans] = num, ans++, num = 0, flag = 0 ; 34 } 35 if (b[strlen(b) - 1] != ‘5‘) 36 a[ans] = num, ans++; 37 sort(a, a + ans); 38 for (int i = 0, j; i < ans; i++) { 39 if (i) 40 cout << ‘ ‘; 41 cout << a[i]; 42 } 43 puts(""); 44 } 45 return 0; 46 }
标签:stdio.h php limit display line nbsp define closed clu
原文地址:http://www.cnblogs.com/teble/p/7224627.html