该文被密码保护。 阅读全文
摘要：
#include #include #include #include #include #include using namespace std; const double eps = 1e-8; const double pi = acos(-1.0); int sgn(double x){ if(fabs(x) 0) swap(a,c); double anga ... 阅读全文
摘要：
Hopscotch time limit per test 2 seconds time limit per test memory limit per test 256 megabytes memory limit per test input standard input input outpu 阅读全文
摘要：
Point on Spiral time limit per test 2 seconds time limit per test memory limit per test 256 megabytes memory limit per test input standard input input 阅读全文
摘要：
Arpa and an exam about geometry time limit per test 2 seconds time limit per test memory limit per test 256 megabytes memory limit per test input stan 阅读全文
摘要：
#include using namespace std; struct node{ int y,m,d; node operator++(int ){ //后缀加加 ++i node nd = *this;//保存副本 pluss(); return nd; } node& operator++()... 阅读全文
摘要：
Consider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901) 阅读全文
摘要：
int dp[maxn][maxn]; signed main() { /*n个盘 m座塔*/ int n,m; n=31,m=31; /*初始化动规边界*/ dp[2][1]=1;//初始化两座塔的情况 for(int i=3; i3 */ for(int i=4; i<=m; ++i){ for(int j=... 阅读全文