우투리와툴툴

신기한 키보드 https://www.acmicpc.net/problem/1796123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990#include int max(int a, int b){ return a > b ? a : b; }int min(int a, int b){ return a > b ? b : a; }int abs(int a){ return a > 0 ? a : -a; } char lcdS[1001];int totalmove = 10000000;..

수 이어 쓰기 2 https://www.acmicpc.net/problem/17901234567891011121314151617181920212223242526272829303132333435363738394041424344#include int main(void){ long long N, K, calK; long long totalnum = 0; long long numcount = 9; long long numlength=1; long long tenten=1; long long result; scanf("%lld %lld", &N, &K); calK = K; while (calK > numcount*numlength){ totalnum += numcount; calK -= numcount*numle..

토너먼트 문제 https://www.acmicpc.net/problem/1057123456789101112131415161718192021222324#include int main(void){ int totalmember; int imm, kim; int count=0; scanf("%d %d %d", &totalmember, &kim, &imm); if (totalmember