알고리즘 (136) 썸네일형 리스트형 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 Compare the Triplets 12345678910111213141516171819202122232425262728293031323334353637383940import java.io.*;import java.util.*;import java.text.*;import java.math.*;import java.util.regex.*; public class Solution { static int[] solve(int a0, int a1, int a2, int b0, int b1, int b2){ // Complete this function int[] result = new int[2]; result[0] = result[1] = 0; if(a0 b0) result[0]++; if(a1 b1) result[0]++; if(a2 b2).. 10809번 알파벳 찾기 123456789101112131415161718192021222324#include #include using namespace std; int main() { char s[101]; scanf("%s", s); int ap[27]; for(int i = 0; i 10039번 평균 점수 123456789101112131415161718#include #include using namespace std; int main() { int sum = 0, score; for(int i = 0; i 이전 1 ··· 13 14 15 16 17 다음