Đếm số Armstrong
Code:
#include <bits/stdc++.h>
using namespace std;
int isAmstrong(long long n)
{
long long sum = 0 , temp;
int remainder , digits = 0;
temp = n;
while(temp != 0)
{
digits++;
temp = temp / 10;
}
temp = n;
while(temp != 0)
{
remainder = temp % 10;
sum = sum + pow(remainder , digits);
temp = temp / 10;
}
if(n == sum)
return 1;
else
return 0;
}
int main()
{
long long n;
cin>>n;
long long a[n], count = 0;
for(int i = 0 ; i < n ;i++)
cin>>a[i];
for(int i = 0 ; i < n ; i++)
{
if(isAmstrong(a[i]) == 1)
count++;
}
cout<<count;
return 0;
}
