| Problem 2491 >> ngsb |
|
luoen @ 2024-11-28 17:53:41
请输入ngsb，看中文键盘里头会出现啥
|
|
qiluwei @ 2024-11-29 20:30:01
哪个傻逼
|
|
luoen @ 2024-11-29 20:39:37
我的是：你个傻逼
|
|
luoen @ 2024-11-29 20:39:52
当然，不是骂你
|
|
pengyufan @ 2024-11-30 10:36:24
#include<bits/stdc++.h>
using namespace std; int main(){ long long n; cin>>n; long long a[n]; long long sum=0; for(int i=0;i<n;i++){ cin>>a[i]; } long long min=2100000000; for(int i=0;i<n;i++){ if(min>a[i]){ min=a[i]; } } for(int i=0;i<n;i++){ if(a[i]!=min){ sum+=a[i]-min; } } cout<<sum; return 0; } |
|
chengbinxuan @ 2024-11-30 11:49:39
#include<bits/stdc++.h>
using namespace std; int main() { string s1; string s2; cin>>s1>>s2; for(int i=0;i<s1.size();i++){ if(!(s1[i]>='0' && s1[i]<='9')){ s1.erase(i,1); i--; } } for(int i=0;i<s2.size();i++){ if(!(s2[i]>='0' && s2[i]<='9')){ s2.erase(i,1); i--; } } int num1=0,num2=0; for(int i=0;i<s1.size();i++){ num1=num1+(s1[i]-'0')*pow(10,s1.size()-i-1); } for(int i=0;i<s2.size();i++){ num2=num2+(s2[i]-'0')*pow(10,s2.size()-i-1); } cout<<num1/num2; return 0; } |
|
zhangwenbo @ 2024-11-30 20:45:06
那个是吧
|
|
zhangxuanzhen @ 2024-12-16 21:02:26
那个是吧
|