1340: A Sample Problem
来源:互联网 发布:淘宝上的台式机能买吗 编辑:程序博客网 时间:2024/04/30 03:50
#include<stdio.h>
1340
int main()
{
int T, flag;
long long a;
scanf("%d", &T);
while(T--&&1 <= T <= 100)
{
scanf("%lld", &a);
flag=0;
while(a&&1 <= a <= 1000000000)
{
if(a%10==7)
{
flag=1;
break;
}
a=a/10;
}
if(flag)
{
printf("Lucky\n");
}
else
{
printf("Unlucky\n");
}
}
return 0;
}
1340
int main()
{
int T, flag;
long long a;
scanf("%d", &T);
while(T--&&1 <= T <= 100)
{
scanf("%lld", &a);
flag=0;
while(a&&1 <= a <= 1000000000)
{
if(a%10==7)
{
flag=1;
break;
}
a=a/10;
}
if(flag)
{
printf("Lucky\n");
}
else
{
printf("Unlucky\n");
}
}
return 0;
}
0 0
- 1340: A Sample Problem
- lingo sample code for a QP problem
- CSU(ACM入门)1340 A Sample Problem 1341 String and Arrays 1342 Double 1343 Long Long 1344 Special Judge
- Problem E: 类模板Sample
- A XSLT Sample
- a simple jsm sample
- A sample of Generics.
- A sample of indexers.
- a sample of Interators
- A simple Hibernate sample
- A sample for map
- A BTEQ IMPORT SAMPLE
- A simple mysql sample
- A sample Java App
- A Sample Linker Script
- A Sample Crash Log
- A sample highlighting QGraphicsEffect
- a starting sample of paint
- coj 1261: 水仙花数
- Linux时间子系统之一:clock source(时钟源)
- ptmalloc
- 灵魂尽头——小时代电影全记录III(平装)pdf下载
- 并查集之冗余关系
- 1340: A Sample Problem
- Happy Number
- Bitmap与Drawable、byte[]、图片资源、图片文件的转换(二)
- networkx笔记:绘制基本网络图
- onfocus事件
- 1341: String and Arrays
- JAVA基础一大堆0813Web项目
- 选择排序SelectSort
- coj 1342: Double