codeforces
文章平均质量分 71
小鸡炖蘑菇_
stay hungry,stay foolish.
展开
-
codeforces 515C. Drazil and Factorial
题目链接:http://codeforces.com/problemset/problem/515/C题目意思:给出含有 n 个只有阿拉伯数字的字符串a(可能会有前导0),设定函数F(a) = 每个数字的阶乘乘积。例如 F(135) = 1! * 3! * 5! 。需要找出 x,使得F(x) = F(a),且组成 x 的数字中没有0和1。求最大的 x 为多少。 这个我是看了每个数字的转换才知道怎么做原创 2015-08-22 21:39:57 · 475 阅读 · 0 评论 -
CROC 2016 - Elimination Round (Rated Unofficial Edition)题解
A Amity Assessment传送门 和一个小游戏的规则差不多(忘记游戏的名字是什么了) 如上图,2X2的网格,有一个是空的。前者能否移动成为后者无论怎么移动,ABC的相对顺序是不会变的 将二维网格按顺时针(或逆时针)的顺序转换成一维的,然后判断这两个一维数组中ABC的相对顺序相不相同#include <bits/stdc++.h>#define N 200005#define原创 2016-03-19 08:50:19 · 439 阅读 · 0 评论 -
Experimental Educational Round: VolBIT Formulas Blitz题解
传送门A. Again Twenty Five!输出5^n的最后两位数,随便写几个就能找到规律了#include <bits/stdc++.h>#define ll long longusing namespace std;int main(){ ll n; cin >> n; cout << 25; return 0;}B. Moore’s Law就是求原创 2016-02-20 09:55:30 · 450 阅读 · 0 评论 -
8VC Venture Cup 2016 - Elimination Round题解
A. Robot SequenceCalvin the robot lies in an infinite rectangular grid. Calvin’s source code contains a list of n commands, each either ‘U’, ‘R’, ‘D’, or ‘L’ — instructions to move a single square up,原创 2016-02-16 21:42:47 · 822 阅读 · 0 评论 -
Codeforces Round #341 (Div. 2)题解
A. Wet Shark and Odd and EvenToday, Wet Shark is given n integers. Using any of these integers no more than once, Wet Shark wants to get maximum possible even (divisible by 2) sum. Please, calculate th原创 2016-02-01 14:22:19 · 1041 阅读 · 0 评论 -
Educational Codeforces Round 7 题解
A. Infinite SequenceConsider the infinite sequence of integers: 1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5…. The sequence is built in the following way: at first the number 1 is written out, then the原创 2016-02-13 22:21:33 · 669 阅读 · 0 评论 -
Wunder Fund Round 2016 (Div. 1 + Div. 2 combined)(A、B、C、D)题解
A. Slime CombiningYour friend recently gave you some slimes for your birthday. You have n slimes all initially with value 1. You are going to play a game with these slimes. Initially, you put a single原创 2016-01-30 22:47:09 · 1433 阅读 · 1 评论 -
AIM Tech Round (Div. 2)题解
A. Save LukeLuke Skywalker got locked up in a rubbish shredder between two presses. R2D2 is already working on his rescue, but Luke needs to stay alive as long as possible. For simplicity we will assum原创 2016-02-10 16:38:26 · 1009 阅读 · 0 评论 -
Codeforces Round #340 (Div. 2)题解
A. ElephantAn elephant decided to visit his friend. It turned out that the elephant’s house is located at point 0 and his friend’s house is located at point x(x > 0) of the coordinate line. In one step原创 2016-01-24 11:50:16 · 1327 阅读 · 0 评论 -
Codeforces Round #339 (Div. 2)-C. Peter and Snow Blower
Peter got a new snow blower as a New Year present. Of course, Peter decided to try it immediately. After reading the instructions he realized that it does not work like regular snow blowing machines. I原创 2016-01-15 21:25:24 · 965 阅读 · 0 评论 -
codeforces535C:Tavas and Karafs(二分)
codeforces535C:Tavas and Karafs(二分)原创 2015-08-09 14:48:28 · 656 阅读 · 0 评论 -
Codeforces548C:Mike and Frog
Codeforces548C:Mike and Frog原创 2015-08-09 18:05:10 · 722 阅读 · 0 评论 -
Codeforce 515 B . Drazil and His Happy Friends
传送门:http://codeforces.com/contest/515/problem/B 题目大意:给出一个n,m,代表男女的数量,第i天让i%n号男和i%m号女约会,如果他们其中有一个人是 开心的,那么另一个人也会变开心,问能否通过有限次约会让他们都开心。 题目分析:直接模拟100000次,然后判断是否依旧存在不开心的人即可,因为存在循环节,懒得算循环节长度,所以直接100000了。。。原创 2015-08-22 21:46:26 · 532 阅读 · 0 评论 -
Codeforces Round #345 (Div. 2)题解
A. Joysticks传送门#include <bits/stdc++.h>#define ll long long#define N 100using namespace std;int main(){#ifndef ONLINE_JUDGE// freopen("1.txt", "r", stdin);#endif int i, j, k; int a1, a2原创 2016-03-07 19:31:05 · 535 阅读 · 0 评论