ZeroJudge: a042 平面圖形切割 Jul 30, 2016 • Jun 2, 2018 • WillyPillow • en, zh, bilingual, zerojudge, c, competitive-coding • Signature 將遞迴式 a1 = 2, an = an-1 + 2n - 2 展開。 Solve the recursive equation a1 = 2, an = an-1 + 2n - 2.ZeroJudge Link (Zh)#include <stdio.h> main() { int num; while (scanf("%d", &num) != EOF) { printf("%d\n", 2 + num * (num + 1) - 2 * num); } return 0; } Related Posts ZeroJudge: d049 中華民國萬歲！ ZeroJudge: a095 麥哲倫的陰謀 ZeroJudge: a053 Sagit's 計分程式 ZeroJudge: a040 阿姆斯壯數 ZeroJudge: a038 數字翻轉 0 commentsPost a comment Send an email to comment@nerde.pw.