abc020.contest.atcoder.jp #include <iostream> #include <queue> #include <string> using namespace std; #define INF (1LL<<60) typedef pair<int,int> P_II; int h, w, t; string str[10]; P_II start, goal; bool BFS(int middle) { queue<P_II> que; long long cost[10][10]; const int dx[4]=</p_ii></int,int></string></queue></iostream>…

abc020.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int a, int b) { int number=b, digit=1; while (number > 0) { digit*=10; number/=10; } cout << (a*digit+b)*2 << endl; } int main(void) { int a, b; cin >> a >> b; Solve(a,b);</iostream>…

abc020.contest.atcoder.jp #include <iostream> #include <string> using namespace std; void Solve(int q) { string answer[2]={"ABC", "chokudai"}; cout << answer[q-1] << endl; } int main(void) { int q; cin >> q; Solve(q); return 0; } 入力の値が1ならABC、2ならch</string></iostream>…

abc019.contest.atcoder.jp #include <iostream> #include <set> using namespace std; void Solve(int n) { set<int> se; int a; se.clear(); for (int i=0; i<n; ++i) { cin >> a; while (a%2 == 0) a/=2; se.insert(a); } cout << se.size() << endl; } int main(void) { int n; cin >> n; Sol</n;></int></set></iostream>…

abc019.contest.atcoder.jp #include <iostream> #include <string> using namespace std; void Solve(string str) { int count=1; for (int i=1; i<=str.length(); ++i) if (str[i-1] == str[i]) ++count; else { cout << str[i-1] << count; count=1; } cout << endl; } int </string></iostream>…

abc019.contest.atcoder.jp #include <algorithm> #include <iostream> using namespace std; void Solve(void) { int num[3]; for (int i=0; i<3; ++i) cin >> num[i]; sort(num,num+3); cout << num[1] << endl; } int main(void) { Solve(); return 0; } 昇順に並び替えて2番目</iostream></algorithm>…