Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
array integration
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
//Rextester.Program.Main is the entry point for your code. Don't change it. //Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5 using System; using System.Collections.Generic; using System.Linq; using System.Text.RegularExpressions; namespace Rextester { public class Program { public static void Main(string[] args) { Console.WriteLine("2 1 5 3 4 8 6 7"); char[] vetor = new char[]{'2','1','5','3','4', '8', '6', '7'}; int nTotElement = vetor.Length; int nCountTot = 0; for(int i = 0; i < (nTotElement - 1); i++) { int nCountAux = 0; int nValueCurr = (int)char.GetNumericValue(vetor[i]); for(int j = (i + 1); j < nTotElement; j++) { int nValueNext = (int)char.GetNumericValue(vetor[j]); if(nValueCurr > nValueNext) { nCountTot++; nCountAux++; } else { nCountAux = 0; break; } if(nCountAux > 2) { Console.WriteLine("Too long"); return; } } } Console.WriteLine("Integration = " + nCountTot); } } }
Show compiler warnings
[
+
]
Show input
Compilation time: 0,14 sec, absolute running time: 0,08 sec, cpu time: 0,09 sec, average memory usage: 13 Mb, average nr of threads: 3
edit mode
|
history
|
discussion