Description: A small program based on Euclid .
1. Determine an integer is not a prime number
2 Calculate the greatest common divisor of two integers
3 Calculate the least common multiple of two integers
4 input a, b ,output in the form of s* a+ t* b = gcd (a, b)
5. Seeking input a, m in a mold of inverse m
To Search:
File list (Check if you may need any files):
Debug\OuJiLiDe.obj
.....\vc60.idb
.....\vc60.pdb
.....\欧几里德.exe
.....\欧几里德.ilk
.....\欧几里德.pch
.....\欧几里德.pdb
OuJiLiDe.cpp
欧几里德.dsp
欧几里德.dsw
欧几里德.ncb
欧几里德.opt
欧几里德.plg
Debug
Download