




版權說明:本文檔由用戶提供并上傳,收益歸屬內容提供方,若內容存在侵權,請進行舉報或認領
文檔簡介
1、ALGO-9import java.io.*;public class Mainpublic static void main(String args)throws IOExceptionBufferedReader bf=new BufferedReader(new InputStreamReader(System.in);int n=Integer.parseInt(bf.readLine();System.out.println(int)(Math.pow(2,n)-n-1)*2);10import java.io.*;import java.util.Arrays;import jav
2、a.util.HashSet;import java.util.Iterator;import java.util.Set;public class Main public static void main(String args) throws IOException BufferedReader br = new BufferedReader(new InputStreamReader(System.in);int n = Integer.parseInt(br.readLine();int arr = new intn;String st = br.readLine().split(&q
3、uot; ");for (int a = 0; a < arr.length; a+) arra = Integer.parseInt(sta);Arrays.sort(arr);int m = Integer.parseInt(br.readLine();int tag = new intm;String str = br.readLine().split(" ");for (int a = 0; a < tag.length; a+) taga = Integer.parseInt(stra);Arrays.sort(tag);func(arr,
4、tag);public static void func(int arr, int tag) int x;for (int a = 0; a < arr.length; a+) x = Arrays.binarySearch(tag, arra);if (x >= 0) System.out.print(arra + " ");System.out.println();Set<Integer> set = new HashSet<Integer>();for (int a = 0; a < arr.length; a+) set.a
5、dd(arra);for (int a = 0; a < tag.length; a+) set.add(taga);int sor = new intset.size();Iterator<Integer> it = set.iterator();while (it.hasNext() for (int a = 0; a < sor.length; a+) sora = it.next();Arrays.sort(sor);for (int a = 0; a < sor.length; a+) System.out.print(sora + " &qu
6、ot;);System.out.println();int y;for (int a = 0; a < arr.length; a+) y = Arrays.binarySearch(tag, arra);if (y < 0) System.out.print(arra + " ");System.out.println();11import java.util.Scanner;public class Main public static void main(String args)Scanner input = new Scanner(System.in);
7、int n = input.nextInt();if(1<=n && n<=10)if(n=1)System.out.println("1");elseint tag = new intn;tag0 = 1;tag1 = 2;if(n=1)System.out.println(tag0);for(int a=2;a<n;a+)taga = taga-1 + taga-2;System.out.println(tagn-1);12import java.io.BufferedReader;import java.io.InputStreamR
8、eader;public class Main public static void main(String args) throws Exception BufferedReader br = new BufferedReader(new InputStreamReader(System.in);int number = Integer.valueOf(br.readLine();toString(Integer.toBinaryString(number);private static void toString(String binary) char temp = binary.toCh
9、arArray();boolean control = false;for (int i = 0; i < temp.length; i+) if (tempi = '1') if (control)System.out.print("+");elsecontrol = true;System.out.print("2");int mi = temp.length - i - 1;if (mi = 0)System.out.print("(0)");else if (mi > 1) System.out.p
10、rint("(");toString(Integer.toBinaryString(mi);System.out.print(")");13import java.io.*;import java.util.*;public class Main public static void main(String args) throws IOExceptionBufferedReader bf=new BufferedReader(new InputStreamReader(System.in);String s=bf.readLine();String s
11、s=s.split(" ");int numa=new intss.length;int numb=new intss.length;int numc=new intss.length;for(int i=0;i<ss.length;i+)numai=Integer.parseInt(ssi);numbi=1;numci=1;int a1=Integer.MIN_VALUE;int a2=Integer.MIN_VALUE;for(int i=0;i<numa.length;i+)for(int j=0;j<i;j+)if(numai<numaj&a
12、mp;&numbi<numbj+1)numbi=numbj+1;a1=Math.max(a1, numbi);for(int i=0;i<numa.length;i+)for(int j=0;j<i;j+)if(numai>numaj&&numci<numcj+1)numci=numcj+1;a2=Math.max(a2, numci);System.out.println(a1);System.out.println(a2);14import java.io.BufferedReader;import java.io.IOExceptio
13、n;import java.io.InputStreamReader;public class Main private static int n, count;public static void main(String args) throws IOException BufferedReader br = new BufferedReader(new InputStreamReader(System.in);n = Integer.parseInt(br.readLine();String m = br.readLine();long a = Long.parseLong(m, n);l
14、ong b = Long.parseLong(new StringBuilder(m).reverse().toString(), n);if (a = b)System.out.println("STEP=" + 0);elsefunc(a, b);private static void func(long a, long b) count+;if (count > 30) System.out.println("Impossible!");return;long sum = a + b;String str = ""whil
15、e (sum >= n) long tmp = sum % n;sum /= n;if (tmp >= 10)str = (char) (55 + tmp) + str;elsestr = tmp + str;if (sum >= 10)str = (char) (55 + sum) + str;elsestr = sum + str;String reverse = new StringBuilder(str).reverse().toString();if (!str.equals(reverse) a = Long.parseLong(str, n);b = Long.
16、parseLong(reverse, n);func(a, b); else System.out.println("STEP=" + count);return;15import java.util.Scanner;public class Main public static void main(String args) double p = new double10241024;Scanner sc = new Scanner(System.in);int i, j, k = 0;double d1 = sc.nextDouble();double c = sc.ne
17、xtDouble();double d2 = sc.nextDouble();p01 = sc.nextDouble();int n = sc.nextInt();n+;for (i = 1; i < n; i+) pi0 = sc.nextDouble();pi1 = sc.nextDouble();pn+0 = d1;double f = c * d2;for (i = 0; i < n; i+) if (pi + 10 - pi0 > f) System.out.println("No Solution");return;double min = 0
18、, max, d;for (i = 0; i < n - 1; i+) d = pi + 10 - pi0;while (d > 0) while (pi + 10 - pk0 - d >= f)k+;for (j = k; j <= i; j+)if (pj1 < pk1)k = j;max = f - (pi + 10 - pk0 - d);if (max > d)max = d;d -= max;min += max / d2 * pk1;System.out.println(String.format("%.2f", min);1
19、6import java.util.Scanner;public class Main public static void main(String args) Scanner scanner = new Scanner(System.in);int N = scanner.nextInt();int R = scanner.nextInt();char c = "0123456789ABCDEFG".toCharArray();String s1 = N + "="String s = ""while (N != 0) int t
20、= N % R;if (t < 0) t = t - R;N = N / R + 1; elseN = N / R;s = ct + s;System.out.println(s1 + s + "(base" + R + ")");17import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.io.StreamTokenizer;public class Main public static void m
21、ain(String args) throws IOException StreamTokenizer st = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in);st.nextToken();int N = (int) st.nval;st.nextToken();int K = (int) st.nval;st.nextToken();long M = (long) st.nval;String str = String.valueOf(M);long dp = new longK + 1N +
22、1;for (int i = 1; i <= N; i+) dp0i = Long.parseLong(str.substring(0, i);for (int i = 1; i <= K; i+) for (int j = 1 + i; j <= N; j+) for (int k = i; k <= N; k+) int font = 0;for (int l = k; l < j; l+) font = str.charAt(l) - '0' + font * 10;if (dpij < dpi - 1k * font)dpij = d
23、pi - 1k * font;System.out.println(dpKN);18import java.util.Scanner;public class Main private static String a = new String20;private static int b = new int20;private static int max;private static int n;public static void main(String args) Scanner scanner = new Scanner(System.in);n = scanner.nextInt()
24、;for (int i = 0; i < n; i+)ai = scanner.next();String string = scanner.next();f(string, string.length();System.out.println(max);private static void f(String s, int length) for (int i = 0; i < n; i+)if (ai.indexOf(s) = 0 && bi < 2) int length1 = s.length();int length2 = ai.length();b
25、i+;int p = 1;length = length + length2 - length1;while (p < length2) f(ai.substring(length2 - p, length2), length);p += 1;length = length - length2 + length1;bi-;max = length > max ? length : max;19import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public
26、 class Main static int x; static int y; static int n; public static void main(String args) throws IOException BufferedReader br = new BufferedReader(new InputStreamReader(System.in); n = Integer.parseInt(br.readLine(); int tag = new int2 * n + 12 * n + 1; int arr = new intn * n2; out: for (int i = 1
27、; ; i+) String str = br.readLine().split(" "); for (int j = 0; j < 1; j+) x = arri0 = Integer.parseInt(str0); y = arri1 = Integer.parseInt(str1); tagxy = Integer.parseInt(str2); if (x = 0 && y = 0 && tagxy = 0) dp(tag); break out; public static void dp(int tag) int temp
28、= new int2 * n2 * n; int k; for (int i = 2; i <= 2 * n; i+) for (int t = min(i, n), j = t; j > 0; j-) for (k = t; k > 0; k-) tempjk = max(tempjk, tempj - 1k - 1); tempjk = max(tempjk, tempj - 1k); tempjk = max(tempjk, tempjk - 1); if (j = k) tempjk += tagji - j; else tempjk += tagji - j + t
29、agki - k; System.out.println(tempnn); public static int max(int a, int b) return a > b ? a : b; public static int min(int a, int b) return a > b ? b : a; 20import java.util.Scanner;public class Main public static void main(String args) Scanner scanner = new Scanner(System.in);while (scanner.ha
30、sNext() String str1 = scanner.nextLine();String str2 = scanner.nextLine();showResult(str1, str2);System.out.println();private static void showResult(String str1, String str2) char chl = str2.charAt(str2.length() - 1);System.out.print(chl);int index = str1.indexOf(chl);if (index > 0) showResult(st
31、r1.substring(0, index), str2.substring(0, index);if (index < str1.length() - 1) showResult(str1.substring(index + 1),str2.substring(index, str2.length() - 1);21import java.io.*;import java.util.*;public class Main private static int v=new int3120001;public static void main (String args)throws Exc
32、eption/Scanner sc=new Scanner(System.in);BufferedReader bf=new BufferedReader(new InputStreamReader(System.in);/int n=sc.nextInt();/int m=sc.nextInt();int n=Integer.parseInt(bf.readLine();int m=Integer.parseInt(bf.readLine();int a=new intm+1;for(int i=1;i<=m;i+)ai=Integer.parseInt(bf.readLine();/
33、ai=sc.nextInt();for(int i=1;i<=m;i+)for(int j=1;j<=n;j+)if(j<ai)vij=vi-1j;elsevij=Math.max(vi-1j, vi-1j-ai+ai);System.out.println(n-vmn);22import java.util.Scanner;public class Main public static void main(String args) Scanner s = new Scanner(System.in);int n = s.nextInt();int m = s.nextInt
34、();int f = new int25010;for (int i = 0; i <= n; i+) fi1 = 1;for (int i = 2; i <= m; i+) for (int j = 0; j <= n - m; j+) if (i > j) fji = fji - 1; else fji = fji - 1 + fj - ii;System.out.println(fn - mm);23import java.util.Scanner;public class Main public static void main(String args) Sca
35、nner sc = new Scanner(System.in);double a = sc.nextDouble();double b = sc.nextDouble();double c = sc.nextDouble();double d = sc.nextDouble();for(double x=-100;x<=100;x+=.001) if(Math.abs(a*x*x*x+b*x*x+c*x+d) < .01) System.out.printf("%.2f ", x);x+;24import java.util.Scanner;public cl
36、ass Mainstatic int p;static int k;static String S;static int wordsize;static String Word;static int num = 0;static int maxnum = 0;static int kefenge = 0;public static void main(String args) Scanner sc = new Scanner(System.in);p = sc.nextInt();k = sc.nextInt();S = ""sc.nextLine();for (int i
37、 = 0; i < p; i+) S = S + sc.nextLine();wordsize = sc.nextInt();Word = new Stringwordsize;for (int i = 0; i < wordsize; i+) Wordi = sc.next();zhaodanci(S);if(kefenge<k)num = num-(k-1);System.out.println(num);/System.out.println(kefenge);public static void zhaodanci(String s)boolean meizhaoda
38、o = true;for(int i = 0;i<s.length();i+)for(int j = 0;j<wordsize;j+)if(s.substring(i,s.length().length()<Wordj.length()continue;if(s.substring(i,i+Wordj.length().length()<Wordj.length()continue;if(s.substring(i,i+Wordj.length().equals(Wordj)/System.out.println(s+":"+Wordj);num+;
39、if(i != 0)kefenge+;zhaodanci(s.substring(i+1,s.length();return;25該題暫時沒有人完全正確,暫時沒有該語言的參考程序。26import java.io.*;import java.math.BigInteger;public class Main public static void main(String args) throws IOException BufferedReader br = new BufferedReader(new InputStreamReader(System.in);int p = Integer.p
40、arseInt(br.readLine();String result;BigInteger a = new BigInteger("2");result = pow(a, p).toString();int count = result.length();for (int b = 0; b < 500 - count; b+)result = 0 + result;System.out.println(int) (p * Math.log10(2) + 1);for (int b = 0; b < 10; b+)System.out.println(resul
41、t.substring(b * 50, (b + 1) * 50);public static BigInteger pow(BigInteger a, int b) BigInteger x = new BigInteger("1");String s;int len;while (b > 0) if (b % 2 = 1) x = x.multiply(a);s = x.toString();len = s.length();if (len > 500) x = new BigInteger(s.substring(len - 500, len);a = a
42、.pow(2);s = a.toString();len = s.length();if (len > 500) a = new BigInteger(s.substring(len - 500, len);b /= 2;return x.subtract(new BigInteger("1");27import java.util.*;import java.lang.*;public class Main static class TreeNode String data; TreeNode lchild ; TreeNode rchild ; public St
43、ring getData() return data; public TreeNode getLchild() return lchild; public TreeNode getRchild() return rchild; public void setNode(String data,TreeNode lc,TreeNode rc) this.data = data; lchild = lc; rchild = rc; static TreeNode create(TreeNode root,String ss)if(ss.length()=1) root.setNode(ss, nul
44、l, null); return root;TreeNode tl=new TreeNode();TreeNode tr=new TreeNode();root.setNode(ss, create(tl,ss.substring(0,ss.length()/2), create(tr,ss.substring(ss.length()/2,ss.length();return root;static void ff(TreeNode root)if(root!=null)ff(root.getLchild();ff(root.getRchild();System.out.print(ff1(r
45、oot.getData();static char ff1(String s)int i,j;char c='F'for(i=0;i<s.length();i+)if(s.charAt(i)='1')break;for(j=0;j<s.length();j+)if(s.charAt(j)='0')break;if(i=s.length()c='B'if(j=s.length()c='I'return c;public static void main(String args) Scanner sc=ne
46、w Scanner(System.in); int n=sc.nextInt(); String s=sc.next();sc.close();int m=1,j;TreeNode root=new TreeNode();for(int i=1;i<=n;i+)m*=2;for(j=0;j<s.length();j+)if(s.charAt(j)>'1'|s.charAt(j)<'0')break;if(s.length()!=m|j<s.length()System.out.print("error");elsecreate(root,s);ff(root);28import java.io.*;public class Main public static void main(String args) throws NumberFormatException, IOException BufferedReader bf=new BufferedReader(new InputStreamReader(System.in);int n=Integer.parseInt(bf.readLine();int m=Inte
溫馨提示
- 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請下載最新的WinRAR軟件解壓。
- 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請聯系上傳者。文件的所有權益歸上傳用戶所有。
- 3. 本站RAR壓縮包中若帶圖紙,網頁內容里面會有圖紙預覽,若沒有圖紙預覽就沒有圖紙。
- 4. 未經權益所有人同意不得將文件中的內容挪作商業或盈利用途。
- 5. 人人文庫網僅提供信息存儲空間,僅對用戶上傳內容的表現方式做保護處理,對用戶上傳分享的文檔內容本身不做任何修改或編輯,并不能對任何下載內容負責。
- 6. 下載文件中如有侵權或不適當內容,請與我們聯系,我們立即糾正。
- 7. 本站不保證下載資源的準確性、安全性和完整性, 同時也不承擔用戶因使用這些下載資源對自己和他人造成任何形式的傷害或損失。
最新文檔
- 信托與文化創意產業國際交流平臺建設運營考核試卷
- 篷布制造與智能化生產技術考核試卷
- 珠海市珠海二中、斗門一中高三上學期期中聯考地理試題
- 句容市2025屆小升初??家族e數學檢測卷含解析
- 寧夏長慶中學2025屆高三月考試卷(四)生物試題含解析
- 南京工程學院《大數據思維與決策》2023-2024學年第二學期期末試卷
- 吉林省延邊朝鮮族自治州延吉二中2025屆高三年級四月調研考試語文試題含解析
- 山東省高青縣重點名校2025年5月初三模擬考試生物試題試卷含解析
- 南京中醫藥大學翰林學院《建筑環境數值模擬》2023-2024學年第二學期期末試卷
- 吉林省吉林市吉林地區普通高中友好學校聯合體第三十一屆2025屆高考仿真模擬卷(二)英語試題含解析
- 無形資產轉讓協議書(2篇)
- GB/T 27007-2011合格評定合格評定用規范性文件的編寫指南
- GB/T 262-2010石油產品和烴類溶劑苯胺點和混合苯胺點測定法
- GB/T 25744-2010鋼件滲碳淬火回火金相檢驗
- GB/T 23445-2009聚合物水泥防水涂料
- GB/T 22720.1-2017旋轉電機電壓型變頻器供電的旋轉電機無局部放電(Ⅰ型)電氣絕緣結構的鑒別和質量控制試驗
- 項目啟動會監理方講話稿
- 妊娠期哮喘的藥物治療與管理優質課件
- 中國骨質疏松診治指南(新)ppt
- 機柜間主體施工方案
- 中醫臨床三基訓練
評論
0/150
提交評論