zhiyeegao的博客

//通过观察，发现生成元在给出数n的n-100以内//这么写不会超时#include <iostream>#include <stdio.h>#include <stdlib.h>#include <cstring>#include <string.h>#include <cmath>#include <...

#include <stdio.h>                                 //隐藏错误：缺少头文件<string.h>#define maxn 10000000 + 10   //错误1：maxn太大，程序无法运行。int main(){    char s[maxn];    scanf("%s",s);    int tot = 0;    ...

Sample Input4 1235155 213331230 0Sample OutputCASE# 1:5 found at 4CASE# 2:2 not found3 found at 3 题目大意是找到指定数字（经过排序后的）位置，用sort()和lower_bound()就可以做了，记住的是不能用...

Sample Input10move 9 onto 1move 8 over 1move 7 over 1move 6 over 1pile 8 over 6pile 8 over 5move 2 over 1move 4 over 9quitSample Output0: 01: 1 9 2 42:3: 34:5: 5 8 7 ...

Sample InputAdventures in DisneylandTwo blondes were going to Disneyland when they came to a fork in theroad. The sign read: "Disneyland Left."So they went home.Sample Outputaadventures...

Sample Inputladder came tape soon leader acme RIDE lone Dreis peatScAlE orb eye Rides dealer NotE derail LaCeS drIednoel dire Disk mace Rob dries#Sample OutputDiskNotEderaildrIedey...

Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices.Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary....

#include<bits/stdc++.h>using namespace std;int A[120];bool isp[150];int n;int vis[150];void dfs(int cur){ if(cur==n && isp[A[0]+A[n-1]]){ for(int i = 0;i < n;i++) ...

用了4种方法实现：#include<bits/stdc++.h>using namespace std;typedef long long ll;const ll maxn=1e5+10;const ll mod=1e9+7;int a[10000],b[10000],c[10000];int n = 1000,t1 = 0,t2 = 0,t3 = 0,t4 = 0...