devbox
小丑西瓜9
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

蓝桥杯 第九届蓝桥杯Java语言C组_xjjo

作者：小丑西瓜9 | 2024-02-10 01:19:45

赞

踩

xjjo

题目标签

12345
哪天返回猴子分香蕉字母阵列第几个幸运数书号验证
678910
打印大X缩位求和等腰三角形小朋友崇拜圈耐摔指数

1.哪天返回

11

  1. package 哪天返回;
  2.  
  3. public class Main {
  4. 	public static void main(String[] args) {
  5. 		int money = 1;
  6. 		int sum = 0;
  7. 		for (int i = 1;  ; i++,money+=2) {
  8. 			sum+=money;
  9. 			System.err.println("第"+i+"天 ："+sum);
  10. 			if (sum >= 108) {
  11. 				break;
  12. 			}
  13. 		}
  14. 	}
  15. 	}

2.猴子分香蕉

  1. package 猴子分香蕉;
  2. public class Main {
  3. 	public static void main(String[] args) {
  4. 		for (int i = 17; i < 1000000; i++) {
  5. 			int num = i;
  6. 			if (num % 5 == 1) {
  7. 				num=num-1;
  8. 				num -= (num/5);
  9. 				if (num%5==2) {
  10. 					num -= 2;
  11. 					num -= (num/5);
  12. 					if (num%5==3) {
  13. 						num-=3;
  14. 						num -=(num/5);
  15. 						if (num%5==4) {
  16. 							num-=4;
  17. 							num-=(num/5);
  18. 							if (num%5==0) {
  19. 								System.out.println(i);
  20. 								return;
  21. 							}
  22. 						}
  23. 					}
  24. 				}
  25. 			}
  26. 		}
  27. 	}
  28. 	}

