Problems
Given two integers A and B, A modulo B is the remainder when dividing A by B. For example, the numbers 7, 14, 27 and 38 become 1, 2, 0 and 2, modulo 3. Write a program that accepts 10 numbers as input and outputs each number modulo 42.
Input
The input will contain 10 non-negative integers, each smaller than 1000, one per line.
Output
Output the number modulo 42 for each line.
Example
1
2
3
4
5
6
7
8
9
10
1
2
3
4
5
6
7
8
9
10
Tag
Source
COCI 2006/2007 contest1 1 (변형)