프로그램 명: coci_okupl
제한시간: 1 초
큰 파티 다음날 모든 사람들은 두 가지 사실을 알고 싶어 한다. 누가 왔는지 얼마나 많은 사람이 왔는지?
큰 파티라 어떤 사람도 거기에 얼마나 많은 사람이 왔는지를 정확히 할지 못한다. 당신의 친구 크레오는 1 평방미터에 얼마나 많은 사람이 있는 가를 안다.
그 파티에 대한 5 개의 신문을 읽은 후 5 각 신문에서 추측한 참석 인원수를 쓴 후 크레오에게 보여 주어 몇 개의 신문이 틀린지를 알아내어야 한다.
차이가 양수이면 더 많은 인원을 , 음수이면 부족하게 인원을 추측 한 것이다.
The day after a giant party everybody wants to know a couple of things - who was at the party and how many people were there? Since parties are usually pretty big, nobody actually knows the correct number of people who were there. Your friend Kre.o was on a party last Saturday and he knows how many people there were per 1 m2.
While reading 5 newspaper articles about that party, you have written down 5 numbers, specifying how many people were present at the party according to each of the articles. You believe Kre.ofs information and youfd like to know how much each of the articles was wrong.
입력
The first line of input contains two positive integers, Lj (1 <= Lj <= 10), the number of people per m2, and P (1 <= P <= 1000), the area of the room the party was held in.
The second line of input contains 5 positive integers less than 106, the number of people present at the party according to each of the articles.
출력
The first and only line of output must contain 5 numbers, the difference between the number of people written in an article and Kreio's (correct) number.
입출력 예
input
1 10
10 10 10 10 10
output
0 0 0 0 0
input
5 20
99 101 1000 0 97
output
-1 1 900 -100 -3
출처:coci
[질/답]
[제출 현황]
[푼 후(0)]