Codeforces Beta Round #91 (Div. 2 Only) A题
2013-06-23 13:01
267 查看
这道题目估计大家会很熟悉,的确和前面那个找幸运数很相同,不过有不同,就是规则不同,这里就是能整除幸运数的也是幸运数,由于数目的范围很小,所以可以先找出1000内包含4或者7的幸运数,在暴力找出!
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
int i;
int a[15]={4,7,44,47,74,77,444,777,447,474,744,477,747,774};
int n;
int flag=0;
scanf("%d",&n);
for(i=0; i<14; i++)
{
if(n%a[i]==0)
{
flag=1;
break;
}
}
if(flag)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
}
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
int i;
int a[15]={4,7,44,47,74,77,444,777,447,474,744,477,747,774};
int n;
int flag=0;
scanf("%d",&n);
for(i=0; i<14; i++)
{
if(n%a[i]==0)
{
flag=1;
break;
}
}
if(flag)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
}
相关文章推荐
- VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) B. Work Group 树形dp
- Codeforces Beta Round #83 (Div. 1 Only) E.Darts 凸多边形面积交
- Codeforces Beta Round #92 (Div. 1 Only) A. Prime Permutation 暴力
- Codeforces Beta Round #4 (Div. 2 Only) C. Registration system hash
- Codeforces Beta Round #9 (Div. 2 Only) C. Hexadecimal's Numbers dfs
- Codeforces Round #437 (Div. 2 C. Ordering Pizza 贪心 only two types of pizza
- 【CS Round #44 (Div. 2 only) B】Square Cover
- #9 (Div. 2 Only) B. Running Student (枚举)
- Codeforces Beta Round #91 (Div. 1 Only) E. Lucky Array 分块
- Codeforces Beta Round #9 (Div. 2 Only)
- codeforces水题100道 第十二题 Codeforces Beta Round #91 (Div. 2 Only) A. Lucky Division (brute force)
- Codeforces Beta Round #6 (Div. 2 Only) A. Triangle
- Codeforces Beta Round #16 (Div. 2 Only)——C
- odeforces Beta Round #25 (Div. 2 Only), problem: (D) Roads not only in Berland 图论 DFS
- Codeforces Beta Round #4 (Div. 2 Only) C. Registration system hash
- Codeforces Beta Round #91 (Div. 2 Only) C. Lucky Sum
- CS Academy Round #74 (Div. 2 only) A B C D E
- Codeforces Beta Round #4 (Div. 2 Only) A. Watermelon
- Codeforces Beta Round #22 (Div. 2 Only)-D. Segments
- Codeforces Beta Round #83 (Div. 1 Only) E.Darts 凸多边形面积交