随笔分类 - ACM-XJBX
摘要：java中大数以及高精度常用函数 使用java大数类解决问题时我们需要注意两个方面:1、不能有包名，也就是说我们要把主类放到默认的包里，如果你的代码里出现形如package cn.gov.test;这样的代码你很有可能会收获到RE 2、提交的类的类名必须为Main，如果是其他的名字你有可能收获到CE
阅读全文
摘要：BaoBao is trapped in a one-dimensional maze consisting of grids arranged in a row! The grids are numbered from 1 to from left to right, and the -th gr
阅读全文
摘要：BaoBao has just found a string of length consisting of 'C' and 'P' in his pocket. As a big fan of the China Collegiate Programming Contest, BaoBao thi
阅读全文
摘要：Crusaders Quest is an interesting mobile game. A mysterious witch has brought great darkness to the game world, and the only hope for your kingdom is
阅读全文
摘要：The 2017 China Collegiate Programming Contest Qinhuangdao Site is coming! There will be teams participating in the contest, and the contest will be he
阅读全文
摘要：Here N (N ≥ 3) rabbits are playing by the river. They are playing on a number line, each occupying a different integer. In a single move, one of the o
阅读全文
摘要：Just A Mistake Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 168 Accepted Submission(s): 41 P
阅读全文
摘要：A Curious Matt Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 3369 Accepted Submission(s): 18
阅读全文
摘要：God Water likes to eat meat, fish and chocolate very much, but unfortunately, the doctor tells him that some sequence of eating will make them poisono
阅读全文
摘要：Bob is a sorcerer. He lives in a cuboid room which has a length of AA, a width of BB and a height of CC, so we represent it as AA * BB * CC. One day,
阅读全文
摘要：Jessie has a magic mirror. Every morning she will ask the mirror: 'Mirror mirror tell me, who is the most beautiful girl in the world?' If the mirror
阅读全文
摘要：N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than others. Each
阅读全文
摘要：A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different h
阅读全文
摘要：Description Wells最近经常做一些有皮神出现的梦。 在这一次梦中Wells把皮神(Pikachu)弄丢了，Wells在一个正 N 边形区域的中心开始自闭，Wells想找回皮神，同时皮神也在尝试找回Wells。 皮神为了确保不会找不到Wells，皮神在正 NN 边形最外围的每个顶点上都放
阅读全文
摘要：一：N条直线分割平面 假设，x条线能将平面分为f(x)份，这对于份f(n) 第n条线，和其他n-1条线都有交点时，增加量最大，为n; 则： f(n)=f(n-1)+n; 有f(0)=1；得到：n 条直线分割平面的数量最大为：f(n)=n*(n+1)/2 + 1; 二. “V” 形线分割平面 对于“V
阅读全文
摘要：Chiaki often participates in international competitive programming contests. The time zone becomes a big problem. Given a time in Beij...
阅读全文
摘要：hiaki has an array of nn positive integers. You are told some facts about the array: for every two elements aiai and ajaj in the subar...
阅读全文
摘要：Chiaki has 3n3n points p1,p2,…,p3np1,p2,…,p3n. It is guaranteed that no three points are collinear. Chiaki would like to construct nn ...
阅读全文
摘要：You surely have never heard of this new planet surface exploration scheme, as it is being carried out in a project with utmost secrecy...
阅读全文
摘要：zk has n numbers a1,a2,...,ana1,a2,...,an. For each (i,j) satisfying 1≤iusing namespace std;const int maxn=1e5+5;int n,m;vector a,b,c...
阅读全文
浙公网安备 33010602011771号