zoukankan      html  css  js  c++  java
  • Codeforces Helpful Maths

    Xenia the beginner mathematician is a third year student at elementary school. She is now learning the addition operation.

    The teacher has written down the sum of multiple numbers. Pupils should calculate the sum. To make the calculation easier, the sum only contains numbers 1, 2 and 3. Still, that isn't enough for Xenia. She is only beginning to count, so she can calculate a sum only if the summands follow in non-decreasing order. For example, she can't calculate sum 1+3+2+1 but she can calculate sums 1+1+2 and 3+3.

    You've got the sum that was written on the board. Rearrange the summans and print the sum in such a way that Xenia can calculate the sum.

    Input

    The first line contains a non-empty string s — the sum Xenia needs to count. String s contains no spaces. It only contains digits and characters "+". Besides, string s is a correct sum of numbers 1, 2 and 3. String s is at most 100 characters long.

    Output

    Print the new sum that Xenia can count.

    Sample test(s)
    input
    3+2+1
    
    output
    1+2+3
    
    input
    1+1+3+1+3
    
    output
    1+1+1+3+3
    
    input
    2
    
    output
    2
    

    这种题目由于keyword少,所以就能够转换为counting sort的思想去解决。这样时间效率就仅仅有O(n)了。


    void HelpfulMaths()
    {
    	int A[4] = {0};
    	int a;
    	while (scanf("%d", &a) != EOF)
    	{
    		A[a]++;
    		getchar();
    	}
    	int total = A[1]+A[2]+A[3]-1;
    	for (unsigned i = 0; i < A[1]; i++, total--)
    	{
    		printf("1");
    		if (total) printf("+");
    	}
    	for (unsigned i = 0; i < A[2]; i++, total--)
    	{
    		printf("2");
    		if (total) printf("+");;
    	}
    	for (unsigned i = 0; i < A[3]; i++, total--)
    	{
    		printf("3");
    		if (total) printf("+");
    	}
    }




    版权声明:本文博客原创文章,博客,未经同意,不得转载。

  • 相关阅读:
    多线程《三》进程与线程的区别
    多线程《二》开启线程的两种方式
    多线程《一》线程理论
    多进程《七》生产者消费者模型
    多进程《六》队列
    互斥锁与join
    多进程《五》互斥锁
    多进程《四》守护进程
    再度认识未来——2.11
    开始——2.10
  • 原文地址:https://www.cnblogs.com/yxwkf/p/4631070.html
Copyright © 2011-2022 走看看