Submission #2163235

---

Source Code Expand

#include "bits/stdc++.h"

#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i, x, n) for(int i = x; i >= n; i--)
#define rrep(i, n) RREP(i,n,0)
#define pb push_back
#define show_table(n, k, table) rep(i,n){ rep(j,k) cout << table[i][j] << " "; cout << endl;}

using namespace std;

template<class T> inline void chmax(T& a,T const& b){a=max(a,b);}
template<class T> inline void chmin(T& a,T const& b){a=min(a,b);}

using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vi>;

const int mod=1e9+7,INF=1<<30;
const double EPS=1e-12,PI=3.1415926535897932384626;
const ll lmod = 1e9+7,LINF=1LL<<60;
const int MAX_N = 2003;

int main(){
  double X, Y; cin >> X >> Y;
  int cnt = 0;
  for (int x = floor(X) - 10; x <= X + 10; ++x) {
    for (int y = floor(Y) - 10; y <= Y + 10; ++y) {
      double dx = X - x;
      double dy = Y - y;
      double nx = dx * 1000 + x;
      double ny = dy * 1000 + y;
      if(abs(nx)<=10000&&abs(ny)<=10000){
        cout << x << " " << y << " " << nx << " " << ny << endl;
        cnt++;
        if (cnt == 2) return 0;
      }
    }
  }
}

Submission Info

Judge Result