Who am I? Coming October 18, 2016! 我是谁?2016.10.18 拭目以待! Don't worry. You will be a wow. Don't worry. I will be a wow and I will walk on my new road towards a splendid expert in industrial control. How many roads must a man walk down, before you call…

I. Illegal or Not? time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output The Schengen Agreement was signed by a number of countries to uniform many visa-related questions and to allow tourists fr…

Problem G. Garden Gathering Input file: standard input Output file: standard output Time limit: 3 seconds Memory limit: 512 megabytes Many of you may have been to St. Petersburg, but have you visited Peterhof Palace? It is a collection of splendid pa…

Problem D. Delay Time Input file: standard input Output file: standard output Time limit: 1 second Memory limit: 512 megabytes Petr and Egor are measuring the gravitational acceleration g on their physics lessons using a special device. An electromag…

Matt Pietrek October 1996 MSJ Matt Pietrek is the author of Windows 95 System Programming Secrets (IDG Books, 1995). He works at NuMega Technologies Inc., and can be reached at 71774.362@compuserve.com. QWay back in your July 1994 column, you wrote a…

October 23, 2013 - Fires and smoke in eastern China Satellite: Aqua Date Acquired: 10/12/2013 Resolutions: 1km (556.1 KB)500m (2.1 MB)250m (5.1 MB) Bands Used: 1,4,3 Credit: Jeff SchmaltzMODIS Land Rapid Response Team,NASA GSFC On October 12, 2013 th…

题目链接 思路 这个题和上个题类似,仔细推一下就知道这个题是判断是否是4的倍数 代码 #include<cstdio> #include<iostream> #define fi(s) freopen(s,"r",stdin); #define fo(s) freopen(s,"w",stdout); using namespace std; typedef long long ll; ll read() { ll x = 0,f = 1;c…

题目链接 思路 这个题思路挺巧妙的. 情况一: 首先如果这堆石子的数量是1~5,那么肯定是先手赢.因为先手可以直接拿走这些石子.如果石子数量恰好是6,那么肯定是后手赢.因为先手无论怎样拿也无法直接拿走六个石子. 情况二: 考虑继续推广,如果石子数是7~11,那么先手也能赢.因为先手可以先拿成6,然后就变成了情况1.如果石子数是12,那么一定是后手赢.因为根据上面讨论,当石子数量为6的时候,此时的先手一定输.如果石子数量为12,那么现在的人无论如何也无法拿成6,所以肯定会输. 结论 如果石子数是6…

Codechef October Challenge 2018 游记 CHSERVE - Chef and Serves 题目大意: 乒乓球比赛中,双方每累计得两分就会交换一次发球权. 不过,大厨和小厨用了另外一种规则:双方每累计得 K 分才会交换发球权.比赛开始时,由大厨发球. 给定大厨和小厨的当前得分(分别记为 P1 和 P2),请求出接下来由谁发球. 思路: \((P1+P2)\%K\)判断奇偶性即可. 代码链接 BITOBYT - Byte to Bit 题目大意: 在字节国里有三类居民…

October是一个免费,开源,自托管的基于laravel PHP框架CMS平台.在github平台上laravel应用排名第二,可以拿来研究一下.官方介绍:October是一个内容管理系统(CMS)和Web平台,其唯一目的是使您的开发工作流程简单.它诞生于对现有系统的失望.我们觉得建设网站已经成为一个令人费解和混乱的过程,让开发人员不满意.我们想把你转到更简单的一边,回到基础.下面我们随ytkah来安装测试一下 1.环境需求 PHP version 7.0 或更高 PDO PHP Extens…