Solution to Problem 12 on Project Euler


Improve your writing skills in 5 minutes a day with the Daily Writing Tips email newsletter.

The problem:

———-
The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:

1, 3, 6, 10, 15, 21, 28, 36, 45, 55, …

Let us list the factors of the first seven triangle numbers:

1: 1
3: 1,3
6: 1,2,3,6
10: 1,2,5,10
15: 1,3,5,15
21: 1,3,7,21
28: 1,2,4,7,14,28

We can see that 28 is the first triangle number to have over five divisors.

What is the value of the first triangle number to have over five hundred divisors?

———

My Solution

#include <stdio.h>

int main(){
  int i,j,counter,max,ans;
  ans=0;
  max=0;
  for(i=1;i<13000;i++){
    ans=ans+i;
    counter=0;
    for (j=1;j<1000000;j++){
      if(ans%j==0)
        counter++;
      }
    if (counter>max){max=counter;}
    if (counter>500){printf("%dn",ans);break;}
    }
  printf("last ans=%d e max counter=%dn",ans,max);
  return 0;
}

Leave a Reply

Your email address will not be published. Required fields are marked *