这题有坑

直接python 发现1.30MB不行

dpsk又给了代码 但是1.37MB所以不行

dpsk给了几个关于Linux系统核心的代码 但是编译错误，不行

内存搞错了

刷刷刷！！！错题！！！

汉诺塔的步数公式是2^n-1 是的你没看错，就这么 简单！

小码君想在学校中请一些同学一起做一项问卷调查，为了实验的客观性，他先用计算机生成了 N N 个 1 1 到 1000 1000 之间的随机整数 ( N ≤ 100 ) (N≤100)，对于其中重复的数字，只保留一个，把其余相同的数去掉，不同的数对应着不同的学生的学号。然后再把这些数从小到大排序，按照排好的顺序去找同学做调查。请你协助小码君完成“去重”与“排序”的工作。

十二点到了，小码君要去食堂吃饭，但他的同学们并不是这么想的。 “小码君，帮我带一份咖喱鸡” 现在总共有n个同学需要小码君带饭，不过他们只想吃以下三种午餐：咖喱鸡、黄焖鸡、椰子鸡。 每个同学只会想吃其中的一种午餐，请你帮小码君统计一下，每种午餐要带多少份。

太水了

今天ac狗要参加短跑比赛，所有选手从起点出发前往终点，终点与它们的距离为 n − 1 n−1 个单位长度。比赛虽然叫 "短跑" 比赛，但是并不限制只能用跑的，ac狗比起跑步，更擅长跳跃。 它每 1 1 秒可以跑动 1 1 个单位长度，但是也可以花费时间在原地蓄力。例如，当 ac 狗在 x x 处蓄力了 i i 秒时，它下一次就可以花费 1 1 秒跳到 x + i 2 x+i 2 处，或者也可以选择继续蓄力。 当然，完成比赛是需要用身体接触红线的，因此ac狗不可以跳过终点（也就是越过 n n）。 小码君很聪明，在比赛前就可以计算出ac狗最快多少秒可以到达终点，那么这个值是多少呢？ 8 粉丝数

green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green green

答案：

吴彦祖==张老师

#include<iostream> using namespace std; int main() { int a,num=0,m,b; cin>>a; cin>>b; for(int i=1;i<=b;i++) { cin>>m; if(m<=a) a-=m; else num++; } cout<<num; }

#include <bits/stdc++.h> using namespace std; int main(){ int a,b,c; cin>>a>>b; printf("%.2f",sqrt(aa+bb)); return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ int a,b; cin >> a >> b; cout << (a + b); return 0; }

虫子：这差事不错 苹果：你不要过过来来啊啊！！

题目详情 T42277.数位分离 入门 加入题单 通过率：64.29% 时间限制：1.00s 内存限制：128MB 题目描述 输入一个整数 n n，逆序输出 n n 的每一位数，数字间用一个空格隔开。 输入格式 输入一个正整数 n ( 0 < n ≤ 999999 ) n(0<n≤999999)。 输出格式 从个位开始按照从低位到高位的顺序依次输出每一位数字。数字之间以一个空格分开。 输入输出样例 输入#1 复制 123 输出#1 复制 3 2 1 说明/提示 【样例 1 解释】 123的个位为3，十位为2，百位为1，从个位开始按照从低位到高位的顺序依次输出 3 2 1 数据范围 对于所有测试数据 测试点 n n 1 ∼ 10 1∼10 0 < n ≤ 999999 0<n≤999999