UVa--12289 One-Two-Three
2014-03-27 21:36
148 查看
#include<stdio.h>
#include<string.h>
#include <iostream>
#include <string>
using namespace std;
int main()
{
char str1[]={"one"},str3[10];
int i,j,n,l,flog=0;
while(scanf("%d",&n)!=EOF)
{
getchar();
for(i=1;i<=n;i++)
{
flog=0;
gets(str3);
l=strlen(str3);
if(l==5)
printf("3\n");
else if(l==3)
{
for(j=0;j<=2;j++)
{
if(str1[j]==str3[j])
flog++;
}
if(flog>=2)
printf("1\n");
else printf("2\n");
}
}
}
}
#include<string.h>
#include <iostream>
#include <string>
using namespace std;
int main()
{
char str1[]={"one"},str3[10];
int i,j,n,l,flog=0;
while(scanf("%d",&n)!=EOF)
{
getchar();
for(i=1;i<=n;i++)
{
flog=0;
gets(str3);
l=strlen(str3);
if(l==5)
printf("3\n");
else if(l==3)
{
for(j=0;j<=2;j++)
{
if(str1[j]==str3[j])
flog++;
}
if(flog>=2)
printf("1\n");
else printf("2\n");
}
}
}
}
相关文章推荐
- UVa 12289 - One-Two-Three
- UVa 12289 - One-Two-Three
- Uva 12889 One-Two-Three
- One-Two-Three (Uva)
- UVa 12289 One-Two-Three (water ver.)
- UVA 12289 One-Two-Three
- uva-10250-The Other Two Trees
- HDU 5878 I Count Two Three
- 12289 - One-Two-Three
- uva 190 Circle Through Three Points (计算几何) 面向对象的封装
- 奥运英语[9]数字:1,2,3……10 Numbers: one, two, three...ten.
- UVa 10250 - The Other Two Trees
- UVA-10250 The Other Two Trees
- UVA10250-The Other Two Trees
- UVa 11342 - Three-square
- [LeetCode] Power of Three | Power of Two
- 2016 ACM/ICPC 青岛区域赛网络赛 1001 I Count Two Three(打表+二分)
- HDU 5878 I Count Two Three (打表+二分查找) -2016 ICPC 青岛赛区网络赛
- HDU5878-I Count Two Three
- LeetCode - 231/326/342 - Power of Two/Three/Four