<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[不是很懂你们二次元]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; CHRISTINA_ERZA]]></copyright><item><title><![CDATA[关于奇偶检验为什么用归约异或]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/126744434</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/126744434</guid><author>CHRISTINA_ERZA</author><pubDate>Wed, 07 Sep 2022 14:24:54 +0800</pubDate><description><![CDATA[所以针对一个二进制数做归约异或的时候可以把0当作两个1，再把相邻的两个1当作0。显然当1的个数为奇数个时，最后替换完前面都是0末尾为1，归约异或结果为1。当1的个数为偶数个时，替换为全0，归约异或结果为0。综上所述，归约异或的结果跟数据中包含的1的个数有关，当1是偶数个时结果为0，1是奇数个时结果为1。所以想把我的想法简单记录一下。异或简而言之相同为0不同为1。4，数据的0和1调换位置不影响最终的结果。1，只有0和1相异或结果才会为1。2，一串0做归约异或结果为0。3，两个1做异或结果为0。]]></description><category></category></item><item><title><![CDATA[LightOJ 1294 - Positive Negative Sign]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52294055</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52294055</guid><author>CHRISTINA_ERZA</author><pubDate>Tue, 23 Aug 2016 20:14:34 +0800</pubDate><description><![CDATA[1294 - Positive Negative Sign





Description


Given two integers:nandmandnis divisible by2m, you have to write down the firstnnatural numbers in the following form. At first take ]]></description><category></category></item><item><title><![CDATA[LightOJ 1043 - Triangle Partitioning]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52294018</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52294018</guid><author>CHRISTINA_ERZA</author><pubDate>Tue, 23 Aug 2016 20:13:01 +0800</pubDate><description><![CDATA[1043 - Triangle Partitioning





PDF (English)
Statistics
Forum








Time Limit: 0.5 second(s)
Memory Limit: 32 MB






See the picture below.




You are given AB, ]]></description><category></category></item><item><title><![CDATA[LightOJ 1008 Fibsieve`s Fantabulous Birthday]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52294010</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52294010</guid><author>CHRISTINA_ERZA</author><pubDate>Tue, 23 Aug 2016 20:08:18 +0800</pubDate><description><![CDATA[Description

Fibsieve had a fantabulous (yes, it's an actual word) birthday party this year. He had so many gifts that he was actually thinking of not having a party next year.
Among these gifts th]]></description><category></category></item><item><title><![CDATA[CodeForces 597A  Divisibility]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52293971</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52293971</guid><author>CHRISTINA_ERZA</author><pubDate>Tue, 23 Aug 2016 20:02:52 +0800</pubDate><description><![CDATA[Divisibility


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



Find the number of k-divisible numbers on the s]]></description><category></category></item><item><title><![CDATA[CodeForces 366A	Dima and Guards]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52280275</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52280275</guid><author>CHRISTINA_ERZA</author><pubDate>Mon, 22 Aug 2016 20:55:43 +0800</pubDate><description><![CDATA[Dima and Guards
Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d
 & %I64u
Submit Status Practice CodeForces
 366A





Description

Nothing has changed since the last ]]></description><category></category></item><item><title><![CDATA[CodeForces 658A	Bear and Reverse Radewoosh]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52280155</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52280155</guid><author>CHRISTINA_ERZA</author><pubDate>Mon, 22 Aug 2016 20:52:22 +0800</pubDate><description><![CDATA[Bear and Reverse Radewoosh
Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d
 & %I64u
Submit Status Practice CodeForces
 658A





Description

Limak and Radewoosh are ]]></description><category></category></item><item><title><![CDATA[CodeForces 554B	Ohana Cleans Up]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52280115</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52280115</guid><author>CHRISTINA_ERZA</author><pubDate>Mon, 22 Aug 2016 20:48:43 +0800</pubDate><description><![CDATA[Ohana Cleans Up
Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d
 & %I64u
Submit Status Practice CodeForces
 554B





Description

Ohana Matsumae is trying to clean a]]></description><category></category></item><item><title><![CDATA[CodeForces 660A	Co-prime Array]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52280000</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52280000</guid><author>CHRISTINA_ERZA</author><pubDate>Mon, 22 Aug 2016 20:34:12 +0800</pubDate><description><![CDATA[A - Co-prime Array
Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d
 & %I64u
Submit Status Practice CodeForces
 660A





Description

You are given an array of n elem]]></description><category></category></item><item><title><![CDATA[南理oj 不是匹配]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52273760</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52273760</guid><author>CHRISTINA_ERZA</author><pubDate>Mon, 22 Aug 2016 08:53:16 +0800</pubDate><description><![CDATA[不是匹配
时间限制：1000 ms  |  内存限制：65535 KB





描述
 有N个人,N个活动， 每个人只会对2个或者3个活动感兴趣，
 每个活动也只有两个人或者两个活动对它兴趣，每个人参加一个
 感兴趣的活动需要一天 ，且当天该活动被参加时，其他的人不能参加
 如果每个人都参加完自己有兴趣的活动，应当怎样安排使得所用总天数时间最短
2




输入]]></description><category></category></item><item><title><![CDATA[HDJ 1856 More is better]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52214840</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52214840</guid><author>CHRISTINA_ERZA</author><pubDate>Mon, 15 Aug 2016 21:34:47 +0800</pubDate><description><![CDATA[More is better
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 327680/102400 K (Java/Others)
Total Submission(s): 24651    Accepted Submission(s): 8849



Problem Description

Mr Wang ]]></description><category></category></item><item><title><![CDATA[HDOJ 1325 Is It A Tree?]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52214786</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52214786</guid><author>CHRISTINA_ERZA</author><pubDate>Mon, 15 Aug 2016 21:17:53 +0800</pubDate><description><![CDATA[Is It A Tree?
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 22086    Accepted Submission(s): 4996



Problem Description

A tree is a]]></description><category></category></item><item><title><![CDATA[HDOJ 1272 小希的迷宫]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52214456</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52214456</guid><author>CHRISTINA_ERZA</author><pubDate>Mon, 15 Aug 2016 21:10:28 +0800</pubDate><description><![CDATA[小希的迷宫
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 44066    Accepted Submission(s): 13614



Problem Description

上次Gardon的迷宫城堡小希玩了很]]></description><category></category></item><item><title><![CDATA[HDOJ 1213 How Many Tables]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52214426</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52214426</guid><author>CHRISTINA_ERZA</author><pubDate>Mon, 15 Aug 2016 20:30:45 +0800</pubDate><description><![CDATA[How Many Tables
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 24893    Accepted Submission(s): 12427



Problem Description

Today is]]></description><category></category></item><item><title><![CDATA[HDOJ 1232 畅通工程]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52214315</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52214315</guid><author>CHRISTINA_ERZA</author><pubDate>Mon, 15 Aug 2016 20:27:44 +0800</pubDate><description><![CDATA[畅通工程
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 47393    Accepted Submission(s): 25219



Problem Description

某省调查城镇交通状况，得到现有城镇道路]]></description><category></category></item><item><title><![CDATA[HDOJ 1155 Bungee Jumping]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52200479</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52200479</guid><author>CHRISTINA_ERZA</author><pubDate>Sat, 13 Aug 2016 17:23:07 +0800</pubDate><description><![CDATA[Bungee Jumping
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1126    Accepted Submission(s): 476



Problem Description

Once again, ]]></description><category></category></item><item><title><![CDATA[LightOJ1104 birthday parado（经典概率）]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52200443</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52200443</guid><author>CHRISTINA_ERZA</author><pubDate>Sat, 13 Aug 2016 17:20:34 +0800</pubDate><description><![CDATA[Description

Sometimes some mathematical results are hard to believe. One of the common problems is the birthday paradox. Suppose you are in a party where there are 23 people including you. What is]]></description><category></category></item><item><title><![CDATA[LightOJ 1058 Parallelogram Counting（数学）]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52200359</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52200359</guid><author>CHRISTINA_ERZA</author><pubDate>Sat, 13 Aug 2016 17:14:03 +0800</pubDate><description><![CDATA[Description

There are n distinct points in the plane, given by their integer coordinates. Find the number of parallelograms whose vertices lie on these points. In other words, find the number of 4-]]></description><category></category></item><item><title><![CDATA[HDOJ 1061 Rightmost Digit]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52195177</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52195177</guid><author>CHRISTINA_ERZA</author><pubDate>Fri, 12 Aug 2016 20:47:20 +0800</pubDate><description><![CDATA[Rightmost Digit
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 48109    Accepted Submission(s): 18247



Problem Description

Given a]]></description><category></category></item><item><title><![CDATA[HDOJ 2035 人见人爱A^B]]></title><link>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52195148</link><guid>https://blog.youkuaiyun.com/CHRISTINA_ERZA/article/details/52195148</guid><author>CHRISTINA_ERZA</author><pubDate>Fri, 12 Aug 2016 20:44:22 +0800</pubDate><description><![CDATA[人见人爱A^B
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 35605    Accepted Submission(s): 24216



Problem Description

求A^B的最后三位数表示的整数。]]></description><category></category></item></channel></rss>