\t\t\t\t\u3076\u3063\u3061\u3083\u3051A\u3057\u304b\u5408\u3063\u3066\u306a\u3044\u306e\u3067\u3001\u89e3\u304d\u65b9\u306b\u3064\u3044\u3066\u306f\u306a\u3093\u3082\u8a00\u3048\u306a\u3044\u3002
\n\u7d50\u679c\u306f15\u70b9\/penalty 36:23\u3067162\u4f4d\u3002\u306a\u3093\u3068\u304b\u76ee\u6a19\u306eT\u30b7\u30e3\u30c4\u306b\u306f\u5c4a\u3044\u3066\u305f\u3002
\n\u53c2\u6226\u3057\u306a\u304c\u3089\u8003\u3048\u3066\u305f\u3053\u3068\u3092\u53c2\u6226\u8a18\u3068\u3057\u3066\u3060\u3089\u3060\u3089\u66f8\u3044\u3066\u307f\u308b\u3002<\/p>\n
[cpp]
\n#include <iostream>
\n#include <vector>
\n#include <cmath>
\nusing namespace std;<\/p>\n
const double PI = acos(-1.0);<\/p>\n
double solve(vector<int>& E) {
\n sort(E.begin(), E.end());
\n \/\/ \u77ed\u3044\u65b9\u304b\u3089E0, E1, E2…\u3068\u3059\u308b\u3068\u3001\u5186\u5468\u4e0a\u3067… E4 E2 E0 E1 E3 ..
\n \/\/ \u307f\u305f\u3044\u306b\u4e26\u3076\u3088\u3046\u4e26\u3073\u66ff\u3048\u308b
\n vector<int> ordered;
\n for (int i = 0; i < E.size(); i++)
\n if (i % 2 == 0) ordered.push_back(E[i]);
\n for (int i = E.size()-1; i >= 0; i–)
\n if (i % 2 != 0) ordered.push_back(E[i]);<\/p>\n
double answer = 0;
\n for (int i = 0; i < ordered.size(); i++) {
\n double e1 = ordered[i];
\n double e2 = i != ordered.size()-1 ? ordered[i+1] : ordered[0];
\n answer += e1 * e2 * sin(2 * PI \/ ordered.size()) \/ 2;
\n }
\n return answer;
\n}<\/p>\n
int main() {
\n int T; cin >> T;
\n for (int i = 1; i <= T; i++) {
\n int K; cin >> K;
\n vector<int> E(K);
\n for (int j = 0; j < K; j++) cin >> E[j];<\/p>\n
double answer = solve(E);
\n cout.precision(10);
\n cout << "Case #" << i << ": " << answer << endl;
\n }
\n}
\n[\/cpp]\n<\/ul>\n
(\u203b \u4ee5\u4e0b\u306f\u6700\u521d\u304b\u3089\u554f\u984c\u53d6\u308a\u9055\u3048\u305f\u307e\u307e\u53f3\u5f80\u5de6\u5f80\u3057\u305f\u8a18\u9332\u3067\u3042\u308a\u306a\u3093\u306e\u53c2\u8003\u306b\u3082\u306a\u308a\u307e\u305b\u3093)<\/strong><\/p>\n [cpp] string solve(string A, string B) { \/\/ \u3057\u3083\u304f\u3068\u308a\u6cd5\u3067A’\u306e\u90e8\u5206\u6587\u5b57\u5217\u3092\u53d6\u308a\u51fa\u3057\u3066\u3001B’\u306e\u90e8\u5206\u6587\u5b57\u5217\u306b\u306a\u3063\u3066\u3044\u306a\u3044\u3082\u306e\u3092\u63a2\u3059 int main() { cout << "Case #" << i << ": " << answer << endl; \u4e88\u9078\u3001\u6c7a\u52dd\u3068\u697d\u3057\u304b\u3063\u305f\uff01\u4eca\u56de\u3067\u7af6\u6280\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u3084\u308b\u4eba\u5897\u3048\u305f\u306f\u305a\u3060\u3057\u3001\u307e\u305f\u65e5\u672c\u8a9e\u306eCodeJam\u3084\u3063\u3066\u6b32\u3057\u3044\u306a\u3002\u30b9\u30ad\u30eb\u3068\u843d\u3061\u7740\u304d\u3092\u8eab\u306b\u3064\u3051\u3066\u6b21\u56de\u306f\u3082\u3063\u3068\u3044\u3044\u9806\u4f4d\u3068\u308a\u305f\u3044\u3002\u30c1\u30e3\u30ec\u30f3\u30b8\u30d6\u30c3\u30af\u3068GCJ\u904e\u53bb\u554f\u3068TopCoder\u3067\u935b\u3048\u3088\u3046\t\t<\/p>\n","protected":false},"excerpt":{"rendered":"\n
\n#include <iostream>
\n#include <vector>
\n#include <algorithm>
\nusing namespace std;<\/p>\n
\n \/\/ A\/B:twitter -> A’\/B’: TwitteR
\n string A_dash = A;
\n A_dash[0] = toupper(A_dash[0]);
\n A_dash[A_dash.size()-1] = toupper(A_dash[A_dash.size()-1]);
\n string B_dash = B;
\n B_dash[0] = toupper(B_dash[0]);
\n B_dash[B_dash.size()-1] = toupper(B_dash[B_dash.size()-1]);<\/p>\n
\n int head = 0;
\n int tail = 0;
\n int curAstahNam = 0;
\n string curPattern = A_dash;
\n while(tail < A_dash.size()) {
\n string subsec(A_dash, head, tail-head+1); \/\/ subsec: subsequence of A
\n if (B_dash.find(subsec) == string::npos) {
\n \/\/ pattern: *aaa* \u307f\u305f\u3044\u306a\u6700\u7d42\u7684\u306a\u8b58\u5225\u30d1\u30bf\u30fc\u30f3\u3002
\n string pattern = (head == 0 ? "" : "*") + subsec + (tail == A.size()-1 ? "" : "*");
\n for (int i = 0; i < pattern.size(); i++) pattern[i] = tolower(pattern[i]);
\n int astahNum = (head == 0 ? 0 : 1) + (tail == A.size()-1 ? 0 : 1);
\n string prevResult = curPattern;
\n \/\/ pattern\u3092\u3001\u554f\u984c\u306e\u512a\u5148\u9806\u4f4d\u306b\u5f93\u3063\u3066\u66f4\u65b0
\n if (pattern.size() < curPattern.size() ||
\n (pattern.size() == curPattern.size() && astahNum < curAstahNam) ||
\n (pattern.size() == curPattern.size() && astahNum == curAstahNam && pattern < curPattern)) {
\n curPattern = pattern;
\n curAstahNam = astahNum;
\n }
\n head++;
\n } else {
\n tail++;
\n }
\n }
\n return curPattern;
\n}<\/p>\n
\n int T; cin >> T;
\n string A, B;
\n for (int i = 1; i <= T; i++) {
\n cin >> A >> B;
\n string answer = solve(A, B);<\/p>\n
\n }
\n}
\n[\/cpp]\n<\/ul>\n\u53cd\u7701<\/h3>\n
\n