Codeforces 679B. Barnicle 模拟

本文介绍了一个将科学计数法转换为十进制表示的程序设计问题。通过模拟方式实现,解决了特殊情况下输出格式的问题,如整数、小数及零的正确显示。
B. Barnicle
time limit per test:
1 second
memory limit per test
:256 megabytes
input:
standard input
output:
standard output

Barney is standing in a bar and starring at a pretty girl. He wants to shoot her with his heart arrow but he needs to know the distance between him and the girl to make his shot accurate.

Barney asked the bar tender Carl about this distance value, but Carl was so busy talking to the customers so he wrote the distance value (it's a real number) on a napkin. The problem is that he wrote it in scientific notation. The scientific notation of some real number x is the notation of form AeB, where A is a real number and B is an integer and x = A × 10B is true. In our case A is between 0 and 9 and B is non-negative.

Barney doesn't know anything about scientific notation (as well as anything scientific at all). So he asked you to tell him the distance value in usual decimal representation with minimal number of digits after the decimal point (and no decimal point if it is an integer). See the output format for better understanding.

Input

The first and only line of input contains a single string of form a.deb where ad and b are integers and e is usual character 'e' (0 ≤ a ≤ 9, 0 ≤ d < 10100, 0 ≤ b ≤ 100) — the scientific notation of the desired distance value.

a and b contain no leading zeros and d contains no trailing zeros (but may be equal to 0). Also, b can not be non-zero if a is zero.

Output

Print the only real number x (the desired distance value) in the only line in its decimal notation.

Thus if x is an integer, print it's integer value without decimal part and decimal point and without leading zeroes.

Otherwise print x in a form of p.q such that p is an integer that have no leading zeroes (but may be equal to zero), and q is an integer that have no trailing zeroes (and may not be equal to zero).

Examples
input
8.549e2
output
854.9
input
8.549e3
output
8549
input
0.33e0
output
0.33

题目链接:http://codeforces.com/contest/697/problem/B

题意:参照样例
思路:模拟
注意一些特殊情况。2.0e0输出2;0.00e0输出0;0.0001e2输出0.01。注意消去前导0,后导0。

代码:
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int i;
    int a,b;
    char ch;
    int d[200];
    scanf("%d",&a);
    getchar();
    int len=0;
    while((ch=getchar())&&ch!='e')
        d[len++]=ch-'0';
    for(i=len-1; i>=0; i--)
        if(d[i]) break;
    len=i+1;
    scanf("%d",&b);
    getchar();
    int sign=0;
    if(a!=0)
    {
        cout<<a;
        sign=1;
    }
    for(i=0; i<len&&i<b; i++)
    {
        if(sign==0&&d[i]==0) continue;
        else
        {
            cout<<d[i];
            sign=1;
        }
    }
    if(sign!=0&&len<b)
        for(i=len; i<b; i++) cout<<"0";
    else if(len>b)
    {
        if(sign) cout<<".";
        else cout<<"0.";
        for(i=b; i<len; i++) cout<<d[i];
    }
    else if(sign==0) cout<<"0";
    cout<<endl;
    return 0;
}
View Code

转载于:https://www.cnblogs.com/GeekZRF/p/5673307.html

### Codeforces Div.2 比赛难度介绍 Codeforces Div.2 比赛主要面向的是具有基础编程技能到中级水平的选手。这类比赛通常吸引了大量来自全球不同背景的参赛者,包括大学生、高中生以及一些专业人士。 #### 参加资格 为了参加 Div.2 比赛,选手的评级应不超过 2099 分[^1]。这意味着该级别的竞赛适合那些已经掌握了一定算法知识并能熟练运用至少一种编程语言的人群参与挑战。 #### 题目设置 每场 Div.2 比赛一般会提供五至七道题目,在某些特殊情况下可能会更多或更少。这些题目按照预计解决难度递增排列: - **简单题(A, B 类型)**: 主要测试基本的数据结构操作和常见算法的应用能力;例如数组处理、字符串匹配等。 - **中等偏难题(C, D 类型)**: 开始涉及较为复杂的逻辑推理能力和特定领域内的高级技巧;比如图论中的最短路径计算或是动态规划入门应用实例。 - **高难度题(E及以上类型)**: 对于这些问题,则更加侧重考察深入理解复杂概念的能力,并能够灵活组合多种方法来解决问题;这往往需要较强的创造力与丰富的实践经验支持。 对于新手来说,建议先专注于理解和练习前几类较容易的问题,随着经验积累和技术提升再逐步尝试更高层次的任务。 ```cpp // 示例代码展示如何判断一个数是否为偶数 #include <iostream> using namespace std; bool is_even(int num){ return num % 2 == 0; } int main(){ int number = 4; // 测试数据 if(is_even(number)){ cout << "The given number is even."; }else{ cout << "The given number is odd."; } } ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值