关于初级acm题目部分解答
没有梦想丶何必远方
成为一名厉害的人
展开
-
阿牛的EOF牛肉串
#include using namespace std; int main() { int n; long long int a[40]; a[1] = 3; a[2] = 8; while (cin >> n) { for (int i = 3; i { a[i] = 2 * (a[i - 2] + a[i - 1]); } cout } return原创 2015-11-18 17:13:34 · 261 阅读 · 0 评论 -
骨牌铺方格
#include using namespace std; int main() { long long int n, a[51] = { 0,1, 2 }; while (cin >> n) { for (int i = 3; i { a[i] = a[i - 1] + a[i - 2]; } cout } return 0; }原创 2015-11-18 17:15:54 · 187 阅读 · 0 评论 -
数根
#include #include #include using namespace std; int zhuanhuan(int arry[], char c[], int n) { int sum = 0, k = 0; int len = strlen(c); for (int i = 0; i { arry[n - len + i] = c[i] - '0'; }原创 2015-11-18 17:16:57 · 320 阅读 · 0 评论 -
回文的判断
#include #include #include using namespace std; int main() { char ch[51]; int n; bool prime = 1; cin >> n; getchar(); for (int i = 0; i { prime = 1; cin.getline(ch, 51); int len = strl原创 2015-11-18 17:14:43 · 285 阅读 · 0 评论