- 博客(23)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 boj67
<br />在世界中心呼唤爱<br /><br />#include <iostream> using namespace std; struct node { int value; node* left; int left_count; node* right; int right_count; }; node * insert(node * head,node * new_node) { if(head==NULL||new_node==NULL)return NU
2011-05-23 20:59:00
657
转载 m进制转n进制（任意进制转换）
<br />m进制转n进制（任意进制转换）<br />/*!/author LiuBao/date 2011/4/10/brief m进制转n进制，主流实现方式*/ #include <stdio.h> /*!m进制（数字）字符串转为n进制字符串。（先由m进制转为10进制，再由10进制转为n进制）/param dest 转换完毕的n进制字符串/param n 目的进制数（十六进制填16、二进制填2等）/param src 初始m进制字符串/param m 初始进制数，与目的进制数表示方法相同/warn
2011-05-07 13:17:00
1455
原创 新boj4
<br />Number Sequence<br />#include <iostream> using namespace std; int leng(int num) { int i=1; num=num/10; while(num!=0) { i++; num=num/10; } return i; } int main() { int count,i,j,k; char num_
2011-05-05 10:02:00
467
原创 新boj2
<br />A-B<br />#include <stdio.h> #include <stdlib.h> int cmp ( const void *a , const void *b){ return *(double *)a - *(double *)b; } int equ(double *trace,int *rank,int rowMax) { int i; for(i=1;i<rowMax;i++) { if(trace
2011-05-03 08:56:00
628
原创 新boj84
<br />Android key<br />#include <stdio.h> #include <stdlib.h> #include <memory.h> int res=0; void check(int **score,int Max,int m,int n,int row,int col,int step) { if(step==1) score[row][col]=1; if(step==Max) { res++;
2011-05-01 16:47:00
596
原创 新boj3
#include #include int cmp ( const void *a , const void *b){ return *(double *)a - *(double *)b;} int equ(double *trace,int *rank,int rowMax){ int i; for(i=1;i { if(trace[i-1] else if(trace[i-1]==trace[i]&&rank[i-1]>rank[i])return
2011-05-01 15:42:00
699
原创 poj2965
The Pilots Brothers' refrigerator<br />#include "iostream" #include "math.h" using namespace std; unsigned short int flips[16]={0xf888,0xf444,0xf222,0xf111,0x8f88,0x4f44,0x2f22,0x1f11, 0x88f8,0x44f4,0x22f2,0x11f1,0x888f,0x444f,0x222f,0x11
2011-01-10 15:17:00
653
原创 poj1753
Flip Game<br />#include "iostream" using namespace std; unsigned short int flips[16]={0xc800,0xe400,0x7200,0x3100,0x8c80,0x4e40,0x2720,0x1310, 0x08c8,0x04e4,0x0272,0x0131,0x008c,0x004e,0x0027,0x0013}; int min1=16; unsigned short int poww
2011-01-09 13:51:00
2756
原创 poj3094
Quicksum<br />#include "iostream" #include "math.h" using namespace std; int main() { char str[256]; memset(str,0,256); cin.getline(str,256); while(!(str[0]=='#'&&str[1]==0)) { int checksum=0; int len=strlen(s
2011-01-03 16:10:00
547
原创 如何读取整行
<br />直接用cin或者scinf读取字符串，回自动隔断空格和回车，例如要读取“Hello World”就只能按“Hello”和“World”两个串读取。<br />此时需要使用cin.getline()函数,使用实例如下：<br />#include "iostream" using namespace std; int main() { char m[20]; cin.getline(m,5); cout<<m<<endl; return 0; } <br />输入：abcdefg
2011-01-03 15:52:00
687
原创 poj2255
Tree Recovery<br />#include "iostream" #include "math.h" using namespace std; #define Max 27 void left_inorder(char* str1,char *str2,char *res_l,char *res_r); void left_pre(char* str1,char *str2,char *res,char *res2) { char left[Max]; cha
2011-01-03 12:57:00
808
转载 ACM中无输入结束提示时如何判断到达EOF
1.while((scanf"%d,%d",&m,&n)==2) { //... }2.while((scanf"%d,%d",&m,&n)!=EOF) { //... }3.while(cin>>m>>n) { //... }原帖地址：http://blog.csdn.net/super_chris/archive/2009/08/29/4495919.aspx
2011-01-03 12:46:00
731
原创 poj3006
Dirichlet's Theorem on Arithmetic Progressions<br />#include "iostream" #include "math.h" using namespace std; bool isPrime(int x); int main(int argc, _TCHAR* argv[]) { int a,d,n; cin>>a; cin>>d; cin>>n; while(a!=0||d!=0||n!=0
2011-01-02 20:28:00
734
原创 poj1503
Integer Inquiry<br />#include "iostream" #include "math.h" using namespace std; bool isEnd(char *str) { if(str[0]=='0'&&str[1]==0)return true; else return false; } void add(char *num1,char *num2); void move(char *num); int main() {
2011-01-02 00:02:00
477
原创 poj3299
Humidex<br />#include "iostream" #include "math.h" using namespace std; void formula(double& t,double& d,double& h); int main(int argc, _TCHAR* argv[]) { char cmd; cin>>cmd; while(cmd!='E') { double t=200,d=200,h=200;
2011-01-01 20:06:00
796
原创 poj2159
Ancient Cipher#include "iostream" #include "math.h" using namespace std; int compare(int *str1,int *str2); int main(int argc, _TCHAR* argv[]) { char old[101]; int s1[26]; int s2[26]; for(int j=0;j<26;j++) { s1[j]=0;
2011-01-01 20:04:00
528
原创 poj2262
<br />Goldbach's Conjecture<br />#include "math.h" #include "stdlib.h" #include<iostream> using namespace std; bool isprime(int x); int main() { int num; cin>>num; while(num!=0) { int i; for(i=3;i<num/2+1;i++) { if(isprime(i)&&is
2010-12-31 15:26:00
744
原创 poj1083
<br />Moving Tables<br />#include "math.h" #include "stdlib.h" #include<iostream> using namespace std; int comp(const void*p1,const void *p2) { return (*((int *)p1))>(*((int *)p2))?-1:1; } int main() { int corridor[200]; int T,N; cin>>T;
2010-12-31 10:04:00
768
原创 poj2739
Sum of Consecutive Prime Numbers #include "math.h" #include "stdlib.h" #include using namespace std; int main() { int max=10000; int res[1230]; memset(res,0,1230); res[0]=2; int num=1; for(int i=3;i>x; while(x!=0) { int x_num=0;
2010-12-30 15:42:00
1080
原创 企业管理系统部分代码
企业注册-添加企业信息protected void Button1_Click(object sender, EventArgs e) { Session["ent_reg_code"] = TextBox1.Text; SqlCommand ent_cmd; string sql = "insert into ent_info_temp values(@ent_reg_code,@old_ent_code, @reg_date, @ent_c
2010-10-19 20:48:00
2086
原创 数据库连接类
构造函数：static DataBase() { connectionString = System.Configuration.ConfigurationManager.AppSettings["ConnectionString"]; } 执行sql语句public static void ExecSQL(string sql) { SqlConnection connection = new SqlConnection(connectionString);
2010-10-19 15:48:00
545
转载 asp.net 后台执行js c#与asp.net页面前台语后台的函数
<br />C#代码与javaScript函数的相互调用 <br />net中前台javascript与后台c#函数相互调用问题 <br /> 问： <br /> 1.如何在JavaScript访问C#函数? <br /> 2.如何在JavaScript访问C#变量? <br /> 3.如何在C#中访问JavaScript的已有变量? <br /> 4.如何在C#中访问JavaScript函数? <br /> 问题1答案如下： <br /> javaScript函数中执行C#代码中的函数： <
2010-09-20 17:31:00
4903
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人