<![CDATA[IT随笔]]> http://hi.baidu.com http://hi.baidu.com http://img.baidu.com/img/logo-hi.gif http://hi.baidu.com/yjy2410578 zh-cn www.baidu.com 5 <![CDATA[在线制作ico图标]]> http://www.bitbug.net/


类别：Qt 查看评论]]> 2009-11-25 09:56 http://hi.baidu.com/yjy2410578/blog/item/d9bbe9b3f7108eadd8335a4e.html <![CDATA[nk2081 未完成]]> #include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int NDSZ = 100000;
const int EDSZ = 1000000;
const int LEN = 1000000;
class Edge{
public:
int fr,to;
Edge(int f=0,int t=0):fr(f),to(t){}
};
int que[LEN];
bool used[NDSZ];
int dis[NDSZ];
Edge e[EDSZ];
int st[NDSZ],ed[NDSZ];
int val[NDSZ];
void init();
int n,m,tot;
bool cmp(const Edge & ,const Edge & );
int spfa(int src , int dest);
void show();
void showdis();
int main(){
freopen("datin.txt","r",stdin);
while (scanf("%d%d",&n,&m)!=EOF){
   init();
   show();
   int ans = spfa(0,n-1);
   printf("%d\n",ans);
}
return 0;
}
void init(){
int i;
for (i=0;i<n;i++){
   scanf("%d",&val[i]);
}
tot=0;
for (i=0;i<m;i++){
   int fr,to,flag;
   scanf("%d%d%d",&fr,&to,&flag);
   fr--;
   to--;
   if (1==flag){
    e[tot++]=Edge(fr,to);
   }else if(2==flag){
    e[tot++]=Edge(fr,to);
    e[tot++]=Edge(to,fr);
   }
}
sort(e,e+tot,cmp);
int last = e[0].fr;
st[last]=0;
for (i=0;i<tot;i++){
   if (last!=e[i].fr){
    ed[last]=i;
    last=e[i].fr;
    st[last]=i;
   }
}
ed[last]=tot;

}
bool cmp(const Edge & a,const Edge & b){
if (a.fr!=b.fr){
   return a.fr<b.fr;
}else{
   return a.to<b.to;
}
}
int spfa(int src , int dest){
memset(dis,0,sizeof(dis));
int head=0,tail=1;
que[0]=src;
memset(used,false,sizeof(used));
used[src]=true;
while (head!=tail){
   int nd = que[head];
   printf("nd: %d\n",nd+1);
   head=(head+1)%LEN;
   used[nd]=false;
   int i;
   for (i=st[nd];i<ed[nd];i++){
    int nx = e[i].to;
   
    int deta =val[nx]-val[nd];
    printf("check : %d --> %d deta: %d\n",nd+1 , nx+1,deta);
    if (deta>dis[nx]){
     dis[nx]=deta;
     if (!used[nx]){
      used[nx]=true;
      que[tail]=nx;
      tail=(tail+1)%LEN;
     }
    }
   }
}
showdis();
return dis[dest];
}
void show(){
int i,j;
printf("edge: \n");
for (i=0;i<tot;i++){
   printf("%d---> %d\n",e[i].fr+1,e[i].to+1);
}
for (i=0;i<n;i++){
   printf("nd: %d\n",i+1);
   for (j=st[i];j<ed[i];j++){
    printf(" %d ",e[j].to+1);
   }
   printf("\n");
}
}

void showdis(){
int i;
for (i=0;i<n;i++){
   printf("dis [%d] = %d \n",i+1,dis[i]);
}
}

阅读全文
类别：Oj 查看评论]]> 2009-11-23 16:42 http://hi.baidu.com/yjy2410578/blog/item/77a4c31f5b5d16c2a68669e9.html <![CDATA[qt 中文乱码处理]]> m_ui->butall->setText(codec->toUnicode("猪猪"));


类别：Qt 查看评论]]> 2009-11-22 00:41 http://hi.baidu.com/yjy2410578/blog/item/b539b12c520a6be68b1399af.html <![CDATA[sql table ansd maper]]> //start

#include "stuin.h"

#include "ui_stuin.h"

Stuin::Stuin(QWidget *parent)

