fork download
copy 
  1. #include<stdio.h>
  2. #include<math.h> 
  3. int sqrRoot(double numberToCheck);
  4. int isPalindrome(int numToCheck);
  5.  
  6.  
  7. int isPalindrome(int numToCheck)
  8. {
  9. 	int n=0,rev=0;
  10. 	double dig=0.0;
  11. 	n = numToCheck;
  12.  
  13. 	while(numToCheck>0)
  14. 	{
  15. 	  dig = numToCheck % 10;
  16.       rev = rev * 10 + dig;
  17.       numToCheck = numToCheck / 10;
  18. 	}
  19.  
  20. 	if (n==rev)
  21. 	{
  22. 		return 1;
  23. 	}
  24.  
  25. 	return 0;
  26. }
  27.  
  28.  
  29. int main(void)
  30. {
  31. 	int i=0,j=0,cases=1,steps=0,low=0,high=0,isSquare=0,count=0,bit=0;
  32. 	scanf("%d", &steps);
  33.  
  34. 	while (cases<=steps)
  35. 	{
  36. 		scanf(" %d %d", &low, &high );
  37. 		for (j=low;j<=high;j++)
  38. 		{
  39. 			isSquare = sqrRoot(j);
  40. 			if (isSquare == 1)
  41. 			{
  42. 				bit = isPalindrome(j);
  43. 				if (bit==1)
  44. 				{
  45. 					count ++;
  46. 					//printf("\n wowowo# %d", j);
  47. 				}
  48. 			}
  49. 		}
  50.  
  51. 		printf("Case #%d: %d \n", cases,count);
  52. 		count = 0;
  53. 		bit = 0;
  54. 		cases++;
  55. 	}
  56.  
  57. 	return 0;
  58. }
  59.  
  60. int sqrRoot(double numberToCheck)
  61. {
  62.  
  63. 	double result = sqrt(numberToCheck);
  64. 	int y=0;
  65. 	y = result;
  66. 	if (result == y)
  67. 	{
  68.  
  69. 		return 1;
  70. 	}
  71.  
  72. 	else
  73. 	{
  74. 		return 0;
  75. 	}
  76. }
Success #stdin #stdout 0s 2900KB
comments (?)
stdin
copy 
100
130 708
65 742
197 666
1 6
21 221
120 502
10 120
733 902
177 544
120 302
8 584
1 742
91 332
1 10
1 4
1 101
384 742
9 302
120 221
9 121
611 905
58 401
303 584
3 121
8 121
3 109
283 830
3 221
484 742
2 133
8 122
121 484
201 296
524 860
7 221
1 121
43 839
384 584
65 302
404 589
8 484
122 1000
130 934
122 483
3 6
215 685
21 742
3 9
8 9
1 5
1 221
1 9
3 4
7 499
121 485
1 122
25 364
8 10
1 485
1 109
5 465
4 104
1 1
7 10
9 484
8 302
8 109
809 960
3 104
1 65
631 982
292 562
21 121
185 420
9 221
24 866
481 653
743 983
187 964
8 221
3 302
484 584
190 933
3 65
3 485
7 485
1 1000
1 302
3 10
1 104
209 228
1 2
7 9
100 1000
217 656
9 742
4 5
286 602
65 584
3 5
stdout
copy 
Case #1: 2 
Case #2: 3 
Case #3: 1 
Case #4: 2 
Case #5: 1 
Case #6: 2 
Case #7: 0 
Case #8: 0 
Case #9: 1 
Case #10: 1 
Case #11: 3 
Case #12: 6 
Case #13: 1 
Case #14: 3 
Case #15: 2 
Case #16: 3 
Case #17: 2 
Case #18: 2 
Case #19: 1 
Case #20: 2 
Case #21: 1 
Case #22: 1 
Case #23: 1 
Case #24: 3 
Case #25: 2 
Case #26: 2 
Case #27: 2 
Case #28: 3 
Case #29: 2 
Case #30: 3 
Case #31: 2 
Case #32: 2 
Case #33: 0 
Case #34: 1 
Case #35: 2 
Case #36: 4 
Case #37: 3 
Case #38: 1 
Case #39: 1 
Case #40: 1 
Case #41: 3 
Case #42: 2 
Case #43: 2 
Case #44: 0 
Case #45: 1 
Case #46: 2 
Case #47: 3 
Case #48: 2 
Case #49: 1 
Case #50: 2 
Case #51: 4 
Case #52: 3 
Case #53: 1 
Case #54: 3 
Case #55: 2 
Case #56: 4 
Case #57: 1 
Case #58: 1 
Case #59: 5 
Case #60: 3 
Case #61: 2 
Case #62: 2 
Case #63: 1 
Case #64: 1 
Case #65: 3 
Case #66: 2 
Case #67: 1 
Case #68: 0 
Case #69: 2 
Case #70: 3 
Case #71: 1 
Case #72: 1 
Case #73: 1 
Case #74: 0 
Case #75: 2 
Case #76: 3 
Case #77: 1 
Case #78: 0 
Case #79: 2 
Case #80: 2 
Case #81: 3 
Case #82: 1 
Case #83: 2 
Case #84: 2 
Case #85: 4 
Case #86: 3 
Case #87: 6 
Case #88: 4 
Case #89: 2 
Case #90: 3 
Case #91: 0 
Case #92: 1 
Case #93: 1 
Case #94: 3 
Case #95: 1 
Case #96: 4 
Case #97: 1 
Case #98: 1 
Case #99: 2 
Case #100: 1
https://ideone.com/Gv2rfH
language:
C++ (gcc 8.3)
created:
12 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!