본문 바로가기

반응형

분류 전체보기

(168)
2775번 부녀회장이 될테야 1234567891011121314151617181920212223242526272829303132333435#include using namespace std; int apart[15][15]; void Init(){ for (int i = 0; i k >> n; cout
10250번 ACM 호텔 1234567891011121314151617181920212223#include using namespace std; int main(){ int T, H, W, N; cin >> T; while(T--) { cin >> H >> W >> N; int height = N % H; int floor; if(N % H != 0) floor = N / H + 1; else floor = N / H; if(height == 0) height = H; cout
1193번 분수찾기 123456789101112131415161718192021222324252627#include using namespace std; int main(){ int n; cin >> n; int sum = 0; int num; for (int i = 1; i = n) break; else { sum += i; num = i; } } if (num % 2 == 0) cout
2292번 벌집 12345678910111213141516171819202122232425262728293031#include using namespace std; int main(){ int n; cin >> n; int result; if (n == 1) cout
1316번 그룹 단어 체커 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253#include #include using namespace std; char cArr[101]; int main(){ int n; scanf("%d ", &n); int result = 0; while (n--) { char c; scanf("%c", &c); cArr[0] = c; for (int i = 0; i
2941번 크로아티아 알파벳 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657#include #include using namespace std; int main(){ string s; cin >> s; int result = 0; for (int i = 0; i
5622번 다이얼 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748#include #include using namespace std; int main(){ string s; cin >> s; int result = 0; for (int i = 0; i
A very big sum 123456789101112131415161718import java.io.*;import java.util.*; public class Solution { public static void main(String[] args) { /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */ Scanner sc = new Scanner(System.in); long sum = 0; int n = sc.nextInt(); for(int i=0;i