: QWidget(parent), ui(new Ui::Stuin)

{

//ui->setupUi(this);

this->move(10,20);

//this->setFixedSize(this->size());

//this->resize(this->width(),this->height()*2);

this->conn=QSqlDatabase::database();

if (!conn.open()){

qDebug()<<"failed connect mysql";

}else{

model=new QSqlTableModel(this,conn);

model->setTable("stuinfo");

model->setHeaderData(0,Qt::Horizontal,tr("miaomiaoid"));

model->select();

model->record(0);

this->view=new QTableView(this);

view->setModel(model);

view->show();

view->resize(600,400);

view->setColumnHidden(0,true);

QPushButton *but = new QPushButton("miao");

but->setParent(this);

but->show();

but->move(500,500);

connect(but,SIGNAL(clicked()),model,SLOT(submitAll()));

QPushButton *jmp=new QPushButton("jmp");

jmp->setParent(this);

jmp->show();

jmp->move(300,500);

connect(jmp,SIGNAL(clicked()),this,SLOT(jmpwin()));

}

}

void Stuin::jmpwin(){

Input *win = new Input(this);

win->exec();

}

Stuin::~Stuin()

{

delete ui;

}

void Stuin::on_pushButton_toggled(bool checked)

{

qDebug()<<checked;

if (checked){

this->resize(this->width(),this->height()*2);

this->update();

}else{

this->resize(this->width(),this->height()/2);

this->update();

}

}

void Stuin::on_pushButton_clicked(bool checked)

{

/*

qDebug()<<checked;

if (!checked){

this->update();

}else{

this->update();

}

*/

}

//end

//start

#include "input.h"

#include "ui_input.h"

Input::Input(QWidget *parent) :

QDialog(parent),

m_ui(new Ui::Input)

{

m_ui->setupUi(this);

this->maper=new QDataWidgetMapper();

this->conn=QSqlDatabase::database();

if (!conn.open()){

qDebug()<<"failed connect mysql";

}else{

model=new QSqlTableModel(this,conn);

model->setTable("stuinfo");

model->setHeaderData(0,Qt::Horizontal,tr("miaomiaoid"));

model->select();

qDebug()<<model->rowCount();

QSqlRecord red= model->record(0);

maper->setSubmitPolicy(maper->AutoSubmit);

maper->setModel(model);

maper->addMapping(m_ui->edname,red.indexOf("name"));

maper->addMapping(m_ui->edbirth,red.indexOf("birthday"));

maper->addMapping(m_ui->edcardid,red.indexOf("cardid"));

maper->toFirst();

QPushButton *but = new QPushButton("miao");

but->setParent(this);

but->show();

but->move(100,200);

connect(but,SIGNAL(clicked()),model,SLOT(submit()));

connect(but,SIGNAL(clicked()),maper,SLOT(submit()));

}

}

Input::~Input()

{

delete m_ui;

}

void Input::changeEvent(QEvent *e)

{

QDialog::changeEvent(e);

switch (e->type()) {

case QEvent::LanguageChange:

m_ui->retranslateUi(this);

break;

default:

break;

}

}

//end

//start

#include <QtGui/QApplication>

#include "stuin.h"

#include "input.h"

#include <QSqlDatabase>

int main(int argc, char *argv[])

{

QApplication a(argc, argv);

QSqlDatabase conn= QSqlDatabase::addDatabase("QMYSQL");

conn.setUserName("root");

conn.setPassword("admin");

conn.setHostName("127.0.0.1");

conn.setDatabaseName("yjytutor");

Stuin w;

w.show();

// Input w1;

// w1.show();

return a.exec();

}

//end

阅读全文
类别：Qt 查看评论]]> 2009-11-19 19:04 http://hi.baidu.com/yjy2410578/blog/item/f5fb75133727768a6438db2b.html <![CDATA[qt 自定义model]]> int strmod ::rowCount(const QModelIndex &parent) const{

return this->stringList.count();

}

QVariant strmod::data(const QModelIndex &index, int role) const{

if (!index.isValid())

return QVariant();

if (index.row()>stringList.count()){

return QVariant();

}

if (role==Qt::DisplayRole){

return stringList.at(index.row());

}else{

return QVariant();

}

}

