OtterVのrecorder

Problem 1759 Super A^B mod CAccept: 1682    Submit: 5719Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem DescriptionGiven A,B,C, You should quickly calculate the result of A^B mod C. (1...

 Now Loading!!! ZOJ - 4029  题目大意：对于每次问询求那个公式的结果，最后输出每次问询*第几次的和。记得之前组队训练时遇到过一次，当时同队的学姐提出了log的预处理，我想到了log的范围只有1~30，但是没再想下去。顺着上面的想法，我们就会想到预处理出a数组在每个log情况下的前缀和。对于每次问询，处理p的每个次方段里的a数组，每段里分母一样，...

Recently, Mr. Big recieved n owers from his fans. He wants to recolor those owers with m colors. The owers are put in a line. It is not allowed to color any adjacent owers with the same color. Flowers...

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5750In a highly developed alien society, the habitats are almost infinite dimension...

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5748Given two positive integers a and b, find suitableX and Y to meet the conditi...

Poor God Water 1000ms  65536KGod Water likes to eat meat, fish and chocolate very much, but unfortunately, the doctor tells him that some sequence of eating will make them poisonous.Every hour, ...

2021: ExponialSubmit Page    Summary    Time Limit: 1 Sec     Memory Limit: 512 Mb     Submitted: 243     Solved: 98    DescriptionEverybody loves big numbers (if you do not, you might want to s...

青蛙的约会Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 128770   Accepted: 28142 Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前...

Maximum MultipleTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0    Accepted Submission(s): 0 Problem DescriptionGiven an integer n, Ch...

Reading comprehensionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3106    Accepted Submission(s): 1218 Problem DescriptionRead the pr...

#1195 : 高斯消元·一时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Ho：喂不得了啦，那边便利店的薯片半价了!小Hi：啥?!小Ho：那边的便利店在打折促销啊。小Hi：走走走，赶紧去看看=v=于是小Hi和小Ho来到了便利店。老板为了促销，推出了组合包的形式，将不同数量的各类商品打包成一个组合，顾客可以选择组合进行购买。比如2袋薯...

Find IntegerTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 6597    Accepted Submission(s): 1999Special JudgeProblem Descriptionpeople in...

1079 中国剩余定理基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题一个正整数K，给出K Mod 一些质数的结果，求符合条件的最小的K。例如，K % 2 = 1, K % 3 = 2, K % 5 = 3。符合条件的最小的K = 23。Input第1行：1个数N表示后面输入的质数及模的数量。（2 <= N <= 10)第2 - N + 1...

#1303 : 数论六·模线性方程组时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Ho：今天我听到一个挺有意思的故事！小Hi：什么故事啊？小Ho：说秦末，刘邦的将军韩信带领1500名士兵经历了一场战斗，战死四百余人。韩信为了清点人数让士兵站成三人一排，多出来两人；站成五人一排，多出来四人；站成七人一排，多出来六人。韩信立刻就知道了剩余人数为10...

#1295 : 数论二·Eular质数筛法时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Ho：小Hi，上次我学会了如何检测一个数是否是质数。于是我又有了一个新的问题，我如何去快速得求解[1,N]这个区间内素数的个数呢？小Hi：你自己有什么想法么？小Ho：有！我一开始的想法是，自然我们已经知道了如何快速判定一个数是否是质数，那么我就直接将[1,N...

I. Intergalactic Biddingtime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputToday the Intergalactic Council of Pebble Coins (ICPC) conducted an...