weixin_41391865的博客

Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of thinking up all the wo...

#include<iostream>#include<cstdio>#include<cstring>using namespace std;int main(){ int n, i, j; char a[10];//数组定义比实际大一些 for(n = 123; n < 330; n++) { ...

题意：你去了一个新城市，需要听懂别人说话，给你一本字典，通过这本字典，你可以把他们的方言词翻译成你掌握的词汇，如：dog对应方言是ogday，输入字典上收录的词条，如下：dog ogdaycat atcaypig igpayfroot ootfrayloops oopslay注意：字典与查询之间输入换行接下来是根据字典查询方言对应的你掌握的词汇，如果有，打印出对应词汇，如果没...

#include <map>#include <cstring>#include <string>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <cctype&amp

#include <map>#include <cstring>#include <string>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <cctype&amp

l为半周长，s为面积float l = (a + b + c) / 2;float s = sqrt(l*(l - a)*(l - b)*(l - c));

宏观来看，使用unique函数去重主要分为以下几步：以vector为例：声明部分：#include<vector>#include<algorithm>vector<int>v;vector<int>::iterator new_end;三个主要步骤：sort(v.begin(),v.end());//第一步：排序（从小...

题目描述我们要求找出具有下列性质数的个数(包含输入的自然数n):先输入一个自然数n(n≤1000),然后对此自然数按照如下方法进行处理: 不作任何处理; 在它的左边加上一个自然数,但该自然数不能超过原数的一半; 加上数后,继续按此规则进行处理,直到不能再加自然数为止. 输入输出格式输入格式：1个自然数(n≤1000)输出格式：1个整数，表示具有...

import java.math.BigDecimal;import java.util.ArrayList;import java.util.Iterator;import java.util.Scanner;import java.io.*;public class Main { public static void main(String[] args){ ...

std::ios::sync_with_stdio(false);std::cin.tie(0);

1.最短路u->v之间的最短路满足以下限制： 对任意k ∈ G(V,E) 有 dist u,v <= dis u,k + dis k,j关键操作-松弛：void relax(int i,int j,int k){  if(dis[k]>dis[i]+j)    dis[k]=dis[i]+j;} 2.多源点多汇点最短路FLOYD复杂度 O(...

int sgn(double a){return a < -eps ? -1 : a < eps ? 0 : 1;}const double eps=1e-8; 传统意义 修正写法1 修正写法2 a == b sgn(a - b) == 0 fabs(a – b) ...

#define maxn 3000010int p[maxn];void oula(){ int i,j; for(i=1; i<=maxn; i++) p[i]=i; for(i=2; i<=maxn; i+=2) p[i]/=2; for(i=3; i<=maxn; i+=2) if(p[i]==i...

Ek算法：#include<cstdio>#include<cstring>#include<algorithm>#include<string>#include<iostream>#include<queue>using namespace std;int pre[250];int n,m;int ed...

char数组型：int const MAX = 110005;char s[MAX << 1];int p[MAX << 1];int Manacher(){ int len = (int)strlen(s), maxp = 0, ans = 0; for(int i = len; i >= 0; i--) { ...

# include <iostream># include <stdio.h># include <string.h># include <algorithm># include <math.h># include <queue># include <string># include &lt

#include <iostream>#include <cassert>#include <algorithm>#include <vector>#include <string>#include <iterator> using namespace std; int main(){ //cout...

#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;#define maxn 50005#define inf 0x3f3f3f3fint n,q;int a[maxn],ll[maxn<<1]...

const int maxn=50005;int a[maxn],dp[maxn][30],d[maxn][30];void rmq(){ for(int i=1;i<=n;i++){dp[i][0]=a[i];d[i][0]=a[i];} for(int j=1;(1<<j)<=n;j++){ for(int i=1;i+(1<...

洛谷P1003 铺地毯第一次交：很奇怪这是为什么，明明很快就出结果了，12s不要太夸张，后来只改了一个字符：‘～’出乎意料的绿了，居然是因为while中scanf前面没有加~，一定要注意这个问题呀，AC代码：#include <map>#include <set>#include <cstring>#include <str...