<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[姜南的代码库]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/slyar0047</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; slyar0047]]></copyright><item><title><![CDATA[bnu1331 赈灾捐款 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646166</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646166</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:12:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1331 赈灾捐款C语言版#include #include int n=0;struct man{    char name[51];    __int64 money;}a[101];int find(char x[]){    int i;    for (i=1;i        if (strcmp(x,a[i].nam]]></description><category></category></item><item><title><![CDATA[bnu1326 乒乓游戏 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646164</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646164</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:11:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1326 乒乓游戏C语言版#include int calc(int x,int y){    if((x-30)*(x-30)+(y-30)*(y-30)return 1;    else if ((x-100)*(x-100)+(y-30)*(y-30)return 2;    else if ((x-170)*(x-170)]]></description><category></category></item><item><title><![CDATA[bnu1322 长方体表面积 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646160</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646160</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:10:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1322 长方体表面积C语言版#include int main(){    int t,a,b,c,s;    scanf("%d",&t);    while(t--){        scanf("%d%d%d",&a,&b,&c);        s=2*(a*b+a*c+b*c);        printf("%d/n]]></description><category></category></item><item><title><![CDATA[bnu1312 字符游戏 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646155</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646155</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:09:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1312 字符游戏C语言版#include #include int main(){    int i,n;    char a[10001];    while(1){        scanf("%d",&n);        if(!n) break;        getchar();        gets(a);   ]]></description><category></category></item><item><title><![CDATA[bnu1310 排队 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646151</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646151</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:08:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1310 排队C语言版#include int main(){    int i,j,m,n,max,a[10001],sum[10001];    scanf("%d",&m);    while(m--){        max=0;        scanf("%d",&n);        for(i=1;i"%d",&a]]></description><category></category></item><item><title><![CDATA[bnu1309 Mp3 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646147</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646147</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:07:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1309 Mp3C语言版#include #include struct{    char name[11];}a[1001];int find(char x[],int l){    int i;    for (i=1;i        if (strcmp(x,a[i].name)==0) return 1;    retu]]></description><category></category></item><item><title><![CDATA[bnu1308 空调 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646142</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646142</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:06:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1308 空调C语言版#include int main(){    char x[1];    int m,k,sign;    double p,u,i,y;    scanf("%d",&m);    while(m--){        p=u=i=0;        for(k=1;k            scanf(]]></description><category></category></item><item><title><![CDATA[bnu1254 YAO vs YI C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646135</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646135</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:05:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1254 YAO vs YIC语言版#include int main(){    int n;    while(1){        scanf("%d",&n);        if (n==0) break;        if (n==3||n==5||n==7||n==10||n==11) printf("YI win]]></description><category></category></item><item><title><![CDATA[bnu1252 缩短的时间 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646127</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646127</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:04:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1252 缩短的时间C语言版#include #include #define c 300000000int main(){    int n;    double t,v,x;    scanf("%d",&n);    while(n--){        scanf("%lf%lf",&t,&v);        x=t*c]]></description><category></category></item><item><title><![CDATA[bnu1251 采蝶轩 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646122</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646122</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:04:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1251 采蝶轩C语言版#include int main(){    int i,j,n,m,p[21],q[21],x,r,nr,pay=0;    scanf("%d",&n);    for (i=0;i"%d%d",&p[i],&q[i]);    scanf("%d",&m);    while(m--){      ]]></description><category></category></item><item><title><![CDATA[bnu1250 区间和 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646115</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646115</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:03:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1250 区间和C语言版#include int main(){    int x,y;    while(1){        scanf("%d%d",&x,&y);        if ((x==-1)&&(y==-1)) break;        printf("%d/n",(x+y)*(y-x+1)/2);    } ]]></description><category></category></item><item><title><![CDATA[bnu1249 一元二次方程 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646112</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646112</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:02:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1249 一元二次方程C语言版#include int main(){    int a,b,c,x,y,s;    while(1){        s=0;        scanf("%d%d",&x,&y);        if (x==0&&y==0) break;        for (a=1;a        fo]]></description><category></category></item><item><title><![CDATA[bnu1248 蜗牛宝宝 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3646101</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3646101</guid><author>slyar0047</author><pubDate>Tue, 30 Dec 2008 12:01:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1248 蜗牛宝宝C语言版#include #include int main(){    char name[51]={};    while(1){        gets(name);        if (strcmp(name,"END")==0) break;        switch(name[0]){      ]]></description><category></category></item><item><title><![CDATA[bnu1247 能量矿石 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3640826</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3640826</guid><author>slyar0047</author><pubDate>Mon, 29 Dec 2008 23:29:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1247 能量矿石C语言版#include #include int main(){    double h1,h2,r1,r2,v1,v2,pi;    int i;    pi=acos(-1);    for (i=1;i        scanf("%lf%lf%lf",&h1,&r1,&h2);        r2=(h]]></description><category></category></item><item><title><![CDATA[bnu1246 倒背如流 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3640820</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3640820</guid><author>slyar0047</author><pubDate>Mon, 29 Dec 2008 23:28:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1246 倒背如流C语言版#include #include int main(){    char a[101],b[101];    int i,j,sign;    while(1){        scanf("%s %s",&a,&b);        if(strcmp(a,"End")==0&&strcmp(b,"E]]></description><category></category></item><item><title><![CDATA[bnu1244 求合数 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3640809</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3640809</guid><author>slyar0047</author><pubDate>Mon, 29 Dec 2008 23:27:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1244 求合数C语言版#include int main(){    int i,j;    char a[800001]={0};    for(i=2;i        if (a[i]) printf("%d/n",i);        else for(j=2;i*j    }    return 0;}]]></description><category></category></item><item><title><![CDATA[bnu1237 Cantor表 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3640798</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3640798</guid><author>slyar0047</author><pubDate>Mon, 29 Dec 2008 23:26:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1237 Cantor表C语言版#include int main(){    long i=0,n;    scanf("%ld",&n);    while (i        n-=i;        i++;    }    if (i%2==0) printf("%d/%d",n,i+1-n);    else prin]]></description><category></category></item><item><title><![CDATA[bnu1219 津津的储蓄计划 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3640788</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3640788</guid><author>slyar0047</author><pubDate>Mon, 29 Dec 2008 23:25:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1219 津津的储蓄计划C语言版#include int main(){    int i,j,save,now,cost,sign;    while(1){        save=now=sign=0;        for (i=1;i            now+=300;            if(scanf("%]]></description><category></category></item><item><title><![CDATA[bnu1218 古罗马信息化 C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3640781</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3640781</guid><author>slyar0047</author><pubDate>Mon, 29 Dec 2008 23:23:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1218 古罗马信息化C语言版#include #include int main(){    struct{        char w[10];    }a[51]={"0","I","II","III","IV","V","VI","VII","VIII","IX","X","XI","XII","XIII","XIV","]]></description><category></category></item><item><title><![CDATA[bnu1215 What day is today C语言版]]></title><link>https://blog.youkuaiyun.com/slyar0047/article/details/3640776</link><guid>https://blog.youkuaiyun.com/slyar0047/article/details/3640776</guid><author>slyar0047</author><pubDate>Mon, 29 Dec 2008 23:22:00 +0800</pubDate><description><![CDATA[北京师范大学珠海分校Judge Online of ACM ICPC1215 What day is todayC语言版#include int main(){    char week[8][11]={"Wrong Date","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"};    int now,i]]></description><category></category></item></channel></rss>