3.字母阵列

  1. FOAIQNALWIKEGNICJWAOSXDHTHZPOLGYELORAUHOHCZIERPTOOJUITQJCFNIYYQHSBEABBQZPNGYQTCLSKZFCYWDGOAIADKLSNGJ
  2. GSOZTQKCCSDWGUWAUOZKNILGVNLMCLXQVBJENIHIVLRPVVXXFTHQUXUAVZZOFFJHYLMGTLANQIAOQQILCDCJERJASNCTLYGRMHGF
  3. TSDFYTLVIBHKLJVVJUDMKGJZGNNSTPVLCKTOFMUEUFSVQIAUVHNVFTGBDDARPKYNNCUOYUAZXQJNOEEYKLFRMOEMHUKJTPETHLES
  4. FKVINSLWEVGAGMKVFVIUBMYOIAFHLVNKNTYKTZWVXQWRWIGPENFXYDTKRVPKRTHMGHVYOCLDCKMEKRLGEKBYUCLOLYPAKPFSOREH
  5. KWPUOLOVMOFBIXYACWRDYBINTMPASPCEOKHXQIGBQQMCEOIVULIEOPFSCSIHENAJCVDPJDOIWIIULFDNOZOFVAMCABVGKAKCOZMG
  6. XWMYRTAFGFOCNHLBGNGOXPJSTWLZUNNAGIRETGXFWAQSSJPFTQAXMTQWMZWYVEPQERKSWTSCHSQOOBGXAQTBCHOEGBDVKGWJIFTG
  7. ZWWJEIISPLMXIMGHOOGDRZFTGNDDWDWMNUFWJYJGULPHNUFSAQNNIUVAAFZIAZKFXXNWCEABGJAUMGYEIEFVQXVHHHEDYUITRCQB
  8. XZHDPZQTOBECJVBZLACVXACZEDYOGVAVQRNWEOWGRAQYUEUESTEDQTYJUTEFOOITSHDDZHONJGBRCWNEQLZUTBNQIADKNFIOMWZR
  9. EBFKCVNLURZSNPOLTISRPDTNUMCDGKTYRGIOVEPTUTSBAWQKWWEUWIWHAANUZUADGZEATZOQICWFUJTWNZDBKLQNELWVTBNDLNFH
  10. PESISEATZNCDFRMXBQUKBFTIGYSFCWVHPMSUSDKPSCOMVLDOHYQVFHAJKRDTAVLIMNZBZSMLMRTLRPSLAHXDBASDMWAAYBPYVJZF
  11. SCCWYHLQOUKBMCEYENQNJXFOMOOJMTKDSHJJOHDKEGATFZHGWJJAZJROWHAZUFGEQKPYXLCAAXHHQBDALPYUDWZQHBASBBCFGQCQ
  12. ZKNXUBRYZVSPQHOVLAEUAUITMPWXNXJQVIBJVBCSVXKWFAFRPRWOLYVSDVTGGOFFMNQJZOBUDJLFHJTCYMPNOBHQJHGKLIKLZMLA
  13. POCKVEQXUAVHERIAQLGJHYOOVOMTXQFRTBFSETOZICPCHZHFBWNESVJJLSVSVOOGYYABFESWNWDNYBGBNAKRCFQMTCUMIFTESVIN
  14. JCAULIQRYUMAMAOVVWSEUTMECXSDTONRMMROQUISYEURSAYNZUVOPXLIFBDOHPXMABBLEQZGLJXQJOEYYRRRCFTEZQAOIWKRJQDL
  15. ZNUUDWZXZZURPMHGXQGNQBIQWWNERZWULSAPIBODBFFQQIHEQKCKLJYQNXQUTAAYGRBXSLLQNOQPZJEWHETQHPXJANMJFOHINWOW
  16. KJGAWWFSVIZHFNUWBLWYVPIWAEICCAHOEIWRADSLOZGPSVGPUBUUQAVYCHOIGINKYKJABWAQCZCXOBKTNJZQRHLUFKQLACAAOIWJ
  17. SIKWLXQHKDFJVGBVXWDWJKUSFRQRTDJYQMNFOQQALHRLMHSDMCFLAOVKDMTKMTPVTLAZLYJNJXZCFRHHSDIXYUUSVIMIICLUJHFW
  18. JHWUSMCFYHPIXHAPBBSHYDQCKVGQFTENLVERFVOVDCLSTQFUSEPUMTFODLZLYQXDOXAEPONIQWTDWSAWBNSZYACGSJQSHAUMIKXT
  19. MVBNFXMFNPAYSODPXEAYNRKTEZJWMUACSIUYPIORUFPMXAOZZJPJXPFLNSKNIAMETMOVULZPQIJJIRCSYQXOEVRHCNACSBRHKYNW
  20. KGKBTBHGWKVJYZCOVNSKUREKZEIWVLOHAMUAYKLUGHEUESICBZAHURNTJAECTHRNKSIJQFIPVZANSZYSPJWHPKHCAPEYWNXUYQSD
  21. RRRFYQFIQSWYRQTSNGNUFOBMSLGAFWPJGYEHGASFKTJCCZPXFIQLSXNKNWCYVTETOAPCOZJNHEWOCCAWVDEZUQCLLAVUQJJTQCKJ
  22. NMBKMUENVGXXVMQCLXPJDQIQCFWYADIFDSGINGZDJYHPUPXVRMWDIPJRWPNRYOFGYYPEAVKDEMLYRRRMNCRQXPTDSQIVKKGJWDEF
  23. SBAEKIFZCKDOMIQKBDWVQGBYWPDIBOLQUGAQRXLJDAZMXVZXYSNWEWTNZKYREMBEUHOTFOCKEJSXCMUBCKXNGQXTQJRCRCLWJTOI
  24. YXBFBIBRAAFNPKBLTSMCFERZURZNWHMOEHIHNQTBWXNPJGIDYDPRGEWACCBULJRACOFLANQIAOIHMYCNQHVKXSIGAMWAHUSNBBTD
  25. QDGPTRONXHAZWOUPNBFJFEWAMFZUQZFDKAPNJUBQPWBPYGPZHKUDZZDLCCWHGAUKJCSLLFWGPYJKJQBNLCZESOGXXSQCVVKVRVAW
  26. NXPGQOUEFLUZHHSAODIWEPZLXVQLYGVOOVCCREDJZJOMCSCFFKEIEAVCTPUZOWNOLJHGBJHJFBFFORGXOXXFOCAGBWEFCIDEKDLB
  27. PTXSUINQAJURNFQPMMSPLZTQAHCIOFJUEFFZGIHTSJNIEXQLLHRQUXXLLORJEHGQJOXSLIAVFPEJNGMMVAXDDMPXLOSTRLLFLYRM
  28. JQNCLENGTROIKDWBMXRNJYPGZRQOREPJJPTXKVVKPYYZENEOIQKZOPXAYGFXORXRIDGATHMZFDJIOIOKVDJBHSXQMYCBYFGXWHLH
  29. CITGTILGPGBHZMNWWHXEFPGDPJUVFBJKAQWACZHPRPJYCOLGZTBDCVHNRSUAJUQAWAPMQJDQIFPZQZEONWHIYKMXDZOMVETEFJRB
  30. RDOTIDCFEESOKYPYCGQQKOGPMGJRITSVTKOKDSXLRLJRRHNFRFXCMDNQMCEGZFJWHZOAFBQXXPXNBSWTSUYPAWQRHAUGLNPBRSJT
  31. HOWRIUGMOQTUYIHDWJRFBWWKWYKCICSVBVKTBIIWGFSVIFCTUKIHHUUISCOTEOYRWQXTAEBXQQOLLMOALNIYVCCHNSWIKHMYYNZO
  32. OFRIYYXPPSRTPAYMUJSSDILKIZAYSEIOLANQIAOVKARDPGVFCSYBSNHAPGTIKLAWTTKOEADWRLAACAAFYTBTNSGFTYLYUHJXBMMA
  33. NJFTMLUIBKDPWBXQOMBVQXCZOIREHRSZCSJOIVBXWQIBUTYBQNTZRVROHGOIZYAJWXLEATLOZJIKJMIHSLGSVTCXJWIOOGWSERRQ
  34. DBQJNGBLRIYFIKHBEYOZQBOAGGNIZKFDHWXCFNJLBQXVLHIQNIBZSDLTTRERHNWCMLJCVBBGGAQTPUQHIRABXPQSYGSDVMBNNDFG
  35. KPLFUYXHYGOCZPPXMWCZYNKCYBCRZVKFBHQXPGPBZFTTGEPQTJMOFHAYSQQZDMQECGXOXADYHNNXUKNBXZBYHBOULXNBJZKIZREF
  36. LVHAMSNXJOCVRPVGJUWXFVOCUCLCZDXRPBBDRLRAVVNLOZWOHWMXYSNMXAKJYWYGILNGUJGIPKAUDVANZLFWKUWWUSQYBRCBVDIJ
  37. QCXPLOTPPGXCUZOUSSTXHVMLHVMJTUSSOPLRKEBQSGWNGVHKANVZWYQHSHLIPWSYCPKTUKPMWPLVFLLAHXZQANFXHFNYHIQVIOYN
  38. ZPTJJCBHXPSUPOMNRVCKXSUFCNRCRNCPTPGIDQOEQUDFNUNMJPOEKVIMUJAJZOUKMAFSLDWYMCHTSNJYUDJAHQOIXPYSRHVAFFCR
  39. DCGMEEWXWMNOSSJNIZCINRHENPPPCYVFWYCONOPKXMFZXXIHNXIGAHAMHSBRESOETGVXWDNQLGCEOUDDJXHQIVCHRNKBFFEWILGY
  40. SOAIQNALXRBSGAQIDQVMVDKVZCPMJNXKXRXPFZAUVQPBHHQKTPDSQROLQTUGMFQRWGVEWCYPDYDZGNNNUFKJUEHJKPLIQNRQYXHU
  41. GKGWUCJXUKAEHLRLNDFUQPSJAZTVJRXWXQVBMRJXULEMJJPDCVTOWVFDBVLSBHZRRQUVMUQYKTJCLSGGHGCPHPHMWYAECLJIZUWV
  42. QQNKPQRJMSOCEAYDNKPHVEGKAGCKAPDXTGVXULHUXHJPDXCSKQTCJENVTZTMRUENCSWHBEORALSREBWAJEMQDXMRKGHJGICDHKHY
  43. YNSDSWDRLBBFUFVVICMGUCGBSVDLJNXGKXNFGVLKAVBJRRRUHKRXTPBJAKIEBAVMDIOJLIUDABCGNPNJIYBCXMOOWKRPHPYSWRDC
  44. BORWTNBISSLTVKBRTLWKRNCEDCNEGCIYJIPDICFAVNOISYAHWBLGMNFKXZYTTWJOBEPNMSJEJMHXVPGOJOLQQQVXFGEULANQIAOD
  45. OQETOJHCZXGTUKIWGMEVVMXCURISUOFQSAWZWDMZWVYHZMPEIMWKJDGERODVVUXYRTYLCRGYQQOIOFZSSZRAIESWBQOAIQNALJNR
  46. HEYWHPLLPCUEOCBAOWGAYEJZQJHLVNMVQNSQQGGUBOIMDPFLOVSQGBLYAMBRYJDVOXOQINLJAVYALAKHPKOYNKGXIISSJNGKHYMS
  47. IQVRYKXCUFIRNENEXFJTMOTJWYXSMTDHHPRHWIXETWVVIXZELKLLWRWQYGBCGJNYSUQEFCOUDNIJMLJNLAWSYJGULKBCFPYVSSMW
  48. WQHGWRQFWFOTGPBBSJBDUKOMBXNRPIMCGPGVZFADWTBVIEMVTBXVAFQDDMJALCOMZTXUFFKBQQZDFAMTFWEXTHBKNWRLUVITQXLN
  49. OPPJQKNGHWWPENVQIABJCQNKXNPWOWRFEOKQPQLANQIAORGGOLAYCEGZBHZVLPBERWYIJNJUNXKULUQOJLTNRDZDEYWEMYCHJLLB
  50. LJISOAQLXJEFXVTOZSICOLQIJEXUANJWIFSIMGUQWHBXUDWOEILYFUZTGDZDSPLZPDPXBLFAXLEFQFEPDSJQWEQMXKKHCXHMSATM
  51. UMUJENPBYKZLWAJAXJKDIYCBREBPOETQHMRHLKSEZUIPRGWIZDDQLSJAPKPBWMJMPZWLNFLFCQOCDBMLIHIYCXUJLFLPZVGWBKMY
  52. WHZJLKEWUPETVUREKVKCLBNYFLWCERVIPUDINNWGQTUHWXCTDVTMYATYUZLMVLOHKBOGIZCQDOWFBCWJAVUXYUEVRKPOXCKHAWZC
  53. RPLNLCUHJRADHJNSDPZXIKXGUKEJZCFJQASVUBSNLXCJXVCJZXGMRYRLOBCNGPDUJQVEFKMYHNZGZOAIQNALQDHTBWJXPKJLFXJY
  54. MKCEZEDAFGSOCORWJGMOKWPVVBVDYZDZHPXFWJBDELHPGOQHMBAHUUUJMGXAEKZCTQTBXNVYUIQUVZGXSKQXJWRUPSFIJDYIAORC
  55. GKFKQNXPJWOPPBTUKTHUBIROSYOVFEMJBRREWICJPCIOSTWPAUSKTRQULXPWRSXHSRYBCWYCYOTCTPFSQLDIILIGMEVZKYSOYRPH
  56. SFDSCSMLLNARCCGCBJOGZAEQTGNGSFAQIXLPDBSWZDTYVASYYPVBRFBTIAGGWONGSVKCJDBBLYKAIOXUATGMALZXFOHZFTXALCFU
  57. CUSSTLCRYPDTFSFJFENKJWTEBOBEPLSNXLALQWCKSLVMZQDJITHZKVCCQXTEXOSVAUFYAZXJUOAPPVEEWOIIMOSZZMCOQBRUXWKG
  58. PDOFSCKKJJTRYRWGLEZODQTJSIMXIAOLNMLPHBAYLPTTLPYWILSEIIQVSXNHIJEORVCNJHYXRBIZZJTADGMRTSXVRXYGVQQNUEIC
  59. IHNJOQXUXTXFPALCHOELNVMWDWQTEARUKPIFWXJSMWZLMNLAODUTKNZDYRFRLGBLIBGIBXJBOYMLYLANQIAORORYKSJPOOOAMVRN
  60. IWIUHLYJKTQGVJBDPROSRGZUFITDIBCDPICNEFIGHWGSROWBYKUCLCQYLJXLHLXSCTJWKDLHHMLDBZCVDKPXYYASHUUMUJMVSXAD
  61. GXOYXQFEBFIEJJLHBNGSYALOUXNQBXXZAAZJXENJJVVGFVHOTKSLEGLJVSJCQHSSZFEIOGBOGWSPIRENQAAWRQFBEFEXBKGMSTRC
  62. PYIANSGMNKBCDPHWDUPKICQEUDNZPNGRUJYSZIRLXGXXITAFBCANGDLVAQLDPVTJNSAUZMBBNOBBOERSHQIOLBVTSPPJKVCMXUBS
  63. IKMDIYSNCJZKJKJQMTIKEPRUNAHJUSWJHSLWIVWHYAYLOIOGSZVWKQWXZDBPHWZRAIPMXDJHBIISVJWVEVZAEGAKCYYMNZARBZPC
  64. DLDFVQDFDMVHYVOWEKMFKWUXLTPWIVKPRZZXOLMDAPAIQEKJHCHYAGJDBOFWDGNEGQGOOKWSKLTLREMGGTVJFHAIBCQKNZVRCZYS
  65. FBQASGNCCBBGNKJHCDBTGBIIWKMPHDABKEWDEPYEAVKNMPATUZZUOEHGUGAZNECSGUCIIJPMMRAMTVADMTCRJCBWDLWWFNFOWMVZ
  66. XFJFBGDAVGGAIZHAUIYENDZTRUWHPQUFWCHOXNCWYNAWVPLBLNQKQDTKQQKXNFXCTBGRWUZFHNRBDNLNKQVOLLGBBJQIYOBCEIKO
  67. CURAGWXMLYBSIZLAXFONZZMQMRNNSRQKRHQGFGZUTLONAYRKSSOWAMKZBSGOOYQDPTBHGPBNQEDCZHRTOXREOFJEKJVIZXZBCJPN
  68. KGYBZTZRKOGBETJRUWRNUCIFKIMCZGYTZLCZYGCGKVZRJIFZQIQPTCPPUHYWIXBOFFGSGSAIMNGKKUUROAVNJUQQNSWJRZIZEHAF
  69. DDAOBVCPOVODVJFLSNPJXHWQBHILWZAHQQMTQASNADZLZNXJLJMFCOUWOZJCMVVTYCKTUBABWLCEBNYWAMOLNBQQYBRUJCQCZALE
  70. TVVRPMYFIKINHIUEJBDLTCUMMUWICIUVCZNIQIUEWVAHLANQIAONMEYJWPDAFXVNOSOFDOCESSLGZPTJINBUAFWWWMPTYALZIGVD
  71. DCZGKILMBFXIQQFEKJBIUDEMIFCANVGNYZAYSQFMNNQFEPZFUUVGTBKSMDXITBLANQIAOQUKTPNYPOWSQQYWWMJHSDYVFDJYXBAF
  72. VGYXAMDRRZWVIHNQPZZWRNWBTROOJOLNUGXBILZKQEGIQSYGKZGODPWBJSCMRRWSSQURUFIAFQGEZLGZNOEQMNQEYUKPEQPPVAMO
  73. SYSFUAJFKIPUJVQSZRWQCJYAUMLDDNOKODDXIEQIFLANQIAOZFUNKUBVDBLMJOAUTVCZVLKJRQIORQPGAVCEYVNYUZHXILHERYEC
  74. GJEKWEKIJNIWUXZNVIWIAANHIOSOLATSQFSSCTAKESUTSPPYFHEHLVLIBJZEEBCOWMNHFTZMAPKFUPNFLTFFJQRVJHAKDVMGGUIX
  75. KAKXXNKSOAIQNALLWKWGVACYWBQEVTFSEUCYRORQTHWFUJFLQHONWZEKPLSNPRPBOMOFFCPMKXFZBKIERBKDYFKYUEYVYRPMOAQI
  76. WNICDLQKZXGTKDLIEFBGELGJOAIQNALXZLGGDQIBVEULDPBWUJNTYOKFBPGMAWRRUJPPIGYCNYURNOSQRIRBAZAGWWDUHAAZQWPT
  77. KFXZQXRMKSBUXWOUVVHSJWTLKZELGXMMAIDSJIWGCJPCBWZIEKMNUPUAFHTUMOZKJWVTIAQNOHELEMWGKJHKPNJVSRVHAUFXBUOU
  78. XOWCZJYQLXJRUOOYSKDLDXKWTTJBYBTLKSWRUYPOYTPBGUJXBMRWNELBWADCSZDAEEFGPVRHNNLBFDDXNPDXLKQUSJAZDEUDBMBD
  79. QIKYEKMVUHGGWZDKXFVQQNECZOAWCFUBHQMEPEPKEFSDBAYJQOSGAIHRBRAUKLQRANKMTTIOJDDXAEWTQHIYSGRRMEFTNNWCLZSI
  80. ZFUQAQCSFNVUQMKUQWBWFQIEQVVXPOSVIDTUOBLLTGHQKEMSUWWHWRISLGRDPPQPZBANSGDWXKNYTKMWECPMPDYSCJZXPUKPWGYI
  81. CNGVLBSCBHRLJARWSRENGHYYQDKRATERCPEAOPAJZUMOYIDHVPDMQPKKHCBAMRBGEIEXXJALMCXKPUGXYVINRORFYURXAMOJCBZQ
  82. YJHHAWESCLMDIHVYMLAJZQSYTDEURWYPOLJCAKIKSATGVIALBLWPPKDEGSPMRLDBQNVPPCLQXKUQLQJERMYFGAETUATEBQZUMGUN
  83. NBWUBVXYDFPLPJYLIDFVTVKKGFWMXVINLJUDUPABTSBJAJENZSXIMUJQWPEZTAVDMBBHFYTJKYFXIXQTBTTQIKQXQDPWYNMXRQDJ
  84. OGWLZQUBJJHAQNPVRGHGPNMMJPIDGANYEEDWYPOLKLNEPYSRTQYCJLSWFRJRRGGSNSDHIXYYSNAKKBWQDDGYYMOGPUXQEUSAPSOU
  85. CLLSELRVFZUFYVTJQKCQHNICMERWQFQNPVRPIIYKHZWJYJAFCLNSZXUHSPOZWQUMJHLKKYJENVZOCSWCTPYWIZONUUCLSUROGAYS
  86. AZGNIMXPLPCEPULRRBHHQOBELHJZPUQAMWUASVKDXVEWAOFMAYSJFXHCNEUXUQWUESFBRUFZQLKKWHCHKOPLECCBYSLECAEZIMMI
  87. TUUEOCEBAUKWLTSYJJPLZTIARAOZXKYYWIOXBBTZZCSAULKNEJWVQXIKUWBIWVHGNTHVBAWAVPGLHSDJDLPVHHHUNVSFKXARXLVQ
  88. EMVDFSLANQIAOPTLFLFRKGNUZCTXWCAXHECTZFHWUFENRGQICHTYLSHZWIEGLNVDJZOMTKAAUWOHVOVOCTUKOSINSAYIAEUYORNA
  89. VGPRMLCAQZIPRFQOZMEFTQZYVOTVFNVOIQSJCIPPQXQKJIXICUIGMHAJJMSXENCBQFIJHNZXIQMWACKDKQSEWWKMLOAUPFHAZGRY
  90. SQWQMRSQBGGKYKGWEZYRIHWGNXRPOUMFSFGTYDLUDWPWAVQORTMQUXWKUQVNMDPWQFIZPOIHCJATODRQGZDMQXZVNXXVEJNGWZOM
  91. PVBGZSQPCELDIWDHOQWAUHILGLPYRIICTLFSOYKQZYZOCIZPTECSWOODGGBDTSGIMYGMVPJPRPEVWOOKYFWRGXHWUCRQNYJEMSYL
  92. XWOFXFVDXPTHYTCEGMODCILAHYBREZVVHOUPZKCNHUEVPMKHUBNRPFMWXVQACVZCALZLYMZSBLCEASPMIEFOTGKMPGWYQADSNDPR
  93. QPHAVLZDZLKIEISFLLVWXAVBZLZIJRHGROUVGXRDLUJAXNHBBZYNCVERJGSKLWZEKGJBCWMSMLYIHZFFMIOGVIMZQBSRHQWAADYN
  94. MNXEGTDXCDKIUDOISQXEUJWETPELKBCYFSDNJQWNNBPYMWBUPQBAAINMYZOYCEGNLFNNHZFEMSQVXJJGWBCRAVKZFWFBKMBRVBFD
  95. HKACSZIUWUXLWKFPKOCUQJEPQDZCMUJFLVCLIOQQRVKSWFIAKNHMRLNJTKGVNTGLCVPVMBLJANOBCXUGVWBJYSIXZQVAVFWILWFB
  96. QWNLTPMCYHRSKVHXLONRANWKWXUTHYQLIOFKGDBMSWDRCYRKVSAGGRJMWQYQFLMUIGGCLAUQAACTYLPZEOJBHMWRKHCRXGTGRMUP
  97. CPQKJRBLYDNPUGHCRBVYBAIRVCAWLBWVWCMKNBIRKJOUGYQEBQRHDSTWXDIWGRVMLIJFBWHLHCDAAVUDLZSCGQNOUXVUIVIZZZMD
  98. NMHGYPFUUDWKQGTAKKGCDFJFYJFNRZVXDPGZEAMWQVQZODKTXHIYFVKJSSAWVHYCUCZMLLBPXTILDYJQEMWDRUFKISOUVPUDTYPB
  99. FDAQUBXHUJYTAYNWVIJNUSQDTQDEMUAPWXRYUWONTBDZCHZOUEGPMWEZTQWWSHAYOBWVTDIMZYNVNZKUHOFCQKPHJXWNRCGUJEKO
  100. WSDAUGUTVWCVHEMOIRJJGTANUWTSAIXXEVZTBDHPGSRHHVWCDZVZYRJTLONIJVXEATHQXOUKBIGZONFRSZIOGWNTYAJYLQCGEOWY

