Pagini recente »
Istoria paginii runda/2024-01-21-clasa-8-tema-14
|
Borderou de evaluare (job #492073)
|
Clasament lasm_03_03_2020_cl_12b_c_a
|
Istoria paginii runda/2020_9_sec
|
Cod sursă (job #600892)
Cod sursă (job
#600892)
#pragma GCC optimize ("O3")
#include <iostream>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <algorithm>
using namespace std;
ifstream in ("ruleta1.in");
ofstream out ("ruleta1.out");
int v[10001];
int main()
{
int n,r=0,t=0;
in>>n;
for(int i=1; i<=n; i++)
{
in>>v[i];
}
bool c=true;
while(c==true)
{
c=false;
for(int i=2; i<=n; i++)
if(v[i]>=v[i-1] && v[i-1]!=0)
{
c=true;
v[i]=v[i]-v[i-1];
}
if(v[1]>=v[n] && v[n]!=0)
{
c=true;
v[1]=v[1]-v[n];
}
r++;
}
for(int i=1; i<=n; i++)
if(v[i]!=0)
t++;
out<<r<<" "<<t;
return 0;
}