//https://www.acmicpc.net/problem/14623 #include #include using namespace std; int main(){ string b1,b2; cin >> b1 >> b2; int l1=b1.size(); int l2=b2.size(); int ans[64]={0,}; int digit=1; int length; for(int i=l2-1; i>=0; --i){ int idx=1*digit; for(int j=l1-1; j>=0; --j){ ans[idx++]+=(b1[j]-'0')*(b2[i]-'0'); } ++digit; length=idx; } for(int i=1; i=2){ ans[i+1]+=(ans[i]/2); ans[i]%=2; } } for(in..
//https://www.acmicpc.net/problem/2751 #include using namespace std; int arr[1000001];int n; void partition(int left, int right){ if(left==right) return; else if(left+1==right){ //한 칸 차이 일 때, 정렬 if(arr[left]>arr[right]){ int tmp=arr[left]; arr[left]=arr[right]; arr[right]=tmp; } return; } int mid=(left+right)/2; partition(left, mid); partition(mid+1, right); //분할 int *sortedarr = new int[right-l..
//https://www.acmicpc.net/problem/6679 #include using namespace std; int main(){ for(int i=1000; i0){ a+=tmp%10; tmp/=10; } tmp=i; while(tmp>0){ b+=tmp%12; tmp/=12; } if(a!=b) continue; tmp=i; b=0; while(tmp>0){ b+=tmp%16; tmp/=16; } if(a!=b) continue; cout
//https://www.acmicpc.net/problem/2751 #include using namespace std; int arr[1000001];int n;void swap(int a, int b){ int tmp=arr[a]; arr[a]=arr[b]; arr[b]=tmp; return;}int partition(int low, int high){ int pivotidx=low+(high-low)/2; int pivotval=arr[pivotidx]; swap(pivotidx, high);//pivot을 오른쪽으로 보내줌 int stridx=low; for(int i=low; i arr[i]; quick_sort(0,n-1); for(int i=0; i
