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>…

abc023.contest.atcoder.jp #include <iostream> #include <string> using namespace std; void Solve(int n) { string s, str="b"; int answer; cin >> s; for (int i=1; i<=n; ++i) { if (i%3 == 1) str='a'+str+'c'; else if (i%3 == 2) str='c'+str+'a'; else str='b'+str+</string></iostream>…

abc023.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int n) { cout << n/10+n%10 << endl; } int main(void) { int n; cin >> n; Solve(n); return 0; } 2桁目と1桁目の足し算を行い結果を出力。 〜了〜</iostream>

arc003.contest.atcoder.jp import java.io.*; import java.util.*; public class Main { public static int N; public static String[] s = new String[100]; private void Input() { Scanner sc = new Scanner(System.in); N = Integer.parseInt( sc.next(…

arc003.contest.atcoder.jp import java.io.*; import java.util.*; public class Main { public static int N; public static String r; public static int sum; private void Input() { Scanner sc = new Scanner(System.in); N = Integer.parseInt( sc.ne…

abc022.contest.atcoder.jp #include <algorithm> #include <iostream> using namespace std; #define INF (1<<29) int d[300][300]; void Warshall_Floyd(int n) { for (int k=1; k</iostream></algorithm>

abc022.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int n) { int a, data[100000]={0}, answer=0; for (int i=0; i<n; ++i) { cin >> a; ++data[a-1]; if (data[a-1] >= 2) ++answer; } cout << answer << endl; } int main(void) { int n; cin >> n; So</n;></iostream>…

abc022.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int n, int s, int t) { int w, a, answer=0; cin >> w; if (s<=w && w<=t) ++answer; for (int i=1; i<n; ++i) { cin >> a; w+=a; if (s<=w && w<=t) ++answer; } cout << answer << endl; } int main</n;></iostream>…

arc002.contest.atcoder.jp import java.io.*; import java.util.*; public class Main { public static int Y, M, D; private void Input() { Scanner sc = new Scanner(System.in); String[] str = sc.next().split("/"); Y = Integer.valueOf(str[0]); M …

arc002.contest.atcoder.jp import java.io.*; import java.util.*; public class Main { public static int Y; public static boolean flg; private void Input() { Scanner sc = new Scanner(System.in); Y = Integer.parseInt( sc.next() ); } private bo…

abc021.contest.atcoder.jp #include <algorithm> #include <functional> #include <iostream> #include <queue> #include <vector> #include <utility> using namespace std; #define INF (1<<29) const long long MOD = 1e9+7; struct edge { int to, cost; edge(int a, int b) {to=a, cost=b;} }; typedef pair<int,int>…</int,int></utility></vector></queue></iostream></functional></algorithm>

abc021.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int n) { int a, b, k, p, data[100]={0}; bool flg=true; cin >> a >> b; data[a-1]=data[b-1]=1; cin >> k; for (int i=0; i<k; ++i) { cin >> p; ++data[p-1]; } for (int i=0; i<n; ++i) if (data[i] >= 2) flg=false; co</n;></k;></iostream>…

abc021.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int n) { cout << n << endl; for (int i=0; i<n; ++i) cout << 1 << endl; } int main(void) { int n; cin >> n; Solve(n); return 0; } 入力した値を出力し、その回数分だけ1を出力する。 〜了〜</n;></iostream>

arc001.contest.atcoder.jp import java.io.*; import java.util.*; public class Main { public static int A, B; public static int answer; private void Input() { Scanner sc = new Scanner(System.in); A = Integer.parseInt( sc.next() ); B = Intege…

arc001.contest.atcoder.jp import java.io.*; import java.util.*; public class Main { public static int N; public static String c; public static int max, min; private void Input() { Scanner sc = new Scanner(System.in); N = Integer.parseInt( …

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>…