Twenty-first solution of Project Euler

Click and Go Problem 21

#include "stdafx.h"
#include <iostream>
using namespace std;

void findout () {
int a,b,c,dizi[2][10001];
unsigned long long result=0;
for(a=1;a<10000;a++) {
dizi[0][a]=0;
for(b=1;b<a;b++) {
if(a%b==0) {
dizi[0][a]+=b;
                dizi[1][a] =a;
}
}
}

for(a=1;a<10000;a++) {

for(b=1;b<10000;b++) {
if(a == dizi[0][b] && b == dizi[0][a] && a!=b) {
int d = dizi[1][a] + dizi[1][b];
result+=d;
cout << a <<  "       toplamlari" << dizi[0][a]<<  "      "<< b  << "   toplamlari     " << dizi[0][b] << endl;

}
}
}

cout << result/2 << " efekanpulatli.blogspot.com " << endl;
}


int main() {

findout();
system("pause");
return 0;
}