結果
| 問題 |
No.332 数列をプレゼントに
|
| コンテスト | |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-12-26 01:44:44 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 7,021 bytes |
| コンパイル時間 | 1,157 ms |
| コンパイル使用メモリ | 117,708 KB |
| 実行使用メモリ | 26,464 KB |
| 最終ジャッジ日時 | 2024-09-19 00:09:22 |
| 合計ジャッジ時間 | 9,155 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | RE * 5 |
| other | RE * 42 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
//40_corner
using System;
using System.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
public class Solver
{
public void Solve()
{
IO.Printer.Out.NewLine = "\n";
var rand = new XRand(uint.Parse(Console.ReadLine()));
for (int i = 0; i < 100000; i++) rand.NextInt(0, 1145141919);
var ten = new long[13];
ten[0] = 1;
for (int i = 1; i < 13; i++)
ten[i] = ten[i - 1] * 10;
var MAX = BigInteger.Pow(10, 100);
var val = BigInteger.One;
var n = 100;
var a = new long[n];
for (int i = 0; i < n; i++)
{
if (i + 8 >= 27) a[i] = 1;
else a[i] = 1 << (i + 8);
}
a = a.OrderBy(x => rand.NextDouble()).ToArray();
while (val > MAX)
{
var pos = rand.NextInt(0, n - 1);
val /= a[pos];
a[pos] = rand.NextLong(1, a[pos]);
val *= a[pos];
}
{
var p = rand.NextInt(1, 7);
var X = rand.NextLong(ten[p], ten[p + 1]);
if (rand.NextDouble() < 0.5)
{
X &= long.MaxValue ^ (128);
}
else
{
X|=128;
}
IO.Printer.Out.WriteLine("{0} {1}", n, X);
IO.Printer.Out.WriteLine(a.AsJoinedString());
}
}
public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
}
}
#region main
static class Ex
{
static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
static public void Main()
{
var solver = new Program.Solver();
solver.Solve();
Program.IO.Printer.Out.Flush();
}
}
#endregion
#region Ex
namespace Program.IO
{
using System.IO;
using System.Text;
using System.Globalization;
public class Printer : StreamWriter
{
static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
public static Printer Out { get; set; }
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
}
public class StreamScanner
{
public StreamScanner(Stream stream) { str = stream; }
public readonly Stream str;
private readonly byte[] buf = new byte[1024];
private int len, ptr;
public bool isEof = false;
public bool IsEndOfStream { get { return isEof; } }
private byte read()
{
if (isEof) return 0;
if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
return buf[ptr++];
}
public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }
public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
public string ScanLine()
{
var sb = new StringBuilder();
for (var b = Char(); b != '\n'; b = (char)read())
if (b == 0) break;
else if (b != '\r') sb.Append(b);
return sb.ToString();
}
public long Long()
{
if (isEof) return long.MinValue;
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != 0 && b != '-' && (b < '0' || '9' < b));
if (b == 0) return long.MinValue;
if (b == '-') { ng = true; b = read(); }
for (; true; b = read())
{
if (b < '0' || '9' < b)
return ng ? -ret : ret;
else ret = ret * 10 + b - '0';
}
}
public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
public double Double() { var s = Scan(); return s != "" ? double.Parse(Scan(), CultureInfo.InvariantCulture) : double.NaN; }
private T[] enumerate<T>(int n, Func<T> f)
{
var a = new T[n];
for (int i = 0; i < n; ++i) a[i] = f();
return a;
}
public char[] Char(int n) { return enumerate(n, Char); }
public string[] Scan(int n) { return enumerate(n, Scan); }
public double[] Double(int n) { return enumerate(n, Double); }
public int[] Integer(int n) { return enumerate(n, Integer); }
public long[] Long(int n) { return enumerate(n, Long); }
}
}
#endregion
public class XRand
{
uint x, y, z, w;
public XRand() { init(); }
public XRand(uint s)
{
init();
init_xor128(s);
}
void init() { x = 314159265; y = 358979323; z = 846264338; w = 327950288; }
public void init_xor128(uint s)
{
z ^= s;
z ^= z >> 21; z ^= z << 35; z ^= z >> 4;
z *= 736338717;
}
uint next() { uint t = x ^ x << 11; x = y; y = z; z = w; return w = w ^ w >> 19 ^ t ^ t >> 8; }
public long NextLong(long m) { return (long)((((ulong)next() << 32) + next()) % (ulong)m); }
public int NextInt(int m) { return (int)(next() % m); }
public long NextLong(long min, long max) { return min + NextLong(max - min + 1); }
public int NextInt(int min, int max) { return min + NextInt(max - min + 1); }
public int NextIntP(int a) { return (int)Math.Pow(a, NextDouble()); }
public int NextIntP(int min, int max) { int diff = max - min; return min + NextIntP(diff + 2) - 1; }
public long NextLongP(long a) { return (long)Math.Pow(a, NextDouble()); }
public long NextLongP(long min, long max) { long diff = max - min; return min + NextLongP(diff + 2) - 1; }
public double NextDouble() { return (double)next() / uint.MaxValue; }
public double NextDoubleP(double a) { return Math.Pow(a, NextDouble()); }
}