题意:两只青蛙在同一纬度上(就是圆圈上)不同位置,具有不同的速度,看几次能跳的一起
解析:设经过t次调到一起,(xm*t)mod L(yn*t) mod L
上式整理一下 (xm*t)-(yn*t)p*L;(p是两只青…
这个题主要就是看你会不会用Map容器了。。。
给你 一些字符串 如下
B XX A
C XX A
D XX A
E XX B
让你计算从A开始最多可以沿着某一条路径传播多少个人
代码如下: #include <iostream>
#include <cstdio>
#include <queue>
#include <c…
这学期的《程序设计专题》看来不是太水,给的项目是写一个迷宫寻路算法,也不知对不对,第一节课下去就给搞了一个。
#include <iostream> #include <memory> #include <stack> int map[20][20];//1-permit 0-not int n, m;…
Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave … The bone collector had a big bag with a volume of V ,and …
Linux 中最重要的软件开发工具是 GCC。GCC 是 GNU 的 C 和 C 编译器。实际上,GCC 能够编译三种语言:C、C 和 Object C(C 语言的一种面向对象扩展)。利用 gcc 命令可同时编译并连接 C 和 C 源程序。GCC 可同时用来编译 C 程序和 C …
POJ题目地址 Sum of Consecutive Prime Numbers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 26954 Accepted: 14544 Description Some positive integers can be represented by a sum of one or more consecutive prime numbers. How many such represen…
也许更好的阅读体验 D e s c r i p t i o n \mathcal{Description} Description 给你一棵有 n n n 个结点的树,定义 G k G_k Gk为将在原树中所有距离大于等于 k k k 的点对间连一条无向边所构成的无向图(距离定义为简单路径中边的数量)。…
Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of squares. Regrettably, some of the squares are infertile and can’t be plan…
You are given a sequence of n integers a1 , a2 , … , an in non-decreasing order. In addition to that, you are given several queries consisting of indices i and j (1 ≤ i ≤ j ≤ n). For each query, determine the most frequent value among the integers ai ,…
ACM Study Note
座右铭:
Life is like a watch , you can return to the starting point , they are not yeserday!
All endings are beginnings, we just don’t know it at the time! 人生是一场不需要彩排的电影,而你就是主角,你的人生…
Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 题目大意 给你个罗马数字,把它转换成一个int数。输入限定在[1, 3999]。 难度系数:容易 实现 一次性通过,:&#…
E. Distance Learning Courses in MAC time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The New Year has arrived in the Master’s Assistance Center, which means it’s time to introduce a new feature…
It is well known that Keima Katsuragi is The Capturing God because of his exceptional skills and experience in ‘‘capturing’’ virtual girls in gal games. He is able to play k games simultaneously. One day he gets a new gal game named ‘‘XX island’’. …
There is an infinite sequence consisting of all positive integers in the increasing order: p {1, 2, 3, …}. We performed n swap operations with this sequence. A swap(a, b) is an operation of swapping the elements of the sequence on positions a and b…
1. 编程题1
Little Hi is playing a video game. Each time he accomplishes a quest in the game, Little Hi has a chance to get a legendary item.At the beginning the probability is P%. Each time Little Hi accomplishes a quest without getting a legendary item, …
题目: Zero Time Limit:1000MS Memory Limit:30000KB
Description A long time ago people found the value zero to be very useful. Just think about the romans and many more nations that didnt know the zero. Their number representations couldnt disp…
比赛完由于被旅游、赶ddl、上班等等各种事情影响,导致我现在才有时间可以写写小作文,这中间隔得时间有点长了,已经不知道从哪开始说起了,灵感也都流失了…
before Friday
比赛前一个周,我的队友djk,也是我…
也许更好的阅读体验 D e s c r i p t i o n \mathcal{Description} Description n n n 个球排成一列,每个球都有自己的颜色,每个球的颜色都互不相同,且均在 [ 1 , n ] [1,n] [1,n]范围内,第 i i i 个球的颜色为 c i c_i ci…
也许更好的阅读体验 D e s c r i p t i o n \mathcal{Description} Description 给 n n n对区间,要求每对区间恰好选一个使得选出来的 n n n个区间有交集,问有多少方案数 1 ≤ n , l i , r i ≤ 5 1 0 5 1\le n, l_i,r_i\le 510^5 1≤n,li,ri≤510…
也许更好的阅读体验 D e s c r i p t i o n \mathcal{Description} Description n n n个物品有长和宽, m m m个盒子也有长和宽,一个盒子最多可以装一个物品,问 n n n个物品能否都放进盒子,物品和盒子不能旋转 S o l u t i o n \…