아기개발자의 개발이야기

#include #include #include #include using namespace std; int main() { int t,ave,hap,cnt; double ans; cin >> t; int a[1001] = {}; while (t--) { int n; hap = 0; cnt = 0; cin >> n; for (int i = 0; i > a[i]; hap += a[i]; } ave = hap / n; for (int j = 0; j ave) { cnt += 1; } } ans = (double)cnt / n * 100; cout

#include using namespace std; int main() { int a, b; cin >> a >> b; cout

#include using namespace std; int main(){ cout

#include using namespace std; int main() { int A, B; cin >> A >> B; cout

#include using namespace std; int main(){ cout

n,m = map(int,input().split()) a=set() b=set() for i in range(n): a.add(input()) for j in range(m): b.add(input()) s=sorted(list(a&b)) print(len(s)) for k in range(len(s)): print(s[k])

n=int(input()) t={} for i in range(n): a,b,c=map(str,input().split()) t[a]=[b,c] #left, right 자식 def preorder(root): if root!=".": print(root,end="") preorder(t[root][0]) preorder(t[root][1]) def inorder(root): if root!=".": inorder(t[root][0]) print(root,end="") inorder(t[root][1]) def postorder(root): if root!=".": postorder(t[root][0]) postorder(t[root][1]) print(root,end="") preorder('A') pr..

from collections import Counter n=int(input()) a=[] for _ in range(n): a.append(int(input())) a.sort() nua=Counter(a).most_common() print(round(sum(a)/n)) print(a[n//2]) if len(nua)==1: print(nua[0][0]) else: if nua[0][1]==nua[1][1]: print(nua[1][0]) else: print(nua[0][0]) print(a[-1]-a[0]) # maxva=max value #nua = number of a

def ii(depth,index): global minva if depth==n//2: num1,num2=0,0 for i in range(n): for j in range(n): if visited[i] and visited[j]: num1+=g[i][j] elif not visited[i] and not visited[j]: num2+=g[i][j] minva = min(minva,abs(num1-num2)) return for p in range(index,n): if not visited[p]: visited[p]=1 ii(depth+1,p+1) visited[p]=0 n=int(input()) visited=[0]*n g=[list(map(int,input().split())) for _ in..

import heapq # import sys # input = sys.stdin.readline INF = 999999999 V,E=map(int,input().split()) k=int(input()) dis=[INF]*(V+1) h=[] g=[[] for _ in range(V+1)] def di(st): dis[st]=0 heapq.heappush(h,(0,st)) while h: ga,t = heapq.heappop(h) if dis[t]