Codeforces Beta Round #91 (Div. 2 Only) A. Lucky Division【暴力/判断是不是幸运数字4,7的倍数】 A. Lucky Division time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Petya loves lucky numbers. Everybody knows that lucky numbers are po...
CodeForces 122A Lucky Division SubmitStatusPractice Description Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits4and7. For example, numbers47,744,4are lucky and5,17,467are not. Petya calls a numberalmost ...
Codeforces Problems-122A. Lucky Division 直接从2到n枚举,能整除的就判断有无4和7就好了! 1#include <cstdio>2#include <iostream>34usingnamespacestd;56boolf(intn)7{8while(n)9{10if(n %10!=4&& n %10!=7)11returnfalse;12n /=10;13}14returntrue;15}1617intmain()18{19intn;2021while(cin...