- 长方形面积计算
4.11 讨论群
- 2025-9-22 13:22:00 @
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << "Welcome!" << endl;
return 0;
}
6 条评论
-
我都可以 @ 2025-10-7 15:34:26
#include<bits/stdc++.h> using namespace std; int main(){ int n,m; while(cin>>n>>m){ cout<<n+m<<"\n"; } return 0; } //多组输入 //_________________________________________________________________________________________ //从大到小 #include<bits/stdc++.h> using namespace std; bool cmp(int x,int y){ return x>y; } int main(){ return 0; }
-
2025-9-24 13:29:43@
#include<bits/stdc++.h> using namespace std; int a[501]; int main(){ long long n; cin>>n; for(int i=1;i<=n;++i){ cin>>a[i]; } for(int i=1;i<=n;++i){ if(a[i]%2==1){ cout<< } } return 0; }
-
2025-9-23 16:05:50@
using namespace std; int main(){ long long n,x,y; cin>>n>>x>>y; double a = x/(n-1); y-=1; cout<<a*y; return 0; }
-
2025-9-23 15:54:48@
#include<bits/stdc++.h> using namespace std; int main(){ int n; int cut = 1; cin>>n; for(int i = 1;i <= n;i++){ for(int j = 1;j <= n-i+1;++j){ printf(" "); } for(int k = 1;k <= cut;k++){ printf("*"); } cut += 2; printf("\n"); } for(int i = 1;i <= n+1;i++){ for(int j = 1;j <= i - 1;++j){ printf(" "); } for(int k = cut;k >= 1;k--){ printf("*"); } cut -= 2; printf("\n"); } return 0; }
👀 1 -
2025-9-23 13:32:13@
#include<bits/stdc++.h> using namespace std; long long a[501],b[10000000],cnt; int main(){ long long k,x,n=2,c=0,b; cin>>k>>x; b=k; for(int i=1;i<=k;++i){ b=b*k; } if(b>k){ cout<<"1"; for(int i=1;i<=n;++c){ if(n%10==0){ break; } else{ n=n/10; ++cnt; } } for(int i=1;i<=k-cnt;++i){ cout<<"0"; } cout<<x; } else{ if() } return 0; }
-
2025-9-22 17:17:30@
#include<bits/stdc++.h> using namespace std; long long a[501],b[10000000],cnt; int main(){ long long k,x,n=2,c=0; cin>>k>>x; cout<<"1"; for(int i=1;i<=n;++c){ if(n%10==0){ break; } else{ n=n%10; ++cnt; } } for(int i=1;i<=k-cnt;++i){ cout<<"0"; } cout<<x; return 0; }
- 1
信息
- ID
- 1202
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 1
- 标签
- 递交数
- 4
- 已通过
- 0
- 上传者