fork(2) download
copy 
  1. #include <iostream>
  2. #include <cstdio>
  3. #include <cstdlib>
  4. #include <cfloat>
  5. #include <climits>
  6. #include <cmath>
  7. #include <cstring>
  8. #include <string>
  9. #include <vector>
  10. #include <stack>
  11. #include <queue>
  12. #include <set>
  13. #include <map>
  14. #include <algorithm>
  15.  
  16. using namespace std;
  17.  
  18. int a[26],c[10];
  19. int main()
  20. {
  21. 	string s;
  22. 	int T;
  23. 	cin>>T;
  24. 	for(int t=1;t<=T;++t)
  25. 	{
  26. 		string s, z;
  27. 		int a=0;
  28. 		cin >> s >> z;
  29. 		for(int i=0; i < s.size(); ++i)
  30. 		{
  31. 			if(a==0)
  32. 			{
  33. 				if(s[i] == '?')
  34. 				{
  35. 					if(z[i] == '?')
  36. 					{
  37. 						s[i]='0';
  38. 						z[i]='0';
  39. 					}
  40. 					else
  41. 					{
  42. 						if(i+1 < s.size() && z[i] > 0 && (s[i+1]-'0') - (z[i+1]-'0') == 5)
  43. 							s[i] = z[i]-1;
  44. 						else
  45. 							s[i] = z[i];
  46. 					}
  47. 				}
  48. 				else if(z[i] == '?')
  49. 				{
  50. 					if(i+1 < s.size() && s[i] > 0 && (z[i+1]-'0') - (s[i+1]-'0') == 5)
  51. 						z[i] = s[i]-1;
  52. 					else
  53. 						z[i] = s[i];
  54. 				}
  55. 				else if(s[i] > z[i])
  56. 					a = 1;
  57. 				else
  58. 					a = -1;
  59. 			}
  60. 			else if(a==1)
  61. 			{
  62. 				if(s[i] == '?')
  63. 					s[i] = '0';
  64. 				if(z[i] == '?')
  65. 				{
  66. 					if(i+1 < s.size() && (z[i+1]-'0') - (s[i+1]-'0') == 5)
  67. 						z[i] = '8';
  68. 					else
  69. 						z[i] = '9';
  70. 				}
  71. 			}
  72. 			else
  73. 			{
  74. 				if(s[i] == '?')
  75. 				{
  76. 					if(i+1 < s.size() && (z[i+1]-'0') - (s[i+1]-'0') == 5)
  77. 						s[i] = '8';
  78. 					else
  79. 						s[i] = '9';
  80. 				}
  81. 				if(z[i] == '?')
  82. 					z[i] = '0';
  83. 			}
  84. 		}
  85. 		cout<<"Case #" <<t<<": " << s << " " << z << endl;
  86. 	}
  87. 	return 0;
  88. }
