华南理工大学2013年acm选拔赛第二场.pdfVIP

SCUT_ACM 闆嗚闃 鏂扮敓閫夋嫈璧 绗簩鍦 Problem List Problem A Uppercase 2 (榛? Problem B XRT in FSK 3(闈? Problem C Flip4(绱? Problem D The sad match I. 6(鐏? Problem E The sad match II8(绾? Problem F Count the continent10(鐧? Problem G Math problem 12(钃? Problem H Rotate 13(閲? Problem I Zeros15(缁? Problem J It didn鈥檛 hate16(姗? ~ 1 ~ Problem A Uppercase Time Limit 1000ms Description You are given a string S that only contains uppercase latters and lowercase latters, your task is count how many uppercase latters are there. Input Input contains multiple cases. Each case contains a single string S , and the length of S won 鈥檛 exceed 1000. Output For each case, output the number of uppercase latters of S in a single line. Sample Input abcd ABCD abCD Sample Output 0 4 2 ~ 2 ~ Problem B XRT in FSK Time Limit 1000ms Description 鐢变簬瀛︽牎鐨勫疄涔犲畨鎺掞紝XRT 琚畨鎺掑幓浜嗙儫鍙癋SK 褰撹川妫€宸?XRT: 涓轰粈涔堟槸鎴?..)銆傛瘡 娆RT 閮借妫€鏌 涓皬鐞冿紝宸茬煡杩檔 涓皬鐞冮噷闈㈡湁涓€涓槸姣旇緝杞荤殑锛屽叾浣欑殑n-1 涓皬 鐞冮噸閲忛兘鐩稿悓銆俋RT 鏈変竴涓ぉ骞筹紝姣忔浠栧彲浠ユ妸鑻ュ共涓悆鏀惧湪宸﹁竟锛岃嫢骞蹭釜鐞冩斁鍦ㄥ彸杈癸紝 鐒跺悗寰楀埌缁撴灉锛氬乏杈归噸锛屽彸杈归噸鍜屽钩琛°€傜敱浜嶺RT 鐨勬暟瀛﹀緢寮憋紙XRT 锛氭偿鍨簡锛夛紝鎵€ 浠ヤ綘鍙互鍛婅瘔浠? 鏈€灏戞祴閲忓灏戞鑳戒繚璇佹妸姣旇緝杞荤殑灏忕悆鎵惧嚭鏉ュ悧? Input 杈撳叆鍖呭惈澶氱粍鏁版嵁 8 瀵逛簬姣忕粍鏁版嵁锛岃緭鍏ヤ竴涓鏁存暟n 锛 1 鈮 肀 鈮 10 锛 Output 姣忕粍鏍蜂緥杈撳嚭涓€琛? 琛ㄧず娴嬮噺鐨勬渶灏戞鏁? Sample Input 1 10 Sample Output 0 3 ~ 3 ~ Problem C Flip Time Limit 1000ms Description 搴峰摜鍝ュ拰搴峰濡圭粡甯稿湪涓€璧风帺娓告垙銆傚叾涓竴绉嶅氨鏄‖甯佺炕杞€傛父鎴忕殑瑙勫垯濡備笅锛 1. N*M 锛圢 琛岋紝M 鍒楋級鐨勬鐩樹笂锛屾鐩樹笂姣忎釜浣嶇疆閮芥湁涓‖甯侊紝涓嶆槸鏈濅笂灏辨槸鏈濅笅锛 2. 涓や汉杞祦杩涜鎿嶄綔锛屼笉鑳借繘琛屾搷浣滅殑浜鸿緭锛屽綋妫