Java-Competitive-Programming/A.java at ConsistentHashing · joney000/Java-Competitive-Programming · GitHub

History

394 lines (337 loc) · 7.81 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

import java.util.*;

import java.lang.*;

import java.io.*;

import java.math.*;

/**

* Author : joney_000[developer.jaswant@gmail.com]

* Algorithm : Extended Euclid Algo: find 3 things X, Y, GCD(A, B) Such that X * A + Y * B = GCD(A, B)

* Time : O(MAX(A, B)) Space : O(MAX(A, B))

* Platform : Codeforces

* Ref : https://www.hackerearth.com/practice/math/number-theory/basic-number-theory-1/tutorial/

public class A{

private InputStream inputStream ;

private OutputStream outputStream ;

private FastReader in ;

private PrintWriter out ;

private final int BUFFER = 100005;

private final long mod = 1000000000+7;

private final int INF = Integer.MAX_VALUE;

private final long INF_L = Long.MAX_VALUE / 10;

public A(){}

public A(boolean stdIO)throws FileNotFoundException{

// stdIO = false;

if(stdIO){

inputStream = System.in;

outputStream = System.out;

}else{

inputStream = new FileInputStream("input.txt");

outputStream = new FileOutputStream("output.txt");

}

in = new FastReader(inputStream);

out = new PrintWriter(outputStream);

}

void run()throws Exception{

int n = i();

long ans = 0;

out.write(""+ans+"\n");

}

void clear(){

}

long gcd(long a, long b){

if(b == 0)return a;

return gcd(b, a % b);

}

long lcm(long a, long b){

if(a == 0 || b == 0)return 0;

return (a * b)/gcd(a, b);

}

long mulMod(long a, long b, long mod){

if(a == 0 || b == 0)return 0;

if(b == 1)return a;

long ans = mulMod(a, b/2, mod);

ans = (ans * 2) % mod;

if(b % 2 == 1)ans = (a + ans)% mod;

return ans;

}

long pow(long a, long b, long mod){

if(b == 0)return 1;

if(b == 1)return a;

long ans = pow(a, b/2, mod);

ans = mulMod(ans, ans, mod);

if(ans >= mod)ans %= mod;

if(b % 2 == 1)ans = mulMod(a, ans, mod);

if(ans >= mod)ans %= mod;

return ans;

}

// 20*20 nCr Pascal Table

long[][] ncrTable(){

long ncr[][] = new long[21][21];

for(int i = 0; i <= 20; i++){

ncr[i][0] = ncr[i][i] = 1L;

}

for(int j = 0; j <= 20; j++){

for(int i = j + 1; i <= 20; i++){

ncr[i][j] = ncr[i-1][j] + ncr[i-1][j-1];

}

return ncr;

}

int i()throws Exception{

return in.nextInt();

}

long l()throws Exception{

return in.nextLong();

}

double d()throws Exception{

return in.nextDouble();

}

char c()throws Exception{

return in.nextCharacter();

}

String s()throws Exception{

return in.nextLine();

}

BigInteger bi()throws Exception{

return in.nextBigInteger();

}

private void closeResources(){

out.flush();

out.close();

return;

}

// IMP: roundoff upto 2 digits

// double roundOff = Math.round(a * 100.0) / 100.0;

// or

// System.out.printf("%.2f", val);

// print upto 2 digits after decimal

// val = ((long)(val * 100.0))/100.0;

public static void main(String[] args) throws java.lang.Exception{

A driver = new A(true);

driver.run();

driver.closeResources();

}

class FastReader{

private boolean finished = false;

private InputStream stream;

private byte[] buf = new byte[4 * 1024];

private int curChar;

private int numChars;

private SpaceCharFilter filter;

public FastReader(InputStream stream){

this.stream = stream;

}

public int read(){

if (numChars == -1){

throw new InputMismatchException ();

}

if (curChar >= numChars){

curChar = 0;

try{

numChars = stream.read (buf);

} catch (IOException e){

throw new InputMismatchException ();

}

if (numChars <= 0){

return -1;

}

return buf[curChar++];

}

public int peek(){

if (numChars == -1){

return -1;

}

if (curChar >= numChars){

curChar = 0;

try{

numChars = stream.read (buf);

} catch (IOException e){

return -1;

}

if (numChars <= 0){

return -1;

}

return buf[curChar];

}

public int nextInt(){

int c = read ();

while (isSpaceChar (c))

c = read ();

int sgn = 1;

if (c == '-'){

sgn = -1;

c = read ();

}

int res = 0;

do{

if(c==','){

c = read();

}

if (c < '0' || c > '9'){

throw new InputMismatchException ();

}

res *= 10;

res += c - '0';

c = read ();

} while (!isSpaceChar (c));

return res * sgn;

}

public long nextLong(){

int c = read ();

while (isSpaceChar (c))

c = read ();

int sgn = 1;

if (c == '-'){

sgn = -1;

c = read ();

}

long res = 0;

do{

if (c < '0' || c > '9'){

throw new InputMismatchException ();

}

res *= 10;

res += c - '0';

c = read ();

} while (!isSpaceChar (c));

return res * sgn;

}

public String nextString(){

int c = read ();

while (isSpaceChar (c))

c = read ();

StringBuilder res = new StringBuilder ();

do{

res.appendCodePoint (c);

c = read ();

} while (!isSpaceChar (c));

return res.toString ();

}

public boolean isSpaceChar(int c){

if (filter != null){

return filter.isSpaceChar (c);

}

return isWhitespace (c);

}

public static boolean isWhitespace(int c){

return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;

}

private String readLine0(){

StringBuilder buf = new StringBuilder ();

int c = read ();

while (c != '\n' && c != -1){

if (c != '\r'){

buf.appendCodePoint (c);

}

c = read ();

}

return buf.toString ();

}

public String nextLine(){

String s = readLine0 ();

while (s.trim ().length () == 0)

s = readLine0 ();

return s;

}

public String nextLine(boolean ignoreEmptyLines){

if (ignoreEmptyLines){

return nextLine ();

}else{

return readLine0 ();

}

public BigInteger nextBigInteger(){

try{

return new BigInteger (nextString ());

} catch (NumberFormatException e){

throw new InputMismatchException ();

}

public char nextCharacter(){

int c = read ();

while (isSpaceChar (c))

c = read ();

return (char) c;

}

public double nextDouble(){

int c = read ();

while (isSpaceChar (c))

c = read ();

int sgn = 1;

if (c == '-'){

sgn = -1;

c = read ();

}

double res = 0;

while (!isSpaceChar (c) && c != '.'){

if (c == 'e' || c == 'E'){

return res * Math.pow (10, nextInt ());

}

if (c < '0' || c > '9'){

throw new InputMismatchException ();

}

res *= 10;

res += c - '0';

c = read ();

}

if (c == '.'){

c = read ();

double m = 1;

while (!isSpaceChar (c)){

if (c == 'e' || c == 'E'){

return res * Math.pow (10, nextInt ());

}

if (c < '0' || c > '9'){

throw new InputMismatchException ();

}

m /= 10;

res += (c - '0') * m;

c = read ();

}

return res * sgn;

}

public boolean isExhausted(){

int value;

while (isSpaceChar (value = peek ()) && value != -1)

read ();

return value == -1;

}

public String next(){

return nextString ();

}

public SpaceCharFilter getFilter(){

return filter;

}

public void setFilter(SpaceCharFilter filter){

this.filter = filter;

}

public interface SpaceCharFilter{

public boolean isSpaceChar(int ch);

}

class Pair implements Comparable<Pair>{

public int a;

public int b;

public Pair(){

this.a = 0;

this.b = 0;

}

public Pair(int a,int b){

this.a = a;

this.b = b;

}

public int compareTo(Pair p){

if(this.a == p.a){

return this.b - p.b;

}

return this.a - p.a;

}

@Override

public String toString(){

return "a = " + this.a + " b = " + this.b;

}

Java-Competitive-Programming/A.java at ConsistentHashing · joney000/Java-Competitive-Programming · GitHub

Expand file tree

Breadcrumbs

A.java

Latest commit

History

Breadcrumbs

A.java

File metadata and controls