Coderforces Nearly Lucky Number
2017-06-15 08:55
363 查看
http://codeforces.com/problemset/problem/110/A
import java.util.Scanner;
public class Nearly_Lucky_Number {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long n = scanner.nextLong();
//计数幸运数字的个数
int count = 0;
while(n >0) {
long temp = n % 10;
if(temp == 4 || temp == 7) count++;
n = n /10;
}
if(count == 0) {
System.out.println("NO");
return ;
}
boolean flag = lucky(count);
if(!flag) {
for(int i = 2; i*i <= n; i++) {
if(n % i == 0 && (lucky(i) || lucky(count/i))) {
System.out.println("YES");
return;
}
}
System.out.println("NO");
} else {
System.out.println("YES");
}
}
public static boolean lucky(int n) {
while(n > 0) {
int temp = n %10 ;
if(temp != 4 && temp != 7) {
return false;
}
n = n /10;
}
return true;
}
}
import java.util.Scanner;
public class Nearly_Lucky_Number {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long n = scanner.nextLong();
//计数幸运数字的个数
int count = 0;
while(n >0) {
long temp = n % 10;
if(temp == 4 || temp == 7) count++;
n = n /10;
}
if(count == 0) {
System.out.println("NO");
return ;
}
boolean flag = lucky(count);
if(!flag) {
for(int i = 2; i*i <= n; i++) {
if(n % i == 0 && (lucky(i) || lucky(count/i))) {
System.out.println("YES");
return;
}
}
System.out.println("NO");
} else {
System.out.println("YES");
}
}
public static boolean lucky(int n) {
while(n > 0) {
int temp = n %10 ;
if(temp != 4 && temp != 7) {
return false;
}
n = n /10;
}
return true;
}
}
相关文章推荐
- CodeForces 110 A.Nearly Lucky Number(水~)
- A. Nearly Lucky Number
- Codeforces 110A-Nearly Lucky Number(实现)
- 【ECJTU_ACM 11级队员2012年暑假训练赛(8) - G - Nearly Lucky Number】
- 『NYIST』第九届河南省ACM竞赛队伍选拔赛[正式赛二]- Nearly Lucky Number(Codeforces Beta Round #84 (Div. 2 Only)A. Nearly)
- 110A - Nearly Lucky Number
- Problem--110A--Codeforces--Nearly Lucky Number
- Codeforces刷题之路——110A Nearly Lucky Number
- codeforces 110A(Nearly Lucky Number) Java
- 【string】#84 A. Nearly Lucky Number
- Coderforces Lucky Division
- coderforces 455C 并查集+树的直径
- codeforces A. Fox and Number Game
- 杭电OJ BestCoder28期1001Missing number问题(小技巧偏移法)
- coderforces--418div2 B. An express train to reveries
- Coderforces Chat room
- Codeforces Round #228 (Div. 2) A. Fox and Number Game
- Educational Codeforces Round 39 (Rated for Div. 2) E Largest Beautiful Number
- 文章标题 CoderForces 298B : Sail(分类)
- Codeforces Round #427 (Div. 2) A. Key races B. The number on the board C. Star sky