2015-08-01から1ヶ月間の記事一覧

C - おいしいたこ焼きの売り方 / AtCoderBeginnerContest #005

C: おいしいたこ焼きの売り方 - AtCoder Beginner Contest 005 | AtCoderabc005.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int t) { int n, a[100], m, b[100], pos=0; bool flg=false; cin >> n; for (int i=0; i<n; ++i) cin >> a[i]; cin >> m; fo</n;></iostream>…

B - おいしいたこ焼きの食べ方 / AtCoderBeginnerContest #005

B: おいしいたこ焼きの食べ方 - AtCoder Beginner Contest 005 | AtCoderabc005.contest.atcoder.jp #include <algorithm> #include <iostream> using namespace std; void Solve(int n) { int t, fresh=100; for (int i=0; i<n; ++i) { cin >> t; fresh=min(fresh,t); } cout << fresh << endl; }</n;></iostream></algorithm>…

A - おいしいたこ焼きの作り方 / AtCoderBeginnerContest #005

A: おいしいたこ焼きの作り方 - AtCoder Beginner Contest 005 | AtCoderabc005.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int x, int y) { cout << y/x << endl; } int main(void) { int x, y; cin >> x >> y; Solve(x,y); return 0; </iostream>…

C - 入れ替え / AtCoderBiginnerContest #004

C: 入れ替え - AtCoder Beginner Contest 004 | AtCoderabc004.contest.atcoder.jp #include <algorithm> #include <iostream> using namespace std; void Solve(int n) { string str="123456"; for (int i=0; i<n%30; ++i) swap(str[i%5],str[i%5+1]); cout << str << endl; } int main(void) { int n; cin >> n; Solve(n); re…</n%30;></iostream></algorithm>

B - 回転 / AtCoderBeginnerContest #004

B: 回転 - AtCoder Beginner Contest 004 | AtCoderabc004.contest.atcoder.jp #include <iostream> using namespace std; void Solve(void) { char c[4][4]; for (int i=0; i<4; ++i) for (int j=0; j<4; ++j) cin >> c[i][j]; for (int i=0; i<4; ++i) { for (int j=</iostream>…

A - 流行 / AtCoderBeginnerContest #004

A: 流行 - AtCoder Beginner Contest 004 | AtCoderabc004.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int n) { cout << 2*n << endl; } int main(void) { int n; cin >> n; Solve(n); return 0; } 2倍にして出力。 ~了~</iostream>

C - AtCoderプログラミング講座 / AtCoderBeginnerContest #003

C: AtCoderプログラミング講座 - AtCoder Beginner Contest 003 | AtCoderabc003.contest.atcoder.jp #include <algorithm> #include <cstdio> #include <iostream> using namespace std; void Solve(int n, int k) { double r[100], answer=0.0; for (int i=0; i<n; ++i) cin >> r[i]; sort(r,r+n); for</n;></iostream></cstdio></algorithm>…

B - AtCoderトランプ / AtCoderBeginnerContest #003

B: AtCoderトランプ - AtCoder Beginner Contest 003 | AtCoderabc003.contest.atcoder.jp #include <iostream> #include <string> using namespace std; bool Check(string s, string t, int pos, int kind) { const char atcoder[7]={'a', 't', 'c', 'o', 'd', 'e', 'r'}; fo</string></iostream>…

A - AtCoder社の給料 / AtCoderBeginnerContest #003

