![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
hdu
抠脚老騷
这个作者很懒,什么都没留下…
展开
-
hdu-5902-gcd
#include <bits/stdc++.h>using namespace std;#define mod 1e9+7#define ll long longint a[2005],b[2001];int main(){ int _;cin>>_; while(_--){ int i,n,num,flag=1; memset(a,0,sizeof(a)); for(cin>>n,i=0,num原创 2020-08-12 18:19:08 · 96 阅读 · 0 评论 -
hdu-6852-构造-Increasing and Decreasing
HDU 6852 Increasing and Decreasing(构造)菜鸡日记今天构造的裂开,写了半天,结果T了,难受ll又忘开了#include<bits/stdc++.h>using namespace std;typedef long long ll;const int maxn=2e5+5,inf=0x3f3f3f3f,mod=998244353;int n,x,y,ans[maxn];ll pre[maxn],len[maxn];signed main(){原创 2020-08-11 20:13:14 · 296 阅读 · 0 评论 -
hdu-5223-gcd
#include <bits/stdc++.h>#define ll long long#define MAX 1007using namespace std;int shit(){ int n,q,flag=1; ll a[MAX],l[MAX],r[MAX],an[MAX]; cin>>n>>q; for(int i=0;i<=n;i++)a[i]=1; for(int i=0;i<q;i++){原创 2020-08-10 15:00:00 · 131 阅读 · 0 评论 -
hdu-2588-gcd-欧拉函数学习
题目链接#include<bits/stdc++.h>using namespace std;typedef long long ll;//欧拉函数int euler(int n){ int ret=n; for(int i=2;i<=sqrt(n);i++) if(n%i==0){ ret=ret/i*(i-1); while(n%i==0)n/=i; } if(n>1)ret=ret/n*(n-原创 2020-08-07 19:01:54 · 280 阅读 · 0 评论 -
hdu-2504-gcd练习
题目链接#include<bits/stdc++.h>using namespace std;typedef long long ll;int main(){ int n,a,b,i; cin>>n; while(n--) for(cin>>a>>b,i=b+1;i<1000001;i++) if(__gcd(a,i)==b)cout<<i<<endl,i=原创 2020-08-07 18:55:20 · 66 阅读 · 0 评论 -
hdu 6828-Little Rabbit‘s Equation
hdu 6828-Little Rabbit’s Equation又忘开 long long了,!#include<bits/stdc++.h>using namespace std;typedef long long ll;ll toTen(string a, int bit){ int i,b=1,sum=0,length=a.length(); for(i=length-1;i>=0;i--){ if(a[i]>='A')sum+=(原创 2020-08-06 21:12:14 · 242 阅读 · 0 评论