id stringlengths 6 117 | description stringlengths 29 13k | code stringlengths 9 465k | language class label 4
classes | test_samples dict | source class label 5
classes |
|---|---|---|---|---|---|
shils-romantic-message_2600 | Shil is now finally in a relationship with Uttu. Both of them like to exchange love letters. However, to avoid exposing their relationship, they use "encryption" to send their messages. They use the famous Caesar cipher to encrypt their messages, which mathematically explained is as follows:
Encryption of a letter x b... | def find(s):
n=26-(ord(s[0])-ord('a'))
z="z"
out=""
for i in s:
if ord(i)+n <= ord(z):
out+=chr(ord(i)+n)
else:
x=ord(z)-ord(i)
y=n-x-1
out+=chr(ord('a')+y)
print out
if __name__ == '__main__':
t=int(raw_input())
while t>0:
s=raw_input()
find(s)
t-=1 | 1Python2 | {
"input": [
"1\nphqghumeay\n\nSAMPLE",
"100\nphqghumeaylnlfdxfircvscxggbwkfnqduxwfnfozvsrtkjprepggxrpnrvystmwcysyycqpevikeffmznimkkasvwsrenzkycxf\nxtlsgypsfadpooefxzbcoejuvpvaboygpoeylfpbnpljvrvipyamyehwqnqrqpmxujjloovaowuxwhmsncbxcoksfzkvatxdknly\njyhfixjswnkkufnuxxzrzbmnmgqooketlyhnkoaugzqrcddiuteiojwayyzp... | 3HACKEREARTH |
the-reversed-numbers_2601 | HackerMan has a message that he has coded in form of digits, which means that the message contains only numbers and nothing else. He is fearful that the enemy may get their hands on the secret message and may decode it. HackerMan already knows the message by heart and he can simply destroy it.
But he wants to keep it ... | import string
t=int(raw_input())
while t:
s=[]
a,b=raw_input().split()
c=int(a[::-1])+int(b[::-1])
print string.lstrip(str(c)[::-1],'0')
t=t-1 | 1Python2 | {
"input": [
"3\n353 575\n238746 39857\n890 231\n\nSAMPLE",
"994\n4789 1537\n2363 1131\n3948 2406\n4077 621\n4449 387\n406 3977\n2759 878\n1058 3651\n2356 1943\n3039 2573\n3138 2424\n1371 518\n4387 4339\n1646 2566\n387 481\n1633 2163\n3508 1815\n1011 2131\n3314 2819\n2842 3282\n4031 631\n67 4941\n3264 4893\n6... | 3HACKEREARTH |
p02539 ACL Beginner Contest - Heights and Pairs_2602 | There are 2N people numbered 1 through 2N. The height of Person i is h_i.
How many ways are there to make N pairs of people such that the following conditions are satisfied? Compute the answer modulo 998,244,353.
* Each person is contained in exactly one pair.
* For each pair, the heights of the two people in the pai... | #include <bits/stdc++.h>
#define MOD (int)(998244353)
using namespace std;
template <int mod = (int)(998244353)>
struct NTT {
int base, maxb, root;
vector<int> rv, roots, invr;
NTT() : base(1), rv({0, 1}), roots({0, 1}), invr({0, 1}) {
assert(mod >= 3 && mod & 1);
int tmp = mod - 1;
maxb = 0;
whi... | 2C++ | {
"input": [
"2\n1\n1\n2\n3",
"5\n30\n10\n20\n40\n20\n10\n10\n30\n50\n60",
"2\n1\n1\n2\n5",
"5\n30\n10\n20\n65\n20\n10\n10\n30\n50\n60",
"5\n30\n10\n20\n65\n20\n10\n10\n3\n50\n100",
"5\n30\n10\n38\n65\n20\n10\n10\n3\n50\n100",
"2\n0\n1\n6\n7",
"5\n30\n10\n38\n65\n20\n9\n10\n3\n50\n100"... | 5ATCODER |
p02539 ACL Beginner Contest - Heights and Pairs_2603 | There are 2N people numbered 1 through 2N. The height of Person i is h_i.
How many ways are there to make N pairs of people such that the following conditions are satisfied? Compute the answer modulo 998,244,353.
* Each person is contained in exactly one pair.
* For each pair, the heights of the two people in the pai... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import defaultdict
from collections import deque
import heapq
MOD = 998244353
def DD(arg): return defaultdict(arg)
def inv(n): return pow(n, MOD-2, MOD)
kaijo_memo = []
def kaijo(n):
if(len(kaijo_memo) > n): return kaijo_memo[n... | 3Python3 | {
"input": [
"2\n1\n1\n2\n3",
"5\n30\n10\n20\n40\n20\n10\n10\n30\n50\n60",
"2\n1\n1\n2\n5",
"5\n30\n10\n20\n65\n20\n10\n10\n30\n50\n60",
"5\n30\n10\n20\n65\n20\n10\n10\n3\n50\n100",
"5\n30\n10\n38\n65\n20\n10\n10\n3\n50\n100",
"2\n0\n1\n6\n7",
"5\n30\n10\n38\n65\n20\n9\n10\n3\n50\n100"... | 5ATCODER |
p02539 ACL Beginner Contest - Heights and Pairs_2604 | There are 2N people numbered 1 through 2N. The height of Person i is h_i.
How many ways are there to make N pairs of people such that the following conditions are satisfied? Compute the answer modulo 998,244,353.
* Each person is contained in exactly one pair.
* For each pair, the heights of the two people in the pai... | import java.io.InputStream;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
public class Main {
static final long mod = Const.MOD998244353;
static final ModArithmetic ma = ModArithmetic.of(mod);
static final ... | 4JAVA | {
"input": [
"2\n1\n1\n2\n3",
"5\n30\n10\n20\n40\n20\n10\n10\n30\n50\n60",
"2\n1\n1\n2\n5",
"5\n30\n10\n20\n65\n20\n10\n10\n30\n50\n60",
"5\n30\n10\n20\n65\n20\n10\n10\n3\n50\n100",
"5\n30\n10\n38\n65\n20\n10\n10\n3\n50\n100",
"2\n0\n1\n6\n7",
"5\n30\n10\n38\n65\n20\n9\n10\n3\n50\n100"... | 5ATCODER |
p02670 AtCoder Grand Contest 044 - Joker_2605 | Tonight, in your favourite cinema they are giving the movie Joker and all seats are occupied. In the cinema there are N rows with N seats each, forming an N\times N square. We denote with 1, 2,\dots, N the viewers in the first row (from left to right); with N+1, \dots, 2N the viewers in the second row (from left to rig... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
int N;
cin >> N;
vector<vector<int>> dist(N,vector<int>(N));
for(int i = 0; i < N; ++i)
for(int j = 0; j < N; ++j)
dist[i][j] = min({i,N-1-i,j,N-1-j});
int ans = 0;
... | 2C++ | {
"input": [
"4\n6 7 1 4 13 16 10 9 5 11 12 14 15 2 3 8",
"6\n11 21 35 22 7 36 27 34 8 20 15 13 16 1 24 3 2 17 26 9 18 32 31 23 19 14 4 25 10 29 28 33 12 6 5 30",
"3\n1 3 7 9 5 4 8 6 2",
"3\n2 3 7 9 5 4 8 6 1",
"3\n1 3 7 9 5 8 4 6 2",
"3\n1 6 7 9 5 4 8 3 2",
"3\n2 4 7 9 5 3 8 6 1",
"3\... | 5ATCODER |
p02670 AtCoder Grand Contest 044 - Joker_2606 | Tonight, in your favourite cinema they are giving the movie Joker and all seats are occupied. In the cinema there are N rows with N seats each, forming an N\times N square. We denote with 1, 2,\dots, N the viewers in the first row (from left to right); with N+1, \dots, 2N the viewers in the second row (from left to rig... | import sys
input = sys.stdin.readline
n = int(input())
l = list(map(int,input().split()))
l = [((i-1)//n, (i-1) % n) for i in l]
check = [[1]*n for i in range(n)]
d = [[min(i, n-i-1, j, n-j-1) for j in range(n)] for i in range(n)]
ans = 0
for x,y in l:
check[x][y] = 0
ans += d[x][y]
q = [(x,y,d[x][y])]
... | 3Python3 | {
"input": [
"4\n6 7 1 4 13 16 10 9 5 11 12 14 15 2 3 8",
"6\n11 21 35 22 7 36 27 34 8 20 15 13 16 1 24 3 2 17 26 9 18 32 31 23 19 14 4 25 10 29 28 33 12 6 5 30",
"3\n1 3 7 9 5 4 8 6 2",
"3\n2 3 7 9 5 4 8 6 1",
"3\n1 3 7 9 5 8 4 6 2",
"3\n1 6 7 9 5 4 8 3 2",
"3\n2 4 7 9 5 3 8 6 1",
"3\... | 5ATCODER |
p02670 AtCoder Grand Contest 044 - Joker_2607 | Tonight, in your favourite cinema they are giving the movie Joker and all seats are occupied. In the cinema there are N rows with N seats each, forming an N\times N square. We denote with 1, 2,\dots, N the viewers in the first row (from left to right); with N+1, \dots, 2N the viewers in the second row (from left to rig... | import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.Math.min;
import static java.lang.System.exit;
import static java.util.Arrays.fill;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import j... | 4JAVA | {
"input": [
"4\n6 7 1 4 13 16 10 9 5 11 12 14 15 2 3 8",
"6\n11 21 35 22 7 36 27 34 8 20 15 13 16 1 24 3 2 17 26 9 18 32 31 23 19 14 4 25 10 29 28 33 12 6 5 30",
"3\n1 3 7 9 5 4 8 6 2",
"3\n2 3 7 9 5 4 8 6 1",
"3\n1 3 7 9 5 8 4 6 2",
"3\n1 6 7 9 5 4 8 3 2",
"3\n2 4 7 9 5 3 8 6 1",
"3\... | 5ATCODER |
p02799 Keyence Programming Contest 2020 - Bichromization_2608 | We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers D_1, D_2, ..., D_N.
Determine whether the conditions below can be satisfied by assigning a color - white or black - to each v... | #include<bits/stdc++.h>
#define LL long long
#define uLL unsigned long long
using namespace std;
const int N=2e5+10,inf=1e9;
int rd()
{
int x=0,w=1;char ch=0;
while(ch<'0'||ch>'9'){if(ch=='-') w=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+(ch^48);ch=getchar();}
return x*w;
}
int to[N<<1],nt[N<<1],... | 2C++ | {
"input": [
"5 5\n3 4 3 5 7\n1 2\n1 3\n3 2\n4 2\n4 5",
"4 6\n1 1 1 1\n1 2\n1 3\n1 4\n2 3\n2 4\n3 4",
"5 7\n1 2 3 4 5\n1 2\n1 3\n1 4\n2 3\n2 5\n3 5\n4 5",
"5 5\n3 4 3 5 7\n1 2\n0 3\n3 2\n4 2\n4 5",
"4 6\n1 1 1 1\n1 2\n1 3\n2 4\n2 3\n2 4\n3 4",
"5 7\n1 1 3 4 5\n1 2\n1 3\n1 4\n2 3\n2 5\n3 5\n4 5... | 5ATCODER |
p02799 Keyence Programming Contest 2020 - Bichromization_2609 | We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers D_1, D_2, ..., D_N.
Determine whether the conditions below can be satisfied by assigning a color - white or black - to each v... | """
明らかに無理→最小が2つ無い or 最小同士がペアになってない
(最小から接続する頂点に最小がない)
満たしてる→最小の辺を置いちゃおう
小さい奴からGreedyに置いてく？
自分の周りにendしてるやつ or 大きさが同じやつがあったら繋げちゃう
そのとき白黒はどうでも良さそう？
"""
import sys
N,M = map(int,input().split())
D = list(map(int,input().split()))
dic2 = [[] for i in range(N)]
for i in range(M):
U,V = map(int,input().split())
... | 3Python3 | {
"input": [
"5 5\n3 4 3 5 7\n1 2\n1 3\n3 2\n4 2\n4 5",
"4 6\n1 1 1 1\n1 2\n1 3\n1 4\n2 3\n2 4\n3 4",
"5 7\n1 2 3 4 5\n1 2\n1 3\n1 4\n2 3\n2 5\n3 5\n4 5",
"5 5\n3 4 3 5 7\n1 2\n0 3\n3 2\n4 2\n4 5",
"4 6\n1 1 1 1\n1 2\n1 3\n2 4\n2 3\n2 4\n3 4",
"5 7\n1 1 3 4 5\n1 2\n1 3\n1 4\n2 3\n2 5\n3 5\n4 5... | 5ATCODER |
p02799 Keyence Programming Contest 2020 - Bichromization_2610 | We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers D_1, D_2, ..., D_N.
Determine whether the conditions below can be satisfied by assigning a color - white or black - to each v... | import java.util.*;
import java.io.*;
public class Main {
static ArrayList<Edge>[] graph;
public static void main(String[] args) {
FastScanner scanner = new FastScanner();
PrintWriter out = new PrintWriter(System.out,false);
int n = scanner.nextInt();
int m = scanner.nextInt();
... | 4JAVA | {
"input": [
"5 5\n3 4 3 5 7\n1 2\n1 3\n3 2\n4 2\n4 5",
"4 6\n1 1 1 1\n1 2\n1 3\n1 4\n2 3\n2 4\n3 4",
"5 7\n1 2 3 4 5\n1 2\n1 3\n1 4\n2 3\n2 5\n3 5\n4 5",
"5 5\n3 4 3 5 7\n1 2\n0 3\n3 2\n4 2\n4 5",
"4 6\n1 1 1 1\n1 2\n1 3\n2 4\n2 3\n2 4\n3 4",
"5 7\n1 1 3 4 5\n1 2\n1 3\n1 4\n2 3\n2 5\n3 5\n4 5... | 5ATCODER |
p02935 AtCoder Beginner Contest 138 - Alchemist_2611 | You have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \leq i \leq N) is v_i.
When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where... | # template by 3xC and starkizard.
# contributors:
#####################################################################################
from __future__ import division, print_function
import sys
import os
from collections import Counter, deque, defaultdict
import itertools
import math
import io
"""Uncomment modul... | 1Python2 | {
"input": [
"2\n3 4",
"3\n500 300 200",
"5\n138 138 138 138 138",
"2\n1 4",
"3\n500 300 210",
"5\n138 138 232 138 138",
"2\n1 2",
"3\n500 105 210",
"5\n138 138 232 218 138",
"2\n2 4",
"3\n500 4 210",
"5\n37 138 232 218 138",
"3\n500 4 409",
"5\n37 138 232 218 2... | 5ATCODER |
p02935 AtCoder Beginner Contest 138 - Alchemist_2612 | You have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \leq i \leq N) is v_i.
When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
float a[n];
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
if(n==1){
cout<<a[0]<<endl;
return 0;
}
double c=(a[0]+a[1])/2;
for(int i=2;i<n;i++){
c=(c+a[i])/2;
}
cout<<c<<endl;
} | 2C++ | {
"input": [
"2\n3 4",
"3\n500 300 200",
"5\n138 138 138 138 138",
"2\n1 4",
"3\n500 300 210",
"5\n138 138 232 138 138",
"2\n1 2",
"3\n500 105 210",
"5\n138 138 232 218 138",
"2\n2 4",
"3\n500 4 210",
"5\n37 138 232 218 138",
"3\n500 4 409",
"5\n37 138 232 218 2... | 5ATCODER |
p02935 AtCoder Beginner Contest 138 - Alchemist_2613 | You have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \leq i \leq N) is v_i.
When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where... | n=int(input())
v=sorted(list(map(int, input().split())))
avg=v[0]
for i in range(1,n):
avg=(avg+v[i])/2
print(avg)
| 3Python3 | {
"input": [
"2\n3 4",
"3\n500 300 200",
"5\n138 138 138 138 138",
"2\n1 4",
"3\n500 300 210",
"5\n138 138 232 138 138",
"2\n1 2",
"3\n500 105 210",
"5\n138 138 232 218 138",
"2\n2 4",
"3\n500 4 210",
"5\n37 138 232 218 138",
"3\n500 4 409",
"5\n37 138 232 218 2... | 5ATCODER |
p02935 AtCoder Beginner Contest 138 - Alchemist_2614 | You have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \leq i \leq N) is v_i.
When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where... | import java.util.Scanner;
import java.util.Arrays;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n =sc.nextInt();
double[] v =new double[n];
for(int i=0; i<n; i++){
v[i] =sc.nextDouble();
}
Arrays.sort(v);
for(int i=0; i<n-1; i++){
v[i+1]=(v[i]+... | 4JAVA | {
"input": [
"2\n3 4",
"3\n500 300 200",
"5\n138 138 138 138 138",
"2\n1 4",
"3\n500 300 210",
"5\n138 138 232 138 138",
"2\n1 2",
"3\n500 105 210",
"5\n138 138 232 218 138",
"2\n2 4",
"3\n500 4 210",
"5\n37 138 232 218 138",
"3\n500 4 409",
"5\n37 138 232 218 2... | 5ATCODER |
p03072 AtCoder Beginner Contest 124 - Great Ocean View_2615 | There are N mountains ranging from east to west, and an ocean to the west.
At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.
The height of the i-th mountain from the west is H_i.
You can certainly see the ocean from the inn at the top of the westmost mountain.
F... | def int_raw():
return int(input())
def ss_raw():
return raw_input().split()
def ints_raw():
return list(map(int, ss_raw()))
def ceil(num):
if int(str(num)[-1]) == 0:
return num
return num + 10 - int(str(num)[-1])
ans = 0
max_height = 0
N = int_raw()
inputs = ints_raw()
for i in range... | 1Python2 | {
"input": [
"4\n6 5 6 8",
"5\n9 5 6 8 4",
"5\n4 5 3 5 4",
"4\n6 5 5 8",
"5\n9 0 6 8 4",
"4\n6 5 8 8",
"5\n2 3 3 4 8",
"5\n2 3 3 4 2",
"5\n4 5 3 1 4",
"5\n9 -1 6 8 4",
"5\n4 5 3 2 4",
"4\n6 5 11 8",
"5\n9 -1 4 8 4",
"5\n1 5 3 2 4",
"4\n12 5 11 8",
"5\n9 ... | 5ATCODER |
p03072 AtCoder Beginner Contest 124 - Great Ocean View_2616 | There are N mountains ranging from east to west, and an ocean to the west.
At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.
The height of the i-th mountain from the west is H_i.
You can certainly see the ocean from the inn at the top of the westmost mountain.
F... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int maxi = 0, ans = 0;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
if (H >= maxi) maxi = H, ans++;
}
cout << ans << "\n";
} | 2C++ | {
"input": [
"4\n6 5 6 8",
"5\n9 5 6 8 4",
"5\n4 5 3 5 4",
"4\n6 5 5 8",
"5\n9 0 6 8 4",
"4\n6 5 8 8",
"5\n2 3 3 4 8",
"5\n2 3 3 4 2",
"5\n4 5 3 1 4",
"5\n9 -1 6 8 4",
"5\n4 5 3 2 4",
"4\n6 5 11 8",
"5\n9 -1 4 8 4",
"5\n1 5 3 2 4",
"4\n12 5 11 8",
"5\n9 ... | 5ATCODER |
p03072 AtCoder Beginner Contest 124 - Great Ocean View_2617 | There are N mountains ranging from east to west, and an ocean to the west.
At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.
The height of the i-th mountain from the west is H_i.
You can certainly see the ocean from the inn at the top of the westmost mountain.
F... | N = int(input())
H = list(map(int,input().split()))
ans = 0
maxm = 0
for h in H:
if maxm <= h:
ans += 1
maxm = h
print(ans) | 3Python3 | {
"input": [
"4\n6 5 6 8",
"5\n9 5 6 8 4",
"5\n4 5 3 5 4",
"4\n6 5 5 8",
"5\n9 0 6 8 4",
"4\n6 5 8 8",
"5\n2 3 3 4 8",
"5\n2 3 3 4 2",
"5\n4 5 3 1 4",
"5\n9 -1 6 8 4",
"5\n4 5 3 2 4",
"4\n6 5 11 8",
"5\n9 -1 4 8 4",
"5\n1 5 3 2 4",
"4\n12 5 11 8",
"5\n9 ... | 5ATCODER |
p03072 AtCoder Beginner Contest 124 - Great Ocean View_2618 | There are N mountains ranging from east to west, and an ocean to the west.
At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.
The height of the i-th mountain from the west is H_i.
You can certainly see the ocean from the inn at the top of the westmost mountain.
F... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] h = new int[N];
for (int i = 0; i < N; i++) {
h[i] = sc.nextInt();
}
int count = 1, max = h[0];
for (int i = 1; i < N; i++) {
if (h[i] >= max) {
ma... | 4JAVA | {
"input": [
"4\n6 5 6 8",
"5\n9 5 6 8 4",
"5\n4 5 3 5 4",
"4\n6 5 5 8",
"5\n9 0 6 8 4",
"4\n6 5 8 8",
"5\n2 3 3 4 8",
"5\n2 3 3 4 2",
"5\n4 5 3 1 4",
"5\n9 -1 6 8 4",
"5\n4 5 3 2 4",
"4\n6 5 11 8",
"5\n9 -1 4 8 4",
"5\n1 5 3 2 4",
"4\n12 5 11 8",
"5\n9 ... | 5ATCODER |
p03214 Dwango Programming Contest V - Thumbnail_2619 | Niwango-kun is an employee of Dwango Co., Ltd.
One day, he is asked to generate a thumbnail from a video a user submitted.
To generate a thumbnail, he needs to select a frame of the video according to the following procedure:
* Get an integer N and N integers a_0, a_1, ..., a_{N-1} as inputs. N denotes the number of t... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
input = raw_input()
N = int(input)
aVec = raw_input().split(" ")
a = []
for i in aVec:
a.append(float(i))
#平均を算出
mean = sum(a) / N
#平均に最も近い値を算出(平均を引いたときの最小値を出す)
near_mean = []
for i in a:
near_mean.append(abs(i - mean))
#平均値に最も近い値のフレーム番号(0始まり)を出力
... | 1Python2 | {
"input": [
"3\n1 2 3",
"4\n2 5 2 5",
"3\n0 2 3",
"4\n2 5 3 5",
"3\n0 0 3",
"4\n3 9 3 5",
"4\n3 5 3 5",
"3\n0 0 1",
"4\n5 9 3 5",
"4\n5 14 3 5",
"4\n5 14 6 5",
"4\n0 14 6 5",
"4\n0 5 6 5",
"4\n0 5 12 5",
"4\n0 5 12 2",
"4\n0 10 12 2",
"4\n0 20 12 2"... | 5ATCODER |
p03214 Dwango Programming Contest V - Thumbnail_2620 | Niwango-kun is an employee of Dwango Co., Ltd.
One day, he is asked to generate a thumbnail from a video a user submitted.
To generate a thumbnail, he needs to select a frame of the video according to the following procedure:
* Get an integer N and N integers a_0, a_1, ..., a_{N-1} as inputs. N denotes the number of t... | #include <bits/stdc++.h>
using namespace std;
int N, A[1 << 18], S;
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i]; S += A[i]; A[i] *= N;
}
int maxn = (1 << 30), r = 0;
for (int i = 1; i <= N; i++) {
if (maxn > abs(S - A[i])) { maxn = abs(S - A[i]); r = i; }
}
cout << r - 1 << endl;
ret... | 2C++ | {
"input": [
"3\n1 2 3",
"4\n2 5 2 5",
"3\n0 2 3",
"4\n2 5 3 5",
"3\n0 0 3",
"4\n3 9 3 5",
"4\n3 5 3 5",
"3\n0 0 1",
"4\n5 9 3 5",
"4\n5 14 3 5",
"4\n5 14 6 5",
"4\n0 14 6 5",
"4\n0 5 6 5",
"4\n0 5 12 5",
"4\n0 5 12 2",
"4\n0 10 12 2",
"4\n0 20 12 2"... | 5ATCODER |
p03214 Dwango Programming Contest V - Thumbnail_2621 | Niwango-kun is an employee of Dwango Co., Ltd.
One day, he is asked to generate a thumbnail from a video a user submitted.
To generate a thumbnail, he needs to select a frame of the video according to the following procedure:
* Get an integer N and N integers a_0, a_1, ..., a_{N-1} as inputs. N denotes the number of t... | n=int(input())
al=list(map(int,input().split()))
t=sum(al)/n
ta=100
for i in range(n):
if abs(t-al[i])<ta:
ta=abs(t-al[i])
ans=i
print(ans) | 3Python3 | {
"input": [
"3\n1 2 3",
"4\n2 5 2 5",
"3\n0 2 3",
"4\n2 5 3 5",
"3\n0 0 3",
"4\n3 9 3 5",
"4\n3 5 3 5",
"3\n0 0 1",
"4\n5 9 3 5",
"4\n5 14 3 5",
"4\n5 14 6 5",
"4\n0 14 6 5",
"4\n0 5 6 5",
"4\n0 5 12 5",
"4\n0 5 12 2",
"4\n0 10 12 2",
"4\n0 20 12 2"... | 5ATCODER |
p03214 Dwango Programming Contest V - Thumbnail_2622 | Niwango-kun is an employee of Dwango Co., Ltd.
One day, he is asked to generate a thumbnail from a video a user submitted.
To generate a thumbnail, he needs to select a frame of the video according to the following procedure:
* Get an integer N and N integers a_0, a_1, ..., a_{N-1} as inputs. N denotes the number of t... | import java.util.Scanner;
import java.util.ArrayList;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
double sum = 0;
int answer = 0;
double average = 0;
double memo = 0;
ArrayList<Double> arrayList = new ArrayList<Double>();
for(int... | 4JAVA | {
"input": [
"3\n1 2 3",
"4\n2 5 2 5",
"3\n0 2 3",
"4\n2 5 3 5",
"3\n0 0 3",
"4\n3 9 3 5",
"4\n3 5 3 5",
"3\n0 0 1",
"4\n5 9 3 5",
"4\n5 14 3 5",
"4\n5 14 6 5",
"4\n0 14 6 5",
"4\n0 5 6 5",
"4\n0 5 12 5",
"4\n0 5 12 2",
"4\n0 10 12 2",
"4\n0 20 12 2"... | 5ATCODER |
p03363 AtCoder Grand Contest 023 - Zero-Sum Ranges_2623 | We have an integer sequence A, whose length is N.
Find the number of the non-empty contiguous subsequences of A whose sums are 0. Note that we are counting the ways to take out subsequences. That is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from differ... | from collections import Counter
from math import factorial
N=input()
A=map(int, raw_input().split())
b=[]
def product(iterable):
prod = 1
for n in iterable:
prod *= n
return prod
def npr(n, r):
return product(range(n - r + 1, n + 1))
def ncr(n, r):
if r > n // 2:
r = n - r
ret... | 1Python2 | {
"input": [
"7\n1 -1 1 -1 1 -1 1",
"5\n1 -2 3 -4 5",
"6\n1 3 -4 2 2 -2",
"7\n0 -1 1 -1 1 -1 1",
"5\n1 -2 5 -4 5",
"6\n1 3 -2 2 2 -2",
"7\n0 -1 0 -1 1 -1 1",
"5\n1 -1 5 -4 5",
"7\n0 -1 0 -1 1 -1 0",
"7\n0 -1 0 -2 1 -1 0",
"7\n0 -1 0 -2 1 0 -1",
"6\n0 1 -4 3 0 -2",
"... | 5ATCODER |
p03363 AtCoder Grand Contest 023 - Zero-Sum Ranges_2624 | We have an integer sequence A, whose length is N.
Find the number of the non-empty contiguous subsequences of A whose sums are 0. Note that we are counting the ways to take out subsequences. That is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from differ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int n; cin>>n;
map<ll,ll> m;
ll ans{}, sum{};
m[0]++;
for(int i=0; i<n; i++){
int a; cin>>a;
sum += a;
m[sum]++;
}
for(auto i:m){
ans += i.second*(i.second-1)/2;
}
cout << ans << endl;
}
| 2C++ | {
"input": [
"7\n1 -1 1 -1 1 -1 1",
"5\n1 -2 3 -4 5",
"6\n1 3 -4 2 2 -2",
"7\n0 -1 1 -1 1 -1 1",
"5\n1 -2 5 -4 5",
"6\n1 3 -2 2 2 -2",
"7\n0 -1 0 -1 1 -1 1",
"5\n1 -1 5 -4 5",
"7\n0 -1 0 -1 1 -1 0",
"7\n0 -1 0 -2 1 -1 0",
"7\n0 -1 0 -2 1 0 -1",
"6\n0 1 -4 3 0 -2",
"... | 5ATCODER |
p03363 AtCoder Grand Contest 023 - Zero-Sum Ranges_2625 | We have an integer sequence A, whose length is N.
Find the number of the non-empty contiguous subsequences of A whose sums are 0. Note that we are counting the ways to take out subsequences. That is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from differ... | from collections import Counter
N = int(input())
A = list(map(int, input().split()))
B = [0]
for i in A:
B.append(B[-1] + i)
B_C = Counter(B)
ans = 0
for key, value in B_C.items():
ans += value * (value-1) // 2
print(ans)
| 3Python3 | {
"input": [
"7\n1 -1 1 -1 1 -1 1",
"5\n1 -2 3 -4 5",
"6\n1 3 -4 2 2 -2",
"7\n0 -1 1 -1 1 -1 1",
"5\n1 -2 5 -4 5",
"6\n1 3 -2 2 2 -2",
"7\n0 -1 0 -1 1 -1 1",
"5\n1 -1 5 -4 5",
"7\n0 -1 0 -1 1 -1 0",
"7\n0 -1 0 -2 1 -1 0",
"7\n0 -1 0 -2 1 0 -1",
"6\n0 1 -4 3 0 -2",
"... | 5ATCODER |
p03363 AtCoder Grand Contest 023 - Zero-Sum Ranges_2626 | We have an integer sequence A, whose length is N.
Find the number of the non-empty contiguous subsequences of A whose sums are 0. Note that we are counting the ways to take out subsequences. That is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from differ... | /*
......................................................................................................................................
..................................... ________ ____ __________________________________________ .....................................
..................................... / _____/|... | 4JAVA | {
"input": [
"7\n1 -1 1 -1 1 -1 1",
"5\n1 -2 3 -4 5",
"6\n1 3 -4 2 2 -2",
"7\n0 -1 1 -1 1 -1 1",
"5\n1 -2 5 -4 5",
"6\n1 3 -2 2 2 -2",
"7\n0 -1 0 -1 1 -1 1",
"5\n1 -1 5 -4 5",
"7\n0 -1 0 -1 1 -1 0",
"7\n0 -1 0 -2 1 -1 0",
"7\n0 -1 0 -2 1 0 -1",
"6\n0 1 -4 3 0 -2",
"... | 5ATCODER |
p03521 CODE FESTIVAL 2017 Exhibition (Parallel) - Awkward_2627 | ButCoder Inc. is a startup company whose main business is the development and operation of the programming competition site "ButCoder".
There are N members of the company including the president, and each member except the president has exactly one direct boss. Each member has a unique ID number from 1 to N, and the m... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | 2C++ | {
"input": [
"4\n1\n2\n3",
"15\n1\n2\n3\n1\n4\n2\n7\n1\n8\n2\n8\n1\n8\n2",
"3\n1\n2",
"5\n1\n1\n3\n3",
"15\n1\n2\n3\n1\n4\n2\n7\n1\n8\n2\n4\n1\n8\n2",
"15\n1\n2\n3\n1\n4\n4\n7\n1\n8\n2\n4\n1\n8\n2",
"15\n1\n2\n3\n1\n4\n4\n7\n1\n8\n2\n8\n1\n8\n2",
"15\n1\n2\n3\n1\n4\n2\n3\n1\n8\n2\n8\n1... | 5ATCODER |
p03521 CODE FESTIVAL 2017 Exhibition (Parallel) - Awkward_2628 | ButCoder Inc. is a startup company whose main business is the development and operation of the programming competition site "ButCoder".
There are N members of the company including the president, and each member except the president has exactly one direct boss. Each member has a unique ID number from 1 to N, and the m... | import java.io.*;
import java.util.*;
public class Main {
private FastScanner in;
private PrintWriter out;
final int mod = (int) 1e9 + 7;
ArrayList<Integer>[] g;
long[][] go(int v) {
long[][] dp = new long[3][1];
dp[0][0] = 1;
for (int to : g[v]) {
long[][] c... | 4JAVA | {
"input": [
"4\n1\n2\n3",
"15\n1\n2\n3\n1\n4\n2\n7\n1\n8\n2\n8\n1\n8\n2",
"3\n1\n2",
"5\n1\n1\n3\n3",
"15\n1\n2\n3\n1\n4\n2\n7\n1\n8\n2\n4\n1\n8\n2",
"15\n1\n2\n3\n1\n4\n4\n7\n1\n8\n2\n4\n1\n8\n2",
"15\n1\n2\n3\n1\n4\n4\n7\n1\n8\n2\n8\n1\n8\n2",
"15\n1\n2\n3\n1\n4\n2\n3\n1\n8\n2\n8\n1... | 5ATCODER |
p03686 AtCoder Regular Contest 076 - Exhausted?_2629 | There are M chairs arranged in a line. The coordinate of the i-th chair (1 ≤ i ≤ M) is i.
N people of the Takahashi clan played too much games, and they are all suffering from backaches. They need to sit in chairs and rest, but they are particular about which chairs they sit in. Specifically, the i-th person wishes to... | #include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cstring>
#include <set>
#include <utility>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <map>
#include <cmath>
#include <deque>
#include <bitset>
#include <unordered_map>
#define ll... | 2C++ | {
"input": [
"6 6\n1 6\n1 6\n1 5\n1 5\n2 6\n2 6",
"4 4\n0 3\n2 3\n1 3\n3 4",
"7 6\n0 7\n1 5\n3 6\n2 7\n1 6\n2 6\n3 7",
"3 1\n1 2\n1 2\n1 2",
"6 6\n0 6\n1 6\n1 5\n1 5\n2 6\n2 6",
"6 6\n0 6\n1 6\n1 5\n1 5\n2 6\n2 2",
"1 1\n1 2\n0 2\n1 2",
"11 6\n0 6\n1 6\n1 7\n1 5\n2 6\n2 2",
"11 5\n... | 5ATCODER |
p03686 AtCoder Regular Contest 076 - Exhausted?_2630 | There are M chairs arranged in a line. The coordinate of the i-th chair (1 ≤ i ≤ M) is i.
N people of the Takahashi clan played too much games, and they are all suffering from backaches. They need to sit in chairs and rest, but they are particular about which chairs they sit in. Specifically, the i-th person wishes to... | from collections import deque
class LazySegtree():
def __init__(self,n,init_val,merge_func,ide_ele):
self.n=n
self.ide_ele=ide_ele
self.merge_func=merge_func
self.val=[0 for i in range(1<<n)]
self.merge=[0 for i in range(1<<n)]
self.parent=[-1 for i in range(1<<n)]
... | 3Python3 | {
"input": [
"6 6\n1 6\n1 6\n1 5\n1 5\n2 6\n2 6",
"4 4\n0 3\n2 3\n1 3\n3 4",
"7 6\n0 7\n1 5\n3 6\n2 7\n1 6\n2 6\n3 7",
"3 1\n1 2\n1 2\n1 2",
"6 6\n0 6\n1 6\n1 5\n1 5\n2 6\n2 6",
"6 6\n0 6\n1 6\n1 5\n1 5\n2 6\n2 2",
"1 1\n1 2\n0 2\n1 2",
"11 6\n0 6\n1 6\n1 7\n1 5\n2 6\n2 2",
"11 5\n... | 5ATCODER |
p03686 AtCoder Regular Contest 076 - Exhausted?_2631 | There are M chairs arranged in a line. The coordinate of the i-th chair (1 ≤ i ≤ M) is i.
N people of the Takahashi clan played too much games, and they are all suffering from backaches. They need to sit in chairs and rest, but they are particular about which chairs they sit in. Specifically, the i-th person wishes to... | import java.io.*;
import java.util.*;
class Node implements Comparable<Node> {
final int l, r;
Node(int l, int r) {
this.l = l;
this.r = r;
}
public int compareTo(Node node) {
return -1 * this.r + node.r;
}
}
class Solver {
final int n, m;
final int[][] lrs;
Solver(int n, int m, int[... | 4JAVA | {
"input": [
"6 6\n1 6\n1 6\n1 5\n1 5\n2 6\n2 6",
"4 4\n0 3\n2 3\n1 3\n3 4",
"7 6\n0 7\n1 5\n3 6\n2 7\n1 6\n2 6\n3 7",
"3 1\n1 2\n1 2\n1 2",
"6 6\n0 6\n1 6\n1 5\n1 5\n2 6\n2 6",
"6 6\n0 6\n1 6\n1 5\n1 5\n2 6\n2 2",
"1 1\n1 2\n0 2\n1 2",
"11 6\n0 6\n1 6\n1 7\n1 5\n2 6\n2 2",
"11 5\n... | 5ATCODER |
p03839 AtCoder Grand Contest 008 - Contiguous Repainting_2632 | There are N squares aligned in a row. The i-th square from the left contains an integer a_i.
Initially, all the squares are white. Snuke will perform the following operation some number of times:
* Select K consecutive squares. Then, paint all of them white, or paint all of them black. Here, the colors of the squares... | from sys import stdin
def main():
n, k = map(int, stdin.readline().split())
a = map(int, stdin.readline().split())
s = [0] * (n + 1)
t = [0] * (n + 1)
for i, x in enumerate(a):
s[i+1] = s[i] + x
t[i+1] = t[i] + (x if x > 0 else 0)
ans = 0
for i in xrange(n - k + 1):
v... | 1Python2 | {
"input": [
"10 5\n5 -4 -5 -8 -4 7 2 -4 0 7",
"1 1\n-10",
"5 3\n-10 10 -10 10 -10",
"4 2\n10 -10 -10 10",
"1 1\n-16",
"5 3\n-10 10 -18 10 -10",
"4 2\n7 -10 -10 10",
"4 2\n7 -6 -10 12",
"4 2\n7 -6 -10 20",
"4 2\n9 -1 -10 20",
"4 2\n13 -1 -10 20",
"4 2\n3 -1 -10 20",
... | 5ATCODER |
p03839 AtCoder Grand Contest 008 - Contiguous Repainting_2633 | There are N squares aligned in a row. The i-th square from the left contains an integer a_i.
Initially, all the squares are white. Snuke will perform the following operation some number of times:
* Select K consecutive squares. Then, paint all of them white, or paint all of them black. Here, the colors of the squares... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++){
cin >> a[i];
}
vector<long long> S1(N + 1, 0);
for (int i = 0; i < N; i++){
S1[i + 1] = S1[i] + max(a[i], 0);
}
vector<long long> S2(N + 1, 0);
for (int i = 0; i ... | 2C++ | {
"input": [
"10 5\n5 -4 -5 -8 -4 7 2 -4 0 7",
"1 1\n-10",
"5 3\n-10 10 -10 10 -10",
"4 2\n10 -10 -10 10",
"1 1\n-16",
"5 3\n-10 10 -18 10 -10",
"4 2\n7 -10 -10 10",
"4 2\n7 -6 -10 12",
"4 2\n7 -6 -10 20",
"4 2\n9 -1 -10 20",
"4 2\n13 -1 -10 20",
"4 2\n3 -1 -10 20",
... | 5ATCODER |
p03839 AtCoder Grand Contest 008 - Contiguous Repainting_2634 | There are N squares aligned in a row. The i-th square from the left contains an integer a_i.
Initially, all the squares are white. Snuke will perform the following operation some number of times:
* Select K consecutive squares. Then, paint all of them white, or paint all of them black. Here, the colors of the squares... | N,K=map(int,input().split())
a=list(map(int,input().split()))
ans=0
tmp=0
sa=[0]*(N+1)
A=[0]*(N+1)
for i in range(N):
sa[i+1]=sa[i]+a[i]
if a[i]>0:
A[i+1]=A[i]+a[i]
else:
A[i+1]=A[i]
for i in range(N-K+1):
tmp=sa[i+K]-sa[i]
tmp2=A[i]+(A[-1]-A[i+K])
#print(max(0,tmp),tmp2)
if max(0,tmp)+tmp2>ans:
... | 3Python3 | {
"input": [
"10 5\n5 -4 -5 -8 -4 7 2 -4 0 7",
"1 1\n-10",
"5 3\n-10 10 -10 10 -10",
"4 2\n10 -10 -10 10",
"1 1\n-16",
"5 3\n-10 10 -18 10 -10",
"4 2\n7 -10 -10 10",
"4 2\n7 -6 -10 12",
"4 2\n7 -6 -10 20",
"4 2\n9 -1 -10 20",
"4 2\n13 -1 -10 20",
"4 2\n3 -1 -10 20",
... | 5ATCODER |
p03839 AtCoder Grand Contest 008 - Contiguous Repainting_2635 | There are N squares aligned in a row. The i-th square from the left contains an integer a_i.
Initially, all the squares are white. Snuke will perform the following operation some number of times:
* Select K consecutive squares. Then, paint all of them white, or paint all of them black. Here, the colors of the squares... | import java.util.*;
public class Main {
static Scanner scanner = new Scanner(System.in);
public static void main(String[]$) {
int n = scanner.nextInt();
int k = scanner.nextInt();
long[] b = new long[n + 1];
long[] w = new long[n + 1];
for (int i = 1; i <= n; i++) {
... | 4JAVA | {
"input": [
"10 5\n5 -4 -5 -8 -4 7 2 -4 0 7",
"1 1\n-10",
"5 3\n-10 10 -10 10 -10",
"4 2\n10 -10 -10 10",
"1 1\n-16",
"5 3\n-10 10 -18 10 -10",
"4 2\n7 -10 -10 10",
"4 2\n7 -6 -10 12",
"4 2\n7 -6 -10 20",
"4 2\n9 -1 -10 20",
"4 2\n13 -1 -10 20",
"4 2\n3 -1 -10 20",
... | 5ATCODER |
p04006 AtCoder Grand Contest 004 - Colorful Slimes_2636 | Snuke lives in another world, where slimes are real creatures and kept by some people. Slimes come in N colors. Those colors are conveniently numbered 1 through N. Snuke currently has no slime. His objective is to have slimes of all the colors together.
Snuke can perform the following two actions:
* Select a color i ... | n,x=map(int,raw_input().split(" "))
a=map(int,raw_input().split(" "))
t=[i for i in a]
s=10**15
for m in range(n):
t=[min(t[j],a[(j-m)%n]) for j in range(n)]
s=min(x*m+sum(t),s)
print s | 1Python2 | {
"input": [
"4 10\n1 2 3 4",
"2 10\n1 100",
"3 10\n100 1 100",
"4 10\n1 1 3 4",
"2 10\n1 101",
"3 12\n100 1 100",
"3 12\n000 1 100",
"3 12\n010 1 100",
"3 12\n011 1 100",
"3 18\n011 1 100",
"3 18\n011 2 100",
"3 35\n011 2 100",
"3 35\n011 4 100",
"3 35\n011 4 0... | 5ATCODER |
p04006 AtCoder Grand Contest 004 - Colorful Slimes_2637 | Snuke lives in another world, where slimes are real creatures and kept by some people. Slimes come in N colors. Those colors are conveniently numbered 1 through N. Snuke currently has no slime. His objective is to have slimes of all the colors together.
Snuke can perform the following two actions:
* Select a color i ... | #include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, m, s, ans, mn[2005], a[2005];
int main()
{
ll i, j;
cin >> n >> m;
for (i = 0; i < n; i++) {
scanf ("%lld", &a[i]);
}
for (i = 0; i < n; i++) {
mn[i] = 2e9;
}
for (i = 0; i < n; i++) {
s = i * m;
for (j = 0; j < n; j+... | 2C++ | {
"input": [
"4 10\n1 2 3 4",
"2 10\n1 100",
"3 10\n100 1 100",
"4 10\n1 1 3 4",
"2 10\n1 101",
"3 12\n100 1 100",
"3 12\n000 1 100",
"3 12\n010 1 100",
"3 12\n011 1 100",
"3 18\n011 1 100",
"3 18\n011 2 100",
"3 35\n011 2 100",
"3 35\n011 4 100",
"3 35\n011 4 0... | 5ATCODER |
p04006 AtCoder Grand Contest 004 - Colorful Slimes_2638 | Snuke lives in another world, where slimes are real creatures and kept by some people. Slimes come in N colors. Those colors are conveniently numbered 1 through N. Snuke currently has no slime. His objective is to have slimes of all the colors together.
Snuke can perform the following two actions:
* Select a color i ... | from collections import Counter
def inpl(): return list(map(int, input().split()))
N, x = inpl()
A = inpl()
B = [a for a in A]
ans = 1e15
for i in range(N+1):
for j in range(N):
B[j] = min(B[j], A[(j-i)%N])
tmp = x*i + sum(B)
ans = min(ans, tmp)
print(ans)
| 3Python3 | {
"input": [
"4 10\n1 2 3 4",
"2 10\n1 100",
"3 10\n100 1 100",
"4 10\n1 1 3 4",
"2 10\n1 101",
"3 12\n100 1 100",
"3 12\n000 1 100",
"3 12\n010 1 100",
"3 12\n011 1 100",
"3 18\n011 1 100",
"3 18\n011 2 100",
"3 35\n011 2 100",
"3 35\n011 4 100",
"3 35\n011 4 0... | 5ATCODER |
p04006 AtCoder Grand Contest 004 - Colorful Slimes_2639 | Snuke lives in another world, where slimes are real creatures and kept by some people. Slimes come in N colors. Those colors are conveniently numbered 1 through N. Snuke currently has no slime. His objective is to have slimes of all the colors together.
Snuke can perform the following two actions:
* Select a color i ... | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in... | 4JAVA | {
"input": [
"4 10\n1 2 3 4",
"2 10\n1 100",
"3 10\n100 1 100",
"4 10\n1 1 3 4",
"2 10\n1 101",
"3 12\n100 1 100",
"3 12\n000 1 100",
"3 12\n010 1 100",
"3 12\n011 1 100",
"3 18\n011 1 100",
"3 18\n011 2 100",
"3 35\n011 2 100",
"3 35\n011 4 100",
"3 35\n011 4 0... | 5ATCODER |
p00092 Square Searching_2640 | There are a total of n x n squares, n rows vertically and n columns horizontally. Some squares are marked. Create a program that reads the marked state of each square and displays the length of the side of the largest square consisting of only the unmarked squares as an output.
For example, each dataset is given the f... | while True:
n = int(raw_input())
if n == 0: break
field = [raw_input() for i in range(n)]
large = [[0]*(n + 1) for i in range(n + 1)]
for i in range(n):
for j in range(n):
if field[i][j] == '.':
large[i][j] = min(large[i][j - 1], large[i - 1][j], large[i - 1][j - ... | 1Python2 | {
"input": [
"10\n...*....**\n..........\n**....**..\n........*.\n..*.......\n..........\n.*........\n..........\n....*..***\n.*....*...\n10\n****.*****\n*..*.*....\n****.*....\n*....*....\n*....*****\n..........\n****.*****\n*..*...*..\n****...*..\n*..*...*..\n0",
"10\n...*....**\n..........\n**....**..\n...... | 6AIZU |
p00092 Square Searching_2641 | There are a total of n x n squares, n rows vertically and n columns horizontally. Some squares are marked. Create a program that reads the marked state of each square and displays the length of the side of the largest square consisting of only the unmarked squares as an output.
For example, each dataset is given the f... | #include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[3000][3000], n, x[3000][3000], maxn; char a;
int main() {
while (true) {
memset(dp, 0, sizeof(dp));
cin >> n; if (!n) { break; }
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> a;
if (a == '*') {
... | 2C++ | {
"input": [
"10\n...*....**\n..........\n**....**..\n........*.\n..*.......\n..........\n.*........\n..........\n....*..***\n.*....*...\n10\n****.*****\n*..*.*....\n****.*....\n*....*....\n*....*****\n..........\n****.*****\n*..*...*..\n****...*..\n*..*...*..\n0",
"10\n...*....**\n..........\n**....**..\n...... | 6AIZU |
p00092 Square Searching_2642 | There are a total of n x n squares, n rows vertically and n columns horizontally. Some squares are marked. Create a program that reads the marked state of each square and displays the length of the side of the largest square consisting of only the unmarked squares as an output.
For example, each dataset is given the f... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0092
"""
import sys
def find_square0(data):
max_size = 0
dp = [] # dp??¨???2?¬??????????
# '.'????????????1??????'*'????????????0????????????
for row in data:
temp = []
for c in row:
if c =... | 3Python3 | {
"input": [
"10\n...*....**\n..........\n**....**..\n........*.\n..*.......\n..........\n.*........\n..........\n....*..***\n.*....*...\n10\n****.*****\n*..*.*....\n****.*....\n*....*....\n*....*****\n..........\n****.*****\n*..*...*..\n****...*..\n*..*...*..\n0",
"10\n...*....**\n..........\n**....**..\n...... | 6AIZU |
p00092 Square Searching_2643 | There are a total of n x n squares, n rows vertically and n columns horizontally. Some squares are marked. Create a program that reads the marked state of each square and displays the length of the side of the largest square consisting of only the unmarked squares as an output.
For example, each dataset is given the f... |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
while(true) {
int n=in.nextInt();
if(n==0)break;
int dp[][]=new int[n][n];
for(int i=0;i<n;i++) {
String str=in.next();
for(int j=0;j<n;j++) {
dp[i][j]=str.charAt(j)=='... | 4JAVA | {
"input": [
"10\n...*....**\n..........\n**....**..\n........*.\n..*.......\n..........\n.*........\n..........\n....*..***\n.*....*...\n10\n****.*****\n*..*.*....\n****.*....\n*....*....\n*....*****\n..........\n****.*****\n*..*...*..\n****...*..\n*..*...*..\n0",
"10\n...*....**\n..........\n**....**..\n...... | 6AIZU |
p00224 Bicycle Diet_2644 | Mr. A loves sweets, but recently his wife has told him to go on a diet. One day, when Mr. A went out from his home to the city hall, his wife recommended that he go by bicycle. There, Mr. A reluctantly went out on a bicycle, but Mr. A, who likes sweets, came up with the idea of stopping by a cake shop on the way to e... | import Queue
INF = 1 << 29
class Edge:
def __init__(self, _v, _cost):
self.v = _v
self.cost = _cost
def parse(s, m, n):
if(s[0]=="C"): return int(s.translate(None, "C")) - 1
elif(s[0]=="L"): return int(s.translate(None, "L")) - 1 + m
elif(s[0]=="H"): return m + n
else: return m + n ... | 1Python2 | {
"input": [
"1 1 2 5\n35\nH L1 5\nC1 D 6\nC1 H 12\nL1 D 10\nC1 L1 20\n2 1 4 6\n100 70\nH L1 5\nC1 L1 12\nC1 D 11\nC2 L1 7\nC2 D 15\nL1 D 8\n0 0 0 0",
"1 1 2 5\n35\nH L1 5\nC1 D 6\nC1 H 12\nL1 D 10\nC1 L1 20\n2 1 4 6\n100 70\nH L1 5\nC1 L1 12\nC1 D 11\nC2 L1 7\nC2 D 10\nL1 D 8\n0 0 0 0",
"1 1 2 5\n35\nH L... | 6AIZU |
p00224 Bicycle Diet_2645 | Mr. A loves sweets, but recently his wife has told him to go on a diet. One day, when Mr. A went out from his home to the city hall, his wife recommended that he go by bicycle. There, Mr. A reluctantly went out on a bicycle, but Mr. A, who likes sweets, came up with the idea of stopping by a cake shop on the way to e... | #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
using namespace std;
int M,N,K,D;
int cal[6];
#define HE (M)
#define CH (M+1)
#define pb push_back
#define INF (1<<24)
class Edge
{
public:
int u,v,c;
Edge(int u, int v, int c)
:u(u),v(v),c(c)
{}
};
int toNum(strin... | 2C++ | {
"input": [
"1 1 2 5\n35\nH L1 5\nC1 D 6\nC1 H 12\nL1 D 10\nC1 L1 20\n2 1 4 6\n100 70\nH L1 5\nC1 L1 12\nC1 D 11\nC2 L1 7\nC2 D 15\nL1 D 8\n0 0 0 0",
"1 1 2 5\n35\nH L1 5\nC1 D 6\nC1 H 12\nL1 D 10\nC1 L1 20\n2 1 4 6\n100 70\nH L1 5\nC1 L1 12\nC1 D 11\nC2 L1 7\nC2 D 10\nL1 D 8\n0 0 0 0",
"1 1 2 5\n35\nH L... | 6AIZU |
p00224 Bicycle Diet_2646 | Mr. A loves sweets, but recently his wife has told him to go on a diet. One day, when Mr. A went out from his home to the city hall, his wife recommended that he go by bicycle. There, Mr. A reluctantly went out on a bicycle, but Mr. A, who likes sweets, came up with the idea of stopping by a cake shop on the way to e... | from itertools import combinations
from heapq import heappop, heappush
import sys
sys.setrecursionlimit(1000000)
INF = 10 ** 20
def convert(s, m, n):
if s == "H":
return 0
if s == "D":
return 1
if s[0] == "C":
return int(s[1:]) + 1
if s[0] == "L":
return int(s[1:]) + m + 1
def get_cost(start, ... | 3Python3 | {
"input": [
"1 1 2 5\n35\nH L1 5\nC1 D 6\nC1 H 12\nL1 D 10\nC1 L1 20\n2 1 4 6\n100 70\nH L1 5\nC1 L1 12\nC1 D 11\nC2 L1 7\nC2 D 15\nL1 D 8\n0 0 0 0",
"1 1 2 5\n35\nH L1 5\nC1 D 6\nC1 H 12\nL1 D 10\nC1 L1 20\n2 1 4 6\n100 70\nH L1 5\nC1 L1 12\nC1 D 11\nC2 L1 7\nC2 D 10\nL1 D 8\n0 0 0 0",
"1 1 2 5\n35\nH L... | 6AIZU |
p00224 Bicycle Diet_2647 | Mr. A loves sweets, but recently his wife has told him to go on a diet. One day, when Mr. A went out from his home to the city hall, his wife recommended that he go by bicycle. There, Mr. A reluctantly went out on a bicycle, but Mr. A, who likes sweets, came up with the idea of stopping by a cake shop on the way to e... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
//Bicycle Diet
public class Main{
class E{
int s, t, c;
public E(int s, int t, int c) {
this.s = s;
this.t = t;
this.c = c;
}
}
int m, n, k, d;
int get(String s){
if(s.charAt(0)=='H')return n... | 4JAVA | {
"input": [
"1 1 2 5\n35\nH L1 5\nC1 D 6\nC1 H 12\nL1 D 10\nC1 L1 20\n2 1 4 6\n100 70\nH L1 5\nC1 L1 12\nC1 D 11\nC2 L1 7\nC2 D 15\nL1 D 8\n0 0 0 0",
"1 1 2 5\n35\nH L1 5\nC1 D 6\nC1 H 12\nL1 D 10\nC1 L1 20\n2 1 4 6\n100 70\nH L1 5\nC1 L1 12\nC1 D 11\nC2 L1 7\nC2 D 10\nL1 D 8\n0 0 0 0",
"1 1 2 5\n35\nH L... | 6AIZU |
p00386 Gathering_2648 | You are a teacher at Iazu High School is the Zuia Kingdom. There are $N$ cities and $N-1$ roads connecting them that allow you to move from one city to another by way of more than one road. Each of the roads allows bidirectional traffic and has a known length.
As a part of class activities, you are planning the follow... | #include<bits/stdc++.h>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
UL N, Q;
UL P[100000][18];
UL D[100000];
UL C[100000];
vector<pair<UL, UL>> E[100000];
UL LCA(UL a, UL b) {
if (C[a] < C[b]) swap(a, b);
UL d = C[... | 2C++ | {
"input": [
"15 15\n1 2 45\n2 3 81\n1 4 29\n1 5 2\n5 6 25\n4 7 84\n7 8 56\n4 9 2\n4 10 37\n7 11 39\n1 12 11\n11 13 6\n3 14 68\n2 15 16\n10 13 14\n13 14 15\n2 14 15\n7 12 15\n10 14 15\n9 10 15\n9 14 15\n8 13 15\n5 6 13\n11 13 15\n12 13 14\n2 3 10\n5 13 15\n10 11 14\n6 8 11",
"5 3\n1 2 1\n2 3 1\n3 4 1\n4 5 1\n... | 6AIZU |
p00386 Gathering_2649 | You are a teacher at Iazu High School is the Zuia Kingdom. There are $N$ cities and $N-1$ roads connecting them that allow you to move from one city to another by way of more than one road. Each of the roads allows bidirectional traffic and has a known length.
As a part of class activities, you are planning the follow... | import sys
sys.setrecursionlimit(1000000)
def main():
n, q = map(int, input().split())
edges = [[] for _ in range(n)]
for _ in range(n - 1):
u, v, w = map(int, input().split())
u -= 1
v -= 1
edges[u].append((v, w))
edges[v].append((u, w))
height = [None] * n
dist = [None] * n
parent =... | 3Python3 | {
"input": [
"15 15\n1 2 45\n2 3 81\n1 4 29\n1 5 2\n5 6 25\n4 7 84\n7 8 56\n4 9 2\n4 10 37\n7 11 39\n1 12 11\n11 13 6\n3 14 68\n2 15 16\n10 13 14\n13 14 15\n2 14 15\n7 12 15\n10 14 15\n9 10 15\n9 14 15\n8 13 15\n5 6 13\n11 13 15\n12 13 14\n2 3 10\n5 13 15\n10 11 14\n6 8 11",
"5 3\n1 2 1\n2 3 1\n3 4 1\n4 5 1\n... | 6AIZU |
p00602 Fibonacci Sets_2650 | Fibonacci number f(i) appear in a variety of puzzles in nature and math, including packing problems, family trees or Pythagorean triangles. They obey the rule f(i) = f(i - 1) + f(i - 2), where we set f(0) = 1 = f(-1).
Let V and d be two certain positive integers and be N ≡ 1001 a constant. Consider a set of V nodes, e... | while(1):
try:
[v,d]=map(int,raw_input().split())
except:
break
fib=[1 for x in range(v+2)]
for i in range (2,v+2):
fib[i]=fib[i-1]+fib[i-2]
fib.pop(0)
fib.pop(0)
fibm=sorted([x%1001 for x in fib])
ans=1
for i in range(v-1):
if fibm[i+1]-fibm[i]>=d: ... | 1Python2 | {
"input": [
"5 5\n50 1\n13 13",
"5 5\n50 2\n13 13",
"2 5\n50 1\n13 13",
"2 5\n50 1\n15 13",
"5 10\n50 1\n13 20",
"5 10\n50 1\n22 20",
"8 10\n50 1\n22 20",
"8 2\n50 1\n22 20",
"8 2\n50 2\n22 20",
"5 5\n50 1\n13 18",
"5 5\n50 2\n13 4",
"2 5\n25 1\n13 13",
"2 5\n6 1\n... | 6AIZU |
p00602 Fibonacci Sets_2651 | Fibonacci number f(i) appear in a variety of puzzles in nature and math, including packing problems, family trees or Pythagorean triangles. They obey the rule f(i) = f(i - 1) + f(i - 2), where we set f(0) = 1 = f(-1).
Let V and d be two certain positive integers and be N ≡ 1001 a constant. Consider a set of V nodes, e... | #include<bits/stdc++.h>
#define N 1005
#define M 1001
#define P 30
using namespace std;
typedef long long ll;
int main(){
int v,d;
ll f[N];
vector<ll> F;
while(cin>>v>>d){
f[0]=f[1]=1;
for(int i=2;i<2+v;i++){
f[i]=(f[i-1]+f[i-2])%M;
F.push_back(f[i]);
}
sort(F.begin(),F.end());
... | 2C++ | {
"input": [
"5 5\n50 1\n13 13",
"5 5\n50 2\n13 13",
"2 5\n50 1\n13 13",
"2 5\n50 1\n15 13",
"5 10\n50 1\n13 20",
"5 10\n50 1\n22 20",
"8 10\n50 1\n22 20",
"8 2\n50 1\n22 20",
"8 2\n50 2\n22 20",
"5 5\n50 1\n13 18",
"5 5\n50 2\n13 4",
"2 5\n25 1\n13 13",
"2 5\n6 1\n... | 6AIZU |
p00602 Fibonacci Sets_2652 | Fibonacci number f(i) appear in a variety of puzzles in nature and math, including packing problems, family trees or Pythagorean triangles. They obey the rule f(i) = f(i - 1) + f(i - 2), where we set f(0) = 1 = f(-1).
Let V and d be two certain positive integers and be N ≡ 1001 a constant. Consider a set of V nodes, e... | from collections import deque
try:
while 1:
V, d = map(int, input().split())
F = [0]*V
a = b = 1
for v in range(V):
a, b = (a+b) % 1001, a
F[v] = a
G = [[] for i in range(V)]
for i in range(V):
for j in range(i+1, V):
... | 3Python3 | {
"input": [
"5 5\n50 1\n13 13",
"5 5\n50 2\n13 13",
"2 5\n50 1\n13 13",
"2 5\n50 1\n15 13",
"5 10\n50 1\n13 20",
"5 10\n50 1\n22 20",
"8 10\n50 1\n22 20",
"8 2\n50 1\n22 20",
"8 2\n50 2\n22 20",
"5 5\n50 1\n13 18",
"5 5\n50 2\n13 4",
"2 5\n25 1\n13 13",
"2 5\n6 1\n... | 6AIZU |
p00602 Fibonacci Sets_2653 | Fibonacci number f(i) appear in a variety of puzzles in nature and math, including packing problems, family trees or Pythagorean triangles. They obey the rule f(i) = f(i - 1) + f(i - 2), where we set f(0) = 1 = f(-1).
Let V and d be two certain positive integers and be N ≡ 1001 a constant. Consider a set of V nodes, e... | import java.io.*;
import java.util.StringTokenizer;
import java.util.Arrays;
class Main {
public static void main(String args[]) {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String buf;
try {
while ((buf = br.readLine())!=null) {
StringTokenizer st = new StringTokenizer(bu... | 4JAVA | {
"input": [
"5 5\n50 1\n13 13",
"5 5\n50 2\n13 13",
"2 5\n50 1\n13 13",
"2 5\n50 1\n15 13",
"5 10\n50 1\n13 20",
"5 10\n50 1\n22 20",
"8 10\n50 1\n22 20",
"8 2\n50 1\n22 20",
"8 2\n50 2\n22 20",
"5 5\n50 1\n13 18",
"5 5\n50 2\n13 4",
"2 5\n25 1\n13 13",
"2 5\n6 1\n... | 6AIZU |
p00738 Roll-A-Big-Ball_2654 | ACM University holds its sports day in every July. The "Roll-A-Big-Ball" is the highlight of the day. In the game, players roll a ball on a straight course drawn on the ground. There are rectangular parallelepiped blocks on the ground as obstacles, which are fixed on the ground. During the game, the ball may not collid... | #include<bits/stdc++.h>
using namespace std;
/////////////////
// 2D geometry //
/////////////////
// 2D geometry basic //
const double EPS = 1e-8;
const double INF = 1e12;
typedef complex<double> P;
#define X real
#define Y imag
namespace std {
bool operator < (const P& a, const P& b) {
return real(a) != real... | 2C++ | {
"input": [
"2\n-40 -40 100 30\n-100 -100 -50 -30 1\n30 -70 90 -30 10\n2\n-4 -4 10 3\n-10 -10 -5 -3 1\n3 -7 9 -3 1\n2\n-40 -40 100 30\n-100 -100 -50 -30 3\n30 -70 90 -30 10\n2\n-400 -400 1000 300\n-800 -800 -500 -300 7\n300 -700 900 -300 20\n3\n20 70 150 70\n0 0 50 50 4\n40 100 60 120 8\n130 80 200 200 1\n3\n20 ... | 6AIZU |
p00738 Roll-A-Big-Ball_2655 | ACM University holds its sports day in every July. The "Roll-A-Big-Ball" is the highlight of the day. In the game, players roll a ball on a straight course drawn on the ground. There are rectangular parallelepiped blocks on the ground as obstacles, which are fixed on the ground. During the game, the ball may not collid... | def cross(c1, c2):
return c1.real * c2.imag - c1.imag * c2.real
def dot(c1, c2):
return c1.real * c2.real + c1.imag * c2.imag
def ccw(p0, p1, p2):
a = p1 - p0
b = p2 - p0
cross_ab = cross(a, b)
if cross_ab > 0:
return 1
elif cross_ab < 0:
return -1
elif dot(a, b) < 0:
... | 3Python3 | {
"input": [
"2\n-40 -40 100 30\n-100 -100 -50 -30 1\n30 -70 90 -30 10\n2\n-4 -4 10 3\n-10 -10 -5 -3 1\n3 -7 9 -3 1\n2\n-40 -40 100 30\n-100 -100 -50 -30 3\n30 -70 90 -30 10\n2\n-400 -400 1000 300\n-800 -800 -500 -300 7\n300 -700 900 -300 20\n3\n20 70 150 70\n0 0 50 50 4\n40 100 60 120 8\n130 80 200 200 1\n3\n20 ... | 6AIZU |
p00738 Roll-A-Big-Ball_2656 | ACM University holds its sports day in every July. The "Roll-A-Big-Ball" is the highlight of the day. In the game, players roll a ball on a straight course drawn on the ground. There are rectangular parallelepiped blocks on the ground as obstacles, which are fixed on the ground. During the game, the ball may not collid... | import java.util.*;
import java.awt.geom.*;
import java.awt.geom.Line2D.Double;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while(true){
int n = sc.nextInt();
if(n==0) break;
double sx = sc.nextDouble();
double sy = sc.nextDouble();
dou... | 4JAVA | {
"input": [
"2\n-40 -40 100 30\n-100 -100 -50 -30 1\n30 -70 90 -30 10\n2\n-4 -4 10 3\n-10 -10 -5 -3 1\n3 -7 9 -3 1\n2\n-40 -40 100 30\n-100 -100 -50 -30 3\n30 -70 90 -30 10\n2\n-400 -400 1000 300\n-800 -800 -500 -300 7\n300 -700 900 -300 20\n3\n20 70 150 70\n0 0 50 50 4\n40 100 60 120 8\n130 80 200 200 1\n3\n20 ... | 6AIZU |
p00878 Origami Through-Hole_2657 | Origami is the traditional Japanese art of paper folding. One day, Professor Egami found the message board decorated with some pieces of origami works pinned on it, and became interested in the pinholes on the origami paper. Your mission is to simulate paper folding and pin punching on the folded sheet, and calculate t... | #include <stdio.h>
#include <assert.h>
#include <iostream>
#include <complex>
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define mp make_pair
typedef complex<double> P;
typedef vector<P> convex;
typedef vector<pair<P, int> ... | 2C++ | {
"input": [
"2\n90 90 80 20\n80 20 75 50\n50 35\n2\n90 90 80 20\n75 50 80 20\n55 20\n3\n5 90 15 70\n95 90 85 75\n20 67 20 73\n20 75\n3\n5 90 15 70\n5 10 15 55\n20 67 20 73\n75 80\n8\n1 48 1 50\n10 73 10 75\n31 87 31 89\n91 94 91 96\n63 97 62 96\n63 80 61 82\n39 97 41 95\n62 89 62 90\n41 93\n5\n2 1 1 1\n-95 1 -96... | 6AIZU |
p01009 Room of Time and Spirit_2658 | Problem
In 20XX, a scientist developed a powerful android with biotechnology. This android is extremely powerful because it is made by a computer by combining the cells of combat masters.
At this rate, the earth would be dominated by androids, so the N warriors decided to fight the androids. However, today's warriors... | #include<iostream>
#include <list>
#include<stack>
#include<queue>
#include <vector>
#include <set>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
#include<string>
#include <functional>
#include<fstream>
#define FOR(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define LL long long
#define CLR(a) memset((a),0,sizeof(... | 2C++ | {
"input": [
"4 3\nIN 1 4 10\nIN 2 3 20\nCOMPARE 1 2",
"10 4\nIN 10 8 2328\nIN 8 4 3765\nIN 3 8 574\nCOMPARE 4 8",
"3 5\nCOMPARE 1 2\nIN 1 2 5\nIN 2 3 3\nCOMPARE 2 3\nCOMPARE 1 3",
"3 4\nIN 2 1 2\nIN 3 1 2\nCOMPARE 1 3\nCOMPARE 2 3",
"3 5\nIN 1 2 5\nIN 1 2 5\nIN 2 3 10\nCOMPARE 1 2\nCOMPARE 2 3",
... | 6AIZU |
p01009 Room of Time and Spirit_2659 | Problem
In 20XX, a scientist developed a powerful android with biotechnology. This android is extremely powerful because it is made by a computer by combining the cells of combat masters.
At this rate, the earth would be dominated by androids, so the N warriors decided to fight the androids. However, today's warriors... | # AOJ 1519: Room of Time and Spirit
# Python3 2018.7.13 bal4u
# Weighted UNION-FIND library
class WeightedUnionSet:
def __init__(self, nmax):
self.ws = [0]*nmax
self.par = [-1]*nmax
self.power = [0]*nmax
def find(self, x):
if self.par[x] < 0: return x
p = self.find(self.par[x])
self.ws[x] += self.ws[self... | 3Python3 | {
"input": [
"4 3\nIN 1 4 10\nIN 2 3 20\nCOMPARE 1 2",
"10 4\nIN 10 8 2328\nIN 8 4 3765\nIN 3 8 574\nCOMPARE 4 8",
"3 5\nCOMPARE 1 2\nIN 1 2 5\nIN 2 3 3\nCOMPARE 2 3\nCOMPARE 1 3",
"3 4\nIN 2 1 2\nIN 3 1 2\nCOMPARE 1 3\nCOMPARE 2 3",
"3 5\nIN 1 2 5\nIN 1 2 5\nIN 2 3 10\nCOMPARE 1 2\nCOMPARE 2 3",
... | 6AIZU |
p01141 Lifeguard in the Pool_2660 | Lifeguard in the Pool
Pool guard
English text is not available in this practice contest.
Horton Moore works as a pool watchman. As he walked around the edge of the pool to look around, he noticed a girl drowning in the pool. Of course, he must go to rescue immediately. Moreover, it is difficult for the girl to have ... | #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
inline long double add(long double a, long double b){
return abs(a+b)<(1e-11)*(abs(a)+abs(b)) ? 0.0 : a+b;
}
struct vec{
long double x,y;
vec operator-(vec b){
return (vec){add(x,-b.x... | 2C++ | {
"input": [
"4\n0 0 10 0 10 10 0 10\n10\n12\n0 5\n9 5\n4\n0 0 10 0 10 10 0 10\n10\n12\n0 0\n9 1\n4\n0 0 10 0 10 10 0 10\n10\n12\n0 1\n9 1\n8\n2 0 4 0 6 2 6 4 4 6 2 6 0 4 0 2\n10\n12\n3 0\n3 5\n0",
"4\n0 1 10 0 10 10 0 10\n10\n12\n0 5\n9 5\n4\n0 0 10 0 10 10 0 10\n10\n12\n0 0\n9 1\n4\n0 0 10 0 10 10 0 10\n10\... | 6AIZU |
p01141 Lifeguard in the Pool_2661 | Lifeguard in the Pool
Pool guard
English text is not available in this practice contest.
Horton Moore works as a pool watchman. As he walked around the edge of the pool to look around, he noticed a girl drowning in the pool. Of course, he must go to rescue immediately. Moreover, it is difficult for the girl to have ... |
import java.io.*;
import java.util.*;
// æÔá¤Æ±ëB
// âè¶É¢ÄÈÄàâèZbgÍ¡Å檪0ÅI¹Å éB
// âèZbgÌJèÔµÉú»Rê
// 2011/10/17
//@2016 v[ÌÄõ
public class Main {
class Double2 {
public double x, y;
public Double2() {/**/}
public Double2( doub... | 4JAVA | {
"input": [
"4\n0 0 10 0 10 10 0 10\n10\n12\n0 5\n9 5\n4\n0 0 10 0 10 10 0 10\n10\n12\n0 0\n9 1\n4\n0 0 10 0 10 10 0 10\n10\n12\n0 1\n9 1\n8\n2 0 4 0 6 2 6 4 4 6 2 6 0 4 0 2\n10\n12\n3 0\n3 5\n0",
"4\n0 1 10 0 10 10 0 10\n10\n12\n0 5\n9 5\n4\n0 0 10 0 10 10 0 10\n10\n12\n0 0\n9 1\n4\n0 0 10 0 10 10 0 10\n10\... | 6AIZU |
p01280 Galaxy Wide Web Service_2662 | The volume of access to a web service varies from time to time in a day. Also, the hours with the highest volume of access varies from service to service. For example, a service popular in the United States may receive more access in the daytime in the United States, while another service popular in Japan may receive m... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<iomanip>
#include<set>
#include<numeric>
#include<sstream>
#include<random>
#include<cassert>
#include<complex>
#include<list>
using namespace std;
typedef long long ll;
#define rep(i, n) for (... | 2C++ | {
"input": [
"2\n4 0 1 2 3 4\n2 0 2 1\n0",
"2\n4 0 1 2 3 4\n2 -1 2 1\n0",
"2\n4 0 1 2 3 4\n2 1 1 1\n0",
"2\n4 0 2 2 3 8\n2 -1 2 2\n0",
"2\n4 0 1 1 3 0\n2 1 1 1\n0",
"2\n4 0 1 2 0 8\n2 0 2 1\n0",
"2\n4 0 1 2 0 8\n2 1 3 2\n0",
"2\n4 0 1 2 0 5\n2 1 3 0\n0",
"2\n4 0 1 2 0 4\n2 1 3 0\n0... | 6AIZU |
p01280 Galaxy Wide Web Service_2663 | The volume of access to a web service varies from time to time in a day. Also, the hours with the highest volume of access varies from service to service. For example, a service popular in the United States may receive more access in the daytime in the United States, while another service popular in Japan may receive m... | from itertools import cycle
while True:
n = int(input())
if not n:
break
qs = {}
for i in range(n):
d, t, *q = (int(s) for s in input().split())
q = q[t:] + q[:t]
if d not in qs:
qs[d] = q
else:
qs[d] = [a + b for a, b in zip(qs[d], q)]
... | 3Python3 | {
"input": [
"2\n4 0 1 2 3 4\n2 0 2 1\n0",
"2\n4 0 1 2 3 4\n2 -1 2 1\n0",
"2\n4 0 1 2 3 4\n2 1 1 1\n0",
"2\n4 0 2 2 3 8\n2 -1 2 2\n0",
"2\n4 0 1 1 3 0\n2 1 1 1\n0",
"2\n4 0 1 2 0 8\n2 0 2 1\n0",
"2\n4 0 1 2 0 8\n2 1 3 2\n0",
"2\n4 0 1 2 0 5\n2 1 3 0\n0",
"2\n4 0 1 2 0 4\n2 1 3 0\n0... | 6AIZU |
p01450 My friends are small_2664 | I have a lot of friends. Every friend is very small.
I often go out with my friends. Put some friends in your backpack and go out together.
Every morning I decide which friends to go out with that day. Put friends one by one in an empty backpack.
I'm not very strong. Therefore, there is a limit to the weight of friends... | N, W = map(int, raw_input().split())
L = sorted([int(raw_input()) for _ in xrange(N)])
total = sum(L)
dp = [1] + [0] * W
ans = 0 if total > W else 1
for i, w in zip(xrange(N, -1, -1), L[::-1]):
total -= w
res = W - total
if res >= 0:
ans = (ans + sum(dp[max(0, res - w + 1):res + 1])) % (10**9 + 7)
... | 1Python2 | {
"input": [
"6 37\n5\n9\n13\n18\n26\n33",
"4 25\n20\n15\n20\n15",
"4 8\n1\n2\n7\n9",
"6 37\n5\n9\n24\n18\n26\n33",
"4 1\n1\n2\n7\n9",
"4 1\n1\n1\n11\n2",
"6 37\n5\n16\n13\n18\n26\n33",
"4 25\n9\n15\n20\n15",
"6 37\n5\n6\n24\n18\n26\n33",
"6 37\n6\n16\n13\n18\n26\n16",
"6 3... | 6AIZU |
p01450 My friends are small_2665 | I have a lot of friends. Every friend is very small.
I often go out with my friends. Put some friends in your backpack and go out together.
Every morning I decide which friends to go out with that day. Put friends one by one in an empty backpack.
I'm not very strong. Therefore, there is a limit to the weight of friends... | #include<iostream>
#include<algorithm>
using namespace std;
#define MOD 1000000007
#define MAX_N 210
#define MAX_W 10100
int dp[2][MAX_N][MAX_W];
int N, W, x[MAX_N];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> x[i];
}
x[N + 1] = W + 1;
sort(x + 1, x + N + 1);
dp[1][1][0] = 1;
for (int i ... | 2C++ | {
"input": [
"6 37\n5\n9\n13\n18\n26\n33",
"4 25\n20\n15\n20\n15",
"4 8\n1\n2\n7\n9",
"6 37\n5\n9\n24\n18\n26\n33",
"4 1\n1\n2\n7\n9",
"4 1\n1\n1\n11\n2",
"6 37\n5\n16\n13\n18\n26\n33",
"4 25\n9\n15\n20\n15",
"6 37\n5\n6\n24\n18\n26\n33",
"6 37\n6\n16\n13\n18\n26\n16",
"6 3... | 6AIZU |
p01450 My friends are small_2666 | I have a lot of friends. Every friend is very small.
I often go out with my friends. Put some friends in your backpack and go out together.
Every morning I decide which friends to go out with that day. Put friends one by one in an empty backpack.
I'm not very strong. Therefore, there is a limit to the weight of friends... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.... | 3Python3 | {
"input": [
"6 37\n5\n9\n13\n18\n26\n33",
"4 25\n20\n15\n20\n15",
"4 8\n1\n2\n7\n9",
"6 37\n5\n9\n24\n18\n26\n33",
"4 1\n1\n2\n7\n9",
"4 1\n1\n1\n11\n2",
"6 37\n5\n16\n13\n18\n26\n33",
"4 25\n9\n15\n20\n15",
"6 37\n5\n6\n24\n18\n26\n33",
"6 37\n6\n16\n13\n18\n26\n16",
"6 3... | 6AIZU |
p01450 My friends are small_2667 | I have a lot of friends. Every friend is very small.
I often go out with my friends. Put some friends in your backpack and go out together.
Every morning I decide which friends to go out with that day. Put friends one by one in an empty backpack.
I'm not very strong. Therefore, there is a limit to the weight of friends... | import java.util.*;
import java.io.*;
public class Main{
public static void main(String[] args)throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
final int MOD = 1000000007;
while(br.ready()){
String[] s = br.readLine().split(" ");
int N = Integer.p... | 4JAVA | {
"input": [
"6 37\n5\n9\n13\n18\n26\n33",
"4 25\n20\n15\n20\n15",
"4 8\n1\n2\n7\n9",
"6 37\n5\n9\n24\n18\n26\n33",
"4 1\n1\n2\n7\n9",
"4 1\n1\n1\n11\n2",
"6 37\n5\n16\n13\n18\n26\n33",
"4 25\n9\n15\n20\n15",
"6 37\n5\n6\n24\n18\n26\n33",
"6 37\n6\n16\n13\n18\n26\n16",
"6 3... | 6AIZU |
p01600 Tree Construction_2668 | Problem J: Tree Construction
Consider a two-dimensional space with a set of points (xi, yi) that satisfy xi < xj and yi > yj for all i < j. We want to have them all connected by a directed tree whose edges go toward either right (x positive) or upward (y positive). The figure below shows an example tree.
<image>
Figu... | #include<vector>
#include<iostream>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<cctype>
#include<cassert>
#include<cmath>
#include<climits>
#define INF (1<<29)
#define all(c) (c).begin(),(c).end()
#define D(x) cout << #x " is " << (x) << endl
#define rep(i,n) for(int i = 0... | 2C++ | {
"input": [
"5\n1 5\n2 4\n3 3\n4 2\n5 1",
"1\n10000 0",
"1\n11000 0",
"1\n10010 0",
"1\n10000 -1",
"1\n00000 -1",
"1\n00010 -1",
"1\n00011 -1",
"1\n00011 -2",
"1\n00011 0",
"1\n00001 0",
"1\n01001 0",
"1\n01000 0",
"1\n00000 0",
"1\n00000 1",
"1\n01000 ... | 6AIZU |
p01600 Tree Construction_2669 | Problem J: Tree Construction
Consider a two-dimensional space with a set of points (xi, yi) that satisfy xi < xj and yi > yj for all i < j. We want to have them all connected by a directed tree whose edges go toward either right (x positive) or upward (y positive). The figure below shows an example tree.
<image>
Figu... | import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class Main{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-12;
int n;
int[] xs, ys;
void run(){
n=sc.... | 4JAVA | {
"input": [
"5\n1 5\n2 4\n3 3\n4 2\n5 1",
"1\n10000 0",
"1\n11000 0",
"1\n10010 0",
"1\n10000 -1",
"1\n00000 -1",
"1\n00010 -1",
"1\n00011 -1",
"1\n00011 -2",
"1\n00011 0",
"1\n00001 0",
"1\n01001 0",
"1\n01000 0",
"1\n00000 0",
"1\n00000 1",
"1\n01000 ... | 6AIZU |
p01756 Longest Match_2670 | Given the string S and m queries. The i-th query is given by the two strings xi and yi.
For each query, answer the longest substring of the string S, starting with xi and ending with yi.
For the string S, | S | represents the length of S. Also, the fact that the character string T is a substring of the character stri... | #include<stdio.h>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
#define MAX 200005
#define INF (1<<26)
int segN=1000000;
struct data{
int value;
data* ch[2];
void init(){
value=INF;
ch[0]=new data;
ch[1]=new data;
ch[0]->ch[0]=NULL;
... | 2C++ | {
"input": [
"howistheprogress\n4\nist prog\ns ss\nhow is\nthe progress",
"abracadabra\n5\nab a\na a\nb c\nac ca\nz z",
"icpcsummertraining\n9\nmm m\nicpc summer\ntrain ing\nsummer mm\ni c\ni i\ng g\ntrain i\nsummer er",
"howistheprogress\n4\nist prog\ns ss\nhow is\nteh progress",
"abracadabsa\n5\... | 6AIZU |
p01756 Longest Match_2671 | Given the string S and m queries. The i-th query is given by the two strings xi and yi.
For each query, answer the longest substring of the string S, starting with xi and ending with yi.
For the string S, | S | represents the length of S. Also, the fact that the character string T is a substring of the character stri... | from collections import defaultdict
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def solve():
base = 37; MOD = 10**9 + 9
S = readline().strip()
L = len(S)
H = [0]*(L+1)
v = 0
ca = ord('a')
for i in range(L):
H[i+1] = v = (v * base + (ord(S[i]) - ca)) % MOD
M ... | 3Python3 | {
"input": [
"howistheprogress\n4\nist prog\ns ss\nhow is\nthe progress",
"abracadabra\n5\nab a\na a\nb c\nac ca\nz z",
"icpcsummertraining\n9\nmm m\nicpc summer\ntrain ing\nsummer mm\ni c\ni i\ng g\ntrain i\nsummer er",
"howistheprogress\n4\nist prog\ns ss\nhow is\nteh progress",
"abracadabsa\n5\... | 6AIZU |
p01756 Longest Match_2672 | Given the string S and m queries. The i-th query is given by the two strings xi and yi.
For each query, answer the longest substring of the string S, starting with xi and ending with yi.
For the string S, | S | represents the length of S. Also, the fact that the character string T is a substring of the character stri... | import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.*;
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
... | 4JAVA | {
"input": [
"howistheprogress\n4\nist prog\ns ss\nhow is\nthe progress",
"abracadabra\n5\nab a\na a\nb c\nac ca\nz z",
"icpcsummertraining\n9\nmm m\nicpc summer\ntrain ing\nsummer mm\ni c\ni i\ng g\ntrain i\nsummer er",
"howistheprogress\n4\nist prog\ns ss\nhow is\nteh progress",
"abracadabsa\n5\... | 6AIZU |
p01896 Folding Paper_2673 | Problem statement
There is a rectangular piece of paper divided in a grid with a height of $ H $ squares and a width of $ W $ squares. The integer $ i \ times W + j $ is written in the cell of the $ i $ line from the top and the $ j $ column from the left counting from $ 0 $. An example of $ H = 2 and W = 3 $ is shown... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10LL * TEN(n-1); }
using P = pair<int, int>;
bool ok(vector<P> v) {
for (auto &p: v) {
if (p.first > p.second) {
swap(p.first, p.second);
... | 2C++ | {
"input": [
"1 4\n0 1 2 3",
"1 4\n0 1 2 5",
"0 4\n0 1 2 10",
"1 4\n0 1 2 10",
"0 4\n0 1 2 8",
"0 4\n0 1 2 1",
"0 4\n0 1 2 2",
"1 4\n0 1 2 2",
"1 4\n1 1 2 5",
"0 1\n0 1 2 10",
"0 4\n-1 1 2 8",
"0 3\n0 1 2 1",
"0 3\n0 1 2 2",
"1 6\n1 1 2 5",
"1 1\n0 1 2 10",
... | 6AIZU |
p02033 Arrow_2674 | D: Arrow / Arrow
problem
rodea is in a one-dimensional coordinate system and stands at x = 0. From this position, throw an arrow of positive integer length that always moves at speed 1 towards the target at x = N. However, rodea is powerless, so we have decided to put a total of M blowers in the section 0 \ leq x \ l... | import itertools as ite
import math
INF = 10 ** 18
N, M = map(int, raw_input().split())
m = map(int, raw_input().split()) + [N + 1]
Q = input()
l = map(int, raw_input().split())
cost = [0] * (N + 1)
for i in range(M):
cost[m[i + 1] - m[i] - 1] += 1
cost[N] += m[0] - 1
grad = 0
for i in range(N)[::-1]:
grad += ... | 1Python2 | {
"input": [
"5 1\n2\n1\n3",
"6 1\n2\n1\n3",
"5 1\n2\n1\n0",
"6 1\n2\n1\n4",
"5 1\n1\n1\n0",
"6 1\n2\n1\n8",
"5 1\n1\n1\n1",
"7 1\n1\n1\n0",
"8 1\n1\n1\n0",
"10 1\n1\n1\n1",
"11 1\n6\n1\n5",
"15 1\n3\n1\n2",
"15 1\n6\n1\n5",
"15 1\n3\n1\n3",
"15 1\n1\n1\n0",... | 6AIZU |
p02033 Arrow_2675 | D: Arrow / Arrow
problem
rodea is in a one-dimensional coordinate system and stands at x = 0. From this position, throw an arrow of positive integer length that always moves at speed 1 towards the target at x = N. However, rodea is powerless, so we have decided to put a total of M blowers in the section 0 \ leq x \ l... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define AND(x,y,z)
#define DUMP(xs) for (auto x:xs) cout<<x<<' ';cout<<endl
#define DUMPP(xs) for (auto x:xs) cout<<'('<<x.first<<','<<x.second<<')';cout<<endl
#define FOR(i,a,b) for (ll i=(ll)(a);i<(ll)(b);++i)
#define OUT(x) cout<<... | 2C++ | {
"input": [
"5 1\n2\n1\n3",
"6 1\n2\n1\n3",
"5 1\n2\n1\n0",
"6 1\n2\n1\n4",
"5 1\n1\n1\n0",
"6 1\n2\n1\n8",
"5 1\n1\n1\n1",
"7 1\n1\n1\n0",
"8 1\n1\n1\n0",
"10 1\n1\n1\n1",
"11 1\n6\n1\n5",
"15 1\n3\n1\n2",
"15 1\n6\n1\n5",
"15 1\n3\n1\n3",
"15 1\n1\n1\n0",... | 6AIZU |
p02033 Arrow_2676 | D: Arrow / Arrow
problem
rodea is in a one-dimensional coordinate system and stands at x = 0. From this position, throw an arrow of positive integer length that always moves at speed 1 towards the target at x = N. However, rodea is powerless, so we have decided to put a total of M blowers in the section 0 \ leq x \ l... | from bisect import bisect_left
def inpl(): return list(map(int, input().split()))
N, M = inpl()
X = inpl()
Q = int(input())
L = inpl()
X += [N+1]
initcost = X[0] - 1
costs = [X[i+1] - X[i] - 1 for i in range(M) if X[i+1] - X[i] > 1]
C = [0]*(N+1)
C[0] = - 10**9
for i in range(1, N+1):
cost = 0
costs2 = []
... | 3Python3 | {
"input": [
"5 1\n2\n1\n3",
"6 1\n2\n1\n3",
"5 1\n2\n1\n0",
"6 1\n2\n1\n4",
"5 1\n1\n1\n0",
"6 1\n2\n1\n8",
"5 1\n1\n1\n1",
"7 1\n1\n1\n0",
"8 1\n1\n1\n0",
"10 1\n1\n1\n1",
"11 1\n6\n1\n5",
"15 1\n3\n1\n2",
"15 1\n6\n1\n5",
"15 1\n3\n1\n3",
"15 1\n1\n1\n0",... | 6AIZU |
p02033 Arrow_2677 | D: Arrow / Arrow
problem
rodea is in a one-dimensional coordinate system and stands at x = 0. From this position, throw an arrow of positive integer length that always moves at speed 1 towards the target at x = N. However, rodea is powerless, so we have decided to put a total of M blowers in the section 0 \ leq x \ l... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int mm = sc.nextInt();
TreeMap<Integer, Integer> counts = new TreeMap<>();
int start = sc.nextInt();
int prev = start;
... | 4JAVA | {
"input": [
"5 1\n2\n1\n3",
"6 1\n2\n1\n3",
"5 1\n2\n1\n0",
"6 1\n2\n1\n4",
"5 1\n1\n1\n0",
"6 1\n2\n1\n8",
"5 1\n1\n1\n1",
"7 1\n1\n1\n0",
"8 1\n1\n1\n0",
"10 1\n1\n1\n1",
"11 1\n6\n1\n5",
"15 1\n3\n1\n2",
"15 1\n6\n1\n5",
"15 1\n3\n1\n3",
"15 1\n1\n1\n0",... | 6AIZU |
p02176 Shortest Crypt_2678 | problem
Cryptography is all the rage at xryuseix's school. Xryuseix, who lives in a grid of cities, has come up with a new cryptography to decide where to meet.
The ciphertext consists of the $ N $ character string $ S $, and the $ S_i $ character determines the direction of movement from the current location. The di... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define debug(x) cerr<<#x<<":"<<(x)<<endl;
signed main() {
int n;cin>>n;
string s; cin>>s;
int x=0,y=0;
for(int i=0;i<s.size();++i){
if ('a' <= s[i] && s[i] <= 'm') ++x;
if ('n' <= s[i] && s[i] <= 'z') --x;
if ... | 2C++ | {
"input": [
"5\nANazA",
"5\nAzaNA",
"5\nAMazA",
"5\nzAaNA",
"5\nAzaAN",
"5\nzAaNB",
"5\nAMAza",
"5\nAzaBN",
"5\nzAaNC",
"5\nAMBza",
"5\nNBazA",
"5\nAaBzM",
"5\nNBAza",
"5\nAazBM",
"5\nzBANa",
"5\nzBAOa",
"5\nzOABa",
"5\nzOABb",
"5\nzOAbB",
... | 6AIZU |
p02176 Shortest Crypt_2679 | problem
Cryptography is all the rage at xryuseix's school. Xryuseix, who lives in a grid of cities, has come up with a new cryptography to decide where to meet.
The ciphertext consists of the $ N $ character string $ S $, and the $ S_i $ character determines the direction of movement from the current location. The di... | N = int(input())
word = list(input())
X1 = ['A','B','C','D','E','F','G','H','I','J','K','L','M']
X2 = ['N','O','P','Q','R','S','T','U','V','W','X','Y','Z']
Y1 = ['a','b','c','d','e','f','g','h','i','j','k','l','m']
Y2 = ['n','o','p','q','r','s','t','u','v','w','x','y','z']
x = 0
y = 0
answer = ""
for i in word:
if i ... | 3Python3 | {
"input": [
"5\nANazA",
"5\nAzaNA",
"5\nAMazA",
"5\nzAaNA",
"5\nAzaAN",
"5\nzAaNB",
"5\nAMAza",
"5\nAzaBN",
"5\nzAaNC",
"5\nAMBza",
"5\nNBazA",
"5\nAaBzM",
"5\nNBAza",
"5\nAazBM",
"5\nzBANa",
"5\nzBAOa",
"5\nzOABa",
"5\nzOABb",
"5\nzOAbB",
... | 6AIZU |
p02176 Shortest Crypt_2680 | problem
Cryptography is all the rage at xryuseix's school. Xryuseix, who lives in a grid of cities, has come up with a new cryptography to decide where to meet.
The ciphertext consists of the $ N $ character string $ S $, and the $ S_i $ character determines the direction of movement from the current location. The di... | import java.io.*;
import java.util.*;
// 3101
public class Main {
List<Integer> a = new ArrayList<>();
// メイン return falseでおしまい
boolean main() throws IOException {
int N = readIntArray()[0];
String S = reader.readLine();
// if (N == 0)
// return false; /* おしまい */
int north = 0;
... | 4JAVA | {
"input": [
"5\nANazA",
"5\nAzaNA",
"5\nAMazA",
"5\nzAaNA",
"5\nAzaAN",
"5\nzAaNB",
"5\nAMAza",
"5\nAzaBN",
"5\nzAaNC",
"5\nAMBza",
"5\nNBazA",
"5\nAaBzM",
"5\nNBAza",
"5\nAazBM",
"5\nzBANa",
"5\nzBAOa",
"5\nzOABa",
"5\nzOABb",
"5\nzOAbB",
... | 6AIZU |
p02319 0-1 Knapsack Problem II_2681 | You have N items that you want to put them into a knapsack. Item i has value vi and weight wi.
You want to find a subset of items to put such that:
* The total value of the items is as large as possible.
* The items have combined weight at most W, that is capacity of the knapsack.
Find the maximum total value of i... | N,W = map(int, raw_input().split())
vs,ws = [],[]
for i in range(N):
v,w = map(int, raw_input().split())
vs.append(v)
ws.append(w)
V = sum(vs)
DP = [10**10]*(V+1)
DP[0] = 0
for v,w in zip(vs, ws):
for i in reversed(range(v, V+1)):
DP[i] = min(DP[i], DP[i-v] + w)
ans = max(v for v,w in enumera... | 1Python2 | {
"input": [
"4 5\n4 2\n5 2\n2 1\n8 3",
"2 20\n5 9\n4 10",
"4 5\n0 2\n5 2\n2 1\n8 3",
"2 20\n5 9\n3 10",
"4 2\n0 2\n5 2\n2 1\n8 3",
"2 20\n5 9\n2 10",
"2 20\n5 9\n1 8",
"2 20\n4 5\n0 4",
"4 5\n4 2\n5 2\n2 0\n8 3",
"2 20\n5 9\n7 10",
"4 7\n4 2\n5 2\n2 0\n8 3",
"2 20\n9 1... | 6AIZU |
p02319 0-1 Knapsack Problem II_2682 | You have N items that you want to put them into a knapsack. Item i has value vi and weight wi.
You want to find a subset of items to put such that:
* The total value of the items is as large as possible.
* The items have combined weight at most W, that is capacity of the knapsack.
Find the maximum total value of i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, W;
cin >> N >> W;
vector<ll> v(N), w(N);
for (int i = 0; i < N; ++i) {
cin >> v.at(i) >> w.at(i);
}
vector<vector<ll> > dp(N ... | 2C++ | {
"input": [
"4 5\n4 2\n5 2\n2 1\n8 3",
"2 20\n5 9\n4 10",
"4 5\n0 2\n5 2\n2 1\n8 3",
"2 20\n5 9\n3 10",
"4 2\n0 2\n5 2\n2 1\n8 3",
"2 20\n5 9\n2 10",
"2 20\n5 9\n1 8",
"2 20\n4 5\n0 4",
"4 5\n4 2\n5 2\n2 0\n8 3",
"2 20\n5 9\n7 10",
"4 7\n4 2\n5 2\n2 0\n8 3",
"2 20\n9 1... | 6AIZU |
p02319 0-1 Knapsack Problem II_2683 | You have N items that you want to put them into a knapsack. Item i has value vi and weight wi.
You want to find a subset of items to put such that:
* The total value of the items is as large as possible.
* The items have combined weight at most W, that is capacity of the knapsack.
Find the maximum total value of i... | n, m = map(int, input().split())
VW = [tuple(map(int, input().split())) for i in range(n)]
V = [v for v, w in VW]
W = [w for v, w in VW]
# n, m = 4, 5
# V = [4, 5, 2, 8]
# W = [2, 2, 1, 3]
# DP[i][j]=i個の品物で価値j以上で最小の重さ
sv = sum(V)
inf = 10**10
DP = [[inf for j in range(sv+1)] for i in range(n+1)]
DP[0][0] = 0
for i in r... | 3Python3 | {
"input": [
"4 5\n4 2\n5 2\n2 1\n8 3",
"2 20\n5 9\n4 10",
"4 5\n0 2\n5 2\n2 1\n8 3",
"2 20\n5 9\n3 10",
"4 2\n0 2\n5 2\n2 1\n8 3",
"2 20\n5 9\n2 10",
"2 20\n5 9\n1 8",
"2 20\n4 5\n0 4",
"4 5\n4 2\n5 2\n2 0\n8 3",
"2 20\n5 9\n7 10",
"4 7\n4 2\n5 2\n2 0\n8 3",
"2 20\n9 1... | 6AIZU |
p02319 0-1 Knapsack Problem II_2684 | You have N items that you want to put them into a knapsack. Item i has value vi and weight wi.
You want to find a subset of items to put such that:
* The total value of the items is as large as possible.
* The items have combined weight at most W, that is capacity of the knapsack.
Find the maximum total value of i... | import java.util.*;
public class Main{
public static void main(String[] args){
try(Scanner sc = new Scanner(System.in)){
int N = sc.nextInt();
long W = sc.nextLong();
long[] dp = new long[N*100+1];
f... | 4JAVA | {
"input": [
"4 5\n4 2\n5 2\n2 1\n8 3",
"2 20\n5 9\n4 10",
"4 5\n0 2\n5 2\n2 1\n8 3",
"2 20\n5 9\n3 10",
"4 2\n0 2\n5 2\n2 1\n8 3",
"2 20\n5 9\n2 10",
"2 20\n5 9\n1 8",
"2 20\n4 5\n0 4",
"4 5\n4 2\n5 2\n2 0\n8 3",
"2 20\n5 9\n7 10",
"4 7\n4 2\n5 2\n2 0\n8 3",
"2 20\n9 1... | 6AIZU |
p02464 Set Intersection_2685 | Find the intersection of two sets $A = \\{a_0, a_1, ..., a_{n-1}\\}$ and $B = \\{b_0, b_1, ..., b_{m-1}\\}$.
Constraints
* $1 \leq n, m \leq 200,000$
* $0 \leq a_0 < a_1 < ... < a_{n-1} \leq 10^9$
* $0 \leq b_0 < b_1 < ... < b_{m-1} \leq 10^9$
Input
The input is given in the following format.
$n$
$a_0 \; a_1 \; .... | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
set<int> a,b,c;
int n,m;
int x;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>x;
a.insert(x);
}
cin>>m;
for(int i=0;i<m;i++)
... | 2C++ | {
"input": [
"4\n1 2 5 8\n5\n2 3 5 9 11",
"4\n1 2 5 8\n5\n4 3 5 9 11",
"4\n1 2 5 8\n9\n2 3 5 9 11",
"4\n1 2 9 8\n5\n4 3 5 9 11",
"4\n1 2 5 8\n9\n1 3 5 9 11",
"4\n1 2 9 8\n7\n2 3 5 9 11",
"4\n1 2 2 8\n9\n1 3 5 9 11",
"4\n1 3 9 8\n7\n2 3 5 9 11",
"4\n0 2 5 8\n5\n0 3 5 9 12",
"4\n... | 6AIZU |
p02464 Set Intersection_2686 | Find the intersection of two sets $A = \\{a_0, a_1, ..., a_{n-1}\\}$ and $B = \\{b_0, b_1, ..., b_{m-1}\\}$.
Constraints
* $1 \leq n, m \leq 200,000$
* $0 \leq a_0 < a_1 < ... < a_{n-1} \leq 10^9$
* $0 \leq b_0 < b_1 < ... < b_{m-1} \leq 10^9$
Input
The input is given in the following format.
$n$
$a_0 \; a_1 \; .... | def main():
n = int(input())
a = list(map(int,input().split()))
m = int(input())
b = list(map(int,input().split()))
s = sorted(set(a)&set(b))
for c in s:print (c)
if __name__ == '__main__':
main()
| 3Python3 | {
"input": [
"4\n1 2 5 8\n5\n2 3 5 9 11",
"4\n1 2 5 8\n5\n4 3 5 9 11",
"4\n1 2 5 8\n9\n2 3 5 9 11",
"4\n1 2 9 8\n5\n4 3 5 9 11",
"4\n1 2 5 8\n9\n1 3 5 9 11",
"4\n1 2 9 8\n7\n2 3 5 9 11",
"4\n1 2 2 8\n9\n1 3 5 9 11",
"4\n1 3 9 8\n7\n2 3 5 9 11",
"4\n0 2 5 8\n5\n0 3 5 9 12",
"4\n... | 6AIZU |
p02464 Set Intersection_2687 | Find the intersection of two sets $A = \\{a_0, a_1, ..., a_{n-1}\\}$ and $B = \\{b_0, b_1, ..., b_{m-1}\\}$.
Constraints
* $1 \leq n, m \leq 200,000$
* $0 \leq a_0 < a_1 < ... < a_{n-1} \leq 10^9$
* $0 \leq b_0 < b_1 < ... < b_{m-1} \leq 10^9$
Input
The input is given in the following format.
$n$
$a_0 \; a_1 \; .... | import java.util.Scanner;
import java.util.TreeSet;
public class Main {
public static void main(String args[]) {
Scanner scan = new Scanner (System.in);
//list作成
TreeSet<Integer> set = new TreeSet<>();
int a = scan.nextInt();
for(int i=0; i<a; i++) {
int num = scan.nextInt();
set.add(num);
}
... | 4JAVA | {
"input": [
"4\n1 2 5 8\n5\n2 3 5 9 11",
"4\n1 2 5 8\n5\n4 3 5 9 11",
"4\n1 2 5 8\n9\n2 3 5 9 11",
"4\n1 2 9 8\n5\n4 3 5 9 11",
"4\n1 2 5 8\n9\n1 3 5 9 11",
"4\n1 2 9 8\n7\n2 3 5 9 11",
"4\n1 2 2 8\n9\n1 3 5 9 11",
"4\n1 3 9 8\n7\n2 3 5 9 11",
"4\n0 2 5 8\n5\n0 3 5 9 12",
"4\n... | 6AIZU |
a3_2688 | Alice and Johnny are playing a simple guessing game. Johnny picks an arbitrary positive integer n (1 ≤ n ≤ 10^9) and gives Alice exactly k hints about the value of n. It is Alice's task to guess n, based on the received hints.
Alice often has a serious problem guessing the value of n, and she's beginning to suspect t... | from collections import Counter
minr = 1
maxr = 10 ** 9 + 1
t = int(raw_input())
for i in xrange(t):
k = int(raw_input())
cnt = Counter()
for j in xrange(k):
op, num, ans = raw_input().split()
ans = ans.upper()
num = int(num)
if op == '<':
if ans == 'YES':
... | 1Python2 | {
"input": [
"3\n2\n< 100 No\n> 100 No\n3\n< 2 Yes\n> 4 Yes\n= 3 No\n6\n< 2 Yes\n> 1 Yes\n= 1 Yes\n= 1 Yes\n> 1 Yes\n= 1 Yes",
"3\n2\n< 100 No\n> 100 No\n3\n< 2 Yes\n> 4 Yes\n= 3 No\n6\n< 2 Yes\n> 1 Yes\n= 1 Yes\n= 1 Yes\n= 1 Yes\n= 1 Yes",
"3\n2\n< 100 No\n? 100 No\n3\n< 2 Yes\n> 4 Yes\n= 3 No\n6\n< 2 Ye... | 1CODECHEF |
chefbm_2689 | Spring is interesting season of year. Chef is thinking about different things, but last time he thinks about interesting game - "Strange Matrix".
Chef has a matrix that consists of n rows, each contains m elements. Initially, the element aij of matrix equals j. (1 ≤ i ≤ n, 1 ≤ j ≤ m).
Then p times some element aij is... | n,m,p=map(int,raw_input().split())
b=[]
for x in xrange(p):
a=map(int,raw_input().split())
b.append(a)
b.sort()
pos=0
for i in xrange(1,n+1):
if b[pos][0]!=i:
ans=m-1
else:
count=0
prev=0
ans=m-1
while b[pos][0]==i and m!=1:
count=count+1
i... | 1Python2 | {
"input": [
"4 4 6\n2 2\n3 2 \n3 2 \n4 3\n4 4\n4 3",
"4 4 6\n3 2\n3 2 \n3 2 \n4 3\n4 4\n4 3",
"4 4 6\n3 2\n3 2 \n3 2 \n4 3\n4 4\n4 1",
"4 4 6\n3 2\n3 3 \n3 2 \n4 3\n4 4\n4 3",
"4 6 6\n3 2\n2 3 \n3 2 \n4 3\n4 4\n4 3",
"4 6 2\n3 2\n2 3 \n3 2 \n4 3\n4 4\n4 3",
"3 6 2\n1 2\n3 0 \n6 2 \n4 3\n1... | 1CODECHEF |
digjump_2690 | Chef loves games! But he likes to invent his own. Now he plays game "Digit Jump". Chef has sequence of digits S1, S2,..., SN,. He is staying in the first digit (S1) and want to reach the last digit (SN) in the minimal number of jumps.
While staying in some digit x with index i (digit Si) Chef can jump into digits with... | import sys
s = raw_input().strip()
digits = [[] for i in xrange(10)]
dist = [-1] * (len(s))
used = [False] * 10
for i in xrange(len(s)):
digits[int(s[i])].append(i)
dist[0] = 0
q = [0]
while True:
v = q.pop(0)
cur = dist[v]
if v == len(s)-1:
print cur
sys.exit()
if cur ... | 1Python2 | {
"input": [
"01234567890",
"012134444444443",
"1352328136",
"20776892991725",
"6858574858270",
"10353326888495",
"2595212919780",
"1149262658611",
"361054554527",
"6",
"1404985567",
"22244193067",
"616962463",
"495895796",
"521512370",
"14708953637626",... | 1CODECHEF |
insoma4_2691 | In the hidden country of Lapatrecta, an age old custom was followed to ensure that no outsider ever entered their country undetected. The security measure, though simple, was an effective one. Every person born in Lapatrecta had the initials of all his forefathers included in front of his name. Every once in a while, c... | N = int (raw_input())
words = []
maxDep = 0
def dfs(dic, depth):
global maxDep
if dic['__a'] > 1:
if depth > maxDep:
maxDep = depth
for key in dic.keys():
if key!='__a':
if dic[key]['__a'] > 1:
dfs(dic[key], depth+1)
dic = {}
dic['__a'] = 0
for ... | 1Python2 | {
"input": [
"3\nAPJQ\nAPJRS\nPJQ"
],
"output": [
"3"
]
} | 1CODECHEF |
nf02_2692 | NITMAS Fest is live. The members of the community are very busy. People from different colleges have come to compete. But, Naveen is very possessive about his girlfriend, Archana. He always remains close to his girlfriend. Couples (boys in a line and girls in another) have to stand in different rows in a line for a gam... | a=list(map(int,raw_input().split()))
b=list(map(int,raw_input().split()))
arr=[]
for i in range(1,len(a)):
for j in range(1,len(b)):
arr.append(abs(a[i]-b[j]))
arr=sorted(arr)
print arr[0] | 1Python2 | {
"input": [
"4 2 4 6 8\n5 1 3 5 7 9"
],
"output": [
"1"
]
} | 1CODECHEF |
salg04_2693 | p
{
font-size:14px;
text-align:justify;
}
Two positive integers n amd m, n greater than or equal to m, will be given as input.
Make a code that generates all possible combinations of 1,2,3,...,n taking m integers at a time in "increasing order".
Comparison between two combinations:
a1,a2,a3,...,am
b1,b2,b3,...,bm
... | import itertools
n = int(raw_input())
m = int(raw_input())
ls = range(1, n + 1)
op = list(itertools.combinations(ls, m))
for t in op:
for x in t:
print x,
print | 1Python2 | {
"input": [
"5\n3"
],
"output": [
"1 2 3 \n1 2 4\n1 2 5\n1 3 4\n1 3 5\n1 4 5\n2 3 4\n2 3 5\n2 4 5\n3 4 5"
]
} | 1CODECHEF |
1000_A. Codehorses T-shirts_2694 | Codehorses has just hosted the second Codehorses Cup. This year, the same as the previous one, organizers are giving T-shirts for the winners.
The valid sizes of T-shirts are either "M" or from 0 to 3 "X" followed by "S" or "L". For example, sizes "M", "XXS", "L", "XXXL" are valid and "XM", "Z", "XXXXL" are not.
Ther... | #!/usr/bin/env python
n = int(raw_input())
s = {}
for i in xrange(n):
a = raw_input()
s[a] = s.get(a, 0) + 1
for i in xrange(n):
b = raw_input()
if b in s and s[b] > 0:
s[b] -= 1
print sum(s.values()) | 1Python2 | {
"input": [
"2\nM\nXS\nXS\nM\n",
"3\nXS\nXS\nM\nXL\nS\nXS\n",
"2\nXXXL\nXXL\nXXL\nXXXS\n",
"6\nM\nXXS\nXXL\nXXL\nL\nL\nXXS\nXXL\nS\nXXS\nL\nL\n",
"8\nXL\nXS\nS\nXXXL\nXXXL\nXL\nXXXL\nS\nXS\nXXXS\nXL\nL\nXXXS\nM\nXS\nXXXL\n",
"5\nXXS\nXXS\nXXL\nXXXS\nL\nXXS\nXXXL\nS\nXXS\nXXS\n",
"2\nL\nS\... | 2CODEFORCES |
1000_A. Codehorses T-shirts_2695 | Codehorses has just hosted the second Codehorses Cup. This year, the same as the previous one, organizers are giving T-shirts for the winners.
The valid sizes of T-shirts are either "M" or from 0 to 3 "X" followed by "S" or "L". For example, sizes "M", "XXS", "L", "XXXL" are valid and "XM", "Z", "XXXXL" are not.
Ther... | #include <bits/stdc++.h>
using namespace std;
const int dr[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int dc[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const double PI = acos(-1);
const double EPS = 10e-9;
const int e4 = 1e4 + 5;
const int e5 = 1e5 + 5;
const int e6 = 1e6 + 5;
map<string, int> m;
int main() {
int n, ans = 0;
s... | 2C++ | {
"input": [
"2\nM\nXS\nXS\nM\n",
"3\nXS\nXS\nM\nXL\nS\nXS\n",
"2\nXXXL\nXXL\nXXL\nXXXS\n",
"6\nM\nXXS\nXXL\nXXL\nL\nL\nXXS\nXXL\nS\nXXS\nL\nL\n",
"8\nXL\nXS\nS\nXXXL\nXXXL\nXL\nXXXL\nS\nXS\nXXXS\nXL\nL\nXXXS\nM\nXS\nXXXL\n",
"5\nXXS\nXXS\nXXL\nXXXS\nL\nXXS\nXXXL\nS\nXXS\nXXS\n",
"2\nL\nS\... | 2CODEFORCES |
1000_A. Codehorses T-shirts_2696 | Codehorses has just hosted the second Codehorses Cup. This year, the same as the previous one, organizers are giving T-shirts for the winners.
The valid sizes of T-shirts are either "M" or from 0 to 3 "X" followed by "S" or "L". For example, sizes "M", "XXS", "L", "XXXL" are valid and "XM", "Z", "XXXXL" are not.
Ther... | t=int(input())
pre=[]
curr=[]
for i in range(t):
s1=input()
pre.append(s1)
for i in range(t):
s2=input()
curr.append(s2)
z=0
for i in range(t):
if pre[i] in curr:
curr.remove(pre[i])
pass
else:
z+=1
print(z) | 3Python3 | {
"input": [
"2\nM\nXS\nXS\nM\n",
"3\nXS\nXS\nM\nXL\nS\nXS\n",
"2\nXXXL\nXXL\nXXL\nXXXS\n",
"6\nM\nXXS\nXXL\nXXL\nL\nL\nXXS\nXXL\nS\nXXS\nL\nL\n",
"8\nXL\nXS\nS\nXXXL\nXXXL\nXL\nXXXL\nS\nXS\nXXXS\nXL\nL\nXXXS\nM\nXS\nXXXL\n",
"5\nXXS\nXXS\nXXL\nXXXS\nL\nXXS\nXXXL\nS\nXXS\nXXS\n",
"2\nL\nS\... | 2CODEFORCES |
1000_A. Codehorses T-shirts_2697 | Codehorses has just hosted the second Codehorses Cup. This year, the same as the previous one, organizers are giving T-shirts for the winners.
The valid sizes of T-shirts are either "M" or from 0 to 3 "X" followed by "S" or "L". For example, sizes "M", "XXS", "L", "XXXL" are valid and "XM", "Z", "XXXXL" are not.
Ther... | import java.util.Arrays;
import java.util.TreeMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.Set;
public class practice {
public static void main (String[] args)
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
String[] old=... | 4JAVA | {
"input": [
"2\nM\nXS\nXS\nM\n",
"3\nXS\nXS\nM\nXL\nS\nXS\n",
"2\nXXXL\nXXL\nXXL\nXXXS\n",
"6\nM\nXXS\nXXL\nXXL\nL\nL\nXXS\nXXL\nS\nXXS\nL\nL\n",
"8\nXL\nXS\nS\nXXXL\nXXXL\nXL\nXXXL\nS\nXS\nXXXS\nXL\nL\nXXXS\nM\nXS\nXXXL\n",
"5\nXXS\nXXS\nXXL\nXXXS\nL\nXXS\nXXXL\nS\nXXS\nXXS\n",
"2\nL\nS\... | 2CODEFORCES |
1025_B. Weakened Common Divisor_2698 | During the research on properties of the greatest common divisor (GCD) of a set of numbers, Ildar, a famous mathematician, introduced a brand new concept of the weakened common divisor (WCD) of a list of pairs of integers.
For a given list of pairs of integers (a_1, b_1), (a_2, b_2), ..., (a_n, b_n) their WCD is arbit... | def gcd(a,b):
return a if b==0 else gcd(b,a%b)
n,g=int(raw_input()),0
a,b=[0]*n,[0]*n
for i in range(n):
a[i],b[i]=map(int,raw_input().split())
g=gcd(g,a[i]*b[i])
for i in range(n):
if gcd(g,a[i])>1:
g=gcd(g,a[i])
else:
g=gcd(g,b[i])
print(g if g>1 else -1) | 1Python2 | {
"input": [
"2\n10 16\n7 17\n",
"3\n17 18\n15 24\n12 15\n",
"5\n90 108\n45 105\n75 40\n165 175\n33 30\n",
"3\n14 14\n2 7\n2 2\n",
"30\n3 3\n2 2\n4 4\n8 8\n16 16\n32 32\n64 64\n128 128\n256 256\n512 512\n1024 1024\n2048 2048\n4096 4096\n8192 8192\n16384 16384\n32768 32768\n65536 65536\n131072 1310... | 2CODEFORCES |
1025_B. Weakened Common Divisor_2699 | During the research on properties of the greatest common divisor (GCD) of a set of numbers, Ildar, a famous mathematician, introduced a brand new concept of the weakened common divisor (WCD) of a list of pairs of integers.
For a given list of pairs of integers (a_1, b_1), (a_2, b_2), ..., (a_n, b_n) their WCD is arbit... | #include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
const double pi = acos(-1);
int n;
pair<int, int> arr[150005];
unordered_map<int, int> mp, mp2;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d%d", &arr[i].first, &arr[i].second);
for (int i = 2; i <= sqrt(arr[n - 1].first)... | 2C++ | {
"input": [
"2\n10 16\n7 17\n",
"3\n17 18\n15 24\n12 15\n",
"5\n90 108\n45 105\n75 40\n165 175\n33 30\n",
"3\n14 14\n2 7\n2 2\n",
"30\n3 3\n2 2\n4 4\n8 8\n16 16\n32 32\n64 64\n128 128\n256 256\n512 512\n1024 1024\n2048 2048\n4096 4096\n8192 8192\n16384 16384\n32768 32768\n65536 65536\n131072 1310... | 2CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.