output_description stringlengths 15 956 | submission_id stringlengths 10 10 | status stringclasses 3 values | problem_id stringlengths 6 6 | input_description stringlengths 9 2.55k | attempt stringlengths 1 13.7k | problem_description stringlengths 7 5.24k | samples stringlengths 2 2.72k |
|---|---|---|---|---|---|---|---|
Print the string after the conversion.
* * * | s040379467 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | S=str(input())
print(S[0:5]+' '+S[6:13]+' 'S[14:19]) | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s523776711 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | print(*input().replace(",", " ").split())
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s273276414 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | c = input()
print(c.replace(",", " "))
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s858929024 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | a, s, d = input().split(",")
print(a, s, d)
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s542868148 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s = str(input())
print(s.replace(',',' ') | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s379907950 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s = input()
print(s.replace(',', ' ') | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s622716089 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s = input()
print(s.replace(","," ") | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s242178127 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | a,b,c = input()split(',')
print(a,b,c) | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s189715906 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | a,b,c=input()split(",")
print(a,b,c) | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s517390147 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | a = input()
print(a.replace(',' , ' ') | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s594859428 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s = input()
s.replace(','. ' ')
print(s) | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s588262744 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | Sentence = input()
Sentence = Sentence.split(",")
Sentence = " ".join(Sentence)
print(Sentence)
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s895023080 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | s = str(input())
ans = s.split(",")
for i in range(len(ans)):
if i < len(ans) - 1:
print(ans[i], end=" ")
else:
print(ans[i])
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s194825438 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | first, middle, last = input().split(",")
print(first, middle, last)
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s276175880 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | s = list(input())
if len(s) == 19 and s[5] == s[13] == ",":
s[5] = " "
s[13] = " "
print("".join(s))
else:
print("hoge!")
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s647908422 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | input_ = inpur().split(",")
print(" ".join(str for i in input))
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s398796147 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s=str(input("enter a statment))
z=s.replace(","," ")
print(z) | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s067940610 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=200010;
const ll mod=1e9+7;
int main(){
string s;
cin >> s;
cout << s.substr(0,5) << " " << s.substr(6,7) << " " << s.substr(14,5) << endl;
return 0;
} | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s069315598 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | import sys
input = sys.stdin.readline
s = input().split(,)
print(*s) | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s058208399 | Wrong Answer | p03834 | The input is given from Standard Input in the following format:
s | s1, s2, s3 = list(map(str, input().split(",")))
print(s1 + "" + s2 + "" + s3)
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s400519945 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s = Input()
r1 = s[0:4]
r2 = s[6:12]
r3 = s[14:]
print("{} {} {}".format(r1, r2, r3))
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s347964569 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s=input()
print(s.replace(',',' ') | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s707837305 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | print(*input.split(",") | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s220061231 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | print(" ".join(input().split(,))) | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s452471135 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | print(*input().split(,))
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s251358804 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s = input()
prin(s.replace(","," ") | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s069439518 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | print(input().replace(',',' ') | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s191556990 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s = input()
print(s.split(',') | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s225478674 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | print(str(input().split(",", " ")))
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s450527686 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | a,b,c=input().split(,)
print(a,b,c) | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s331298092 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | print(input().replace(',','') | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s230001128 | Wrong Answer | p03834 | The input is given from Standard Input in the following format:
s | print(*input(), sep=",")
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s426101323 | Wrong Answer | p03834 | The input is given from Standard Input in the following format:
s | print("".join(input().split(",")))
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s784249841 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | print(" ".join(input().split(",")) | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s178528984 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | f, s, ff = map(str, input().split(","))
print(f, s, ff)
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s070605583 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | s, t, u = map(str, input().split(","))
print(s + " " + t + " " + u)
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s916904469 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | S = list(input().split())
print(S[0] + " " + S[1] + " " + S[2])
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s222157929 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | line = input().split(" ")
print(line[0], line[1], line[2])
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s462344304 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | a,b,c = input().split(,)
print(a,b,c) | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s765202962 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s = input()
print(S.replace(',',' ')） | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s519392417 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | a = input()
print(a.replace(',',' ') | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s944531650 | Wrong Answer | p03834 | The input is given from Standard Input in the following format:
s | print(*input().split(","), sep="")
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s822803680 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | s = input()
print(
s[0]
+ s[1]
+ s[2]
+ s[3]
+ s[4]
+ " "
+ s[6]
+ s[7]
+ s[8]
+ s[9]
+ s[10]
+ s[11]
+ s[12]
+ " "
+ s[14]
+ s[15]
+ s[16]
+ s[17]
+ s[18]
)
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s480887413 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | x = input()
y = x.split(",")
print(y[0] + " " + y[1] + " " + y[2])
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s721680923 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | l = input()
for i in range(0, 5):
print(l[i], end="")
print(" ", end="")
for j in range(6, 13):
print(l[j], end="")
print(" ", end="")
for k in range(14, 19):
print(l[k], end="")
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s307632841 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s = list(str(input()))
print(s[0]+s[1]+s[2]+s[3]+s[4])+" "+s[6]+s[7]+s[8]+s[9]+s[10]+s[11]+s[12]+" "+s[14]+s[15]+s[16]+s[17]+s[18])
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s171639088 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | h = list(map(str, input().split(,)))
ans = ' '.join(h)
print(ans) | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s257845154 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | l = input()
for i in range(0, 5) print(l[i], end="")
for i in range(6, 13) print(l[i], end="")
for i in range(14, 19) print(l[i], end="") | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s969508252 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | ks = input()
k, s = [int(x) for x in ks.split(" ")]
comb = []
for x in range(k + 1)[::-1]:
for y in range(min(x + 1, s - x))[::-1]:
z = s - x - y
if x <= k and y <= k and z <= k and y <= x and z <= x and y <= z:
comb.append([x, y, z])
count = 0
for c in comb:
l = len(set(c))
if l == 1:
count += 1
elif l == 2:
count += 3
else:
count += 6
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s843828389 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | N, M = map(int, input().split())
Islands = [[] for i in range(N)]
Edge = []
S = 0
for i in range(M):
a, b, c = map(int, input().split())
Islands[a - 1].append([b - 1, c])
Islands[b - 1].append([a - 1, c])
Edge.append([a - 1, b - 1, c])
for m in range(M):
a = Edge[m][0]
b = Edge[m][1]
c_m = Edge[m][2]
List = [[a, 0]]
for l in List:
c_base = l[-1]
c = c_base
if l[-2] == b:
if c_m > c:
S += 1
break
else:
for n in Islands[l[-2]]:
if n[0] in l[0:-1]:
pass
else:
c += n[1]
List.append(l[0:-1] + [n[0], c])
c = c_base
print(S - 1)
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s123661260 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s_x, s_y, t_x, t_y = map(int, input().split())
# 点のインプット
for i in range(t_x - s_x):
print("R", end="")
for i in range(t_y - s_y):
print("U", end="")
for i in range(t_x - s_x):
print("L", end="")
for i in range(t_y - s_y):
print("D", end="")
t_x = t_x + 1
t_y = t_y + 1
s_x = s_x
s_y = s_y
print("D", end="")
for i in range(t_x - s_x):
print("R", end="")
for i in range(t_y - s_y):
print("U", end="")
print("LU", end="")
for i in range(t_x - s_x):
print("L", end="")
for i in range(t_y - s_y):
print("D", end="")
print("R", end="")
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s958959709 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | a, b = map(int, input().split())
print(sum(a >= b - s - t >= 0 for t in range(a + 1) for s in range(a + 1)))
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s840455491 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | s = str(input())
s1 = str[:5]
s2 = str[6:13]
s3 = str[14:]
print("{} {} {}".format(s1, s2, s3))
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s229017240 | Accepted | p03834 | The input is given from Standard Input in the following format:
s | print(*(input().split(",")))
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s082664076 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | print(input().replace(","," ") | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s183467838 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | abcde, fghihgf, edcba
| Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
Print the string after the conversion.
* * * | s562388627 | Runtime Error | p03834 | The input is given from Standard Input in the following format:
s | print(input().replace(","." ")) | Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: `[five lowercase English
letters],[seven lowercase English letters],[five lowercase English letters]`.
Dolphin wants to convert the comma-separated string s into a space-separated
string.
Write a program to perform the conversion for him. | [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s728683805 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | import math
str = input()
num = int(str.split()[0])
x = int(str.split()[1])
y = int(str.split()[2])
# グループ分けしてそれぞれで一列に並べてみる
# ↓group3
# ○○○○...○
# ○○○...○ ○○○○...○
# ↑ group1 ↑group2
group_1 = x
group_3 = y - x - 1
group_2 = num - y + 1
for n in range(1, num):
branch = 0
# group_1 の枝
if group_1 > n:
branch += group_1 - n
# group_2 の枝
if group_2 > n:
branch += group_2 - n
# group_3 の枝
if group_3 > n:
branch += group_3 - n
# group_1,2 の枝
if group_1 >= n and group_2 >= n:
branch += n
elif group_1 + group_2 >= n + 1:
if n < max(group_1, group_2):
branch += min(group_1, group_2)
else:
branch += group_1 + group_2 - n
# group_1,3 の枝
if group_1 >= n and math.ceil(group_3 / 2) >= n:
branch += n
elif group_1 + math.ceil(group_3 / 2) >= n + 1:
if n < max(group_1, math.ceil(group_3 / 2)):
branch += min(group_1, math.ceil(group_3 / 2))
else:
branch += group_1 + math.ceil(group_3 / 2) - n
# group_2,3 の枝
if group_2 >= n and math.ceil(group_3 / 2) >= n:
branch += n
elif group_2 + math.ceil(group_3 / 2) >= n + 1:
if n < max(group_2, math.ceil(group_3 / 2)):
branch += min(group_2, math.ceil(group_3 / 2))
else:
branch += group_2 + math.ceil(group_3 / 2) - n
# group_1,3 の枝 2を経由
if group_1 >= n and math.floor(group_3 / 2) >= n - 1 and n >= 2:
branch += n - 1
elif (group_1 + math.floor(group_3 / 2) >= n) and n >= 2:
if n <= max(group_1, math.floor(group_3 / 2)):
branch += min(group_1, math.floor(group_3 / 2))
else:
branch += group_1 + math.floor(group_3 / 2) + 1 - n
# group_2,3 の枝 1を経由
if group_2 >= n and math.floor(group_3 / 2) >= n - 1 and n >= 2:
branch += n - 1
elif (group_2 + math.floor(group_3 / 2) >= n) and n >= 2:
if n <= max(group_2, math.floor(group_3 / 2)):
branch += min(group_2, math.floor(group_3 / 2))
else:
branch += group_2 + math.floor(group_3 / 2) + 1 - n
print(branch)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s791068852 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | N, X, Y = map(int, input().split())
p = X - 1
q = Y - X + 1
r = N - Y
n = p // 2
m = p % 2
for i in range(N - 1):
ans = 0
k = i + 1
if p > k:
ans = ans + p - k
if n >= k:
ans = ans + q
if r > k:
ans = ans + r - k
if n >= k and p > 0:
if k <= p:
ans = ans + (2 * k) - 1
else:
ans = ans + (2 * p)
elif p + n >= k and p > 0:
if m == 0:
if k <= p:
ans = ans + q
else:
ans = ans + 2 * (p + n - k + 1) - 1
if m == 1:
if k <= p:
ans = ans + q
else:
ans = ans + 2 * (p + n - k + 1)
if n >= k and r > 0:
if k <= r:
ans = ans + (2 * k) - 1
else:
ans = ans + (2 * r)
elif r + n >= k and r > 0:
if m == 0:
if k <= r:
ans = ans + q
else:
ans = ans + 2 * (r + n - k + 1) - 1
if m == 1:
if k <= r:
ans = ans + q
else:
ans = ans + 2 * (r + n - k + 1)
if p > 0 and r > 0 and n + 2 <= k:
t = p + n + r - k
ans = ans + min(p, r)
print(k, ans)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s469007698 | Accepted | p02726 | Input is given from Standard Input in the following format:
N X Y | n, x, y = input().split(" ")
n, x, y = int(n), int(x), int(y)
ans = [0] * (n - 1)
for i in range(n - 1):
for j in range(i + 1, n):
now = 0
if j <= x - 1:
ans[j - i - 1] += 1
elif j > x - 1 and j <= y - 1 and i <= x - 1:
now = now + x - 1 - i
if j - (x - 1) >= (y - 1) - j + 1:
now = now + (y - 1) - j + 1
else:
now = now + j - (x - 1)
ans[now - 1] += 1
elif j > x - 1 and j <= y - 1 and i > x - 1:
if j - i >= (i - (x - 1)) + ((y - 1) - j) + 1:
now = (i - (x - 1)) + ((y - 1) - j) + 1
else:
now = j - i
ans[now - 1] += 1
elif j > y - 1 and i <= x - 1:
now = now + x - 1 - i
now = now + j - (y - 1) + 1
ans[now - 1] += 1
elif j > y - 1 and i > x - 1 and i < y - 1:
if (y - 1) - i >= i - (x - 1) + 1:
now = now + i - (x - 1) + 1
else:
now = now + (y - 1) - i
now = now + j - (y - 1)
ans[now - 1] += 1
elif i >= y - 1:
ans[j - i - 1] += 1
print(*ans)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s968148774 | Accepted | p02726 | Input is given from Standard Input in the following format:
N X Y | N, X, Y = [int(e) for e in input().split(" ")]
a = X - 1
b = N - Y
c = Y - X + 1
for k in range(1, N):
# print('--k={}--'.format(k))
ans = 0
# A
if a < k:
pass
else:
ans += a - k + 1
# print('a')
# print(ans)
# B
if b < k:
pass
else:
ans += b - k + 1
# print('b')
# print(ans)
# c
if c / 2 < k:
pass
elif c % 2 == 0 and c // 2 == k:
ans += c // 2
else:
ans += c
# print('c')
# print(ans)
# ABC
if a != 0 and b != 0 and 3 <= k <= a + b + 1:
suba = (k - 3) - (a - 1) if (k - 3) - (a - 1) > 0 else 0
subb = (k - 3) - (b - 1) if (k - 3) - (b - 1) > 0 else 0
ans += k - 2 - suba - subb
# print('abc')
# print(ans)
# AC
if a != 0 and 2 <= k <= a + c // 2:
aa = a - 1
cc = c // 2
suba = (k - 2) - (aa) if (k - 2) - (aa) > 0 else 0
subc = (k - 1) - (cc) if (k - 1) - (cc) > 0 else 0
ans += (k - 1 - suba - subc) * 2
# print('suba={},subc={},{}'.format(suba,subc,k-c//2))
if c % 2 == 0 and 0 < k - c // 2:
ans -= 1
# print('ac')
# print(ans)
# print(suba)
# print(subc)
# BC
if b != 0 and 2 <= k <= b + c // 2:
bb = b - 1
cc = c // 2
subb = (k - 2) - (bb) if (k - 2) - (bb) > 0 else 0
subc = (k - 1) - (cc) if (k - 1) - (cc) > 0 else 0
ans += (k - 1 - subb - subc) * 2
if c % 2 == 0 and 0 < k - c // 2:
ans -= 1
# print('bc')
# print(ans)
print(ans)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s880651379 | Runtime Error | p02726 | Input is given from Standard Input in the following format:
N X Y | # import math
# import sys
# A, B = [int(i) for i in input().split()]
# for i in range(math.ceil(12.5 * A), math.ceil(12.5 * (A + 1))):
# if math.floor(i//10) == B:
# print(i)
# sys.exit()
# print(-1)
# x = int(input())
# s, a = divmod(x, 500)
# print(s*1000 + (a // 5)*5)
# k, n = [int(i) for i in input().split()]
# a = [int(i) for i in input().split()]
# maxx = 0
# key = 0
# for i in range(0, n):
# if i == n-1:
# key = (k + a[0]) - a[i]
# else:
# key = a[i+1] - a[i]
# if maxx < key:
# maxx = key
# print(k - maxx)
n, x, y = [int(i) for i in input().split()]
p = y - x + 1
a = x - 1
b = n - y
print(n)
ans2 = n - (y - x) + 1
if 2 < p / 2:
ans2 += p
elif 2 == 2 / p:
ans2 += 2
print(ans2)
for k in range(3, n):
ans = 0
main = 0
eda1 = 0
eda2 = 0
if p % 2 == 1:
if k <= p // 2:
main = n - (y - x) - k + 1
eda1 = min(a, (k - 1)) * 2
eda2 = min(b, (k - 1)) * 2
ans = p + main + eda1 + eda2
else:
main = n - (y - x) - k + 1
if k - (p // 2) > a:
eda1 = 0
else:
eda1 = min(a - (k - (p // 2)) + 1, k - (p // 2) + 1) * 2
if k - (p // 2) > b:
eda2 = 0
else:
eda2 = min(b - (k - (p // 2)) + 1, k - (p // 2) + 1) * 2
ans = main + eda1 + eda2 - 2
else:
if k < p // 2:
main = n - (y - x) - k + 1
eda1 = min(a, (k - 1)) * 2
eda2 = min(b, (k - 1)) * 2
ans = p + main + eda1 + eda2
elif k == p // 2:
main = n - (y - x) - k + 1
if k - (p // 2) > a:
eda1 = 0
else:
eda1 = min(a - (k - (p // 2)) + 1, k - (p // 2) + 1) * 2
if k - (p // 2) > b:
eda2 = 0
else:
eda2 = min(b - (k - (p // 2)) + 1, k - (p // 2) + 1) * 2
ans = p // 2 + main + eda1 + eda2 - 2
else:
main = n - (y - x) - k + 1
if k - (p // 2) > a:
eda1 = 0
else:
eda1 = min(a - (k - (p // 2)) + 1, k - (p // 2) + 1) * 2
if k - (p // 2) > b:
eda2 = 0
else:
eda2 = min(b - (k - (p // 2)) + 1, k - (p // 2) + 1) * 2
ans = main + eda1 + eda2 - 2
print(ans)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s944146062 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | nxy = list(map(int, input().split()))
n = nxy[0]
x = nxy[1]
y = nxy[2]
ans = [0] * n
ans[0] = n
g1 = x - 1
g3 = n - y
g2 = n - g1 - g3
for i in range(g1 - 1):
ans[i + 1] += g1 - (i + 1)
for i in range(g3 - 1):
ans[i + 1] += g3 - (i + 1)
g2s, g2v = divmod(g2, 2)
for i in range(g2s):
ans[i + 1] += g2
for i in range(g1):
for j in range(g3):
ans[i + j + 3] = 1
for i in range(g1):
ans[i + 1] += 1
if g2v == 1:
for j in range(g2s):
ans[i + j + 2] += 2
else:
for j in range(g2s - 1):
ans[i + j + 2] += 2
ans[i + g2s + 11] += 1
for i in range(g3):
ans[i + 1] += 1
if g2v == 1:
for j in range(g2s):
ans[i + j + 2] += 2
else:
for j in range(g2s - 1):
ans[i + j + 2] += 2
ans[i + g2s + 11] += 1
for i in range(1, n - 1):
print(ans[i])
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s928321457 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | def function(N):
if N % 2 == 0:
for i in range(N // 2 - 1):
A[i] = N
A[N // 2 - 1] = N // 2
else:
for i in range(N // 2):
A[i] = N
N, X, Y = map(int, input().split())
A = [0] * (N - 1)
if X == 1 and Y == N:
function(N)
for k in A:
print(k)
else:
function(Y - X + 1)
B = [2] * (N - 1)
B[0] = 1
for l in range(1, (Y - X + 1) // 2 + 1):
B[-l] = 0
if l == (Y - X + 1) // 2 and (Y - X + 1) % 2 == 0:
B[-l] = 1
# print(B)
for k in A:
print(k)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s772311621 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | N, X, Y = input().split()
N = int(N)
X = int(X)
Y = int(Y)
k = 0
if (3 <= N <= 2 * 10**5) and (1 <= X, Y <= N) and (X + 1 < Y):
for k in range(N - 1):
a = 0
if k <= Y - X:
a += N - X + 1 - k
a += Y - X + 1
else:
a += N - X + 1 - k
if k + 1 < X + (Y - X) / 2:
a += X + (Y - X) // 2 - k
if Y - k > X + (Y - X) / 2:
if (Y - X) % 2 == 0:
a += N - X - (Y - X) // 2 + 1 - k
if (Y - X) % 2 == 1:
a += N - X - (Y - X) // 2 - k
a = int(a)
print(a)
k += 1
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s897079989 | Runtime Error | p02726 | Input is given from Standard Input in the following format:
N X Y | num = input().split(" ")
num_data = [int(num[i]) for i in range(3)]
# N X Y
cost = [0 for i in range(num_data[0] - 1)] # start position has the lowest number
for i in range(num_data[0]):
for l in range(num_data[0] - 1):
result = min(
abs(i - l),
abs(i - num_data[1] - 1) + 1 + abs(l - num_data[2] - 1),
abs(i - num_data[2] - 1) + 1 + abs(l - num_data[1] - 1),
)
cost[num_data[0] - result] += 1
print(cost)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s180226875 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(map(int, input().split()))
n, x, y = mi()
dist = y - x
hh = x
th = n - y + 1
# print(hh,th,dist)
for k in range(1, n):
# hh
a = 0 if hh < k else hh - k
# th
b = 0 if th < k else th - k
# hh-c
c = min((k - 1) * 2, dist) - min(max(0, (k - hh) * 2), dist)
# th-c
d = min((k - 1) * 2, dist) - min(max(0, (k - th) * 2), dist)
# hh-th
if hh + th - 1 < k:
e = 0
elif k > 2:
e = min(k - 2, hh - 1, th - 1)
else:
e = 0
# c
if k > ((dist + 1) / 2):
f = 0
else:
f = dist + 1
# print(k,a,b,c,d,e,f)
print(a + b + c + d + e + f)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s842419144 | Runtime Error | p02726 | Input is given from Standard Input in the following format:
N X Y | x, y, a, b, c = map(int, input().split())
p = sorted(list(map(int, input().split())), reverse=True)[:x]
q = sorted(list(map(int, input().split())), reverse=True)[:y]
r = list(map(int, input().split()))
print(sum(sorted(p + q + r, reverse=True)[: x + y]))
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s160056979 | Runtime Error | p02726 | Input is given from Standard Input in the following format:
N X Y | K, N = map(int, input().split())
A = input()
B = A.split(" ")
B = [int(i) for i in B]
g = B[N - 1] - B[0]
print(g)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s154224433 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | aaa = [int(i) for i in input().split()]
print(aaa)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s614287971 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | N, X, Y = map(int, input().split())
print(N)
print(2 * N + X - Y - 4)
lists = [1, 1, 1, 1]
t = 0
for k in range(3, N - 1):
t = N + X - Y - k + 1
if k < Y - X:
t = t + (N - 1 - k)
if k < X - 1:
t = t - 1
if k < N - Y:
t = t - 1
print(t)
t = 0
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s381407746 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | import copy
N, X, Y = map(int, input().split())
def check(num, distance):
if num != 0:
distance[num - 1] = min(distance[num] + 1, distance[num - 1])
if num != N - 1:
distance[num + 1] = min(distance[num + 1], distance[num] + 1)
if num == X - 1:
distance[Y - 1] = min(distance[Y - 1], distance[X - 1] + 1)
elif num == Y - 1:
distance[X - 1] = min(distance[X - 1], distance[Y - 1] + 1)
total_answer = []
answer = [N] * N
for k in range(N):
temp = copy.copy(answer)
temp[k] = 0
# print(temp)
for _ in range(3):
for i in range(0, N):
check(i, temp)
# print(temp)
# print(temp)
for j in range(N - 1, -1, -1):
check(j, temp)
# print(temp)
# print('/n')
# print(total_answer)
import collections
dict = collections.Counter(total_answer)
# print(dict)
for i in range(1, N):
print(dict[i] // 2)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s510606064 | Accepted | p02726 | Input is given from Standard Input in the following format:
N X Y | # from sys import stdin
# # 解説のコード
# def get_result(data):
# N, X, Y = data
# dist_cnt = [0 for i in range(N)]
# for i in range(1, N+1):
# for j in range(i+1, N+1):
# min_dist = min([j-i, abs(X-i) + 1 + abs(Y-j), abs(Y-i) + 1 + abs(X-j)])
# dist_cnt[min_dist] += 1
# for i in range(1, N):
# print(dist_cnt[i])
# if __name__ == '__main__':
# data = list(map(int, stdin.readline().rstrip('\n').split(' ')))
# get_result(data)
from sys import stdin
from collections import deque
class BreadthFirstSearch:
def __init__(self, num_nodes):
self.n = num_nodes
self.graph = [[] for _ in range(self.n)]
# Edge数分回すことを想定
def add_edge(self, start, end, undirected=True):
self.graph[start].append(end)
if undirected:
self.graph[end].append(start)
# depth = distance
def search(self, start_node):
order = [-1] * self.n # a bfs ordering of each vertex
parent = [-1] * self.n # parent of each vertex in the bfs search tree
depth = [-1] * self.n # the depth of each vertex
q = deque([(start_node, -1, 0)]) # (vertex, parent, depth)
num = 0 # current ordering
while len(q) > 0:
v, p, d = q.popleft()
if order[v] < 0: # visited v for the first time
order[v] = num
parent[v] = p
depth[v] = d
num += 1
for u in self.graph[v]:
if order[u] >= 0:
continue
q.append((u, v, d + 1))
return order, parent, depth
# BFS pypyでAC
def get_result(data):
N, X, Y = data
_data = [[i, i + 1] for i in range(1, N)]
_data += [[X, Y]]
bfs = BreadthFirstSearch(N)
for val in _data:
bfs.add_edge(val[0] - 1, val[1] - 1)
dist_cnt = [0 for i in range(N)]
for i in range(N):
_, _, depth = bfs.search(i)
for j in range(i, N):
dist_cnt[depth[j]] += 1
for i in range(1, N):
print(dist_cnt[i])
if __name__ == "__main__":
data = list(map(int, stdin.readline().rstrip("\n").split(" ")))
get_result(data)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s076489132 | Runtime Error | p02726 | Input is given from Standard Input in the following format:
N X Y | N, X, Y = map(int, input().split())
X, Y = X - 1, Y - 1
ans = [0] * (N + 1)
def search(s):
global tmp, ans
tmp[s] = 0
Next = [s + 1]
Vec = [1]
if s == X:
Next.extend([Y, Y])
Vec.extend([1, -1])
elif X < s < Y:
Next.append(s - 1)
Vec.append(-1)
subsearch(Next, Vec, s, 1)
for t in tmp[s:]:
ans[t] += 1
def subsearch(Now, Vecnow, s, dis):
if Now == []:
return
global tmp
Next = []
Vec = []
before = -1
for n, v in zip(Now, Vecnow):
if n >= N:
continue
if tmp[n] == -1:
tmp[n] = dis
Next.append(n + v)
Vec.append(v)
if n == X:
Next.extend([Y, Y])
Vec.extend([1, -1])
before = n
elif before == n:
tmp[n] = min(dis, tmp[n])
Next.append(n + v)
Vec.append(v)
else:
tmp[n] = min(dis, tmp[n])
subsearch(Next, Vec, s, dis + 1)
for i in range(N - 1):
tmp = [-1] * N
search(i)
for a in ans[1:-1]:
print(a)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s064952886 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | def distance(i, j, x, y):
if x == y:
return j - i
if i <= x and j >= y:
return x - i + j - y + 1
elif i > x and j < y:
return j - i
elif i <= x and j < y:
return min(y - j + x - i + 1, j - i)
elif i > x and j >= y:
return min(i - x + j - y + 1, j - i)
if __name__ == "__main__":
# n = 5
# x, y = 1, 1
# for i in range(1, n):
# for j in range(i + 1, n + 1):
# print("{} to {}: {}".format(i, j, distance(i, j, x, y)))
n, x, y = tuple([int(i) for i in input().split()])
x, y = min(x, y), max(x, y)
dists = [0 for k in range(n)]
for i in range(1, n):
for j in range(i + 1, n + 1):
d = distance(i, j, x, y)
dists[d] += 1
for k in dists[1:]:
print(k)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s759642417 | Accepted | p02726 | Input is given from Standard Input in the following format:
N X Y | l = [int(x) for x in input().split()]
num_youso = l[0]
hidari = l[1]
migi = l[2]
lis = [0] * (num_youso - 1)
for x in range(1, num_youso + 1):
for y in range(x + 1, num_youso + 1):
saitan = y - x
hidari_kyori = abs(x - hidari)
migi_kyori = abs(y - migi)
if hidari_kyori + migi_kyori + 1 < saitan:
saitan = hidari_kyori + migi_kyori + 1
lis[saitan - 1] += 1
for i in range(num_youso - 1):
print(lis[i])
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s876948018 | Accepted | p02726 | Input is given from Standard Input in the following format:
N X Y | def main():
import collections
n, x, y = map(int, input().split(" "))
dp = [[0] * n for i in range(n)]
for i in range(0, n):
for j in range(i + 1, n):
if i < x - 1:
if j < x:
dp[i][j] = dp[i][j - 1] + 1
if j >= x and j < y:
dp[i][j] = dp[i][x - 1] + min(j - x + 1, y - j)
if j >= y:
dp[i][j] = dp[i][y - 1] + j - y + 1
if i >= x - 1 and i < y - 1:
if j < y:
dp[i][j] = dp[i][x - 1] + min(j - i, y - x + 1 - (j - i))
if j >= y:
dp[i][j] = dp[i][y - 1] + j - y + 1
if i >= y - 1:
dp[i][j] = dp[i][j - 1] + 1
dp_fl = dp[0]
for i in range(1, n):
dp_fl += dp[i]
cnts = collections.Counter(dp_fl)
for i in range(1, n):
print(cnts.get(i, 0))
main()
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s731978210 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | import collections
N, X, Y = list(map(int, input().split()))
ans = 0
A = []
B = []
for j in range(X + 1, Y):
A.append(j - 1)
A.append(N - j)
for f in range(len(A)):
for h in range(1, A[f] + 1):
B.append(h)
B = str(B)
c = collections.Counter(B)
for i in range(1, N - Y + X + 2):
F = N - Y + X - i + 1
D = str(i)
C = c[D]
print(F + C)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s560547672 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | N, X, Y = map(int, input().split())
list = [i + 1 for i in range(N)]
# 処理に用いる３つのリスト
# 一つ目
newlist1 = [i + 1 for i in range(X)]
li_2 = [i + 1 for i in range(Y - 1, N)]
newlist1.extend(li_2)
# 二つ目
newlist2 = [i + 1 for i in range(X)]
li_3 = [i + 1 for i in range(X, Y)]
newlist2.extend(li_3[::-1])
# 三つ目
newlist3 = [i + 1 for i in range(X - 1, Y - 1)][::-1]
li_4 = [i + 1 for i in range(Y - 1, N)]
newlist3.extend(li_4)
# 探索済みレコード
alreadyadded = []
# 探索用コード
for i in range(1, N): # 間隔の設定
counter = 0
for j in range(0, N - i):
if not set([list[j], list[j + i]]) in alreadyadded:
alreadyadded.append(set([list[j], list[i + j]]))
counter += 1
for j in range(0, len(newlist1) - i):
if not set([newlist1[j], newlist1[j + i]]) in alreadyadded:
alreadyadded.append(set([newlist1[j], newlist1[i + j]]))
counter += 1
for j in range(0, len(newlist2) - i):
if not set([newlist2[j], newlist2[j + i]]) in alreadyadded:
alreadyadded.append(set([newlist2[j], newlist2[i + j]]))
counter += 1
for j in range(0, len(newlist3) - i):
if not set([newlist3[j], newlist3[j + i]]) in alreadyadded:
alreadyadded.append(set([newlist3[j], newlist3[i + j]]))
counter += 1
print(counter)
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s033894021 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | n, x, y = input().split()
ans_list = []
for i in range(1, int(n)):
for j in range(i + 1, int(n) + 1):
ans_list.append(
min(
abs(i - j),
abs(i - int(x)) + 1 + abs(j - int(y)),
abs(i - int(y)) + 1 + abs(j - int(x)),
)
)
print(ans_list)
for i in range(1, int(n)):
print(ans_list.count(i))
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s691430216 | Wrong Answer | p02726 | Input is given from Standard Input in the following format:
N X Y | def dijkstra(graph, start):
### initialize
n_node = len(graph)
d = [float("inf") for n in range(n_node)]
d[start] = 0
Q = [(_d, n) for _d, n in zip(d, range(n_node))]
Q.sort()
### search
while len(Q) != 0:
u = Q[0][1]
del Q[0]
for v in range(n_node):
if graph[u][v] == 1 and d[v] > d[u] + 1:
d[v] = d[u] + 1
return d
if __name__ == "__main__":
N, X, Y = [int(i) for i in input().split()]
### graph making
graph = [[0 for n in range(N)] for n in range(N)]
graph[X - 1][Y - 1] = 1
graph[Y - 1][X - 1] = 1
for n in range(N - 1):
graph[n][n + 1] = 1
graph[n + 1][n] = 1
### call dijkstra
l = []
for n in range(N - 1):
l.extend(dijkstra(graph, n)[n + 1 :])
for n in range(1, N):
print(l.count(n))
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s764609108 | Accepted | p02726 | Input is given from Standard Input in the following format:
N X Y | n, x, y = list(map(int, input().split()))
d = [0] * n
flag = False
if y == n:
flag = True
for i in range(1, n):
for j in range(i + 1, n + 1):
dist = min([abs(x - i) + 1 + abs(j - y), j - i])
if dist <= n - 1:
d[dist] += 1
# for i in range(1, n):
# memo_i = []
# for j in range(1, n):
# if i <= x and j >= y:
# dist = (x - i) + 1 + (j - y)
# if dist <= n - 1:
# d[dist] += 1
# elif i <= x:
# dist = min([j - i, (x - i + 1 + (y - j))])
# if dist <= n - 1:
# d[dist] += 1
# elif j >= y:
# dist = min([j - i, (j - y + 1 + (i - x))])
# if dist <= n - 1:
# d[dist] += 1
# else:
# dist = min([j - 1, (y - j) + 1 + (i - x)])
# if dist <= n - 1:
# d[dist] += 1
# if flag:
# for i in range(1, n):
# dist = min([abs(x - i) + 1, n - i])
# if dist <= n - 1:
# d[dist] += 1
for i in range(1, n):
print(d[i])
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
For each k=1, 2, ..., N-1 in this order, print a line containing the answer to
the problem.
* * * | s623630616 | Accepted | p02726 | Input is given from Standard Input in the following format:
N X Y | n, a, b = list(map(int, input().split()))
output_list = [0] * n
def d1(x, y, a, b):
return y - x
def d2(x, y, a, b):
if x <= a and b <= y:
return a - x + y - b + 1
if x <= a and y < b:
return a - x + b - y + 1
if a < x and b <= y:
return x - a + y - b + 1
if a < x and y < b:
return x - a + b - y + 1
def d(x, y, a, b):
return min(d1(x, y, a, b), d2(x, y, a, b))
for x in range(1, n):
for y in range(x + 1, n + 1):
output_list[d(x, y, a, b)] += 1
for k in range(1, n):
print(output_list[k])
| Statement
We have an undirected graph G with N vertices numbered 1 to N and N edges as
follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the problem below:
* Find the number of pairs of integers (i,j) (1 \leq i < j \leq N) such that the shortest distance between Vertex i and Vertex j in G is k. | [{"input": "5 2 4", "output": "5\n 4\n 1\n 0\n \n\nThe graph in this input is as follows: \n \n \n \nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 1:\n(1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5). \nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest\ndistance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5). \nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 3: (1,5). \nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance\nbetween Vertex i and Vertex j is 4.\n\n* * *"}, {"input": "3 1 3", "output": "3\n 0\n \n\nThe graph in this input is as follows: \n \n \n \n\n* * *"}, {"input": "7 3 7", "output": "7\n 8\n 4\n 2\n 0\n 0\n \n\n* * *"}, {"input": "10 4 8", "output": "10\n 12\n 10\n 8\n 4\n 1\n 0\n 0\n 0"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s776296757 | Accepted | p03567 | Input is given from Standard Input in the following format:
S | 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**15
mod = 10**9 + 7
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def LI_():
return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF():
return [float(x) for x in sys.stdin.readline().split()]
def LS():
return sys.stdin.readline().split()
def I():
return int(sys.stdin.readline())
def F():
return float(sys.stdin.readline())
def S():
return input()
def pf(s):
return print(s, flush=True)
def main():
s = S()
l = len(s)
for i in range(l - 1):
if s[i : i + 2] == "AC":
return "Yes"
return "No"
print(main())
| Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s288419913 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | s = input()
if s in "AC":
print("Yes")
else:
print("No") | Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s959637025 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | print(
"Yes"
if any([input()[i : i + 2] == "AC" for i in range(len(input()) - 1)])
else "No"
)
| Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s443898793 | Wrong Answer | p03567 | Input is given from Standard Input in the following format:
S | print("YES" if "AC" in input() else "NO")
| Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s818144693 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | S = input()
if "AC" in S:
print('Yes')
else
print('No') | Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s968978189 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | print("YNeos"[["AC" not in input()] :: 2])
| Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s367645894 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | print("YES" if "AC" in input() else "NO) | Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s150281680 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | if "AC" in input() == True:
print("Yes")
else:
print("No")if "AC" in input() == True: | Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s979252626 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | inputs = input()
inputs = list(inputs)
flag = False
for i in range(len(inputs) - 1):
if inputs[i] == 'A' and inputs[i+1] == 'C'
flag = True
if flag:
print('Yes')
else:
print('No') | Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s728868351 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | a = input()
if len a[0]=A and len a[1]=C:
print("Yes")
elif len a[1]=A and len a[2]=C:
print("Yes")
elif len a[2]=A and len a[3]=C:
print("Yes")
elif len a[3]=A and len a[4]=C:
print("Yes")
elif:
print("No") | Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s118016962 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | inputs = input()
x = list(inputs)
flag = False
for i in range(len(x) - 1):
if x[i] == 'A' and x[i+1] == 'C'
flag = True
if flag:
print('Yes')
else:
print('No') | Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s461289458 | Wrong Answer | p03567 | Input is given from Standard Input in the following format:
S | import sys
sys.setrecursionlimit(10000000)
s = input()
def check(str, flag):
if str == "":
return True
flag += str.count(str[0]) % 2
if flag > 1:
return False
else:
return check(str.replace(str[0], ""), flag)
def check2(str, x):
if str == "" or check(str, 0):
return x
count = len(str) - 1
while not check(str[0:count], 0):
count -= 1
return check2(str[count:], x + 1)
a = min(check2(s, 1), check2(s[::-1], 1))
print(a)
| Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s269450085 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | def solve():
S = input()
for i in range(len(S)-1):
if S[i:i+2]=='AC':
print('Yes')
return
print('No')
return
solve() | Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s478395814 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | S = input()
for i in range(len(S)):
if S[i] == 'A' ans S[i+1]:
print('Yes')
exit()
print('No') | Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s956128487 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | s = input()
for i in range(len(s)-1):
if s[i][i+1] == "AC":
print("Yes")
else:
print("No")
| Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s671948987 | Accepted | p03567 | Input is given from Standard Input in the following format:
S | print("YNeos"[not "AC" in input() :: 2])
| Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
If the judge can return the string `AC` as a verdict to a program, print
`Yes`; if it cannot, print `No`.
* * * | s430370558 | Runtime Error | p03567 | Input is given from Standard Input in the following format:
S | print(‘Yes’ if ‘AC’ in input() else ‘No’) | Statement
Snuke built an online judge to hold a programming contest.
When a program is submitted to the judge, the judge returns a verdict, which
is a two-character string that appears in the string S as a contiguous
substring. (The judge can return any two-character substring of S.)
Determine whether the judge can return the string `AC` as the verdict to a
program. | [{"input": "BACD", "output": "Yes\n \n\nThe string `AC` appears in `BACD` as a contiguous substring (the second and\nthird characters).\n\n* * *"}, {"input": "ABCD", "output": "No\n \n\nAlthough the string `ABCD` contains both `A` and `C` (the first and third\ncharacters), the string `AC` does not appear in `ABCD` as a contiguous\nsubstring.\n\n* * *"}, {"input": "CABD", "output": "No\n \n\n* * *"}, {"input": "ACACA", "output": "Yes\n \n\n* * *"}, {"input": "XX", "output": "No"}] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.