Problem DescriptionThere are n kinds of goods in the company, with each of them has a inventory of  and direct unit benefit . Now you find due to price changes, for any goods sold on day i, if its dir...

萌萌哒身高差“清明时节雨纷纷，路上行人欲断魂。”然而wfy同学的心情是愉快的，因为BNU ACM队出去春游啦！并且，嗯。。。以下是wfy同学的日记： 昨天，何老师告诉我们：明天我们去春游，大家准备好喝的和吃的哦！大家听了都兴奋起来，有的欢呼，有的鼓掌，开心得不得了。第二天，我们早早地来到学校，迫不及待地上了车，来到了公园。一进门，啊，太美了！公园中有那么多树，有高有矮，有粗有瘦，密密的，在春风吹拂...

前四道题都是简单题，基本上半个小时就能解决。A. BQG's Programming ContestTime Limit: 2000msMemory Limit: 32768KB64-bit integer IO format: %lld      Java class name: MainSubmit Status PID: 50997又到了一年一度的北京师范大学新生程序设计竞赛！为作为良心出题...

Problem DescriptionWith given integers a,b,c, you are asked to judge whether the following statement is true: "For any x, if a⋅+b⋅x+c=0, then x is an integer."InputThe first line contains only one int...

Problem DescriptionCalculate  mod (1000000000+7) for given n，m.InputInput contains two integers n,m(1≤n≤1000,0≤m≤10).OutputOutput the answer in a single line.Sample Input10 0Sample Output10HintSourc...

Problem DescriptionFascinated with the computer games, Gabriel even forgets to study. Now she needs to finish her homework, and there is an easy problem:f(n)=She is required to calculate f(n) mod 2 fo...

素数判定Miller_Rabin 算法详解 例如：Goldbach#include<bits/stdc++.h>using namespace std;unsigned long long n;const int times = 5;int number = 0;unsigned long long Random( unsigned long long n ) ...

点击打开链接Description:There is a positive integer X, X's reversion count is Y. For example, X=123, Y=321; X=1234, Y=4321. Z=(X-Y)/9, Judge if Z is made up of only one number(0,1,2...9), like Z=11,Z=111,Z=...