Description: Given a set A [1 ... n], and one from A to its own mapping f, to find the largest number of elements in a subset of S belongs to A, and makes the S satisfy: 1. f to S is mapped to itself 2. No two elements of S mapped to the same element.
To Search:
- [addons] - Image processing matlab code, image pre-
File list (Check if you may need any files):
222\222\222.cpp
...\...\222.vcproj
...\...\222.vcproj.ACER-7CFBBC7F5B.wangchen.user
...\...\Debug\222.exe.embed.manifest
...\...\.....\222.exe.embed.manifest.res
...\...\.....\222.exe.intermediate.manifest
...\...\.....\222.obj
...\...\.....\BuildLog.htm
...\...\.....\mt.dep
...\...\.....\vc80.idb
...\...\.....\vc80.pdb
...\222.ncb
...\222.sln
...\222.suo
...\debug\222.exe
...\.....\222.ilk
...\.....\222.pdb
...\222\Debug
...\222
...\debug
222
Download