摘要：
escription Lfx在复习离散的时候突然想到了一个算法题，毕竟是lfx， 算法题如下： 他想知道这样的问题，先定义1~n中即是3的倍数，又是11的倍数的那些数的和sum， 他想知道sum有多少个质因子，以及1~sum-1中有多少个数与sum互质？ 1<= N <= 1e6 输入： 一个整数n 阅读全文
posted @ 2019-02-17 23:36
茄子Min
阅读(252)
评论(0)
推荐(0)
摘要：
E. Magic Stones time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output E. Magic Stones time limi 阅读全文
posted @ 2019-02-08 14:43
茄子Min
阅读(421)
评论(0)
推荐(0)
摘要：
A continued fraction of height n is a fraction of form . You are given two rational numbers, one is represented as and the other one is represented as 阅读全文
posted @ 2019-01-30 21:50
茄子Min
阅读(208)
评论(0)
推荐(0)
摘要：
D - Various Sushi Time Limit: 2 sec / Memory Limit: 1024 MB Score : 400400 points Problem Statement There are NN pieces of sushi. Each piece has two p 阅读全文
posted @ 2019-01-30 15:39
茄子Min
阅读(457)
评论(0)
推荐(0)
摘要：
链接：https://ac.nowcoder.com/acm/contest/330/G来源：牛客网 Applese 的毒气炸弹 Applese 的毒气炸弹 时间限制：C/C++ 2秒，其他语言4秒 空间限制：C/C++ 262144K，其他语言524288K 64bit IO Format: %l 阅读全文
posted @ 2019-01-29 23:55
茄子Min
阅读(225)
评论(0)
推荐(0)
摘要：
As you might remember from the previous round, Vova is currently playing a strategic game known as Rage of Empires. Vova managed to build a large army 阅读全文
posted @ 2019-01-29 00:20
茄子Min
阅读(395)
评论(0)
推荐(0)
摘要：
You are given an array a consisting of n elements. The imbalance value of some subsegment of this array is the difference between the maximum and mini 阅读全文
posted @ 2019-01-28 22:15
茄子Min
阅读(518)
评论(0)
推荐(0)
摘要：
Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants to count 阅读全文
posted @ 2019-01-28 20:49
茄子Min
阅读(312)
评论(0)
推荐(0)
摘要：
Bill is developing a new mathematical theory for human emotions. His recent investigations are dedicated to studying how good or bad days influent peo 阅读全文
posted @ 2019-01-28 16:09
茄子Min
阅读(385)
评论(0)
推荐(0)
摘要：
A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different h 阅读全文
posted @ 2019-01-28 11:35
茄子Min
阅读(279)
评论(0)
推荐(0)
浙公网安备 33010602011771号