41

  1. package 字母阵列;
  2.  
  3. import java.util.Scanner;
  4.  
  5. public class Main {
  6. 	static int count = 0;
  7. public static void main(String[] args) {
  8. 	Scanner sr  = new Scanner(System.in);
  9. 	//创建地图
  10. 	char[][] map = new char[100][100];
  11. 	for (int i = 0; i < map.length; i++) {
  12. 		String s = sr.next();
  13. 		map[i] = s.toCharArray();
  14. 	}
  15. 	//寻找L起点
  16. 	for (int i = 0; i < map.length; i++) {
  17. 		for (int j = 0; j < map[0].length; j++) {
  18. 			dfs(i, j, map);//以此位置为起点
  19. 		}
  20. 	}
  21. 	System.out.println(count);
  22. }
  23.  
  24. private static void dfs(int i, int j, char[][] map) {
  25. 	//LANQIAO
  26. 	String Model = "LANQIAO";
  27. 	//方向移动数组
  28. 	int[] dx = {1,-1,0,0,-1,-1,1,1};
  29. 	int[] dy = {0,0,-1,1,-1,1,-1,1};
  30. 	for (int k = 0; k < 8; k++) {
  31. 		int nx = i;//起点位置
  32. 		int ny = j;
  33. 		int step = 0;//字符匹配计数器
  34. 		//按此方向循环蓝桥长度
  35. 		for (int p = 0; p < Model.length(); p++) {
  36. 			nx += dx[k];
  37. 			ny += dy[k];
  38. 			if (nx >= 0 && ny >= 0 && nx < map.length && ny < map[0].length && map[nx][ny] == Model.charAt(p)) {
  39. 				step++;
  40. 				continue;
  41. 			}else {
  42. 				break;
  43. 			}
  44. 		}//此方向完美匹配长度,count++;
  45. 		if (step == Model.length()) count++;
  46. 	}
  47. 	
  48. 	return;
  49. }
  50. }

