<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[budatu的专栏]]></title><description><![CDATA[时间的风车不懂沧桑]]></description><link>https://blog.youkuaiyun.com/budatu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; budatu]]></copyright><item><title><![CDATA[delphi 学习积累]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/81904612</link><guid>https://blog.youkuaiyun.com/budatu/article/details/81904612</guid><author>budatu</author><pubDate>Tue, 21 Aug 2018 11:28:09 +0800</pubDate><description><![CDATA[ORM：对象关系映射Object Relational Mapping，简称ORM，或O/RM，或O/R mapping），是一种程序技术，用于实现面向对象编程语言里不同类型系统的数据之间的转换 [1]  。从效果上说，它其实是创建了一个可在编程语言里使用的--“虚拟对象数据库”。

面向对象是从软件工程基本原则（如耦合、聚合、封装）的基础上发展起来的，而关系数据库则是从数学理论发展而来的，两套理...]]></description><category></category></item><item><title><![CDATA[delphi 启动/停止服务]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/80336635</link><guid>https://blog.youkuaiyun.com/budatu/article/details/80336635</guid><author>budatu</author><pubDate>Wed, 16 May 2018 14:33:47 +0800</pubDate><description><![CDATA[Delphi启动/停止Windows服务,启动类型修改为&quot;自动&quot;unit U_StartServices; interface uses   Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,   Dialogs, WinSVC, StdCtrls; type   TForm1 = class(TFo...]]></description><category></category></item><item><title><![CDATA[HDU-4147]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9878937</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9878937</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 16:06:36 +0800</pubDate><description><![CDATA[点击打开链接
#include 
#include 
int main()
{
        int n, B, D, f, F, i, j, time_A, time_B, time_C, time_min;
        int time_sum[100];
        char menu[100];
        while(scanf("%d%d%d%d%d", &n, &B,]]></description><category></category></item><item><title><![CDATA[HDU-4144]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9878907</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9878907</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:48:37 +0800</pubDate><description><![CDATA[点击打开链接
#include
#include
int main(void){
int n,i,j,str2[5],temp;
char str,str3[2001];
while(scanf("%d",&n)!=EOF){
        getchar();
    for(i=0;i<n/5;i++){
            temp=0;
        for(j=0;j<5;j+]]></description><category></category></item><item><title><![CDATA[HDU-4143]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9878701</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9878701</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:43:12 +0800</pubDate><description><![CDATA[点击打开链接
#include
#include
int main(void){
int n,i,j;
long t,x;
scanf("%d",&n);
while(n--){
    scanf("%d",&t);
    j=0;
    for(i=sqrt(t);i>=1;i--){
        if(t%i==0&&(i+t/i)%2==0&&i!=(t/i)){x=fabs(t]]></description><category></category></item><item><title><![CDATA[HDU-2154]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9878459</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9878459</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:36:46 +0800</pubDate><description><![CDATA[点击打开链接
#include
int main(void){
int n,i,a[1001],b[1001],c[1001];
while(scanf("%d",&n)&&n){
    a[0]=1;
        b[0]=0;
        c[0]=0;
        for(i=1;i<=n;i++)
        {
            a[i]=(b[i-1]+c[i]]></description><category></category></item><item><title><![CDATA[HDU-2153]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9878381</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9878381</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:29:21 +0800</pubDate><description><![CDATA[点击打开链接
#include
#include
int main(void){
int n,p[11][11],i,j,count;
while(scanf("%d",&n)&&n){
        count=0;
memset(p,0,sizeof(p));
for(i=0,j=0;j<n;j++)p[i][j]=++count;
for(i=1,j=n-1;i<n;i++)p[i][j]]></description><category></category></item><item><title><![CDATA[HDU-2092]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9878339</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9878339</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:25:56 +0800</pubDate><description><![CDATA[点击打开链接
#include 
int main(){
int i,n,m;
while(scanf("%d%d",&m,&n)&&(n||m)){
  for(i=-9999;i<10000;i++)
    if(i*(m-i)==n)
    {printf("Yes\n"); break;}
   if(i*(m-i)!=n) printf("No\n");
}

return 0;}]]></description><category></category></item><item><title><![CDATA[HDU-2081]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9878211</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9878211</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:24:40 +0800</pubDate><description><![CDATA[点击打开链接
#include
int main()
{
    int n,i;
    char a[12];
    scanf("%d",&n);
    while(n--)
    {
        scanf("%s",a);
        printf("6%s\n",a+6);
    }
}]]></description><category></category></item><item><title><![CDATA[HDU-2080]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9878165</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9878165</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:20:19 +0800</pubDate><description><![CDATA[点击打开链接
#include
#include
#define PI 3.1415927
int main()
{
    int t;
    double x1,y1,x2,y2,r;
    while(scanf("%d",&t)!=EOF){
    while(t--)
    {
       scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
    ]]></description><category></category></item><item><title><![CDATA[HDU-2077]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9878121</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9878121</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:19:06 +0800</pubDate><description><![CDATA[点击打开链接
#include
int main(void){
int t,n,i,a[21]={0,2};
    for(i=2;i<=20;i++)a[i]=3*a[i-1]+2;
while(scanf("%d",&t)!=EOF){
    while(t--){
        scanf("%d",&n);
        printf("%d\n",a[n-1]+2);
    ]]></description><category></category></item><item><title><![CDATA[HDU-2076]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9878107</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9878107</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:18:13 +0800</pubDate><description><![CDATA[点击打开链接
#include
#include
int main(void){
int t;
double a,b,h,m,s,th;
while(scanf("%d",&t)!=EOF){
    while(t--){
        scanf("%lf%lf%lf",&h,&m,&s);
        if(h>12.0)h-=12.0;
        a=h+m/60.0+s/3]]></description><category></category></item><item><title><![CDATA[HDU-2069]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9878075</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9878075</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:17:02 +0800</pubDate><description><![CDATA[点击打开链接
#include
int main(void){
int cent50,cent25,cent10,cent5,cent1,i,j,k,l,m,n,way;
while(scanf("%d",&n)!=EOF){
        way=0;
    cent50=n/50;
    cent25=n/25;
    cent10=n/10;
    cent5=n/5;
    ]]></description><category></category></item><item><title><![CDATA[HDU-2068]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9878037</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9878037</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:16:01 +0800</pubDate><description><![CDATA[点击打开链接
#include
int main()
{
    int n,m,i,j;
    __int64 a[14]={0,0,1,2};
    for(i=4;i<14;i++)
        a[i]=(i-1)*(a[i-1]+a[i-2]);
    while(scanf("%d",&n)&&(n))
    {
        __int64 c=1,x=1,y=1;
]]></description><category></category></item><item><title><![CDATA[HDU-2061]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9877977</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9877977</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:14:30 +0800</pubDate><description><![CDATA[点击打开链接
#include
int main(void){
int t,n,flag,i;
double gpa,credit,ci,score;
char name[31];
while(scanf("%d",&t)!=EOF){
    while(t--){
            flag=0;gpa=0.0;credit=0.0;
        scanf("%d",&n);
f]]></description><category></category></item><item><title><![CDATA[HDU-2060]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9877951</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9877951</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:13:37 +0800</pubDate><description><![CDATA[点击打开链接
#include
int f(int n){
    int i,sum;
    sum=0;
if(n<7){
    for(i=0;i<n;i++)
        sum=sum+7-i;
        return sum;
}
else {
    sum=(n-6)*8+27;
    return sum;
}
}
int main (void){
    in]]></description><category></category></item><item><title><![CDATA[HDU-1108]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9877915</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9877915</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:12:20 +0800</pubDate><description><![CDATA[点击打开链接
#include
int main(void){
int a,b,i;
while(scanf("%d%d",&a,&b)!=EOF){
    if(a>b){i=a;a=b;b=i;}
    for(i=a;i>=1;i--)
        if(a%i==0&&b%i==0)break;
    printf("%d\n",a*b/i);
}
return 0;
}]]></description><category></category></item><item><title><![CDATA[HDU-1106]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9877841</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9877841</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:10:36 +0800</pubDate><description><![CDATA[点击打开链接
#include
#include
#include
#include
using namespace std;
int main(void){
   static int i,j,k,d,len,a[1001],temp;
   static char str[1001];
while(scanf("%s",str)!=EOF){
    len=strlen(str);
   ]]></description><category></category></item><item><title><![CDATA[HDU-1076]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9877639</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9877639</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:04:47 +0800</pubDate><description><![CDATA[点击打开链接
#include
int main(void){
int t,yf,n,i,k;
while(scanf("%d",&t)!=EOF){
    while(t--){
        scanf("%d%d",&yf,&n);
        k=0;
        for(i=yf;k!=n;i++){
            if((i%4==0&&i%100!=0)||i]]></description><category></category></item><item><title><![CDATA[HDU-1032]]></title><link>https://blog.youkuaiyun.com/budatu/article/details/9877603</link><guid>https://blog.youkuaiyun.com/budatu/article/details/9877603</guid><author>budatu</author><pubDate>Sat, 10 Aug 2013 15:03:22 +0800</pubDate><description><![CDATA[点击打开链接
#include
int sum;
int fac(int n){
if(n==1)return sum;
else if(n%2==0){n=n/2;sum++;}
else if(n%2!=0){n=3*n+1;sum++;}
    return fac(n);
}
int main(void){
int i,j,n,k,temp,temp2;
while(scanf("%d]]></description><category></category></item></channel></rss>