题目链接:https://cn.vjudge.net/problem/Gym-101490I 题目大意:给你一个整数,问你这个整数能不能表示成一个素数的k次方? 具体思路:对于每一个数,我们先判断他是不是素数,如果是素数的话,就一定可以.其次,我们看一下当前的这个数能不能唯一的素因数分解. PS:因为题目数据量是1e9,我们不可能跑一个1e9的素数筛,这样的话肯定会超时,对于每一个进来的数,我们先判断他是不是素数,如果是素数的话,输出yes.否则,就跑1e6之前的素数,看能不能分解就可以了. A…

Problem D. Digits 题目连接: http://codeforces.com/gym/100531/attachments Description Little Petya likes integers. Recently he has learned about different properties of sums of number's digits. For example, if the sum of number's digits is divisible by 9,…

Toy Cars time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Little Susie, thanks to her older brother, likes to play with cars. Today she decided to set up a tournament between them. The proce…

Counting ones Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB Total submit users: 18, Accepted users: 16 Problem 13030 : No special judgement Problem description Carl is right now the happiest child in the world: he has just learn…

A. Toy Cars time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Little Susie, thanks to her older brother, likes to play with cars. Today she decided to set up a tournament between them. The pr…

Season 1, Episode 16 -Burrows:Don't be. It's not your fault. 不要,不是你的错 -Fernando: Know what I like? 知道我喜欢什么? -Maricruz: Hmm? 恩 -Fernando: How after we make love... 我们做完以后 you get this little puddle of water in your belly button. puddle: 水坑  belly: 腹部,…

From missionary to firebrand   杜叶锡恩(1913年(癸丑年)-2015年(乙未年),英文名字Elsie Hume Elliot Tu,丈夫是教育家杜学魁.她是香港著名的社会运动家及教育工作者,四十年多年来一直服务香港和为社会基层争取权益.她虽然生于英国,但操得一口流利的广东话和普通话.叶锡恩生于英国纽卡斯尔,1948年被普利茅斯弟兄会派往中国江西省南昌传教.1951年杜叶锡恩前往香港,在香港创立慕光英文书院,为1950年代的香港市民提供教育.1963年至1995年…

D - Toy Cars Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u Submit Status Description Little Susie, thanks to her older brother, likes to play with cars. Today she decided to set up a tournament between them. The proces…

A. Airport Logistics 根据光路最快原理以及斯涅尔定律,可以得到从定点$P$进入某条直线的最佳入射角. 求出每个端点到每条线段的最佳点,建图求最短路即可. 时间复杂度$O(n^2\log n)$. #include<cstdio> #include<cmath> #include<algorithm> #include<vector> #include<queue> using namespace std; typedef pa…

I. Older Brother Your older brother is an amateur mathematician with lots of experience. However, his memory is very bad. He recently got interested in linear algebra over finite fields, but he does not remember exactly which finite fields exist. For…