Pagini recente »
Istoria paginii runda/cel_mai_greuuuuu/clasament
|
Cod sursă (job #466018)
|
2019-12-19-test-7-1
|
Clasament adunare
|
Cod sursă (job #513382)
Cod sursă (job
#513382)
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
int v1[4], v2[4],dx, dy, pas, x, y, n;
int main(){
freopen("romb2.in", "r", stdin);
freopen("romb2.out", "w", stdout);
scanf("%d",&n);
for (int i=0; i<n; ++i) {
scanf("%d%d%d%d%d",&dx,&dy,&pas,&x,&y);
x *= dy;
y *= dx;
dx *= dy;
v2[0] = -dx;
v1[1] = dx;
v2[2] = dx;
v1[3] = -dx;
long long int rs = 0;
for (int j=0;j<pas; ++j) {
int a = (x > y);
int b = (x + y > 0);
int q = (a << 1) ^ (a == b);
x <<= 1;
y <<= 1;
x += v2[q];
y += v1[q];
rs = (rs << 2) ^ q;
}
printf("%d\n", rs+1);
}
return 0;
}