- 博客(17)
- 收藏
- 关注
RSS订阅原创 1098
##1098#include<bits/stdc++.h>using namespace std;//数学归纳法得 只要保证(18+k*a*x)%65==0即可保证f(x)%65==0int k;int f(int k){ int a; for(a=0;a<=65;a++){ //从0开始保证非负 if((18+(a%65)*(k%65)%65)%65==0) return a; } return a;}int main(){ while(~scan
2021-04-16 20:01:31
46
原创 1872
##1872#include<bits/stdc++.h>using namespace std;struct tt{ char name[53]; int sum;}a[302],b[302];bool cmp(tt x,tt y){ return x.sum>y.sum;}int main(){ int n; while(cin>>n){ int c1=0,c2=0,ans=0; for(int i=0;i<n;i++) cin&
2021-04-16 20:00:06
54
原创 1060
##1060#include<bits/stdc++.h>using namespace std;int main(){ int t,n; double x; cin>>t; while(t--){ scanf("%d",&n); x=n*log10(n); x=x-floor(x); printf("%d\n",(int)pow(10,x)); }}
2021-04-16 19:58:34
46
原创 2454
##2454using namespace std;int t,n,a[1005];bool cmp(int c,int b){ return c>b;}int main(){ cin>>t; while(t--){ cin>>n; int sum=0,f=0; for(int i=0;i<n;i++){ cin>>a[i];sum+=a[i]; if(a[i]>=n) f=1; } if(sum%2||f
2021-04-16 19:56:06
84
原创 1236
##1236using namespace std;int n,m,g,tt[12];struct node{ char name[24]; int m,sum;}s[1003];bool cmp(node a,node b){ if(a.sum==b.sum) return strcmp(a.name,b.name)<0; return a.sum>b.sum;}int main(){ int k; while(cin>>n>>m>>
2021-04-16 19:51:39
58
原创 2037
##2037#include<bits/stdc++.h>using namespace std;int n;struct pp{ int s,t;}a[105];bool cmp(pp b,pp c){ return b.t<c.t;}int main(){ while(cin>>n){ if(n==0) break; int ans=1; for(int i=0;i<n;i++){ cin>>a[i].s>&g
2021-04-16 19:49:54
49
原创 1050
##1050#include<bits/stdc++.h>using namespace std;int t,n,r[205];int main(){ int s,e,ans; cin>>t; while(t--){ while(cin>>n){ memset(r,0,sizeof(r)); while(n--){ cin>>s>>e; if(s>e){ //题目未说明s一定<e
2021-04-16 19:47:16
27
原创 1052
##1052#include<bits/stdc++.h>using namespace std;int n,tj[1005],ki[1005];int tf,tl,kf,kl,win,lose;bool cmp(int a,int b){ return a>b;}int main(){ while(cin>>n){ if(n==0)break; for(int i=0;i<n;i++) cin>>tj[i]; for(int i
2021-04-11 21:50:06
48
原创 1099
##1099#include<bits/stdc++.h>using namespace std;int n,m;struct rat{ double j,f,z;}a[1005];bool cmp(rat p,rat q){ return p.z>q.z;}int main(){ while(cin>>m>>n){ if(m==-1&&n==-1) break; double ans=0; for(int i=0;
2021-04-11 21:48:27
61
原创 2899
##2899#include<stdio.h>#include<math.h>double f(double x,double y){ return 6*pow(x,7)+8*pow(x,6)+7*pow(x,3)+5*pow(x,2)-y*x;}double sf(double y){ double l=0,r=100; double m1,m2; while(r-l>1e-6){ m1=(l*2+r)/3;
2021-04-11 21:46:47
60
原创 2199
##2199#include<bits/stdc++.h>using namespace std;typedef long long ll;double f(double x) { return 8*pow(x,4)+7*pow(x,3)+2*pow(x,2)+3*x+6;} int main(){ int t; double y,l,r,m; cin>>t; while(t--){ cin>>y; if(y<6||y>f(1
2021-04-11 21:45:37
174
原创 2035
##2035#include<bits/stdc++.h>using namespace std;typedef long long ll;ll po(ll a,ll b,ll c){ ll ans=1; ll base=a%c; while(b){ if(b&1) ans=(ans*base)%c; base=(base*base)%c; b>>=1; } return ans;}int main(){ ll a,b; while(
2021-04-11 21:44:08
39
原创 1097
##1097#include<bits/stdc++.h>using namespace std;typedef long long ll;ll po(ll a,ll b,ll c){ ll ans=1; ll base=a%c; while(b){ if(b&1) ans=(ans*base)%c; base=(base*base)%c; b>>=1; } return ans;}int main(){ ll a,b; while(sc
2021-04-11 21:42:54
47
原创 1021
##1021#include<bits/stdc++.h>using namespace std;int f[1000005];void init(){ f[0]=7;f[1]=11; int i=2; while(i<=1000005){ f[i]=f[i-1]+f[i-2]; f[i]%=3; i++; }}int main(){ int n; init(); while(cin>>n){ if(f[n]%3) cout<&l
2021-04-11 21:41:12
47
原创 1019
##1019#include<bits/stdc++.h>using namespace std;int gcd(int n,int m){return m?gcd(m,n%m):n;}int main(){long long a;int t,n,b;cin>>t;while(t–){cin>>n;cin>>a;n–;while(n–){cin>>b;a=a/gcd(a,b)*b;}cout<<a&l
2021-04-11 21:39:38
36
原创 2021-04-11
##1008#include<bits/stdc++.h>using namespace std;int gcd(int n,int m){ return m?gcd(m,n%m):n;}int main(){ int n,m; while(cin>>n>>m){ cout<<n*m/gcd(n,m)<<endl; } return 0;}
2021-04-11 20:08:20
39
原创 2021-04-11
1001#include<bits/stdc++.h>using namespace std;int main(){ int n,s; while(cin>>n){ s=0; while(n--) s+=n+1; cout<<s<<"\n"<<endl; } return 0;}
2021-04-11 20:04:02
34
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人