#535743 (D) No.1175 Simultaneous Equations

• 問題: No.1175 Simultaneous Equations
• ユーザー: daut-dlang
• 提出日時: 2020-08-21 22:55:53
• 言語: D (dmd 2.106.1)
• 結果: WA
• 実行時間: -
• コード長: 2,281 bytes
• コンパイル時間: 2,346 ms
• コンパイル使用メモリ: 161,512 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-22 08:08:50
• 合計ジャッジ時間: 5,575 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	188 ms; 6,812 KB
testcase_01	AC	169 ms; 6,940 KB
testcase_02	AC	173 ms; 6,944 KB
testcase_03	AC	170 ms; 6,940 KB
testcase_04	AC	178 ms; 6,940 KB
testcase_05	AC	183 ms; 6,944 KB
testcase_06	AC	171 ms; 6,940 KB
testcase_07	AC	181 ms; 6,940 KB
testcase_08	AC	179 ms; 6,944 KB
testcase_09	AC	182 ms; 6,944 KB
testcase_10	AC	173 ms; 6,940 KB
testcase_11	WA	-
testcase_12	AC	173 ms; 6,944 KB

ソースコード

import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto a = RD;
	auto b = RD;
	auto c = RD;
	auto d = RD;
	auto e = RD;
	auto f = RD;

	double xx, yy;
	foreach (long i; 0..(10^^7)*4)
	{
		auto x = cast(double)(i - (10^^7)*2) / 10^^5;
		auto tmp1 = (a*x - c) / b;
		auto tmp2 = (d*x - f) / e;
		if (abs(tmp1 - tmp2) < 0.00001)
		{
			auto y = -(tmp1+tmp2) / 2;
			xx = x;
			yy = y;
			break;
		}
	}

	writef(FMT_F, xx);
	write(" ");
	writefln(FMT_F, yy);
	stdout.flush;
	debug readln;
}