F1 stringlengths 6 6 | F2 stringlengths 6 6 | text_1 stringlengths 20 200k | text_2 stringlengths 20 200k | label int64 0 1 |
|---|---|---|---|---|
C10132 | C10131 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string.h>
#include <iostream>
using namespace std;
char dict[100];
char word1[] = {"zyeqejp mysljylc kd kxveddknmc re jsicpdrysirbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcdde kr kd eoya kw aej tysr re ujdr lkgc jv"};
char word2[] = {"qaozour languag... | 0 |
C10132 | C10145 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define For(i, a, b) for (int i = (a); i != b;... | 0 |
C10132 | C10147 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | /*****************************************************************************
*************************** Macros and Typedefs *****************************
*****************************************************************************/
// #pragma stacksize 1M twice
// #pragma comment(linked, "/STACK:16777216")
#inc... | 0 |
C10132 | C10005 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #pragma once
// -- libs includes
#include "core/types.h"
// ================================================================================================
// Class for managing a sieve for more quickly searching for prime numbers
// ===================================================================================... | 0 |
C10132 | C10022 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #pragma once
// -- libs includes
#include "core/types.h"
// ================================================================================================
// A class for taking high precision timings
// ================================================================================================
class CTimer {
... | 0 |
C10132 | C10104 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <stdio.h>
#include <memory.h>
#include <vector>
#include <algorithm>
using namespace std;
int N, M, D;
#define MAX 3010
int SX, SY;
bool or[MAX][MAX];
bool original[MAX][MAX];
bool matr[MAX][MAX];
int gcd(int a, int b)
{
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
return gcd(b, a % b);
}
int... | 0 |
C10132 | C10156 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
#include<ctype.h>
#include<iostream>
#include<iomanip>
#include<sstream>
#include<algorithm>
#include<functional>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<complex>
#d... | 0 |
C10132 | C10327 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define max(x, y) ((x)>(y)?(x):(y))
#define min(x, y) ((x)<(y)?(x):(y))
#define abs(x) ((x)<0?-(x):(x))
char buf[1024];
typedef long long int64;
int R, C, D;
int pnt_len = 0;
typedef struct pnt_s {
int r;
int c;
} pnt_t;
pnt_t pnt[10000];
i... | 0 |
C10132 | C10085 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <sstream>
#include <cstddef>
#include <algorithm>
#include <utility>
#include <iterator>
#include <numeric>
#include <list>
#include <... | 0 |
C10132 | C10084 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#define MAXN 105
using namespace std;
struct node
{
int x, y;
bool operator<(const node& p) const
{
return ((x * p.y - y * p.x) < 0);
}
};
int GetVec (struct node a, struct node b)
{
return a.x * b.y ... | 0 |
C10132 | C10032 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include "stdafx.h"
| 0 |
C10132 | C10301 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <sstream>
#include <Windows.h>
#include <boost/rational.hpp>
#include <boost/tokenizer.hpp>
using namespace std;
class FileReader : public ifstream
{
public:
FileReader( const stri... | 0 |
C10132 | C10144 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <cstdio>
#include <algorithm>
#include <queue>
#include <cmath>
#define REP(i,n) for(int i=0; i<(int)(n); i++)
inline int getInt(){ int s; scanf("%d", &s); return s; }
using namespace std;
char g[64][64];
int main(){
int t = getInt();
REP(cc, t){
int h = getInt();
int w = getInt();
int d =... | 0 |
C10132 | C10236 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <map>
#include <set>
using namespace std;
typedef long long LL;
typedef unsigned int UINT32;
vector<pair<int,int> > getMirrors(int r, int c, int H, int W)
{
vector<pair<int,... | 0 |
C10132 | C10298 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <iostream>
#include <cstdlib>
using namespace std;
const int DIM_MAX = 35, D_MAX = 55;
int H, W, D;
int h_scale, w_scale;
int you_x, you_y;
bool base_grid[DIM_MAX][DIM_MAX];
bool nav_info[3][3];
bool direct_reflection(int dx, int dy) {
int cur_x = you_x, cur_y = you_y;
int dist = -1;
while (!base_gr... | 0 |
C10132 | C10255 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <iostream>
#include <assert.h>
#include <cmath>
#include <set>
using namespace std;
#define FOR(i,n) for (int i = 0; i < n; i++)
#define abs(x) ((x)<0?(-(x)):(x))
#define REP(i,v) for (unsigned i... | 0 |
C10132 | C10191 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#define N 1000010
using namespace std;
char room[40][40];
int h, w, d;
struct Point {
int x, y;
Point (int _x = 0, int _y = 0) {
x ... | 0 |
C10132 | C10087 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <iostream>
#include <vector>
#include <utility>
#include <set>
#include <map>
#include <algorithm>
#include <limits>
#include <sstream>
#include <string>
#include <numeric>
#include <iterator>
#include <boost/rational.hpp>
using namespace std;
using namespace boost;
#define PRINT(E)\
do {\
cerr << #E ": "... | 0 |
C10132 | C10053 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <set>
#include <fstream>
#include <string>
using namespace std;
typedef pair<int, int> pii;
namespace {
static int GCD(int a, int b) { return b==0 ? a : GCD(b,a%b); }
};
int main()
{
ifstream fin("D-small-attempt0.in");
ofstream fout("D-small-attempt0.out");
unsigned int numberOfCases;
fin >> numberOfC... | 0 |
C10132 | C10272 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <iomanip>
#include <sstream>
#include <cstring>
#include <string>
#include <cmath>
#include <stack>
#include <list>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utilit... | 0 |
C10132 | C10038 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <stdio.h>
#define SQR(x) ((x) * (x))
inline int sign(int x) {
if (x == 0) return 0;
if (x > 0) return 1;
if (x < 0) return -1;
}
inline int abs(int x) {
if (x > 0) return x; else return -x;
}
const int MAXN = 60;
int n, m, d;
char map[MAXN][MAXN];
int posx, posy;
int pts[20000][2];
int main() {
int ... | 0 |
C10132 | C10284 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <iostream>
#include <string>
#include <utility>
#include <vector>
#include <cstdlib>
using namespace std;
bool within_range(long long int x_, long long int y_, long long int x, long long int y, long long int d)
{
return (x-x_)*(x-x_)+(y-y_)*(y-y_) <= d*d;
}
int sgn(int n)
{
if (n < 0)
{
r... | 0 |
C10132 | C10252 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #define _CRT_SECURE_NO_DEPRECATE
#include<iostream>
#include<string>
#include<sstream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<numeric>
#include<math.h>
#include<set>
#include<map>
#include<fstream>
#define epsilon 0.000000001
#define cosinusa(a, b, c) ((a * a + b * b - c * c) / (2.0 *... | 0 |
C10132 | C10029 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include "StdAfx.h"
#include "GoogleCase.h"
GoogleCase::GoogleCase()//)QObject* parent /*= 0*/)
// : QObject(parent)
{
}
GoogleCase::~GoogleCase()
{
}
| 0 |
C10132 | C10262 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | // mirror.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <fstream>
#include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <deque>
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
std::ifstream cin(argv[1]);
std::... | 0 |
C10132 | C10325 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cfloat>
#include <climits>
#include <numeric>
#include <ctime>
using namespac... | 0 |
C10132 | C10023 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #pragma once
#define ArraySize_(a) (sizeof(a)/sizeof(a[0]))
#define recast_ reinterpret_cast
#define stcast_ static_cast
| 0 |
C10132 | C10331 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
struct pt
{
long x;
long y;
pt(){}
pt(long x_,long y_):x(x_),y(y_){}
long abs2(){return x*x+y*y;}
pt operator+(const pt &p){return pt(x+p.x,y+p.y);}
pt operator-(const pt &p){return pt(x-p.x,y-p.y);}
bool operator==(const pt &p){re... | 0 |
C10132 | C10249 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <iostream>
#include <string>
using namespace std;
#include <assert.h>
const unsigned maxT = 100;
const unsigned maxHW = 100;
const unsigned maxD = 50;
unsigned H, W, D;
unsigned myH, myW;
char map[maxHW][maxHW];
unsigned gcd(int m, int n) {
assert(m > 0 && n > 0);
if (m > n) {
int t = m;
... | 0 |
C10132 | C10245 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | /*
* main.cpp
*
* Created on: 2011/09/24
* Author: taik
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <float.h>
#include <vector>
#include <set>
#include <list>
#include <algorithm>
typedef long long s64;
#define debug_printf printf
//#define debug_printf
struc... | 0 |
C10132 | C10040 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x... | 0 |
C10132 | C10082 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include... | 0 |
C10132 | C10212 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned long ul;
typedef unsigned short us;
typedef unsigned char uc;
int gcd(int x,int y){int t;if(!x)return y;for(y%=x;y;t=y,y=x%y,x=t);return... | 0 |
C10132 | C10058 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include <stdio.h>
#include <map>
using namespace std;
int h, w, d;
char in[50][50];
int s[4][2], x, y;
map<int, map<int, int> > mark;
int gcd(int x, int y) {
int c;
if(x == 0) return y;
if(y == 0) return x;
while(c = x % y) {
x = y;
y = c;
}
return y;
}
int abs(int x) {
if(x < 0) x = -x;
return x;
... | 0 |
C10132 | C10282 | #include <cstdio>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long LL;
char a[1 << 5][1 << 5];
const int dx[4] = {-1, -1, 1, 1};
const int dy[4] = {-1, 1, 1, -1};
int h, w, d, t;
int sx, sy;
set<pair<int, int> > S;... | #include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
using namespace std;
const double eps = 1e-7;
int n, m, k, sx, sy;
char s[35][35];
bool u[105][105];
int gcd(int a, int b) {
if(b==0) return a;
else return gcd(b, a%b);
}
double get(double x, double d) {
if(d > eps) {
double res = (int)... | 0 |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 3