RosettaCodeData/Task/Babbage-problem/V-(Vlang)/babbage-problem.v

const (
    target  = 269696
    modulus = 1000000
)
fn main() {
	for n := 1; ; n++ { // Repeat with n=1, n=2, n=3, ...
		square := n * n
		ending := square % modulus
		if ending == target {
			println("The smallest number whose square ends with $target is $n")
			return
		}
	}
}