Thursday, February 26, 2015

Thinking of Project Euler after a month from starting time

It took a month to solve problems 1 to 67.
And I want to tell you the advantage of it

1. I learned math a lot from it.
2. Simplify my dirty source.
3. Clearly thinking coumputer language.
4. some algorithm

My first plan is to solve one hundred problems.
I can do it~!!!

:)

Monday, February 23, 2015

Solved 54 problem

this is about the rule of poker

I wrote ideas and logic on my book and
coded.

My source was to get the real answer and
later on I will change my code to have no duplication code!!!

 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 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 package euler.nubmerFrom51; import java.io.File; import java.io.FileNotFoundException; import java.io.ObjectInputStream.GetField; import java.util.Arrays; import java.util.Scanner; public class number54 { // 1 = royal flush // 2 = straight flush // 3 = four card // 4 = full house // 5 = flush // 6 = straight // 7 = three // 9 = two // 10 = one // 11 = hight public static void main(String args[]) throws FileNotFoundException{ // 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace. String pae = "2H 2D 4C 4D 4S TD JD QD KD 9D"; number54 gac = new number54(); Scanner scan = new Scanner( new File( "D:/app/tool/eclipse-kepler-server/workspace/euler/src/euler/p054_poker.txt")); int total = 0; while (scan.hasNextLine()) { String read = scan.nextLine(); read = read.trim(); String data[] = read.split(" "); String[] player1 = Arrays.copyOfRange(data, 0, 5); String[] player2 = Arrays.copyOfRange(data, 5, 10); int first = gac.getResult(player1); int second = gac.getResult(player2); if(first == second){ if(first ==10){ if(gac.getNumFromOne(player1) > gac.getNumFromOne(player2)){ total++; }else if(gac.getNumFromOne(player1) == gac.getNumFromOne(player2)){ if(gac.getNumFromHigh(player1) > gac.getNumFromHigh(player2)){ total++; } } } if(first ==11){ if(gac.getNumFromHigh(player1) > gac.getNumFromHigh(player2)){ total++; } } }else if(first < second){ total++; } } System.out.println(total); } public int getResult(String[] player){ if(isFulush(player)){ if(isStraight(player)){ if(isRoyalFlush(player)){ return 1; // royal }else{ return 2; // straight flush } }else{ return 5; //flush } }else{ if(isStraight(player)){ // straight return 6; }else{ if(isFourCards(player)){ // four cards return 3; }else{ if(isThreeCard(player)){ if(isFullHouse(player)){ return 4; // full house }else{ return 7; // three cards } }else{ if(isOneCard(player)){ if(isTwoCard(player)){ return 9; // two }else{ return 10; // one } }else{ return 11; // high } } } } } } private boolean isTwoCard(String[] player) { int[] cards = getCards(player); int count =0; for (int i = 0; i < cards.length; i++) { if(cards[i] == 2){ count ++; } } if(count == 2){ return true; } return false; } private boolean isOneCard(String[] player) { int[] cards = getCards(player); int count =0; for (int i = 0; i < cards.length; i++) { if(cards[i] == 2){ count ++; } } if(count >= 1){ return true; } return false; } private boolean isFullHouse(String[] player) { int[] cards = getCards(player); int pair =0; int three =0; for (int i = 0; i < cards.length; i++) { if(cards[i] == 2){ pair ++; }else if(cards[i] == 3){ three++; } } if(pair == 1 && three == 1){ return true; } return false; } private boolean isThreeCard(String[] player) { int[] cards = getCards(player); int three =0; for (int i = 0; i < cards.length; i++) { if(cards[i] == 3){ three++; } } if(three == 1){ return true; } return false; } private boolean isFourCards(String[] player) { int[] cards = getCards(player); int four =0; for (int i = 0; i < cards.length; i++) { if(cards[i] == 4){ four++; } } if(four == 1){ return true; } return false; } private boolean isRoyalFlush(String[] player) { int[] cards = getCards(player); int firstIndex = 0; for (int i = 0; i < cards.length; i++) { if(cards[i]!=0){ firstIndex = i; break; } } if (firstIndex == 10) { return true; } return false; } private boolean isStraight(String[] player) { int[] cards = getCards(player); boolean isAllOne = true; for (int i = 0; i < cards.length; i++) { if(cards[i]>0){ if(cards[i] != 1){ isAllOne = false; break; } } } if(!isAllOne){ return false; } int firstIndex = 0; for (int i = 0; i < cards.length; i++) { if(cards[i]!=0){ firstIndex = i; break; } } if(cards[firstIndex] !=0){ if(cards[firstIndex+1] !=0){ if(cards[firstIndex+2] !=0){ if(cards[firstIndex+3] !=0){ if(cards[firstIndex+4] !=0){ return true; } } } } } return false; } private boolean isFulush(String[] player) { boolean isFlush = true; for (int i = 0; i < player.length-1; i++) { if(player[i].charAt(1) ==player[i+1].charAt(1)){ }else{ isFlush = false; break; } } return isFlush; } private int [] getCards(String[] player){ int[] cards = new int; for (int i = 0; i < player.length; i++) { String val = player[i] . charAt(0) +"" ; if(val.equals( "T")){ val = "10"; } if(val.equals( "J")){ val = "11"; } if(val.equals( "Q")){ val = "12"; } if(val.equals( "K")){ val = "13"; } if(val.equals( "A")){ val = "14"; } cards[Integer.parseInt(val)]++; } return cards; } private int getNumFromHigh(String[] player){ int[] cards = getCards(player); int max = 0; for (int i = 0; i < cards.length; i++) { if(cards[i]== 1){ max = Math.max(max, i); } } return max; } private int getNumFromOne(String[] player){ int[] cards = getCards(player); for (int i = 0; i < cards.length; i++) { if (cards[i] == 2) { return i; } } return 0; } private int getNumFromTwo(String[] player){ int[] cards = getCards(player); return 0; } }

Sunday, February 15, 2015

Sieve of Eratoshenes

A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself.

I want to find Prime number from 2, 3, .... To  N

First we need to make
new int [N];

like this ~ we visit all number of Array.

below is my code

 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 /** * 1== prime * * @return */ public static int[] isPrimeFromSieve(int limit) { int[] val = new int[limit]; for (int i = 2; i < val.length; i++) { if (val[i] == 0) { val[i] = 1; checkMultiple(i, val); } } return val; } private static void checkMultiple(int a, int[] val) { for (int i = 2; i < val.length; i++) { int num = a * i; if (num >= val.length) { return; } val[num] = 2; } }

I had very hard time to completely solved 50problems.

What I got from those problems is clearly coding skill.

I think it is very good to think.
I will do more and more

Thursday, February 5, 2015

My progress euler 2days

I started it 02/06/2014

If you are interested in Algorithm and math
visit this site is https://projecteuler.net/

really fun and interesting

My 2days solved is

Tuesday, February 3, 2015

Topcoder Srm 626 div2 500 problem

When I tried to solve this problem, I didn't exactly know about expected value.
know I can liite understand it

problem is get expected value if A value is larger than B

A. 2 sided
B. 2 sided

case is (2,1)
so expected value is 2

A. 4-sided
B. 2-sided

(4,1) (4,2) (3,1) (3,2) (2,1)
4+4+3+3+2 / 5 = 3.2

this is what i learn from this problem.

Monday, February 2, 2015

My one plan for this year~

these days. I started to study algorithm. I am 32years old. my first thought was too old to learn algorithm.
But I decided to study it.
I know this comment and believe it.

Beginning is half done

I will do my best.

and also I will get over 1500 ratings in Topcoder.
Now my rating is 568.

Don't worry~!!

DO IT DO IT.