Codeforces Round #373 (Div. 1)
题目
A. Efim and Strange Grade
Efim just received his grade for the last test. He studies in a special school and his grade can be equal to any positive decimal fraction. First he got disappointed, as he expected a way more pleasant result. Then, he developed a tricky plan. Each second, he can ask his teacher to round the grade at any place after the decimal point (also, he can ask to round to the nearest integer).
There are t seconds left till the end of the break, so Efim has to act fast. Help him find what is the maximum grade he can get in no more than t seconds. Note, that he can choose to not use all t seconds. Moreover, he can even choose to not round the grade at all.
In this problem, classic rounding rules are used: while rounding number to the n-th digit one has to take a look at the digit n + 1. If it is less than 5 than the n-th digit remain unchanged while all subsequent digits are replaced with 0. Otherwise, if the n + 1 digit is greater or equal to 5, the digit at the position n is increased by 1 (this might also change some other digits, if this one was equal to 9) and all subsequent digits are replaced with 0. At the end, all trailing zeroes are thrown away.
For example, if the number 1.14 is rounded to the first decimal place, the result is 1.1, while if we round 1.5 to the nearest integer, the result is 2. Rounding number 1.299996121 in the fifth decimal place will result in number 1.3.
Input
The first line of the input contains two integers n and t (1 ≤ n ≤ 200 000, 1 ≤ t ≤ 109) — the length of Efim’s grade and the number of seconds till the end of the break respectively.
The second line contains the grade itself. It’s guaranteed that the grade is a positive number, containing at least one digit after the decimal points, and it’s representation doesn’t finish with 0.
Output
Print the maximum grade that Efim can get in t seconds. Do not print trailing zeroes.
Examples
input
6 1
10.245
output
10.25
input
6 2
10.245
output
10.3
input
3 100
9.2
output
9.2
Note
In the first two samples Efim initially has grade 10.245.
During the first second Efim can obtain grade 10.25, and then 10.3 during the next second. Note, that the answer 10.30 will be considered incorrect.
In the third sample the optimal strategy is to not perform any rounding at all.
题目大意
给出一个小数,可以对它做t次小数点后的某一位向前四舍五入(可以不做完)
题解
首先,我们找到离小数点最近的一个大于4的数(位置为p),将向前一位进一,然后,从p-1这个位置向小数点后一位枚举,找到一个数大于4那么就向前以为进一,否则,停止操作
很显然,做完小数部分,整数部分会发生进位,所以我们要对整数部分检查一遍,再输出即可
代码
#include<cstdio>
using namespace std;
int n,m,s,p,q;
int a[200005];
char ch;
int readln()
{
int x=0;
char ch=getchar();
while (ch>'0'&&ch>'9') ch=getchar();
while ('0'<=ch&&ch<='9') x=x*10+ch-48,ch=getchar();
return x;
}
int main()
{
n=readln();m=readln();
for (int i=1;i<=n;i++)
{
ch=getchar();while (ch!='.'&&(ch<'0'||ch>'9')) ch=getchar();
if (ch=='.') p=i,s=-1;else a[i+s]=ch-48;
}
q=n;
for (int i=p;i<n;i++)
{
if (a[i]>=5) {
a[i]=0;a[i-1]++;
q=i;m--;break;
}
}
s=q-1;
for (int i=q-1;i>=p&&m!=0;i--) if (5<=a[i]&&a[i]<10) a[i-1]++,m--,s=i-1;else break;
for (int i=p-1;i>=1;i--) if (a[i]>9) a[i]-=10,a[i-1]++;else break;
if (a[0]) printf("%d",a[0]);
for (int i=1;i<p;i++) printf("%d",a[i]);
if (p<=s) {printf(".");for (int i=p;i<=s;i++) printf("%d",a[i]);}
return 0;
}