Ivy_End

摘要： Description描述Let f(n) be a sum of digits for positive integer n. If f(n) is one-digit number then it is a digital root for n and otherwise digital roo... 阅读全文

摘要： Description描述Find amount of numbers for given sequence of integer numbers such that after raising them to theM-th power they will be divided byK.求出给定一... 阅读全文

摘要： Description描述You want to arrange the window of your flower shop in a most pleasant way. You haveFbunches of flowers, each being of a different kind, a... 阅读全文

摘要： Description描述Dominoes – game played with small, rectangular blocks of wood or other material, each identified by a number of dots, or pips, on its fac... 阅读全文

摘要： Description描述His Royal Highness King of Berland Berl XV was a very wise man and had a very accomplished wife, who was aware of the fact, that prominen... 阅读全文

摘要： Description描述Find coordinates of any triangle ABC if it is know that |AB|=c, |AC|=b, |AM|=m, AM is a median of triangle.找到任何一个三角形ABC，使得它满足|AB| = c，|AC... 阅读全文

摘要： Description描述There are N integers (1A[j].给定N (1 A[j]的数对(i, j)的总数。Input输入The first line of the input contains the number N. The second line contains N... 阅读全文

摘要： 断断续续终于刷完了计算几何专题，感觉太麻烦，小错误不断，尤其是精度问题。还有输出问题，有时候printf比cout要方便。UVaOJ 10250给出正方形的一组对角坐标，求另外两个坐标，用三角函数推到公式。不妨设两点为A(x1, y1), C(x2, y2)，则中点为G((x1 + x2) / 2,... 阅读全文

摘要： 这一次主要是数论专题，感到思维量比上一次的数学题要多多了。同样的问题也是英文题看起来有些吃力。UVaOJ 575这应该算不上是一个数论题，它重新定义了一种进制转换的公式，然后根据公式计算即可。#include using namespace std;int Pow(int x, int y);int... 阅读全文

摘要： 刷完了数学专题，感觉思维量有些大，同时也对浮点数的运算有些接触。最重要的还是感觉有时候题目读起来有些吃力，需要借助中文翻译。UVaOJ 113这道题目是集训的时候第一天晚上的题目，据说可以double解决，当时没有AC。现在重新做了一遍，需要注意的是最后输出的结果一定要转换成int，否则会WA。同时... 阅读全文