QVariant strmod::headerData(int section, Qt::Orientation orientation,

int role ) const{

if (role==Qt::DisplayRole){

if (orientation == Qt::Horizontal){

return QString("col: %1").arg(section);

}else{

return QString("%1").arg(char(section+'A'));

}

}else{

return QVariant();

}

}

Qt::ItemFlags strmod::flags(const QModelIndex &index) const{

if (!index.isValid())

return Qt::ItemIsEnabled;

return (QAbstractItemModel::flags(index)|Qt::ItemIsEditable);

}

bool strmod::setData(const QModelIndex &index, const QVariant &value,

int role ){

if (index.isValid()&&role== Qt::EditRole &&!value.toString().isEmpty()){ //避免选中时把原值抹掉

this->stringList.replace(index.row(),value.toString());

emit this->dataChanged(index,index);

return true;

}

return false;

}

bool strmod::insertRows(int position, int rows, const QModelIndex &index ){

beginInsertRows(QModelIndex(), position, position+rows-1);

for (int row = 0; row < rows; ++row) {

stringList.insert(position, "");

}

endInsertRows();

return true;

}

bool strmod::removeRows(int position, int rows, const QModelIndex &index ){

beginInsertRows(QModelIndex(), position, position+rows-1);

for (int row = 0; row < rows; ++row) {

stringList.insert(position, "");

}

endInsertRows();

return true;

}

阅读全文
类别：Qt 查看评论]]> 2009-11-18 11:42 http://hi.baidu.com/yjy2410578/blog/item/eadebf82263768a80df4d212.html <![CDATA[qt thread]]>

Mythread::Mythread(QString myfn)

{

this->fn=myfn;

}

void Mythread::run(){

qDebug()<<"thread start: reading"<<this->fn;

if (!fn.isEmpty()){

QFile fi(fn);

if (!fi.open(QIODevice::ReadOnly)){

qDebug()<<fi.errorString();

}else{

qDebug()<<"reading file";

QTextStream fin(&fi);

fin.setCodec("UTF-8");

QStringList strlist;

QString line;

while (!fin.atEnd()){

line=fin.readLine();

strlist.push_back(line);

}

// qDebug()<<strlist;

emit this->passstrlist(strlist);

}

}

}

阅读全文
类别：Qt 查看评论]]> 2009-11-18 11:03 http://hi.baidu.com/yjy2410578/blog/item/2ac8a94a7fc6fe2908f7ef3c.html <![CDATA[dir model tree view]]> #include <QSplitter>

#include <QDirModel>

#include <QTreeView>

#include <QListView>

#include <QDebug>

int main(int argc, char *argv[])

{

QApplication a(argc, argv);

QSplitter *frame = new QSplitter(Qt::Horizontal);

QDirModel * dirmod =new QDirModel();

QTreeView * tree =new QTreeView(frame);

tree->setModel(dirmod);

tree->setRootIndex(dirmod->index(QDir::homePath()));

QListView * list = new QListView(frame);

list->setModel(dirmod);

list->setRootIndex(dirmod->index(QDir::homePath()));

int len = dirmod->rowCount();

QModelIndex par =dirmod->index(QDir::homePath());

// dirmod->sort(2,Qt::AscendingOrder);

for (int i=0;i<len;i++){

QModelIndex ind = dirmod->index(i,2,par); // col size filetype

QString txt = dirmod->data(ind,Qt::DisplayRole).toString();

qDebug()<<txt;

}

frame->show();

return a.exec();

}

阅读全文
类别：Qt 查看评论]]> 2009-11-18 11:02 http://hi.baidu.com/yjy2410578/blog/item/38d481092a5cc8c53ac76333.html <![CDATA[qt 启动 login]]> #include "mainwindow.h"

#include "login.h"

#include <QDebug>

int main(int argc, char *argv[])

{

QApplication a(argc, argv);

Login log;

MainWindow w;

int ret =log.exec();

if (ret==5){

qDebug()<<"miao "<<ret;

w.show();

}

return a.exec();

}

this->done(5);

