void
Tux::try_start_walking()
{
if (m_moving)
return;
if (m_input_direction == Direction::NONE)
return;
auto level = m_worldmap->at_level();
// We got a new direction, so lets start walking when possible
Vector next_tile;
if ((!level || level->is_solved() || level->is_perfect()
|| (Editor::current() && Editor::current()->is_testing_level()))
&& m_worldmap->path_ok(m_input_direction, m_tile_pos, &next_tile)) {
m_tile_pos = next_tile;
m_moving = true;
m_direction = m_input_direction;
m_back_direction = reverse_dir(m_direction);
} else if (m_ghost_mode || (m_input_direction == m_back_direction)) {
m_moving = true;
m_direction = m_input_direction;
m_tile_pos = m_worldmap->get_next_tile(m_tile_pos, m_direction);
m_back_direction = reverse_dir(m_direction);
}
}
int main(int argc, const char *argv[])
{
int num, perf;
printf("Digite o número que deseja saber se é perfeito : ");
scanf("%d", &num);
perf=is_perfect(num);
printf("%d", perf);
return 0;
}
int main() {
size_t max = 10000;
for (size_t i = 0; i < max; i++) {
if (is_perfect(i)) {
printf("liczba %ld jest doskonała\n", i);
}
}
}
int main() {
size_t max = 10000;
// size_t max = 100000000;
// jak przyspieszyć proces???
for (size_t i = 0; i < max; i++) {
if (is_perfect(i)) {
printf("Liczba %ld jest doskonała\n", i);
}
}
}
int print_properties_num(longnum num)
{
printf("%llu:\nprime factors: ", num);
print_prime_factors(num);
printf("\n");
if ( is_abundant(num) ) printf(" abundant");
if ( is_amicable(num) ) printf(" amicable");
if ( is_apocalyptic_power(num) ) printf(" apocalyptic_power");
if ( is_aspiring(num) ) printf(" aspiring");
if ( is_automorphic(num) ) printf(" automorphic");
if ( is_cake(num) ) printf(" cake");
if ( is_carmichael(num) ) printf(" carmichael");
if ( is_catalan(num) ) printf(" catalan");
if ( is_composite(num) ) printf(" composite");
if ( is_compositorial(num) ) printf(" compositorial");
if ( is_cube(num) ) printf(" cube");
if ( is_deficient(num) ) printf(" deficient");
if ( is_easy_to_remember(num) ) printf(" easy_to_remember");
if ( is_ecci1(num) ) printf(" ecci1");
if ( is_ecci2(num) ) printf(" ecci2");
if ( is_even(num) ) printf(" even");
if ( is_evil(num) ) printf(" evil");
if ( is_factorial(num) ) printf(" factorial");
if ( is_fermat(num) ) printf(" fermat");
if ( is_fibonacci(num) ) printf(" fibonacci");
if ( is_google(num) ) printf(" google");
if ( is_happy(num) ) printf(" happy");
if ( is_hungry(num) ) printf(" hungry");
if ( is_hypotenuse(num) ) printf(" hypotenuse");
if ( is_lazy_caterer(num) ) printf(" lazy_caterer");
if ( is_lucky(num) ) printf(" lucky");
if ( is_mersenne_prime(num) ) printf(" mersenne_prime");
if ( is_mersenne(num) ) printf(" mersenne");
if ( is_narcissistic(num) ) printf(" narcissistic");
if ( is_odd(num) ) printf(" odd");
if ( is_odious(num) ) printf(" odious");
if ( is_palindrome(num) ) printf(" palindrome");
if ( is_palindromic_prime(num) ) printf(" palindromic_prime");
if ( is_parasite(num) ) printf(" parasite");
if ( is_pentagonal(num) ) printf(" pentagonal");
if ( is_perfect(num) ) printf(" perfect");
if ( is_persistent(num) ) printf(" persistent");
if ( is_power_of_2(num) ) printf(" power_of_2");
if ( is_powerful(num) ) printf(" powerful");
if ( is_practical(num) ) printf(" practical");
if ( is_prime(num) ) printf(" prime");
if ( is_primorial(num) ) printf(" primorial");
if ( is_product_perfect(num) ) printf(" product_perfect");
if ( is_pronic(num) ) printf(" pronic");
if ( is_repdigit(num) ) printf(" repdigit");
if ( is_repunit(num) ) printf(" repunit");
if ( is_smith(num) ) printf(" smith");
if ( is_sociable(num) ) printf(" sociable");
if ( is_square_free(num) ) printf(" square_free");
if ( is_square(num) ) printf(" square");
if ( is_tetrahedral(num) ) printf(" tetrahedral");
if ( is_triangular(num) ) printf(" triangular");
if ( is_twin(num) ) printf(" twin");
if ( is_ulam(num) ) printf(" ulam");
if ( is_undulating(num) ) printf(" undulating");
if ( is_untouchable(num) ) printf(" untouchable");
if ( is_vampire(num) ) printf(" vampire");
if ( is_weird(num) ) printf(" weird");
printf("\n\n");
return 0;
}
int main(int argc, const char *argv[]) {
int n;
is_perfect(n);
return 0;
}
