Seventh solution of Project Euler

Problem 7

#include "stdafx.h"
#include <iostream>
using namespace std;
void findout() {       // let's begin find out 10001 prime number
   int a,c=0,dizi[10002],d=0;
           for(a=1;d<10002;a++){
c=0;
for(int i=2;i<a;i++) {
if(a%i==0) {
c++;
}
}
if(c==0) {
dizi[d] = a;
d++;
}
}
cout << "10001.Prime Number : " << dizi[10001] << " efekanpulatli.blogspot.com" << endl;
}

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