阅读全文
类别：Qt 查看评论]]> 2009-11-17 22:22 http://hi.baidu.com/yjy2410578/blog/item/693745cce3403a1a00e928eb.html <![CDATA[zju 3261 MLE]]> #include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
const int SIZE = 40010;
const int LEN = 10010;
const int NDSZ = LEN*2;
class Edge{
public:
int fr,to;
Edge(int f=0,int t=0):fr(f),to(t){};
};
Edge edat[SIZE];
Edge * front[SIZE];

int ext;
class Node{
public:
int nowid;
int frst,fred;
vector<int> conn;
int sp;
int val;
void set(int id , int v){
   nowid=id;
   val=v;
   sp=0;
   conn.clear();
   frst=fred=0;
}
void rename(){
   nowid=ext++;
}
};
Node dat[LEN];

int fa[NDSZ];
void merge(int ,int);
int find(int);
void init();
int n,m;
bool cmpfr(const Edge * a,const Edge * b);
bool cmpbk(const Edge * a,const Edge * b);
bool cmpnd(const int & a , const int & b);
void work();
void prework();
int gethelp(int);
void mkrel(int ,int);
int main(){
//freopen("../../dat.in","r",stdin);
bool fir=true;
while (scanf("%d",&n)!=EOF){
   init();
   if (fir){
    fir=false;
   }else{
    printf("\n");
   }
   work();
}
return 0;
}

void init(){
ext=n;
int i,j;
for (i=0;i<n*2;i++){
   fa[i]=i;
}
for (i=0;i<n;i++){
   int val;
   scanf("%d",&val);
   dat[i].set(i,val);
}
scanf("%d",&m);
int tmp=0;
for (i=0;i<m;i++){
   int fr,to;
   scanf("%d%d",&fr,&to);
   edat[tmp++]=Edge(fr,to);
   edat[tmp++]=Edge(to,fr);
   merge(fr,to);
}
m=tmp;
for (i=0;i<m;i++){
   front[i]=&edat[i];
}
sort(front,front+m,cmpfr);
int last=front[0]->fr;
dat[last].frst=0;
for (i=1;i<m;i++){
   if (last!=front[i]->fr){
    dat[last].fred=i;
    last=front[i]->fr;
    dat[last].frst=i;
   }
}
dat[last].fred=i;

prework();
}

bool cmpfr(const Edge * a,const Edge * b){
return (a->fr!=b->fr)?(a->fr<b->fr):(a->to<b->to);
}
bool cmpbk(const Edge * a,const Edge * b){
return (a->to!=b->to)?(a->to<b->to):(a->fr<b->fr);
}
bool cmpnd(const int & a , const int & b){
return (dat[a].val!=dat[b].val)?(dat[a].val>dat[b].val):(a<b);
}
void work(){
int cas;
scanf("%d",&cas);

while (cas--){
   char buff[20];
   scanf("%s",buff);
   if (buff[0]=='q'){
    int nd;
    scanf("%d",&nd);
    int ans = gethelp(nd);
    printf("%d\n",ans);
   }else if (buff[0]='d'){
    int fr,to;
    scanf("%d%d",&fr,&to);
    dat[fr].rename();
    dat[to].rename();
    mkrel(fr , to);
    mkrel(to ,fr);
   }
}
}

void merge(int a,int b){
int na = find(a);
int nb = find(b);
if (na==nb)return ;
fa[na]=nb;
}
int find(int nd){
return (nd==fa[nd])?(nd):(fa[nd]=find(fa[nd]));
}
void prework(){
int i,j;
for (i=0;i<n;i++)
   for (j=i+1;j<n;j++){
    int na = i;
    int nb = j;
    if (find(na)==find(nb)){
     if (dat[na].val>dat[nb].val){
      dat[nb].conn.push_back(na);
     }else if (dat[na].val<dat[nb].val){
      dat[na].conn.push_back(nb);
     }
    }
   }
for (i=0;i<n;i++){
   sort(dat[i].conn.begin() , dat[i].conn.end() , cmpnd);
}
}
int gethelp(int nd){
int i;
int len =dat[nd].conn.size();
for (i=dat[nd].sp;i<len;i++){
   int tmp= dat[nd].conn[i];
   if (find(dat[nd].nowid)==find(dat[tmp].nowid)){
    dat[nd].sp=i+1;
    return tmp;
   }
}
return -1;
}
void mkrel(int nd ,int bad){
int id = dat[nd].nowid;
int i;
for (i=dat[nd].frst;i<dat[nd].fred;i++){
   if (front[i]->to!=bad){
    merge(id , dat[front[i]->to].nowid);
   }
}
}

