Pagini recente » Cod sursa (job #959197) | Cod sursa (job #2887965) | Cod sursa (job #7751) | Cod sursa (job #620791) | Cod sursa (job #1548636)
#include <fstream>
int v[1020] , v2[1020];
using namespace std;
ifstream in ("aprindere.in");
ofstream out ("aprindere.out");
int main()
{
int n , m , i , timp , j;
for (i = 0; i<n ; i++) in >> v[i];
in >> v2[0],v2[1],v2[2];
for (i = 0; i < v2[2]; i++) in >> v2[i+3];
timp=0;
for (i=0; i < n; i++)
{
if (v2[0] == i && v[i]==0)
{
timp += v2[1];
for (j=0; j < v2[2]; j++)
{
v[v2[3+j]]=(v[v2[3+j]]+1)%2;
}
in >> v2[0] >> v2[1] >> v2[2] ;
for (j=0; j<v2[2]; j++) in >>v2[j+3];
}
else if (v2[0]<=i)
{
in >> v2[0] >> v2[1] >> v2[2];
for (j=0; j<v2[2]; j++) in >> v2[j+3];
}
}
out << timp;
return 0;
}