Pagini recente »
Istoria paginii runda/barajyakutia2015/clasament
|
Clasament 2018-12-06-test-6-2
|
Clasament concurs_cls6_v2
|
2014-11-04-clasa-8-tema-7
|
Cod sursă (job #513432)
Cod sursă (job
#513432)
#include <bits/stdc++.h>
using namespace std;
double x, y, dx, dy;
int ans, t, k;
void count (int k);
int main ()
{
ifstream cin("romb2.in");
ofstream cout("romb2.out");
cin >> t;
while (t--)
{
ans = 1;
cin >> dx >> dy >> k >> x >> y;
count (k);
cout << ans << '\n';
}
return 0;
}
void count (int k)
{
if (!k)
return;
ans *= 4;
if (x * dy < y * dx)
{
if (x * dy > -y * dx)
{
//Cadran 1
dx /= 2, dy /= 2;
y -= dy;
ans -= 3;
}
else
{
//Cadran 2
dx /= 2, dy /= 2;
x += dx;
ans -= 2;
}
}
else
{
if (x * dy > -y * dx)
{
//Cadran 4
dx /= 2, dy /= 2;
x -= dx;
}
else
{
//Cadran 3
dx /= 2, dy /= 2;
y += dy;
ans -= 1;
}
}
count (k - 1);
}