Thirth solution of Project Euler

Click And See The Problem 30

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

int getpow(int i) {
i=i*i*i*i*i;
return i;
}


int check(int dizi[],int i) {
int tot=0;
for(int k=0;k<6;k++) {
if(dizi[k]!=NULL) {
tot+=getpow(dizi[k]);
}
}
if(tot==i) {
return i;
}else {
return 0;
}
}



void make() {
 int result=0;
for(int i=2;i<1000000;i++) {
int * dizi = new int[6],c,k=5;
c=i;
do {
dizi[k]=c%10;
c/=10;
             k--;
}while(k>=0);
result+=check(dizi,i);
}
  cout << "Problem:30\nResult :" << result  << " efekanpulatli.blogspot.com " << endl;
}

int main()
{
make();
   system("pause");
   return 0;
}