paiza.jp #include <iostream> using namespace std; int q[100][100], p[10][10]; bool Check(int m, int y, int x) { bool flg = true; for (int i=0; i</iostream>

paiza.jp #include <iomanip> #include <iostream> using namespace std; void Solve(int n) { int m, answer; for (int i=0; i<n; ++i) { cin >> m; answer = 24*60+60-m/3; cout << setw(2) << setfill('0') << (answer/60)%24 << ":"; cout << setw(2) << setfill('0') << answer%60 << endl;</n;></iostream></iomanip>…

paiza.jp #include <iostream> #include <string> using namespace std; void Solve(int n) { int m; string answer = ""; bool flg = true; cin >> m; for (int i=1; i<=m; ++i) { answer += (flg? 'R' : 'W'); if ( !(i%n) ) flg = (flg? false : true); } cout << answer <<</string></iostream>…

paiza.jp #include <iostream> using namespace std; void Solve(int n) { int answer = 1; for (int i=2; i<=n; ++i) answer *= i; cout << answer << endl; } int main(void) { int n; cin >> n; Solve(n); return 0; } 階乗を出力。 〜了〜</iostream>

paiza.jp #include <iostream> #include <string> using namespace std; void Solve(int n) { string answer = "", str; cin.ignore(); for (int i=0; i<n; ++i) { getline(cin,str); if (i != 0) answer += "_"; answer += str; } cout << answer << endl; } int main(void) { int n; cin >> n; Solve(n); return 0; } 最初以…</n;></string></iostream>

paiza.jp #include <iostream> using namespace std; void Solve(void) { int c1, p1, c2, p2; double drink1, drink2; cin >> c1 >> p1 >> c2 >> p2; drink1 = c1/(double)p1; drink2 = c2/(double)p2; cout << (drink1 > drink2? "1" : "2") << endl; } int main(voi</iostream>…

paiza.jp #include <iostream> using namespace std; void Solve(int n) { for (int i=n; i>=0; --i) { if (i == 0) cout << "0!!" << endl; else cout << i << endl; } } int main(void) { int n; cin >> n; Solve(n); return 0; } 0の場合は、0!!と出力。 〜了〜</iostream>

paiza.jp #include <iostream> #include <string> using namespace std; void Solve(void) { string str; int yesCount = 0, noCount = 0; for (int i=0; i<5; ++i) { cin >> str; if (str == "yes") ++yesCount; else if (str == "no") ++noCount; } cout << (yesCount>noCoun</string></iostream>…

paiza.jp #include <iostream> using namespace std; void Solve(int a, int b) { cout << a + b << endl; } int main(void) { int a, b; cin >> a >> b; Solve(a,b); return 0; } 足し算。 〜了〜</iostream>

paiza.jp #include <algorithm> #include <iostream> #include <string> using namespace std; void Solve(string str) { int data[3] = {0}, maxCount = 0, minCount = 100; for (int i=0; i</string></iostream></algorithm>

paiza.jp #include <iostream> #include <string> using namespace std; void Solve(string str) { int answer = 0; for (int i=0; i</string></iostream>

paiza.jp #include <algorithm> #include <iostream> using namespace std; void Solve(int n) { int m1, m2, x, y, data[1000+1], count = 0; bool check[1000+1] = {false}, flg = false; cin >> m1; for (int i=0; i<m1; ++i) { cin >> x; check[x] = true; } cin >> m2; for (int i=0; i<m2; ++i) { cin >> y; if</m2;></m1;></iostream></algorithm>…

paiza.jp #include <iostream> #include <string> using namespace std; void Solve(int n) { string answer = "", Ann = "Ann"; for (int i=0; i<n; ++i) answer += Ann; cout << answer << endl; } int main(void) { int n; cin >> n; Solve(n); return 0; } 与えられた回数分だけAnnを出力。 〜了〜</n;></string></iostream>

abc023.contest.atcoder.jp #include <iostream> #include <vector> using namespace std; #define MAX 100000 typedef pair<int,int> P_II; void Solve(int r, int c, int k) { int n, rr, cc, row[MAX+1]={0}, col[MAX+1]={0}, count_row[MAX+1]={0}, count_col[MAX+1]={0}; long long</int,int></vector></iostream>…