海绵的博客

On one of the planets of Solar system, in Atmosphere University, many students are fans of bingo game.It is well known that one month on this planet consists of n2days, so calendars, represented a...

Freshmen frequently make an error in computing the power of a sum of real numbers, which usually origins from an incorrect equation (m+n)p=mp+np, where m,n,p are real numbers. Let's call it ``Beginner...

链接：https://www.nowcoder.com/acm/contest/136/J来源：牛客网 题目描述    洋灰是一种建筑材料，常用来筑桥搭建高层建筑，又称，水泥、混凝土。    WHZ有很多铸造成三角形的洋灰块，他想把这些洋灰三角按照一定的规律放到摆成一排的n个格子里，其中第i个格子放入的洋灰三角数量是前一个格子的k倍再多p个，特殊地，第一个格子里放1个。    W...

链接：https://www.nowcoder.com/acm/contest/158/D来源：牛客网 题目描述将所有形如ax+1的数称为a-贝利福斯数，其中x是正整数。一个a-贝利福斯数是a-贝利福斯素数，当且仅当它不能被分解成两个a-贝利福斯数的积。现在给出a,n，问有多少个 ≤ n的a-贝利福斯数可以被分解成两个a-贝利福斯素数的积。输入描述:一行两个数a,n输...

 转载地址  线性求逆元原理：#include <cstdio>#include <bits/stdc++.h>#include <map>#include <cstring>#include <algorithm>using namespace std;#define mst(a,b) mems...

Problem DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x and y. Since the number of choices may ...

#include<bits/stdc++.h>using namespace std;#define rep(i,a,b) for(int i=a;i<b;i++)typedef long long ll;bool is_prime(int x){if(x<2)return false;int m=sqrt(x+0.5);rep(i,2,m+1)if(x%i...

#include<bits/stdc++.h>using namespace std;#define rep(i,a,b) for(int i=a;i<b;i++)typedef long long ll;bool is_prime(int x){if(x<2)return false;int m=sqrt(x+0.5);rep(i,2,m+1)if(x%i...

 原文地址 #include<bits/stdc++.h>using namespace std;typedef long long ll;#define rep(i,a,b) for(int i=a;i<b;i++)#define per(i,a,b) for(int i=b-1;i>=a;i--)const int maxn=1e5+10...

#include<bits/stdc++.h>using namespace std;typedef long long ll;#define rep(i,a,b) for(int i=a;i<b;i++)#define per(i,a,b) for(int i=b-1;i>=a;i--)const int maxn=4e4+10;const int...

链接：https://www.nowcoder.com/acm/contest/146/G来源：牛客网 题目描述Niuniu likes mathematics. He also likes drawing pictures. One day, he was trying to draw a regular polygon with n vertices. He connected e...

#include<bits/stdc++.h>using namespace std;#define rep(i,a,b) for(int i=a;i<b;i++)#define per(i,a,b) for(int i=b-1;i>=a;i--)#define bug(x) printf("x:%d****\n",x)typedef long long ...

#include<bits/stdc++.h>using namespace std;#define rep(i,a,b) for(int i=a;i<b;i++)#define per(i,a,b) for(int i=b-1;i>=a;i--)#define bug(x) printf("x:%d****\n",x)typedef long long ...

#include<bits/stdc++.h>using namespace std;#define rep(i,a,b) for(int i=a;i<b;i++)#define per(i,a,b) for(int i=b-1;i>=a;i--)typedef long long ll;const int maxn=40;ll dp[maxn][m...

An undirected graph is a set V of vertices and a set of E∈{V*V} edges.An undirected graph is connected if and only if for every pair (u,v) of vertices,u is reachable from v.You are to write a program...

#include<bits/stdc++.h>using namespace std;typedef long long ll;#define rep(i,a,b) for(int i=a;i<b;i++)#define lrep(i,a,b) for(int i=a;i<b;i++)#define per(i,a,b) for(int i=b-1;i&g...

 所以，我们不必遍历两遍数组，只需要遍历一遍就好了#include<bits/stdc++.h>using namespace std;typedef long long ll;#define rep(i,a,b) for(int i=a;i<b;i++)#define per(i,a,b) for(int i=b-1;i>=a;i--)unsi...

链接：https://www.nowcoder.com/acm/contest/148/H来源：牛客网 题目描述There are two small ants on Rikka's desk. If we consider Rikka's desk as a two-dimensional Cartesian coordinate system, both of them have ...

Problem DescriptionDid you watch the movie "Animal World"? There is an interesting game in this movie.The rule is like traditional Stone-Paper-Scissors. At the beginning of the game, each of the tw...

#include<bits/stdc++.h>using namespace std;typedef long long LL;#define rep(i,a,b) for(int i=a;i<b;i++)const int maxn=1010;double p[maxn],f[maxn];int main(){ int T; scanf...

There are m stones lying on a circle, and n frogs are jumping over them.The stones are numbered from 0 to m−1 and the frogs are numbered from 1 to n. The i-th frog can jump over exactly ai stones in ...

