#include<iostream>
#include<cstdlib>
using namespace std;
 
int main()
{
	int a[8]={1,0,3,0,3,6,7,2};
	const size_t n = sizeof(a) / sizeof(a[0]);
	size_t pos;
	int Min;
 
	/* find first non-zero position*/
	for(pos=0; a[pos]==0 && pos < n; ++pos);
 
	if(pos==n) {
		/* if position == n , all zero*/
		cout << "all of element are zero\n";
	} else {
		/* find min */
		Min = a[pos];
		for(++pos; pos<n; ++pos)
			if(a[pos] < Min && a[pos]!=0) 
				Min = a[pos];
		cout << Min << endl;
	}
	return 0;
}

I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGNzdGRsaWI+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpCnsKCWludCBhWzhdPXsxLDAsMywwLDMsNiw3LDJ9OwoJY29uc3Qgc2l6ZV90IG4gPSBzaXplb2YoYSkgLyBzaXplb2YoYVswXSk7CglzaXplX3QgcG9zOwoJaW50IE1pbjsKCgkvKiBmaW5kIGZpcnN0IG5vbi16ZXJvIHBvc2l0aW9uKi8KCWZvcihwb3M9MDsgYVtwb3NdPT0wICYmIHBvcyA8IG47ICsrcG9zKTsKCglpZihwb3M9PW4pIHsKCQkvKiBpZiBwb3NpdGlvbiA9PSBuICwgYWxsIHplcm8qLwoJCWNvdXQgPDwgImFsbCBvZiBlbGVtZW50IGFyZSB6ZXJvXG4iOwoJfSBlbHNlIHsKCQkvKiBmaW5kIG1pbiAqLwoJCU1pbiA9IGFbcG9zXTsKCQlmb3IoKytwb3M7IHBvczxuOyArK3BvcykKCQkJaWYoYVtwb3NdIDwgTWluICYmIGFbcG9zXSE9MCkgCgkJCQlNaW4gPSBhW3Bvc107CgkJY291dCA8PCBNaW4gPDwgZW5kbDsKCX0KCXJldHVybiAwOwp9