wrong code

最新推荐文章于 2022-09-07 10:25:00 发布

witnessai1

最新推荐文章于 2022-09-07 10:25:00 发布

阅读量1k

点赞数

分类专栏： ——ACM—— 文章标签： acm 算法 c++ 代码

本文链接：https://blog.csdn.net/witnessai1/article/details/48381971

版权

——ACM—— 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

XDU 1060

#include <cstdio>
#include <iostream>
#include <stack>

using namespace std;

stack<int> m1;
stack<int> m2;
int main()
{
    string s;
    while(cin >> s)
    {
        int len  = s.size(), i;
        if(len == 1)
        {
            cout << "0.0";
            int r = s[0] - '0';
            r = r >= 5? 1: 0;
            cout << r << endl;
        }
        else if(len == 2)
        {
            cout << "0.";
            for(i = 0; i < len-1; i++)
            {
                m1.push(s[i]-'0');
            }
            int r = s[i] - '0';
            r >= 5? r = 1: r = 0;
            while(!m1.empty())
            {
                r += m1.top();
                m2.push(r%10);
                m1.pop();
                r /= 10;
            }
            if(r)
                m2.push(r);
            if(m2.size() == 2)
            {
                cout << m2.top();   m2.pop();
                cout << m2.top();   m2.pop();
            }
            else
            {
                cout << 0 << m2.top();
                m2.pop();
            }
            cout << endl;
        }
        else if(len == 3)
        {
            cout << "0.";
            for(i = 0; i < len-1; i++)
            {
                m1.push(s[i]-'0');
            }
            int r = s[i] - '0';
            r >= 5? r = 1: r = 0;
            while(!m1.empty())
            {
                r += m1.top();
                m2.push(r%10);
                m1.pop();
                r /= 10;
            }
            if(r)
                m2.push(r);
            cout << m2.top();   m2.pop();
            cout << m2.top();   m2.pop();
            cout << endl;
        }
        else
        {
            for(i = 0; i < len-1; i++)
            {
                m1.push(s[i]-'0');
            }
            int r = s[i] - '0';
            r >= 5? r = 1: r = 0;
            while(!m1.empty())
            {
                r += m1.top();
                m2.push(r%10);
                m1.pop();
                r /= 10;
            }
            if(r)
                m2.push(r);
            int m_len = m2.size();
            for(int i = 1; i <= m_len-2; i++)
            {
                cout << m2.top();
                m2.pop();
            }
            cout << '.';
            while(!m2.empty())
            {
                cout << m2.top();
                m2.pop();
            }
            cout << endl;
        }


    }
    
}