the algorithms episode one
来源:互联网 发布:高性能mysql 编辑:程序博客网 时间:2024/05/21 14:49
The following codes are dedicated to the research of integer, specially, to the prime number research.
#include "stdio.h"#define N 1000int main(){int i, j, a[N+1];for(a[1]=0,i=2;i<=N;i++)a[i]=1;for(j=2;j<=N/i;j++)a[i*j]=0;for(i=1;i<=N;i++)if(a[i])printf("%4d",i);printf("\n");system("pause");return 0;}
- the algorithms episode one
- Some thought about "The Parallel ADT and Algorithms"(part one)
- The Joining (Episode 122)
- The Scarecrow Returns (Episode 111)
- Algorithms—66.Plus One
- The Secret of Strand Hill (Episode 113)
- The Wrath of Achilles (Episode 116)
- The Devil You Know (Episode 117)
- Through The Looking Glass (Episode 119)
- The Importance of Algorithms
- The Most Important Algorithms
- The Most Important Algorithms
- Algorithms on the Internet
- The Aggregate Magic Algorithms
- The Most Important Algorithms
- The Most Important Algorithms
- HOJ_2430 Counting the algorithms
- The Most Important Algorithms
- Java程序员面试中的多线程问题总结一下!
- R can't be resolved to a variable解决办法
- Linux安装调试版本的Bochs
- 算法导论第六章 优先级队列
- VMware中安装ubuntu server
- the algorithms episode one
- 八大排序算法总结
- Win7配置 Maven
- 详解div+css相对定位和绝对定位用法
- 插值搜索
- Jquery表单插件ajaxForm用法详解
- JAVA TreeSet
- 1198. Substring
- secureCRT The remote system refused the connection