_Alexander的博客

转载原地址

洛谷3373三种操作1，区间乘2，区间加3，查询区间和#include <bits/stdc++.h>using namespace std;typedef long long ll;const int N=4e5+7;ll p,n,m;ll a[N],lazy[N],tr[N],lazyc[N];void Add(ll i,ll l,ll r,ll k){...

N=2；//矩阵大小ll quick(ll a,ll b){//快速幂 ll ans=1; while(b){ if(b&1)ans=ans*a%mod; a=a*a%mod; b/=2; } return ans%mod;}struct sa{ ll m[N][N];};sa Mul(...

题目Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。这让很多学生很反感。不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。Input本题目包含多组测试，请处理到文件结束。在每个测试的第一行，有两个正整数 N 和 M ( 0<N<=...

原题链接Given a positive integer N, your task is to calculate the sum of the positive integers less than N which are not coprime to N. A is said to be coprime to B if A, B share no common positive diviso...

传送门#include <iostream>#include <stdio.h>#include <algorithm>#include <string.h>#include <vector>#include <math.h>#include <map>#include <queue>...

#include <iostream>#include <stdio.h>#include <algorithm>#include <string.h>#include <vector>#include <math.h>#include <map>#include <queue>#inc...

https://www.luogu.org/problem/P3379题目描述如题，给定一棵有根多叉树，请求出指定两个点直接最近的公共祖先。输入格式第一行包含三个正整数N、M、S，分别表示树的结点个数、询问的个数和树根结点的序号。接下来N-1行每行包含两个正整数x、y，表示x结点和y结点之间有一条直接连接的边（数据保证可以构成树）。接下来M行每行包含两个正整数a、b，表示询问a结点和b...

Mobile phonesTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 17661 Accepted: 8173DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere area operate ...

codeforces/1141/快读例子这是大佬的代码QAQ#include<cstdio>#include<algorithm>#include<cctype>#include<cstring>#include<iostream>#include<cmath>#define LL long long#def...