4.第几个幸运数

1905

  1. package 第几个幸运数;
  2.  
  3. public class Main {
  4. 	public static void main(String[] args) {
  5. 		// 统计最后的幸运数
  6. 		int count = 0;
  7. 		// 数字太大所以用Long型，数字最后+L表示形式！！因为JAVA默认int类型~
  8. 		Long num = 59084709587505L;
  9. 		for (int i = 0; Math.pow(3, i) < num; i++) {         // 3的i次方<num
  10. 			for (int j = 0; Math.pow(5, j) < num; j++) {     // 5的j次方<num
  11. 				for (int k = 0; Math.pow(7, k) < num; k++) { // 7的k次方<num
  12. 					if (Math.pow(3, i) * Math.pow(5, j) * Math.pow(7, k) <= num) { // 如果三个次方同时相乘<num，继续循环！！
  13. 						count++; // 求得幸运数结果
  14. 					}
  15. 				}
  16. 			}
  17. 		}
  18. 		// 千万注意，因为i，j，k的for初始值为0，0没有意义，所以在原结果-1，求得答案1905！！
  19. 		System.out.println(count - 1);
  20. 	}
  21. }

5.书号验证

  1. package 书号验证;
  2.  
  3. public class Main
  4. {
  5. 	static boolean f(String s){
  6. 		int k=1;
  7. 		int sum = 0;
  8. 		for(int i=0; i<s.length(); i++){
  9. 			char c = s.charAt(i);
  10. 			if(c=='-' || c==' ') continue;
  11. 			sum += (c-'0')*(k%2==0?3:1);  //填空
  12. 			k++;
  13. 			if(k>12) break; 
  14. 		}
  15. 		
  16. 		return s.charAt(s.length()-1)-'0' == (10-sum % 10)%10;
  17. 	}
  18. 	
  19. 	public static void main(String[] args){
  20. 		System.out.println(f("978-7-301-04815-3"));
  21. 		System.out.println(f("978-7-115-38821-6"));
  22. 	}
  23. }

