<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[studydaydayup的专栏]]></title><description><![CDATA[好好学习，day day up!]]></description><link>https://blog.youkuaiyun.com/studydaydayup</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; studydaydayup]]></copyright><item><title><![CDATA[城市信息实习题]]></title><link>https://blog.youkuaiyun.com/studydaydayup/article/details/326229</link><guid>https://blog.youkuaiyun.com/studydaydayup/article/details/326229</guid><author>studydaydayup</author><pubDate>Tue, 22 Mar 2005 09:24:00 +0800</pubDate><description><![CDATA[将若干城市的信息存入一个带头结点的单链表，结点中的城市信息包括城市名、城市的位置坐标。要求：(1)给定一个城市名，返回其位置坐标；(2)给定一个位置坐标P和一个距离D,返回所有与P距离小于等于D的城市。#include #include #include #define MAXSIZE 20typedef struct city { char name[MAXSIZE]; float x; flo]]></description><category></category></item><item><title><![CDATA[Josephus约瑟夫环问题]]></title><link>https://blog.youkuaiyun.com/studydaydayup/article/details/326048</link><guid>https://blog.youkuaiyun.com/studydaydayup/article/details/326048</guid><author>studydaydayup</author><pubDate>Mon, 21 Mar 2005 22:34:00 +0800</pubDate><description><![CDATA[求解Josephus问题：设有n个数构成一个环链，现从第k个数开始数数，数到m的那个数被弹出，然后从该数的下一个数重新开始数数，数到m的那个数又被弹出，如此重复，直到所有的数均被弹出为止。输出这些数弹出的序列。#include #include #define MAXSIZE 100typedef struct Node { int no; int m; struct Node *next;} N]]></description><category></category></item></channel></rss>