Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
home by stars
//'main' method must be in a class 'Rextester'. //Compiler version 1.8.0_111 import java.util.*; import java.lang.*; class Rextester { public static void main(String args[]) { for(int i=1;i<=25;i++){ for(int j=1;j<=23;j++){ if(((i==1) || (i==2)) && ((j>=4) && (j<=8)) || ((i==3) || (i==4) || (i==5)) && ((j>=5) && (j<=7)) || (i==6) && ((j>=4) && (j<=20)) || (i==7) && ((j==3) || (j==21)) || (i==8) && ((j==2) || (j==22)) || (i==9) && ((j>=1) && (j<=23)) || (i==10) && ((j==4) || (j==20)) || ((i==11) || (i==12)) && ((j==4) || (j==7) || (j==8) || (j==16) || (j==17) || (j==20)) || (i==13 || i==14) && ((j==4) || (j==20)) || (i>=15 && i<=17) && ((j==4) || ((j>=11) && (j<=13)) || (j==20)) || (i==18) && ((j>=4) && (j<=20)) || (i==19) && ((j>=11) && (j<=13)) || (i==20) && ((j>=10) && (j<=12)) || (i==21 || i==22) && ((j>=9) && (j<=11)) || (i==23) && ((j>=10) && (j<=12)) || (i==24 || i==25) && ((j>=11) && (j<=13))) { System.out.print("*"); } else{ System.out.print(" "); } } System.out.println(); } } } (j
run
|
edit
|
history
|
help
0
1.7
2B
cuboid volume
reverse Linked List
classwork
Case 2nd Clear
f
JAVA # 3 sayının En büyüğü
Ifelsenested
Graph adjacency list representation