UESTC Summer Training #1 Div.2

The willpower has been so precarious lately. I don't know if I can keep on.

So weak still blind tangled ... Can roll away.

Water problems are not done.

LCS (A)

Water

LCS (B)

No problem.

Gym 100989C

Water

1D Cafeteria (B)

Won't catch

Gym 100989E

Water

Gym 100989F

Water

Mission in Amman (B)

No problem.

Queue (A)

I feel test instructions understand something.

1#include <iostream>2#include <cstdio>3#include <cstring>4#include <algorithm>5 using namespacestd;6 intn,f[6],c[6],b[6],cnt[ -];7 8 intCheckintx) {9      for(inti =5; I >=1; i--){Ten         intCC = x/B[i]; One         if(CC > Cnt[b[i]])return 0; ACnt[b[i]]-=cc; -X-= b[i]*cc; -     } the     return 1; - } -  - voidsolve () { +     inttot; -b[1]=1; b[2]=5; b[3]=Ten; b[4]= -; b[5]= -; +Memset (c,0,sizeof(c)); Amemset (CNT,0,sizeof(CNT)); at     intOK =0; -      for(inti =1; I <= n;i++){ -scanf"%d",&tot); -         intTMP =0, Yu =0; -          for(intj =1; J <=5; j + +){ -scanf"%d",&c[j]); inTMP + = c[j]*B[j]; -CNT[B[J]] + =C[j]; to         }  +Yu = tmp-tot; -         if(!check (yu)) ok =1; the     } *  $     if(OK = =1) puts ("No");Panax Notoginseng     ElsePuts"Yes"); - } the  + intMain () { A      while(SCANF ("%d", &n)! =EOF) { the solve (); +     } -     return 0; $}

View Code

Queue (B)

Didn't read the question.

Objects Panel (A)

Find it hard to write, and not write ... But there are a lot of people.

Objects Panel (B)

No problem.

Plus or minus (A)

Water

Plus or minus (B)

No problem.

Mixed Dimensions

No problem.

I am very good at food ....... ............................

UESTC Summer Training #1 Div.2