본문 바로가기

prompt

[토요라운드] A. 쿠폰 (10179)

20퍼 할인해서 출력하면 됩니다

 

 

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <bitset>

#define xx first
#define yy second
#define all(x) (x).begin(), (x).end()

using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
using iii = tuple<int, int, int>;


int     main()
{
	int t;
	scanf("%d", &t);

	for (int i = 0; i < t; i++)
	{
		double d;
		scanf("%lf", &d);

		printf("$%.2lf\n", d * 0.8);
	}
}