- 博客(6)
- 收藏
- 关注
RSS订阅原创 移动小球 欢迎提出更佳方案（要完整代码）
/*移动小球*/ #include#include#includeusing namespace std;#define max 100int a[max];void A(int c, int b){ int n, m;//用来找c,b在数组中对应的下标 for (int i = 1;; i++) { if (a[i] == c) {
2015-12-05 21:13:55
361
原创 铁轨
/*铁轨*/#include#include#include#includeusing namespace std;const int max = 1000;int a[max];int b[max];int main(){ int n; while (scanf("%d",&n)) { memset(a, 0, siz
2015-12-05 11:45:58
300
原创 卡片游戏
/*卡片游戏*/#include#include#include#includeusing namespace std;#define max 100int a[max];int main(){ int i; int n; while (cin >> n) { int found = 0;//找最后一个数要用到 for (i
2015-12-05 09:27:33
318
原创 因子与阶乘
/*因子与阶乘*/#include#include#include#include#includeusing namespace std;#define max 100000000int time[max];int a[max];int b[max];int T(int n){ int total=1; for (int i = 1;
2015-12-04 21:05:24
246
原创 多少块土地
/*多少块土地*/#include#include#include#includeusing namespace std;int E1(int n){ int j = 0; int Vtotal = 0; for (j = 0; j { Vtotal += j*(n - 2 - j); } return Vtotal;}i
2015-12-04 21:02:31
402
原创 算法竞赛 之果园里的树
/*果园里的树*/#include#include#include#includeusing namespace std;#define max 1000int a[max][max];double useful(double x0, double y0, double x1, double y1, double x2, double y2){
2015-12-04 20:01:29
851
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人