int a_b(int a,int b,int m)
{
int ret=0 ,i=0 ,sum =1 ;
for (i=0 ;i<b;i++)
sum =sum *a;
ret=sum %m;
return ret;
}
int find_num(int n)
{
int a=0 ,b=0 ,c=0 ,i=0 ,j=0 ,flag=1 ;
int arr[10 ]={0 };
a=n;
while (flag)
{
a++;
b=a;
c=a;
i=0 ;
while (b>0 )
{
arr[i]=(b%10 );
b/=10 ;
i++;
}
for (j=0 ;j<=i;j++)
c=c-arr[j];
if (c>=n)
flag=0 ;
else flag=1 ;
}
return a;
}
#include <stdio.h>
#include <math.h>
int * maximumNumbers(const int *nums,int numsSize)
{
int *p=nums;
int i=0 ,j=0 ;
int first=0 ,second=0 ,third=0 ;
int arr[3 ]={0 };
for (i=0 ;i<numsSize;i++)
{
if (abs (p[i])>first)
first=p[i];
}
for (i=0 ;i<numsSize;i++)
{
if (p[i]==first)
{
for (j=i;j<numsSize;j++)
p[i]=p[j];
p[j]=0 ;
}
}
for (i=0 ;i<numsSize;i++)
{
if (abs (p[i])>second)
second=p[i];
}
for (i=0 ;i<numsSize;i++)
{
if (p[i]==second)
{
for (j=i;j<numsSize;j++)
p[i]=p[j];
p[j]=0 ;
}
}
for (i=0 ;i<numsSize;i++)
{
if (abs (p[i])>third)
third=p[i];
}
for (i=0 ;i<numsSize;i++)
{
if (p[i]==third)
{
for (j=i;j<numsSize;j++)
p[i]=p[j];
p[j]=0 ;
}
}
arr[0 ]=first;arr[1 ]=second;arr[2 ]=third;
return arr;
}