a.c

代码说明：

  Finding special triples of the form (n, n + 1, n + 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n + 1, n + 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.(Finding special triples of the form (n, n+ 1, n+ 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n+ 1, n+ 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.)