http://w.atwiki.jp/isa_rentacs/ Isa@Code集積場 ja 2011-06-19T01:06:36+09:00 1308413196 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/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[t 2011-06-19T00:33:50+09:00 1308411230 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 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 https://w.atwiki.jp/isa_rentacs/pages/42.html #include <iostream> using namespace std; int main(void){ int state; //前回の動いた方向 int x, y; //current position bool horizon[5][4]; bool vertical[4][5]; char tmp; int i,j; for(i=0;i<9;i++){ if(i%2 == 0){ for(j=0;j<4;j++){ cin >> tmp; if(tmp == '1'){ horizon[i/2][j] = true; }else{ horizon[i/2][j] = false; } } }else{ for(j=0;j<5;j++){ cin >> tmp; if(tmp == '1'){ vertical[i/2][j] = true; }else{ vertical[i/2][j] = false; } } } } state = 'R'; cout << "R"; x = 0; y = 1; while(!(x == 0 && y == 0)){ if(state == 'R'){ if(x - 1 >= 0 && vertical[x-1][y] ){ state = 'U'; x--; cout << "U"; }else if(y <= 3 && horizon[x][y]){ state = 'R'; y++; cout << "R"; }else if(x <= 3 && vertical[x][y]){ state = 'D'; x++; cout << "D"; }else{ state = 'L'; y--; cout << "L"; } }else if(state == 'D'){ if(y <= 3 && horizon[x][y]){ state = ' 2011-06-16T23:33:33+09:00 1308234813 https://w.atwiki.jp/isa_rentacs/pages/41.html #include <iostream> using namespace std; int main(void){ int state; //前回の動いた方向 int x, y; //current position bool horizon[5][4]; bool vertical[4][5]; char tmp; int i,j; for(i=0;i<9;i++){ if(i%2 == 0){ for(j=0;j<4;j++){ cin >> tmp; if(tmp == '1'){ horizon[i/2][j] = true; }else{ horizon[i/2][j] = false; } } }else{ for(j=0;j<5;j++){ cin >> tmp; if(tmp == '1'){ vertical[i/2][j] = true; }else{ vertical[i/2][j] = false; } } } } state = 'R'; cout << "R"; x = 0; y = 1; while(!(x == 0 && y == 0)){ if(state == 'R'){ if(x - 1 >= 0 && vertical[x-1][y] ){ state = 'U'; x--; cout << "U"; }else if(y <= 3 && horizon[x][y]){ state = 'R'; y++; cout << "R"; }else if(x <= 3 && vertical[x][y]){ state = 'D'; x++; cout << "D"; }else{ state = 'L'; y--; cout << "L"; } }else if(state == 'D'){ if(y <= 3 && horizon[x][y]){ state = ' 2011-06-16T23:33:02+09:00 1308234782 https://w.atwiki.jp/isa_rentacs/pages/40.html #include <iostream> using namespace std; int main(void){ char field[8][8]; char tmp; int i,j; while(1){ for(i=0;i<8;i++){ for(j=0;j<8;j++){ cin >> field[i][j]; //cout << field[i][j]; } //cout << endl; } //それぞれの形について判別 //まず左上のマスを探す for(i=0;i<8;i++){ for(j=0;j<8;j++){ if(field[i][j] == '1') goto NEXT; } } NEXT: //cout << i << " " << j << endl; if(j+3 <= 7 && field[i][j+1] == '1' && field[i][j+2] == '1' && field[i][j+3] == '1'){ //横一列 cout << "C" << endl; }else if(i+3 <= 7 && field[i+1][j] == '1' && field[i+2][j] == '1' && field[i+3][j] == '1'){ //縦一列 cout << "B" << endl; }else if(j+1 <= 7 && i+1 <= 7 && field[i][j+1] == '1' && field[i+1][j] == '1' && field[i+1][j+1] == '1'){ //正方形 cout << "A" << endl; }else if(i+2 <= 7 && j+1 <= 7 && field[i+1][j] == '1' && field[i+1][j+1] == '1' && field[i+2][j+1] == '1'){ //1 0 // 2011-06-16T23:32:28+09:00 1308234748 https://w.atwiki.jp/isa_rentacs/pages/39.html #include <complex> #include <iostream> #include <cmath> using namespace std; typedef complex<double> P; //XY座標 #define X real() #define Y imag() double tri2s(double xa, double ya, double xb, double yb, double xc, double yc){ double a, b, c, s; a = sqrt((xb - xc) * (xb - xc) + (yb - yc) * (yb - yc)); b = sqrt((xa - xc) * (xa - xc) + (ya - yc) * (ya - yc)); c = sqrt((xb - xa) * (xb - xa) + (yb - ya) * (yb - ya)); s = (a+b+c) / 2; cout << sqrt(s * (s - a) * (s - b) * (s - c)) << endl; return sqrt(s * (s - a) * (s - b) * (s - c)); } double p2deg(double xa, double ya, double xb, double yb, double xc, double yc){ double a, b, c, s, cos; a = sqrt((xb - xc) * (xb - xc) + (yb - yc) * (yb - yc)); b = sqrt((xa - xc) * (xa - xc) + (ya - yc) * (ya - yc)); c = sqrt((xb - xa) * (xb - xa) + (yb - ya) * (yb - ya)); cos = (b * b + c * c - a * a) / 2 * b * c; return acos(cos); } // 直線 2011-06-16T23:31:19+09:00 1308234679