herrDeng網內搜尋
自訂搜尋
熱門文章
-
教育部為提昇全民資安素養與電腦防護能力，本部於101年9月5日至11月5日舉辦「全民資安素養自我評量」活動，請在活動期間內踴躍上網檢測資訊安全素養認知程度，並有機會參與抽獎，詳情請參閱活動網站（網址： https://isafe.moe.edu.tw/event
-
Py3排序 C++nth_element速解Leetcode 2099 Find Subsequence of Length K With the Largest Sum C++的nth_element很好用，基本上是做partition，在這個問題可取代sort ---- C...
-
C++ Py3 hashmap與binary search解Leetcode 1865 Finding Pairs With a Certain Sum 基本上用 hashmap。解釋為什麼要使用排序和二元搜尋找來優化程式碼 ----- Basically use hashmap...
-
Py3 C++位元計算bitset速解Leetcode難題3307 Find the K th Character in String Game II [Py3 一行解請進]
-
Py3 C++奇偶交錯奇偶子數列解Leecode 3201 Find the Maximum Length of Valid Subsequence I 求最長有效子序列，使得 (sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 ==...
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);
}
}
張貼留言