Problem:
Score : 100 points

Problem Statement

We will buy a product for N yen (the currency of Japan) at a shop.

If we use only 1000-yen bills to pay the price, how much change will we receive?

Assume we use the minimum number of bills required.

Constraints

1 \leq N \leq 10000

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the amount of change as an integer.

Sample Input 1

1900

Sample Output 1

100

We will use two 1000-yen bills to pay the price and receive 100 yen in change.

Sample Input 2

3000

Sample Output 2

0

We can pay the exact price.

Solution in C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<string.h>

int main(void) {
	int N, i;
	char judge[100000][4];
	char* s1 = "AC", * s2 = "WA", * s3 = "TLE", * s4 = "RE";
	int a = 0, w = 0, t = 0, r = 0;

	scanf("%d", &N);

	for (i = 0; i < N; i++) {
		scanf("%s", judge[i]);
	}

	for (i = 0; i < N; i++) {
		if (strcmp(judge[i], s1) == 0) {
			a += 1;
		}
	}
	for (i = 0; i < N; i++) {
		if (strcmp(judge[i], s2) == 0) {
			w += 1;
		}
	}
	for (i = 0; i < N; i++) {
		if (strcmp(judge[i], s3) == 0) {
			t += 1;
		}
	}
	for (i = 0; i < N; i++) {
		if (strcmp(judge[i], s4) == 0) {
			r += 1;
		}
	}
	printf("AC x %d\n", a);
	printf("WA x %d\n", w);
	printf("TLE x %d\n", t);
	printf("RE x %d\n", r);

	return 0;
}