fork download
copy 
  1. #include<stdio.h>
  2. #include<stdbool.h>
  3. #include<string.h>
  4.  
  5. int pal(int n) //팰린드롬 찾는 함수
  6. {
  7. 	int check = 0;
  8. 	char ary[8];
  9. 	sprintf(ary, "%d", n); //숫자를 문자열로 변환
  10. 	int rich = strlen(ary);
  11.  
  12. 	for (int i = 0; i < rich/2; i++)
  13. 	{
  14. 		//printf("ary[%d] = %c\n", i, ary[i]);
  15. 		for (int j = 0; j < rich; j++)
  16. 		{
  17. 			//printf("ary[%d]=%c ", j, ary[j]);
  18. 		}
  19. 		if (ary[i] != ary[rich - i - 1])
  20. 		{
  21. 			//check = 0; //팰린드롬이 아니다
  22. 			//printf("nopal\n");
  23. 			//printf("ary[%d]=%d, ary[%d]=%d", i, ary[i], rich - i - 1, ary[rich - i - 1]);
  24. 			return 0;
  25. 		}
  26. 		else
  27. 		{
  28. 			//printf("pal\n");
  29. 			check = 1; //팰린드롬이다
  30. 		}
  31. 	}
  32. 	return check;
  33. }
  34.  
  35. int pal_sosu(int n) //소수를 찾고, pal함수를 통해 팰린드롬 구하기
  36. {
  37. 	int sosu = 1;
  38. 	for (int i = n;i<=102; i++)
  39. 	{
  40. 		for (int j = 2; j < i/2 ; j++)
  41. 		{
  42. 			if (i % j != 0)
  43. 			{
  44. 				sosu = 1; //소수다
  45. 			}
  46. 			else
  47. 			{
  48. 				sosu = 0; //소수가 아니다
  49. 				break;
  50. 			}
  51. 		}
  52. 		if (sosu == 1)
  53. 		{
  54. 			int a = pal(i);
  55. 			if (a == 1)
  56. 			{
  57. 				return i;
  58. 			}
  59. 		}
  60. 	}
  61. 	return 0;
  62. }
  63.  
  64. int main()
  65. {
  66. 	int n;
  67. 	int answer;
  68. 	scanf("%d", &n);
  69. 	answer = pal_sosu(n);
  70.  
  71. 	printf("%d", answer);
  72.  
  73.  
  74. 	return 0;
  75. }
  76.  
Success #stdin #stdout 0s 5292KB
comments (?)
stdin
copy 
1000000
stdout
copy 
Standard output is empty
https://ideone.com/DGV7Vs
language:
C (gcc 8.3)
created:
11 days 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!