solving problems

Author: AnneLivia

Online Judges/Neps Academy/Sorteio/Sorteio.cbp

@@ -0,0 +1,42 @@
+<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
+<CodeBlocks_project_file>
+<FileVersion major="1" minor="6" />
+<Project>
+<Option title="Sorteio" />
+<Option pch_mode="2" />
+<Option compiler="gcc" />
+<Build>
+<Target title="Debug">
+<Option output="bin/Debug/Sorteio" prefix_auto="1" extension_auto="1" />
+<Option object_output="obj/Debug/" />
+<Option type="1" />
+<Option compiler="gcc" />
+<Compiler>
+<Add option="-g" />
+</Compiler>
+</Target>
+<Target title="Release">
+<Option output="bin/Release/Sorteio" prefix_auto="1" extension_auto="1" />
+<Option object_output="obj/Release/" />
+<Option type="1" />
+<Option compiler="gcc" />
+<Compiler>
+<Add option="-O2" />
+</Compiler>
+<Linker>
+<Add option="-s" />
+</Linker>
+</Target>
+</Build>
+<Compiler>
+<Add option="-Wall" />
+<Add option="-fexceptions" />
+</Compiler>
+<Unit filename="main.cpp" />
+<Extensions>
+<code_completion />
+<envvars />
+<debugger />
+</Extensions>
+</Project>
+</CodeBlocks_project_file>

Online Judges/Neps Academy/Sorteio/Sorteio.depend

@@ -0,0 +1,5 @@
+# depslib dependency file v1.0
+1641675062 source:c:\users\annel\desktop\sorteio\main.cpp
+<iostream>
+<vector>
+

Online Judges/Neps Academy/Sorteio/Sorteio.layout

@@ -0,0 +1,10 @@
+<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
+<CodeBlocks_layout_file>
+<FileVersion major="1" minor="0" />
+<ActiveTarget name="Debug" />
+<File name="main.cpp" open="1" top="1" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+<Cursor>
+<Cursor1 position="91" topLine="0" />
+</Cursor>
+</File>
+</CodeBlocks_layout_file>

Online Judges/Neps Academy/Sorteio/bin/Debug/Sorteio.exe

@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main()
+{
+ int n;
+
+ cin >> n;
+
+ vector<int>v(n, 0);
+
+ for(int i = 0; i < n; i++) {
+ cin >> v[i];
+ }
+
+ int meio = n/2;
+ if (n % 2 == 0)
+ meio--;
+
+ cout << v[0] << "\n" << v[meio] << "\n" << v[n-1] << endl;
+
+ return 0;
+}