input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#-*-coding:utf-8-*-
def main():
a, b, c = list(map(int, input().split()))
for i in range(10 ** 6):
if (a * i - c) % b == 0:
print('YES')
exit()
print('NO')
if __name__ == '__main__':
main() | #-*-coding:utf-8-*-
def main():
a, b, c = list(map(int, input().split()))
reminder = []
for i in range(a, b*a+1, a):
reminder.append(i % b)
if c in reminder:
print('YES')
else:
print('NO')
if __name__ == '__main__':
main() | p03730 |
A, B, C = list(map(int, input().split()))
for i in range(A, A * B + 1, A):
if i % A == 0 and i % B == C:
flg = True
break
else:
flg = False
print(("YES" if flg else "NO"))
| A, B, C = list(map(int, input().split()))
for i in range(A, A * B + 1, A):
if i % B == C:
flg = True
break
else:
flg = False
print(("YES" if flg else "NO"))
| p03730 |
a, b, c = list(map(int, input().split()))
for i in range(1, 100):
if a * i % b == c:
print("YES")
exit()
print("NO") | a, b, c = list(map(int, input().split()))
for i in range(1, 200):
if a*i % b == c:
print("YES")
exit()
print("NO") | p03730 |
a, b, c = list(map(int, input().split()))
for i in range(1, 200):
if a*i % b == c:
print("YES")
exit()
print("NO") | a, b, c = list(map(int, input().split()))
for i in range(1, b):
if a*i % b == c:
print("YES")
exit()
print("NO") | p03730 |
A, B, C = list(map(int,input().split()))
for i in range(1,A*B+1):
if(A*i%B == C):
print('YES')
break
else:
print('NO') | A, B, C = list(map(int,input().split()))
ans = "NO"
for i in range(A,A*B+1,A):
if(i%B == C):
ans = "YES"
break
print(ans) | p03730 |
a, b, c = list(map(int, input().split()))
r = 'NO'
for i in range(a, a*b+1, a):
if i % b == c:
r = 'YES'
break
print(r) | a, b, c = list(map(int, input().split()))
r = 'NO'
for i in range(1, 100):
if a*i % b == c:
r = 'YES'
break
print(r)
| p03730 |
a,b,c=list(map(int,input().split()))
i=0
l=[]
while True:
i+=1
m=(a*i-c)%b
if m==0:
print('YES')
exit()
if l.count(m):
print('NO')
exit()
else:
l.append(m) | # 入力
A,B,C=list(map(int,input().split()))
# 余りの出現回数を保存する配列
l=[0]*100
# Aに掛ける係数
t=1
while True:
# 余りを求める
x=t*A%B
# 余りがCと一致したら終了
if x==C:
print('YES')
exit()
# 余りが2回以上出現したら終了
elif l[x]>0:
print('NO')
exit()
# 余りの出現回数をインクリメント
else:
l[x]+=1
# Aに掛ける係数を+1する（次のAの倍数へ）
t+=1 | p03730 |
# Begin Header {{{
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement
# }}} End Header
# _________コーディングはここから！！___________
# ... 最小側の制約も確認した？
# ... オーバーフローしない？
a, b, c = list(map(int, input().split()))
i = 1
ok = False
while i<b+1:
if (a*i-c)%b != 0: i+=1
else:
ok = True
break
if ok: print("YES")
else: print("NO") | # Begin Header {{{
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement
# }}} End Header
# _________コーディングはここから！！___________
# ... 最小側の制約も確認した？
# ... オーバーフローしない？
a, b, c = list(map(int, input().split()))
i = 1
ok = False
while i<=b:
if (a*i-c)%b != 0: i+=1
else:
ok = True
break
if ok: print("YES")
else: print("NO") | p03730 |
# Begin Header {{{
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement
# }}} End Header
# _________コーディングはここから！！___________
# ... 最小側の制約も確認した？
# ... オーバーフローしない？
a, b, c = list(map(int, input().split()))
i = 1
while i<=b:
if (a*i-c)%b != 0: i+=1
else:
print("YES")
exit()
print("NO") | # Begin Header {{{
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement
# }}} End Header
# _________コーディングはここから！！___________
# ... 最小側の制約も確認した？
# ... オーバーフローしない？
a, b, c = list(map(int, input().split()))
for i in range(1, b+1):
if (a*i-c)%b: i+=1
else:
print("YES")
exit()
print("NO") | p03730 |
a, b, c = list(map(int, input().split()))
for i in range(1, b + 1):
if (a * i) % b == c:
ans = 'YES'
break
else:
ans = 'NO'
print(ans) | a, b, c = list(map(int, input().split()))
ans = 'NO'
for i in range(1, b + 1):
if (a * i) % b == c:
ans = 'YES'
print(ans) | p03730 |
def main():
input = sys.stdin.readline
try:
a, b, c = list(map(int, input().split()))
for i in range(a, 100000000, a):
if i % b == c:
print("YES")
break
else:
print("NO")
finally:
input = None
import sys; sys.setrecursionlimit(50000)
if __name__ == "__main__":
main()
| def main():
input = sys.stdin.readline
try:
a, b, c = list(map(int, input().split()))
for i in range(a, a * b, a):
if i % b == c:
print("YES")
break
else:
print("NO")
finally:
input = None
import sys; sys.setrecursionlimit(50000)
if __name__ == "__main__":
main()
| p03730 |
a, b, c = list(map(int, input().split()))
for i in range(10000):
if (a*i)%b == c:
print("YES")
exit()
print("NO") | a, b, c = list(map(int, input().split()))
for i in range(b):
if (a*i)%b == c:
print("YES")
exit()
print("NO") | p03730 |
import math
H, W = list(map(int, input().split(' ')))
if H == 1 or W == 1:
print((1))
exit()
res = math.ceil((H*W)/2)
print(res)
| import math
H, W = list(map(int, input().split(' ')))
if H == 1 or W == 1:
print((1))
else:
print((int((H*W+1)/2)))
| p02742 |
## coding: UTF-8
from decimal import *
s = input().split()
t = [int(p) for p in s]
#print(t)
if(t[0] == 1 or t[1] == 1):
answer = 1
elif( Decimal(Decimal(t[0]) % 2 )== 1 and Decimal(Decimal(t[1]) % 2) == 1):
n = Decimal( Decimal(Decimal(t[0]) - 1) // 2 )
#print(n)
m = Decimal( Decimal(Decimal(t[1]) - 1) // 2 )
answer = Decimal( Decimal( Decimal(Decimal(m) + 1) * Decimal(Decimal(n) + 1) ) + Decimal( Decimal(m) * Decimal(n) ) )
else:
answer = Decimal( Decimal(Decimal(t[0]) * Decimal(t[1])) // 2 )
print((int(answer)))
'''
H = t[0]
W = t[1]
ans = 0
if( W % 2 == 0):
for i in range(H):
ans += W / 2
else:
for i in range(H):
if(i % 2 == 0):
ans += W / 2.0 + 0.5
else:
ans += W / 2.0 - 0.5
print(int(ans))
'''
| H, W = list(map(int,input().split()))
if(H == 1 or W == 1):
ans = 1
else:
if(H*W%2 != 0):
ans = H*W//2 + 1
else:
ans = H*W//2
print(ans) | p02742 |
from math import ceil
h,w=list(map(int,input().split()))
ans=0
if h==1 or w==1:
ans=1
elif (h*w)%2==0:
ans=int(h*w//2)
else:
ans=ceil(h*w/2)
print(ans) | from math import ceil
h,w=list(map(int,input().split()))
ans=0
if h==1 or w==1:
ans=1
else:
ans=ceil(h*w/2)
print(ans) | p02742 |
h,w = [int(x) for x in input().split()]
if h == 1 or w == 1:
print((1))
elif h % 2 == 0 or w % 2 == 0:
print(((h*w)//2))
else:
print((((h*w)//2)+1)) | h,w = [int(x) for x in input().split()]
if h == 1 or w == 1:
print((1))
else:
print((((h*w)+1) // 2)) | p02742 |
import sys
import math
for line in sys.stdin:
a,b=list(map(int,line.split()))
if(a==1 or b==1):
print((1))
elif(a*b%2==0):
print((int(a*b/2)))
else:
count = 0
for i in range(a):
if(i%2==0):
count+=math.ceil(b/2)
else:
count+=math.floor(b/2)
print(count) | import sys
import math
for line in sys.stdin:
a,b=list(map(int,line.split()))
if(a==1 or b==1):
print((1))
elif(a*b%2==0):
print((int(a*b/2)))
else:
print((math.ceil(a*b/2))) | p02742 |
import math
h,w=list(map(int,input().split()))
if h==1 or w==1:
print((1))
else:
print((math.ceil(h/2)*math.ceil(w/2)+(h//2)*(w//2))) | h,w=list(map(int,input().split()))
if h==1 or w==1:
print((1))
exit()
print((((h+1)//2)*((w+1)//2)+(h//2)*(w//2))) | p02742 |
def main():
#from sys import stdin, setrecursionlimit
#setrecursionlimit(10**9)
#r = input()
#n = int(input())
#a, b = map(int, input().split())
#s, y = input().split()
#a = input().split()
#a = list(map(int, input().split()))
#a = [input().split() for i in range(n)]
#a = [int(input()) for i in range(n)]
#a = [list(map(int, input().split())) for i in range(n)]
#a = [int(s) - 1 for s in input().split()]
#l=[int(input()) for _ in range(int(input()))]
#res = 0
h,w=list(map(int,input().split()))
if h == 1 or w == 1:
print((1))
return 0
res = h*w//2
if (h*w)%2 != 0:
res += 1
print(res)
if __name__ == '__main__':
main()
| def main():
h,w = list(map(int,input().split()))
if h == 1 or w == 1:
print((1))
return 0
print(((h*w+1)//2))
if __name__ == '__main__':
main()
| p02742 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# input
h, w = list(map(int, input().split()))
# 縦か横がどちらかの値が1の場合、角はどこにも行けないので常に１
if h == 1 or w == 1:
print((1))
exit()
# 総マス数が偶数になる場合、半数が答え
total = h * w
if total % 2 == 0:
print((int(total / 2)))
exit()
# 問題は奇数の場合
# 高さが奇数の場合、奇数列はh//2+1 偶数列はh//2
if h % 2 != 0:
odd_column = (h//2 + 1) * (w//2 + 1)
even_column = (h//2) * (w//2)
res = odd_column + even_column
print((int(res)))
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
# input
h, w = list(map(int, input().split()))
# 縦か横がどちらかの値が1の場合、角はどこにも行けないので常に１
if h == 1 or w == 1:
print((1))
exit()
# 総マス数が偶数になる場合、半数が答え
total = h * w
if total % 2 == 0:
print((int(total / 2)))
exit()
# 問題は奇数の場合
# 高さが奇数の場合、奇数列はh//2+1 偶数列はh//2
odd_column = (h//2 + 1) * (w//2 + 1)
even_column = (h//2) * (w//2)
res = odd_column + even_column
print((int(res)))
| p02742 |
h, w = list(map(int, input().split()))
if h == 1 or w == 1:
print((1))
exit()
if h % 2 == 0 or w % 2 == 0:
print((h*w//2))
else:
if h <= w:
a = (w-1)*h//2
b = (h+1)//2
else:
a = (h-1)*w//2
b = (w+1)//2
print((a+b))
| h, w = list(map(int, input().split()))
if h == 1 or w == 1:
print((1))
exit()
if h % 2 == 0 or w % 2 == 0:
print((h*w//2))
else:
print(((w-1)*h//2+(h+1)//2))
| p02742 |
import math
h,w=list(map(int,input().split()))
print((math.ceil(h*w/2) if h!=1 and w!=1 else 1)) | h,w=list(map(int,input().split()))
print((int((h*w+1)/2) if min(h,w)!=1 else "1")) | p02742 |
H,W=list(map(int,input().split()))
if H==1 or W==1:
print((1))
exit()
if (H*W)%2==0:
print((H*W//2))
else:
print(((H*W+1)//2)) | H,W=list(map(int,input().split()))
if H==1 or W==1:
print((1))
exit()
print(((H*W+1)//2)) | p02742 |
def main():
H, W = list(map(int, input().split()))
if H == 1 or W == 1:
print((1))
exit()
ans = 0
ans += (W - (W // 2)) * (H - (H // 2))
ans += (W // 2) * (H // 2)
print(ans)
if __name__ == "__main__":
main() | def main():
H, W = list(map(int, input().split()))
if H == 1 or W == 1:
print((1))
exit()
ans = (H // 2) * (W // 2)
yoko = W // 2 if W % 2 == 0 else W // 2 + 1
tate = H // 2 if H % 2 == 0 else H // 2 + 1
ans += tate * yoko
print(ans)
if __name__ == "__main__":
main() | p02742 |
import math
tate,yoko = list(map(int,input().split()))
if tate == 1 or yoko == 1:
print((1))
else:
if yoko%2 == 0:
print((int((tate*yoko/2))))
else:
print((int((tate*(yoko-1)/2 + math.ceil(tate/2)))))
| import math
tate,yoko = list(map(int,input().split()))
if tate == 1 or yoko == 1:
print((1))
else:
print((int((tate*(yoko-1)/2 + math.ceil(tate/2)))))
| p02742 |
H, W = list(map(int, input().split()))
D = H * W
if H == 1 or W == 1:
print((1))
exit()
if D % 2:
print((D//2+1))
else:
print((D//2)) | H, W = list(map(int, input().split()))
if min(H, W) == 1:
print((1))
exit()
print(((H * W + 1) // 2))
| p02742 |
r = int(eval(input()))
print((r**2)) | r = int(eval(input()))
print((r*r)) | p02859 |
x = eval(input())
sum = int(x) * int(x)
print(sum) | x = eval(input())
y = 2
print((int(x) ** y)) | p02859 |
r=int(eval(input()))
print((r*r)) | print((int(eval(input()))**2)) | p02859 |
import math
x = int(eval(input()))
print(('{0}'.format(x**2))) | x = eval(input())
print(x*x) | p02859 |
print(((int(eval(input())))**2)) | print((int(eval(input()))**2)) | p02859 |
r = int(eval(input()))
print((r * r)) | print((int(eval(input()))**2)) | p02859 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
r=int(eval(input()))
print((r*r))
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
print((int(eval(input()))**2))
resolve() | p02859 |
r=int(eval(input()))
print((r**2))
| print((int(eval(input()))**2)) | p02859 |
r = int(eval(input()))
print((r**2)) | r = int(eval(input()))
S = r**2
print(S) | p02859 |
import math
line = int(eval(input()))
print((round((line * line * 3.14) / (1 * 1 * 3.14)))) | line = int(eval(input()))
print((round((line * line * 3.14) / (1 * 1 * 3.14)))) | p02859 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))
n = inp()
print((n**2)) | print((int(eval(input()))**2)) | p02859 |
r = int(eval(input()))
V = r * r
print(V) | r = int(eval(input()))
print((r*r)) | p02859 |
#!/usr/bin/env python3
import sys, math
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans=count=0
r=int(eval(input()))
print((r**2)) | r=int(eval(input()))
print((r**2)) | p02859 |
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
r = int(readline())
print((r ** 2))
if __name__ == '__main__':
solve()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
r = int(readline())
print((r * r))
if __name__ == '__main__':
solve()
| p02859 |
r = int(eval(input()))
print((int(r*r))) | r = int(eval(input()))
print((r**2)) | p02859 |
print(((int(eval(input())))**2)) | n=int(eval(input()))
print((int(n**2))) | p02859 |
import itertools
n=int(eval(input()))
a=list(map(int,input().split()))
l=list(range(1,n+1))
tmpList= (list([x,y] for x,y in (itertools.combinations(l, 2)) if x<y))
ans=0
for item in tmpList:
if a[item[0]-1]!=item[0] and a[item[1]-1]!=item[1] and a[item[1]-1]==item[0] and a[item[0]-1]==item[1]:
ans+=1
print (ans) | import itertools
n=int(eval(input()))
a=list(map(int,input().split()))
l=list(range(1,n+1))
ans=(list([a[x-1],a[y-1]] for x,y in (itertools.combinations(l, 2)) if x<y and a[x-1]!=x and a[y-1]!=y and a[x-1]==y and a[y-1]==x))
print((len(ans))) | p03993 |
import itertools
n=int(eval(input()))
a=list(map(int,input().split()))
l=list(range(1,n+1))
ans=(list([a[x-1],a[y-1]] for x,y in (itertools.combinations(l, 2)) if x<y and a[x-1]!=x and a[y-1]!=y and a[x-1]==y and a[y-1]==x))
print((len(ans))) | n=int(eval(input()))
a=list(map(int,input().split()))
a = [None] + a
cnt = 0
for i in range(1, n):
j = a[i]
if j > i and a[j] == i:
cnt += 1
print(cnt) | p03993 |
# code-festival-2016-qualaB - 仲良しうさぎ / Friendly Rabbits
def main():
N = int(eval(input()))
A = tuple(map(int, input().split()))
ans, cand = 0, set()
for i, j in enumerate(A, 1):
i, j = min(i, j), max(i, j)
if (i, j) in cand:
ans += 1
else:
cand |= {(i, j)}
print(ans)
if __name__ == "__main__":
main() | # code-festival-2016-qualaB - 仲良しうさぎ / Friendly Rabbits
# exhaustive search
def main():
N = int(eval(input()))
A = [0] + list(map(int, input().split()))
ans = sum(i == A[j] for i, j in enumerate(A[1:], 1)) // 2
print(ans)
if __name__ == "__main__":
main() | p03993 |
n = int(eval(input()))
li = list(map(int,input().split()))
count = 0
a_li = []
b_li = []
for i,l in enumerate(li):
a_li.append([i+1,l])
b_li.append([l,i+1])
for a in a_li:
if a in b_li:
count += 1
print((count//2)) | n = int(eval(input()))
li = list(map(int,input().split()))
count = 0
#print(li)
for i,l in enumerate(li):
#print(i,l-1,li[l-1])
if li[l-1] == i+1:
count+= 1
print((count//2)) | p03993 |
n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
for i in range(len(a)):
for j in range(i+1,len(a)):
if a[i]==j+1 and a[j]==i+1:
cnt+=1
print(cnt) | n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
for i in range(len(a)):
if a[a[i]-1]==i+1:
cnt+=1
print((cnt//2)) | p03993 |
n=int(eval(input()))
arr=list(map(int,input().split()))
ans=0
for i in range(n):
if arr[arr[i]-1]==i+1:
ans+=1
print((ans//2)) | n=int(eval(input()))
arr=list(map(int,input().split()))
ans=0
for i in range(n):
if arr[arr[i]-1]==(i+1):
ans+=1
print((ans//2)) | p03993 |
n = int(eval(input()))
a = list(map(int, input().split()))
d = {}
ans = 0
for i in range(n):
if a[i] in d and d[a[i]] == i+1: ans += 1
else: d[i+1] = a[i]
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
d = {}
ans = 0
for num,i in enumerate(a,1):
if i not in d: d[num] = i
else:
if d[i] == num: ans += 1
print(ans) | p03993 |
size = int(eval(input()))
r_str = input().split()
rabs = []
for r in r_str:
rabs.append(int(r) - 1)
visited = []
t = 0
for i in range(0, size):
if rabs[rabs[i]] == i and (i not in visited):
visited.append(i)
visited.append(rabs[i])
t += 1
print(t)
| size = int(eval(input()))
r_str = input().split()
rabs = []
for r in r_str:
rabs.append(int(r) - 1)
#visited = []
t = 0
for i in range(0, size):
if rabs[rabs[i]] == i and (not rabs[i] < i):
#visited.append(i)
#visited.append(rabs[i])
t += 1
print(t)
| p03993 |
p = int(eval(input()))
A = list(map(int,input().split()))
co = 0
cont = 0
for i in A:
cont += 1
if A.count(cont) != 0 and i == A.index(cont)+1:
A.pop(A.index(cont))
co += 1
print(co) | p = int(eval(input()))
ans = 0
*A,= list(map(int,input().split()))
for j,i in enumerate(A):
if A[A[j]-1]==j+1:
ans+=1
print((ans//2)) | p03993 |
n, *a_l= list(map(int, open(0).read().split()))
lovedBy = [[] for _ in range(n)]
for i, a in enumerate(a_l):
lovedBy[a-1].append(i)
cnt = 0
for i, a in enumerate(a_l):
if a-1 in lovedBy[i]:
cnt += 1
print((cnt//2)) | n, *a_l= list(map(int, open(0).read().split()))
cnt = 0
for i, a in enumerate(a_l):
if a_l[a-1] == i+1:
cnt += 1
print((cnt//2)) | p03993 |
N = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(N):
if a[a[i] - 1] < 0: continue
if a[a[i] - 1] == i + 1:
ans += 1
a[a[i] - 1] = 0
print(ans) | N = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(N):
if a[i] != "": n = a[i] - 1
if a[n] == i + 1:
ans += 1
a[n] = ""
print(ans) | p03993 |
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i in range(n):
if a[a[i]-1] == i+1:
cnt += 1
a[i] = ""
print(cnt) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if a[a[i]-1] == i+1:
ans += 1
a[a[i]-1] = 0
print(ans) | p03993 |
def likes(i,j,ai,aj):
if(i == aj and j == ai):
return True
else:
return False
n = int(eval(input()))
a = list(map(int,input().split()))
count = 0
for i in range(n-1):
for j in range(i+1,n):
if(likes(i+1,j+1,a[i],a[j])):
count += 1
print(count) | n = int(eval(input()))
a = list(map(int,input().split()))
count = 0
for i in range(n):
if(a[a[i]-1] == i+1):
count += 1
print((int(count/2))) | p03993 |
n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
for i in range(n):
for j in range(i+1,n):
if a[a[i]-1]==i+1:
cnt+=1
a[i]=0
break
print(cnt) | n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
for i in range(n):
if a[a[i]-1]==i+1:
cnt+=1
a[i]=0
continue
print(cnt) | p03993 |
# CODE FESTIVAL 2016 予選 A: B – 仲良しうさぎ / Friendly Rabbits
N = int(eval(input())) - 1
a = [int(s) - 1 for s in input().split()]
friends = []
for i in range(N):
if a[a[i]] == i and ([i, a[i]] not in friends and [a[i], i] not in friends):
friends.append([i, a[i]])
print((len(friends))) | # CODE FESTIVAL 2016 予選 A: B – 仲良しうさぎ / Friendly Rabbits
N = int(eval(input())) - 1
a = [int(s) - 1 for s in input().split()]
pairs = 0
for i in range(N):
if a[i] != 0 and a[a[i]] == i:
pairs += 1
a[i] = 0
a[a[i]] = 0
print(pairs) | p03993 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(N-1):
for j in range(i+1, N):
if i + 1 == A[j] and j + 1 == A[i]:
ans += 1
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(N):
if i + 1 == A[A[i]-1]:
ans += 1
print((ans // 2)) | p03993 |
count = 0
N = int(eval(input()))
A = list(map(int, input().split()))
B =[x for x in range(1,N+1)]
C = list(zip(A, B))
D = [sorted(x) for x in C]
for i in range(N):
if D.count(D[i]) == 2:
count += 1
print((int(count/2))) | N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
for i in range(N):
if A[A[i]-1] == i + 1:
count += 1
print((int(count / 2))) | p03993 |
def main():
N = int(eval(input()))
A = [int(i)-1 for i in input().split()]
edge = [set() for _ in range(N)]
for i, a in enumerate(A):
edge[i].add(a)
ans = 0
for i, a in enumerate(A):
if i in edge[a]:
ans += 1
print((ans//2))
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = [int(i)-1 for i in input().split()]
ans = 0
for i, a in enumerate(A):
if A[a] == i:
ans += 1
print((ans//2))
if __name__ == '__main__':
main()
| p03993 |
# codefestival_2016_qualA_b.py
N = int(eval(input()))
A = list(map(int,input().split()))
cnt = 0
for i,v in enumerate(A):
if A[v-1] == i+1:
cnt += 1
print((cnt//2)) | # codefestival_2016_qualA_b_bacha.py
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
for i,v in enumerate(A):
# print(i ,v, A[v-1])
if i+1 == A[v-1]:
ans += 1
print((ans//2)) | p03993 |
from itertools import*
n, *a = list(map(int, open(0).read().split()))
print((sum(a[i] == j + 1 and a[j] == i + 1 for i, j in combinations(list(range(n)), 2)))) | n, *a = list(map(int, open(0).read().split()))
print((sum(a[b - 1] == e + 1 for e, b in enumerate(a)) // 2)) | p03993 |
n = int(eval(input()))
a = list(map(int,input().split()))
pair = 0
for i in range(0,n-1):
for j in range(i+1,n):
if a[i]==j+1 and a[j]==i+1:
pair += 1
print(pair) | n = int(eval(input()))
a = list(map(int,input().split()))
pair = 0
for i in range(0,n):
if a[a[i]-1]==i+1:
pair+=1
print((pair//2))
| p03993 |
from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
a = {i+1: v for i, v in enumerate(a)}
cnt = 0
for k, v in list(a.items()):
if k == a[v]:
cnt += 1
print((cnt//2))
| n = int(eval(input()))
a = list(map(int, input().split()))
a = {i+1: v for i, v in enumerate(a)}
cnt = 0
for k, v in list(a.items()):
if k == a[v]:
cnt += 1
print((cnt//2)) | p03993 |
n = int(eval(input()))
A = tuple([int(x)-1 for x in input().split()])
paired = [0] * n
c = 0
for i in range(n-1):
if paired[i]:
continue
for j in range(i+1, n):
if A[i] == j and A[j] == i:
paired[j] = 1
paired[i] = 1
c += 1
break
print(c)
| n = int(eval(input()))
A = tuple([int(x)-1 for x in input().split()])
paired = [0] * n
c = 0
for i in range(n-1):
if paired[i]:
continue
if A[A[i]] == i:
c += 1
paired[A[i]] = 1
print(c)
| p03993 |
N=int(eval(input()))
*A,=list(map(int,input().split()))
i=0
ans=0
while i<N:
if i+1 in A:
if A[i]==A.index(i+1)+1:
ans+=1
i+=1
print((ans//2)) | N=int(eval(input()))
*A,=list(map(int,input().split()))
i=0
ans=0
while i<N:
if i+1==A[A[i]-1]:
ans+=1
i+=1
print((ans//2)) | p03993 |
N = int(eval(input()))
s = list(map(int ,input().split()))
con = 0
for i in range(N):
for j in range(i + 1 , N):
if s[i] == j + 1 and s[j] == i + 1:
con += 1
print(con) | N = int(eval(input()))
s = list(map(int ,input().split()))
con = 0
for i in range(N):
if s[s[i] - 1] == i + 1:
con += 1
print((con // 2)) | p03993 |
N=int(eval(input()))
a=list(map(int,input().split()))
b=0
for i in range(N):
for j in range(i+1,N):
if a[i]==j+1 and a[j]==i+1:
b+=1
print(b) | N=int(eval(input()))
a=list(map(int,input().split()))
b=0
for i in range(N):
if i+1==a[a[i]-1]:
b+=1
print((b//2)) | p03993 |
if __name__ == "__main__":
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if a[a[i]-1] == i+1:
ans += 1
print((ans // 2))
| if __name__ == "__main__":
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if a[a[i]-1] - 1 == i:
ans += 1
print((ans//2))
| p03993 |
n = int(eval(input()))
a = list(map(int, input().split()))
list1 = []
for i in range(n) :
list1.append({a[i],i+1})
length1 = len(list1)
list2 = []
for num in list1 :
if not num in list2 :
list2.append(num)
length2 = len(list2)
print((length1-length2))
| n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(n) :
if a[a[i]-1] == i + 1 :
ans += 1
print((ans//2))
| p03993 |
N=int(eval(input()))
A=list(map(int,input().split()))
cnt=0
for idx,i in enumerate(A):
a_idx=1+idx
if idx==A[i-1]-1:
cnt+=1
print((cnt//2))
| N=int(eval(input()))
A=list(map(int,input().split()))
cnt=0
for idx,i in enumerate(A):
if idx==A[i-1]-1:
cnt+=1
print((cnt//2))
| p03993 |
n = int(eval(input()))
a = list(map(int,input().split()))
c = 0
for i in range(n-1):
for j in range(i+1,n):
if (a[i] == j+1) and (a[j] == i+1):
c += 1
print(c) | n = int(eval(input()))
a = list(map(int,input().split()))
c = 0
for i in range(n):
if a[a[i]-1] == i+1:
c += 1
print((c//2)) | p03993 |
N = int(eval(input()))
A = [int(x) for x in input().split()]
like = []
cnt = 0
for i in range(N):
s = set([A[i], i+1])
if s in like:
cnt+=1
else:
like.append(s)
print(cnt)
| N = int(eval(input()))
A = [int(x) for x in input().split()]
like = []
cnt = 0
for i in range(N):
if A[A[i]-1] == i+1:
cnt+=1
print((cnt//2))
| p03993 |
n = int(eval(input()))
l = input().split(' ')
t_l =[]
for i in range(0,n):
t = i + int(l[i])
t_l.append(t)
a = 0
for i in range(n *2 -1):
if t_l.count(i) == 2:
a += 1
print(a) | n = int(eval(input()))
a = input().split(' ')
t = 0
for o in range(n):
i = o + 1
b = int(a[o]) - i
if i == int(a[o + b]):
t += 1
print((int(t / 2))) | p03993 |
n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
for i in range(n):
for j in range(i+1,n):
if a[i]==j+1 and a[j]==i+1:
cnt+=1
break
else:
cnt=cnt
print(cnt) | n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
for i in range(n):
if a[a[i]-1]==i+1:
cnt+=1
else:
cnt=cnt
print((cnt//2))
| p03993 |
N = int(eval(input()))
A = list(map(int,input().split()))
c = 0
for i in range(N):
for j in range(N):
if i < j:
if A[i] == j+1 and A[j] == i+1:
c += 1
print(c)
| N = int(eval(input()))
A = list(map(int,input().split()))
c = 0
for i in range(N):
if A[A[i]-1] == i+1:
c += 1
print((int(c//2)))
| p03993 |
n = int(eval(input()))
a_list = list(map(int, input().split()))
cnt = 0
index_list = list(range(0,n,1))
for i in (index_list):
if a_list[a_list[i]-1] == i+1:
cnt += 1
print((cnt//2)) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i in range(n):
if a[a[i]-1] == i + 1:
cnt += 1
print((cnt//2)) | p03993 |
n = int(eval(input()))
l = [0] + list(map(int, input().split()))
cnt = 0
for i in range(1, n+1):
if l[l[i]] == i:
cnt += 1
print((cnt//2)) | n = int(eval(input()))
a = [1] + list(map(int, input().split()))
cnt = 0
for i in range(1,n+1):
if a[a[i]] == i:
cnt += 1
print((cnt//2)) | p03993 |
N=int(eval(input()))
a=[int(i)-1 for i in input().split()]
K=0
for i in range(N):
if a[a[i]]==i:
K+=1
print((K//2))
| N=int(eval(input()))
a=[int(i)-1 for i in input().split()]
ans=0
for i in range(N):
if a[a[i]]==i:
ans+=1
print((ans//2))
| p03993 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N=INT()
A=LIST()
like=[set() for i in range(N)]
cnt=0
for i in range(N):
if i+1<A[i]:
like[A[i]-1].add(i+1)
else:
if A[i] in like[i]:
cnt+=1
print(cnt)
| # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N=INT()
A=LIST()
cnt=0
for i in range(N):
if A[A[i]-1]==i+1:
cnt+=1
print((cnt//2))
| p03993 |
number = int(eval(input()))
a = list(map(int,input().split()))
count = 0
for i in range(number):
for j in range(i,number):
if a[i] ==j+1 and a[j] == i+1:
count += 1
print((int(count))) | number = int(eval(input()))
a = list(map(int,input().split()))
count = 0
for i in range(number):
j = a[i]-1
if a[j] == i + 1:
count += 1
print((int(count/2))) | p03993 |
n=int(eval(input()))
a=list(map(int,input().split()))
c=0
for i in range(n):
if i+1==a[a[i]-1]:
c+=1
a[i]=n+2
print(c) | n=int(eval(input()))
a=list(map(int,input().split()))
c=0
for i in range(n):
if i+1==a[a[i]-1]:
c+=1
a[i]=0
print(c) | p03993 |
s=0;n=int(eval(input()));*a,=list(map(int,input().split()))
for i in range(~-n):s+=(-~i<a[i])*(a[~-a[i]]==-~i)
print(s) | n=int(eval(input()));*a,=list(map(int,input().split()))
print((sum([a[~-a[i]]==-~i for i in range(n)])>>1)) | p03993 |
n = int(eval(input()))
a = [0] + list(map(int, input().split()))
G = [[] for _ in range(n + 1)]
for i in range(1, n + 1):
G[a[i]].append(i)
cnt = 0
for i in range(1, n + 1):
if a[i] in G[i] and i in G[a[i]]:
cnt += 1
print((cnt // 2)) | n = int(eval(input()))
a = [0] + list(map(int, input().split()))
cnt = 0
for i in range(1, n + 1):
if a[a[i]] == i:
cnt += 1
print((cnt // 2)) | p03993 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(n):
a[i] -= 1
for i in range(n):
for j in range(i+1, n):
if a[i] == j and a[j] == i:
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(n):
a[i] -= 1
for i in range(n):
if a[a[i]] == i:
ans += 1
print((ans//2)) | p03993 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(N):
if i + 1 == A[A[i] - 1]:
ans += 1
print((ans // 2))
| N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(N):
if A[A[i] - 1] == i + 1:
ans += 1
ans //= 2
print(ans)
| p03993 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
pair = []
cp = [None]
for i, tgt in enumerate(a):
cp.clear()
if a.index(tgt) == i:
cp = [str(a[i]), str(i + 1)]
cp.sort()
cpj = "".join(cp)
pair.append(cpj)
pcnt = Counter(pair)
pcv = list(pcnt.values())
print((pcv.count(2)))
| n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i, tgt in enumerate(a, 1):
if a[tgt - 1] == i:
cnt += 1
print((cnt // 2)) | p03993 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
ai = []
for i, j in enumerate(a):
ai.append([i+1,j])
ai[i].sort()
c = 0
for i in range(len(ai)):
c += ai.count(ai[i])
print((c // 4)) | n = int(eval(input()))
a = [int(i) for i in input().split()]
ai = []
for i, j in enumerate(a):
ai.append([i+1,j])
ai[i].sort()
print((len(ai) - len(list(map(list,set(map(tuple, ai)))))))
| p03993 |
def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = [i - 1 for i in list(map(int, input().rstrip('\n').split()))]
cnt = 0
for i in range(len(a)):
if i == a[a[i]]:
cnt += 1
print((cnt // 2))
if __name__ == '__main__':
slove()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
a = list(map(int, readline().split()))
cnt = 0
for i in range(n):
if i + 1 == a[a[i]-1]:
cnt += 1
print((cnt // 2))
if __name__ == '__main__':
solve()
| p03993 |
N = int(eval(input()))
A = [int(a) - 1 for a in input().split()]
liked = [set() for _ in range(N)]
for i in range(N):
liked[A[i]].add(i)
count = 0
for i in range(N):
if A[i] in liked[i]:
count += 1
print((count // 2)) | N = int(eval(input()))
A = [int(a) - 1 for a in input().split()]
count = 0
for i in range(N):
if i == A[A[i]]:
count += 1
print((count // 2))
| p03993 |
n = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for itr, val in enumerate(A):
if A[val - 1] == itr + 1:
cnt += 1
print((cnt // 2)) | # B - 仲良しうさぎ
# https://atcoder.jp/contests/code-festival-2016-quala/tasks/codefestival_2016_qualA_b
n = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for itr, a in enumerate(A):
if a - 1 > itr and A[a - 1] == itr + 1:
ans += 1
print(ans)
| p03993 |
n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
for i in range(n):
if a[a[i]-1]-1==i :
cnt+=1
print((cnt//2)) | n=int(eval(input()))
a=list(map(int,input().split()))
cnt=[i for i in range(n) if a[a[i]-1]-1==i]
print((len(cnt)//2)) | p03993 |
n = int(eval(input()))
a = list(map(int,input().split()))
res = 0
for i in range(n-1):
for j in range(i+1,n):
if a[i]==j+1 and a[j]==i+1:
res += 1
print(res) | n = int(eval(input()))
a = list(map(int,input().split()))
res = 0
for i in range(n):
if a[i]>i+1 and a[a[i]-1]==i+1:
res += 1
print(res)
| p03993 |
N = int(eval(input()))
A = [0] + list(map(int, input().split()))
ans2 = 0
for i in range(N+1):
if A[A[i]] == i: ans2 += 1
print((ans2//2)) | N=int(eval(input()))
*A,=list(map(int, input().split()))
B=[0]*N
for i,a in enumerate(A):
if A[a-1] == i+1: B[i] = 1
print((sum(B)//2)) | p03993 |
N=int(eval(input()))
*A,=list(map(int, input().split()))
A=[-1]+A
ans=0
for i in range(1,N+1):
for j in range(i+1,N+1):
if A[i]==j and A[j]==i: ans+=1
print(ans) | N=int(eval(input()))
*A,=list(map(int, input().split()))
A=[-1]+A
ans=0
for i in range(1,N+1):
j=A[i]
if j>i and A[j]==i: ans+=1
print(ans) | p03993 |
N = int(eval(input()))
A = list(map(int, input().split()))
li = [None]*N
ans = 0
for i, a in enumerate(A):
if [a, i+1] in li:
ans += 1
li[i] = [i+1, a]
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(N):
if (i+1)==A[A[i]-1]:
ans += 1
print((ans//2)) | p03993 |
N = int(eval(input()))
A = [int(x) - 1 for x in input().split()]
cnt = 0
for i in range(N):
if A[A[i]] == i:
cnt += 1
print((cnt//2)) | n = int(eval(input()))
a = [int(x)-1 for x in input().split()]
b = []
c = []
for i in range(n):
b.append((i, a[i]))
c.append((a[i], i))
c = set(c)
b = set(b)
ans = len(b & c)
print((ans//2))
| p03993 |
n = int(eval(input()))
a = list(map(int, input().split()))
st = set()
cnt = 0
for i, e in enumerate(a, 1):
pair = min(i, e), max(i, e)
if pair in st:
cnt += 1
else:
st.add(pair)
print(cnt)
| n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i, e in enumerate(a, 1):
if a[e-1] == i:
cnt += 1
cnt //= 2
print(cnt)
| p03993 |
n=int(eval(input()))
a = list(map(int,input().split()))
check=[]
ans=0
for i in range(n):
if [min(i+1,a[i]),max(i+1,a[i])] not in check:
check.append([min(i+1,a[i]),max(i+1,a[i])])
else:
ans+=1
print(ans)
| n=int(eval(input()))
a=list(map(int,input().split()))
pair=[]
for i in range(n):
if i+1 > a[i]:
w=i+1
i=a[i]
else:
w=a[i]
i+=1
pair.append([i,w])
pair.sort()
ans=0
for i in range(len(pair)-1):
if pair[i]==pair[i+1]:
ans+=1
print(ans) | p03993 |
N = int(eval(input()))
A = list(map(int, input().split()))
answer = 0
for i in range(N - 1):
for j in range(i + 1, N):
if A[i] == j + 1 and A[j] == i + 1:
answer += 1
print(answer) | N = int(eval(input()))
a = list(map(int, input().split()))
answer = 0
for i in range(N):
if a[a[i] - 1] - 1 == i:
answer += 1
print((answer // 2)) | p03993 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.