18 条题解
-
1
#include<cstdio> #include<cstdlib> #include<cmath> #include<cctype> #include<cstring> #include<string> #include<vector> #include<set> #include<stack> #include<queue> #include<iostream> #include<iomanip> #include<ctime> #include<algorithm> #include<map> using namespace std; int main(){ int n,a=0,b=0,c=0; cin>>n; for(int i=1;i<=n;i++){ int d; cin>>d; if(d==1) a++; else if(d==5) b++; else if(d==10) c++; } printf("%d\n%d\n%d\n",a,b,c); }
-
1
#include<iostream> #include<iomanip> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<string> #include<algorithm> #define LL long long using namespace std; const int N=1e5+10; const int Inf=0x3f3f3f3f; LL n[N],f,a1,a5,a10; int main(){ cin>>f; for(LL i=0;i<f;i++){ cin>>n[i]; }for(LL i=0;i<f;i++){ if(n[i]==1){ a1++; }if(n[i]==5){ a5++; }if(n[i]==10){ a10++; } } cout<<a1<<"\n"<<a5<<"\n"<<a10; }
-
1
#include<iostream> #include<iomanip> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<string> #include<algorithm> #define LL long long using namespace std; const int N=1e5+10; const int Inf=0x3f3f3f3f; LL n[N],f,a1,a5,a10; int main(){ cin>>f; for(LL i=0;i<f;i++){ cin>>n[i]; }for(LL i=0;i<f;i++){ if(n[i]==1){ a1++; }if(n[i]==5){ a5++; }if(n[i]==10){ a10++; } } cout<<a1<<"\n"<<a5<<"\n"<<a10; }
-
1
#include <iostream> #include <stdio.h> #include <math.h> #include <iomanip> using namespace std; const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; int k , n , one , five , ten; int main() { cin >> k; for( int i = 1 ; i <= k ; i++ ) { cin >> n; if( n == 1 ) { one += 1; } else if( n == 5 ) { five += 1; } else if( n == 10 ) { ten += 1; } } cout << one << endl << five << endl << ten; return 0; }
-
0
What water question!
//Accepted code: #include <bits/stdc++.h> /*#include <iostream> #include <stdio.h> #include <stdbool.h> #include <iomanip> #include <cstdio> */ //any function void sleep(int p){ long long int jiouiuiojioiouuiijyuiuyiyi = 0; const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; for(int k = 1;k <= p;k++){ for(int j = 1;j <= 300;j++){ for(int i = 1;i <= N;i++){ jiouiuiojioiouuiijyuiuyiyi += pow(N,N); } } } } //code write block using namespace std; const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; int n,one,five,ten; int main(){ cin >> n; for(int i = 1;i <= n;i++){ int x; cin >> x; if(x == 1){ one++; } else if(x == 5){ five++; } else if(x == 10){ ten++; } } cout << one << endl << five << endl << ten; return 0; }
- 1
信息
- ID
- 972
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- 3
- 标签
- 递交数
- 669
- 已通过
- 337
- 上传者