Given a positive integer n, the integers a1, a2, ..., An. Consider the sequence of segments a1, a2, ..., AN (a subsequence of consecutive terms) consisting of perfect numbers. Find the largest of the lengths of the segment. Establish a procedure allowing to recognize the perfect number.

1.pas

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．