fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. typedef long long int li;
  4. li hi;
  5.  
  6. void func()
  7. {
  8. string rep[] = {"0","1","2","3","4","5","6","7","8","9"};
  9. string arr[] = {"ZERO", "ONE", "TWO", "THREE", "FOUR", "FIVE", "SIX", "SEVEN", "EIGHT", "NINE"};
  10. string str,str1,ans="";
  11. cin >> str;
  12. li i,k,f,ii,j,k1;
  13. vector<li> ha(100,0);
  14. for(i=0;i<str.length();++i){
  15. k = str[i]-'A';
  16. ++ha[k];
  17. }
  18. for(i=0;i<=9;++i){
  19. str1 = arr[i];
  20. f = 1;
  21. while(f){
  22. for(ii=0;ii<str1.length();++ii){
  23. k = str1[ii] - 'A';
  24. if(ha[k] == 0) {
  25. f = 0;
  26. for(j=0;j<ii;++j){
  27. k1 = str1[j] - 'A';
  28. ha[k1]++;
  29. }
  30. break;
  31. }
  32. ha[k]--;
  33. }
  34. if(f){
  35. ans += rep[i];
  36. }
  37. }
  38. }
  39. cout <<"Case #"<<hi<<": " << ans << endl;
  40. }
  41.  
  42.  
  43. int main()
  44. {
  45. li test;
  46. cin >> test;
  47. for(hi=1;hi<=test;++hi) func();
  48.  
  49. }
Success #stdin #stdout 0s 2824KB
stdin
100
OZONETOWER
WEIGHFOXTOURIST
OURNEONFOE
ETHER
EXIEONNOS
EIUZFOVEORRF
NNNNNEOIONNOEEEEI
TIHGE
ERRZOOOOZRROEEEEZNZ
GEENIOIITETTNGWHH
NEO
REEVSERFHEONTU
INEITHEONOGNEEN
RZEOEREOZOOZEORRREZZ
ERZO
OTENNEEONOONNOOEEW
OEN
VEISERFVFIUNSOXE
FIUNRESSVEFXOVIE
UGIUETIFFWVORTOFROHE
EIOEXNSNIN
REZO
EWOFETRTORHU
IIEEEVRNEHTEEFSNNV
EESNOOFTNVEEVWI
INNIOENXEEOSN
NNNEEOONEEOENINO
OEUENZIZOERFNROR
RONEFNUI
NHTEFNREIEUOR
TOIZIGSEZERROEXH
NEIENIENNINONINENEN
OSXTIOEEIWRNNOENZ
EZOERSNRINVFOENEU
REWUHRETOFTO
EOZR
IEETEFOOHRTRGHUEN
ONENESINNEOENEV
NSVEE
EENOVENINVSNFEIE
SOEENEVN
NNNNNIENIEENNEININIE
INXNIIEEFVS
OOWTWTOOWWOTTTOWWT
EENSNNNEIEENESOVV
ONE
ROEURTHEF
VIINEEESEXINNVSF
TEERIFEVVEERSTEHNHE
GEIXSIHT
TWUGRTHEFNOIOOE
ETTOWONWNONWOOTEOE
EWEFVNENNIRUTOIFOO
REZZOOER
HTIGE
IESWIONNNTEXO
ONSNEXIOIXES
XNRONIUEIFS
IVRHTFEEE
EONINEVFEO
ORSIXORXIEESZZ
EEIENNNEEIONNVSN
ROURTEEEZOHNROFE
ISOZERX
STIEWTOOESGXTWIIOHNX
INOVZOEXESESRERZ
OONTEWOOEONSTNVWEEEN
TTWROEEH
VFEI
IZXERISVNRFNEOFIEUO
EOIXORZORZFESUR
IHTUEEFOGRON
OENONNUREFI
TENHETENHIERGI
FNEVIOE
VNESE
NOEEOOOETNTNOWOWEN
OOENNENOEONNEOE
TOTRTTHWEEEHRWEO
ZREO
ZERO
VWSOURWETTEFNOO
EIUXSNRFOO
HSEEERNEVT
ROEIXHTOSXTUSWRIEF
FVEI
EOTNWWENTOTWTOOWOO
SVXFIFIEVEI
NTEEFRUNHGEIEVSOIN
OOREEZN
OEONEENEOOENNONENO
TTWONWTWOOOOTWWEOT
INNOENNEOEENIINENN
SWETEIXSNOV
EVSFUESRXNIO
NIRNOEEVNNFSEIEOZVEE
VOFEVIEWEFOENWINOTOT
EOOEZNR
ENNOIEOUEFRINNN
ERREINHETTFHVEEOE
stdout
Case #1: 012
Case #2: 2468
Case #3: 114
Case #4: 3
Case #5: 116
Case #6: 045
Case #7: 11199
Case #8: 8
Case #9: 00001
Case #10: 188
Case #11: 1
Case #12: 13
Case #13: 1189
Case #14: 00000
Case #15: 0
Case #16: 111112
Case #17: 1
Case #18: 155
Case #19: 155
Case #20: 234
Case #21: 169
Case #22: 0
Case #23: 234
Case #24: 3579
Case #25: 115
Case #26: 1169
Case #27: 11119
Case #28: 001
Case #29: 1
Case #30: 13
Case #31: 0068
Case #32: 19999
Case #33: 0116
Case #34: 015
Case #35: 234
Case #36: 0
Case #37: 1348
Case #38: 1179
Case #39: 7
Case #40: 1579
Case #41: 17
Case #42: 99999
Case #43: 569
Case #44: 222222
Case #45: 1779
Case #46: 1
Case #47: 34
Case #48: 5679
Case #49: 3357
Case #50: 68
Case #51: 1248
Case #52: 111222
Case #53: 111
Case #54: 00
Case #55: 8
Case #56: 116
Case #57: 1166
Case #58: 16
Case #59: 35
Case #60: 115
Case #61: 0066
Case #62: 1799
Case #63: 0134
Case #64: 06
Case #65: 122668
Case #66: 0067
Case #67: 11112
Case #68: 23
Case #69: 5
Case #70: 0156
Case #71: 0046
Case #72: 148
Case #73: 11
Case #74: 389
Case #75: 15
Case #76: 7
Case #77: 111122
Case #78: 11111
Case #79: 2233
Case #80: 0
Case #81: 0
Case #82: 122
Case #83: 146
Case #84: 37
Case #85: 23466
Case #86: 5
Case #87: 112222
Case #88: 556
Case #89: 135
Case #90: 01
Case #91: 111111
Case #92: 122222
Case #93: 11999
Case #94: 16
Case #95: 15
Case #96: 01579
Case #97: 112255
Case #98: 01
Case #99: 119
Case #100: 1335