6.打印大X

  1. package 打印大X;
  2.  
  3.  
  4. public class Main
  5. {
  6. 	static void f(int h, int w){
  7. 		System.out.println(String.format("高度=%d, 笔宽=%d",h,w));
  8. 		int a1 = 0;
  9. 		int a2 = h - 1;
  10. 		
  11. 		for(int k=0; k<h; k++){
  12. 			int p = Math.min(a1,a2);
  13. 			int q = Math.max(a1+w,a2+w);
  14. 			
  15. 			for(int i=0; i<p; i++) System.out.print(" ");
  16. 			
  17. 			if(q-p<w*2){
  18. 				for(int i = p ; i < q ;i++)System.out.print("*"); ; //填空
  19. 			}
  20. 			else{
  21. 				for(int i=0; i<w; i++) System.out.print("*");
  22. 				for(int i=0; i<q-p-w*2; i++) System.out.print(" ");
  23. 				for(int i=0; i<w; i++) System.out.print("*");
  24. 			}
  25. 			System.out.println();
  26. 			a1++;
  27. 			a2--;
  28. 		}
  29. 	}
  30. 	
  31. 	public static void main(String[] args){
  32. 		f(15,3);
  33. 		f(8,5);
  34. 	}
  35. }

7.缩位求和

  1. package 缩位求和;
  2.  
  3. import java.util.Scanner;
  4.  
  5. public class Main {
  6. public static void main(String[] args) {
  7. 	Scanner sr  = new Scanner(System.in);
  8. 	String s = sr.next();
  9. 	
  10. 	while (s.length() > 1) {
  11. 		int num = 0;
  12. 		for (int i = 0; i < s.length(); i++) {
  13. 			num += s.charAt(i)-'0';
  14. 		}
  15. 		s = num+"";
  16. 	}
  17. 	System.out.println(s);
  18. }
  19. }