阅读全文
类别：Oj 查看评论]]> 2009-11-16 11:32 http://hi.baidu.com/yjy2410578/blog/item/d03747443a19ea88b3b7dc47.html <![CDATA[xqib]]> <html>
<head>
<script type="text/xquery">
declare sequential function local:main(){
browser:alert("miao")
};
</script>
</head>
<body>
<h1>miao miao </h1>
</body>
</html>


类别：Css 查看评论]]> 2009-11-14 18:01 http://hi.baidu.com/yjy2410578/blog/item/617dbfee5e08fbf1b3fb953f.html <![CDATA[二叉树前序+中序 --〉后序]]> #include <stdio.h>
#include <string.h>
const int SIZE=30;
char pre[SIZE];
char mid[SIZE];
char sufix(SIZE);

class Node{
public:
   Node * le , *ri;
   char val;
   Node(char v):val(v),le(NULL),ri(NULL){};
};
Node * work( int lo, int hi);
void show(Node * );
void clear(Node *);
int nd=0;
int main(){
// freopen("dat.txt","r",stdin);
while (scanf("%s%s",pre,mid)!=EOF){
   nd=0;
   Node * rt =work(0,strlen(mid));
   show(rt);
   printf("\n");
   clear(rt);
}
return 0;
}

Node * work(int lo, int hi){
char * ptr =strchr(mid+lo , pre[nd]);
if (ptr==NULL)
   return NULL;
int pos = ptr-mid;
if (pos>=hi)
   return NULL;
Node * rt = new Node(pre[nd]);
nd++;
rt->le = work(lo,pos);
rt->ri = work(pos,hi);
return rt;
}
void show(Node * nd){
if (nd==NULL)
   return ;
show(nd->le);
show(nd->ri);
printf("%c",nd->val);
}
void clear(Node * nd){
if (nd==NULL)
   return ;
if (nd->le)
   clear(nd->le);
else if(nd->ri)
   clear(nd->ri);
delete nd;
nd=NULL;
}

阅读全文
类别：Oj 查看评论]]> 2009-11-13 09:26 http://hi.baidu.com/yjy2410578/blog/item/674ea023793039589922edd9.html <![CDATA[antlr learn]]> //T.g

//start

grammar T;
r: 'call' ID ';'{System.out.printf("invoke "+$ID.text);};
ID: 'a'..'z'+;
WS: (' '|'\n'|'\r')+ {$channel=HIDDEN;} ;

//end

//start Test.java

import org.antlr.runtime.*;
public class Test{
public static void main(String atgs[]) throws Exception{
   ANTLRInputStream input = new ANTLRInputStream(System.in);
   TLexer lexer = new TLexer(input);
   CommonTokenStream tokens = new CommonTokenStream(lexer);
   TParser parser = new TParser(tokens);
   parser.r();
}
}

//end

阅读全文
类别：Antlr 查看评论]]> 2009-11-11 09:35 http://hi.baidu.com/yjy2410578/blog/item/4d91e40827f1aedb62d9869f.html <![CDATA[usaco cookie]]> 
/*
LANG: C++
ID: yjyfrom1
PROG: cookie
*/

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
/*
maxnode 点的个数
maxedge 边的个数
oo INF
*/
const int maxnode = 2000 + 5;
const int maxedge = 400000 + 5;
const int oo = 1000000000;

int node, src, dest, nedge;
int head[maxnode], point[maxedge], next[maxedge], flow[maxedge], capa[maxedge];
int dist[maxnode], Q[maxnode], work[maxnode];

/*
node 顶点数[0 ,node)

*/
void init(int _node, int _src, int _dest) {
 node = _node;
 src = _src;
 dest = _dest;
 for (int i = 0; i < node; i++) head[i] = -1;
 nedge = 0;
}

