oi-blog

100 读入两个整数A和B，输出它们的和。 水题 #include using namespace std; int main() {int a, b; cin >> a >> b; cout << a + b << endl; }

题目 120. Archipelagotime limit per test: 0.25 sec. memory limit per test: 4096 KBArchipelago Ber-Islands consists of N islands that are vertices of equiangular and equilateral N-gon. Islands are clock

给出正整数n（可能有前导0），请求出n!最右非零的数位的值。

题目： 144. Meeting time limit per test: 0.25 sec.  memory limit per test: 4096 KB Two of the three members of the winning team of one of the ACM regional contests are going to meet i

题目： 121. Bridges painting time limit per test: 0.25 sec.  memory limit per test: 4096 KB New Berland consists of N (1£ N£ 100) islands, some of them are connected by bridges. There

题目： 124. Broken line time limit per test: 0.25 sec.  memory limit per test: 4096 KB There is a closed broken line on a plane with sides parallel to coordinate axes, without self-cr

题目： 119. Magic Pairs time limit per test: 0.25 sec.  memory limit per test: 4096 KB “Prove that for any integer X and Y if 5X+4Y is divided by 23 than 3X+7Y is divided by 23 too.”

题目 111. Very simple problem time limit per test: 0.25 sec.  memory limit per test: 4096 KB You are given natural number X. Find such maximum integer number that it square is not gr

题意： 110. Dungeon time limit per test: 0.25 sec.  memory limit per test: 4096 KB The mission of space explorers found on planet M the vast dungeon. One of the dungeon halls is fill wi

题目： 128. Snake time limit per test: 0.25 sec.  memory limit per test: 4096 KB There are N points given by their coordinates on a plane. All coordinates (xi,yi) are integers in a ra

NOIP2015模拟试题题解 chongjg的求助 【题目大意】 求nn以内所有的(m,k)(m,k)，使得下式成立： m3=(k+1)2+(k+2)2+...+(k+m)2m^3=(k+1)^2+(k+2)^2+...+(k+m)^2 【算法一】 1~n 一个一个数枚举，期望得分30分 【算法二】 如果有O(n)的做法，则期望得分50分 【算法三】 各种推一推。。。 设