Jyw Friendship Gifts.
1#include <iostream>2#include <cstdio>3#include <cstring>4#include <algorithm>5 #defineLX 20006 using namespacestd;7 8 structedge{9 intU,v,next;Ten }EG[MAXM]; One A intmmintAintBint&C) {return 0; } - - intMain () { the -Freopen ("stdin.in","R", stdin); -Freopen ("Stdout.out","W", stdout);//file input and output - + intCas,n; -scanf"%d",&CAs); + while(cas--){ A}//working with multiple sets of data at - CharVAC[LX][LX]; -scanf"%d",&n); -scanf"%c", &vac[0][0]); - for(intI=1; i<=n;i++) scanf ("%s", Vac[i] +1);//read in string - in intK[LX]; -scanf"%d",&n); to for(intI=1; i<=n;i++) scanf ("%d", K +i); +Sort (k +1, k+n+1);//from 1 to n default from small to large sort - the fclose (stdin); fclose (stdout); *Exit0);//quit the whole program, Fclose don't write. $ Panax Notoginseng intA=0, B; -b=a++; printf"a=%d b=%d\n", A, b); theB=++a; printf"a=%d b=%d\n", A, b);//The former is the first assignment after the addition, the latter is added first and then assigned to the value + A intp; thescanf"%d",&p); + Switch(p) { - Case 0: $ Case 1: $ Case 2:p rintf ("Orz jry\n"); Break; - Case 3:p rintf ("Orz jc\n"); Break; - Case 4: the Case 5:p rintf ("Orz dzy\n"); Break; -}//equivalent to case, but a single case: the right side must be added break, otherwise you will execute other caseWuyi the return 0; -}
Mode-c++