/*
添加容量c1 正向，c2 反向
一般的有向图c1 =cap , c2=0
无向图c1=c2=cap;
*/
void addedge(int u, int v, int c1, int c2) {
 point[nedge] = v, capa[nedge] = c1, flow[nedge] = 0, next[nedge] = head[u], head[u] = (nedge++);
 point[nedge] = u, capa[nedge] = c2, flow[nedge] = 0, next[nedge] = head[v], head[v] = (nedge++);
}

/*
找层次图，最后一次的dist[i]<0 的连dest , dist[i]>0 连src , 之间的边是割边
*/
bool dinic_bfs() {
 memset(dist, -1, sizeof (dist));
 dist[src] = 0;
 int sizeQ = 0;
 Q[sizeQ++] = src;
 for (int cl = 0; cl < sizeQ; cl++)
  for (int k = Q[cl], i = head[k]; i >= 0; i = next[i])
   if (flow[i] < capa[i] && dist[point[i]] < 0) {
    dist[point[i]] = dist[k] + 1;
    Q[sizeQ++] = point[i];
   }
   return dist[dest] >= 0;
}

int dinic_dfs(int x, int exp) {
 if (x == dest) return exp;
 for (int &i = work[x]; i >= 0; i = next[i]) {
  int v = point[i], tmp;
  if (flow[i] < capa[i] && dist[v] == dist[x] + 1 && (tmp = dinic_dfs(v, min(exp, capa[i] - flow[i]))) > 0) {
   flow[i] += tmp;
   flow[i^1] -= tmp;
   return tmp;
  }
 }
 return 0;
}
/*
最大流
*/
int dinic_flow() {
 int result = 0;
 while (dinic_bfs()) {
  for (int i = 0; i < node; i++) work[i] = head[i];
  while (1) {
   int delta = dinic_dfs(src, oo);
   if (delta == 0) break;
   result += delta;
  }
 }
 return result;
}

const int SIZE = 1010;
const int LEN = 200;
class Cow{
public:
 int will;
 vector<int> gp;
 void show(){
  printf("will: %d\n",will);
  printf("gp: %d\n",gp.size());
  int i;
  int len = gp.size();
  for (i=0;i<len;i++){
   printf(" %d ",gp[i]);
  }
  printf("\n");
 }
};
Cow cow[SIZE];
double tmpcnt[SIZE];
void myinit();
int nbcow , gpsz;
void show();
bool mywork();
int mat[LEN];
int main(){
 freopen("cookie.in","r",stdin);
 freopen("cookie.out","w",stdout);
 myinit();
 //show();
 if (mywork()){
  int i;
  for (i=1;i<=gpsz;i++){
   printf("%d\n",mat[i]);
  }
 }else{
  printf("-1\n");
 }
 return 0;
}

bool mywork(){
 int src=0 ;
 //cow [1 , nbcow ]
 //group [1 , gpsz] --> [nbcow+i] i= 1..gpsz
 int dest = nbcow+gpsz+1;
 int tot = dest+1;
 init(tot,src,dest);
 int i,j;
 for (i=1;i<=nbcow;i++)
  addedge(src,i,cow[i].will,0);
 for (i=1;i<=gpsz;i++)
  addedge(i+nbcow , dest , 1,0);
 for (i=1;i<=nbcow;i++){
  int len = cow[i].gp.size();
  for (j=0;j<len;j++){
   int nx = cow[i].gp[j] +nbcow;
   addedge(i,nx,1,0);
  }
 }
 int myflow=dinic_flow();
 //printf("maxflow:%d \n",myflow);
 if (myflow!=gpsz)
  return false;
 int nd;
 memset(mat,-1,sizeof(mat));
 for (nd=1;nd<=nbcow;nd++){
  for (i=head[nd] ; i>=0 ; i=next[i]){
   if (flow[i]==1 && flow[i]==capa[i]){
    int to =point[i]-nbcow;
    if (to>=1 && to<=gpsz){
     //printf("(%d ,%d )\n",nd,to);
     mat[to]=nd;
    }
   }
  }
 }

 return true;
}

