ZCMU 暑期训练四---F题

最新推荐文章于 2021-09-02 21:47:52 发布

微寒゛

最新推荐文章于 2021-09-02 21:47:52 发布

阅读量216

点赞数

本文链接：https://blog.csdn.net/qq_43381490/article/details/96424823

版权

这道题目要求帮助Vus the Cossack找到一个序列b，使得序列的元素和为0，且每个b是a的下取整或上取整。已知a的总和为0，且a的每个数值精确到小数点后5位。解决方案是首先尝试全部向下取整，如果和不等于0，则按顺序调整，直至和为0。

摘要由CSDN通过智能技术生成

Vus the Cossack has nn real numbers aiai. It is known that the sum of all numbers is equal to 00. He wants to choose a sequence bb the size of which is nn such that the sum of all numbers is 00 and each bibi is either ⌊ai⌋⌊ai⌋ or ⌈ai⌉⌈ai⌉. In other words, bibi equals aiairounded up or down. It is not necessary to round to the nearest integer.

For example, if a=[4.58413,1.22491,−2.10517,−3.70387]a=[4.58413,1.22491,−2.10517,−3.70387], then bb can be equal, for example, to [4,2,−2,−4][4,2,−2,−4].

Note that if aiai is an integer, then there is no difference between ⌊ai⌋⌊ai⌋ and ⌈ai⌉⌈ai⌉, bibiwill always be equal to aiai.

Help Vus the Cossack find such sequence!

Input

The first line contains one integer nn (1≤n≤1051≤n≤105) — the number of numbers.

Each of the next nn lines contains one real number aiai (|ai|<105|ai|<105). It is guaranteed that each aiai has exactly 55 digits after the decimal point. It is guaranteed that the sum of all the numbers is equal to 00.

Output

In each of the next nn lines, print one integer bibi. For each ii, |ai−bi|<1|ai−bi|<1 must be met.

If there are multiple answers, print any.

Examples

Input

Output

4
2
-2
-4

Input

Output

Note

The first example is explained in the legend.

In the second example, we can round the first and fifth numbers up, and the second and third numbers down. We can round the fourth number neither up, nor down.

【题解】

先全部向下取整得到的数加起来看是不是等于零不是的话不是的话按顺序变直到和等于0就ok了，他不是按照四舍五入来的

#include<cstdio>
#include<cmath>
#include<iostream>
#include<vector>
using namespace std;
const int N = 1e5+10;
double a[N];
int b[N];
int main()
{
	int n;
	long long  diff=0;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%lf",&a[i]);
		b[i]=floor(a[i]);
		diff+=b[i];
	}
	for(int i=1;i<=n&&diff<0;i++)
	{
		if(a[i]-b[i]<1e-6) continue;
		diff++;
		b[i]++;
	}
	for(int i=1;i<=n;i++)
		printf("%d\n",b[i]);
	return 0;
}