Created
July 16, 2022 01:19
-
-
Save modos/20eb991870fccaa4c66eae1812efcf53 to your computer and use it in GitHub Desktop.
آدرس یابی
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import re | |
n=int(input()) | |
url={} | |
for i in range(n): | |
s=input() | |
for j in range(len(s)): | |
if s[j]==' ': | |
url[s[:j]]=s[j+1:] | |
break | |
t=int(input()) | |
for i in range(t): | |
s=input() | |
for j in range(len(s)): | |
if s[j]==' ': | |
if s[:j] not in url: | |
print("[Error] url not found") | |
break | |
else: | |
ss=url[s[:j]] | |
l,r=j+1,j+1 | |
while r<len(s): | |
while s[r]!='=': | |
r+=1 | |
a=s[l:r] | |
l=r+1 | |
while r<len(s): | |
if s[r]==' ': | |
break | |
elif r==len(s)-1: | |
r+=1 | |
break | |
r+=1 | |
b=s[l:r] | |
#print(a,b) | |
flag=0 | |
for k in range(len(ss)): | |
if flag: | |
break | |
if ss[k]=='<': | |
for l in range(k,len(ss)): | |
if ss[l]=='>': | |
if a==ss[k+1:l]: | |
ss=ss[:k]+b+ss[l+1:] | |
flag=1 | |
break | |
break | |
l=r+1 | |
r+=1 | |
flag2=0 | |
for m in range(len(ss)): | |
if ss[m]=='<': | |
print("[Error] missing parameter(s)") | |
#print(ss) | |
flag2=1 | |
break | |
if not flag2: | |
print(ss) | |
break | |
elif j==len(s)-1: | |
if s not in url: | |
print("[Error] url not found") | |
else: | |
flag=0 | |
for k in range(len(url[s])): | |
if url[s][k]=='<': | |
print("[Error] missing parameter(s)") | |
flag=1 | |
break | |
if not flag: | |
print(url[s]) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment