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 <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == 5 || a == 7 && b == 5 || b == 7 && c == 7 ||
c == 5 && a + b + c == 17) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a == 5 || a == 7) && (b == 5 || b == 7) && (c == 5 || c == 7) &&
(a + b + c == 17)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [["+", 51, 16, 31, 16, 31, 16, 31, 23, 0, 24], ["+", 51, 16, 31, 16, 31, 16, 31, 23, 0, 25], ["+", 51, 16, 31, 16, 31, 16, 12, 23, 0, 24], ["+", 51, 16, 31, 16, 31, 16, 12, 23, 0, 25], ["+", 15, 339, 51, 16, 31, 16, 12, 23, 0, 24], ["-", 51, 16, 31, 16, 12, 16, 12, 16, 12, 13], ["+", 31, 16, 12, 23, 0, 16, 31, 16, 12, ... | 1 | 81 |
#include <stdio.h>
int main() {
int A, B, C, seven = 0, five = 0;
if (A == 5) {
five++;
} else if (A == 7) {
seven++;
}
if (B == 5) {
five++;
} else if (B == 7) {
seven++;
}
if (C == 5) {
five++;
} else if (C == 7) {
seven++;
}
if (seven == 1 && five == 2) {
printf... | #include <stdio.h>
int main() {
int A, B, C, seven = 0, five = 0;
scanf("%d%d%d", &A, &B, &C);
if (A == 5) {
five++;
} else if (A == 7) {
seven++;
}
if (B == 5) {
five++;
} else if (B == 7) {
seven++;
}
if (C == 5) {
five++;
} else if (C == 7) {
seven++;
}
if (seven... | [["+", 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], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 3... | 0 | 124 |
A, B, C = map(int, input().split())
five = 0
seven = 0
check = [A, b, C]
for s in check:
if s == 5:
five += 1
if s == 7:
seven += 1
if five == 2 and seven == 1:
print('YES')
else:
print('NO') | a, b, c = map(int, input().split())
five = 0
seven = 0
check = [a, b, c]
for s in check:
if s == 5:
five += 1
if s == 7:
seven += 1
if five == 2 and seven == 1:
print('YES')
else:
print('NO') | [["-", 0, 656, 0, 1, 0, 662, 31, 684, 0, 22], ["+", 0, 656, 0, 1, 0, 662, 31, 684, 0, 22], ["-", 0, 656, 0, 1, 0, 662, 12, 634, 0, 22], ["+", 0, 656, 0, 1, 0, 662, 12, 634, 0, 22]] | 5 | 77 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if ((a == b == 5 && c == 5) || (b == c == 5 && a == 7) ||
(c == a == 5 && b == 7))
printf(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if ((a == 5 && b == 5 && c == 7) || (b == 5 && c == 5 && a == 7) ||
(c == 5 && a == 5 && b =... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 31, 23, 0, 16, 31, 16, 31, 16, 12, 13], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 17, 98], ["-", 31, 16, 31, 23, 0, 16, 12, 16, 12, 13], ["+", 31, 16, 31, 23, 0, 16, 12, 16, 12, 13], ["+", 12, 23, 0, 16, 31, 16, 31, 16, 12, 13], ["+", 31, 16, 1... | 1 | 108 |
input_str = ''.join(list(map(str, input())))
if input_str == '755' or input_str == '575' or input_str == '557':
print('YES')
else:
print('NO') | input_str = ''.join(list(map(str, input())))
if input_str == '7 5 5' or input_str == '5 7 5' or input_str == '5 5 7':
print('YES')
else:
print('NO') | [["-", 15, 679, 31, 679, 31, 666, 0, 557, 0, 6], ["+", 15, 679, 31, 679, 31, 666, 0, 557, 0, 6], ["-", 15, 679, 31, 679, 12, 666, 0, 557, 0, 6], ["+", 15, 679, 31, 679, 12, 666, 0, 557, 0, 6], ["-", 0, 57, 15, 679, 12, 666, 0, 557, 0, 6], ["+", 0, 57, 15, 679, 12, 666, 0, 557, 0, 6]] | 5 | 52 |
a, b, c = map(int, input().split())
if(a==7):
if(b==5 & c==5):
print('YES')
else:
print('NO')
elif(b==7):
if(a==5 & c==5):
print('YES')
else:
print('NO')
elif(c==7):
if(b==5 & a==5):
print('YES')
else:
print('NO') | a, b, c = map(int, input().split())
if(a==7):
if(b==5 and c==5):
print('YES')
else:
print('NO')
elif(b==7):
if(a==5 and c==5):
print('YES')
else:
print('NO')
elif(c==7):
if(b==5 and a==5):
print('YES')
else:
print('NO')
else:
print('NO') | [["-", 0, 57, 15, 23, 0, 666, 0, 657, 17, 67], ["+", 64, 196, 0, 57, 15, 23, 0, 679, 17, 355], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 655], ["+", 64, 196, 0, 1, 0, 652, 3, 4, 0, 25], ["+", 75, 665, 64, 196, 0, 57, 75, 76, 0, 95], ["+", 75, 665, 64, 196, 0, 57, 75, 76, 0, 102], ["+", 75, 76, 8, 196, 0, 1, 0, 652, 63, 22],... | 5 | 114 |
#include <bits/stdc++.h>
#define lld long long int
#define vi vector<int>
#define vlld vector<lld>
#define pb push_back
#define ff first
#define ss second
#define pii pair<int, int>
#define mii map<int, int>
#define vii vector<pii>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
#ifndef ONLINE_J... | #include <bits/stdc++.h>
#define lld long long int
#define vi vector<int>
#define vlld vector<lld>
#define pb push_back
#define ff first
#define ss second
#define pii pair<int, int>
#define mii map<int, int>
#define vii vector<pii>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int x, five =... | [["-", 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 | 157 |
package main
import (
"fmt"
"unicode/utf8"
)
func main() {
var a, b, c string
fmt.Scan(&a, &b, &c)
var fv, sv int
for _, s := range []string{a,b,c} {
if utf8.RuneCountInString(s) == 5 {
fv++
}
if utf8.RuneCountInString(s) == 7 {
sv++
}
}
if fv == 2 && sv == 1 {
... | package main
import (
"fmt"
// "unicode/utf8"
)
func main() {
var a, b, c string
fmt.Scan(&a, &b, &c)
var fv, sv int
for _, s := range []string{a,b,c} {
//if utf8.RuneCountInString(s) == 5 {
if s == "5" {
fv++
}
if s == "7" {
sv++
}
}
if fv == 2 && sv == 1 {
... | [["-", 0, 454, 0, 455, 0, 458, 136, 429, 0, 62], ["-", 36, 36, 0, 434, 0, 454, 0, 455, 0, 165], ["-", 0, 57, 15, 16, 31, 2, 63, 438, 439, 22], ["-", 0, 57, 15, 16, 31, 2, 63, 438, 0, 131], ["-", 0, 57, 15, 16, 31, 2, 63, 438, 119, 120], ["-", 0, 57, 15, 16, 31, 2, 3, 4, 0, 24], ["-", 0, 57, 15, 16, 31, 2, 3, 4, 0, 25],... | 7 | 130 |
i = input
sarr = i.split ' '
sarr = sarr.reject {|item| item == '5' }
last = sarr[0] if sarr.len == 1
puts 'YES' if last == '7'
puts 'NO' if last != '7'
| i = readlines()
sarr = i[0].split ' '
sarr = sarr.reject {|item| item == '5' }
last = sarr[0] if sarr.length == 1
puts 'YES' if last == '7'
puts 'NO' if last != '7' | [["-", 36, 36, 36, 36, 0, 493, 0, 662, 12, 22], ["+", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22], ["+", 0, 493, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 493, 0, 662, 12, 652, 3, 4, 0, 25], ["+", 0, 493, 0, 662, 12, 652, 486, 742, 0, 70], ["+", 0, 493, 0, 662, 12, 652, 486, 742, 0, 612], ["+", 0, 493, 0, 662, 12, 652, 486... | 4 | 58 |
a=input()
b=input()
c=input()
w=[a,b,c]
e=w.count('5')
if '5' and '7' not in w:
print ('NO')
elif e==2:
print ('YES')
else:
print ('NO') | a,b,c=input().split()
w=[a,b,c]
e=w.count('5')
if '5' and '7' not in w:
print ('NO')
elif e==2:
print ('YES')
else:
print ('NO') | [["-", 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, 25], ["+", 0, 656, 0, 1, 0, 662, 31, 684, 0, 21], ["+", 0, 656, 0, 1, 0, 662, 31, 684, 0, 22], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 0,... | 5 | 71 |
def solve(a,b,c):
li = [a,b,c]
cf = 0
cs = 0
for i in li:
if i == 5:
cf +=1
if i==7:
cs +=1
if cf == 2 and cs ==1:
return YES
else:
return NO
def readQuestion():
line = sys.stdin.readline().rstrip()
[str_a, str_b, str_c... | import sys
def solve(a,b,c):
li = [a,b,c]
cf = 0
cs = 0
for i in li:
if int(i) == 5:
cf +=1
if int(i) == 7:
cs +=1
if cf == 2 and cs ==1:
return 'YES'
else:
return 'NO'
def readQuestion():
line = sys.stdin.readline().rstri... | [["+", 36, 36, 36, 36, 0, 656, 0, 596, 0, 487], ["+", 36, 36, 0, 656, 0, 596, 141, 673, 0, 22], ["+", 8, 196, 0, 57, 15, 666, 0, 652, 63, 22], ["+", 0, 57, 15, 666, 0, 652, 3, 4, 0, 24], ["+", 0, 57, 15, 666, 0, 652, 3, 4, 0, 25], ["+", 0, 57, 64, 196, 0, 37, 0, 557, 0, 654], ["+", 0, 57, 64, 196, 0, 37, 0, 557, 0, 655... | 5 | 150 |
a=input()
b=[int(i) for i in a]
if(b[0]==5 and b[1]==5 and b[2]==7):
print("YES")
elif(b[1]==5 and b[2]==5 and b[0]==7)
print("YES")
elif(b[2]==5 and b[0]==5 and b[1]==7)
print("YES")
else:
print("NO")
| a=input().strip().split(" ")
b=[int(i) for i in a]
if(b[0]==5 and b[1]==5 and b[2]==7):
print("YES")
elif(b[1]==5 and b[2]==5 and b[0]==7):
print("YES")
elif(b[2]==5 and b[0]==5 and b[1]==7):
print("YES")
else:
print("NO")
| [["+", 12, 652, 63, 319, 500, 652, 63, 319, 0, 131], ["+", 12, 652, 63, 319, 500, 652, 63, 319, 319, 22], ["+", 12, 652, 63, 319, 500, 652, 3, 4, 0, 24], ["+", 12, 652, 63, 319, 500, 652, 3, 4, 0, 25], ["+", 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,... | 5 | 113 |
#include <bits/stdc++.h>
#define REP(i, a, n) for (int i = (a); i < (int)(n); ++i)
#define REPC(i, a, n) for (int i = (a); i <= (int)(n); ++i)
#define ALL(t) t.begin(), t.end()
#define RALL(t) t.rbegin(), t.rend()
#define MATINIT(type, row, col, init) \
vector<vector<type>>(ro... | #include <bits/stdc++.h>
#define REP(i, a, n) for (int i = (a); i < (int)(n); ++i)
#define REPC(i, a, n) for (int i = (a); i <= (int)(n); ++i)
#define ALL(t) t.begin(), t.end()
#define RALL(t) t.rbegin(), t.rend()
#define MATINIT(type, row, col, init) \
vector<vector<type>>(ro... | [["+", 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, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 1... | 1 | 418 |
#include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
#define MOD 1000000007
in... | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
#define MOD 1000000007
in... | [["+", 0, 16, 31, 16, 31, 16, 31, 343, 345, 348], ["+", 0, 16, 31, 16, 31, 16, 31, 343, 0, 349], ["+", 0, 16, 31, 16, 31, 16, 31, 343, 141, 22], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 17, 152], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], [... | 1 | 103 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
int a, b, c;
cin >> a >> b >> c;
bool isOK = false;
if (a == 5) {
if (b == 7 && c == 5 || b == 5 && c == 7) {
isOK = true;
}
} else if (a == 7) {
if (b == 5 && c == 5) {
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
int a, b, c;
cin >> a >> b >> c;
bool isOK = false;
if (a == 5) {
if (b == 7 && c == 5 || b == 5 && c == 7) {
isOK = true;
}
} else if (a == 7) {
if (b == 5 && c == 5) {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 24], ["-", 0, 43, 49, 50, 51, 4, 0, 5, 0, 62], ["-", 0, 43, 49, 50, 51, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 8, 9, 0, 1, 0, 2, 63... | 1 | 133 |
#include <iostream>
using namespace std;
main() {
int A, B, C;
cout << "input three numbers here" << endl;
cin >> A >> B >> C;
cout << A << " " << B << " " << C << endl;
if ((1 <= A && A <= 10) && (1 <= B && B <= 10) && (1 <= C && C <= 10)) {
if ((A == 5 && B == 5 && C == 7) || (A == 5 && B == 7 &&... | #include <iostream>
using namespace std;
main() {
int A, B, C;
// cout << "input three numbers here" << endl;
cin >> A >> B >> C;
// cout << A << " " << B << " " << C << endl;
if ((1 <= A && A <= 10) && (1 <= B && B <= 10) && (1 <= C && C <= 10)) {
if ((A == 5 && B == 5 && C == 7) || (A == 5 && B =... | [["-", 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, 5, 0, 62], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 31, 16, 31, 16, 31, 16... | 1 | 159 |
a, b, c = map(int, input().split())
if a + b + c == 17 && a * b * c == 5 * 5 * 7:
print("YES")
else:
print("NO") | a, b, c = list(map(int, input().split()))
if (a + b + c == 17) and (a * b * c == 5 * 5 * 7):
print("YES")
else:
print("NO") | [["+", 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, 25], ["+", 0, 656, 0, 57, 15, 679, 31, 23, 0, 24], ["-", 0, 656, 0, 57, 15, 666, 0, 657, 17, 67], ["-", 0, 57, 15, 666, 0, 657, 0, 42, 0, 67], ["+", 0, 656, 0, 57, 15, 679, 31, 23, 0, 25], ["+... | 5 | 54 |
#include <iostream>
int main() {
int A, B, C;
std::cin >> A >> B >> C;
if (A != 5 || A != 7 || B != 5 || B != 7 || C != 5 || C != 7 ||
A + B + C != 17)
std::cout << "NO" << std::endl;
else
std::cout << "YES" << std::endl;
return 0;
}
| #include <iostream>
int main() {
int A, B, C;
std::cin >> A >> B >> C;
if ((A != 5 && A != 7) || (B != 5 && B != 7) || (C != 5 && C != 7) ||
A + B + C != 17)
std::cout << "NO" << std::endl;
else
std::cout << "YES" << std::endl;
return 0;
} | [["+", 51, 16, 31, 16, 31, 16, 31, 23, 0, 24], ["-", 31, 16, 31, 16, 31, 16, 31, 16, 17, 106], ["+", 31, 16, 31, 16, 31, 23, 0, 16, 17, 98], ["+", 51, 16, 31, 16, 31, 16, 31, 23, 0, 25], ["+", 51, 16, 31, 16, 31, 16, 12, 23, 0, 24], ["-", 51, 16, 31, 16, 31, 16, 31, 16, 17, 106], ["+", 31, 16, 31, 16, 12, 23, 0, 16, 17... | 1 | 87 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string a[3];
for (i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int a[3];
for (int ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 15, 339, 51, 16, 31, 2, 63, 118, 17, 131], ["-", 15, 339, 51, 16, 31, 2, 63, 118, 119, 120], ["-", 15, 339, 51, 16, 31, 2, 3, 4, 0, 24], ["-", 15, 339, 51, 16, 31, 2, 3, 4, 0, 25]] | 1 | 153 |
sorted_lst=sorted(list(map(int,input().split())))
if so_lst[0]==5 and so_lst[1] == 5 and so_lst[2]==7:
print("YES")
else:
print("NO") | lst=list(map(int,input().split()))
so_lst=sorted(lst)
if so_lst[0]==5 and so_lst[1] == 5 and so_lst[2]==7:
print("YES")
else:
print("NO") | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 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... | 5 | 56 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
if (a == 5 && b == 5 && c == 7 || a == 5 && b == 7 && c == 5 ||
a == 7 && b == 5 && c == 5) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == 5 && b == 5 && c == 7 || a == 5 && b == 7 && c == 5 ||
a == 7 && b == 5 && c == 5) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [["+", 0, 1, 0, 16, 31, 16, 31, 16, 31, 22], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 17, 152], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 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... | 1 | 78 |
l = list(map(int, input().split()))
s = sum(l)
if(s == 17):
if(l[0]==5 or l[0]==7):
if(l[0]+ l[1] == 10 or l[0] +l[1] == 12):
print("Yes")
else:
print("No")
else:
print("No")
else:
print("No") | l = list(map(int, input().split()))
s = sum(l)
if(s == 17):
if(l[0]==5 or l[0]==7):
if(l[0]+ l[1] == 10 or l[0] +l[1] == 12):
print("YES")
else:
print("NO")
else:
print("NO")
else:
print("NO") | [["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6]] | 5 | 104 |
l = [int(i) for i in input().split()]
a = 0
b = 0
for i in range(len(l)):
if l[i] == 5:
a = a + 1
elif l[i] == 7:
b = b + 1
if (a==2 and b ==1):
print("Yes")
else:
print("No") | l = [int(i) for i in input().split()]
a = 0
b = 0
for i in range(len(l)):
if (l[i] == 5):
a = a + 1
elif (l[i]) == 7:
b = b + 1
else:
pass
if (a==2 and b ==1):
print("YES")
else:
print("NO") | [["+", 0, 7, 8, 196, 0, 57, 15, 23, 0, 24], ["+", 0, 7, 8, 196, 0, 57, 15, 23, 0, 25], ["+", 0, 57, 75, 665, 15, 666, 0, 23, 0, 24], ["+", 0, 57, 75, 665, 15, 666, 0, 23, 0, 25], ["+", 0, 7, 8, 196, 0, 57, 75, 76, 0, 95], ["+", 0, 7, 8, 196, 0, 57, 75, 76, 0, 102], ["+", 0, 57, 75, 76, 8, 196, 0, 674, 0, 675], ["-", 0,... | 5 | 86 |
function Main(s) {
// 入力処理
const input = s.split(' ');
// 配列の中に、5が2つ、7が1つ含まれているか判定
const two5 = input.filter(x => x === '5').length === 2;
const one7 = input.filter(x => x === '7').length === 1;
// 出力処理
const result = (two5 && one7) ? 'YES' : 'NO';
console.log(result);
}
Main(require("fs").readFileSy... | function Main(s) {
// 入力処理
const input = s.replace(/\n/g, '').split(' ');
// 配列の中に、5が2つ、7が1つ含まれているか判定
const two5 = input.filter(x => x === '5').length === 2;
const one7 = input.filter(x => x === '7').length === 1;
// 出力処理
const result = (two5 && one7) ? 'YES' : 'NO';
console.log(result);
}
Main(requi... | [["+", 51, 2, 63, 558, 500, 2, 63, 558, 559, 560], ["+", 51, 2, 63, 558, 500, 2, 3, 3, 0, 24], ["+", 63, 558, 500, 2, 3, 3, 0, 575, 0, 85], ["+", 63, 558, 500, 2, 3, 3, 0, 575, 374, 576], ["+", 63, 558, 500, 2, 3, 3, 0, 575, 581, 582], ["+", 51, 2, 63, 558, 500, 2, 3, 3, 0, 21], ["+", 63, 558, 500, 2, 3, 3, 0, 557, 0, ... | 2 | 107 |
import sys
input_line = sys.stdin.readline()
arr = input_line.rstrip().split(" ")
count5 = 0
count7 = 0
for i in arr:
if int(i) == 5:
print(i)
count5 += 1
if int(i) == 7:
print(i)
count7 += 1
if count5 == 2 and count7 == 1:
print("YES")
else:
print("NO")
| import sys
input_line = sys.stdin.readline()
arr = input_line.rstrip().split(" ")
count5 = 0
count7 = 0
for i in arr:
if int(i) == 5:
count5 += 1
if int(i) == 7:
count7 += 1
if count5 == 2 and count7 == 1:
print("YES")
else:
print("NO")
| [["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 89 |
function main(input) {
var arr = [];
var rows = input.split(" ");
rows = rows.sort();
console.log(rows);
if (rows[0] == 5 && rows[1] == 5 && rows[2] == 7) {
console.log("YES");
} else {
console.log("NO");
}
}
main(require("fs").readFileSync("/dev/stdin", "utf8")); | function main(input) {
var arr = [];
var rows = input.split(" ");
rows = rows.sort();
if (rows[0] == 5 && rows[1] == 5 && rows[2] == 7) {
console.log("YES");
} else {
console.log("NO");
}
}
main(require("fs").readFileSync("/dev/stdin", "utf8")); | [["-", 8, 556, 0, 1, 0, 2, 63, 558, 500, 22], ["-", 8, 556, 0, 1, 0, 2, 63, 558, 0, 131], ["-", 8, 556, 0, 1, 0, 2, 63, 558, 559, 560], ["-", 8, 556, 0, 1, 0, 2, 3, 3, 0, 24], ["-", 8, 556, 0, 1, 0, 2, 3, 3, 0, 22], ["-", 8, 556, 0, 1, 0, 2, 3, 3, 0, 25], ["-", 0, 493, 0, 435, 8, 556, 0, 1, 0, 35]] | 2 | 107 |
def is_haiku(s):
nums = s.split()
counts = {x: nums.count(x) for x in nums}
try:
if counts['5'] == 2 and counts['7'] == 1:
print("YES")
finally:
print("NO")
if __name__ == "__main__":
is_haiku(input()) | def is_haiku(s):
nums = s.split()
counts = {x: nums.count(x) for x in nums}
try:
if counts['5'] == 2 and counts['7'] == 1:
print("YES")
else:
print("NO")
except:
print("NO")
if __name__ == "__main__":
is_haiku(input()) | [["-", 0, 14, 8, 196, 0, 246, 0, 542, 0, 543], ["+", 0, 246, 8, 196, 0, 57, 75, 76, 0, 95], ["+", 0, 246, 8, 196, 0, 57, 75, 76, 0, 102], ["+", 75, 76, 8, 196, 0, 1, 0, 652, 63, 22], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 654], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 1,... | 5 | 77 |
#include <iostream>
#define forLoop(i, n) for (int i = 0; i < n; i++)
int countNum(int *nums, int length, int no) {
int res = 0;
forLoop(i, length) {
if (nums[i] == no)
res++;
}
return res;
}
int lengthArray(int *num) { return sizeof(num) / sizeof(int); }
int main(int argc, char **argv) {
int a,... | #include <iostream>
#define forLoop(i, n) for (int i = 0; i < n; i++)
int countNum(int *nums, int length, int no) {
int res = 0;
forLoop(i, length) {
if (nums[i] == no)
res++;
}
return res;
}
int lengthArray(int *num) { return sizeof(num) / sizeof(int); }
int main(int argc, char **argv) {
int a,... | [["-", 31, 16, 31, 16, 31, 16, 31, 343, 345, 348], ["-", 31, 16, 31, 16, 31, 16, 31, 343, 0, 349], ["-", 31, 16, 31, 16, 31, 16, 31, 343, 141, 22], ["-", 0, 16, 31, 16, 31, 16, 31, 16, 17, 151], ["-", 31, 16, 31, 16, 31, 16, 12, 2, 63, 22], ["-", 31, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["-", 31, 16, 31, 16, 12, 2, 3, 4, 0... | 1 | 202 |
# coding: utf-8
# Here your code !
ipt = input().split(" ")
j,k =0,0
for i in [ int(i) for i in ipt]:
if i == 5:
k += 1
elif i==7:
j += 1
print(ipt,i,k,j)
if j == 1 and k == 2:
print("YES")
else:
print("NO") | # coding: utf-8
# Here your code !
ipt = input().split(" ")
j,k =0,0
for i in [ int(i) for i in ipt]:
if i == 5:
k += 1
elif i==7:
j += 1
# print(ipt,i,k,j)
if j == 1 and k == 2:
print("YES")
else:
print("NO") | [["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 21], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 84 |
#include <iostream>
using namespace std;
int A, B, C;
void solve() {
if (A + B + C == 17) {
if ((A == 5 and B == 7) or (A == 7 and B == 5) or (A == 5 and B == 5)) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
}
return;
}
int main() {
cin >> A >> B >> C;
solve();
return 0;
}
| #include <iostream>
using namespace std;
int A, B, C;
void solve() {
if (A + B + C == 17) {
if ((A == 5 and B == 7) or (A == 7 and B == 5) or (A == 5 and B == 5)) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
} else
cout << "NO" << endl;
return;
}
int main() {
cin >> A >> B >>... | [["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 75, 76, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 75, 76, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 57, 75, 76, 0, 1, 0, 16, 17, 151], ["+", 0, 57, 75, 76, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 57,... | 1 | 105 |
a,b,c=map(int,input().split())
sum=a+b+c
g=[5,7]
if a and b and c in g:
if sum==17:
print("Yes")
else:
print("No")
else:
print("No") | a,b,c=map(int,input().split())
sum=a+b+c
g=[5,7]
if a and b and c in g:
if sum==17:
print("YES")
else:
print("NO")
else:
print("NO")
| [["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6]] | 5 | 68 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == 7 && (b == 7 && c == 7)) {
cout << "YES" << endl;
} else if (b == 5 && (a == 7 && c == 7)) {
cout << "YES" << endl;
} else if (c == 5 && (a == 7 && b == 7)) {
cout << "YES" << endl;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == 7 && (b == 5 && c == 5)) {
cout << "YES" << endl;
} else if (b == 7 && (a == 5 && c == 5)) {
cout << "YES" << endl;
} else if (c == 7 && (a == 5 && b == 5)) {
cout << "YES" << endl;
... | [["-", 51, 16, 12, 23, 0, 16, 31, 16, 12, 13], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 12, 13], ["-", 51, 16, 12, 23, 0, 16, 12, 16, 12, 13], ["+", 51, 16, 12, 23, 0, 16, 12, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 123 |
<?php
fscanf(STDIN, "%d %d %d", $a, $b, $c);
$array_string = array($a, $b, $c);
$dem_5 = 0;
$dem_7 = 1;
foreach ($array_string as $string) {
if (in_array(5, $array_string)) {
$dem_5++;
}
if (in_array(5, $array_string)) {
$dem_7++;
}
}
# output
if ($dem_5 == 2 && $dem_7 == 1) {... | <?php
fscanf(STDIN, "%d %d %d", $a, $b, $c);
$array_string = array($a, $b, $c);
$dem_5 = 0;
$dem_7 = 0;
foreach ($array_string as $string) {
if ($string == 5) {
$dem_5++;
}
if ($string == 7) {
$dem_7++;
}
}
# output
if ($dem_5 == 2 && $dem_7 == 1) {
echo " YES\n";
} else... | [["-", 36, 36, 0, 493, 0, 1, 0, 11, 12, 612], ["+", 36, 36, 0, 493, 0, 1, 0, 11, 12, 612], ["-", 8, 9, 0, 57, 15, 23, 0, 613, 63, 141], ["-", 0, 57, 15, 23, 0, 613, 3, 3, 0, 24], ["-", 15, 23, 0, 613, 3, 3, 0, 28, 0, 612], ["-", 0, 57, 15, 23, 0, 613, 3, 3, 0, 21], ["-", 0, 613, 3, 3, 0, 28, 0, 606, 0, 141], ["-", 0, 5... | 6 | 117 |
/*
Thank you for helping me out Endagorion
You have really been an inspiration
I will prove my worth to you
i will return in APRIL
"May God help me in this venture of mine"
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <f... | /*
Thank you for helping me out Endagorion
You have really been an inspiration
I will prove my worth to you
i will return in APRIL
"May God help me in this venture of mine"
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <f... | [["+", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95], ["+", 75, 76, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 75, 76, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 57, 75, 76, 0, 1, 0, 16, 17, 151], ["+", 0, 57, 75, 76, 0, 1, 0, 16, 12, 22], ["+", 64, 9, 0, 5... | 1 | 246 |
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
if ((a + b + c) == 17) {
if (a == 5) {
if (abs(b - c) == 2) {
cout << "YES" << endl;
}
} else if (b == 5) {
if (abs(a - c) == 2) {
cout << "YES" << ... |
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
if ((a + b + c) == 17) {
if (a == 5) {
if (abs(b - c) == 2) {
cout << "YES" << endl;
}
} else if (b == 5) {
if (abs(a - c) == 2) {
cout << "YES" <<... | [["-", 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, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0... | 1 | 157 |
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
bool judge = false;
if (a == 5) {
if (b == 7 && c == 5) {
judge = true;
} else if (b == 5 && c == 7) {
judge = true;
}
} else if (a == 7) {
if (b == 7 && c == 5) {
judge = true;
} els... | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
bool judge = false;
if (a == 5) {
if (b == 7 && c == 5) {
judge = true;
} else if (b == 5 && c == 7) {
judge = true;
}
} else if (a == 7) {
if (b == 5 && c == 5) {
judge = true;
}
}... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["-", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25], ["-", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["-"... | 1 | 139 |
#include <bits/stdc++.h>
#include <iostream>
#include <limits.h>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[3];
int flag = 1;
for (int i = 0; i < 3; i++... | #include <bits/stdc++.h>
#include <iostream>
#include <limits.h>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[3];
int flag = 1;
for (int i = 0; i < 3; i++... | [["+", 0, 7, 8, 1, 0, 11, 31, 69, 28, 22], ["+", 8, 1, 0, 11, 31, 69, 341, 342, 0, 70], ["+", 8, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 8, 1, 0, 11, 31, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 7, 8, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 8, 1, 0, 35], ["+", 0, 30, 0, 14, 8, ... | 1 | 168 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll ans = 0;
string s;
int main() {
vector<int> abc(3);
cin >> abc[0] >> abc[1] >> abc[2];
sort(abc.begin(), abc.end());
i... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
vector<int> abc(3);
cin >> abc[0] >> abc[1] >> abc[2];
sort(abc.begin(), abc.end());
if (abc[0] == 5 && abc[1... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78], ["-", 36, 36, 0, 30, 0, 43, 49, 50, 49, 22], ["-", 36, 36, 0, 30, 0, 43, 49, 50, 0, 32], ["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64,... | 1 | 123 |
count5 = 0
count7 = 0
arr = $stdin.gets.chomp.split(/\s+/)
arr.map do |str|
if str.size == 5
count5 += 1
end
if str.size == 7
count7 += 1
end
end
answer = (count5 == 2 && count7 == 1) ? "YES" : "NO"
puts answer
| count5 = 0
count7 = 0
arr = $stdin.gets.chomp.split(/\s+/).map(&:to_i)
arr.map do |str|
if str == 5
count5 += 1
end
if str == 7
count7 += 1
end
end
answer = (count5 == 2 && count7 == 1) ? "YES" : "NO"
puts answer
| [["+", 36, 36, 0, 493, 0, 662, 12, 652, 17, 131], ["+", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22], ["+", 0, 493, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 662, 12, 652, 3, 4, 0, 752, 0, 67], ["+", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753], ["+", 0, 493, 0, 662, 12, 652, 3, 4, 0, 25], ["-", 8, 736, 0, 121, 15, 738, 31, 652, ... | 4 | 70 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <vector>
#define syosu(x) fixed << setprecision(x)
using namespace std;
using namespace std;
typedef long lon... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <vector>
#define syosu(x) fixed << setprecision(x)
using namespace std;
using namespace std;
typedef long lon... | [["+", 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 | 223 |
import java.util.*;
public class Main {
public static void main(String[] args) {
int f = 0;
int s = 0;
Scanner x = new Scanner(System.in);
for (int i = 0; i < 3; i++) {
if (x.nextInt() == 5)
f++;
else
s++;
}
if (s == 1 && f == 2)
System.out.print("YES");
... | import java.util.*;
public class Main {
public static void main(String[] args) {
int f = 0;
int s = 0;
Scanner x = new Scanner(System.in);
for (int i = 0; i < 3; i++) {
int temp = x.nextInt();
if (temp == 5)
f++;
else if (temp == 7)
s++;
}
if (s == 1 && f == ... | [["-", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["-", 0, 7, 8, 196, 0, 57, 15, 15, 0, 24], ["+", 0, 7, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 7, 8, 196, 0, 503, 49, 200, 141, 22], ["+", 0, 7, 8, 196, 0, 503, 49, 200, 0, 32], ["+", 8, 196, 0, 7, 8, 196, 0, 503, 0, 35], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", ... | 3 | 110 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<string> v(n);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
v.push_back(s);
}
sort(v.begin(), v.end());
string t = "";
for (int i = 0; i < n; i++) {
t += v[i];
}
cout << t << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
vector<string> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
string t = "";
for (int i = 0; i < n; i++) {
t += v[i];
}
cout << t << endl;
}
| [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 78], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 0, 35], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["-", 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... | 1 | 112 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int l, n;
cin >> l >> n;
string a;
vector<string> list;
for (int i = 0; i < n; i++) {
cin >> a;
list.push_back(a);
}
sort(list.begin(), list.end());
for (int i = 0; i < n; i++) {
cout << list.at(i)... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
string a;
vector<string> list;
for (int i = 0; i < n; i++) {
cin >> a;
list.push_back(a);
}
sort(list.begin(), list.end());
for (int i = 0; i < n; i++) {
cout << list.at(i)... | [["-", 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 | 107 |
#include <stdio.h>
#include <string.h>
int main() {
int N, L;
scanf("%d %d", &N, &L);
char temp[N];
char str[N];
int i, j;
for (i = 0; i < N; i++) {
scanf("%s", &str[i]);
}
for (i = 0; i < N - 1; i++) {
for (j = N - 1; j > i; j--) {
if (strcmp(str[j - 1], str[j]) > 0) {
strcpy(t... | #include <stdio.h>
#include <string.h>
int main() {
int n, l;
scanf("%d %d", &n, &l);
char temp[101];
char str[100][101];
int i, j;
for (i = 0; i < n; i++) {
scanf("%s", &str[i]);
}
for (i = 0; i < (n - 1); i++) {
for (j = (n - 1); j > i; j--) {
if (strcmp(str[j - 1], str[j]) > 0) {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 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, 43, 49, 80, 81, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43,... | 0 | 195 |
n, l = map(int, input().split())
sl = []
for i in range(n):
s = input()
sl.append(s)
sl.sort()
"print(sl)
ans = ""
for i in range(n):
ans += sl[i]
print(ans) | n, l = map(int, input().split())
sl = []
for i in range(n):
s = input()
sl.append(s)
sl.sort()
#print(sl)
ans = ""
for i in range(n):
ans += sl[i]
print(ans) | [["-", 36, 36, 36, 36, 0, 656, 0, 42, 0, 654], ["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 71 |
n, l = map(int, input().split())
ll = []
for i in range(n):
ll.append(input())
print(ll)
ll.sort()
print(ll)
ans = ""
for j in ll:
ans += j
print(ans) | n, l = map(int, input().split())
ll = []
for i in range(n):
ll.append(input())
ll.sort()
ans = ""
for j in ll:
ans += j
print(ans) | [["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 65 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
string S[N];
for (int i = 1; i <= N; ++i)
cin >> S[i];
sort(S + 1, S + N + 1);
for (int i = 1; i <= N; ++i)
cout << S[i];
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, L;
cin >> N >> 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];
} | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 88 |
#include <cstdio>
#include <iostream>
using namespace std;
bool judge(string s1, string s2) {
for (int i = 0; i < s1.size(); i++) {
if (s1[i] < s2[i]) {
return true;
}
}
return false;
}
int main(void) {
int N, L;
scanf("%d %d", &N, &L);
string S[100];
for (int i = 0; i < N; i++) {
cin >... | #include <cstdio>
#include <iostream>
using namespace std;
bool judge(string s1, string s2) {
for (int i = 0; i < s1.size(); i++) {
if (s1[i] < s2[i]) {
return true;
} else if (s1[i] > s2[i]) {
return false;
}
}
return false;
}
int main(void) {
int N, L;
scanf("%d %d", &N, &L);
stri... | [["+", 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 | 217 |
n, l = map(int, input().split())
a = []
if n == 1:
print(input())
exit()
for i in range(n):
a.append(input())
a.sort()
print(a[0]) | n, l = map(int, input().split())
a = []
if n == 1:
print(input())
exit()
for i in range(n):
a.append(input())
a.sort()
a = ''.join(a)
print(a) | [["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["+", 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... | 5 | 62 |
#include <algorithm>
#include <bits/stdc++.h>
#include <string>
using namespace std; // std::の省略のため
using ll = long long;
int main() {
int N, L;
string s[N];
cin >> N >> L;
for (int i = 0; i < N; i++)
cin >> s[i];
sort(s, s + N);
string ans = s[0];
for (int i = 1; i < N; i++)
ans += s[i];
... | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
using namespace std; // std::の省略のため
using ll = long long;
int main() {
int N, L;
cin >> N >> L;
string s[N];
for (int i = 0; i < N; i++)
cin >> s[i];
sort(s, s + N);
string ans;
for (int i = 0; i < N; i++)
ans += s[i];
cout <<... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 49, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 0, 70], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 0, 73], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 14, 8, 9, 0, 43... | 1 | 105 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll t, n, item, temp, a, b, c, x, y, z, sum, flag;
string s, s1, s2;
vector<ll> v;
vector<string> vs;
map<ll, ll> mp;
vector<pair<char, ll>> p;
cin >> n >> a;
for (ll i = 0; i < n; i++) {
cin >> s;
p.push_back(m... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll t, n, item, temp, a, b, c, x, y, z, sum, flag;
string s, s1, s2;
vector<ll> v;
vector<string> vs;
map<ll, ll> mp;
vector<pair<char, ll>> p;
cin >> n >> a;
for (ll i = 0; i < n; i++) {
cin >> s;
p.push_back(m... | [["-", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 1, 0, 11, 12, 118, 28, 69, 28, 22], ["-", 0, 11, 12, 118, 28, 69, 341, 342, 0, 70], ["-", 0, 11, 12, 118, 28, 69, 341, 342, 0, 22], ["-", 0, 11, 1... | 1 | 188 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, L;
cin >> N >> L;
vector<string> S(N, "");
for (int i = 0; i < N; ++i) {
string tmp;
cin >> tmp;
S[i] = tmp;
}
/*
if(N == 1)
{
cout << S[0] << endl;
return 0;
}
*/
auto f = [L]... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, L;
cin >> N >> L;
vector<string> S(N, "");
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
auto f = [L](const string &a, const string &b) {
for (int i = 0; i < L; ++i) {
if (a[i] < b[i])
return true;
else if ... | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 78], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 0, 35], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 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, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-"... | 1 | 186 |
#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[N];
}
sort(vec.begin(), vec.end());
string S;
for (int j = 0; j < N; j++) {
S += vec[j];
}
cout << S << 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.at(i);
}
sort(vec.begin(), vec.end());
string S;
for (int j = 0; j < N; j++) {
S += vec.at(j);
}
cout << S << endl;
}
| [["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 70], ["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 73], ["+", 0, 1, 0, 16, 12, 2, 63, 118, 17, 131], ["+", 0, 1, 0, 16, 12, 2, 63, 118, 119, 120], ["+", 0, 1, 0, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 16, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0... | 1 | 102 |
#include <algorithm> // ソート
#include <iostream> // Cでいうstdio.h 標準入出力ライブラリ
#include <vector> // 可変長配列
using namespace std; // 名前空間
int main(void) {
// int変数定義
int num1, num2;
// コンソール入力
cin >> num1, cin >> num2;
// 配列定義
vector<string> strvec(num1);
cout << "before:";
// num1(N)の文だけループし、文字列(L)を標準入力... | #include <algorithm> // ソート
#include <iostream> // Cでいうstdio.h 標準入出力ライブラリ
#include <vector> // 可変長配列
using namespace std; // 名前空間
int main(void) {
// int変数定義
int num1, num2;
// コンソール入力
cin >> num1, cin >> num2;
// 配列定義
vector<string> strvec(num1);
// cout << "before:";
// num1(N)の文だけループし、文字列(L)を標... | [["-", 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, 0, 6], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 16, 12, 69, 28,... | 1 | 133 |
#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];
}
cout << endl;
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];
}
cout << 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 | 98 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cout << "S" << i << " = ";
cin >> s[i];
}
vector<int> c(N);
for (int i = 0; i < N; i++) {
c[i] = 0;
for (int j = 0; j < ... | #include <iostream>
#include <string>
#include <vector>
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];
}
vector<int> c(N);
for (int i = 0; i < N; i++) {
c[i] = 0;
for (int j = 0; j < N; j++) {
if (j == i)
... | [["-", 0, 1, 0, 16, 31, 16, 31, 16, 31, 22], ["-", 0, 1, 0, 16, 31, 16, 31, 16, 17, 151], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 1,... | 1 | 206 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cout << "S" << i << " = ";
cin >> s[i];
}
int c[100];
for (int i = 0; i < N; i++) {
c[i] = 0;
for (int j = 0; j < N; j++... |
#include <iostream>
#include <string>
#include <vector>
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];
}
vector<int> c(N);
for (int i = 0; i < N; i++) {
c[i] = 0;
for (int j = 0; j < N; j++) {
if (j == i)
... | [["-", 0, 1, 0, 16, 31, 16, 31, 16, 31, 22], ["-", 0, 1, 0, 16, 31, 16, 31, 16, 17, 151], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 1,... | 1 | 212 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, L;
vector<string> S(110);
cin >> N >> L;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
sort(S.begin(), S.end());
string Smin = "";
for (int i = 0; i < N; i++) {
Smin = Smin + S[i... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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());
string Smin = "";
for (int i = 0; i < N; i++) {
Smin = Smin + S[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 | 113 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
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];
}
} | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
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, 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 |
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <limits>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
string ans = "";
vector<string> vec(N);
for (int i = 0; i < N; i++)
cin >> vec[i];
sort(vec.begin(), vec.en... | #include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <limits>
#include <vector>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
string ans = "";
vector<string> vec(N);
for (int i = 0; i < N; i++)
cin >> vec[i];
sort(vec.begin(), vec.en... | [["-", 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, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 3, 4, 0, 2, 63, 118, 28, 69, 28, 22], ["-", 0, 2, 63, 118, 28, 69, 341, 342, 0, 70], ... | 1 | 136 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using PIL = pair<int, LL>;
using PLL = pair<LL, LL>;
// const int mod = 1e9 + 7;
#define mem(a, b) memset(a, b, sizeof(a))
#define REP(i, a) for (int i = 0; i < a; ++i)
#define FOR(i, a, b)... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using PIL = pair<int, LL>;
using PLL = pair<LL, LL>;
// const int mod = 1e9 + 7;
#define mem(a, b) memset(a, b, sizeof(a))
#define REP(i, a) for (int i = 0; i < a; ++i)
#define FOR(i, a, b)... | [["-", 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], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 328 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int L;
string answer;
cin >> N >> L;
vector<string> S(L);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end()); // 昇順にソート
for (int i = 0; i < N; i++) {
answer += S.at(i);
}
cout << answer << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int L;
cin >> N >> L;
vector<string> 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);
}
return 0;
} | [["-", 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], ["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1,... | 1 | 111 |
#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[i].begin(), S[i].end());
}
sort(S.begin(), S.end());
for (int i = 0; i < N; i++) {
cout << S[i] << flush;
}
cout << endl;
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[i].begin(), S[i].end());
}
sort(S.begin(), S.end());
for (int i = 0; i < N; i++) {
cout << S[i] << flush;
}
cout << endl;
return 0... | [["-", 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, 0, 2, 63, 118, 17, 131], ["-", 0, 2, 3,... | 1 | 123 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, l;
cin >> n >> l;
set<string> st;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
st.insert(s);
}
for (auto it = st.begin(); it != st.end(); ++it) {
cout << *it;
}
cout << '\n... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, l;
cin >> n >> l;
vector<string> st;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
st.push_back(s);
}
sort(st.begin(), st.end());
for (auto it = st.begin(); it != st.end(); ++it) ... | [["-", 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, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["+", 0, 2, 3, 4, 0, ... | 1 | 111 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, N, L;
cin >> N >> L;
vector<string> S;
for (i = 0; i < N; i++) {
cin >> S[i];
}
sort(S.begin(), S.end());
for (i = 0; i < N; i++) {
cout << S[i];
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int i, N, L;
cin >> N >> L;
string S[101];
for (i = 0; i < N; i++) {
cin >> S[i];
}
sort(S, S + N);
for (i = 0; i < N; i++) {
cout << S[i];
}
cout << endl;
}
| [["-", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["-", 8, 9, 0, 43, 39, 344, 3, 347, 0, 18], ["-", 8, 9, 0, 43, 39, 344, 3, 347, 0, 47], ["+", 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, 43, 49, 80, 0, 73], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 17, 131], ["-", 0, 2, 3, 4... | 1 | 94 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define INT_MAX implementation - defined
using namespace std;
int main() {
int n, l;
cout << "n,lの入力" << endl;
cin >> n >> l;
vector<string> s(n);
cout << "stringの入力" << endl;
for (int i = 0; i <... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
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]... | [["-", 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], ["-", 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, 5, 0, 62], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 14, 8,... | 1 | 122 |
package main
import (
"bufio"
"fmt"
"os"
"sort"
"strconv"
)
const mod = 1000000007
// 1MB
const ioBufferSize = 1 * 1024 * 1024
var sc = func() *bufio.Scanner {
sc := bufio.NewScanner(os.Stdin)
sc.Buffer(make([]byte, ioBufferSize), ioBufferSize)
sc.Split(bufio.ScanWords)
return sc
}()
func next() string {
... | package main
import (
"bufio"
"fmt"
"os"
"sort"
"strconv"
)
const mod = 1000000007
// 1MB
const ioBufferSize = 1 * 1024 * 1024
var sc = func() *bufio.Scanner {
sc := bufio.NewScanner(os.Stdin)
sc.Buffer(make([]byte, ioBufferSize), ioBufferSize)
sc.Split(bufio.ScanWords)
return sc
}()
func next() string {
... | [["-", 0, 435, 8, 196, 0, 431, 31, 432, 0, 22], ["+", 0, 435, 8, 196, 0, 431, 31, 432, 0, 22], ["-", 8, 196, 0, 431, 12, 432, 0, 2, 63, 22], ["-", 0, 431, 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 | 271 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
int n, l;
bool comp(string a, string b) {
for (int i = 0; i < l; i++) {
if (a[i] < b[i])
return true;
else
return false;
}
return false;
}
int mai... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
int n, l;
bool comp(string a, string b) {
for (int i = 0; i < l; i++) {
if (a[i] < b[i])
return true;
else
return false;
}
return false;
}
int mai... | [["-", 0, 57, 15, 339, 51, 91, 28, 2, 63, 22], ["+", 0, 57, 15, 339, 51, 91, 28, 2, 63, 22], ["+", 15, 339, 51, 91, 28, 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]... | 1 | 247 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int N, L;
ostringstream os;
cin >> N >> L;
vector<string> S(N);
for (int i = 0; i < N; ++i) {
cin >> S.at(i);
cout << S.at(i) << endl;
}
sort(S.begin(), S.end());
copy(S.begin(), S.end(), ostream_iterator<string>(os));
... | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int N, L;
ostringstream os;
cin >> N >> L;
vector<string> S(N);
for (int i = 0; i < N; ++i) {
cin >> S.at(i);
}
sort(S.begin(), S.end());
copy(S.begin(), S.end(), ostream_iterator<string>(os));
cout << os.str() << endl;
}... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-", 0, 16, 31, 16, 12, 2, 63, 118, 28, 22], ["-", 0, 16, 31, 16, 12, 2, 63, 118, 17, 131], ["-", 0, 16, 31, 16, 12, 2, 63, 118, 119, 120], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 22], ["-", 0, ... | 1 | 121 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORS(i, a, b, c) for (int i = a; i < b; i += c)
#define FORN(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a - 1; i >= b; i--)
#define FORE(i, b) for (auto &i : b)
#define REP(i, b) FOR(i,... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORS(i, a, b, c) for (int i = a; i < b; i += c)
#define FORN(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a - 1; i >= b; i--)
#define FORE(i, b) for (auto &i : b)
#define REP(i, b) FOR(i,... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 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, 44], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 42, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 1,349 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
int n, l;
vector<string> s(n);
cin >> n >> l;
rep(i, n) cin >> s[i];
sort(s.begin(), s.en... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
int n, l;
cin >> n >> l;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.en... | [["+", 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, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 8, 9, 0, 1, 0, 16, 31,... | 1 | 120 |
//インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator>... | //インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator>... | [["-", 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, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 2, 3, 4, 0, 69, 341, 342... | 1 | 246 |
#include <stdio.h>
#include <string.h>
int main(void) {
int n, l;
scanf("%d %d", &n, &l);
char s[200][128];
char tmp[128];
for (int i = 0; i < n; i++) {
scanf("%s", s[i]);
}
for (int i = 0; i < n - 1; i++) {
if (strcmp(s[i], s[i + 1]) > 0) {
strcpy(tmp, s[i]);
strcpy(s[i], s[i + 1])... | #include <stdio.h>
#include <string.h>
int main(void) {
int n, l;
scanf("%d %d", &n, &l);
char s[200][128];
char tmp[128];
for (int i = 0; i < n; i++) {
scanf("%s", s[i]);
}
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (strcmp(s[i], s[j]) > 0) {
strcpy(tm... | [["+", 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], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50,... | 0 | 186 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 100010;
const int MAXM = 100010;
const int MAXINT = 2147483647;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
int n, m, k;
int ans, tot, cnt;
int a[MAXN];
int head[MAXN];
string s[MAXN];
inline int read() {
int s = 0, f ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 100010;
const int MAXM = 100010;
const int MAXINT = 2147483647;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
int n, m, k;
int ans, tot, cnt;
int a[MAXN];
int head[MAXN];
string s[MAXN];
inline int read() {
int s = 0, f ... | [["-", 8, 9, 0, 1, 0, 2, 63, 343, 345, 348], ["-", 8, 9, 0, 1, 0, 2, 63, 343, 0, 349], ["-", 8, 9, 0, 1, 0, 2, 63, 343, 141, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 147], ["-", 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, 2, 63, ... | 1 | 359 |
N, L =list(map(int, input().split()))
array = []
word = ""
for i in range(N):
s = input()
array.append(s)
print(array)
new_array = sorted(array)
print(new_array)
for j in range(N):
word += new_array[j]
print(word) | N, L =list(map(int, input().split()))
array = []
word = ""
for i in range(N):
s = input()
array.append(s)
new_array = sorted(array)
for j in range(N):
word += new_array[j]
print(word)
| [["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25]] | 5 | 78 |
N,L=map(int,input().split())
M=[0]*N
for i in range(N):
M[i]=sorted(list(str(input())))
M.sort()
ans=''
for i in range(N):
for j in range(L):
ans+=M[i][j]
print(ans) | N,L=map(int,input().split())
M=[0]*N
for i in range(N):
M[i]=str(input())
M.sort()
ans=''
for i in range(N):
ans+=M[i]
print(ans)
| [["-", 8, 196, 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, 652, 63, 22], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["-", 0, 656, 0, 7, 8, 196, 0, 7, 0, 88], ["-", 0, 656, ... | 5 | 86 |
#include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, ... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, ... | [["-", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["+", 0, 14, 8, 9, 0, 43, 39, 344, 141, 78], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["-", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1,... | 1 | 275 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, l;
string str[100], work;
cin >> n >> l;
for (int i = 0; i < n; i++) {
cin >> str[i];
}
for (int i = 0; i < l; i++) {
for (int j = 0; j < n - 1; j++) {
for (int k = 0; k < n - 1 - j; k++) {
if (str[k][i] >... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, l;
string str[100], work;
cin >> n >> l;
for (int i = 0; i < n; i++) {
cin >> str[i];
}
for (int j = 0; j < n - 1; j++) {
for (int k = 0; k < n - 1 - j; k++) {
if (str[k].compare(str[k + 1]) > 0) {
work = ... | [["-", 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, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 30, 0, 14, 8, 9... | 1 | 186 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int N, L;
std::string ans = "";
std::vector<std::string> v;
for (int i = 0; i < N; i++) {
std::cin >> v[i];
}
std::sort(v.begin(), v.end());
for (int i = 0; i < N; i++) {
ans += v[i];
}
std::cout << ans ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int N, L;
std::string ans = "";
std::cin >> N >> L;
std::vector<std::string> v(N, "");
for (int i = 0; i < N; i++) {
std::cin >> v[i];
}
std::sort(v.begin(), v.end());
for (int i = 0; i < N; i++) {
ans += ... | [["+", 0, 1, 0, 16, 31, 16, 31, 343, 141, 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, 14, 8, 9, 0, 43, 39, 343, 345, 348], ["+", 0, 14, 8, 9, ... | 1 | 112 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
string s[N];
for (int i = 0; i < N; i++) {
string _s;
cin >> _s;
sort(_s.begin(), _s.end());
s[i] = _s;
}
sort(s, s + N);
for (int i = 0; i < N; i++) {
cout << s[i];
}
cout << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
string s[N];
for (int i = 0; i < N; i++) {
string _s;
cin >> _s;
// sort(_s.begin(), _s.end());
s[i] = _s;
}
sort(s, s + N);
for (int i = 0; i < N; i++) {
cout << s[i];
}
cout << endl;
return... | [["-", 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 | 113 |
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
void solve(long long N, long long L, std::vector<std::string> S) {
sort(S.begin(), S.end());
REP(i, N)
cout << S[i];
cout << '\n';
}
int main() {
cin.tie(0... | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(long long N, long long L, std::vector<std::string> S) {
sort(S.begin(), S.end());
REP(i, N)
cout << S[i];
cout << '\n';
}
int main() {
cin.tie(0);
ios::sync_with_stdio... | [["-", 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, 112, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 112, 51, 59], ["-", 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,... | 1 | 180 |
#include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long N;
scanf("%lld", &N);
long long L;
scanf("%lld", &L);
std::vector<std::string> S(N);
REP(i, N)
std::... | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
long long N;
scanf("%lld", &N);
long long L;
scanf("%lld", &L);
std::vector<std::string> S(N);
REP(i, N)
... | [["-", 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], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 1, 0, 2, 63, 343, 345... | 1 | 130 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<string> mo(M);
for (int i = 0; i < M; i++)
cin >> mo[i];
sort(mo.begin(), mo.end());
for (int i = 0; i < M; i++)
cout << mo[i];
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<string> mo(N);
for (int i = 0; i < N; i++)
cin >> mo.at(i);
sort(mo.begin(), mo.end());
for (int i = 0; i < N; i++)
cout << mo.at(i);
cout << endl;
return 0;
}
| [["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 1, 0, 16, 12, 69, 341, 342, 0, 70], ["+", 8, 1, 0, 16, 12, 2, 63, 118, 17, 131], ["+", 8, 1, 0, 16, 12, 2, 63, 118, 119, 120], ["+", 8, ... | 1 | 101 |
// struct cmp {bool operator()(const pair<int, char> &a, const pair<int, char>
// &b) {if (a.first == b.first) {return a.second > b.second;} else {return
// a.first > b.first;}}};
#include <bits/stdc++.h>
#define endl "\n"
#define _ \
ios_base::sync... | // struct cmp {bool operator()(const pair<int, char> &a, const pair<int, char>
// &b) {if (a.first == b.first) {return a.second > b.second;} else {return
// a.first > b.first;}}};
#include <bits/stdc++.h>
#define endl "\n"
#define _ \
ios_base::sync... | [["-", 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 | 173 |
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9+7
INF = fl... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9+7
INF = fl... | [["-", 36, 36, 36, 36, 0, 656, 0, 14, 141, 22], ["-", 36, 36, 0, 656, 0, 14, 54, 54, 0, 24], ["-", 36, 36, 0, 656, 0, 14, 54, 54, 0, 22], ["-", 36, 36, 0, 656, 0, 14, 54, 54, 0, 25], ["-", 36, 36, 36, 36, 0, 656, 0, 14, 0, 102], ["-", 0, 656, 0, 14, 8, 196, 0, 37, 0, 38], ["-", 0, 14, 8, 196, 0, 37, 0, 652, 63, 22], ["... | 5 | 846 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int l, n;
cin >> l >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
sort(s.begin(), s.end());
rep(i, n) cout << s.at(i);
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, l;
cin >> n >> l;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
sort(s.begin(), s.end());
rep(i, n) cout << s.at(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 | 90 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
string sum;
vector<string> S(L);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
std::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());
for (int i = 0; i < N; i++) {
cout << S.at(i);
}
cout << endl;
}
| [["-", 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], ["-", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 8, 9, 0, 1, 0, 2, 63, 343, 345, 348], ["-", 8, 9, 0, 1, 0, 2, 63, 343, 0, 349]] | 1 | 106 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define nrep(i, a, b) for (int i = int(a); i >= int(b); --i)
#define trv(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define nrep(i, a, b) for (int i = int(a); i >= int(b); --i)
#define trv(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); ... | [["+", 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, 53, 54, 55, 0, 24], ["+", 0, 43, 49, 53, 54, 5... | 1 | 220 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double d;
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (abs(a * b) / gcd(a, b))
#define sqr(a) (a * a)
#define tt \
int t; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double d;
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (abs(a * b) / gcd(a, b))
#define sqr(a) (a * a)
#define tt \
int t; ... | [["-", 8, 9, 0, 9, 0, 1, 0, 2, 63, 22], ["-", 0, 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 | 180 |
#include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int L, N;
cin >> N >> L;
vector<string> dict(N);
rep(i, L) { cin >> dict.at(i); }
sort(dict.begin(), dict.end());
rep(i, L) { cout << dict.at(i); }
cout << en... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int L, N;
cin >> N >> L;
vector<string> dict(N);
rep(i, N) {
string word;
cin >> word;
dict.at(i) = word;
}
sort(dict.begin(), dict.end());
rep(i... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 8, 9, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 8, 9, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 8, 9, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 1, 0,... | 1 | 100 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == 5 && b == 5 && c == 7)
printf("YES");
if (a == 7 && b == 5 && c == 5)
printf("YES");
if (a == 5 && b == 7 && c == 5)
printf("YES");
else
printf("NO");
} | #include <stdio.h>
#include <stdlib.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a == 5 && b == 5 && c == 7) {
printf("YES");
return 0;
}
if (a == 7 && b == 5 && c == 5) {
printf("YES");
return 0;
}
if (a == 5 && b == 7 && c == 5) {
printf("YES");
return 0;
} e... | [["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 8, 9, 0, 57, 75, 76, 0, 1, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, ... | 1 | 104 |
#include <iostream>
using namespace std;
int main() {
const int array_num = 3;
int a[array_num];
int product = 1;
cout << "Input 3 integers=>" << endl;
cin >> a[0] >> a[1] >> a[2];
// judge if the input integers are less than 10;
for (int i = 0; i < array_num; i++) {
if (a[i] < 1 || 10 < a[i]) {
... | #include <iostream>
using namespace std;
int main() {
const int array_num = 3;
int a[array_num];
int product = 1;
// cout << "Input 3 integers=>" << endl;
cin >> a[0] >> a[1] >> a[2];
// judge if the input integers are less than 10;
for (int i = 0; i < array_num; i++) {
if (a[i] < 1 || 10 < a[i]) ... | [["-", 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, 5, 0, 62], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 1, 0, 16, 31, 16, 1... | 1 | 151 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, c1 = 0, c2 = 0;
for (int i = 0; i < 3; i++) {
if (x == 5)
c1++;
if (x == 7)
c2++;
}
if (c1 == 2 && c2 == 1)
puts("YES");
else
puts("NO");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, c1 = 0, c2 = 0;
for (int i = 0; i < 3; i++) {
scanf("%d", &x);
if (x == 5)
c1++;
if (x == 7)
c2++;
}
if (c1 == 2 && c2 == 1)
puts("YES");
else
puts("NO");
return 0;
} | [["+", 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, 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], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9,... | 1 | 85 |
#include <bits/stdc++.h>
// #include "bits/stdc++.h"
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
if (a * b * c == 5 * 5 * 7) {
printf("YES\n");
} else
printf("NO\n");
retu... | #include <bits/stdc++.h>
// #include "bits/stdc++.h"
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b * c == 5 * 5 * 7) {
printf("YES\n");
} else
p... | [["+", 0, 1, 0, 16, 31, 16, 31, 16, 31, 22], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 17, 152], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 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... | 1 | 81 |
#include "bits/stdc++.h"
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(s) s.begin(), s.end()
using namespace std;
typedef long ... | #include "bits/stdc++.h"
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(s) s.begin(), s.end()
using namespace std;
typedef long ... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25], ["-", 64, 9, 0, 57, 64, 1, 0, 2, 63, 22], ["-", 0, 57, 64, 1, 0,... | 1 | 229 |
#include <iostream>
int main() {
std::uint16_t A, B, C;
std::cin >> A >> B >> C;
bool ans = (A == 5 && B == 5 && C == 7) || (A == 5 && B == 7 && C == 5) ||
(A == 7 && B == 5 && C == 5);
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
int main() {
std::uint16_t A, B, C;
std::cin >> A >> B >> C;
bool haiku = (A == 5 && B == 5 && C == 7) || (A == 5 && B == 7 && C == 5) ||
(A == 7 && B == 5 && C == 5);
std::cout << (haiku ? "YES" : "NO") << std::endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 23, 0, 24], ["+", 0, 16, 31, 16, 12, 23, 0, 41, 15, 22], ["+", 0, 16, 31, 16, 12, 23, 0, 41, 0, 101], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 62], ["+", 31, 16, ... | 1 | 85 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long int A, B, C, f = 0, s = 0;
cin >> A >> B >> C;
if (A == 5) {
f++;
} else {
if (A == 7) {
s++;
}
}
if (B == 5) {
f++;
} else {
if (B == 7) {
s++;
}
}
if (C == 5) ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long long int A, B, C, f = 0, s = 0;
cin >> A >> B >> C;
if (A == 5) {
f++;
}
if (A == 7) {
s++;
}
if (B == 5) {
f++;
}
if (B == 7) {
s++;
}
if (C == 5) {
f++;
}
if (C == 7) {
... | [["-", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["-", 75, 76, 0, 9, 0, 57, 64, 9, 0, 46], ["-", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 147 |
#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++) {
string Si;
cin >> Si;
sort(Si.begin(), Si.end());
S.at(i) = Si;
}
sort(S.begin(), S.end());
for (int i = 0; i < N; i++) {
cout << S.at(i);
}
cout ... | #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());
for (int i = 0; i < N; i++) {
cout << S.at(i);
}
cout << endl;
return 0;
} | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 78], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 0, 35], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["-", 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], ["-... | 1 | 126 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int L, N;
cin >> N >> L;
string s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
}
sort(s, s + N);
string ans;
for (int i = 0; i < N; i++) {
ans += s[i];
}
printf("%s", ans);
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int L, N;
cin >> N >> L;
string s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
}
sort(s, s + N);
string ans;
for (int i = 0; i < N; i++) {
ans += s[i];
}
cout << ans << endl;
}
| [["-", 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], ["+", 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, 2, 3, 4, 0, 25], ["+",... | 1 | 97 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int L, N;
cin >> L >> N;
string S = "";
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++)
S += s[i];
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
string S = "";
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++)
S += s[i];
cout << S << 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 | 101 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.