RiseOJ는 solved.ac와 제휴 관계가 없습니다. 티어 아이콘 © solved.ac. solved.ac
포럼
COCI00181

Okupljanje

Bronze IV 브론즈 IV
난이도
1s
시간 제한
32MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

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 at a party last Saturday and he knows how many people there were per \(1\ \text{m}^2\).

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šo's information and you'd like to know how much each of the articles was wrong.

제약
입력 형식

The first line of input contains two positive integers, \(Lj\) (\(1 \le Lj \le 10\)), the number of people per \(\text{m}^2\), and \(P\) (\(1 \le P \le 1000\)), the area of the room the party was held in.

The second line of input contains \(5\) positive integers less than \(10^6\), 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 Krešo's (correct) number \(Lj \cdot P\).

서브태스크
서브태스크점수설명

Test 1

20점

None

Test 2

20점

None

Test 3

20점

None

Test 4

20점

None

Test 5

20점

None

예제 1
입력
1 10
10 10 10 10 10
출력
0 0 0 0 0
예제 2
입력
5 20
99 101 1000 0 97
출력
-1 1 900 -100 -3
문제 정보

riseoj 작성

출처 COCI 2010/2011 Contest 6

평가 및 의견

Okupljanje

개요
출제자 난이도 Bronze IV 브론즈 IV 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.

풀이 제출

Okupljanje

게스트로 둘러보고 있습니다. 로그인하면 풀이를 제출하고 진행 상황을 확인할 수 있습니다. 로그인하고 제출하기
공개
C++20 Tab 들여쓰기 · Ctrl+/ 주석 토글 · Enter 자동 들여쓰기
1 1 1 0 공백: 4 · UTF-8