nimendongde .. <\/p>\n
…<\/p>\n
\r\n\/* This Code is Submitted by xiaodao for Problem 1004 at 2010-10-24 14:13:43 *\/\r\n#include <iostream>\r\n#include <cmath>\r\nusing namespace std;\r\n \r\nconst int N = 9999;\r\n \r\nstring s; int x;\r\nint l, r;\r\n \r\n \r\nstring L(int x){\r\n string res;\r\n while (x!=0){\r\n res = char(x%10 + 48) + res;\r\n x \/= 10;\r\n }\r\n return res;\r\n}\r\n \r\nstring R(int x){\r\n string res;\r\n while (x!=0){\r\n res = res + char(x%10 + 48);\r\n x \/= 10;\r\n }\r\n return res;\r\n}\r\n \r\nstring M(int x){\r\n string res; res = x + 48;\r\n return res;\r\n}\r\n \r\nint g(string x){\r\n int res = 0;\r\n for (int i=x.size()-1;i>=0;i--)\r\n res = res * 10 + (x[i]-48);\r\n return res;\r\n}\r\n \r\nbool isPrime(int x){\r\n int t = sqrt(x);\r\n for (int i=2;i<=t;i++)\r\n if (x%i==0) return false;\r\n return true;\r\n}\r\n \r\nvoid Letsgo(){\r\n for (int i=1;i<=N;i++){\r\n for (int j=0;j<=9;j++){\r\n x = g(L(i) + M(j) + R(i));\r\n if (x > r) return;\r\n if (l<=x && x<=r && isPrime(x)) cout << x << endl;\r\n }\r\n }\r\n}\r\n \r\n \r\n \r\nint main(){\r\n while (cin >> l >> r){\r\n if (l<=5 && 5<=r) cout << 5 << endl;\r\n if (l<=7 && 7<=r) cout << 7 << endl;\r\n if (l<=11 && 11<=r) cout << 11 << endl;\r\n Letsgo();\r\n }\r\n} \r\n<\/pre>\nExternal link: <\/h3>\n