uva oj 489
2011-09-18 14:25
169 查看
代码:
#include <stdio.h>
#include <string.h>
char str1[100];
char str2[100];
int main()
{
int n;
int i,j,count,num,flag;
while(scanf("%d",&n)&&n!=-1)
{
count=0;
num=0;
scanf("%s",str1);
scanf("%s",str2);
for(i=0;i<strlen(str2);i++)
{
flag=count;
for(j=0;j<strlen(str1);j++)
{
if (!isspace(str1[j]))
if (str2[i]==str1[j])
{
str1[j]=' ';
count++;
}
}
if (flag==count)
{
num++;
}
if (count==strlen(str1))
{
break;
}
if (num==7)
{
printf("Round %d\n",n);
printf("You lose.\n");
break;
}
}
if (num<7&&count==strlen(str1))
{
printf("Round %d\n",n);
printf("You win.\n");
}
if (num<7&&count<strlen(str1))
{
printf("Round %d\n",n);
printf("You chickened out.\n");
}
}
return 0;
}
#include <stdio.h>
#include <string.h>
char str1[100];
char str2[100];
int main()
{
int n;
int i,j,count,num,flag;
while(scanf("%d",&n)&&n!=-1)
{
count=0;
num=0;
scanf("%s",str1);
scanf("%s",str2);
for(i=0;i<strlen(str2);i++)
{
flag=count;
for(j=0;j<strlen(str1);j++)
{
if (!isspace(str1[j]))
if (str2[i]==str1[j])
{
str1[j]=' ';
count++;
}
}
if (flag==count)
{
num++;
}
if (count==strlen(str1))
{
break;
}
if (num==7)
{
printf("Round %d\n",n);
printf("You lose.\n");
break;
}
}
if (num<7&&count==strlen(str1))
{
printf("Round %d\n",n);
printf("You win.\n");
}
if (num<7&&count<strlen(str1))
{
printf("Round %d\n",n);
printf("You chickened out.\n");
}
}
return 0;
}
相关文章推荐
- UVa OJ 489 Hangman Judge
- UVA oj 489 Hangman Judge(字符串)
- UVa OJ 139 - Telephone Tangles (话费之纠结)
- UVa OJ 10112-Myacm Triangles
- UVa OJ 10994-Simple Addition
- UVa OJ 10171-Meeting Prof. Miguel...
- 489 - Hangman Judge
- UVa OJ 10038 - Jolly Jumpers
- Uva OJ 10115 - Automatic Editing
- Uva oj (算法入门经典) 排序与检索系列水题系列
- UVa OJ 194 - Triangle (三角形)
- UVa489 - Hangman Judge-难度2
- uva oj 401
- UVA 489 Hangman Judge
- UVa OJ 105 - The Skyline Problem
- UVA OJ 10035 - Primary Arithmetic
- Uva 489 - Hangman Judge
- UVA489-Hangman Judge
- UVa 489 Hangman Judge
- UVA 489 - Hangman Judge 未解决未解决未解决未解决