so_sal　

/* * http://sosal.tistory.com/ * made by so_Sal */ DescriptionWrite a program to read four lines of upper case (i.e., all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram that shows how many times each letter (but not blanks, digits, or punctuation) appears in the all-upper-case input. Format your output exactly as shown. Input*..

/* * http://sosal.tistory.com/ * made by so_Sal */ DescriptionA certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked. One night, the jailer gets bored and decides to play a game. For round 1 of the game, he takes a drink of whiskey,and then runs down the hall unlocking each cell. For round 2, he takes a drink of wh..

/* * http://sosal.tistory.com/ * made by so_Sal */ Description The cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this: 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 Then the other cows traverse the triangle starting from its tip and moving "down" to one of the two diagonally adjacent cows u..

Description The cows in farmer John's herd are numbered and branded with consecutive integers from 1 to N (1 a;for(n=1;;n++){if( n*(n+1)/2 > a)break;}n--;sum = n*(n+1)/2 - m;while(n

/* * http://sosal.tistory.com/ * made by so_Sal */ Jaeha is writing an operating system for his toys, so they will be able to communicate with each other. However, the wireless chips in his toys are very cheap, so they are prone to transmission errors. Quite frequently, Jaeha is seeing some noises in the transmitted data: some bits get flipped during the transmission process. Jaeha wants to impl..

/* * http://sosal.tistory.com/ * made by so_Sal */ On the planet Zoop, numbers are represented in base 62, using the digits 0, 1, . . . , 9, A, B, . . . , Z, a, b, . . . , z, where A (base 62) = 10 (base 10)B (base 62) = 11 (base 10)z (base 62) = 61 (base 10).Given the digit representation of a number x in base 62, your goal is to determine if x is divisible by 61. 입력 The input test file will co..

/* * http://sosal.tistory.com/ * made by so_Sal */ Description Soundex coding groups together words that appear to sound alike based on their spelling. For example, "can" and "khawn", "con" and "gone" would be equivalent under Soundex coding. Soundex coding involves translating each word into a series of digits in which each digit represents a letter: 1 represents B, F, P, or V 2 represents C, G..

/* * http://sosal.tistory.com/ * made by so_Sal */ IP AddressTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 18283Accepted: 10535DescriptionSuppose you are reading byte streams from any device, representing IP addresses. Your task is to convert a 32 characters long sequence of '1s' and '0s' (bits) to a dotted decimal format. A dotted decimal format for an IP address is form by grouping ..

/* * http://sosal.tistory.com/ * made by so_Sal */ http://www.acmicpc.net/problem/1920 문제 N개의 정수 A[1], A[2], …, A[N]이 주어져 있을 때, 이 안에 X라는 정수가 존재하는지 알아내는 프로그램을 작성하시오. 입력 첫째 줄에 자연수 N(1≤N≤100,000)이 주어진다. 다음 줄에는 N개의 정수 A[1], A[2], …, A[N]이 주어진다. 다음 줄에는 M(1≤M≤100,000)이 주어진다. 다음 줄에는 M개의 수들이 주어지는데, 이 수들이 A안에 존재하는지 알아내면 된다. 모든 정수들의 범위는 int 로 한다. 출력 M개의 줄에 답을 출력한다. 존재하면 1을, 존재하지 않으면 0을 출력한다. 예제 입력54 1 5 2..