Re: [閒聊] 程式設計師也想談戀愛消失

看板C_Chat作者cooper6334時間9年前 (2014/12/04 23:17)推噓14(14推 0噓 4→)

留言18則, 13人參與討論串2/2 (看更多)

ORZ 有人說要上傳Youtube，但是我因為BGM的關係整個被消音了QQ http://www.twitch.tv/cooper6334 實況教學寫JAVA，從頭開始，從零教起預計23:30開始，寫完3題收歡迎發問第一題: import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String line = br.readLine(); int count; int sum = 0; count = Integer.parseInt(line); for (int i = 0; i < count; i++) { line = br.readLine(); int number = Integer.parseInt(line); sum = sum + number; } System.out.println(sum); } } 第二題: import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String line = br.readLine(); int count; int sum = 0; count = Integer.parseInt(line); for (int i = 0; i < count; i++) { line = br.readLine(); StringTokenizer tokenizer = new StringTokenizer(line, " "); int t = Integer.parseInt(tokenizer.nextToken()); int s = Integer.parseInt(tokenizer.nextToken()); int p = Integer.parseInt(tokenizer.nextToken()); if (t > s) { int price = (t - s) * p; sum = sum + price; } } System.out.println(sum); } } 第三題: import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String line = br.readLine(); StringTokenizer tokenizer = new StringTokenizer(line, " "); int t = Integer.parseInt(tokenizer.nextToken()); int n = Integer.parseInt(tokenizer.nextToken()); int max = 0; int sum = 0; int matrix[] = new int[t]; for (int i = 0; i < n; i++) { line = br.readLine(); int num = Integer.parseInt(line); if (i < t) { max += num; sum += num; matrix[i] = num; } else { int pre = matrix[i % t]; matrix[i % t] = num; sum = sum - pre + num; if (sum > max) { max = sum; } } } System.out.println(max); } } ※ 引述《aterui (阿照井)》之銘言： : https://paiza.jp/poh/enkoi : 就一個資訊人力仲介網站的宣傳漫畫 : 主角是一個新入社員 : 第一天上班在路上撞到咬吐司的美少女 : 結果居然就是他的同事 : 雖然看起來已經是上個世紀的老梗 : 但這個漫畫有一個與眾不同的地方 : 「要寫程式才能繼續往下看」 : 依程式的結果劇情還會不一樣 : 有興趣可以試試看 -- ※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 36.231.110.135 ※ 文章網址: http://www.ptt.cc/bbs/C_Chat/M.1417706275.A.CF9.html

推

f222051618

12/04 23:20, , 1^F

12/04 23:20, 1^F

→

f222051618

12/04 23:20, , 2^F

12/04 23:20, 2^F

推

kira925

12/04 23:23, , 3^F

12/04 23:23, 3^F