Project Euler Problem 21

Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).
If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers.


For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110;
therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.


Evaluate the sum of all the amicable numbers under 10000.

#include<iostream>
#include<vector>
using namespace std;


int num[10000]={0};


int get_sum_of_divisors(int num)
{

vector<int> tmp;
int i = 1;
int sum =0;
while(i<num)
{
if(num%i==0)
{
tmp.push_back(i);
}
i++;
}
for(i = 0;i<tmp.size();i++)
{
sum += tmp[i];
}

return sum;
}


 int SumOfDivisors(int num)
  {
      int sum = 1;
      for(int i=2; i<sqrt((float)num); i++)
      {
         if(num % i == 0)
         {
             sum += i + num /i;
         }
     }
     return sum;
 }

int main()
{
int result = 0;
for(int i = 0;i!=10000;i++)
{
num[i]=get_sum_of_divisors(i+1);
}
for(int i = 0;i!=10000;i++)
{
int tmp = 0;
int k =0;
tmp = num[i];
if(tmp>=10000)
continue;
if(num[tmp-1]== (i+1)&&tmp!=(i+1))
{
k=i+1;
result+=k;
result+=tmp;
}
}
result = result;
system("pause");
}