- 1-Arrays Introduction
- #include <cmath>
- #include <cstdio>
- #include <vector>
- #include <iostream>
- #include <algorithm>
- using namespace std;
- int main() {
- int n;
- cin>>n;
- int arr[n];
- for(int i=0;i<n;i++){
- cin>>arr[i];
- }
- for(int i=n-1;i>=0;i--){
- cout<<arr[i]<<" ";
- }
- return 0;
- }
- 2-Plus Minus
- #include<iostream>
- #include <iomanip>
- using namespace std;
- int main(){
- int n ;
- double pos=0,neg=0,zer=0;
- cin>>n;
- const int num = n-1;
- int arr[num] ;
- for (int i=0;i<n;i++){
- cin>>arr[i];
- if (arr[i]==0) zer++;
- if (arr[i]>0) pos++;
- if (arr[i]<0) neg++;
- }
- cout<<setprecision(6)<<fixed<<pos/(n)<<endl;
- cout<<setprecision(6)<<fixed<<neg/(n)<<endl;
- cout<<setprecision(6)<<fixed<<zer/(n)<<endl;
- return 0;
- }
- 3-Next Round (from: www.codeforces.com)
- #include <cmath>
- #include <cstdio>
- #include <vector>
- #include <iostream>
- #include <algorithm>
- using namespace std;
- int main() {
- int n,k,count=0;
- cin>>n>>k;
- int a[n];
- for(int i =0;i<n;i++){
- cin>>a[i];
- }
- for(int i =0;i<n;i++){
- if (a[i]>=a[k-1]&&a[i]>0) count++;
- }
- cout<<count;
- return 0;
- }
- 4-Stones on the Table (from: www.codeforces.com).
- #include <cmath>
- #include <cstdio>
- #include <vector>
- #include <iostream>
- #include <algorithm>
- using namespace std;
- int main() {
- int n,count=0 ;
- cin>>n ;
- char arr[n];
- for (int i =0;i<n;i++) cin>>arr[i];
- for (int i =0;i<n-1;i++){
- if (arr[i]==arr[i+1]) count++;
- }
- cout<<count;
- return 0;
- }