- 长方形面积计算
拷代码
- @ 2025-9-23 16:10:22
学校和家里拷代码
8 comments
-
张柏然 @ 2025-11-6 21:59:11#include<iostream> #include<cmath> using namespace std; void abc(){ int m,n,cnt=0,ans=0; cin>>m>>n; for(int i=m+1; i<=n-1; ++i){ ans=0; if(i<=1){ continue; } for(int j=2; j*j<=i; ++j){ if(i%j==0){ ans++; break; } } if(ans==0){ cnt++; } } cout<<cnt; return ; } int main(){ abc(); return 0; }素数的个数
-
@ 2025-10-23 16:13:39#include <iostream> using namespace std; const int N=1000000+7; int a[N]; int main() { int n,k; cin>>n; for(int i=1; i<=n; ++i){ cin>>a[i]; } cin>>k; for(int i=k; i<=n; --i){ a[i]=a[i+1]; } for(int i=1; i<=n; ++i){ cout<<a[i]<<" "; } return 0; } /* 5 1 2 3 4 5 3 */ -
@ 2025-10-21 17:27:34#include<bits/stdc++.h> using namespace std; int main(){ long long n,sum=0,b=0,t=1; cin>>n; while(b<n){ b+=t; sum+=t*t; t++; } cout<<(n-t)*b; return 0; } -
@ 2025-10-21 17:05:42#include<iostream> using namespace std; const int N=100000000+7; int a[N],b[N],c[N],cnt[N]; int main() { int n,v,x; cin>>n; for(int i=1; i<=7; ++i){ cin>>a[i]; } for(int i=1; i<=n; ++i){ v=0; for(int j=1; j<=7; ++j){ cin>>x; if(x==a[i]){ v++; } } cnt[v]++; } cout<<cnt[7]<<" "<<cnt[6]<<" "<<cnt[5]<<" "<<cnt[4]<<" "<<cnt[3]<<" "<<cnt[2]<<" "<<cnt[1]; return 0; } -
@ 2025-10-16 17:08:08#include<bits/stdc++.h> using namespace std; const int N=52+7; int a[N],q[N]; int main(){ int n,cnt; cin>>n; for(int i=1; i<=n; ++i){ cin>>a[i]; } sort(a+1,a+52+7); for(int i=1; i<=n; ++i){ for(int j=i+1; j<=n; ++j){ q[a[i]+a[j]]=1; } } for(int i=1; i<=26; ++i){ if(q[i]==1){ cnt++; } } cout<<cnt<<endl; for(int i=1; i<=n; ++i){ if(q[i]==1){ cout<<q; } } return 0; }q
-
@ 2025-10-9 17:17:52#include<iostream> using namespace std; int main(){ int n,cnt=0; cin>>n; for(int i=2; i<n; ++i){ if(i%2==0){ ++cnt; } if(cnt=n){ cout<<cnt; } } return 0; } -
@ 2025-10-9 17:17:39#include using namespace std; int main(){ int n,cnt=0; cin>>n; for(int i=2; i<n; ++i){ if(i%2==0){ ++cnt; } if(cnt=n){ cout<<cnt; } } return 0; }
-
@ 2025-9-23 16:10:30#include<iostream> using namespace std; int main(){ int n; cin>>n; return 0; }
- 1
Information
- ID
- 1202
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 1
- Tags
- # Submissions
- 4
- Accepted
- 0
- Uploaded By