《OJ课程设计报告》由会员分享，可在线阅读，更多相关《OJ课程设计报告（47页珍藏版）》请在金锄头文库上搜索。
1、Aimport java.util.Scanner;public class A public static void main(String args) / TODO 自动生成的方法存根Done();private static void Done() / TODO 自动生成的方法存根Scanner in=new Scanner(System.in);int i,k,n,l;long s;while(in.hasNext()n=in.nextInt();s=0;l=n-2;if(n=1)/cout3)for(i=1; i3)k=(n-2)+(n-1)+n;/cout1) k = 3*(n+1
2、); /cout a=new Vector();Vector b=new Vector();Vector c=new Vector();*/int a=new int1000000;int b=new int1000000;int c=new int50005;Scanner in=new Scanner(System.in);while(in.hasNext()Arrays.fill(a, 0);Arrays.fill(b, 0);int n=in.nextInt();int max=-1;int num;if(n=0)break;for(int i=0;imax)max=num;for(i
3、nt i=0;imax)max=num;int k=0;int j=0;for(int i=1;i0)/System.out.println(“0“);Arrays.fill(a,0);Arrays.fill(s, 0);Arrays.fill(temp2,0);temp1=in.next();a=temp1.toCharArray();/System.out.println(temp1);/n=in.nextInt();String ch=in.next();temp2=ch.toCharArray();/int ch=in.nextInt();/System.out.println(tem
4、p2);/char ch=(char)temp;/System.out.println(temp+“ “+ch);/*for(i=0;i=0 break; start+; else if(startend) flag=true; break; end-; /System.out.println(s);if(flag)System.out.println(“error“);elseSystem.out.print(“); if(sum%2=0)if(start=start) for(i=end;istart;i-) System.out.print(si+“,“);System.out.prin
5、t(sstart); System.out.println(“);/continue; Gimport java.util.Scanner;public class G static int max=100;static int SIZE=100;static int a=new intmax;public static void main(String args) / TODO 自动生成的方法存根Done();private static void Done() / TODO 自动生成的方法存根Scanner in=new Scanner(System.in);int num;int tim
6、e;int i,j;while(true)num=in.nextInt();time=in.nextInt();if(num=0 for (i = 0; iak)judgep+ = ak;if (clear(judge, p)continue;elseSystem.out.println(“NO“);return;System.out.println(“YES“);private static boolean clear(int judge, int p) / TODO 自动生成的方法存根int i;for (i = 0; i0)opChar.pop();while(opNum.size()0
7、)opNum.pop();opChar.push(#);i=0;while(i0)double temp=(double) opNum.peek();opNum.pop();temp=Compute(char)opChar.peek(),(double)opNum.peek(),temp);opChar.pop();opNum.pop();opNum.push(temp);elseopChar.push(stri);i+;System.out.printf(“%.2fn“, opNum.peek();opNum.pop();private static double Compute(char
8、c, double x, double y) / TODO 自动生成的方法存根switch(c)case +:return x+y;case -:return x-y;case *:return x*y;case /:return x/y;return 0;private static int Compare(char ope1, char ope2) / TODO 自动生成的方法存根if(ope1=*) | (ope1=/)return 1;if(ope1=+) | (ope1=-)if(ope2=*) | (ope2=/)return -1;else return 1;else if(op
9、e1=#)if(ope2=#)return 0;else return -1;return 0;private static boolean isOperate(char c) / TODO 自动生成的方法存根if (c = +)return true;if (c = -)return true;if (c = *)return true;if (c = /)return true;if (c = #)return true;return false;Iimport java.util.Scanner;public class Mainpublic static void main(Strin
10、g args) / TODO 自动生成的方法存根 Scanner in=new Scanner(System.in); long n, m; while (in.hasNext() /scanf(“%lld%lld“, n=in.nextLong(); m=in.nextLong();long num = 0; /ans=(ans+k)%i long s = 1; int flag = 1; for (long i = 2; i n) num = (num + (n + 1 - i)*m) + s) % n; flag = 0; break; i += leap; num += leap*m;
11、 else num = (num + m) % i; i+; if (flag!=0) num = (num + s) % n; if (num = 0) /printf(“%lldn“, n); System.out.println(n); else /printf(“%lldn“, num); System.out.println(num); Jimport java.util.Arrays;import java.util.Scanner;class Treechar data;Tree left,right;public class J static int SIZE=150;stat
12、ic int MAX=150;static char str1=new charSIZE;static char str2=new charSIZE;static String temp1=new String();static char temp2=new charSIZE;static int num1=0;static int num2=0;public static void main(String args) / TODO 自动生成的方法存根Done();private static void Done() / TODO 自动生成的方法存根Scanner in=new Scanner
13、(System.in);int i,j,temp;int Str1Length=0;int Str2Length=0;Tree root=new Tree();temp=in.nextInt();for(i=0;i q=new LinkedList();public static void main(String args) / TODO 自动生成的方法存根Done();private static void Done() / TODO 自动生成的方法存根int i,j,m=0,temp = 0,d=0;Scanner inn=new Scanner(System.in);while(inn.
14、hasNext()tempnum1=inn.next();tempnum=tempnum1.toCharArray();int flag=0;int num=0;for(int a=0;a=0;i-)if(Visinxi=0)q.offer(inxi);while(q.isEmpty()=false)x=q.peek();q.poll();BFS(x);private static void DFS(int x) / TODO 自动生成的方法存根if(Visx!=0)return;elseDFS_sqx1+=x;Visx=1;for(int i=inx0;i=0;i-)if(Visinxi=0
15、)DFS(inxi);private static int Search(int temp) / TODO 自动生成的方法存根for(int i=0;ikey)/左插 p.parent=root; root.left=p; return; if(root.right=null else if(root.keykey)/左插 p.parent=root; root.left=p; return;if(root.right=null else if(root.key0)num=0;Arrays.fill(Vis_B, 0);node root2=new node();root2=null;int num21=new int110;int num22=new int110;Arrays.fill(num21, 0);Arrays.fill(num22, 0);k=in.nextInt();for (i = 0; icc)mataab
