assembly asap pls

Problem

Write a protected-mode, flat memory model program that computes the following. 1. Prompt for and get an integer, n, from the user. 2. Compute and save the divisors and prime divisors of all the numbers in the range, [2, n]. 3. Display the results in an n-1 by 3 table with the following headings.

n Divisors Prime Divisors

Adobe Flash PHP SEO ウェブリサーチャー ウェブサイトのデザイン

プロジェクトID: #848955

プロジェクトについて