Marry likes to count the number of ways to choose two non-negative integers a and b less than m to make a×b mod m≠0.Let's denote f(m) as the number of ways to choose two non-negative integers a and b...

推公式：1. 把   再往下拆一级，拆到 一级， 复杂度 ,但是得用 实现，要是二进制枚举会重算很多数字2. 直接 积性函数的 性质， 直接把 拆掉，最后把所有的相乘 第一种#include<bits/stdc++.h>using namespace std;typedef long long LL;#define rep(i,a,b) for(i...

思维题：一种方案可行，那么 肯定是可行的，然后验证就好了。启示： 貌似超时，实际上，只需要验证 n 的因子就行了，根本就不多。 下次看见gcd()，想想因子，就会很舒服。#include<bits/stdc++.h>using namespace std;typedef long long LL;const int N=1e5+10;char s[N*2...

链接：https://www.nowcoder.com/acm/contest/197/C来源：牛客网 题目描述Nqijij 有一个数x，和一个神秘权值 q, 满足 x <= q, 每一次nqijij会随机x 变成 [x, q] 中的一个随机数，nqijij想要知道期望多少次操作之后x 变为q。由于nqijij 是一个精力充沛的人，所以他总共会选择 T 次x 和q 进行操作，对...

  每个X把区域分成了禁区，也就是说谁先进入必死，因为他下一个，别人就一定会赢，也就是必胜态的位置。也就是我们如果先手，一定要给对手留下一个必败态，这样对方才会输。所以就是枚举一下位置，判断一下NIM和就好了。#include<bits/stdc++.h>using namespace std;typedef long long LL;typedef uns...

Since both Stefan and Damon fell in love with Elena, and it was really difficult for her to choose. Bonnie, her best friend, suggested her to throw a question to them, and she would choose the one who...

After eating food from Chernobyl, DRD got a super power: he could clone himself right now! He used this power for several times. He found out that this power was not as perfect as he wanted. For examp...

I used to think I could be anything, but now I know that I couldn't do anything. So I started traveling.The nation looks like a connected bidirectional graph, and I am randomly walking on it. It mean...

In a world where ordinary people cannot reach, a boy named "Koutarou" and a girl named "Sena" are playing a video game. The game system of this video game is quite unique: in the process of playing th...

链接：https://www.nowcoder.com/acm/contest/161/B来源：牛客网 题目描述小N和小O在玩游戏。他们面前放了n堆石子，第i堆石子一开始有ci颗石头。他们轮流从某堆石子中取石子，不能不取。最后无法操作的人就输了这个游戏。但他们觉得这样玩太无聊了，更新了一下规则。具体是这样的：对于一堆有恰好m颗石子的石头堆，假如一个人要从这堆石子中取石子，设他要取石子数...

Problem DescriptionPatrick Star bought a bookshelf, he named it ZYG !!Patrick Star has N book .The ZYG has K layers (count from 1 to K) and there is no limit on the capacity of each layer !Now Pa...

题目描述这是一道模板题。输入两个多项式，输出这两个多项式的乘积。输入格式第一行两个整数 n n n 和 m m m，分别表示两个多项式的次数。第二行 n+1 n + 1 n+1 个整数，分别表示第一个多项式的 0 0 0 到 n n n 次项前的系数。第三行 m+1 m + 1 m+1 个整数，分别表示第二个多项式的 0 0 0 到 m m m 次项前的系数。输出格式...

Elina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The way is described as following: Choose k different positive integers a1, a2, …, ak...

Problem DescriptionIn the last semester, Rikka joined the badminton club.There are n students in the badminton club, some of them have rackets, and some of them have balls. Formally, there are a st...

Multiple query, for each n, you need to getn i-1∑ ∑ [gcd(i + j, i - j) = 1]i=1 j=1InputOn the first line, there is a positive integer T, which describe the number of queries. Next there are T l...

import java.math.BigInteger;import java.util.Scanner;public class Main { public static void main(String []args) { final int max=2010; int []c= {6,2,5,5,4,5,6,3,7,6}; BigInteger []dp=new...

#include<bits/stdc++.h>using namespace std;typedef long long ll;#define rep(i,a,b) for(ll i=a;i<b;i++)#define per(i,a,b) for(ll i=b-1;i>=a;i--)#define ls(x) (x<<1)#define r...

问题描述　　小明几乎每天早晨都会在一家包子铺吃早餐。他发现这家包子铺有N种蒸笼，其中第i种蒸笼恰好能放Ai个包子。每种蒸笼都有非常多笼，可以认为是无限笼。　　每当有顾客想买X个包子，卖包子的大叔就会迅速选出若干笼包子来，使得这若干笼中恰好一共有X个包子。比如一共有3种蒸笼，分别能放3、4和5个包子。当顾客想买11个包子时，大叔就会选2笼3个的再加1笼5个的（也可能选出1笼3个的再加2笼4个的...

#include<cstring>#include<cstdio>#include<iostream>#include<algorithm>#include<cmath>using namespace std;typedef long long ll;const int maxn=2e5+10;const double ...