产生随机数
2015-06-20 13:42
411 查看
#include <stdio.h>
#include <stdlib.h>//需要导入此类
int main(int argc,
const char * argv[]) {
//产生0~2,3个随机数
int computer=arc4random_uniform(3);
附代码:猜拳
#include <stdio.h>
#include <stdlib.h>
int main(int argc,
const char * argv[]) {
int computer=arc4random_uniform(3);
printf("computer:%d\n",computer);
printf("请出拳:0.剪刀,1.石头,2.布\n");
int player;
scanf("%d",&player);
if(player<0||player>2){
printf("please print again!\n");
}
else if(player==0){
if(computer==1)
{
printf("computer win!\n");
}
else if(computer==2){
printf("player win!\n");
}
else{
printf("play again!\n");
}
}
else if (player==1){
if(computer==2)
{
printf("computer win!\n");
}
else if(computer==0){
printf("player win!\n");
}
else{
printf("play again!\n");
}
}
else{
if(computer==0)
{
printf("computer win!\n");
}
else if(computer==1){
printf("player win!\n");
}
else{
printf("play again!\n");
}
}
return 0;
}
#include <stdlib.h>//需要导入此类
int main(int argc,
const char * argv[]) {
//产生0~2,3个随机数
int computer=arc4random_uniform(3);
附代码:猜拳
#include <stdio.h>
#include <stdlib.h>
int main(int argc,
const char * argv[]) {
int computer=arc4random_uniform(3);
printf("computer:%d\n",computer);
printf("请出拳:0.剪刀,1.石头,2.布\n");
int player;
scanf("%d",&player);
if(player<0||player>2){
printf("please print again!\n");
}
else if(player==0){
if(computer==1)
{
printf("computer win!\n");
}
else if(computer==2){
printf("player win!\n");
}
else{
printf("play again!\n");
}
}
else if (player==1){
if(computer==2)
{
printf("computer win!\n");
}
else if(computer==0){
printf("player win!\n");
}
else{
printf("play again!\n");
}
}
else{
if(computer==0)
{
printf("computer win!\n");
}
else if(computer==1){
printf("player win!\n");
}
else{
printf("play again!\n");
}
}
return 0;
}
相关文章推荐
- hdu 5261 蜀道难(deque 双端队列)
- POJ 2229 Sumsets
- HDOJ 5269 ZYB loves Xor I
- 围住浮动元素的三种方法
- 暂时不更新博客
- jxta-P2P学习
- LeetCode之“散列表”:Two Sum && 3Sum && 3Sum Closest && 4Sum
- CF E. Vanya and Brackets(添加一对括号使得表达式的值最大)
- Java串口通信详细解释
- java产生任意范围内不重复的随机数
- Codeforces Round #260 (Div. 1) C. Civilization 并查集,直径
- 黑马程序员--java学习笔记第七天
- VS中的活动debug和活动cpu
- leetcode--Roman to Integer
- Explicit keyword
- 【安德鲁斯】基于脚本的数据库"增量更新",如果不改变,每次更新java代码、!
- Spring中的AOP简述
- win7硬盘安装ubuntu双系统的方法
- 游戏有这么好玩么?
- USACO——Milking Cows 挤牛奶