摘要:
#includeint main(){ int n; char xing; scanf("%d %c",&n,&xing); int num=1,i=1; while(1) { num = num + 2 * (i + 2); //一开始就超出,不改变i if... 阅读全文
摘要:
#includeint main(){ int n; char xing; scanf("%d %c",&n,&xing); int num=1,i=1; while(1) { num = num + 2 * (i + 2); //一开始就超出,不改变i if... 阅读全文
摘要:
#include#include#include#include#includeusing namespace std;char g1[99],g2[99],g3[99],g4[99];char alp[7][5]={"MON","TUE","WED","THU","FRI","SAT","SUN"... 阅读全文
摘要:
#includeint main(){ int a,b; scanf("%d%d",&a,&b); int sum=a+b; if(sum=1000000) //【思维】,两个数字在:-1000000 =1000) printf("%d,%03d",sum/1000,... 阅读全文
摘要:
#include#include#includeusing namespace std;struct node{ int address; int data; int next; bool tag;}Node[100066];bool cmp(node a,node b){ if(a.ta... 阅读全文
摘要:
#include#include#includeusing namespace std;struct Student{ int GE,GI,sum,rank,ID; int prefer[6];}STU[40066];struct School{ int want; //各学校招... 阅读全文
摘要:
#include#include#includeusing namespace std;struct Student{ int ID; int score[6]; int perfect; int sum; int rank; bool tag;}S[10066];int p[6]; ... 阅读全文
摘要:
#include#include#includeusing namespace std;int main(){ int arr[2111]; fill(arr,arr+2111,0); int n=0,tmp; while(scanf("%d",&tmp)!=EOF) //存储系数... 阅读全文
摘要:
#include#include#include#includeusing namespace std;const int MAX=1010;bool tag[MAX]; //标记BFS是是否被访问过struct node{ int ID; //编号 int layer; ... 阅读全文
摘要:
#include#include#includeusing namespace std;const int MAX=50;int n,cnt=0; //n个节点,cnt在后序输出的时候控制空格数量用int PRE[MAX],IN[MAX]; //先序,中序int preI,inI; ... 阅读全文
摘要:
#include#include#includeusing namespace std;int POST[32]; //存放后序遍历int IN[32]; //存放中序遍历int n; //节点数struct node{ int data; node* ... 阅读全文