#include using namespace std; int main() { int jiaoshu,j[100],tongji=0; cin>>jiaoshu; for(int i=0;i<jiaoshu;i++) { cin>>j[i]; } for(int i=0;i<jiaoshu;i++) { if(j[i]==90 || j[i]==270) { tongji=tongji+1; } } cout<<tongji; return 0; }

C :

#include <stdio.h>
int main()
{
	int n,counter,a[100];
	while(scanf("%d",&n)==1)
	{
		counter=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]==90)
				counter++;
		}
		printf("%d\n",counter);
		break;
	}
	return 0;
}

C++ :

#include<iostream>
using namespace std;
int main()
{
    int n,a,count=0;
    cin>>n;
    while(n--)
    {
        cin>>a;
        if(a==90)
            count++;
    }
    cout<<count<<endl;
    return 0;
}

Pascal :

var
  i,n,s:integer;
  a:array[1..1000] of integer;
begin
  readln(n);
  for i:=1 to n do
  read(a[i]);
  for i:=1 to n do
    if a[i]=90 then 
      inc(s);
  write(s);
end.

Python :

# coding=utf-8
N=int(input())
S=input()
Arr=S.split(' ')
count=0
#扫描整个列表
i=0
while i<len(Arr):
    if Arr[i]=='90':
        count+=1
    i+=1
print(count)

自己的题解

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int g,n,s=0;
	cin>>g;
	for(int i=0;i<g;i++)
	{
		cin>>n;
		if(n==90)
		{
			s+=1;
		}
	}
	cout<<s;
	return 0;
}