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++計數bitmask與2 pointers速解Leetcode2273 Find Resultant Array After Removing Anagrams 字串長度最長也只有10，四個bits一組，用bitmask解題 ----- The maximum le...
-
輸入公元n年，輸出"平年" "閏年"
-
C++ py3 C Rust adjacent difference與loop速解Leetcode 1526 Minimum Number of Increments on Subarrays to Form a Target Array [Py3一行解請進]
15 則留言:
public class hello {
public static void main(String[] args) {
double sum=0;
for(int n=1;n<1e3;n++)
sum=sum+1.0/(n*n);
System.out.print(sum);
public class ex1 {
public static void main(String[] args) {
double sum=0;
for(int n=1;n<1e3;n++)
sum=sum+1.0/(n*n);
System.out.print(sum);
public class ex1 {
public static void main(String[] args) {
double sum=0;
for(int n=1;n<1e3;n++)
sum=sum+1.0/(n*n);
System.out.print(sum);
public class EX
{
public static void main(String[] args)
{
double n,sum=0;
for(n=1;n<=1e6;n=n+1)
sum=sum+1.0/(n*n);
System.out.println(sum);
}
}
public class uilioloilil {
public static void main(String[] args) {
double sum=0;
for(int n=1;n<=1e3;n=n+1)
sum=1.0/(n*n)+sum;
System.out.println(sum);
}
package zzz;
public class ex1 {
public static void main(String[] args) {
int n;
double sum=0;
for(n=1;n<1e3;n=n+1)
sum=sum+1.0/(n*n);
System.out.println(sum);
}
}
public class aaa {
public static void main(String[] args) {
int n;
double sum=0;
for(n=1;n<=1e6;n=n+1)
sum=sum+1.0/((double)n*n);
System.out.println(sum);
}
}
public class ex1 {
public static void main(String[] args) {
int n;
double sum=0;
for(n=1;n<=1e3;n=n+1)
sum=sum+1.0/(n*n);
System.out.println(sum);
}
}
public class Hello {
public static void main(String[] args) {
double sum =0;
for(int n=1;n<=1e3;n++)
sum = sum + 1.0/(n*n);
System.out.print(sum);
}
}
public class ex2
{
public static void main(String[] args)
{
int n;
double sum=0;
for(n=1;n<1e3;n=n+1)
sum=sum+1.0/(n*n);
System.out.println(sum);
public class willia {
public static void main(String[] args) {
int n;
double sum=0;
for(n=1;n<=1e3;n++)
sum=sum+1.0/(n*n);
System.out.println(sum);
}
}
public class ex1 {
public static void main(String[] args) {
int n;
double sum=0;
for(n=1;n<=1e3;n=n+1)
sum=sum+1.0/(n*n);
System.out.println(sum);
}
}
public class ex1 {
public static void main(String[] args) {
int n;
double sum =0;
for(n=1;n<=1e3;n++)
sum=sum+1.0/(n*n);
System.out.println(sum);
}
public class ex2 {
public static void main(String[] args) {
int n;
double sun=0;
for(n=1;n<=1e3;n++)
sun=sun+1.0/(n*n);
System.out.println(sun);
}
}
public class ex1 {
public static void main(String[] args) {
int n;
double sun=0;
for(n=1;n<=1e3;n=n+1)
sun=sun+1.0/(n*n);
System.out.println(sun);
}
}
張貼留言