[Hackerrank-algorithm-warmup]题解

来源：互联网发布：如何注册国家顶级域名编辑：程序博客网时间：2024/05/16 12:11

A Very Big Sum

#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>using namespace std;int main(){int n;cin>>n;int t;long long ans = 0;for(int i=0;i<n;i++){scanf("%d",&t);ans += t;}cout<<ans;return 0;}

Compare the Triplets

#include<cstdio>#include<iostream>#include<cmath>#include<cstring>#include<algorithm>using namespace std;int main(){int a[3];for(int i=0;i<3;i++)cin>>a[i];int b[3];for(int i=0;i<3;i++)cin>>b[i];int rankA = 0,rankB = 0;for(int i=0;i<3;i++){if(a[i]>b[i])rankA++;if(a[i]<b[i])rankB++;}cout<<rankA<<" "<<rankB;return 0;}

Diagonal Difference

#include<cstdio>#include<iostream>#include<cmath>#include<algorithm>#include<cstring>using namespace std;int main(){int n;int ar[110][110];cin>>n;for(int i=0;i<n;i++){for(int j=0;j<n;j++){cin>>ar[i][j];}}int primary_diagonal = 0;for(int i=0;i<n;i++)primary_diagonal += ar[i][i];int secondary_diagonal = 0;for(int i=0;i<n;i++)secondary_diagonal += ar[i][n-i-1];cout<<abs(primary_diagonal-secondary_diagonal);return 0;}

Plus Minus

#include<cstdio>#include<iostream>#include<cmath>#include<algorithm>#include<vector>#include<cstring>using namespace std;int main(){int n;scanf("%d",&n);int cntOfPositiveNumber = 0;int cntOfNegativeNumber = 0;int cntOfZero = 0;int t;for(int i=0;i<n;i++){scanf("%d",&t);if(t<0)cntOfNegativeNumber++;else if(t>0)cntOfPositiveNumber++;else cntOfZero++;}printf("%.6lf\n%.6lf\n%.6lf",cntOfPositiveNumber*1.0/n,cntOfNegativeNumber*1.0/n,cntOfZero*1.0/n);return 0;}

Sherlock and Watson

#include<cstdio>#include<iostream>#include<algorithm>#include<cmath>#include<cstring>using namespace std;int n,k,q;#define maxn 100010int a[maxn];int pos;int main(){cin>>n>>k>>q;for(int i=0;i<n;i++)scanf("%d",&a[i]);for(int i=0;i<q;i++){scanf("%d",&pos);pos = (pos+n-k)%n;while(pos<0)pos+=n;while(pos>n)pos-=n;printf("%d\n",a[pos]);}return 0;}

Simple Array Sum

#include<cstdio>#include<iostream>#include<cmath>#include<algorithm>#include<cstring>using namespace std;int n;int ans  = 0;int main(){scanf("%d",&n);int t;for(int i=1;i<=n;i++){scanf("%d",&t);ans+=t;}cout<<ans;return 0;}

solve me first

#include <stdio.h>#include <string.h>#include <math.h>#include <stdlib.h>int solveMeFirst(int a, int b) {  // Hint: Type return a+b; below return a+b;}int main() {  int num1,num2;  scanf("%d %d",&num1,&num2);  int sum;   sum = solveMeFirst(num1,num2);  printf("%d",sum);  return 0;}

Staircase

#include<cstdio>#include<iostream>#include<cmath>#include<algorithm>#include<cstring>using namespace std;int main(){int n;cin>>n;for(int i=1;i<=n;i++){for(int j=i;j<n;j++)cout<<" ";for(int j=1;j<=i;j++)cout<<"#";cout<<endl;}return 0;}

Time Conversion

#include<cstdio>#include<iostream>#include<algorithm>#include<cmath>#include<cstring>using namespace std;int hour,mini,sec;char s[2];int main(){scanf("%d:%d:%d",&hour,&mini,&sec);scanf("%s",s);if(*s=='P'){if(hour<12)hour+=12;}else{if(hour>=12)hour-=12;}printf("%02d:%02d:%02d",hour,mini,sec);return 0;}

1 0