#include<math.h>
#include<stdio.h>
#include<malloc.h>
void flower(int a, int b)
{
int n = b - a+1;
int k = 0;
//int n = t,k=0;
//int arr[t];
//int* arr = (int*)malloc(sizeof(int)*t);
for (int i = 0; i < n; i++)
{
if (a == pow((float)(a % 10), 3) + pow((float)(a / 10 % 10), 3)
+ pow((float)(a / 100), 3))
{
printf("%d ", a);
k++;
}
a++;
}
if (k == 0)
{
printf("no\n");
}
else
printf("\n");
}
int main()
{
flower(100,120);
flower(300,380);
#include<stdio.h>
#include<malloc.h>
void flower(int a, int b)
{
int n = b - a+1;
int k = 0;
//int n = t,k=0;
//int arr[t];
//int* arr = (int*)malloc(sizeof(int)*t);
for (int i = 0; i < n; i++)
{
if (a == pow((float)(a % 10), 3) + pow((float)(a / 10 % 10), 3)
+ pow((float)(a / 100), 3))
{
printf("%d ", a);
k++;
}
a++;
}
if (k == 0)
{
printf("no\n");
}
else
printf("\n");
}
int main()
{
flower(100,120);
flower(300,380);
}
//output
no
370 371
请按任意键继续. . .