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

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

abc018.contest.atcoder.jp #include <iostream> #include <string> using namespace std; int r, c, k; string s[500]; void check(int y, int x) { for (int i=0; i</string></iostream>

abc018.contest.atcoder.jp #include <algorithm> #include <iostream> #include <string> using namespace std; void Solve(string str) { int n, l, r; cin >> n; for (int i=0; i<n; ++i) { cin >> l >> r; --l; --r; for (int j=0; j<(r-l+1)/2; ++j) swap( str[l+j],str[r-j] ); } cout << str << end</n;></string></iostream></algorithm>…

abc018.contest.atcoder.jp #include <iostream> using namespace std; void Solve(void) { int num[3], rank[3]; for (int i=0; i<3; ++i) rank[i]=1; for (int i=0; i<3; ++i) cin >> num[i]; for (int i=0; i<3; ++i) for (int j=0; j<3; ++j) if ( i!=j && num[i]></iostream>…

abc017.contest.atcoder.jp #include <algorithm> #include <iostream> using namespace std; #define MAX 100000 void Solve(int n, int m) { int l, r, s, data[MAX+1]={0}, sum=0, answer=0; for (int i=0; i<n; ++i) { cin >> l >> r >> s; data[l-1]+=s; data[r]-=s; sum+=s; } for (int i=0;</n;></iostream></algorithm>…

abc017.contest.atcoder.jp #include <iostream> #include <string> using namespace std; void Solve(string x) { int pos=0; while( pos < x.length() ) { if (x[pos]=='c' && x[pos+1]=='h') pos+=2; else if (x[pos] == 'o') ++pos; else if (x[pos] == 'k') ++pos; else i</string></iostream>…

abc017.contest.atcoder.jp #include <iostream> using namespace std; void Solve(void) { int s, e, answer=0; for (int i=0; i<3; ++i) { cin >> s >> e; answer += s*e/10; } cout << answer << endl; } int main(void) { Solve(); return 0; } (配点) * 評価 / 10</iostream>…

#include <algorithm> #include <iostream> using namespace std; #define INF (1<<29) int data[10][10]; void Warshall_Floyd(int n) { for (int i=0; i</iostream></algorithm>

abc016.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int a, int b, int c) { char ch[4]={'?', '+', '-', '!'}; int pos=0; if (a+b==a-b && a+b==c) pos=0; else if (a+b == c) pos=1; else if (a-b == c) pos=2; else pos=3; cout << c</iostream>…

abc016.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int m, int d) { cout << ( !(m%d)? "YES" : "NO" ) << endl; } int main(void) { int m, d; cin >> m >> d; Solve(m,d); return 0; } 剰余が0の場合はYES, それ以外はNOを出力。 〜了</iostream>…

abc015.contest.atcoder.jp #include <iostream> #include <string> using namespace std; void Solve(string a, string b) { cout << (a.length()>b.length()? a : b); } int main(void) { string a, b; cin >> a >> b; Solve(a,b); return 0; } 文字数が長い文字列を出力。 </string></iostream>…

abc015.contest.atcoder.jp #include <iostream> using namespace std; int n, k; int t[5][5]; bool dfs(int query, int value) { if (query == n) return (!value? true : false); for (int j=0; j</iostream>

abc015.contest.atcoder.jp #include <iostream> using namespace std; void Solve(int n) { int a, count=0; double sum=0.0; for (int i=0; i<n; ++i) { cin >> a; if (a == 0) ++count; sum+=a; } cout << (int)(sum/(n-count)+0.9) << endl; } int main(void) { int n; cin >> n; S</n;></iostream>…