buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k |
|---|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
string s;
vector<string> S;
for (int i = 0; i < N; i++) {
cin >> s;
S[i] = s;
}
sort(S.begin(), S.end());
for (int i = 0; i < N; i++) {
cout << S[i];
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S[i];
}
sort(S.begin(), S.end());
for (int i = 0; i < N; i++) {
cout << S[i];
}
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 8, 9, 0, 43, 49, 53, 54, 55, 0, 24], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 8, 9, 0, 43, 49, 53, 54, 55, 0, 25], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 7, 8, 9,... | 1 | 97 |
NL = [ x for x in map(int,input().split()) ]
cha = []
i = 0
while i < NL[0]:
cha.append(input())
i += 1
print(sorted(cha)) | NL = [ x for x in map(int,input().split()) ]
cha = []
i = 0
while i < NL[0]:
cha.append(input())
i += 1
print(''.join(sorted(cha))) | [["+", 3, 4, 0, 652, 63, 319, 500, 557, 0, 654], ["+", 3, 4, 0, 652, 63, 319, 500, 557, 0, 655], ["+", 0, 652, 3, 4, 0, 652, 63, 319, 0, 131], ["+", 0, 652, 3, 4, 0, 652, 63, 319, 319, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 53 |
#ABC042.B
N,L = map(int,input().split())
s = [input()for_in range(n)]
s.sort()
ans=''
for i in range(N):
ans += s[i]
print(ans) | #ABC042.B
N,L = map(int,input().split())
s = [input()for _ in range(N)]
s.sort()
ans=''
for i in range(N):
ans =ans +s[i]
print(ans) | [["-", 0, 662, 12, 634, 0, 652, 0, 42, 0, 22], ["+", 0, 1, 0, 662, 12, 658, 0, 659, 0, 88], ["+", 0, 1, 0, 662, 12, 658, 0, 659, 31, 22], ["+", 0, 1, 0, 662, 12, 658, 0, 659, 0, 267], ["-", 0, 662, 12, 634, 0, 652, 3, 4, 0, 22], ["+", 12, 658, 0, 659, 12, 652, 3, 4, 0, 22], ["-", 0, 7, 8, 196, 0, 1, 0, 677, 17, 107], [... | 5 | 56 |
#include <bits/stdc++.h>
using namespace std;
using lint = long;
using ll = long long;
#define rep(i, n) for (lint(i) = 0; (i) < (lint)(n); (i)++)
#define repInRange(i, start, end) for (lint(i) = (start); (i) < (end); ++(i))
using lpair = pair<lint, lint>;
using Vecint = vector<lint>;
using Llist = list<lint>;
using vs... | #include <bits/stdc++.h>
using namespace std;
using lint = long;
using ll = long long;
#define rep(i, n) for (lint(i) = 0; (i) < (lint)(n); (i)++)
#define repInRange(i, start, end) for (lint(i) = (start); (i) < (end); ++(i))
using lpair = pair<lint, lint>;
using Vecint = vector<lint>;
using Llist = list<lint>;
using vs... | [["+", 36, 36, 36, 36, 0, 30, 0, 112, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 112, 141, 22], ["+", 36, 36, 0, 30, 0, 112, 54, 158, 0, 24], ["+", 36, 36, 0, 30, 0, 112, 54, 158, 0, 22], ["+", 36, 36, 0, 30, 0, 112, 54, 158, 0, 25], ["+", 36, 36, 36, 36, 0, 30, 0, 112, 51, 59], ["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78... | 1 | 244 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, L;
cin >> N >> L;
vector<string> S(N);
for (int i = 0; i < N; i++)
cin >> S[i];
sort(S.begin(), S.end());
cout << S[0];
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, L;
cin >> N >> L;
vector<string> S(N);
for (int i = 0; i < N; i++)
cin >> S[i];
// string tmp;
// int min;
//
// for (int i = 0; i < N - 1; i++)
// {
// min = i;
// for (int j... | [["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 88], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 24], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 7, 15,... | 1 | 83 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, L;
cin >> N >> L;
vector<string> S(N);
for (int i = 0; i < N; i++)
cin >> S[i];
string tmp;
int min;
for (int i = 0; i < N; i++) {
min = i;
for (int j = i + 1; j < N; j++) {
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int N, L;
cin >> N >> L;
vector<string> S(N);
for (int i = 0; i < N; i++)
cin >> S[i];
string tmp;
int min;
for (int i = 0; i < N - 1; i++) {
min = i;
for (int j = i + 1; j < N; j++) ... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22], ["-", 15, 339, 51, 16, 31, 2, 3, 4, 0, 21], ["-", 15, 339, 51, 16, 31, 2, 3, 4, 0, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 88], ["+", 0, 30, ... | 1 | 169 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, l;
cin >> n >> l;
string s[100];
for (int i = 0; i < l; i++) {
cin >> s[i];
}
sort(s, s + l);
for (int i = 0; i < l; i++) {
cout << s[i];
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, l;
cin >> n >> l;
string s[100];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s, s + n);
for (int i = 0; i < n; i++) {
cout << s[i];
}
cout << "\n";
}
| [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["+", 8, 9, 0, 1, 0, 16, 12, 5, ... | 1 | 87 |
package main
import (
"fmt"
"sort"
)
func main() {
var n, l int
fmt.Scan(&n, &l)
var s []string
for i := 0; i < n; i++ {
fmt.Scan(&s[i])
}
sort.Strings(s)
for _, value := range s {
fmt.Print(value)
}
}
| package main
import (
"fmt"
"sort"
)
func main() {
var n, l int
fmt.Scan(&n, &l)
var s []string
s = make([]string, n)
for i := 0; i < n; i++ {
fmt.Scan(&s[i])
}
sort.Strings(s)
for _, value := range s {
fmt.Print(value)
}
}
| [["+", 0, 435, 8, 196, 0, 436, 31, 432, 0, 22], ["+", 0, 434, 0, 435, 8, 196, 0, 436, 17, 32], ["+", 8, 196, 0, 436, 12, 432, 0, 2, 63, 22], ["+", 0, 436, 12, 432, 0, 2, 3, 4, 0, 24], ["+", 12, 432, 0, 2, 3, 4, 0, 467, 0, 70], ["+", 12, 432, 0, 2, 3, 4, 0, 467, 0, 73], ["+", 12, 432, 0, 2, 3, 4, 0, 467, 468, 78], ["+",... | 7 | 94 |
#include <stdio.h>
#include <stdlib.h>
void sort(char **S, int N) {
char *temp;
for (int i = 0; S[i + 1]; i++) {
for (int j = N - 1; i < j; j--) {
for (int k = 0; S[i][k] || S[j][k]; k++) {
if ((S[j][k] - S[i][k]) < 0) {
temp = S[i];
S[i] = S[j];
S[j] = temp;
... |
#include <stdio.h>
#include <stdlib.h>
void sort(char **S, int N) {
char *temp;
for (int i = 0; i < (N - 1); i++) {
for (int j = (N - 1); i < j; j--) {
for (int k = 0; S[i][k] || S[j][k]; k++) {
if ((S[j][k] - S[i][k]) < 0) {
temp = S[i];
S[i] = S[j];
S[j] = temp;
... | [["-", 0, 14, 8, 9, 0, 7, 15, 69, 28, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 69, 0, 70], ["-", 8, 9, 0, 7, 15, 69, 71, 16, 17, 72], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 8, 9, 0, 7, 15, 16, 12, 23, 0, 24], ["+", 0, 7, 15, 16, 12, 23, 0, 16, 31, 22], ["+", 0, 7, 15, 16, 12, 23, 0, 16, 17, 33], ["-", 0, 14, 8, 9, 0,... | 0 | 320 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<vector<string>> S(N, vector<string>(1));
for (int i = 0; i < N; i++)
cin >> S.at(i).at(0);
// for(int i=0;i<N;i++)cout<<S.at(i).at(0)<<endl;
for (int i = 0; i < N; i++)
cout << S.at(i).at(0);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<vector<string>> S(N, vector<string>(1));
for (int i = 0; i < N; i++)
cin >> S.at(i).at(0);
sort(S.begin(), S.end());
// for(int i=0;i<N;i++)cout<<S.at(i).at(0)<<endl;
for (int i = 0; i < N; i++)
cout << S.a... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 17, 131], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21]... | 1 | 103 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
rep(i, n) cout << a[i];
cou... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
typedef long long ll;
int main() {
int n, l;
cin >> n >> l;
vector<string> a(n);
rep(i, n) cin >> a.at(i);
sort(a.begin(), a.end());
rep(i, n) cout <<... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 70], ["+", 0, 1, 0, 16, 12, 2, 63, 118, 17, 131], ["+", 0, 1, 0, 16, 12, 2, 63, 118, 119, 120], ["+", 0, 1, 0, 16... | 1 | 97 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, l;
string s;
vector<string> str;
int i;
cin >> n;
cin >> l;
for (i = 0; i < n; i++) {
cin >> s;
str.push_back(s);
}
for (i = 0; i < n - 1; i++) {
if (str[i] > str[i ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, l;
string s;
vector<string> str;
int i, j;
cin >> n;
cin >> l;
for (i = 0; i < n; i++) {
cin >> s;
str.push_back(s);
}
for (i = 0; i < n; i++) {
for (j = 0; j < n - ... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 35], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 25], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 8, 9, 0, 7, 8, 9, 0, 7, 0, ... | 1 | 162 |
#include <bits/stdc++.h>
using namespace std;
#define rep(shoki, i, n) for (int i = shoki; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
int main() {
int l, n;
cin >> l >> n;
string s[110];
rep(0, i, n) cin >> s[i];
sort(s, s + n);
rep(0, i, n) { cout << s[i]; }
cout << ... | #include <bits/stdc++.h>
using namespace std;
#define rep(shoki, i, n) for (int i = shoki; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
int main() {
int n, l;
cin >> n >> l;
string s[110];
rep(0, i, n) cin >> s[i];
sort(s, s + n);
rep(0, i, n) { cout << s[i]; }
cout << ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0... | 1 | 102 |
// I am so vegetable
#include <bits/stdc++.h>
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _defor(i, a, b) for ((i) = (a); (i) < (b); ++i)
#define _rfor(i, a, b) for (int i = (a); i > (b); --i)
#define _sfor(p, st) for (auto &p : st)
//#define _LOCAL_
using namespace std;
typedef long long ll;
const in... | // I am so vegetable
#include <bits/stdc++.h>
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _defor(i, a, b) for ((i) = (a); (i) < (b); ++i)
#define _rfor(i, a, b) for (int i = (a); i > (b); --i)
#define _sfor(p, st) for (auto &p : st)
//#define _LOCAL_
using namespace std;
typedef long long ll;
const in... | [["-", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["+", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["-", 0, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 0, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["+", 0, 2, 3, 4, 0, ... | 1 | 193 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(v) (v).begin(), (v).end()
int main() {
int n, l;
cin >> n >> l;
set<string> s;
rep(i, n) {
string str;
cin >> str;
s.insert(str);
}
for (string str : s) {
cout << str;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(v) (v).begin(), (v).end()
int main() {
int n, l;
cin >> n >> l;
vector<string> s;
rep(i, n) {
string str;
cin >> str;
s.push_back(str);
}
sort(all(s));
for (string str : s) {
... | [["-", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["+", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["-", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 2, 3, 4, 0, 2, ... | 1 | 78 |
/* 実行時間1s制限の場合
10^6 1,000,000 : 余裕をもって間に合う
10^7 10,000,000 : おそらく間に合う
10^8 100,000,000 : 非常にシンプルな処理でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // long longはデータモデル(... | /* 実行時間1s制限の場合
10^6 1,000,000 : 余裕をもって間に合う
10^7 10,000,000 : おそらく間に合う
10^8 100,000,000 : 非常にシンプルな処理でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // long longはデータモデル(... | [["-", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["+", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["-", 8, 9, 0, 43, 39, 344, 3, 347, 0, 21], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 53, 49, 22], ["+", 8, 9, 0, 43, 49, 53, 54, 55, 0, 24], ["+", 0, 43... | 1 | 420 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end());
for (int i = 0; i < N; i++) {
cout << S.at(i);
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end());
string ans = S.at(0);
for (int i = 1; i < N; i++) {
ans += S.at(i);
}
cout << ans << endl;
}
| [["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 78], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 43, 49, 50, 5... | 1 | 101 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end());
string out = "";
for (int i = 0; i < N; i++) {
out += S.at(i);
S.erase(S.begin());
}
cout << out << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end());
string out = "";
for (int i = 0; i < N; i++) {
out += S.at(i);
}
cout << out << endl;
}
| [["-", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["-", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["-", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 17, 131], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["-", 0, 2, 3, 4, 0, 2,... | 1 | 120 |
#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
char c = getchar();
int w = 1;
x = 0;
while (!isdigit(c))
(c == '-') && (w = -w), c = getchar();
while (isdigit(c))
x = (x << 1) + (x << 3) + (c ^ '0'), c = getchar();
x *= w;
}
string a[1000];
int main() {
char c;
int n, m... | #include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
char c = getchar();
int w = 1;
x = 0;
while (!isdigit(c))
(c == '-') && (w = -w), c = getchar();
while (isdigit(c))
x = (x << 1) + (x << 3) + (c ^ '0'), c = getchar();
x *= w;
}
string a[1000];
int main() {
char c;
int n, m... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 7, 8, 9, 0, 7, 0, 88], ["-", 8, 9, 0, 7, 8, 9, 0, 7, 0, 24], ... | 1 | 248 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
vector<string> str(N + 1);
cin >> N >> L;
for (int i = 0; i < N; i++) {
cin >> str.at(i);
}
sort(str.begin(), str.end());
for (int i = 0; i < N; i++) {
cout << str.at(i);
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<string> str(N);
for (int i = 0; i < N; i++) {
cin >> str.at(i);
}
sort(str.begin(), str.end());
for (int i = 0; i < N; i++) {
cout << str.at(i);
}
cout << endl;
} | [["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["-", 0, 43, 49, 50, 51, ... | 1 | 103 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n, l;
string *S;
string ans;
cin >> n >> l;
S = new string[n + 1];
for (int i = 0; i < n; ++i)
cin >> S[i];
sort(S, &S[n]);
for (int i = 0; i < n; ++i)
ans += S[i];
cout <... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#define MAXN 100
using namespace std;
int main() {
int n, l;
string S[MAXN + 1];
string ans;
cin >> n >> l;
for (int i = 0; i < n; ++i)
cin >> S[i];
sort(S, &S[n]);
for (int i = 0; i < n; ++i)
ans += S[i];
cout... | [["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 43, 49, 84, 0, 48], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 0, 70], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 31, 22], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 17, 72], ["+", 8, 9,... | 1 | 110 |
#define _USE_MATH_DEFINES // M_PI
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
using ll = long long;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define rREP(i, a, n) for (int(i) = (n)-1; (i) >= (a); --(i))
#define all(x) (x).begin(), (x).end()
#define... | #define _USE_MATH_DEFINES // M_PI
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
using ll = long long;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define rREP(i, a, n) for (int(i) = (n)-1; (i) >= (a); --(i))
#define all(x) (x).begin(), (x).end()
#define... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16,... | 1 | 271 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int l, n;
cin >> l >> n;
string s;
std::deque<string> deq;
for (int i = 0; i < n; i++) {
cin >> s;
deq.emplace_back(s);
}
sort(deq.begin(), deq.end());
string ans = "";
for (int j = 0; j < n; j++) {
ans += deq[j];
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, l;
cin >> n >> l;
string s;
std::deque<string> deq;
for (int i = 0; i < n; i++) {
cin >> s;
deq.emplace_back(s);
}
sort(deq.begin(), deq.end());
string ans = "";
for (int j = 0; j < n; j++) {
ans += deq[j];
}
cout <<... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0... | 1 | 112 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int l;
vector<string> a(n);
cin >> n >> l;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
cout << a.at(i);
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, l;
cin >> n >> l;
vector<string> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
cout << a.at(i);
}
cout << endl;
return 0;
}
| [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["-", 0, 30, 0, 14, 8, 9,... | 1 | 106 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll i, j, k, l, test, n, pos;
std::vector<string> a(1000);
cin >> test >> n;
for (i = 0; i < test; i++)
cin >> a[i];
sort(a.begin(), a.end());
for (i = 0; i < test; i++)
cout << a[i];
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll i, j, k, l, test, n, pos;
cin >> test >> n;
std::vector<string> a(test);
for (i = 0; i < test; i++)
cin >> a[i];
sort(a.begin(), a.end());
for (i = 0; i < test; i++)
cout << a[i];
} | [["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["-", 8, 9, 0, 43, 49, 50, ... | 1 | 102 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
ll n, l;
cin >> n >> l;
string s[n];
rep(i, n) { cin >> s[i]; }
sort(s[n].begin(), s[n].end());
rep(i, n) { cout << s[i]; }
cout << endl;
} | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
ll n, l;
cin >> n >> l;
string s[n];
rep(i, n) { cin >> s[i]; }
sort(s, s + n);
rep(i, n) { cout << s[i]; }
cout << endl;
} | [["-", 0, 2, 63, 118, 28, 69, 341, 342, 0, 70], ["-", 0, 2, 63, 118, 28, 69, 341, 342, 0, 22], ["-", 0, 2, 63, 118, 28, 69, 341, 342, 0, 73], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 17, 131], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25], ["+", 0, 1, 0, ... | 1 | 103 |
a , b = map(int,input().split())
c_list = [input() for i in range(a)]
c.sort()
print("".join(c)) | a , b = map(int,input().split())
c_list = sorted([input() for i in range(a)])
print("".join(c_list)) | [["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 1, 0, 652, 63, 319, 500, 22], ["-", 0, 656, 0, 1, 0, 652, 63, 319, 0, 131], ["-", 0, 656, 0, 1, 0, 652, 63, 319, 319, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", ... | 5 | 45 |
<?php
fscanf(STDIN,"%d%d",$n,$l);
$s_li=array();
for($i=0;$i<$n;$i++){
$s_li[]=trim(fgets(STDIN));
}
//print_r($s_li);
sort($s_li);
print_r($s_li);
$re = '';
foreach($s_li as $val){
$re.=$val;
}
echo $re; | <?php
fscanf(STDIN,"%d%d",$n,$l);
$s_li=array();
for($i=0;$i<$n;$i++){
$s_li[]=trim(fgets(STDIN));
}
//print_r($s_li);
sort($s_li);
//print_r($s_li);
$re = '';
foreach($s_li as $val){
$re.=$val;
}
echo $re."\n"; | [["-", 36, 36, 0, 493, 0, 1, 0, 613, 63, 141], ["-", 0, 493, 0, 1, 0, 613, 3, 3, 0, 24], ["-", 0, 613, 3, 3, 0, 28, 0, 606, 0, 607], ["-", 0, 613, 3, 3, 0, 28, 0, 606, 0, 141], ["-", 0, 493, 0, 1, 0, 613, 3, 3, 0, 25], ["-", 36, 36, 36, 36, 0, 493, 0, 1, 0, 35], ["+", 36, 36, 0, 493, 0, 608, 0, 16, 17, 131], ["+", 0, 4... | 6 | 94 |
NL = ["3", "3"]
N = int(NL[0])
L = int(NL[1])
st = []
for i in range(N):
a = input()
st.append(a)
s_st = sorted(st)
dic = ""
for j in range(len(s_st)):
dic += s_st[j]
print(dic)
| NL = input().split()
N = int(NL[0])
L = int(NL[1])
st = []
for i in range(N):
a = input()
st.append(a)
s_st = sorted(st)
dic = ""
for j in range(len(s_st)):
dic += s_st[j]
print(dic) | [["-", 0, 656, 0, 1, 0, 662, 12, 634, 0, 70], ["-", 0, 1, 0, 662, 12, 634, 0, 557, 0, 654], ["-", 0, 1, 0, 662, 12, 634, 0, 557, 0, 6], ["-", 0, 1, 0, 662, 12, 634, 0, 557, 0, 655], ["-", 0, 656, 0, 1, 0, 662, 12, 634, 0, 21], ["-", 0, 656, 0, 1, 0, 662, 12, 634, 0, 73], ["+", 0, 662, 12, 652, 63, 319, 500, 652, 63, 22... | 5 | 83 |
//#pragma GCC optimize(\"Ofast,no-stack-protector\")
//#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx\")
//#pragma GCC target(\"avx,tune=native\")
// Neil
#include <bits/stdc++.h>
using namespace std;
typedef complex<double> base;
typedef long double ld;
typedef long long ll;
#define endl "\n"
#define... | //#pragma GCC optimize(\"Ofast,no-stack-protector\")
//#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx\")
//#pragma GCC target(\"avx,tune=native\")
// Neil
#include <bits/stdc++.h>
using namespace std;
typedef complex<double> base;
typedef long double ld;
typedef long long ll;
#define endl "\n"
#define... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 73], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 7, 8, 9, 0, 57, 64, 116, 0, 1... | 1 | 262 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, n;
cin >> l >> n;
string a;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
for (int i = 0; i < n; i++) {
a += s[i];
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
string a;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
for (int i = 0; i < n; i++) {
a += s[i];
}
cout << a << endl;
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0... | 1 | 102 |
/*------------------------------------
.....Bismillahir Rahmanir Rahim.......
created by muslim.time: 2:24:23 pm....
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | /*------------------------------------
.....Bismillahir Rahmanir Rahim.......
created by muslim.time: 2:24:23 pm....
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | [["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 146], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 338, 8, 9, 0, 45], ["+", 8, 9, 0, 338, 8, 9, 0, 43, 39, 40], ["+", 0, 338, 8, 9, 0, ... | 1 | 149 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se se... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se se... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0... | 1 | 140 |
N, L = map(int, input().split())
S = [input() for _ in range(N)]
print(''.join(S.sort()) | N, L = map(int, input().split())
S = [input() for _ in range(N)]
S.sort()
print(''.join(S)) | [["+", 0, 656, 0, 1, 0, 652, 63, 319, 500, 22], ["+", 0, 656, 0, 1, 0, 652, 63, 319, 0, 131], ["+", 0, 656, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25], ["-", 0, 652, 3, 4, 0, 652, 63, 319, 0, 131], ["-", 0, 652, 3, 4, 0, 652, 63, 319, 319, 22], ["... | 5 | 43 |
n,l = map(int,input().split())
s = [0]*n
for i in range(n):
s[i] = input()
s = sorted(s)
ans = []
for i in range(n):
ans.extend(s[i])
print(ans) | n,l = map(int,input().split())
s = [0]*n
for i in range(n):
s[i] = input()
s = sorted(s)
ans = []
for i in range(n):
print(s[i],end="")
print("") | [["-", 8, 196, 0, 1, 0, 652, 63, 319, 500, 22], ["-", 8, 196, 0, 1, 0, 652, 63, 319, 0, 131], ["-", 8, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 21], ["+", 0, 1, 0, 652, 3, 4, 0, 653, 141, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 653, 0, 32], ["+", 0,... | 5 | 70 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int unused __attribute__((unused));
int i, N, L;
char **S, *tmp;
unused = scanf("%d %d", &N, &L);
S = malloc(sizeof(char *) * N);
for (i = 0; i < N; i++) {
S[i] = malloc(sizeof(char) * (L + 1));
unused = scanf("%s", S[i]);
}
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int unused __attribute__((unused));
int i, j, N, L;
char **S, *tmp;
unused = scanf("%d %d", &N, &L);
S = malloc(sizeof(char *) * N);
for (i = 0; i < N; i++) {
S[i] = malloc(sizeof(char) * (L + 1));
unused = scanf("%s", S[i]);
... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 35], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15,... | 0 | 222 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
int main() {
int l, n;
cin >> l >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
sort(all(s));
string ans;
for (int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
int main() {
int n, l;
cin >> n >> l;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
sort(all(s));
string ans;
for (int i = 0; i < n... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0... | 1 | 118 |
#include <bits/stdc++.h>
using namespace std;
string a[101];
int n;
int main() {
scanf("%d", &n);
for (register int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
for (register int i = 0; i < n; ++i)
cout << a[i];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string a[101];
int n, i;
int main() {
scanf("%d%*d", &n);
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (i = 0; i < n; i++)
cout << a[i];
cout << endl;
return 0;
} | [["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 7, 10, 43, 0, 114, 0, 388], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 7, 26, ... | 1 | 87 |
#include <bits/stdc++.h>
using namespace std;
string a[101];
int n;
int main() {
scanf("%d", &n);
for (register int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
for (register int i = 0; i < n; ++i)
cout << a[i];
return 0;
} | #include <bits/stdc++.h> //我爱万能头
using namespace std;
string a[101];
int n, i;
int main() {
scanf("%d%*d", &n); // sao操作所在地
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n); //虽然会其他排序方法但懒得打QwQ
for (i = 0; i < n; i++)
cout << a[i];
return 0;
} | [["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 7, 10, 43, 0, 114, 0, 388], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 7, 26, ... | 1 | 87 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a[101];
int n, i, l;
cin >> n >> l;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (i = 0; i < n; i++) {
cout << a[i] << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
string a[101];
long long n, i, l;
cin >> n >> l;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (i = 0; i < n; i++)
cout << a[i];
return 0;
} | [["-", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, ... | 1 | 89 |
#include <iostream>
#include <string>
using namespace std;
void swap(string *a, string *b) {
string t = *a;
*a = *b;
*b = t;
}
int partition(string arr[], int low, int high) {
string pivot = arr[high];
int i = (low - 1);
for (int j = low; j <= high - 1; j++) {
if (arr[j] <= pivot) {
i++; // in... | #include <iostream>
#include <string>
using namespace std;
void swap(string *a, string *b) {
string t = *a;
*a = *b;
*b = t;
}
int partition(string arr[], int low, int high) {
string pivot = arr[high];
int i = (low - 1);
for (int j = low; j <= high - 1; j++) {
if (arr[j] <= pivot) {
i++; // in... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["-", 0, 16, 31, 16, 12, 69, 341, 342, 0, 70], ["-", 0, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["-", 0, 16, 31, 16, 12, 69, 341, 342, 0, 73], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0,... | 1 | 321 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
typedef int long long ill;
typedef int long il;
using namespace std;
#define N 100
#define L 100
int n, l;
vector<string... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
typedef int long long ill;
typedef int long il;
using namespace std;
#define N 100
#define L 100
int n, l;
vector<string... | [["-", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["-", 36, 36, 0, 30, 0, 43, 39, 344, 141, 78], ["-", 0, 30, 0, 43, 39, 344, 3, 347, 0, ... | 1 | 142 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int N, L;
scanf("%d %d", &N, &L);
char text[101][101], senten[10001], tem[101];
int i, j;
for (i = 0; i < N; i++) {
scanf("%s", text[i]);
}
for (i = 1; i < N; i++) {
for (j = i; j < N; j++) {
if (strcmp(text[i - 1], t... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int N, L;
scanf("%d %d", &N, &L);
char text[100][101], senten[10001], tem[101];
int i, j;
for (i = 0; i < N; i++) {
scanf("%s", text[i]);
}
for (i = 1; i < N; i++) {
for (j = i; j < N; j++) {
if (strcmp(text[i - 1], t... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 2, 3, 4, 0, 16, 12, 23, 0, 24], ["-", 3, 4, 0, 16, 12, 23, 0, 16, 31, 22], ["-", 3, 4, 0, 16, 12, 23, 0,... | 0 | 214 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
for (int i = 0; i < n; i++)
cout << s[i];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l;
cin >> l;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
for (int i = 0; i < n; i++)
cout << s[i];
}
| [["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 87 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int l, n;
cin >> l >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
string ans = "";
rep(i, n) ans += s[i];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, l;
cin >> n >> l;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
string ans = "";
rep(i, n) ans += s[i];
cout << ans << endl;
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0... | 1 | 103 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
string s[100];
int n;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s, s + n);
for (int i = 0; i < n; i++) {
cout << s[i];
}
} |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
string s[100];
int n;
int main() {
scanf("%d%*d", &n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s, s + n);
for (int i = 0; i < n; i++) {
cout << s[i];
}
} | [["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0,... | 1 | 84 |
#include <bits/stdc++.h>
using namespace std;
string a[101];
int n, i;
int main() {
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (i = 0; i < n; i++)
cout << a[i];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string a[101];
int n, i;
int main() {
scanf("%d%*d", &n);
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (i = 0; i < n; i++)
cout << a[i];
return 0;
} | [["-", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["+",... | 1 | 79 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int com(const char *x, const char *y) { return strcmp(x, y); }
int main() {
int n, l, i;
scanf("%d %d", &n, &l);
char s[n][l + 1];
for (i = 0; i < n; i++)
scanf("%s", s[i]);
qsort(s, n, sizeof(s[0]), com);
for (i = 0; i < n; i++)
printf("%... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int com(const char *x, const char *y) { return strcmp(x, y); }
int main() {
int n, l, i;
char s[101][101];
scanf("%d %d", &n, &l);
for (i = 0; i < n; i++)
scanf("%s", s[i]);
qsort(s, n, sizeof(s[0]), com);
for (i = 0; i < n; i++)
printf("%... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 49, 22], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 0, 70], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 0, 73], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 0, 70], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9,... | 0 | 143 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
string s[128];
string M;
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + N);
for (int i = 0; i < N; i++)
cout << s[i];
// cout << ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
string s[128];
string M;
for (int i = 0; i < N; i++)
cin >> s[i];
sort(s, s + N);
for (int i = 0; i < N; i++)
cout << s[i];
cout << endl;
return 0;
}
| [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 3, 4, 0, 2, 63, 118, 28, 69, 28, 22], ["-", 0, 2, 63, 118, 28, 69, 341, 342, 0, 70], ["-", 0, 2, 63, 118, 28, 69, 341, 342, 0, 22], ["-", 0, 2, 63, 118, 28, 69, 341, 342, 0, 73], ["-", 0, 2, 3, 4, ... | 1 | 118 |
let _inputLines;
let _lineNumber = 0;
let inputReader = _inputReader();
function _main() {
_inputLines =
_inputData.trim().split('\n').map((string) => { return string.trim(); });
;
let [a, b] = inputReader.readArray();
// console.log(typeof c);
a = parseInt(a);
b = parseInt(b);
// c = parseInt(c... |
let _inputLines;
let _lineNumber = 0;
let inputReader = _inputReader();
function _main() {
_inputLines =
_inputData.trim().split('\n').map((string) => { return string.trim(); });
;
let [a, b] = inputReader.readArray();
// console.log(typeof c);
a = parseInt(a);
b = parseInt(b);
// c = parseInt(c... | [["-", 500, 2, 63, 558, 500, 2, 63, 558, 0, 131], ["-", 500, 2, 63, 558, 500, 2, 63, 558, 559, 560], ["-", 500, 2, 63, 558, 500, 2, 3, 3, 0, 24], ["-", 63, 558, 500, 2, 3, 3, 0, 557, 0, 104], ["-", 500, 2, 63, 558, 500, 2, 3, 3, 0, 25], ["-", 51, 2, 63, 558, 500, 2, 63, 558, 0, 131], ["-", 51, 2, 63, 558, 500, 2, 63, 5... | 2 | 331 |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (n); ++i)
// using namespace atcoder;
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#de... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (n); ++i)
// using namespace atcoder;
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#de... | [["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 0, 43, 49, 53, 54, 55... | 1 | 407 |
n, l = map(int, input().split())
A = sorted([input() for _ in range(l)])
print("".join(A))
| n, l = map(int, input().split())
A = [input() for _ in range(n)]
A.sort()
print("".join(A))
| [["-", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 658, 0, 659, 12, 652, 3, 4, 0, 22], ["+", 12, 658, 0, 659, 12, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 63, 319, 500, 22], ["+", 0, 656, 0, 1, 0, 652, 63, 319, 0, 131], ["+", 0, 656, 0, 1, 0, 652, 63, 319, 319, 22],... | 5 | 43 |
/*
Remember, Hope is a good thing... May be the best of things... and No Good
thing ever Dies !!!
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS \
ios::sync_with_stdio(0); ... | /*
Remember, Hope is a good thing... May be the best of things... and No Good
thing ever Dies !!!
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS \
ios::sync_with_stdio(0); ... | [["-", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["+", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["-", 8, 9, 0, 43, 39, 344, 3, 347, 0, 21], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 78], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 53, 49, 22], ["+", 8, 9, 0, 43, 49, 53, 54, 55, 0, 24], ["+", 0, 43... | 1 | 297 |
#include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define all(x) (x).begin(), (x).end()... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define all(x) (x).begin(), (x).end()... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 43, 49, 53, 54, 55, 0, 24], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 8, 9, 0, 43, 49, 53, 54, 55, 0, 25]] | 1 | 532 |
#include <stdio.h>
#include <string.h>
int main(void) {
int n, l, i, j;
char s[100][100], tmp[200];
scanf("%d %d", &n, &l);
for (i = 0; i < n; i++)
scanf("%s", s[i]);
for (i = 1; i < n; i++) {
for (j = 1; j < n; j++) {
if (strcmp(s[j - 1], s[j])) {
strcpy(tmp, s[j - 1]);
strcpy(s... | #include <stdio.h>
#include <string.h>
int main(void) {
int N, L;
char s[100][200], tmp[200];
scanf("%d %d", &N, &L);
for (int i = 0; i < N; i++)
scanf("%s", s[i]);
for (int i = 1; i < N; i++) {
for (int j = 1; j < N; j++) {
if (strcmp(s[j - 1], s[j]) > 0) {
strcpy(tmp, s[j - 1]);
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 14, 8, 9, 0, 7, 10,... | 0 | 186 |
from sys import stdin, stdout
from time import perf_counter
import sys
sys.setrecursionlimit(10**9)
mod = 10**9+7
# import sys
# sys.stdout = open("e:/cp/output.txt","w")
# sys.stdin = open("e:/cp/input.txt","r")
n,l = map(int,input().split())
a = [input() for item in range(n)]
print(''.join(a)) | from sys import stdin, stdout
from time import perf_counter
import sys
sys.setrecursionlimit(10**9)
mod = 10**9+7
# import sys
# sys.stdout = open("e:/cp/output.txt","w")
# sys.stdin = open("e:/cp/input.txt","r")
n,l = map(int,input().split())
a = [input() for item in range(n)]
b = sorted(a)
print(''.join(b)) | [["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 0, 652,... | 5 | 70 |
#include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int N, L;
while (cin >> N >> L) {
vector<string> words;
for (int i = 0; i < N && cin >> words[i]; i++)
;
sort(wor... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int N, L;
cin >> N >> L;
vector<string> words(N);
for (int i = 0; i < N && cin >> words[i]; i++)
;
sort(words.begin(), wo... | [["-", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["-", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 43, 49, 53, 54, 55, 0, 24], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 8, 9, 0, 43, 49, 5... | 1 | 125 |
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define ll long lo... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define ll long lo... | [["-", 0, 30, 0, 14, 8, 9, 0, 171, 0, 184], ["-", 0, 30, 0, 14, 8, 9, 0, 171, 141, 22], ["-", 8, 9, 0, 171, 0, 1, 0, 2, 63, 22], ["-", 0, 171, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 171, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 171, 0, 1, 0, 2, 3, 4, 0, 2... | 1 | 190 |
n,l = map(int,input().split())
s = input() for i in range(n)
print(*stored(s),sep="")
| n,l = map(int,input().split())
s = sorted([input() for i in range(n)])
print(*s,sep="")
| [["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 662, 12, 652, 3, 4, 0, 658, 0, 70], ["+", 0, 658, 0, 659, 12, 652, 3, 4, 0, 25], ["+", 0, 662, 12, 652, 3, 4, 0, 658, 0, 73], ["-", 0, 652, 3, 4, 0, 652, 63, 661, 0, 22], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["-", 0,... | 5 | 41 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
type... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
type... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0... | 1 | 255 |
info = input().split()
lst = []
for i in range(int(info[0])):
lst.append(str(input()))
lst = sorted(lst)
print(lst) | info = input().split()
lst = []
for i in range(int(info[0])):
lst.append(str(input()))
lst = "".join(sorted(lst))
print((lst)) | [["+", 0, 662, 12, 652, 63, 319, 500, 557, 0, 654], ["+", 0, 662, 12, 652, 63, 319, 500, 557, 0, 655], ["+", 0, 1, 0, 662, 12, 652, 63, 319, 0, 131], ["+", 0, 1, 0, 662, 12, 652, 63, 319, 319, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["+", 0, 1, 0, 652, 3, 4, 0, 23, 0, ... | 5 | 48 |
n,l = map(int,input().split())
s = []
for i in range(n):
s.append(input())
sorted(s)
print(''.join(s)) | n,l = map(int,input().split())
s = []
g = []
for i in range(n):
s.append(input())
g = sorted(s)
print(''.join(g)) | [["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["+", 0, 656, 0, 1, 0, 662, 12, 634, 0, 70], ["+", 0, 656, 0, 1, 0, 662, 12, 634, 0, 73], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22]] | 5 | 50 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, n;
cin >> l >> n;
string s1, s2 = "";
string mood[l];
for (int i = 0; i < l; i++) {
cin >> s1;
sort(s1.begin(), s1.end());
mood[i] = s1;
}
sort(mood, mood + l);
for (int i = 0; i < l; i++) {
s2 += mood[i];
}
cout << s2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, n;
cin >> l >> n;
string s1, s2 = "";
string mood[l];
for (int i = 0; i < l; i++) {
cin >> s1;
mood[i] = s1;
}
sort(mood, mood + l);
for (int i = 0; i < l; i++) {
s2 += mood[i];
}
cout << s2;
}
| [["-", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 17, 131], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21],... | 1 | 115 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
struct Node {
char s[1010];
};
int L;
int cmp1(Node a, Node b) {
for (int i = 0; i < L; i++) {
if (a.s[i] == b.s[i])
i++;
else
return a.s[i] < b.s[i];
}
return 0;
}
int main() {
Node a[1010];... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
struct Node {
char s[1010];
};
int L;
int n;
int cmp(Node a, Node b) { return strcmp(a.s, b.s) < 0; }
int cmp1(Node a, Node b) {
for (int i = 0; i < L; i++) {
if (a.s[i] == b.s[i])
i++;
else
return... | [["+", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 49, 53, 49, 22], ["+", 0, 30, 0, 14, 49, 53, 54, 55, 0, 24], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 49, 22], ["+", ... | 1 | 196 |
#include <stdio.h>
#include <string.h>
int main() {
int n, l, i, j, k;
char s[200][200];
char temp[200];
scanf("%d %d", &n, &l);
getchar();
for (i = 0; i < n; i++)
scanf("%s", s[i]);
for (i = 0; i < n - 1; i++)
for (j = i + 1; j < n; j++)
for (k = 0; k < l; k++)
if (s[i][k] > s[j][k]... | #include <stdio.h>
#include <string.h>
int main() {
int n, l, i, j, k;
char s[200][200];
char temp[200];
scanf("%d %d", &n, &l);
getchar();
for (i = 0; i < n; i++)
scanf("%s", s[i]);
for (i = 0; i < n - 1; i++)
for (j = i + 1; j < n; j++)
if (strcmp(s[i], s[j]) > 0) {
strcpy(temp, s[... | [["-", 8, 9, 0, 7, 8, 7, 8, 7, 0, 88], ["-", 8, 9, 0, 7, 8, 7, 8, 7, 0, 24], ["-", 0, 7, 8, 7, 8, 7, 10, 11, 31, 22], ["-", 0, 7, 8, 7, 8, 7, 10, 11, 17, 32], ["-", 0, 7, 8, 7, 8, 7, 10, 11, 12, 13], ["-", 8, 9, 0, 7, 8, 7, 8, 7, 0, 35], ["-", 0, 7, 8, 7, 8, 7, 15, 16, 31, 22], ["-", 0, 7, 8, 7, 8, 7, 15, 16, 17, 18], ... | 0 | 213 |
n,l=map(int,input().split())
s=[int(input()) for _ in range(n)]
s.sort()
print(i for i in s,end="") | n,l=map(int,input().split())
s=[input() for _ in range(n)]
s.sort()
print(*s,sep="") | [["-", 0, 1, 0, 662, 12, 658, 8, 652, 63, 22], ["-", 0, 662, 12, 658, 8, 652, 3, 4, 0, 24], ["-", 0, 662, 12, 658, 8, 652, 3, 4, 0, 25], ["-", 0, 656, 0, 1, 0, 652, 3, 668, 8, 22], ["-", 0, 1, 0, 652, 3, 668, 0, 659, 0, 88], ["-", 0, 1, 0, 652, 3, 668, 0, 659, 31, 22], ["-", 0, 1, 0, 652, 3, 668, 0, 659, 0, 267], ["+",... | 5 | 51 |
#include <stdio.h>
#include <string.h>
char c[103][103];
char copy[103];
int n, l;
int main() {
scanf("%d %d", &n, &l);
for (int i = 1; i <= n; i++) {
scanf("%s", c[i]);
for (int j = 1; j < i; j++) {
if (strcmp(c[j], c[i]) > 0) {
strcpy(copy, c[i]);
strcpy(c[i], c[j]);
strcpy(... | #include <stdio.h>
#include <string.h>
char c[103][103];
char copy[103];
int n, l;
int main() {
scanf("%d %d", &n, &l);
for (int i = 1; i <= n; i++) { //正在放第i张牌
scanf("%s", c[i]);
for (int j = 1; j < i; j++) { //打算放在j位置
if (strcmp(c[j], c[i]) > 0) {
strcpy(copy, c[i]);
for (int k = i;... | [["+", 8, 9, 0, 57, 64, 9, 0, 7, 0, 88], ["+", 8, 9, 0, 57, 64, 9, 0, 7, 0, 24], ["+", 0, 57, 64, 9, 0, 7, 10, 43, 39, 40], ["+", 64, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["+", 64, 9, 0, 7, 10, 43, 49, 50, 0, 32], ["+", 64, 9, 0, 7, 10, 43, 49, 50, 51, 22], ["+", 0, 57, 64, 9, 0, 7, 10, 43, 0, 35], ["+", 0, 57, 64, 9, 0, ... | 0 | 169 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string s[100];
for (int i = 0; i < a; i++) {
cin >> s[i];
}
sort(s, s + b);
for (int i = 0; i < a; i++)
cout << s[i];
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, i;
cin >> a >> b;
string s[100];
for (i = 0; i < a; i++) {
cin >> s[i];
}
sort(s, s + a);
for (i = 0; i < a; i++) {
cout << s[i];
}
return 0;
}
| [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17... | 1 | 89 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string s[100];
for (int i = 0; i < a; i++) {
cin >> s[i];
}
sort(s, s + b);
for (int i = 0; i < a; i++)
cout << s[i];
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, i;
cin >> a >> b;
string s[a];
for (i = 0; i < a; i++)
cin >> s[i];
sort(s, s + a);
for (i = 0; i < a; i++)
cout << s[i];
return 0;
}
| [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 1, 0, 2, 3, 4, 0, 16,... | 1 | 89 |
import sys
input = sys.stdin.readline
def find_where( List , word ):
for i , list_i in enumerate(List):
if list_i > word:
break
return i
def main():
n , l = map( int, input().split() )
I = []
for i in range(n):
s = str(input())
s = s[:-1]
I.append( s )
... | import sys
input = sys.stdin.readline
def find_where( List , word ):
flag = 1
for i , list_i in enumerate(List):
if list_i > word:
flag = 0
break
return i + flag
def main():
n , l = map( int, input().split() )
I = []
for i in range(n):
s = str(input())
... | [["+", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 12, 612], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 12, 612], ["+", 0, 14, 8, 196, 0, 37, 0, 657, 17, 72], ["+", 0... | 5 | 151 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout << ((f) ? "Yes" : "No") << endl;
#define YORN(f) cout << ((f) ? "YES" : "NO") << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) co... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout << ((f) ? "Yes" : "No") << endl;
#define YORN(f) cout << ((f) ? "YES" : "NO") << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) co... | [["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 16, 0, 42, 0, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], [... | 1 | 121 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int l, n;
cin >> l >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
rep(i, n) cout << s[i];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, l;
cin >> n >> l;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
rep(i, n) cout << s[i];
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0... | 1 | 85 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int l, n;
cin >> l >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
string min;
rep(i, n) min += s[i];
cout << min << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, l;
cin >> n >> l;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
string min;
rep(i, n) min += s[i];
cout << min << endl;
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0... | 1 | 94 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int L, N;
string s;
vector<string> S;
int main() {
cin >> N >> L;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
S.push_back(s);
}
sort(S.begin(), S.end());
for (int i = 0; i < N;... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int L, N;
string s;
vector<string> S;
int main() {
cin >> N >> L;
for (int i = 0; i < N; i++) {
cin >> s;
S.push_back(s);
}
sort(S.begin(), S.end());
for (int i = 0; i < N; i++)
cout << S.at(i);
c... | [["-", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 17, 131], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21],... | 1 | 125 |
#pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void ... | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void ... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 118, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 118, 17, 131], ["+", 0, 1, 0, 2, 3, 4, 0, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], [... | 1 | 342 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
#define dump(x) cerr << #x << "=" << x << endl
using P = pair<int, int>;
int main() {
int n, l;
cin >> n >> l;
vector<string> s(n);
rep(i, n) {
string tmp;
cin >> tmp;
sort(tmp.begin(),... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
#define dump(x) cerr << #x << "=" << x << endl
using P = pair<int, int>;
int main() {
int n, l;
cin >> n >> l;
vector<string> s(n);
rep(i, n) {
string tmp;
cin >> tmp;
// sort(tmp.begin... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 17, 131], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21]... | 1 | 144 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, L;
long long i, j = 0;
cin >> N >> L;
string vec[N];
for (i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec, vec + N, greater<string>());
for (i = 0; i < N; i++)
cout << vec[i];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, L;
long long i, j = 0;
cin >> N >> L;
string vec[N];
for (i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec, vec + N);
for (i = 0; i < N; i++)
cout << vec[i];
}
| [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 2, 3, 4, 0, 2, 63, 346, 141, 22], ["-", 3, 4, 0, 2, 63, 346, 3, 347, 0, 18], ["-", 0, 2, 63, 346, 3, 347, 0, 77, 39, 78], ["-", 3, 4, 0, 2, 63, 346, 3, 347, 0, 47], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25]] | 1 | 96 |
#!/usr/bin/env python3
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
N, l = map(int,input().split())
s = []
for i in range(N):
s.append(input())
s_sorted = sorte... | #!/usr/bin/env python3
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
N, l = map(int,input().split())
s = []
for i in range(N):
s.append(input())
s_sorted = sorte... | [["-", 0, 656, 0, 14, 8, 196, 0, 7, 0, 88], ["-", 0, 656, 0, 14, 8, 196, 0, 7, 31, 22], ["-", 0, 656, 0, 14, 8, 196, 0, 7, 0, 267], ["-", 0, 14, 8, 196, 0, 7, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 63, 319, 0, 131], ["+", 0, 1, 0, 662, 12, 652, 63, 319, 319, 22], ["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 22], ["+",... | 5 | 81 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
vector<string> s;
int N, L;
string curr, out = "";
cin >> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
vector<string> s;
int N, L;
string curr, out = "";
cin >> ... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["-", 0, 338, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 44], ["-", 8, 9, 0, 338, 8, 9, 0, 1, 0, 35]] | 1 | 149 |
#include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
long long mod = 998244353;
vector<long long> fact(1000001);
vector<long long> invFact(1000001);
long long binpow(long... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
long long mod = 998244353;
vector<long long> fact(1000001);
vector<long long> invFact(1000001);
long long binpow(long... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 57, 0, 121], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 7... | 1 | 1,316 |
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, n;
cin >> n >> l;
vector<string> s(n);
sort(s.begin(), s.end());
rep(i, n) { cout << s[i]; }
return 0;
} | #define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, n;
cin >> n >> l;
vector<string> s(n);
rep(i, n) { cin >> s[i]; }
sort(s.begin(), s.end());
rep(i, n) { cout << s[i]; }
return 0;
} | [["+", 0, 14, 8, 9, 0, 14, 49, 53, 49, 22], ["+", 8, 9, 0, 14, 49, 53, 54, 55, 0, 24], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 8, 9, 0, 14, 49, 53, 54, 55, 0, 21], ["+", 8, 9, 0, 14, 49, 53, 54, 55, 0, 25], ["+", 0, 14, 8, 9, 0, 14, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0,... | 1 | 79 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n = 0;
ll l;
cin >> l;
cin >> n;
string s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s, s + n);
for (int i = 0; i < n; i++)
cout << s[i];
cout << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
ll l;
cin >> n;
cin >> l;
string s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s, s + n);
for (int i = 0; i < n; i++)
cout << s[i];
return 0;
}
| [["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 7, 8, 1, 0, 35], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 16, 12, 5... | 1 | 97 |
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n, l;
string t;
map<string, int> M;
map<string, int>::iterator it;
scanf("%d %d", &n, &l);
for (int i = 0; i < n; ++i) {
cin >> t;
M[t] = i;
}
t.resize(0);
for (it = M.begin(); it !=... | #include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n, l;
string t;
map<string, int> M;
map<string, int>::iterator it;
scanf("%d %d", &n, &l);
for (int i = 0; i < n; ++i) {
cin >> t;
M[t]++;
}
t.resize(0);
for (it = M.begin(); it != M... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 7, 8, 9, 0, 7, 0, 88], ["+", 8, 9, 0, 7, 8, 9, 0, 7, 0, 24], ["+", 0, 7, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 0, 32... | 1 | 131 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, num;
cin >> N >> L;
vector<string> vec(N);
vector<int> order(N);
for (int i = 0; i < N; i++)
cin >> vec.at(i);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
num = 0;
if (vec.at(i) > vec.at(j))
num... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, num;
cin >> N >> L;
vector<string> vec(N);
vector<int> order(N);
for (int i = 0; i < N; i++)
cin >> vec.at(i);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (vec.at(i) > vec.at(j))
num++;
}
o... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 188 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
string A[110];
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A, A + N, greater<string>());
for (int j = 0; j < N; j++) {
cout << A[j];
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
string A[110];
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A, A + N);
for (int j = 0; j < N; j++) {
cout << A[j];
}
cout << endl;
}
| [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 2, 3, 4, 0, 2, 63, 346, 141, 22], ["-", 3, 4, 0, 2, 63, 346, 3, 347, 0, 18], ["-", 0, 2, 63, 346, 3, 347, 0, 77, 39, 78], ["-", 3, 4, 0, 2, 63, 346, 3, 347, 0, 47], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25]] | 1 | 93 |
n, l = (int(i) for i in input().split())
s = ["".join(sorted(input())) for i in range(n)]
s.sort()
print("".join(s)) | n, l = (int(i) for i in input().split())
s = [input() for i in range(n)]
s.sort()
print("".join(s)) | [["-", 12, 658, 8, 652, 63, 319, 500, 557, 0, 654], ["-", 12, 658, 8, 652, 63, 319, 500, 557, 0, 655], ["-", 0, 662, 12, 658, 8, 652, 63, 319, 0, 131], ["-", 0, 662, 12, 658, 8, 652, 63, 319, 319, 22], ["-", 0, 662, 12, 658, 8, 652, 3, 4, 0, 24], ["-", 12, 658, 8, 652, 3, 4, 0, 652, 63, 22], ["-", 8, 652, 3, 4, 0, 652,... | 5 | 58 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define INF (int)1e8
#define EPS 1e-9
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
int main() {
int N, L;
cin >> N >> L;
vs s(N);
rep(i, N) ci... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define INF (int)1e8
#define EPS 1e-9
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
int main() {
int N, L;
cin >> N >> L;
vs s(N);
rep(i, N) ci... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 3, 4,... | 1 | 138 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
cin >> t >> n;
vector<string> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
for (int i = 0; i < n; i++) {
cout << vec[i];
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<string> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
for (int i = 0; i < n; i++) {
cout << vec[i];
}
cout << endl;
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0... | 1 | 97 |
def sort(a, n)
for i in 1..n-1
min_index = i
for j in i+1..n
if a[i-1] > a[j-1]
min_index = j
end
end
if min_index != i
a[i-1], a[min_index-1] = a[min_index-1], a[i-1]
end
end
a
end
n,l = gets.chomp.split(" ").map(&:to_i)
a = []
for i in 1..n
s = gets.chomp.to_... | def sort(a, n)
for i in 0..n-2
min_index = i
for j in i+1..n-1
if a[min_index] > a[j]
min_index = j
end
end
if min_index != i
a[i], a[min_index] = a[min_index], a[i]
end
end
a
end
n,l = gets.chomp.split(" ").map(&:to_i)
a = []
for i in 1..n
s = gets.chomp.to_s
... | [["-", 8, 736, 0, 88, 51, 267, 0, 475, 756, 612], ["+", 8, 736, 0, 88, 51, 267, 0, 475, 756, 612], ["-", 0, 88, 51, 267, 0, 475, 444, 738, 12, 612], ["+", 0, 88, 51, 267, 0, 475, 444, 738, 12, 612], ["+", 0, 88, 51, 267, 0, 475, 444, 738, 17, 33], ["-", 0, 121, 15, 738, 31, 742, 0, 738, 31, 22], ["-", 0, 121, 15, 738, ... | 4 | 146 |
#include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define fs fir... | #include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define fs fir... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["+... | 1 | 218 |
N,L = map(int,input().split())
li = []
for i in range(N):
li.append("".join(sorted(input())))
li.sort()
print("".join(li)) | N,L = map(int,input().split())
li = []
for i in range(N):
li.append(input())
li.sort()
print("".join(li)) | [["-", 3, 4, 0, 652, 63, 319, 500, 557, 0, 654], ["-", 3, 4, 0, 652, 63, 319, 500, 557, 0, 655], ["-", 0, 652, 3, 4, 0, 652, 63, 319, 0, 131], ["-", 0, 652, 3, 4, 0, 652, 63, 319, 319, 22], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["-", 3, 4, 0, 652, 3, 4, 0, 652, 63, 22], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 60 |
num = input().split()
str = [input()]
strc = ''
flg = 0
res = ''
for i in range(int(num[0])-1):
# print(1)
strc = input()
for j in range(len(str)):
if str[j] < strc:
# print(2)
flg = 0
else:
# print(3)
flg = j
if flg == 0:
str.append(strc)
else:
str.insert(j,strc)
for x in str:
res += x
print(res... | num = input().split()
str = [input()]
strc = ''
flg = 0
res = ''
for i in range(int(num[0])-1):
# print(1)
strc = input()
for j in range(len(str)):
if str[j] < strc:
# print(2)
flg = 0
else:
# print(3)
flg = j
break
j += 1
flg = -1
if flg == 0:
str.append(strc)
else:
str.insert(j,strc)
# pri... | [["+", 0, 57, 75, 76, 8, 196, 0, 93, 0, 94], ["+", 0, 7, 8, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 677, 17, 107], ["+", 0, 7, 8, 196, 0, 1, 0, 677, 12, 612], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 8, 196, 0, 1, 0, 662, 12, 664, 17, 33], ["+", 8, 196,... | 5 | 111 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<string> s;
int n, l = 0;
string g = "";
cin >> n >> l;
for (int h = 0; h < n; h++) {
cin >> g;
s[h] = g;
}
sort(s.begin(), s.end());
for (int t = 0; t < 3; t++) {
s[t];
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<string> s;
int n, l = 0;
string g = "";
cin >> n >> l;
for (int h = 0; h < n; h++) {
cin >> g;
s.push_back(g);
}
sort(s.begin(), s.end());
for (int o = 0; o < n; o++) {
cout << s[o];
}
} | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 70], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 73], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0... | 1 | 100 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define int ll
#define double long double
#define YES cout << "YES" << '\n'
#define NO cout << "NO" << '\n'
#define Yes cout << "Yes" << '\n'
#define No cout << "No" << '\n'
#define yes cout << "yes" << '\n'
#define n... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define int ll
#define double long double
#define YES cout << "YES" << '\n'
#define NO cout << "NO" << '\n'
#define Yes cout << "Yes" << '\n'
#define No cout << "No" << '\n'
#define yes cout << "yes" << '\n'
#define n... | [["-", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["-", 8, 9, 0, 43, 39, 344, 3, 347, 0, 18], ["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 78], ["-", 8, 9, 0, 43, 39, 344, 3, 347, 0, 47], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 14, 8, 9, 0, 43, 49, 53, 49, 22], ["+", 8, 9, 0... | 1 | 1,453 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) ... | [["+", 8, 9, 0, 9, 0, 43, 39, 344, 141, 78], ["+", 0, 9, 0, 43, 39, 344, 3, 347, 0, 18], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 78], ["+", 0, 9, 0, 43, 39, 344, 3, 347, 0, 47], ["+", 0, 14, 8, 9, 0, 9, 0, 43, 49, 22], ["+", 0, 14, 8, 9, 0, 9, 0, 43, 0, 35], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, ... | 1 | 329 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, n;
cin >> l >> n;
vector<string> ss(n);
cin >> ss.at(0);
for (int i = 1; i < n; i++) {
cin >> ss.at(i);
for (int j = i; j > 0; j--) {
if (ss.at(j).compare(ss.at(j - 1)) <= 0) {
swap(ss.at(j), ss.at(j - 1));
} else {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<string> ss(n);
cin >> ss.at(0);
for (int i = 1; i < n; i++) {
cin >> ss.at(i);
for (int j = i; j > 0; j--) {
if (ss.at(j).compare(ss.at(j - 1)) < 0) {
swap(ss.at(j), ss.at(j - 1));
} else {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0... | 1 | 156 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, n;
cin >> l >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
for (int i = 0; i < n; i++) {
cout << s[i];
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
for (int i = 0; i < n; i++) {
cout << s[i];
}
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0... | 1 | 96 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, l;
cin >> n >> l;
vector<string> s(n);
sort(s.begin(), s.end());
for (auto &e : s)
cout << e;
cout << endl;
}
signed main() {
// while(1)
solve();
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, l;
cin >> n >> l;
vector<string> s(n);
for (auto &e : s)
cin >> e;
sort(s.begin(), s.end());
for (auto &e : s)
cout << e;
cout << endl;
}
signed main() {
// while(1)
solve();
}
| [["+", 0, 30, 0, 14, 8, 9, 0, 338, 0, 88], ["+", 0, 30, 0, 14, 8, 9, 0, 338, 0, 24], ["+", 0, 14, 8, 9, 0, 338, 39, 361, 0, 190], ["+", 0, 14, 8, 9, 0, 338, 49, 352, 0, 67], ["+", 0, 14, 8, 9, 0, 338, 49, 352, 0, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 338, 0, 102], ["+", 0, 30, 0, 14, 8, 9, 0, 338, 12, 22], ["+", 0, 30, 0, ... | 1 | 80 |
#include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; i < (n); ++(i))
#define REP(i, m, n) for (int(i) = (m); (i) <= (n); ++(i))
#define yorn(f) puts((f) ? "Yes" : "No")
#define YORN(f) puts((f) ? "YES" : "NO")
typedef long long ll;
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<string> ... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; i < (n); ++(i))
#define REP(i, m, n) for (int(i) = (m); (i) <= (n); ++(i))
#define yorn(f) puts((f) ? "Yes" : "No")
#define YORN(f) puts((f) ? "YES" : "NO")
typedef long long ll;
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<string> ... | [["-", 0, 14, 8, 9, 0, 14, 49, 53, 49, 22], ["-", 8, 9, 0, 14, 49, 53, 54, 55, 0, 24], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 8, 9, 0, 14, 49, 53, 54, 55, 0, 21], ["-", 8, 9, 0, 14, 49, 53, 54, 55, 0, 25], ["-", 0, 14, 8, 9, 0, 14, 8, 9, 0, 45], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 3, 4, 0, 2, 63, 11... | 1 | 155 |
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <i... | #include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <i... | [["-", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 3, 4, 0, 2, 3, 4, 0, 69, 28, 22], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 7... | 1 | 297 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.