关闭

Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2) A-C题解

A. Search for Pretty Integers time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are given two lists of non-zero digits. Let's call an integer pretty if its (base 10) representation has at least on...
阅读(195) 评论(0)

Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) A-D题解

A. Trip For Meal time limit per test1 second memory limit per test512 megabytes inputstandard input outputstandard output Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and...
阅读(256) 评论(0)

USACO Milking Cows (模拟)

Milking Cows Three farmers rise at 5 am each morning and head for the barn to milk three cows. The first farmer begins milking his cow at time 300 (measured in seconds after 5 am) and ends at time 1000. The second farmer begins at time 700 and ends at time...
阅读(391) 评论(0)

Codeforces Round #436 (Div. 2) A-D题解

Codeforces Round #436 (Div. 2) A. Fair Game B.Polycarp and Letters C. Bus D. Make a Permutation!...
阅读(306) 评论(0)

ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 G Bounce (规律)

Bounce 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 For Argo, it is very interesting watching a circle bouncing in a rectangle. As shown in the figure below, the rectangle is divided into N×M grids, and the circle fits exactly one grid. The bouncing rule is sim...
阅读(709) 评论(1)

ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 A Visiting Peking University

Visiting Peking University 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 Ming is going to travel for n days and the date of these days can be represented by n integers: 0, 1, 2, …, n-1. He plans to spend m consecutive days(2 ≤ m ≤ n)in Beijing. During these m days...
阅读(660) 评论(0)

2017 ACM-ICPC 亚洲区(西安赛区)网络赛 C.Sum

Define the function S(x)S(x) for xx is a positive integer. S(x)S(x) equals to the sum of all digit of the decimal expression of xx. Please find a positive integer kk that S(k*x)\%233=0S(k∗x)%233=0. Input Format First line an integer TT, indicates the num...
阅读(267) 评论(0)

NEU 1008 Friends number

1008: Friends number 时间限制: 1 Sec 内存限制: 128 MB 提交: 715 解决: 214 [提交][状态][讨论版] 题目描述 Paula and Tai are couple. There are many stories between them. The day Paula left by airplane, Tai send one message to telephone 2200284, then, everything is changing… (...
阅读(301) 评论(0)

Codeforces Round #430 (Div. 2) 签到题

传送门:点击打开链接 A. Kirill And The Game time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Kirill plays a new c...
阅读(415) 评论(0)

Educational Codeforces Round 27 A—D 题解

这里是传送门 A. Chess Tourney time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Berland annual chess tournament...
阅读(594) 评论(0)

GYM 101086 A,F,G,H,L 题解

A. My Friend of Misery time limit per test 3.0 s memory limit per test 256 MB input standard input output standard output With the SCPC2015 getting closer, Noura Boubou,...
阅读(425) 评论(0)

中石油 暑期集训个人赛 水题部分

签到题A 问题 A: 公鸡打鸣 时间限制: 1 Sec  内存限制: 128 MB 提交: 292  解决: 85 [提交][状态][讨论版] 题目描述 鸡国中有两只最喜欢打鸣的公鸡 G1 和 G2,它们每一次打鸣都有一个声音的响度值。 一天清晨,G1 开始先开始打鸣,响度值为 x,G2 听到 G1 的打鸣后也开始打鸣,响度值为y。G1 和 G2 很想把它们打鸣声音的响度值调...
阅读(230) 评论(1)

CodeForce Round #479 A. Karen and Morning

A. Karen and Morning time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard output Karen is getting ready...
阅读(125) 评论(0)

2017 山东理工第九届校赛 J LL

LL Time Limit: 100MS Memory Limit: 65536KB Submit Statistic Problem Description 这一天希酱又补了一卦,没想到每个人都发到了一张印有整数的牌,现在希酱想要继续占卜的话需要知道每个人手里拿的牌的整数具体是多少,但是她们却打起了哑谜。    穗乃果:我拿到的是 2...
阅读(190) 评论(0)

2017 山东理工第九届校赛 C 康纳的表情包

康纳的表情包 Time Limit: 1000MS Memory Limit: 65536KB Submit Statistic Problem Description UMR 现在手里有 n 张康纳的表情,最上面一张是玛吉呀巴库乃。现在 UMR 如果每次把最上面的 m 张牌移到最下面而不改变他们的顺序及朝向,那么至少经过多少次移动玛吉呀巴库乃才会又出现在最上面呢? 3917 Input 多组输入。 每组输入以空格分隔的两个整数 n 和 m(题目中所提及的)。 1 <= n, m <= 10^9 Out...
阅读(479) 评论(1)
29条 共2页1 2 下一页 尾页
    个人资料
    • 访问:35821次
    • 积分:1617
    • 等级:
    • 排名:千里之外
    • 原创:129篇
    • 转载:1篇
    • 译文:0篇
    • 评论:13条
    联系方式
    欢迎谈论交流:1245985209
    博客专栏
    最新评论