SF-_- 的 ACM 博客

题目大意：中文题……    解题报告：问我们有多少种可行方法。仔细想一下，如果矩阵有唯一解，那么只有一种可行方法。如果有一个变元，变元取0或者1对其他非变元的值会有影响，但仍然都是可行解。换句话说，变元有多少种，就有2的多少次方个解。简单算一下就知道了。    另外，给定的是开关的初状态和末状态，我们可以记录哪些状态是改变的，记为1。未改变的记为0。用高斯消元法计算变元数量即可。

Problem GTriangle CountingInput: Standard InputOutput: Standard Output You are given n rods of length 1, 2…, n. You have to pick any 3 of them & build a triangle. How many distinct triangl

1315 - Crazy tea partyTime limit: 3.000 secondsn participants of �crazy tea party� sit around the table. Each minute one pair of neighbors can change their places. Find the minimum time (in minu

Perfect Pth PowersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16348 Accepted: 3704DescriptionWe say that x is a perfect square if, for some intege

Triangles are polygons with three sides and strictly positive area. Lattice triangles are the triangles all whose vertexes have integer coordinates. In this problem you have to find the number of latt

Exploring PyramidsTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 1975 Accepted: 902Case Time Limit: 2000MSDescriptionArchaeologists have discov

GCD & LCM InverseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8910 Accepted: 1675DescriptionGiven two positive integers a and b, we can easily calc

Prime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11435 Accepted: 3064DescriptionThe branch of mathematics called number theory is about p

More DivisorsTime Limit: 2 Seconds      Memory Limit: 65536 KBEverybody knows that we use decimal notation, i.e. the base of our notation is 10. Historians say that it is so because men have t

Primitive RootsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2714 Accepted: 1532DescriptionWe say that integer x, 0 i mod p) | 1 <= i <= p-1 } is eq

RelativesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10886 Accepted: 5235DescriptionGiven n, a positive integer, how many positive integers less t

ASquare NumbersInput: Standard InputOutput: Standard Output A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some squ

Minimum Sum LCM LCM (Least Common Multiple) of a set of integers is defined as the minimum number, which is a multiple of all integers of that set. It is interesting to note that any p

Problem FSweet Child Makes TroubleInput: standard inputOutput: standard outputTime Limit: 8 secondsChildren are always sweet but they can sometimes make you feel bitter. In this problem, y

Critical Mass During the early stages of the Manhattan Project, the dangers of the new radioctive materials were not widely known. Vast new factory cities were built to manufacture urani

Problem FLCM CardinalityInput: Standard InputOutput: Standard OutputTime Limit: 2 Seconds A pair of numbers has a unique LCM but a single number can be the LCM of more than one possible pa

Again Prime? No time.Input: standard inputOutput: standard outputTime Limit: 1 secondThe problem statement is very easy. Given a number n you have to determine the largest power of m, not ne

The Super PowersWe all know the Super Powers of this world and how they manage to get advantages in political warfare or even in other sectors. But this is not a political platform and so we will

Problem CAdd AgainInput: Standard InputOutput: Standard Output Summation of sequence of integers is always a common problem in Computer Science. Rather than computing blindly, some intellige

Problem ETeamsInput: Standard InputOutput: Standard Output  In a galaxy far far away there is an ancient game played among the planets. The specialty of the game is that there is no limitati

A palindrome is a word, number, or phrase that reads the same forwards as backwards. For example, the name "anna" is a palindrome. Numbers can also be palindromes (e.g.151 or 753357). Additionally n

Integer GameTwo players, S and T, are playing a game where they make alternate moves.S plays first. In this game, they start with an integer N. In each move, a player removes one digit from the

1319 - MaximumTime limit: 3.000 secondsLet x1, x2,..., xm be real numbers satisfying the following conditions:a)-xi ;b)x1 + x2 +...+ xm = b *  for some integers a and b (a > 0).Determine

Farey SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11555 Accepted: 4492DescriptionThe Farey Sequence Fn for any integer n with n >= 2 is th

题目大意：给出n的行星的周期，问n个行星在一条直线上的周期。    解题报告：懒……就直接用Java大数。当然，时间垫底import java.math.BigInteger;import java.util.Scanner;public class Main { static int[] a = new int[1010]; static Scanner cin = new S

Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 14105 Accepted: 6078DescriptionGiven a n × n matrix A and a positive integer k,

/* * 大数模版 * 完美支持负数及加减法操作 * 支持乘法，大小比较，赋值 * 支持与long long类型的赋值比较 * SF-_- 14.04.01 */#include #include #include #include using namespace std;typedef long long LL;const int K

Longge's problemTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6914 Accepted: 2234DescriptionLongge is good at mathematics and he likes to think abou

1326 - Jurassic RemainsTime limit: 18.000 secondsPaleontologists in Siberia have recently found a number of fragments of Jurassic period dinosaur skeleton. The paleontologists have decided to fo

1326 - Jurassic RemainsTime limit: 18.000 seconds

Football on TableTime Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld      Java class name: MainPrev Submit Status Statistics Discuss NextType: None

A simple problemAccepted : 27 Submit : 296Time Limit : 15000 MS Memory Limit : 655360 KBProblem DescriptionThere is a simple problem. Given a number N. yo

1388 - GraveyardTime limit: 3.000 seconds

F. Spreading the Wealth ProblemA Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circular table. First, everyone has con

FSF’s gameTime Limit: 9000/4500 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 72    Accepted Submission(s): 30Problem DescriptionFSF has programmed a

青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 85835 Accepted: 15080Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面

题目大意：给定初值，步长，终值，计算机字长，问你循环多少次。    解题报告：使用拓展欧里几得解线性方程……算法导论上有详细的证明推导过程，在下也还没看完，看完再来补充哈。AC代码如下：#include #include #include using namespace std;#define LL long longLL gcd(LL a,LL b){ retur

Period of an Infinite Binary ExpansionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2891 Accepted: 768DescriptionLet {x} = 0.a1a2a3... be the binary

DivisorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9978 Accepted: 2933DescriptionYour task in this problem is to determine the number of divisors

Hello KikiTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1835    Accepted Submission(s): 649Problem DescriptionOne day I was sh