herrDeng網內搜尋
自訂搜尋
熱門文章
-
url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"
-
連續複利
-
請用Random產生20個0~99的奇數(可重複)，然後排序
-
py3 cpp Line sweep解Leetcode 3346 Maximum Frequency of an Element After Performing Operations I 使用 line sweep不用排序，可得線性解 [Py3解請進]
-
C++ Py3 計數排序與partial sum解Leetcode 2300 Successful Pairs of Spells and Potions Portions的極大值小於等於10萬是可進行記數排序的關鍵，既然可以採用記數排序，後面的二元搜尋也可以透過part...
-
Py3 C++ C 2pointer速解Leetcode 11Container With Most Water [Py3 code請進]
-
Py3 C++計數bitmask與2 pointers速解Leetcode2273 Find Resultant Array After Removing Anagrams 字串長度最長也只有10，四個bits一組，用bitmask解題 ----- The maximum le...
-
輸入公元n年，輸出"平年" "閏年"
12 則留言:
class jj{
public static void main(String []args){
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
System.out.print(i+"*"+j+"="+i*j+"\t");
}
System.out.println();
}
}
}
class black{
public static void main(String[] argv)
{
int i,j;
for (i=1; i<=9; i++)
{
for (j=1; j<=9; j++)
{
System.out.print("\t"+i+"*"+j+"="+(i*j));
}
System.out.println();
}
}
}
class m {
public static void main(String[] argv)
{
int i,j;
for (i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{System.out.print(i+"*"+j+"="+(i*j)+"\t");
}
System.out.println();
}
}
}
class ccc
{
public static void main(String[]args)
{
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
System.out.print(i+"*"+j+"="+i*j+"\t");
System.out.println();
}
}
}
class hello {
public static void main(String[] argv)
{
int i,j;
for (i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{System.out.print(i+"*"+j+"="+(i*j)+"\t");
}
System.out.println();
}
}
}
class Multiplication
{
public stastic void main (String[]argv)
{
int i,j;
for (i=1;i<=9;i++)
{
for (j=1;j<=9;j++)
{
System.out.print("\t"+i+"*"+j+"="+(i*j));
}
System.out.println();
}
}
}
class inarray{
public static void main(String []
argv)
{
int i,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{System.out.print(i+"*"+j+"="+(i*j)+"\t");
}
System.out.println();
}
}
}
class inarray{
public static void main(String []
argv)
{
int i,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{System.out.print(i+"*"+j+"="+(i*j)+"\t");
}
System.out.println();
}
}
}
class inarray{
public static void main(String []
argv)
{
int i,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{System.out.print(i+"*"+j+"="+(i*j)+"\t");
}
System.out.println();
}
}
}
class inarray{
public static void main(String []
argv)
{
int i,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{System.out.print(i+"*"+j+"="+(i*j)+"\t");
}
System.out.println();
}
}
}
class bbb{
public static void main(String [] argv)
{
int i,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{System.out.print(i+"*"+j+"="+(i*j)+"\t");
}
System.out.println();
}
}
}
class abc{
public static void main(String [] argv)
{
int i,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{System.out.print(i+"*"+j+"="+(i*j)+"\t");
}
System.out.println();
}
}
}
張貼留言