본문 바로가기

acmicpc7

ACMICPC 1157 : 단어 공부 ACMICPC 1157 : 단어 공부 https://www.acmicpc.net/problem/1157 #include #include using namespace std; int main() { bool flag = false; int max = -1, max_index = -1; int count_char[26] = { 0, }; string in_str; cin >> in_str; for (int i = 0; i < (int)in_str.size(); ++i) { count_char[toupper(in_str[i])-'A']++; } for (int i = 0; i < 26; ++i) { if (max == count_char[i]) flag = true; else if (max < count_ch.. 2014. 12. 16.
ACMICPC 1920 : 수 찾기 ACMICPC 1920 : 수 찾기 https://www.acmicpc.net/problem/1920 #include #include #include using namespace std; int main() { vector vec_array; int num_array, num_finds; cin >> num_array; for (int i = 0; i > in_temp; vec_array.push_back(in_temp); } sort(vec_array.begin(), vec_array.end()); cin >> num_finds; for (int i = 0; i < num_finds; ++i) { int in_value; cin.. 2014. 12. 16.
ACMICPC 1003 : 피보나치 함수 ACMICPC 1003 : 피보나치 함수 https://www.acmicpc.net/problem/1003 #include using namespace std; int main() { int num_cases = 0; cin >> num_cases; for (int i = 0; i > n; if (n == 0)cout 2014. 12. 15.
ACMICPC 1008 : A/B ACMICPC 1008 : A/B https://www.acmicpc.net/problem/1008 #include #include using namespace std; int main(){ double a, b; cin >> a >> b; cout 2014. 12. 15.
ACMICPC 1205 : 등수 구하기 http://www.acmicpc.net/problem/1205 #include #include using namespace std; int main() { vector scores; int num_score, score, max_rank; cin >> num_score >> score >> max_rank; for (int i = 0; i > in_temp; scores.push_back(in_temp); } if (num_score == max_rank && scores[num_score - 1] >= score) cout 2014. 12. 13.
ACMICPC 1002 : 터렛 http://www.acmicpc.net/problem/1002 #include using namespace std; int main(){ int num_cases = 0; cin >> num_cases; for (int i = 0; i > x1 >> y1 >> r1 >> x2 >> y2 >> r2; d1 = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1); d2 = (r1 + r2) * (r1 + r2); if (x1 == x2 && y1 == y2 && r1 == r2) { cout 2014. 12. 12.