- 博客(95)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 64位deepin/ubuntu下源码安装R
1. tar zxvf R-3.1.2.tar.gz2. root用户权限apt-get install build-essentialapt-get install gfortranapt-get install libreadline6-devapt-get install libxt-dev3. cd R-3.1.24. ./configure --prefi
2014-12-05 14:37:35
2286
原创 hadoop2.4.1在64位Deepin/Ubuntu系统中编译安装
Requirements:* Unix System* JDK 1.6+* Maven 3.0 or later* Findbugs 1.3.9 (if running findbugs)* ProtocolBuffer 2.5.0* CMake 2.6 or newer (if compiling native code)* Internet connection f
2014-07-12 16:42:31
2320
原创 hadoop之ssh免登陆实现
# hadoop begin192.168.0.107 master.hadoop192.168.0.136 salve1.hadoop192.168.0.110 salve2.hadoop# hadoop end
2014-07-09 20:40:32
803
原创 2048游戏C++ Console实现（简单版，未优化代码）
#include #include #include #include #include #include // 2的概率大于4#define random_2_4 (rand()%5==4 ? 4:2)#define random_x(x) (rand()%x)using namespace std;// 矩阵大小const int MAX = 4;const int
2014-03-28 22:18:44
3049
转载 cocos2d-x 2.2.2 => Android
http://blog.youkuaiyun.com/jwxkk/article/details/18865407http://blog.youkuaiyun.com/jwxkk/article/details/18882339----------------最终日志21:47:43 **** Build of configuration cocos2d-x 2.2.2 for project
2014-03-05 22:02:47
1413
原创 VS2013 + Cocos2d-x 2.2.2
cocos2d-x-build-project.bat@echo offset cocos2d-x-path=D:\cocos2d-x\v2.2.2\cocos2d-x-2.2.2set python27-path=E:\GAE\Python27echo 设置变量如下echo cocos2d-x : %cocos2d-x-path%echo python27 : %python2
2014-03-05 11:51:58
1080
原创 2003（Floyd）
#include #include const int N = 20;double c[N][N];int main(){ int n; int i, j; double num; while(scanf("%d", &n)==1&&n) { memset(c, 0, sizeof(c)); for(i=0; i<n; i++) { for(j=0; j<n;
2013-04-18 22:05:43
598
原创 1107（数论）
#include int main(){ int a,b; scanf("%d",&a); while(a--) { int sum=0; scanf("%d",&b); while(b) { sum+=b/5; b/=5; } printf("%d\n",sum); } return 0;}
2013-04-18 22:04:56
686
原创 1087（水）
#include int a[20];int b[20];int main(){ int n; int c = 0; while(scanf("%d", &n)==1&&n) { if(c!=0) putchar('\n'); c++; for(int i=0; i<n; i++) scanf("%d", &a[i]); for(int i=0; i<n
2013-04-18 22:01:11
581
原创 1062（水）
#include int gcd(int a, int b){ int r; do { r = a%b; a = b; b = r; }while(b>0); return a;}int main(){ int a, b, g; double c; while(scanf("%d%d", &a, &b)==2&&!(a==0&&b==0)) { g =
2013-04-18 22:00:35
562
原创 1145
#include const int MAX = 100;int main(){ int N, n, m, t; scanf("%d", &N); for(int k=0; k<N; k++) { if(k>0) putchar('\n'); int p = 1; while(scanf("%d%d", &n, &m)==2&&!(n==0&&m==0)) {
2013-04-18 21:59:24
761
原创 1889
#include #include //const unsigned int MAX = 4294967295;const unsigned int MAX = 100000;char b[MAX+1];int a[8];int main(){ freopen("1889.out", "w", stdout); int j; for(int i = 2; i<=MAX; ++i
2013-03-13 14:24:01
727
原创 1146
#include #include #include #include #include using namespace std;char a[200];void printrev(char* s){// strrev(s); char* h = s; char* t = s; char ch; while(*t++); t--;
2013-03-13 14:20:21
698
原创 1050
#include #include const int MAX = 10000;char a[MAX+1];char b[MAX+1];char c[300];int main(){ gets(a); gets(b); int aLen = strlen(a); int bLen = strlen(b); for(int i=0; i<bLen; ++i) c[b[i]
2013-03-13 14:15:57
570
原创 1049
#include using namespace std;int a[11];int find1(const int& n){ int c=0; int cc = n; while(cc>0) { a[c++]=cc%10; cc/=10; } int count=0; int temp=1; for(int i=0;i<c;i++){ count+=(n
2013-03-13 14:14:39
539
原创 1041
#include const int N = 100000;const int MAX = 10000;int a[N];int b[MAX+1];int main(){ int count; scanf("%d", &count); int i=0; while(i<count) { scanf("%d", &a[i]); b[a[i]]++; i++; }
2013-03-13 14:12:43
580
原创 1035
#include #include const int N = 1000;char c[N];struct Person{ char name[11]; char password[11];};Person p[N];int main(){ int count, r=0, len; char ch; scanf("%d", &count); for(int i=0;
2013-03-13 14:09:45
545
原创 1031
#include #include using namespace std;int main(){ int a,b,n;//竖着是a横着是b string s; cin>>s; n=s.length(); a=(n+2)/3; b=n-a*2+2; for(int i=0;i<a;i++) { cout<<s[i]; a=(n+2)/3; b=n-a*2+2;
2013-03-13 14:06:45
614
原创 1029
#include #include using namespace std;const int MAX = 1000000;long int a[MAX];long int b[MAX];int main(){ int counta, countb, i, j, k, mid; scanf("%d", &counta); for(i=0; i<counta; i++) sc
2013-03-13 14:05:58
581
原创 1028
#include #include #include using namespace std;const int N = 100000;struct Student{ char id[7]; char name[9]; int score;};Student stu[N];bool AscById(Student a, Student b){ return strcm
2013-03-13 14:02:28
602
原创 1023
#include #include using namespace std;char c1[10];char c2[10];string Add(string &a,string&b) { string ans; int carry; int i,j,k; int add1,add2,sum; i=a.size()-1; j=b.size()-1;
2013-03-13 14:00:41
607
原创 1036
#include #include #include #include using namespace std;struct Student{ string name; string id; int grade;};bool Desc(Student a, Student b){ return a.grade>b.grade;}bool Asc(Student
2013-03-08 21:38:13
580
原创 1025
#include #include #include #include using namespace std;struct Student{ string registration_number; int score; int final_rank; int location_number; int local_rank; friend istream & operato
2013-03-08 21:36:43
645
原创 1009
#include #include #include using namespace std;const double MIN = 0.0000001;const int K = 10;struct EC{ int exponents; //次数 double coefficients; //系数};EC a[K];EC b[K];EC c[K][K*K];EC res
2013-03-08 21:36:09
592
原创 1008
#include using namespace std;int f[10000];int main(){ f[0]=0; int i=1; int sum=0; int ncase=0; cin>>ncase; for(int j=0;j<ncase;j++) { cin>>f[i]; if(f[i]>f[i-1]) { sum+=((f[i]-f[i-1
2013-03-08 21:34:41
533
原创 1007(最大子串和)
#include using namespace std;const int MAX = 10000;int a[MAX];void findij(const int array[], size_t length, unsigned int& i, unsigned int& j, const int& max){ int cur_max; for(i = 0; i <length;
2013-03-08 21:33:55
604
原创 1006
#include #include #include #include using namespace std;struct Person{ string id; string beg; string end; friend istream & operator>>(istream &is, Person &p) { is>>p.id>>p.beg>>p.end;
2013-03-08 21:33:02
562
原创 1005
#include #include #include using namespace std;void printEhar(const char &ch){ switch(ch) { case '0': cout<<"zero"; break; case '1': cout<<"one"; break; case '2': cout<<"two"; br
2013-03-08 21:31:56
562
原创 1002
#include #include using namespace std;const double MIN = 0.0000001;struct EC{ int exponents; //次数 double coefficients; //系数};EC a[10];EC b[10];EC result[20];int main(){ int counta, co
2013-03-08 21:31:10
594
原创 1202
#include #include using namespace std;const int MAX = 50;int a[MAX];unsigned int gcd(unsigned int a,unsigned int b){ while(b^=a^=b^=a%=b); return a;}int main(){ int count = -1,i,j; whil
2013-03-08 12:30:22
686
原创 1021
#include using namespace std;const int MAX = 1000000;int a[MAX+10];int main(){ int x,i,j,k,l,m,n; x=0; for(i=0;i<10;i++) for(j=0;j<10;j++) for(k=0;k<10;k++) for(l=0;l<10;l++)
2013-03-08 12:29:03
569
原创 判断素数的简单方法
bool isPrime(int num){ if (num <= 1) return false; if (num == 2 || num == 3) { return true; } if (num % 6 != 1 && num % 6 != 5) { return false; } for (int i = 5; i*i <= num; i += 6) {
2013-03-07 20:41:49
765
原创 1196
#include using namespace std;const int MAX = 1000000;const int SIZE = 78500;int P[SIZE];bool isPrime(int num){ if (num == 2 || num == 3) { return true; } if (num % 6 != 1 && num % 6 != 5)
2013-03-07 20:38:51
705
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人