8.等腰三角形

  1. 例如：
  2. 输入：
  3. 5
  4.  
  5. 程序应该输出：
  6. ....1
  7. ...2.1
  8. ..3...2
  9. .4.....1
  10. 567891011
  11.  
  12. 再例如：
  13. 输入：
  14. 10
  15.  
  16. 程序应该输出：
  17. .........1
  18. ........2.2
  19. .......3...2
  20. ......4.....2
  21. .....5.......1
  22. ....6.........2
  23. ...7...........0
  24. ..8.............2
  25. .9...............9
  26. 1011121314151617181
  27.  
  28. 再例如：
  29. 输入：
  30. 15
  31.  
  32. 程序应该输出：
  33.  
  34. ..............1
  35. .............2.3
  36. ............3...2
  37. ...........4.....3
  38. ..........5.......1
  39. .........6.........3
  40. ........7...........0
  41. .......8.............3
  42. ......9...............9
  43. .....1.................2
  44. ....0...................8
  45. ...1.....................2
  46. ..1.......................7
  47. .1.........................2
  48. 21314151617181920212223242526
  49.  
  50.  
  51. 资源约定：
  52. 峰值内存消耗（含虚拟机） < 256M
  53. CPU消耗  < 1000ms
  1. package 数字三角形;
  2.  
  3. import java.util.Scanner;
  4.  
  5. public class Main {
  6. public static void main(String[] args) {
  7. 	Scanner sr = new Scanner(System.in);
  8. 	int n =sr.nextInt();
  9. 	String str = "";
  10. 	for (int i = 1; i <= n*2+3; i++) {
  11. 		str += i;
  12. 	}
  13. 	//计算整个字串长度
  14. 	int len = ( n-1 ) + ( n*2-1 ) + ( n-2 );
  15. 	str = str.substring(0,len);
  16. 	String left = str.substring(0,(n-1));
  17. 	String down = str.substring((n-1) ,(n-1) + (n*2-1));
  18. 	String right = str.substring((n-1) + (n*2-1) , len);
  19. 	right = new StringBuilder(right).reverse().toString();
  20. //	System.out.println(left);
  21. //	System.out.println(down);
  22. //	System.out.println(right);
  23. 	//行
  24. 	for (int j = n-1; j >= 1; j--)
  25. 		System.out.print(".");
  26. 	System.out.println(left.charAt(0));
  27. 	
  28. 	for (int i = 2; i < n; i++) {
  29. 		//输出前置*
  30. 		for (int j = n-i; j >= 1; j--)
  31. 			System.out.print(".");
  32. 		//左
  33. 		System.out.print(left.charAt(i-1));
  34. 		//输出中间*
  35. 		for (int j = 1; j <= i-2; j++)
  36. 			System.out.print("..");
  37. 		System.out.print(".");
  38. 		//右
  39. 		System.out.println(right.charAt(i-2));
  40. 	}
  41. 	System.out.println(down);
  42. }
  43. }

