2017 年 7月 30 日随笔档案 - 岩扉

摘要： Poj1142 Smith NumbersSmith Numbers Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 13854 Accepted: 4716 Descr... 阅读全文

posted @ 2017-07-30 21:58 岩扉阅读(218) 评论(0) 推荐(0)

摘要：容斥模板代码，int solve(){ int ans = 0; //是那四个数的倍数的数的数量 for (int i = 1 ; i < (1<<4) ; i++) //选数 { int ant = 0; //选中数的数量 int k = 1; /... 阅读全文

posted @ 2017-07-30 21:01 岩扉阅读(233) 评论(0) 推荐(0)

摘要： Halloween treatsEvery year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sw... 阅读全文

posted @ 2017-07-30 14:17 岩扉阅读(182) 评论(0) 推荐(0)

摘要： Find a multiple The input contains N natural (i.e. positive integer) numbers ( N int a[10010],sum[10010];int main(){ int n; whil... 阅读全文

posted @ 2017-07-30 11:24 岩扉阅读(205) 评论(0) 推荐(0)

摘要： Patrick and Shopping今天 Patrick 等待着他的朋友 Spongebob来他家玩。为了迎接 Spongebob，Patrick 需要去他家附近的两家商店买一些吃的。他家离第一家商店有d1米远，离第二家商店有d2米远。还有，两家商店之间的距离... 阅读全文

posted @ 2017-07-30 09:23 岩扉阅读(276) 评论(0) 推荐(0)

摘要： In this problem you are to calculate the sum of all integers from 1 to n, but you should take all powers of two with minus in the sum.... 阅读全文

posted @ 2017-07-30 09:15 岩扉阅读(244) 评论(0) 推荐(0)

岩扉