C++代码如下#include<iostream>#include<cstdio>#include<algorithm>//排序算法的头文件using namespace std;int a[100];int b[100];bool binary(int n,int target){ //二分查找过程 int left=0; int right=n-1; int middle; while(left<=right){ middle=(left+right)/2; if(target>a[middle]){ left=middle+1; } if(...

include include include include<string.h> using namespace std;typedef struct Student { char name[50]; int score; int n;}stu;bool compare1(stu A, stu B) { if(A.score==B.score) return A.n<B.n; else return A.score > B.score;}bool compare2(stu A, stu B) { if(A.score==B.score) return A.n<B...

include  include  using namespace std;int main() { int n, steep; while (scanf("%d\n",&n)!=EOF) { if(n==0) break; steep = 0; while (n != 1) { if (n % 2 == 0) { n = n / 2; steep++; } else { n = (n * 3 + 1) / 2; steep++; } } printf("%d\n",steep); } return 0;}

include  include  include <string.h> using namespace std;int a[27]={0,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,4,1,2,3,1,2,3,4};//预处理char str[8][4]={{'a','b','c',32},{'d','e','f',32},{'g','h','i',32},{'j','k','l',32}, {'m','n','o',32},{'p','q','r','s'},{'t','u','v',32},{'w','x','y','z'}};bool ifwai...

include include using namespace std; int main(){ bool a[10000]={false};//初始化为false int L,M,x,y,sum=0; scanf("%d %d",&L,&M); for(int i=0;i<=L;i++){ a[i]=true;//所用到的范围设置为true } while(M--){ scanf("%d %d",&x,&y); for(int i=x;i<=y;i++) a[i]=false;//去掉的树为false } for(int i=0;i<=L;i...

注意判断闰年就好了 预处理能用空间换时间。#include<iostream>#include<cstdio>using namespace std;</cstdio></iostream> int model[2][13]={{0,31,28,31,30,31,30,31,31,30,31,30,31},//预处理 {0,31,29,31,30,31,30,31,31,30,31,30,31}}; bool ifyear(int year){ if((year%100!=0&&year%4==0)||year%400==0)//...