eletroram的博客

include include include include include include using namespace std; typedef long long LL; ///o(っ。Д。)っ AC万岁!!!!!!!!!!!!!!const int maxn = 1700000, inf = -199999999; LL str[maxn] = {}, sarr[2][maxn]

You are given a list of train stations, say from the station 11 to the station 100100. The passengers can order several tickets from one station to another before the train leaves the station one.

Counting Subsequences Time Limit: 5000 MS Memory Limit: 65536 K Total Submit: 905(280 users) Total Accepted: 253(219 users) Rating:  Special Judge: No Desc

一道水题，题意：给出两个数字作为长方形的长和宽，问最少需要多少个长方形才能拼成一个正方形。 思路：求两个数的最小公倍数，然后求出这两个数分别除掉最小公倍数之后的乘积。 详解： 长和宽互质的长方形拼成正方形的最小个数就是：其长和宽的乘积。如果长和宽不互质，那么只需除掉长和宽的最小公倍数即可。 代码： #include <iostream> #include <cstri...