练习
2014-04-15 19:58
295 查看
随机点名
/* Note:Your choice is C IDE */#include "stdio.h"#include "stdlib.h"#define N 25main(){int i,j,temp;int students;for(i=0;i<N;i++){temp = rand()%45 +1 ;if(i>0){练习for(j=0;j<=i-1;j++){if(temp == students[j]){temp = rand()%45 +1;j=-1;}}}students[i] = temp;printf("the %d student no is : %d\n",i,students[i]);}}
相关文章推荐
- jquery图片上传前预览剪裁
- Objective-C Effective 技巧
- leetcode-Longest Consecutive Sequence(2014.3.31)
- leetcode-Maximum Depth of Binary Tree(2014.1.21)
- FATFS文件系统的移植
- 数据库的范式理论
- poj2917
- 0805
- 笔记之Ruby(一)
- leetcode-Merge Sorted Array(2014.2.8)
- 字符编码笔记
- 开始 python programming第三版案例分析
- Linux学习5-初学者注意事项
- leetcode-Minimum Depth of Binary Tree(2014.1.22)
- Merge Two & k Sorted Lists & Merge Sorted Array
- 离合器半联动点的判断和技巧 为您支招
- leetcode-Pascal's Triangle
- Python正则表达式---全部能匹配的子串迭代器finditer及findall及以中文匹配部分中文
- [数据结构]K-Max Sum
- ADA的故事