fork(2) download
copy 
  1. #include <stdio.h>
  2.  
  3. int is_palindrome(unsigned long n1){
  4.     unsigned long n2 = 0;
  5.     if (!(n1 % 10)) return 0;
  6.     while (n2 < n1) {
  7.         n2 *= 10;
  8.         n2 += n1 % 10;
  9.         n1 /= 10;
  10.     }
  11.     return n2 == n1 || n2 / 10 == n1;
  12. }
  13.  
  14. int main(void) {
  15. 	printf("%d %d\n", 11000, is_palindrome(11000));
  16. 	printf("%d %d\n", 213321, is_palindrome(213321));
  17. 	printf("%d %d\n", 113322, is_palindrome(113322));
  18. 	printf("%d %d\n", 1, is_palindrome(1));
  19. 	printf("%d %d\n", 12321, is_palindrome(12321));
  20. 	printf("%d %d\n", 32123, is_palindrome(32123));
  21. 	printf("%d %d\n", 123321, is_palindrome(123321));
  22. 	printf("%d %d\n", 321123, is_palindrome(321123));
  23. 	return 0;
  24. }
  25.  
Success #stdin #stdout 0s 2112KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
11000 0
213321 0
113322 0
1 1
12321 1
32123 1
123321 1
321123 1
https://ideone.com/YaQlud
language:
C (gcc 8.3)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!