<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[z_c_d的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/z_c_d</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; z_c_d]]></copyright><item><title><![CDATA[顺序表的基本操作]]></title><link>https://blog.youkuaiyun.com/z_c_d/article/details/114894045</link><guid>https://blog.youkuaiyun.com/z_c_d/article/details/114894045</guid><author>z_c_d</author><pubDate>Tue, 16 Mar 2021 19:12:39 +0800</pubDate><description><![CDATA[顺序表的基本操作主要分为顺序表的初始化，取值，查找，插入，删除。
Status InitList(SqList &amp;L)；
Status GetElem (SqList L,int i,int &amp;e)；
Status LocatElem(SqList L,int e)；
Status ListInsert(SqList &amp;L,int i,int e)；
Status ListDelete (SqList &amp;L,int i)；
其中取值和查找不需要改变顺序表的内容，所以在函数形参]]></description><category></category></item><item><title><![CDATA[ICPC冬令营]]></title><link>https://blog.youkuaiyun.com/z_c_d/article/details/112972478</link><guid>https://blog.youkuaiyun.com/z_c_d/article/details/112972478</guid><author>z_c_d</author><pubDate>Thu, 21 Jan 2021 21:19:40 +0800</pubDate><description><![CDATA[冬令营第四天
第一题

题解
#include &lt;stdio.h&gt;
#include &lt;math.h&gt;
int main(){
    int v,v0,i=1;
    double max=0,a;
    int count=0;
    while(1){
        scanf("%d %d",&amp;v,&amp;v0);
        if(v==0&amp;&amp;v0==0)
            return 0;
        while(v/i&]]></description><category></category></item><item><title><![CDATA[ICPC冬令营]]></title><link>https://blog.youkuaiyun.com/z_c_d/article/details/112910110</link><guid>https://blog.youkuaiyun.com/z_c_d/article/details/112910110</guid><author>z_c_d</author><pubDate>Wed, 20 Jan 2021 20:40:42 +0800</pubDate><description><![CDATA[冬令营第三天
今天学习的主要内容为几何初步。
第一题 Birthday Cake
题干

题解
本题大意为蛋糕上有若干个樱桃，用一条线平均的将其分开，可以用暴力法直接测试出答案。
#include &lt;stdio.h&gt;
int main(){
    int n,z;
    int x[100],y[100];
    scanf("%d",&amp;n);
    for(int i=0;i&lt;2*n;i++){
        scanf("%d %d",&amp;x[i],&amp;y]]></description><category></category></item><item><title><![CDATA[ICPC冬令营]]></title><link>https://blog.youkuaiyun.com/z_c_d/article/details/112854871</link><guid>https://blog.youkuaiyun.com/z_c_d/article/details/112854871</guid><author>z_c_d</author><pubDate>Tue, 19 Jan 2021 23:31:58 +0800</pubDate><description><![CDATA[冬令营第二天
今天学习的主要内容为结构体和指针。
第一题 Maya Calendar POJ
题干
During his last sabbatical, professor M. A. Ya made a surprising discovery about the old Maya calendar. From an old knotted message, professor discovered that the Maya civilization used a 365 day long year,]]></description><category></category></item><item><title><![CDATA[ICPC冬令营]]></title><link>https://blog.youkuaiyun.com/z_c_d/article/details/112795711</link><guid>https://blog.youkuaiyun.com/z_c_d/article/details/112795711</guid><author>z_c_d</author><pubDate>Mon, 18 Jan 2021 21:49:39 +0800</pubDate><description><![CDATA[冬令营第一天
今天学习的主要内容为函数和结构体，因为网络原因写几道具有代表性的题目。
第一题  Specialized Four-Digit Numbers
题干
Find and list all four-digit numbers in decimal notation that have the property that the sum of its four digits equals the sum of its digits when represented in hexadecimal (]]></description><category></category></item></channel></rss>