qq_45976312的博客

python打印九九乘法表：直接上代码（（1）使用while循环：i=1while i<10: j=1 while j<=i: print("%d*%d=%-2d"%(i,j,i*j),end=" ") j=j+1 print("\n") i=i+1（2）使用for循环：for i in range(1,10): for j in range(1,i+1): print("%d*%d=

#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<stdio.h>using namespace std;int main(){ int n; int s=0,h=0; int k; int flog=0; for(int i=1; i<=12; i++) { cin>>n;..

#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<stdio.h>using namespace std;int main(){ int n; cin>>n; for(int k=1;;k++) { for(int x=100;x>0;x--) { ..

#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<stdio.h>using namespace std;const int N=1e9;int a[1000];int main(){ int n; cin>>n; double sum=0; for(int i=0; i<n; i++) { ..

#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<stdio.h>using namespace std;const int N=1e9;int main(){ int n; cin>>n; int ans=0; for(int i=0; i<n; i++) { for(int j=..

最简单做~~~~#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<stdio.h>using namespace std;const int N=1e9;int main(){ int n; cin>>n; for(int i=2; i<=n; i++) { if(n%i==0) .

#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<stdio.h>using namespace std;const int N=1e9;int main(){ int n; cin>>n; int cnt=1; int maxx=0; int d; cin>>d; int j..

#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<stdio.h>using namespace std;const int N=1e6+9;int a[1000];int main(){ int n; cin>>n; int maxx=0,minn=N; for(int i=0; i<n; i++)..

#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<stdio.h>using namespace std;double a[100];int main(){ int n; cin>>n; a[1]=1,a[2]=1; for(int i=3; i<=n; i++) { a[i]=a[..

第一种方法#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<stdio.h>using namespace std;string s1,s2;int main(){ cin>>s1; if(s1[0]=='-') { cout<<'-'; for(int i=s1.size(.

#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<stdio.h>using namespace std;int main(){ double n; cin>>n; int cnt=0; double ans=0; double sum=2; while(ans<n) { ..

有两种方法可以解决1.先判断是否回文，再判断是否是素数（顺序）#include<bits/stdc++.h>#include<algorithm>#include<iostream>#include<stdio.h>using namespace std;bool huiwen(int n){ int s=n; int x=0; while(s!=0) { x=x*10+s%10; .

#include<iostream>#include<stdio.h>#include<algorithm>using namespace std;bool prime(int n){ for(int i=2; i<=n/i; i++) { if(n%i==0) return false; } return true;}int main(){ int n; cin>>..

#include<iostream>#include<algorithm>#include<stdio.h>using namespace std;const int N=1e6+9;int main(){ int k; cin>>k; int ans=0; for(int i=1; i<=k; i++) { ans=ans+i; } cout<<a...

#include<iostream>#include<algorithm>#include<stdio.h>using namespace std;const int N=1e6+9;int main(){ int k; cin>>k; int t=0,ans=0; for(int i=1;; i++) { for(int j=1; j<=i; j++) { ..

#include<iostream>#include<algorithm>#include<stdio.h>using namespace std;const int N=1e6+9;int main(){ int k; cin>>k; double ans=0; int t=0; while(ans<=k) { t++; ans=ans+1.0/t; ..

#include<iostream>#include<algorithm>#include<stdio.h>using namespace std;const int N=35;int main(){ long long n,x; cin>>n>>x; int cnt=0; for(int i=1; i<=n; i++) { int k=i; while..

n=eval(input())ans=0d=1for i in range(1,n+1): d=d*i ans+=dprint(ans)

#include<iostream>#include<algorithm>#include<stdio.h>using namespace std;const int N=35;int ans;int main(){ int n; cin>>n; for(int i=1; i<=n; i++) { for(int j=i; j<=n; j++) { ..

#include<iostream>#include<algorithm>#include<stdio.h>using namespace std;const int N=35;int main(){ int n; cin>>n; int cnt=0; while(n>=1) { n=n/2; cnt++; } cout<<cnt;...

#include<iostream>#include<algorithm>#include<stdio.h>using namespace std;const int N=35;int main(){ int n,k; cin>>n>>k; int sum=0; int ans=0; for(int i=k; i<=n; i+=k) sum+=i; p..