Success #stdin #stdout 0.01s 3468KB
comments (?)
stdin
copy 
200
1? 2?
?2? ??3
? ?
?5 ?0
?? ?0
?0? 99?
99 ?5
0?? 9?9
?9 0?
99 0?
2?1 6??
?8 93
?26 ???
??7 525
?9 99
?4? 237
??4 ?38
?70 ?37
??3 ?6?
0? ?0
?5 ?9
7?5 9?0
?99 1??
?2? ?8?
?6? 5?9
?1? ?7?
9?8 49?
9?8 ?93
?84 1??
??? ?9?
? 5
?5 0?
?4? ?0?
??9 7??
?92 9?8
9?? 18?
66? ?2?
?61 ?04
476 ?8?
3?7 76?
5 ?
?4? ?8?
02? 541
??? ???
?1? ?6?
??2 ??1
?6? ?1?
? 9
9? ??
?2? ?46
4?1 0??
?0? 2??
10? ?60
?9 9?
9? ?0
6?? 15?
80? 6??
?99 ??0
?4? ?6?
2?? 4?7
?? 0?
439 ?2?
?0 ?9
?5? ?0?
?0 0?
6?? 7??
??? 5?1
4?2 ?8?
99 ?9
97? 440
??? ?23
?21 ??7
?5 99
?? 9?
568 3??
99 ??
?3? ?9?
?2? 1?3
0 ?
6?? ???
??7 4?1
??0 ?99
??? 4??
0? ??
?9? ?4?
?6? ?2?
??9 1?5
? 0
?8? ?6?
??0 9?9
?2? ?6?
0? 99
?3? 389
99 9?
?0 ?5
?7? ?1?
?21 67?
?9? ?3?
99 ?0
?85 ??6
??6 ???
?? ?5
9 ?
??6 3?3
??3 ?98
?6? ?48
343 95?
??6 7??
37? 6?7
??5 8??
18? 305
??? 57?
?01 ???
?16 3??
?1? ?5?
??2 ?98
??? 9?2
?0 ??
?96 6??
?2? ?7?
?8? ?2?
0? ?5
0?7 ?41
?8? ?4?
9?8 ?92
?9 ?5
?0? ?5?
?67 ???
448 0??
?54 7??
??7 5?0
?0? ?4?
1?8 ?9?
?5? ?1?
?0 9?
?3? 727
?92 ??3
?3? ?8?
0?? 910
53? ??7
83? 144
60? ?7?
??7 ?3?
?7? ?2?
?9? 91?
9?9 ??0
?7? 9??
??0 ??9
03? ??8
9? ?5
?5 10
?00 ???
3?8 ?10
?1? ?65
?6? ?0?
??? 0??
??1 ?20
?98 ??3
?? ??
99? ?0?
?7? ?3?
52? ??6
?? ?9
0? ?9
9? 0?
6?? 76?
3?3 ???
869 ?3?
?3? ?7?
?4? ?9?
9? 99
?0? ?6?
9? ?9
078 ??1
?5 ??
4?? ?7?
138 ??3
?59 1?1
9?2 977
93 ?8
?5? ?9?
?9? ?5?
?9 ?0
?72 0??
?0 99
?05 074
??9 6?1
?5 9?
10 ?5
?93 9?8
2?? 1?2
?12 ?39
4?7 ??4
0? 9?
8?7 ??0
?9 ??
??4 ?70
?8? ?3?
?75 ?3?
?? 99
stdout
copy 
Case #1: 19 20
Case #2: 023 023
Case #3: 0 0
Case #4: 05 00
Case #5: 00 00
Case #6: 909 990
Case #7: 99 95
Case #8: 099 909
Case #9: 09 09
Case #10: 99 09
Case #11: 291 600
Case #12: 88 93
Case #13: 026 026
Case #14: 527 525
Case #15: 99 99
Case #16: 240 237
Case #17: 034 038
Case #18: 070 037
Case #19: 063 063
Case #20: 00 00
Case #21: 05 09
Case #22: 795 900
Case #23: 199 199
Case #24: 029 080
Case #25: 569 569
Case #26: 019 070
Case #27: 908 499
Case #28: 988 993
Case #29: 184 184
Case #30: 090 090
Case #31: 5 5
Case #32: 05 05
Case #33: 040 009
Case #34: 709 709
Case #35: 992 998
Case #36: 900 189
Case #37: 660 629
Case #38: 061 004
Case #39: 476 480
Case #40: 397 760
Case #41: 5 5
Case #42: 049 080
Case #43: 029 541
Case #44: 000 000
Case #45: 019 060
Case #46: 002 001
Case #47: 060 019
Case #48: 9 9
Case #49: 90 90
Case #50: 029 046
Case #51: 401 099
Case #52: 200 200
Case #53: 109 160
Case #54: 99 99
Case #55: 90 90
Case #56: 600 159
Case #57: 800 699
Case #58: 099 090
Case #59: 049 060
Case #60: 299 407
Case #61: 00 00
Case #62: 439 429
Case #63: 00 09
Case #64: 050 009
Case #65: 00 00
Case #66: 699 700
Case #67: 501 501
Case #68: 482 482
Case #69: 99 99
Case #70: 970 440
Case #71: 023 023
Case #72: 021 027
Case #73: 95 99
Case #74: 90 90
Case #75: 568 399
Case #76: 99 99
Case #77: 039 090
Case #78: 123 123
Case #79: 0 0
Case #80: 600 600
Case #81: 407 401
Case #82: 090 099
Case #83: 400 400
Case #84: 00 00
Case #85: 090 049
Case #86: 060 029
Case #87: 109 105
Case #88: 0 0
Case #89: 080 069
Case #90: 900 909
Case #91: 029 060
Case #92: 09 99
Case #93: 339 389
Case #94: 99 90
Case #95: 00 05
Case #96: 070 019
Case #97: 621 670
Case #98: 090 039
Case #99: 99 90
Case #100: 085 086
Case #101: 006 006
Case #102: 05 05
Case #103: 9 9
Case #104: 306 303
Case #105: 093 098
Case #106: 060 048
Case #107: 343 950
Case #108: 706 706
Case #109: 379 607
Case #110: 805 805
Case #111: 189 305
Case #112: 570 570
Case #113: 001 001
Case #114: 316 316
Case #115: 019 050
Case #116: 092 098
Case #117: 902 902
Case #118: 00 00
Case #119: 696 696
Case #120: 029 070
Case #121: 080 029
Case #122: 05 05
Case #123: 047 041
Case #124: 080 049
Case #125: 998 992
Case #126: 09 05
Case #127: 009 050
Case #128: 067 067
Case #129: 448 099
Case #130: 754 754
Case #131: 507 500
Case #132: 009 040
Case #133: 198 198
Case #134: 050 019
Case #135: 90 90
Case #136: 730 727
Case #137: 092 093
Case #138: 039 080
Case #139: 099 910
Case #140: 537 537
Case #141: 830 144
Case #142: 609 670
Case #143: 037 037
Case #144: 070 029
Case #145: 990 919
Case #146: 909 900
Case #147: 970 970
Case #148: 000 009
Case #149: 038 038
Case #150: 95 95
Case #151: 05 10
Case #152: 000 000
Case #153: 318 310
Case #154: 019 065
Case #155: 060 009
Case #156: 000 000
Case #157: 021 020
Case #158: 098 093
Case #159: 00 00
Case #160: 990 909
Case #161: 070 039
Case #162: 526 526
Case #163: 09 09
Case #164: 09 09
Case #165: 90 09
Case #166: 699 760
Case #167: 303 303
Case #168: 869 839
Case #169: 039 070
Case #170: 049 090
Case #171: 99 99
Case #172: 009 060
Case #173: 99 99
Case #174: 078 071
Case #175: 05 05
Case #176: 470 470
Case #177: 138 133
Case #178: 159 151
Case #179: 982 977
Case #180: 93 88
Case #181: 059 090
Case #182: 090 059
Case #183: 09 00
Case #184: 072 072
Case #185: 90 99
Case #186: 005 074
Case #187: 609 601
Case #188: 95 95
Case #189: 10 05
Case #190: 993 988
Case #191: 200 192
Case #192: 012 039
Case #193: 407 404
Case #194: 09 90
Case #195: 807 800
Case #196: 09 09
Case #197: 074 070
Case #198: 080 039
Case #199: 075 039
Case #200: 99 99
https://ideone.com/AWStiV
language:
C++ (gcc 8.3)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!