(I2
I151
I4
(dp0
Vsquares.%l
p1
(Vsquares.cpp
p2
S'// DAMANI TE IUBESTE!\r\n#include<cstdio>\r\n#define fin stdin\r\n#define fout stdout\r\n\r\nusing namespace std;\r\n\r\n//FILE *fin = fopen( "squares.in", "r" ), *fout = fopen( "squares.out", "w" );\r\n\r\nconst int nmax = 10;\r\nint n, ans;\r\nint st[ nmax + 1 ];\r\nstruct str{\r\n    int x1, x2, y1, y2;\r\n}v[ nmax + 1 ];\r\n\r\ninline int min2( int a, int b ) {\r\n    return ( a < b ? a : b );\r\n}\r\ninline int max2( int a, int b ) {\r\n    return ( a < b ? b : a );\r\n}\r\ninline int valabs( int a ) {\r\n    return ( a < 0 ? -a : a );\r\n}\r\nint intersectie( int pas ) {\r\n    if ( pas == 0 ) \r\n        return 0;\r\n    str sol = v[ st[ 1 ] ];\r\n    for( int i = 2; i <= pas; ++ i ) {\r\n        sol.x1 = max2( sol.x1, v[ st[ i ] ].x1 );\r\n        sol.x2 = min2( sol.x2, v[ st[ i ] ].x2 );\r\n        sol.y1 = max2( sol.y1, v[ st[ i ] ].y1 );\r\n        sol.y2 = min2( sol.y2, v[ st[ i ] ].y2 );\r\n    }\r\n    if ( sol.x1 <= sol.x2 && sol.y1 <= sol.y2 ) {\r\n        return ( sol.x2 - sol.x1 ) * ( sol.y2 - sol.y1 );\r\n    }\r\n    return 0;\r\n}\r\nvoid pinex( int semn, int ind, int pas ) {\r\n    ans += semn * intersectie( pas - 1 );\r\n    for( int i = ind + 1; i <= n; ++ i ) {\r\n       st[ pas ] = i;\r\n       pinex( -semn, i, pas + 1 );\r\n    }\r\n}\r\nstr patrat( int x, int y, int cx, int cy ) {\r\n    int dx = valabs( x - cx ), dy = valabs( y - cy );\r\n    str sol;\r\n    sol.x1 = x - dx;\r\n    sol.y1 = y - dy;\r\n    sol.x2 = x + dx;\r\n    sol.y2 = y + dy;\r\n    return sol;\r\n}\r\nint main() {\r\n    fscanf( fin, "%d", &n );\r\n    for( int i = 1; i <= n; ++ i ) {\r\n        int x, y, xx, yy;\r\n        fscanf( fin, "%d%d%d%d", &x, &y, &xx, &yy );\r\n        v[ i ] = patrat( x, y, xx, yy );\r\n    }\r\n    pinex( -1, 0, 1 );\r\n    fprintf( fout, "%d\\n", ans );\r\n    return 0;\r\n}\r\n'
p3
tp4
stp5
.