void myinit(){
 scanf("%d%d",&nbcow,&gpsz);
 int i,j;
 for (i=1;i<=nbcow;i++){
  cow[i].will=0;
  cow[i].gp.clear();
  tmpcnt[i]=0;
 }
 for (i=1;i<=gpsz;i++){
  int sz;
  scanf("%d",&sz);
  for (j=0;j<sz;j++){
   int nd;
   scanf("%d",&nd);
   cow[nd].gp.push_back(i);
   tmpcnt[nd]+=1.0/(double)sz;
  }
 }
 for (i=1;i<=nbcow;i++){
  cow[i].will = (int)ceil(tmpcnt[i]);
 }
}
void show(){
 int i;
 for (i=1;i<=nbcow;i++){
  cow[i].show();
 }
}
阅读全文
类别：Usaco 查看评论]]> 2009-11-09 23:45 http://hi.baidu.com/yjy2410578/blog/item/2ac8a94a5703e62908f7eff9.html <![CDATA[ipconfig]]>

Windows IP Configuration

        Host Name . . . . . . . . . . . . : YJYHOME

        Primary Dns Suffix . . . . . . . :

        Node Type . . . . . . . . . . . . : Unknown

        IP Routing Enabled. . . . . . . . : No

        WINS Proxy Enabled. . . . . . . . : No

Ethernet adapter 本地连接:

        Connection-specific DNS Suffix . :

        Description . . . . . . . . . . . : NVIDIA nForce Networking Controller

        Physical Address. . . . . . . . . : 00-1D-60-83-F2-7A

        Dhcp Enabled. . . . . . . . . . . : Yes

        Autoconfiguration Enabled . . . . : Yes

        IP Address. . . . . . . . . . . . : 192.168.1.104

        Subnet Mask . . . . . . . . . . . : 255.255.255.0

        IP Address. . . . . . . . . . . . : fe80::21d:60ff:fe83:f27a%4

        Default Gateway . . . . . . . . . : 192.168.1.1

        DHCP Server . . . . . . . . . . . : 192.168.1.1

        DNS Servers . . . . . . . . . . . : 202.112.80.106

                                            fec0:0:0:ffff::1%1

                                            fec0:0:0:ffff::2%1

                                            fec0:0:0:ffff::3%1

        Lease Obtained. . . . . . . . . . : 2009年11月4日 22:37:34

        Lease Expires . . . . . . . . . . : 2009年11月5日 0:37:34

Tunnel adapter Teredo Tunneling Pseudo-Interface:

        Connection-specific DNS Suffix . :

        Description . . . . . . . . . . . : Teredo Tunneling Pseudo-Interface

        Physical Address. . . . . . . . . : FF-FF-FF-FF-FF-FF-FF-FF

        Dhcp Enabled. . . . . . . . . . . : No

        IP Address. . . . . . . . . . . . : fe80::ffff:ffff:fffd%5

        Default Gateway . . . . . . . . . :

        NetBIOS over Tcpip. . . . . . . . : Disabled

Tunnel adapter Automatic Tunneling Pseudo-Interface:

        Connection-specific DNS Suffix . :

        Description . . . . . . . . . . . : Automatic Tunneling Pseudo-Interface

        Physical Address. . . . . . . . . : C0-A8-01-68

        Dhcp Enabled. . . . . . . . . . . : No

        IP Address. . . . . . . . . . . . : fe80::5efe:192.168.1.104%2

        Default Gateway . . . . . . . . . : 2001:da8:207:1:0:5efe:202.112.95.129

        DNS Servers . . . . . . . . . . . : fec0:0:0:ffff::1%1

                                            fec0:0:0:ffff::2%1

                                            fec0:0:0:ffff::3%1

        NetBIOS over Tcpip. . . . . . . . : Disabled

阅读全文
类别：net 协议 查看评论]]> 2009-11-04 23:12 http://hi.baidu.com/yjy2410578/blog/item/5c3f4b6efe15c0d080cb4aa2.html <![CDATA[c 学习好网站]]> http://learn.akae.cn/media/index.html


类别：c/c++ 查看评论]]> 2009-11-04 17:12 http://hi.baidu.com/yjy2410578/blog/item/57d2b5434b2c221b9213c6b0.html