Palindrom

#include <stdio.h>
#include <stdlib.h>

int
main ()
{
  int i;
  int osszeg = 0;
  for (i = 0; i < 1000000; i++)
    {
      int x = i, t, y = 0;
      int tomb[35];
      while (x > 0)
    {
      t = x % 10;
      y = (y * 10) + t;
      x = x / 10;
    }

      /*if(i==y)
       */
      int b = i, j = 0;
      int k;
      while (b > 0)
    {
      t = b % 2;
      b = b / 2;
      tomb[j] = t;
      j++;
    }
      int feltetel = 1;
      for (k = j - 1; k >= 0; k--)
    {
      if (tomb[k] != tomb[j - k - 1])
        feltetel = 0;
    }
      if (feltetel && i == y)
    {

      osszeg = osszeg + y;

    }

    }
  printf ("Osszeg:%d\n", osszeg);
  return 0;
}