10018 reverse and add.cpp

UVA solutions to few problems

#include<iostream>
#include<cmath>
using namespace std;
long long reverse(long long n)
{
     int arr[20];
     int i=0;
     long long sum=0;
     while(n>=1)
     {
                arr[i]=n%10;
                n=n/10;
                i++;
     }
     int end=i;
     for(i=0;i<end;i++)
     sum=sum+arr[i]*(long long)pow(double(10),(end-i-1));
     return sum;
}     
int main()
{
    long long n,add,rev;
    int test=1,num;
    cin>>num;
    while(test<=num)
    {
                 cin>>n;
                 rev=reverse(n);
                 int count=0;
                 while(rev!=n)
                 {
                              add=rev+n;
                              n=add;
                              rev=reverse(add);
                              count++;
                 }
                 cout<<reverse(10301);
                 cout<<count<<" "<<n<<endl;
    test++;
    }
    system("pause");
}