本文共 7027 字,大约阅读时间需要 23 分钟。
题目链接:
代码如下:import java.util.Scanner;public class Main { public static int gcd(int a,int b) { return b==0? a:gcd(b,a%b); } public static void main(String[] args) { Scanner sc = new Scanner(System.in); String s = sc.next(); String[] s_num = s.split(","); int[] num = new int[2]; for (int i=0;i<2;i++) num[i]=Integer.valueOf(s_num[i]); System.out.println("gcd="+gcd(num[0],num[1])); }}
题目链接:
代码如下:import java.sql.SQLOutput;public class Main { public static void main(String[] args) { for (int i=0;i<3;i++) System.out.println("I'm gonna WIN!"); }}
题目链接:
代码如下:import java.util.Scanner;public class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n =sc.nextInt(); System.out.println((n+1)%7+1); }}
题目链接:
代码如下:import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int la=sc.nextInt(),lb=sc.nextInt(); int na=0,nb=0; int n=sc.nextInt(); int flag=0; for (int i=0;i0) continue; int j1=0,j2=0; if(da==ha+hb) { j1=1; } if(db==ha+hb) { j2=1; } if(j1!=j2) { if(j1==1) na++; else nb++; } if(na>la) flag=1; if(nb>lb) flag=2; } if(flag==1) { System.out.println("A"); System.out.println(nb); } if(flag==2) { System.out.println("B"); System.out.println(na); } }}
题目链接:
代码如下:import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String s =sc.next(); s=s.toUpperCase(); int numg=0,nump=0,numl=0,numt=0; for (int i=0;i0) { System.out.print('G'); numg--; } if(nump>0) { System.out.print('P'); nump--; } if(numl>0){ System.out.print('L'); numl--; } if(numt>0){ System.out.print('T'); numt--; } } System.out.println(); }}
题目链接:
代码如下:import java.util.Scanner;public class Main { public static boolean judge(int x) { if(x==1||x==0) return false; if(x==2) return true; for(long i=2;i*i<=x;i++) { if(x%i==0) return false; } return true; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); for (int i=0;i
题目链接:
代码如下:import java.util.ArrayList;import java.util.List;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String s = sc.next(); int[] vis = new int[10]; Listnums = new ArrayList<>(); List list = new ArrayList<>(); for (int i=0;i =0;i--) { if(vis[i]>0) nums.add(i); } for (int i=0;i
题目链接:
代码如下:import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String a="",b=""; int i=0; while(true) { String s = sc.next(); if(s.length()==1&&s.charAt(0)=='.') { break; } i++; if(i==2) a=s; if(i==14) b=s; } if(a.equals("")) System.out.println("Momo... No one is for you ..."); else if(b.equals("")) System.out.println(a+" is the only one for you..."); else System.out.println(a+" and "+b+" are inviting you to dinner..."); }}
题目链接:
代码如下:#includeusing namespace std;int v,e,k;const int maxn=505;vector edge[maxn];int col[maxn];int main(){ scanf("%d%d%d",&v,&e,&k); for (int i=0;i
题目链接:
代码如下:#includeusing namespace std;const int maxn=105;int n;char name[105][10];struct peo{ char name[10]; int kind; int num;};peo a[maxn];map ma[maxn];int compare(peo a,peo b){ if(a.kind!=b.kind) return a.kind>b.kind; return a.kind*1.0/a.num>b.kind*1.0/b.num;}int main(){ scanf("%d",&n); for (int i=0;i
题目链接:
代码如下:#includeusing namespace std;const int maxn=1e5+5;int n;int dao[maxn];int num=0;int a[maxn];int Find(int x){ if(x>dao[num-1]) { num++; return num-1; } for (int i=0;i x) return i; }}int main(){ scanf("%d",&n); for (int i=0;i
题目链接:
代码如下:#includeusing namespace std;const int maxi=1e6+5;int n;struct peo{ char sex; int fid,mid;};struct peo id[maxi];bool Find(int xid,int yid,int num){ if(xid==-1||yid==-1) return true; if((id[xid].fid!=-1&&id[xid].fid==id[yid].fid)||(id[yid].mid!=-1&&id[xid].mid==id[yid].mid)) return false; num++; if(num>=4) return true; return Find(id[xid].fid,id[yid].mid,num)&&Find(id[xid].fid,id[yid].mid,num)&&Find(id[xid].mid,id[yid].fid,num)&&Find(id[xid].mid,id[yid].mid,num);}int main(){ scanf("%d",&n); memset(id,-1,sizeof(id)); for (int i=0;i
题目链接:
代码如下:#includeusing namespace std;const int maxn=25;struct tree{ tree* left,*right; int val; tree(int v,tree* left,tree* right) { val=v; this->left=left; this->right=right; }};int n;vector ans;tree* root=NULL;tree* create(tree* t,int val){ if(t==NULL) { return new tree(val,NULL,NULL); } if(t->val>val) t->right=create(t->right,val); else t->left=create(t->left,val); return t;}int main(){ scanf("%d",&n); for (int i=0;i q; q.push(root); while(!q.empty()) { int Size=q.size(); while(Size--) { tree* t=q.front(); ans.push_back(t); q.pop(); if(tflag==1&&(t->left!=NULL||t->right!=NULL)) flag=1; if(t->right!=NULL&&t->left==NULL) { flag=1; } if(t->right==NULL) { tflag=1; } if(t->left!=NULL) { q.push(t->left); } if(t->right!=NULL) { q.push(t->right); } } } for (int i=0;i val,i==ans.size()-1?'\n':' '); } if(flag==1) printf("NO\n"); else printf("YES\n");}
转载地址:http://tcaen.baihongyu.com/