随笔分类 -  ACM

摘要:#include <stdio.h>#include <stdlib.h>#include <memory.h>char srcR[7], srcn[3];//string length, +1int dstR[5], dstn[2], point, n;//point记录小数点位置,n记录dstn的int形式;int ans[200], result[200];int main(){ while (1) { if (scanf("%s", srcR) == EOF) break; getchar(); scanf... 阅读全文
posted @ 2011-09-15 22:07 SunnyDay2015 阅读(250) 评论(0) 推荐(0) 编辑
摘要:#include<iostream>using namespace std;int main(){ int array[21][21][21]; for (int i=0; i<=20; i++) { for (int j=0; j<=20; j++) { for (int k=0; k<=20; k++) { if (i == 0 || j == 0 || k == 0) { array[i][j][k] ... 阅读全文
posted @ 2011-09-05 12:34 SunnyDay2015 阅读(315) 评论(0) 推荐(0) 编辑
摘要:#include <iostream>#include <iomanip>#include <cassert>using namespace std;int factorial(int i){ if(i==0 || i==1) { return 1; } else { int product = 1; for(int j=1; j<=i; j++) { product = product*j; } return product; }}int main(){ long double sum = 0; cout << "n e&quo 阅读全文
posted @ 2011-03-20 22:36 SunnyDay2015 阅读(309) 评论(0) 推荐(0) 编辑
摘要:#include <iostream>#include<fstream>using namespace std;ifstream infile;int main(){ int a[10],b[10],c[10]; int noOfCase; infile.open("1.txt"); void set(int [],int [],int []); void standard(int [],int [],int []); int meet(int,int,int,int); void schedule(int [],int [],int []); in 阅读全文
posted @ 2011-03-13 22:45 SunnyDay2015 阅读(434) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示