Posts

Showing posts from 2014

Topcoder SRM 643 div 2 250 Problem

My Answer is below

my approch is
- find H and if there is H find right and find up


1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45package srm643;publicclassTheKingsArmyDiv2{publicstaticvoidmain(String args[]){ String[] temp ={"SSSSS","SSHHS","SSSSS"}; TheKingsArmyDiv2 army =new TheKingsArmyDiv2(); System.out.println(army.getNumber(temp));}publicintgetNumber(String[] state){int len = state.length;int count =0;for(int i=0; i<len; i++){char[] emotions = state[i].toCharArray();int elen = emotions.length;for(int j=0; j<elen; j++){if(emotions[j]=='H'){ count++;if(j+1< elen && emotions[j+1]=='H'){return0;}if(i+1< len && state[i+1].charAt(j)=='H'){return0;}}}}if(count >0){return1;}else{return2;}}}

Topcoder SRM 640 div2 250point

this question is very easy!!

start and ribons

if left and right is different counting ++

my code is below~


problem
http://community.topcoder.com/stat?c=problem_statement&pm=13556



1 2 3 4 5 6 7 8 9 10 11 12 13publicclassChristmasTreeDecorationDiv2{publicintsolve(int[] col,int[] x,int[] y){int len = x.length;int cnt =0;for(int i=0; i<len; i++){if(col[x[i]-1]!= col[y[i]-1]){ cnt++;}}return cnt;}}

SRM 641 div 2 500

this is my source ..

point in triangle is somehow difficult to understand

find the algorithm point in triangle 
and when calling pointInTriangle
point.set method called many times.

so later, I have to do refactoring my code to speed up




