http://w.atwiki.jp/isa_rentacs/ Isa@Code集積場 ja 2011-06-19T01:07:28+09:00 1308413248 https://w.atwiki.jp/isa_rentacs/pages/13.html AOJで解いたもの ***Volume 0 [[0030>[aoj]0030]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0030]] Sum of Integers [[0031>[aoj]0031]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0031]] Weight [[0032>[aoj]0032]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0032]] Plastic Board [[0033>[aoj]0033]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0033]] Ball [[0034>[aoj]0034]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0034]] Railway Lines [[0035>[aoj]0035]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0035]] Is it Convex? [[0036>[aoj]0036]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0036]] A Figure on Surface [[0037>[aoj]0037]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0037]] Path on a Grid [[0038>[aoj]0038]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0038]] Poker Hand [[0039>[aoj]0039]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0039]] Roman Figure [[0040>[aoj]0040]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0040]] Affine Cipher [[0043>[aoj]0043]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0043]] Puzzle [[0044>[aoj]0044]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0044]] Prime Number II [[0052>[aoj]0052]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0052]] Factorial II [[0053>[aoj]0053]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0053]] Sum of Prime Numbers [[0054>[aoj]0054]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0054]] Sum of Nth decimal places [[0055>[aoj]0055]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0055]] Sequence [[0056>[aoj]0056]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0056]] Goldbach's Conjecture [[0057>[aoj]0057]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0057]] The Number of Area [[0058>[aoj]0058]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0058]] Orthogonal [[0059>[aoj]0059]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0059]] Intersection of Rectangle [[0060>[aoj]0060]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0060]] Card Game [[0061>[aoj]0061]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0061]] Rank Checker [[0062>[aoj]0062]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0062]] What is the Bottommost? [[0063>[aoj]0063]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0063]] Palindrome [[0064>[aoj]0064]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0064]] Secret Number [[0065>[aoj]0065]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0065]] Trading [[0066>[aoj]0066]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0066]] Tic Tac Toe [[0067>[aoj]0067]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0067]] The Number of Island [[0072>[aoj]0072]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0072]] Carden Lantern ┗最小全域木を求める問題。 [[0073>[aoj]0073]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0073]] Surface Area of Quadrangular Pyramid [[0074>[aoj]0074]] [[問題>http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0074]] Videotape 2011-06-19T01:07:28+09:00 1308413248 https://w.atwiki.jp/isa_rentacs/pages/48.html #include <iostream> #include <cstdio> using namespace std; int main(void){ int sec, sec3; int used; int hh,mm,ss; int reth,retm,rets; while(cin >> hh >> mm >> ss){ if(hh == -1 && mm == -1 && ss == -1) break; used = hh * 3600 + mm * 60 + ss; sec = 7200 - used; sec3 = sec * 3; reth = sec / 3600; sec -= 3600 * reth; retm = sec / 60; sec -= 60 * retm; rets = sec; printf("%02d:%02d:%02d\n", reth, retm, rets); reth = sec3 / 3600; sec3 -= 3600 * reth; retm = sec3 / 60; sec3 -= 60 * retm; rets = sec3; printf("%02d:%02d:%02d\n", reth, retm, rets); } } 2011-06-19T01:06:36+09:00 1308413196 https://w.atwiki.jp/isa_rentacs/pages/47.html #include <iostream> #include <cmath> #include <cstdio> using namespace std; int main(void){ int x, h; while(cin >> x){ cin >> h; if(x == 0 && h == 0) break; printf("%.6f\n",sqrt((double)x/2 * (double)x/2 + h*h) * x * 2 + x * x); } } 2011-06-19T00:58:50+09:00 1308412730 https://w.atwiki.jp/isa_rentacs/pages/46.html 与えられたグラフの最小全域木を求める方法。priority_queueを使えばo(|E|log|V|)。 [手順] 1,適当な点を始点として取る 2,そこから到達可能な点のうち、最小コストのものを 到達済み集合に加える 3,すべての頂点に到達済みならば終了、そうでなければ2へ [実装例] [[0072>[aoj]0072]]にて使用 q.push(node(0,0)); //始点として頂点0を取る、コストは0 while(!q.empty()){ node tmp = q.top(); q.pop(); if(used[tmp.num] == true) continue; //popしたvが到達済みなら捨てる used[tmp.num] = true; //到達済みにする ret += tmp.cost; //コストを加える for(int i=0;i<n;i++){ if(cost[tmp.num][i] != INF){ //加えた頂点から到達可能な頂点と、そのコストをPQにpush q.push(node(cost[tmp.num][i], i)); } } } 2011-06-19T00:51:00+09:00 1308412260 https://w.atwiki.jp/isa_rentacs/pages/32.html ***Vectorのcopy std::copy(w.begin(), w.end(), back_inserter(v)); ***priority_queueの要素に構造体等を指定する方法 挿入したいstructを struct node{ int cost, num; node(int c, int n): cost(c), num(n){} bool operator >(const node &e) const{ return cost > e.cost; } }; とする。ここでソート基準となるoperator>を書いておく。 あとは priority_queue<node, vector<node>, greater<node> > q; とすればおk。greaterを指定するとoperator>の逆順(昇順)になる。 priority_queueはdefaultで昇順なのでそれに合わせておいたほうがいいかも。 ***n次元配列へのstd::fill 例だけ。 int field[n][n]; std::fill((int *)field, (int *)field+n*n, 12345); とすればよい。 2011-06-19T00:44:29+09:00 1308411869 https://w.atwiki.jp/isa_rentacs/pages/45.html #include <iostream> #include <queue> #include <cstring> #include <algorithm> using namespace std; #define INF 1<<30 struct node{ int cost, num; node(int c, int n): cost(c), num(n){} bool operator >(const node &e) const{ return cost > e.cost; } }; int main(void){ int n; int m; int n1,n2,c; while(1){ cin >> n; if(n == 0) break; bool visited[n]; memset(visited, false, sizeof(visited)); int cost[n][n]; fill((int *)cost, (int *)cost+n*n, INF); bool used[n]; fill(used, used+n, false); priority_queue<node, vector<node>, greater<node> > q; int ret=0; cin >> m; for(int i=0;i<m;i++){ cin >> n1; cin.ignore(); cin >> n2; cin.ignore(); cin >> c; cost[n1][n2] = c / 100 - 1; cost[n2][n1] = c / 100 - 1; } q.push(node(0,0)); while(!q.empty()){ node tmp = q.top(); q.pop(); //cout << "poped: from " << tmp.num << " cost " << tmp.cost << endl; if(used[tmp.num] == true) continue; used[tmp.num] = true; ret += tmp.cost; for(int i=0;i<n;i++){ if(cost[tmp.num][i] != INF){ q.push(node(cost[tmp.num][i], i)); } } } cout << ret << endl; } } 2011-06-19T00:33:50+09:00 1308411230 https://w.atwiki.jp/isa_rentacs/pages/2.html **メニュー -[[トップページ]] -[[プラグイン紹介>プラグイン]] -[[まとめサイト作成支援ツール]] -[[メニュー]] -[[メニュー2]] ---- #twitter_badge{{ <script> new TWTR.Widget({ version: 2, type: 'profile', rpp: 4, interval: 6000, width: 250, height: 300, theme: { shell: { background: '#333333', color: '#ffffff' }, tweets: { background: '#000000', color: '#ffffff', links: '#4aed05' } }, features: { scrollbar: false, loop: false, live: false, hashtags: true, timestamp: true, avatars: false, behavior: 'all' } }).render().setUser('Isa_rentacs').start(); </script>}} ---- **リンク -[[@wiki>>http://atwiki.jp]] -[[@wikiご利用ガイド>>http://atwiki.jp/guide/]] // リンクを張るには "[" 2つで文字列を括ります。 // ">" の左側に文字、右側にURLを記述するとリンクになります //**更新履歴 //#recent(20) &link_editmenu(text=ここを編集) 2011-06-16T23:56:30+09:00 1308236190 https://w.atwiki.jp/isa_rentacs/pages/1.html -[[AOJ>AOJ]] -[[Topcoder]] -[[Algorithm]] 2011-06-16T23:43:21+09:00 1308235401 https://w.atwiki.jp/isa_rentacs/pages/44.html #include <iostream> #include <string> #include <sstream> #include <vector> using namespace std; string encrypt(string str, int alpha, int beta){ int size = str.size(); string ret = ""; for(int i=0;i<size;i++){ if('a' <= str[i] && str[i] <= 'z'){ ret += (alpha * (str[i] - 'a') + beta) % 26 + 'a'; } } //cout << str << " is encrypted to: "<< ret << endl; return ret; } int main(void){ string thiss("this"); string that("that"); int n; cin >> n; cin.ignore(); //CR+LF for(int i=0;i<n;i++){ vector<string> strv; string str, tmp; getline(cin, str); int numwords; istringstream iss(str); int alpha, beta; bool decided = false; decided = false; while(iss >> tmp){ strv.push_back(tmp); } numwords = strv.size(); for(int j=0;j<numwords;j++){ /* test */ //cout << "checking: " << strv[j] << endl; /* */ if(strv[j].size() == 4){ if(strv[j][0] == strv[j][3]){// strv[j] is a candidate of that //cout << "candidate of that" << endl; beta = strv[j][2] - 'a'; //cout << "beta is " << beta << endl; //calc alpha int k=0; while(strv[j][0] - 'a' +k*26 < beta || (k*26 + strv[j][0] - 'a' - beta) % 19 != 0){ // 19 == t k++; } alpha = (k*26+(strv[j][0] - 'a' - beta)) / 19; //cout << "alpha is " << alpha << endl; string encrypted = ""; encrypted = encrypt("that", alpha, beta); if(strv[j] == encrypted){ decided = true; } }else{// strv[j] is a candidate of this //cout << "candidate of this" << endl; tmp = strv[j]; if(tmp[0] < tmp[3]) tmp[0] += 26; alpha = tmp[0] - tmp[3]; //cout << "alpha is " << alpha << endl; if(tmp[3] - 'a' >= alpha * 18 % 26){ beta = tmp[3] - 'a' - alpha * 18 % 26; }else{ beta = tmp[3] - 'a' + 26 - alpha * 18 % 26; } //cout << "beta is " << beta << endl; string encrypted = encrypt("this", alpha, beta); if(strv[j] == encrypted){ decided = true; } } } if(decided) break; } //decrypt for(int j=0;j<str.size();j++){ int k=0; if('a' <= str[j] && str[j] <= 'z'){ while(str[j]-'a' + k*26 < beta || (k*26 + str[j] - 'a' - beta) % alpha != 0) k++; str[j] = ((k*26 + str[j] - 'a' - beta) / alpha) + 'a'; } } cout << str << endl; } return 0; } 2011-06-16T23:35:09+09:00 1308234909 https://w.atwiki.jp/isa_rentacs/pages/43.html #include <iostream> #include <string> using namespace std; int getvalue(char c){ if(c == 'I'){ return 1; }else if(c == 'V'){ return 5; }else if(c == 'X'){ return 10; }else if(c == 'L'){ return 50; }else if(c == 'C'){ return 100; }else if(c == 'D'){ return 500; }else if(c == 'M'){ return 1000; } return -1; } int parseStr(string str){ int ret=0; int now; int next; for(int i=0;i<str.size();i++){ now = getvalue(str[i]); if(i != str.size() - 1){ next = getvalue(str[i+1]); }else{ next = -1; } if(now >= next){ ret += now; }else{ ret += next - now; i++; } } return ret; } int main(void){ string tmp; while(cin >> tmp){ cout << parseStr(tmp) << endl; } return 0; } 2011-06-16T23:34:35+09:00 1308234875