Code/Resource
Windows Develop
Linux-Unix program
Internet-Socket-Network
Web Server
Browser Client
Ftp Server
Ftp Client
Browser Plugins
Proxy Server
Email Server
Email Client
WEB Mail
Firewall-Security
Telnet Server
Telnet Client
ICQ-IM-Chat
Search Engine
Sniffer Package capture
Remote Control
xml-soap-webservice
P2P
WEB(ASP,PHP,...)
TCP/IP Stack
SNMP
Grid Computing
SilverLight
DNS
Cluster Service
Network Security
Communication-Mobile
Game Program
Editor
Multimedia program
Graph program
Compiler program
Compress-Decompress algrithms
Crypt_Decrypt algrithms
Mathimatics-Numerical algorithms
MultiLanguage
Disk/Storage
Java Develop
assembly language
Applications
Other systems
Database system
Embeded-SCM Develop
FlashMX/Flex
source in ebook
Delphi VCL
OS Develop
MiddleWare
MPI
MacOS develop
LabView
ELanguage
Software/Tools
E-Books
Artical/Document
f0212.cpp
Package: c.rar [view]
Upload User: puke2000
Upload Date: 2022-07-25
Package Size: 912k
Code Size: 1k
Category:
CSharp
Development Platform:
Visual C++
- //=====================================
- // f0212.cpp
- // 用筛法判断素数
- //=====================================
- #include<iostream>
- #include<vector>
- #include<fstream>
- using namespace std;
- //-------------------------------------
- int main(){
- vector<int> prime(10000,1);
- for(int i=2; i<100; ++i) // 构造素数集合
- if(prime[i])
- for(int j=i; i*j<10000; ++j)
- prime[i*j]=0;
- ifstream in("a.txt");
- for(int a; in>>a && a>1 && a<10000; ) // 判断素数
- cout<<a<<" is"<<(prime[a] ? "":" not")<<" a prime.n";
- }//====================================