uvaoj 489
2012-06-18 12:17
225 查看
看到有些解法是先将字符中的重复的去除,我这里用一个数组标志一下有相同的效果。
#include <stdio.h>
#include <string.h>
int dict[256];
void main()
{
int i;
char src[1280];
int error;
int correct;
char guess[1280];
int round;
int t;
memset(dict,0,sizeof(int)*256);
scanf("%d",&round);
scanf("%s",src);
scanf("%s",guess);
while(round!=-1){
error=0;
correct=0;
memset(dict,0,sizeof(int)*256);
for(i=0;i<strlen(src);i++){
if(dict[src[i]]==0) correct++;
dict[src[i]]=1;
}
for(i=0;i<strlen(guess);i++){
t=dict[guess[i]];
if(t==0){
error++;
dict[guess[i]]=-2;
}else if(t==1){
correct--;
dict[guess[i]]=-1;
}
if(correct==0||error>=7) break;
}
printf("Round %d\n",round);
if(correct==0){
printf("You win.\n");
}else if(error>=7){
printf("You lose.\n");
}else{
printf("You chickened out.\n");
}
scanf("%d",&round);
scanf("%s",src);
scanf("%s",guess);
}
}
#include <stdio.h>
#include <string.h>
int dict[256];
void main()
{
int i;
char src[1280];
int error;
int correct;
char guess[1280];
int round;
int t;
memset(dict,0,sizeof(int)*256);
scanf("%d",&round);
scanf("%s",src);
scanf("%s",guess);
while(round!=-1){
error=0;
correct=0;
memset(dict,0,sizeof(int)*256);
for(i=0;i<strlen(src);i++){
if(dict[src[i]]==0) correct++;
dict[src[i]]=1;
}
for(i=0;i<strlen(guess);i++){
t=dict[guess[i]];
if(t==0){
error++;
dict[guess[i]]=-2;
}else if(t==1){
correct--;
dict[guess[i]]=-1;
}
if(correct==0||error>=7) break;
}
printf("Round %d\n",round);
if(correct==0){
printf("You win.\n");
}else if(error>=7){
printf("You lose.\n");
}else{
printf("You chickened out.\n");
}
scanf("%d",&round);
scanf("%s",src);
scanf("%s",guess);
}
}
相关文章推荐
- UVAOJ489-Hangman Judge
- uvaoj 489 - Hangman Judge
- uvaoj-489:刽子手
- UVaOJ 489 - Hangman Judge
- UVaOJ_489 - Hangman Judge
- UVaOJ 489 - Hangman Judge
- UVaOJ 489 - Hangman Judge
- UVaoj 340 Master-Mind Hints
- uvaoj 488 - Triangle Wave
- UVaOj 494 Kindergarten Counting Game
- UvaOJ 550 - Multiplying by Rotation
- UVa 489 - Hangman Judge
- UVaOJ 784 - Maze Exploration
- UVaOJ 131 – The Psychic Poker Player
- UVaOJ 424
- UVaOJ 401 - Palindromes
- UvaOJ 10132 - File Fragmentation
- UVaOJ 152 - Tree's a Crowd
- UVaOJ101---The Blocks Problem
- UVaOJ532---Dungeon Master