Số Armstrong
Code:
#include <bits/stdc++.h>
using namespace std;
int count(int n)
{
int i = 0;
while(n != 0)
{
int t = n % 10;
i++;
n = n / 10;
}
return i;
}
long long mux(int k , int n)
{
long long tich = 1;
for(int i = 1 ; i <= n ;i++)
{
tich = tich * k;
}
return tich;
}
int ArmstrongNumber(int n)
{
int k = count(n);
long long sum = 0;
while(n != 0)
{
int t = n % 10;
int s = mux(t,k);
sum = sum + s;
n = n / 10;
}
return sum;
}
int main()
{
long long n;
cin>>n;
for(long long i = 0 ; i < n ; i++)
{
if(ArmstrongNumber(i) == i)
cout<<i<<" ";
}
return 0;
}
