NYOJ525 一道水题

原题链接

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cstdio>
#define MAX 5000 + 2
using namespace std;
char s[MAX];

int main(){
	vector<int> vec;
	int t;
	char *p;
	while(scanf("%s", s) == 1){
		p = strtok(s, "5");
		if(p == NULL){
			printf("0\n");
			continue;
		}
		while(p != NULL){
			sscanf(p, "%d", &t);
			vec.push_back(t);
			p = strtok(NULL, "5");
		}
		sort(vec.begin(), vec.end());
		int flag = 1;
		for(int i = 0; i != vec.size(); ++i)
			if(flag) printf("%d", vec[i]), flag = 0;
			else printf(" %d", vec[i]);
		puts("");
		vec.clear();
	}
	return 0;
}

NYOJ525 一道水题,布布扣,bubuko.com

NYOJ525 一道水题

原文：http://blog.csdn.net/chang_mu/article/details/20119275