9.小朋友崇拜圈

  1. package 小朋友崇拜圈;
  2.  
  3. import java.util.ArrayList;
  4. import java.util.Scanner;
  5.  
  6. public class Main {
  7. public static void main(String[] args) {
  8. 	Scanner sr = new Scanner(System.in);
  9. 	int n = sr.nextInt();
  10. 	int max = 0;//最大值圈
  11. 	int[] child = new int[n+1];//存储小朋友崇拜的人,序号1开始,所以+1
  12. 	for (int i = 1; i < child.length; i++) {
  13. 		child[i] = sr.nextInt();
  14. 	}
  15. 	//遍历起点
  16. 	for (int i = 1; i < child.length; i++) {
  17. 		//从这个起点开始寻找崇拜圈
  18. 		ArrayList<Integer> list = new ArrayList<Integer>();
  19. 		list.add(i);
  20. 		while (!list.isEmpty()) {
  21. 			//看看刚加进来的小朋友崇拜谁
  22. 			int id = child[list.get(list.size()-1)];
  23. 			//这个人之前被崇拜你的人崇拜过,形成圈
  24. 			if (list.contains(id)) {
  25. 				System.out.print(list+"   ");
  26. 				System.out.println(list.size() - list.indexOf(id));
  27. 				max = Math.max(max, list.size() - list.indexOf(id));
  28. 				break;
  29. 			}//寻找新加进来的整个人崇拜的人
  30. 			list.add(id);
  31. 		}
  32. 	}
  33. 	System.out.println(max );
  34. }
  35. }

