Pagini recente »
Borderou de evaluare (job #163695)
|
2018-06-07-clasa-5-tema-43
|
Istoria paginii runda/2022-02-17-clasa-6-concurs09-cursuri-performanta
|
Cod sursă (job #600905)
Cod sursă (job
#600905)
#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=1;
while(c==1)
{
c=0;
for(int i=2; i<=n; i++)
if(v[i-1]!=0 && v[i]>=v[i-1])
{
c=1;
v[i]=v[i]-v[i-1];
}
if(v[n]!=0 && v[1]>=v[n])
{
c=1;
v[1]=v[1]-v[n];
}
r++;
}
for(int i=1; i<=n; i++)
if(v[i]!=0)
t++;
out<<r<<" "<<t;
return 0;
}