如何找到连续数字序号中缺少的序号

从1-20中找到缺失的数字，C语言实现代码如下

#include <stdio.h>
int main()
{
    int a[20] = {13,5,7,8,9,1,2,3,4,15,16,17,18,19};
	int b[20] = {0};
	int i=0;
	for (i = 0; i <20; i++)
	{
		b[a[i]] = 1;
	}
	for(i = 0; i < 20; i++) {
		if (b[i] == 0) {
			printf("the lost number is %d\n" , (i));
		}
	}
	return 0;
 }