Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <stdio.h> #include <string.h> int BrojPozitivni(int niza[], int n); int main() { int n; scanf("%d", &n); int niza[n + 1]; for(int i = 0; i < n; i++) { scanf("%d", &niza[i]); } printf("%d\n", BrojPozitivni(niza, n - 1)); return 0; } int BrojPozitivni(int niza[], int n) { if(n == -1) { // ako sme na kraj vrati 0 return 0; } if(niza[n] > 0) { return BrojPozitivni(niza, n - 1) + 1; } else { return BrojPozitivni(niza, n - 1) + 0; } }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
