<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Cs on Codingpedia</title><link>http://docs.codingferpa.org/tags/cs/</link><description>Recent content in Cs on Codingpedia</description><generator>Hugo</generator><language>pt-br</language><lastBuildDate>Mon, 20 Oct 2025 00:00:00 +0000</lastBuildDate><atom:link href="http://docs.codingferpa.org/tags/cs/index.xml" rel="self" type="application/rss+xml"/><item><title>desafio 1</title><link>http://docs.codingferpa.org/docs/cs/6-semestre/prog-comp/desafio-1/</link><pubDate>Mon, 20 Oct 2025 00:00:00 +0000</pubDate><guid>http://docs.codingferpa.org/docs/cs/6-semestre/prog-comp/desafio-1/</guid><description>&lt;p>&lt;a href="https://olimpiada.ic.unicamp.br/static/extras/obi2025/provas/ProvaOBI2025_f3ps.pdf" rel="external" target="_blank">https://olimpiada.ic.unicamp.br/static/extras/obi2025/provas/ProvaOBI2025_f3ps.pdf&lt;svg width="16" height="16" viewBox="0 0 24 24" xmlns="http://www.w3.org/2000/svg">&lt;path fill="currentColor" d="M14 5c-.552 0-1-.448-1-1s.448-1 1-1h6c.552 0 1 .448 1 1v6c0 .552-.448 1-1 1s-1-.448-1-1v-3.586l-7.293 7.293c-.391.39-1.024.39-1.414 0-.391-.391-.391-1.024 0-1.414l7.293-7.293h-3.586zm-9 2c-.552 0-1 .448-1 1v11c0 .552.448 1 1 1h11c.552 0 1-.448 1-1v-4.563c0-.552.448-1 1-1s1 .448 1 1v4.563c0 1.657-1.343 3-3 3h-11c-1.657 0-3-1.343-3-3v-11c0-1.657 1.343-3 3-3h4.563c.552 0 1 .448 1 1s-.448 1-1 1h-4.563z"/>&lt;/svg>&lt;/a>&lt;/p>
&lt;p>problema 1 (fotos) - conceios chaves:&lt;/p>
&lt;p>esse problema espera a contagem de subvetores continuos que contem exatamente um numero 1. Um par (l, r) representa um subvetor que vai do indice l ate o indice r (inclusive).&lt;/p></description></item></channel></rss>