1 solutions
-
0
C :
#include <stdio.h> int main() { int n; scanf("%d", &n); int sum = 0, num; while (n --) { scanf("%d", &num); if (!(num % 2)) { sum += num; } } printf("%d\n", sum); return 0; }C++ :
#include <stdio.h> int a[100000]; int main() { int n; while(scanf("%d",&n)!=EOF) { long long sum=0; for(int i=0;i<n;i++) { scanf("%d",&a[i]); if(a[i]%2==0) sum+=a[i]; } printf("%lld\n",sum); } return 0; }Pascal :
var i,n,s:longint; a:array[1..99999]of longint; begin readln(n); for i:=1 to n do begin read(a[i]); if a[i] mod 2=0 then s:=s+a[i]; end; writeln(s); end.
- 1
Information
- ID
- 16704
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- (None)
- # Submissions
- 0
- Accepted
- 0
- Uploaded By