10.耐摔指数

  1. package 耐摔次数;
  2.  
  3. public class Main {
  4. 	
  5. 	public static void main(String[] args) {
  6. 	
  7. 		int[][] dp = new int[1000+1][3+1];
  8. 		//手机数量为1时的测试次数了
  9. 		for (int i = 1; i < dp.length; i++) {
  10. 			dp[i][1] = i;
  11. 		}
  12. 		for (int i = 1; i < dp.length; i++) {
  13. 			//由于上面已经设置了手机数量为1时的测试次数了
  14. 			//所以只需从手机数量为2开始进行遍历即可
  15. 			for (int j = 2; j < dp[0].length; j++) {
  16. 				//取一个不影响结果的数
  17. 				int min = Integer.MAX_VALUE;
  18. 				//从第1层到第 i 层,逐一尝试所有决策,取最优的
  19. 				//每一层最坏情况下(max 测试次数最多)的最好结果(min)
  20. 				for (int k = 1; k <= i; k++) {
  21. 					min = Math.min(min, 
  22. 							Math.max(dp[k-1][j-1], dp[i-k][j]));
  23. 				}
  24. 				//需要加上本次测试的次数,因此需要+1
  25. 				dp[i][j]=min+1;
  26. 			}
  27. 		}
  28. 		System.out.println(dp[1000][3]);
  29. 	}
  30. }

 

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/小丑西瓜9/article/detail/73656
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号