#include<cstdio>#include<cstring>#include<climits>#include<string>#include<algorithm>#include<cmath>#include<iostream>#include<queue>#include<vector>#include<stack>#include<map>#include<set>#include<stdlib.h>using namespace std;#define Fi first#define Se second#define Mpair make_pair#define Pb push_backtypedef long long ll;typedef pair<int, int> pii;typedef pair<ll, ll> pll;//void MoreStack() { int size = 256 << 20; char *p = (char*)malloc(size) + size; __asm__("movl %0, %%esp\n" :: "r"(p) );}void io_in_data() { freopen("1.txt", "r", stdin);freopen("data1.out", "w", stdout); }template<class T> void show(T *a, int n) { for(int i = 0; i < n; i++) cout<<a[i]<<" "; puts(""); }//#include<windows.h>//void showTime() { SYSTEMTIME sys; GetLocalTime( &sys ); printf("%d.%d\n", sys.wSecond, sys.wMilliseconds); }#pragma comment(linker, "/STACK:10240000000000,10240000000000")//LLONG_MAX INT_MAXconst int INTINF = INT_MAX;const ll LLINF = LLONG_MAX;const int MOD = INT_MAX;const int MAXN = 10007;// memset(d, 0x3f, sizeof(d)); d[0] = 4557430888798830399/*long long*/ 1061109567/*int*/int fe[MAXN], to[MAXN<<1], w[MAXN<<1], ne[MAXN<<1], ecnt;void addedge(int u, int v, int c) { to[ecnt] = v; w[ecnt] = c; ne[ecnt] = fe[u]; fe[u] = ecnt++;}inline int readint() { char c = getchar(); while(!isdigit(c)) c = getchar(); int ret = 0; while(isdigit(c)) { ret = ret*10 + c-'0'; c = getchar(); } return ret;}int buf[11];inline void writeint(int i) { int p = 0; if(i == 0) buf[p++] = 0; while(i) { buf[p++] = i%10; i /= 10; } while(p) putchar('0' + buf[--p]);}int inLR(int a, int L, int R) { return a >= L && a <= R; }int movR[]= {1, -1, 0, 0};int movC[] = {0, 0, 1, -1};struct Det { int v00, v01, v10, v11; void init(int t00, int t01, int t10, int t11) { v00 = t00, v01 = t01, v10 = t10, v11 = t11; } Det operator * (Det a) const { Det ret; ret.v00 = (v00*a.v00%MOD + v01*a.v10%MOD) % MOD; ret.v01 = (v00*a.v01%MOD + v01*a.v11%MOD) % MOD; ret.v10 = (v10*a.v00%MOD + v11*a.v10%MOD) % MOD; ret.v11 = (v10*a.v01%MOD + v11*a.v11%MOD) % MOD; return ret; }}; Det Dpower(Det v, int n) { if(n == 1) return v; Det ret = Dpower(v, n/2); ret = ret*ret; if(n&1) ret = ret*v; return ret;}int a[MAXN], b[MAXN], cnt[1007][1007];int main() { io_in_data(); int n = 0, x, y; memset(cnt, 0, sizeof(cnt)); while(~scanf("%d%d", &x, &y)) { a[n] = x, b[n++] = y; cnt[x][y]++; } for(int i = 0; i < n; i++) printf("%8d%8d%8d\n", a[i], b[i], cnt[a[i]][b[i]]); return 0;}#include<cstdio>#include<cstring>#include<cmath>#include<stack>#include<queue>#include<vector>#include<algorithm>#include<iostream>#include<windows.h>#include<ctime>using namespace std;typedef long long ll;const int MAXN = 107;char s[MAXN], num[MAXN], org[MAXN];int a[MAXN];int vis[MAXN];int main() { //freopen("data.in", "r", stdin); freopen("data.in", "w", stdout); srand((unsigned)time(NULL)); int T = 200; int MOD = 1000; int MODX = 400; printf("%d\n", T); while(T--) { int w = rand()%MOD+1; int h = rand()%MOD+1; int n = rand()%MOD+1; printf("%d %d\n%d\n", w, h, n); while(n--) { int t = 4; while(t--) printf("%d ", rand()%MODX-MODX/4); puts(""); } } return 0;}#include<cstdio>#include<cstring>#include<cmath>#include<stack>#include<queue>#include<vector>#include<algorithm>#include<iostream>#include<windows.h>#include<ctime>using namespace std;typedef long long ll;int main() { FILE *fstd = fopen("data.out", "r"); FILE *fj = fopen("data1.out", "r"); if(fstd != NULL && fj != NULL) { int yes = 1; while(!feof(fstd)) { char cstd = fgetc(fstd); char cj = fgetc(fj); if(cstd != cj) { char ss[107], sj[107]; fscanf(fstd, "%s", ss); fscanf(fj, "%s", sj); puts(ss); puts(sj); yes = 0; break; } } if(yes && !feof(fj)) yes = 0; puts(yes ? "YES" : "NO"); } getchar(); fclose(fstd); fclose(fj); return 0;}
