VC2012链接mySql

环境设置：

安装完mysql
vs中 vc++目录 中 包含目录 D:\DevSoft\MySQL\MySQL Server 5.5\include 这个文件夹
vc++目录 中 引用目录 D:\DevSoft\MySQL\MySQL Server 5.5\lib 这个文件夹。

记得把 mysql 安装目录中的include目录下的libmysql.lib 复制到工程文件夹下。

如果是32位的mysql 可以直接连。 如果是 64，需要 配置 vs x64平台，在配置管理其中，然后连。

#include "stdafx.h"
#include <Windows.h>
#include <string.h>
#include <mysql.h>
#include <iostream>
using namespace std;

int main()
{
const char user[] = "花花的数据库账号"; //username
const char pswd[] = "花花的数据库密码"; //password
const char host[] = "localhost"; //or"127.0.0.1"
const char table[] = "画画的数据库空间"; //database
unsigned int port = 3306; //server port
MYSQL myCont;
MYSQL_RES *result;
MYSQL_ROW sql_row;
MYSQL_FIELD *fd;
char column[32][32];
int res;
mysql_init(&myCont);
if(mysql_real_connect(&myCont,host,user,pswd,table,port,NULL,0))
{
cout<<"connect succeed!"<<endl;
mysql_query(&myCont, "SET NAMES GBK"); //设置编码格式,否则在cmd下无法显示中文
res=mysql_query(&myCont,"select * from student");//查询
if(!res)
{
result=mysql_store_result(&myCont);//保存查询到的数据到result
if(result)
{
int i,j;
cout<<"number of result: "<<(unsigned long)mysql_num_rows(result)<<endl;
for(i=0;fd=mysql_fetch_field(result);i++)//获取列名
{
strcpy_s(column[i],fd->name);
}
j=mysql_num_fields(result);
for(i=0;i<j;i++)
{
printf("%s\t",column[i]);
}
printf("\n");
while(sql_row=mysql_fetch_row(result))//获取具体的数据
{
for(i=0;i<j;i++)
{
printf("%s\n",sql_row[i]);
}
printf("\n");
}
}
}
else
{
cout<<"query sql failed!"<<endl;
}
}
else
{
cout<<"connect failed!"<<endl;
}
if(result!=NULL) mysql_free_result(result);//释放结果资源
mysql_close(&myCont);//断开连接
system("pause");
return 0;
}

 

 

#include<iostream>
#include<stack>
using std::cin;
using std::cout;
class STACK
{
public:
    int *a;
    int number;                
public:
    STACK():number(0){a=new int[0];};
    STACK(int n):number(n){a=new int[n];};
    int&operator[](int key){return a[key];};
    int&operator*(){return a[0];}
    int * operator+(int i){return (a+i);}
    int&at(int n){return a[n];};
    int&front(){return a[0];};
    int&back(){return a[number-1];};
    int* begin()const{return a;};
    int* end()const{return (a+number-1);};
    int size()const{return number;};
    bool empty(){return !number;};
    void clear(){delete[]a;};
    void top(){resize(number-1);};
    ~STACK(){delete[]a;};
    void resize(int);
    void push_back(int);
    void erase(int);
    void insert(int*,int);
    void reserve(); 
};
void STACK::resize(int size)
{
    int *b=new int[size];
    for(int i=0;i<number&&i<size;i++)
        b[i]=a[i];
    delete[]a;
    number=size;
    a=b;
}
void STACK::push_back(int integer)
{
    resize(number+1);
    a[number-1]=integer;
}
void STACK::erase(int n)
{
    for(int i=n;i<number-1;i++)
        a[n]=a[n+1];
    resize(number-1);
}
void STACK::insert(int *p,int n)        
{
    int m=p-a;
    resize(number+1);
    for(int i=number-1;i>m;i--)
        a[i]=a[i-1];
    a[m]=n;
}                            
void STACK::reserve ()
{
    for(int i=0;i<number/2;i++)
    {
        int temp=a[i];
        a[i]=a[number-i-1];
        a[number-i-1]=temp;
    }
}
int main()
{
/*    int i;
    STACK stack(5);
    for(i=0;i<5;i++)
        cin>>stack[i];
    for(i=0;i<5;i++)
    cout<<*(stack+i)<<" ";
    cout<<'\n';
    stack.insert (stack.begin()+3,10);
    for(i=0;i<6;i++)
    cout<<*(stack+i)<<" ";
    cout<<'\n';*/

    STACK stack;
    stack.push_back (10);
    stack.push_back (12);
    stack.push_back (14);
    cout<<stack.back()<<'\n';
    stack.top();
    cout<<stack.back()<<'\n';
    return 0;
}

 

 

#include <stdio.h>
#include <stdlib.h>
#define N 41
#define M 3 
#define START 0
 struct stu
 {
    int data;
    struct stu *next;
} LNode[N];

 int main(void)
 {
    int i;
    
struct stu *next,*p, *r;
for (i = 0; i < N; i++)
 {
LNode[i].data = i + 1;
if (i < N - 1)
LNode[i].next = &LNode[i + 1];
else
LNode[i].next = LNode;
}
p = &LNode[START];
while(p -> next != p)
 {
for (i = 1; i < M ; i++) 
{
r = p;
p = p ->next;
}
r ->next = p -> next;
printf("编号为%d的人出列\n", p -> data);
p = r ->next;

}


getchar();
return 0;
}