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

C - Blue Bird / AtCoderBeginnerContest#022

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>

B - Bumble Bee / AtCoderBeginnerContest#022

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

A - Best Body / AtCoderBeginnerContest#022

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

B - 割り切れる日付 / AtCoderRegularContest#002

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 …

A - うるう年 / AtCoderRegularContest#002

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…

C - 正直者の高橋くん / AtCoderBeginnerContest#021

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>

B - 嘘つきの高橋くん / AtCoderBeginnerContest#021

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

A - 足し算 / AtCoderBeginnerContest#021

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>

B - リモコン / AtCoderRegularContest#001

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…

A - センター採点 / AtCoderRegularContest#001

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