1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61package srm641;publicclassTrianglesContainOriginEasy{publicintcount(int[] x,int[] y){int len = x.length;int count =0; Point v1 =new Point(); Point v2 =new Point(); Point v3 =new Point();for(int i=0; i<len; i++){for(int j=i+1; j<len; j++){for(int k=j+1; k<len; k++){if(pointInTriangle(new Point(0,0), v1.set(x[i], y[i]), v2.set(x[j], y[j]), v3.set(x[k], y[k]))){ count++;}}}}return count;}booleanpointInTriangle(Point pt, Point v1, Point v2, Point v3){ Boolean b1, b2, b3; b1 = sign(pt, v1, v2)<0; b2 = sign(pt, v2, v3)<0; b3 = sign(pt, v3, v1)&…

Topcoder SRM 641 250point

My answer is like this.


1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20publicclassBuyingTshirts{publicintmeet(int T,int[] Q,int[] P){int len = Q.length;int count =0;int sum =0;int sum2 =0;for(int i=0; i<len; i++){ sum += Q[i]; sum2 += P[i];if(sum-T >=0|| sum2 -T >0){ count++;} sum = sum - T; sum2 = sum2 - T ;}return count;}}

karatsuba algorithm solved example

Image

Topcoder SRM 642 div2

Image
This is my third time in attending topcoder

and I got 815 grad T_T.


I think my skill and score will be higher than now if I continuously attend and study




http://community.topcoder.com/stat?c=problem_statement&pm=13553&rd=16085&rm=324592&cr=23054155


explanation : first I tried to solve this problem Brute-force Search

It mean all posiible I would search

this is may take O(n) if str length is higer time.

but I tried if str.length is cardinal number ,  find only center and one before, one after

and if str.length . even number search 3point, half and before of half, after of half



ex ) cardinal number : 129298481 : 1292 + 98481,  12929 + 8481




1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26publicclassForgetfulAddition{publicintminNumber(String str){int len= str.length();int start = len /2;int minNumber = Integer.MAX_VALUE;if(len %2==1){// 홀수int sum = Integer.parseInt(str.substring(0, start))+ Integer.parseInt(str.substring(start, len)); minNum…

Math sqrt in java

sqrt is square root value

Math.sqrt(52) :  7.211102550927978
Math.sqrt(4) : 2
Math.sqrt(9) : 3


Math.floor(1001.56) :  1001
Math.ceil(1001.56) : 1002

SRM 441 div 1 1000

Image
Recently I solve the problem that was already compteted. and I found out that I'm not skillfull at understanding english. I want to understand problem written in english but it is very difficult to get the point of problem, 
this is somehow eaiser than others because it show pictures and sample. I try to solve this problem 
next time I hope write answer aticle of this question ~!!!



TopCoder problem "PaperAndPaint" used in SRM 441 (Division I Level Three)

Problem StatementOnise likes to play with paper and paint. He has a piece of paper with dimensions width x height. He performs K operations, one for each i between 0 and K-1, inclusive. Each operation consists of the following steps:Fold the paper along the line x = xfold[i] (the left side of the paper is folded over the right side).Divide the paper vertically into cnt[i]+1 equal sections. Then, cnt[i] times, take the topmost section and fold it over the section below it.Paint a rectangle with the lower-left corner at (

SRM 635 div 2 500

This is somehow easy comparing to other 500 point problem.

this is about a square root.




public class QuadraticLaw {

 public long getTime(long time){
  long number  = (long)Math.floor(Math.sqrt(time));
  for(long i=number; i>0; i--){
   if((i * i) + i <=  time){
    return i;
   }
  }
  return 0l;
 }
}

SRM 635 DIV 2 250 problem in topcoder

This is somehow easy comparing to other 500 point problem.

this is about a square root.




public class QuadraticLaw {

 public long getTime(long time){
  long number  = (long)Math.floor(Math.sqrt(time));
  for(long i=number; i>0; i--){
   if((i * i) + i <=  time){
    return i;
   }
  }
  return 0l;
 }
}

dp to px in Anroid

http://labs.rampinteractive.co.uk/android_dp_px_calculator/

하늘을 날다~ 쿼드콥터 (1)

갑자기 하늘을 날아보고 싶다는 생각이 들었다. 과거 라이트형제은 날아보고 싶다는 생각에 비행기를 만들었을것이다. 나는 아두노이로 쿼드콥터를 만들어봐야겠다. 아두노이도 없고 부품도 없고 아무것도 없다. 부품도 사고 이것저것 사야할것 같다. 오늘부터 쿼드콥터를 만드는거 도전한다. 제발 만들다가 그만두지 말기를...

CustomComparator in java

import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; public class SecondArray { public static ArrayList list = new ArrayList(); public static void main(String args[]){ CustomString cs= new CustomString("123744444"); list.add(cs); cs= new CustomString("421212345"); list.add(cs); cs= new CustomString("758312948"); list.add(cs); cs= new CustomString("134129302"); list.add(cs); cs= new CustomString("123755555"); list.add(cs); System.out.println(list); Collections.sort(list, new CustomComparator()); System.out.println(list); } } class CustomString { String [] devidedValues = new String[2]; CustomString(String value){ devidedValues[0] = value.substring(0, 4); devidedValues[1] = value.substring(4, value.length()); } /** * @return the devidedValues */ public String[] getDevidedValues() { return devidedValues; } /** * @param devidedValu…

Bucket List ~ Success and TODO

Success

1. Getting the score over 900point in TOEIC
2. Going to america and Lasvegas~!
3. For honemoon, having good time in maldives

TODO

1. going to Europe .
2. Making bucket list application.
3. building a library


The difference between find('li:first') and find('li :fist') in jquery

Today I knew big difference between find $('ul').find('li:first') and find('li :first')

find('li:first') this will Return first li tag

find('li :fist') this will Return firlst tag of first li tag

Thinking about multi reply table in oracle~!

In these days, people want to spend their more time with mobile than Pc. Pc resolution is very high. so it is very readable in short time. Mobile resolution size is smaller than PC. so paradigm of design is simple. It seems that people like if something is so simple. what I want to say is multi reply system is not many used in these days.
but I have to know how to think and make table for multi reply in board.
one way : 

column : id subcolumn : parent id, title
Id is unique value and parent id indicate Id and more and more
this architecture can make limitless depth replies.
query can express by using oracle grammer connect by

In my opinion
advantage : formal and readable disadvantage : many article, connect by spend much time to query


the other recommendable way : 
column : id subcolumn : order_id, title, root_comment_id, depth

I want to show you ex)..
id                                   title,        depth  depth_order     root_comment_id 00000000001               root title         …

angular infinite $digest loop error solution

I used ui.router and someday i found out
error console show me this error

10 $digest() iterations reached. Aborting! Watchers fired in the last 5 iterations: [["fn: $locationWatch; newVal: 32; oldVal: 31"],["fn: $locationWatch; newVal: 33; oldVal: 32"],["fn: $locationWatch; newVal: 34; oldVal: 33"],["fn: $locationWatch; newVal: 35; oldVal: 34"],["fn: $locationWatch; newVal: 36; oldVal: 35"]]
and I debug for whole day and gave up.
after debugging, I seached on internet and many people face with this problem.
and I finally fix the error
Before if I used location.href='#/xxxxxx' and changed is $location.path(realpath);

mobile Html page box-sizing

if you want to muliline ellipsis effect


overflow: hidden;text-overflow: ellipsis;display: -webkit-box;-webkit-line-clamp: 3;-webkit-box-orient: vertical;word-wrap: break-word;


this would be a solution for you

Iscroll 4.2.5 in iput, textarea, select focus issue

I used I scroll and It was very good.

and I can't complete mobile web project because in Iscroll div I can't touch and input, textarea, select never clicked.

I find some article that somebody shared..

and all the things that I saw internet was not working.
and tried to find more and more

this is my solution

onBeforeScrollStart: function (e) {
var nodeType = e.explicitOriginalTarget ? e.explicitOriginalTarget.nodeName.toLowerCase():(e.target ? e.target.nodeName.toLowerCase():'');
if(nodeType !='select' && nodeType !='option' && nodeType !='input' && nodeType!='textarea') e.preventDefault();
},

Iscroll 4.2.5 scroll has some how issue during scrolling

Today I tried to using I Scroll 4.2.5 for pullup to morelist and pulldown to refresh
But I was in trouble because if you scroll when it is already scrolling
page will refresh and you can see the position of scroll will be strange..


anyway I had to fix it

What i Changed code is


_start : .....

if (x != that.x || y != that.y) {
/**
* hanwha 주석 2014-11-06 더블 스크롤시 화면이 튕기는 현상 제거
*
* david
*/
//if (that.options.useTransition) that._unbind(TRNEND_EV);
//else cancelFrame(that.aniTime);
// that.steps = [];
// that._pos(x, y);
if (that.options.onScrollEnd) that.options.onScrollEnd.call(that);
}

this source is called when you are willing to scroll during scrolling.
in other word. double scrolling..

I hope to remever these things so

If you guys are faced with this problem.
remove that source.

this article is about ajax and and using proxy server with apache httpd

I wanted to try get ajax data from other site..
and Chorme and WebBrowser told me that cross domain security so I can't access
this url...
there is good solution when you develope different site and test it




changed apache conf.htttp ~!!!


LoadModule proxy_module modules/mod_proxy.so
LoadModule proxy_http_module modules/mod_proxy_http.so

ProxyRequests Off
<Proxy *>
            Order deny,allow
                Allow from all
                SetEnv force-proxy-request-1.0 1
                SetEnv proxy-nokeepalive 1
                SetEnv proxy-initial-not-pooled 1

</Proxy>

ProxyPass /neo http://192.168.123.171:8080/neo
ProxyPassReverse /neo http://192.168.123.171:8080/neo

Jquery extend function

This is somehow good when extend data and overwrite

var object1 = { apple: 0, banana: { weight: 52, price: 100 },