A: AtCoder社の給料 - AtCoder Beginner Contest 003 | AtCoderabc003.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int n) { int average=0; for (int i=0; i<n; ++i) average+=10000*(i+1)/n; cout << (average+500)/1000*1000 << endl; } int main(void) { int n; cin >> n; Solve(n); return 0…</n;></iostream>

C - 直訴 / AtCoderBeginnerContest #002

C: 直訴 - AtCoder Beginner Contest 002 | AtCoderabc002.contest.atcoder.jp #include <cmath> #include <cstdio> #include <iostream> using namespace std; void Solve(int ax, int ay, int bx, int by, int cx, int cy) { double s=( (ax-cx)*(by-ay)-(ax-bx)*(cy-ay) )/2.0; pri</iostream></cstdio></cmath>…

B - 罠 / AtCoderBeginnerContest #002

B: 罠 - AtCoder Beginner Contest 002 | AtCoderabc002.contest.atcoder.jp #include <iostream> #include <string> using namespace std; void Solve(string w) { string answer=""; const char vowel[5]={'a', 'i', 'u', 'e', 'o'}; for (int i=0; i</string></iostream>

A - 正直者 / AtCoderBeginnerContest #002

A: 正直者 - AtCoder Beginner Contest 002 | AtCoderabc002.contest.atcoder.jp #include <algorithm> #include <iostream> using namespace std; void Solve(int x, int y) { cout << max(x,y) << endl; } int main(void) { int x, y; cin >> x >> y; Solve(x,y); return 0; } a</iostream></algorithm>…

C - 風力観測 / AtCoderBeginnerContest #001

C: 風力観測 - AtCoder Beginner Contest 001 | AtCoderabc001.contest.atcoder.jp #include <cmath> #include <iostream> using namespace std; #define EPS 1e-5 void Solve(double deg, double dis) { const string name_wind[17]={"N", "NNE", "NE", "ENE", "E", "ESE", "</iostream></cmath>…

B - 視程の通報 / AtCoderBeginnerContest #001

B: 視程の通報 - AtCoder Beginner Contest 001 | AtCoderabc001.contest.atcoder.jp #include <cstdio> #include <iostream> using namespace std; void Solve(int m) { int vv=0; if (70000 < m) vv=89; else if (35000 <= m) vv=(m-30000)/5000+80; else if (6000<=m && m<=</iostream></cstdio>…

A - 積雪深差 / AtCoderBeginnerContest #001

問題 : A: 積雪深差 - AtCoder Beginner Contest 001 | AtCoderabc001.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int h1, int h2) { cout << h1-h2 << endl; } int main(void) { int h1, h2; cin >> h1 >> h2; Solve(h1,h2); return 0;</iostream>…

0140 - Bus Line

#include <iostream> #include <vector> using namespace std; void Slove(int n) { const int place[25]={0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; int a, b; for (int i=0; i<n; ++i) { cin >> a >> b; int start=0; while (place[start] != a) ++start</n;></vector></iostream>…

0139 - Snakes

#include <iostream> #include <string> using namespace std; int Check_A(string snake) { int first=0, second=0, i, j; for (i=2; i</string></iostream>

0138 - Track and Field Competition

#include <cstdio> #include <iostream> #include <map> using namespace std; void Slove(void) { int number; double time; map<double,int> top, third; third.clear(); for (int i=0; i<3; ++i) { top.clear(); for (int j=0; j<8; ++j) { cin >> number >> time; top.insert( map<double,int>::value_ty</double,int></double,int></map></iostream></cstdio>…

0137 - Middle-Square Method

#include <iostream> using namespace std; void Slove(int x) { int n, number[8]; for (int i=0; i<x; ++i) { cin >> n; cout << "Case " << i+1 << ":" << endl; for (int i=0; i<10; ++i) { n*=n; int tmp=n, answer=0; for (int j=0; j<8; ++j) { number[j]=tmp%10; tmp/=10; } in</x;></iostream>…

0136 - Frequency Distribution of Height

#include <iostream> using namespace std; void Slove(int n) { int count[6]={0}; double height; for (int i=0; i<n; ++i) { cin >> height; if (height < 165.0) ++count[0]; else if (height < 170.0) ++count[1]; else if (height < 175.0) ++count[2]; else if (height < 180.0)</n;></iostream>…

0135 - Clock Short Hand and Long Hand

#include <cmath> #include <cstdio> #include <iostream> using namespace std; void Slove(int n) { double hh, mm, angle_h, angle_m; for (int i=0; i</iostream></cstdio></cmath>

0134 - Exit Survey

#include <iostream> using namespace std; void Slove(int n) { int money; long long sum=0; for (int i=0; i<n; ++i) { cin >> money; sum+=money; } cout << sum/n << endl; } int main(void) { int n; cin >> n; Slove(n); return 0; } やるだけ。。</n;></iostream>