text
stringlengths 49
983k
|
|---|
#include <iostream>
#include <map>
using namespace std;
int main(){
int N;
cin >> N;
map<string,int> M;
for(int i = 0; i < N; ++i){
string s;
cin >> s;
++M[s];
}
for(auto s : {"AC", "WA", "TLE", "RE"}){
cout << s << " x " << M[s] << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
map<string,int>mp;
int n;
string s;
int main()
{
cin>>n;
for(int i=0;i<n;++i)
{
cin>>s;
mp[s]++;
}
printf("AC x %d\n",mp["AC"]);
printf("WA x %d\n",mp["WA"]);
printf("TLE x %d\n",mp["TLE"]);
printf("RE x %d\n",mp["RE"]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define F(a,b,c) for(int a=b;a<c;++a)
int main(){
int n;cin>>n;
map<string,int> mp;
while(n--){
string s;cin>>s;
mp[s]++;}
cout<<"AC"<<" x "<<mp["AC"]<<"\n";
cout<<"WA"<<" x "<<mp["WA"]<<"\n";
cout<<"TLE"<<" x "<<mp["TLE"]<<"\n";
cout<<"RE"<<" x "<<mp["RE"]<<"\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> ans;
for(int i=0;i<N;i++) {
string s;
cin >> s;
ans[s]++;
}
for (string s: {"AC", "WA", "TLE", "RE"}) {
cout << s << " x " << ans[s] << endl;
}
}
|
#include<iostream>
#include<bits/stdc++.h>
#include<map>
#define ll long long int
using namespace std;
int main(){
ll n;
cin>>n;
string s;
map <string ,ll> m;
while(n--){
cin>>s;
m[s]++;
}
cout<<"AC x "<<m["AC"]<<endl;
cout<<"WA x "<<m["WA"]<<endl;
cout<<"TLE x "<<m["TLE"]<<endl;
cout<<"RE x "<<m["RE"]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
map<string, int> m;
for (int i=0; i<n; i++) {
string s;
cin>>s;
++m[s];
}
cout<<"AC x "<<m["AC"]<<endl;
cout<<"WA x "<<m["WA"]<<endl;
cout<<"TLE x "<<m["TLE"]<<endl;
cout<<"RE x "<<m["RE"]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string,int> d;
for(int i=0;i<n;i++) {
string t;
cin >> t;
d[t]++;
}
vector<string> con={"AC","WA","TLE","RE"};
for(int i=0;i<con.size();i++) {
cout<< con[i] << " x " <<d[con[i]] <<"\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
char s[11];
int cnt[555];
int main() {
scanf("%d", &n);
for(int i=0;i<n;i++) {
scanf("%s", s);
cnt[s[0]] ++;
}
printf("AC x %d\n", cnt['A']);
printf("WA x %d\n", cnt['W']);
printf("TLE x %d\n", cnt['T']);
printf("RE x %d\n", cnt['R']);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
map<string,int>mp;
signed main()
{
int n;
string s;
cin>>n;
while(n--)
{
cin>>s;
mp[s]++;
}
cout<<"AC x "<<mp["AC"]<<endl;
cout<<"WA x "<<mp["WA"]<<endl;
cout<<"TLE x "<<mp["TLE"]<<endl;
cout<<"RE x "<<mp["RE"];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
string s[100005];
map<string,int>mp;
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++) cin>>s[i],mp[s[i]]++;
printf("AC x %d\n",mp["AC"]);
printf("WA x %d\n",mp["WA"]);
printf("TLE x %d\n",mp["TLE"]);
printf("RE x %d\n",mp["RE"]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main (void) {
int n; string r;
map<string, int> s;
cin >> n;
while (n --) {
cin >> r;
s[r] ++;
}
cout << "AC x " << s["AC"] << endl;
cout << "WA x " << s["WA"] << endl;
cout << "TLE x " << s["TLE"] << endl;
cout << "RE x " << s["RE"] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<string, int> cnt;
for(int i=0;i<n;i++) {
string s;
cin >> s;
cnt[s]++;
}
for(string s: {"AC", "WA", "TLE","RE"}) {
cout << s << " x " << cnt[s] << endl;
}
}
|
#include<iostream>
#include<map>
#include<string>
using namespace std;
int main(){
int N;
cin>>N;
map<string,int>rec;
for(int i=0;i<N;++i){
string a;
cin>>a;
++rec[a];
}
for(auto s:{"AC","WA","TLE","RE"}){
cout<<s<<" x "<<rec[s]<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> m;
while (n--) {
string s;
cin >> s;
m[s]++;
}
for (auto e : {"AC", "WA", "TLE", "RE"}) cout << e << " x " << m[e] << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n; cin>>n;
map<string,int> f;
rep(i,n){
string s; cin>>s;
++f[s];
}
for(string s:{"AC","WA","TLE","RE"}) cout<<s<<" x "<<f[s]<<'\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
map<string,int> mp;
for(int i=0; i<n; ++i){
string s; cin >> s;
mp[s]++;
}
printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n",mp["AC"],mp["WA"],mp["TLE"],mp["RE"]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s;
map<string,int> mp;
while(n--){
cin>>s;
mp[s]++;
}
cout<<"AC x "<<mp["AC"]<<"\n";
cout<<"WA x "<<mp["WA"]<<"\n";
cout<<"TLE x "<<mp["TLE"]<<"\n";
cout<<"RE x "<<mp["RE"]<<"\n";
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
map<string , int> m;
for(int i=1;i<=n;i++)
{
string temp;
cin>>temp;
m[temp]++;
}
cout<<"AC x "<<m["AC"]<<"\n"<<"WA x "<<m["WA"]<<"\n"<<"TLE x "<<m["TLE"]<<"\n"<<"RE x "<<m["RE"];
}
|
#include<bits/stdc++.h>
using namespace std;
map<string,int>mp;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
string x;
cin>>x;
mp[x]++;
}
vector<string>vt{"AC","WA","TLE","RE"};
for(auto it:vt)
{
cout<<it<<" x "<<mp[it]<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n=0;
string str="";
map<string ,int>mp;
cin>>n;
while(n--){
cin>>str;
mp[str]++;
}
cout<<"AC x "<<mp["AC"]<<"\n";
cout<<"WA x "<<mp["WA"]<<"\n";
cout<<"TLE x "<<mp["TLE"]<<"\n";
cout<<"RE x "<<mp["RE"]<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a=0,w=0,t=0,r=0,n;
scanf("%d",&n);
while(n--)
{
char str[5]={0};
scanf("%s",str);
if(str[0]=='A')
a++;
else if(str[0]=='W')
w++;
else if(str[0]=='T')
t++;
else
r++;
}
printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d",a,w,t,r);
}
|
// B - Judge Status Summary
#include <bits/stdc++.h>
using namespace std;
string in(){string x;cin>>x;return x;}
int main(){
int N; cin>>N;
map<string,int> S;
while(N--) S[in()]++;
for(auto k:{"AC","WA","TLE","RE"})
cout<< k <<" x "<< (S.count(k)? S[k]:0) <<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+5;
string s;
int main(){
map<string,int>m;
int n;
cin>>n;
while(n--){
cin>>s;
m[s]++;
}
cout<<"AC x "<<m["AC"]<<endl;
cout<<"WA x "<<m["WA"]<<endl;
cout<<"TLE x "<<m["TLE"]<<endl;
cout<<"RE x "<<m["RE"];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
unordered_map<string, int> m;
for(int i=0; i<n; i++){
string j;
cin >> j;
m[j]++;
}
vector<string> v{"AC", "WA", "TLE", "RE"};
for(auto label: v) {
cout << label << " x " << m[label] << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int n,ac,wa,tle,re;string s;
int main(){
cin>>n;
while(n--){
cin>>s;
if(s=="AC")ac++;
if(s=="WA")wa++;
if(s=="TLE")tle++;
if(s=="RE") re++;
}
cout<<"AC x "<<ac<<endl;
cout<<"WA x "<<wa<<endl;
cout<<"TLE x "<<tle<<endl;
cout<<"RE x "<<re<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
string a;
map<string,int> hash;
while(n--)
{
cin>>a;
hash[a]++;
}
cout<<"AC x "<<hash["AC"]<<endl;
cout<<"WA x "<<hash["WA"]<<endl;
cout<<"TLE x "<<hash["TLE"]<<endl;
cout<<"RE x "<<hash["RE"]<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
map<string,int>m;
for(int i=0;i<n;i++)
{
string s;
cin>>s;
m[s]+=1;
}
cout<<"AC"<<" x "<<m["AC"]<<"\n";
cout<<"WA"<<" x "<<m["WA"]<<"\n";
cout<<"TLE"<<" x "<<m["TLE"]<<"\n";
cout<<"RE"<<" x "<<m["RE"];
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
char s[15];
void dfs(int dep,int mx){
if(dep==n){
puts(s);
return;
}
for(int i=0;i<mx;i++){
s[dep]=i+'a';
dfs(dep+1,mx);
}
s[dep]=mx+'a';
dfs(dep+1,mx+1);
}
int main(){
scanf("%d",&n);
dfs(0,0);
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int N;
void DFS(int P, int Q, string S) {
if (P == N) {
cout << S << endl;
return;
}
for (int i = 0; i <= Q + 1; i++) {
DFS(P + 1, max(Q, i), S + (char)('a' + i));
}
}
int main() {
cin >> N;
DFS(0, -1, "");
}
|
#include <iostream>
using namespace std;
int N;
void dfs(string s, char mx ){
if(s.size() == N){
cout << s << endl;
}else{
for(char c = 'a'; c <= mx; c++){
dfs(s+c, (c == mx) ? (char)(mx+1) : mx);
}
}
}
int main(){
cin >> N;
dfs("",'a');
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
void search(string s, char big)
{
if(s.length()==n)
cout<<s<<"\n";
else
{
for(char c='a';c<big;c++)
{
search(s+c, big);
}
search(s+big, big+1);
}
}
int main()
{
cin>>n;
string ans="";
search(ans, 'a');
}
|
#include <bits/stdc++.h>
using namespace std;
void dfs(string s, int n) {
if (s.size() == n) {
cout << s << "\n";
return;
} else {
char mx = *max_element(s.begin(), s.end());
for (char c = 'a'; c <= mx + 1; c++) {
dfs(s + c, n);
}
}
}
int main() {
int N;
cin >> N;
dfs("a", N);
}
|
#include<bits/stdc++.h>
using namespace std;
long n;
char c[20];
void print(long l,char had) {
if(l>n) {
for(long i=1;i<=n;++i)
putchar(c[i]);
putchar('\n');
return;
}
for(char i='a';i<had;i++) {
c[l]=i;
print(l+1,had);
}
c[l]=had;
print(l+1,had+1);
}
int main() {
cin>>n;
print(1,'a');
return 0;
}
|
#include<stdio.h>
char st[15];
void out(int n,int now,int max){
if(now>=n){
printf("%s",st);
puts("");
return ;
}
for(int i=97;i<=max+1;i++){
st[now]=i;
out(n,now+1,i>max?i:max);
}
}
int main(){
int n;
scanf("%d",&n);
out(n,0,96);
return 0;
}
|
// D - String Equivalence
// DFS version
#include <bits/stdc++.h>
using namespace std;
int N;
void dfs(string pre){
if(pre.size() >= N){
cout<< pre <<endl;
return;
}
set<char> types{'a'}; for(auto c:pre) types.insert(c+1);
for(auto c:types) dfs(pre+c);
}
int main(){
cin>>N;
dfs("a");
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
string s="a";
void dfs(char a){
char c;
if(s.size()==n){
cout<<s<<endl;
return;
}
for(c='a';c<=char(a+1);c++){
s+=c;
dfs(max(c,a));
s.erase(s.end()-1);
}
}
int main(){
cin>>n;
dfs('a');
return 0;
}
|
#include <iostream>
using namespace std;
int N;
void dfs(string s, char mx) {
if (s.size() == N) {
cout << s << endl;
} else {
for (char c = 'a'; c <= mx; c++) {
dfs(s+c, ((c==mx) ? (char)(mx + 1) : mx));
}
}
}
int main() {
cin >> N;
dfs("", 'a');
}
|
#include<iostream>
#include<string>
using namespace std;
int n;
void dfs(string s, char mx){
if(s.size() == n){
cout << s << endl;
return;
}
for(char c = 'a'; c <= mx + 1; c++){
string t = s;
t += c;
dfs(t, max(mx, c));
}
}
int main(){
cin >> n;
dfs("", 'a' - 1);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
void dfs(string s, char now) {
if(s.size()==n) {
cout<<s<<endl;
return;
}
for(char i='a';i<now;i++) {
dfs(s+i,now);
}
dfs(s+now,now+1);
}
int main() {
cin>>n;
dfs("",'a');
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5+7;
void dfs(int now,int n,string ans,int k){
if(now == n){
cout << ans << "\n";
return ;
}
for(int i = 0;i <= k;++i) dfs(now+1,n,ans+(char)('a'+i),max(k,i+1));
return ;
}
int main() {
int n;
cin >> n;
dfs(0,n,"",0);
return 0;
}
|
// D - String Equivalence
// DFS version
#include <bits/stdc++.h>
using namespace std;
int N;
void dfs(string pre, char cmax){
if(pre.size() >= N) cout<< pre <<endl;
else{
for(char c='a'; c<cmax; ++c) dfs(pre + c, cmax);
dfs(pre + cmax, cmax + 1);
}
}
int main(){
cin>>N;
dfs("", 'a');
}
|
#include <bits/stdc++.h>
using namespace std;
void dfs(string s, int N) {
if (s.size() == N) {
cout << s << endl;
return;
}
char c = 'a';
for (char &i : s) c = max(c, i);
for (char i = 'a'; i <= c + 1; ++i) dfs(s + i, N);
}
int main(void){
int N;
cin >> N;
dfs("a", N);
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
void dfs(string s, char mx) {
if (s.length() == n) {
printf("%s\n", s.c_str());
} else {
for (char c = 'a'; c <= mx; ++c) {
dfs(s + c, c == mx ? (mx + 1) : mx);
}
}
}
int main() {
scanf("%d", &n);
dfs("", 'a');
return 0;
}
|
#include <iostream>
#include <string>
int N;
using namespace std;
void dfs(string s, char mx) {
if (s.length()==N) cout << s << endl;
else {
for (char i='a'; i<=mx; i++) {
if (i==mx) dfs(s+i, mx+1);
else dfs(s+i, mx);
}
}
}
int main() {
cin >> N;
dfs("", 'a');
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int N;
void dfs(string s,char mx){
if(s.length() == N){
cout << s << endl;
}else{
for(char c='a';c<=mx;c++){
dfs(s+c,((c == mx) ? (char)(mx+1):mx));
}
}
}
int main(){
cin >> N;
dfs("",'a');
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int N;
void dfs(string s, char mx) {
if(s.size() == N) {
cout << s.c_str() << endl;
} else {
for(char c = 'a'; c <= mx; c++) {
dfs(s+c, ((c == mx) ? (char(mx+1)) : mx));
}
}
}
int main() {
cin >> N;
dfs("", 'a');
return 0;
}
|
// D - String Equivalence
// DFS version
#include <bits/stdc++.h>
using namespace std;
int N;
void dfs(string pre, char cmax){
if(pre.size() >= N) cout<< pre <<endl;
else for(char c='a'; c<=cmax; ++c) dfs(pre + c, (c<cmax? cmax: cmax + 1));
}
int main(){
cin>>N;
dfs("", 'a');
}
|
#include <cstdio>
char pi[2333];
void sou(int n,int k,int p)
{
if(n==0)
{
printf("%s",pi); return;
}
for(int i=0; i<p; i++)
{
pi[k]='a'+i;
sou(n-1,k+1,p);
}
if(p!=26)
{
pi[k]='a'+p;
sou(n-1,k+1,p+1);
}
return;
}
int main()
{
int n; scanf("%d",&n);
pi[n]='\n'; pi[n+1]='\0';
sou(n,0,0);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void dfs(string S, char max_char, int N){
if(S.size()==N){
cout << S << endl;
return;
}
for(char c='a'; c<=max_char; c++){
dfs(S+c, max_char, N);
}
max_char++;
dfs(S+max_char, max_char, N);
}
int main(){
int N;
cin >> N;
dfs("a", 'a', N);
return 0;
}
|
#include<iostream>
using namespace std;
int n;
int dif=0;
char s[1010];
void dfs(int i){
if(i==n+1){
cout<<s+1<<endl;
return ;
}
for(int j=0;j<=dif;j++){
s[i]='a'+j;
int temp=dif;
if(j==dif){
dif++;
}
dfs(i+1);
dif=temp;
}
}
int main(){
cin>>n;
dfs(1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void print(string S,int N,char m){
if(N==0)cout<<S<<endl;
else for(char a='a';a-m<=1;a++)print(S+a,N-1,max(a,m));
}
int main(){
int N;cin>>N;string S="a";
print(S,N-1,'a');
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=11;
int n;
char s[N];
void dfs(int x,int up){
if(x==n){
printf("%s\n",s);
return;
}
for(int i=1;i<=up;++i){
s[x]=i-1+'a';
dfs(x+1,up);
}
s[x]=up+'a';
dfs(x+1,up+1);
}
int main(){
scanf("%d",&n);
dfs(0,0);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
void dfs(int i, string s, int mx){
if(i == n){
printf("%s\n", s.c_str());
}
else{
for(char j='a';j<=mx+1;j++){
dfs(i+1, s+j, max(mx, (int)j));
}
}
}
int main(){
scanf("%d", &n);
dfs(0, "", 'a'-1);
}
|
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int N;
void solve(int n,int m,string s){
if(n==0)cout<<s<<endl;
else{
for(int i=0;i<m;i++){
solve(n-1,m,s+(char)('a'+i));
}
solve(n-1,m,s+(char)('a'+m));
if(N>n)solve(n-1,m+1,s+(char)('a'+m+1));
}
}
int main(){
cin>>N;
solve(N,0,"");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
void dfs(string s, char mx){
if(s.length() == N){
cout << s <<endl;
}else{
for (char c = 'a'; c <= mx; c++) {
dfs(s+c, ((c==mx) ? (c+1) : mx));
}
}
}
int main() {
cin >> N;
dfs("",'a');
return 0;
}
|
#include<bits/stdc++.h>
//#include"Templates/libraries.h"
using namespace std;
int n;
void dfs(string str, char d){
if(str.length()==n){
cout << str << '\n';
}else{
for(char c='a'; c<=d;c++){
if(c==d)dfs(str+c, (char)(d+1));
else dfs(str+c, d);
}
}
}
int main(){
cin >> n;
dfs("",'a');
}
|
#include <bits/stdc++.h>
int n;
void dfs(std::string s,char mx) {
if (s.size() == n) {
std::cout << s << std::endl;
return;
}
for (char c = 'a'; c <= mx + 1; ++c) {
std::string t = s;
t += c;
dfs(t, std::max(mx, c));
}
}
int main() {
std::cin >> n;
dfs("", 'a'-1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
void dfs(string str, char x) {
if (str.length() == N) {
cout << str << endl;
} else {
for (char c = 'a'; c <= x; c++) {
dfs(str + c, max((char)(c+1), x));
}
}
}
int main() {
cin>> N;
dfs("", 'a');
}
|
#include <bits/stdc++.h>
using namespace std;
void solve(string s, char v, int n) {
if (n == 0) {
cout << s << endl;
return;
}
for (char c = 'a'; c <= v; c++) {
solve(s + c, c < v ? v : v + 1, n - 1);
}
}
int main(void) {
int n;
cin >> n;
solve("", 'a', n);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void f(string s,char b,int n){
if(n==0){cout << s << endl; return;}
for(char i='a';i<=b+1;i++){
int m=max(i,b);
f(s+i,m,n-1);
}
}
int main(){
int n; cin >> n;
f("a",'a',n-1);
return 0;
}
|
#include<iostream>
using namespace std;
string s="a";
int n;
void dfs(int step,char $){
if(step==n){
cout<<s<<endl;
return;
}
string t=s;
char i;
for(i='a';i<=$+1;i++){
s=t+i;
dfs(step+1,max($,i));
}
s=t;
}
int main(){
cin>>n;
dfs(1,'a');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
void dfs(string s, char mx){
if(s.length() == N){
cout << s <<endl;
}else{
for (char c = 'a'; c <= mx; c++) {
dfs(s+c, ((c==mx) ? (char)(c+1) : mx));
}
}
}
int main() {
cin >> N;
dfs("",'a');
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
string s="a";
void dfs(char a){
if(s.size()==n) {cout<<s<<endl;return;}
for(char c='a';c<=char(a+1);c++){
s+=c;
dfs(max(c,a));
s.erase(s.end()-1);
}
}
int main(){
cin>>n;
dfs('a');
}
|
#include<bits/stdc++.h>
#include<string>
using namespace std;
int N;
void dfs(string s,char mx)
{if(s.length() ==N)
{printf("%s\n",s.c_str());}
else{for(char c='a';c<=mx;c++)
{dfs(s+c, ((c==mx) ? (char)(mx+ 1) :mx));}
}
}
int main(void)
{cin>>N;
dfs("", 'a');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
void BF(string A, char mx) {
if(A.size() == N) {
cout << A << "\n";
}else {
for(char i = 'a'; i < mx; i++) {
BF(A + i, mx);
}
BF(A + mx, mx + 1);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin >> N;
BF("", 'a');
}
|
#include<bits/stdc++.h>
#include<string>
using namespace std;
int N;
void dfs(string s,char x){
if(s.length() == N) printf("%s\n", s.c_str());
else
for(char c= 'a'; c <= x; c++)
dfs(s+c,((c == x) ?(char)(x + 1): x));
}
int main(){
cin >> N;
dfs("", 'a');
return 0;
}
|
#include<bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int N;
void dfs(string s, char mx){
if(s.length() == N){
printf("%s\n", s.c_str());
} else {
for(char c='a';c<=mx;c++){
dfs(s + c, ((c == mx) ? (char)(mx + 1) : mx));
}
}
}
int main(void){
cin >> N;
dfs("", 'a');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
void dfs(string s,char mx)
{
if(s.size()==n)
{
cout<<s<<endl;
}
else
{
for(char c='a';c<=mx;c++)
{
if(c==mx)
dfs(s+c,mx+1);
else
dfs(s+c,mx);
}
}
}
int main()
{
cin>>n;
dfs("",'a');
return 0;
}
|
#include <cstdio>
using namespace std;
int n,i,a[100];
void dfs(int dep,int now)
{
if (dep==n+1){
for (i=1;i<=n;i++) printf("%c",a[i]+'a'-1);
puts("");return;
}
for (int ii=1;ii<now;ii++){
a[dep]=ii;dfs(dep+1,now);
}a[dep]=now;dfs(dep+1,now+1);
}
int main()
{
scanf("%d",&n);
dfs(1,1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
void dfs(string s, char mx) {
if (s.length() == N) {
cout << s.c_str() << endl;
} else {
for (char c = 'a'; c <= mx; c++) {
dfs(s + c, ((c == mx) ? (char)(mx + 1) : mx));
}
}
}
int main() {
cin >> N;
dfs("", 'a');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
void dfs(string s, char mx)
{
if (s.size() >= N)
{
cout << s << endl;
return;
}
for (char c = 'a'; c <= mx + 1; c++)
{
dfs(s + c, max(mx, c));
}
return;
}
int main()
{
cin >> N;
dfs("", 'a' - 1);
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int n;
void dfs(string s, char mx) {
if (s.length() == n)
printf("%s\n", s.c_str());
else {
for (char c = 'a'; c <= mx; c++)
dfs(s + c, ((c == mx) ? (char)(mx + 1) : mx));
}
}
int main()
{
cin >> n;
dfs("", 'a');
}
|
#include<bits/stdc++.h>
using namespace std;
int N;
void dfs(string s,char mx){
if(s.length()==N){
cout<<s<<endl;
}
else{
for (char c ='a'; c<=mx;c++ ){
dfs(s+c,((c==mx)? (char)(mx+1):mx));
}
}
}
int main(){
cin>>N;
dfs("",'a');
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
void dfs(string s,char mxc)
{
if(n==s.size())
cout << s << endl;
else
{
for(char c = 'a'; c <= mxc; ++c) {
dfs(s+c, (c==mxc?mxc+1:mxc));
}
}
}
int main()
{
cin>>n;
dfs("",'a');
}
|
#include<bits/stdc++.h>
using namespace std;
char str[15];
void dfs(int l,int t,int n)
{
if(l==n)
{
printf("%s\n",str);
return;
}
for(int i=0;i<=t+1;i++)
{
str[l]='a'+i;
dfs(l+1,max(t,i),n);
}
}
int main()
{
int n;
scanf("%d",&n);
dfs(0,-1,n);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int n;
void dfs(string s){
if(s.length()==n){ cout<<s<<'\n'; return; }
char mx=*max_element(s.begin(),s.end());
for(char c='a';c<=mx+1;c++) dfs(s+c);
}
int main(){ cin>>n; dfs("a"); return 0; }
|
#include "bits/stdc++.h"
using namespace std;
unsigned n;
void f(string s, char up)
{
if (s.length() == n) {
cout << s << endl;
return;
}
for (char c = 'a'; c <= up + 1; c++) {
f(s + c, max(up, c));
}
}
int main()
{
cin >> n;
f("", 'a' - 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
void solve(string s, int a, int b){
if(a == n) cout << s << endl;
else for(int i=0; i<=b; i++){
string t = s; t.push_back((char)('a'+i));
solve(t,a+1,max(b,i+1));
}
}
int main(){ cin >> n; solve("a",1,1); }
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
string s="a";
void dfs(char a){
if(s.size()==n) {cout<<s<<endl;return;}
for(char c='a';c<=char(a+1);c++){
s+=c;
dfs(max(c,a));
s.erase(s.end()-1);
}
}
int main(){
cin>>n;
dfs('a');
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
char s[15];
void dfs(int u,int now) {
if (u==n) {
puts(s);
return;
}
for (int i=0;i<=now;++i) {
s[u]=i+'a';
dfs(u+1,max(now,i+1));
}
}
int main()
{
scanf("%d",&n);
dfs(0,0);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
string s="aaaaaaaaaa";
int n;
void dfs(int i,int j)
{
if(i>=n)
{
for(int k=0;k<n;k++)putchar(s[k]);
putchar(10);
return;
}
s[i]='a'-1;
for(int k=0;k<=j;k++)
{
++s[i];
dfs(i+1,max(k,j-1)+1);
}
}
int main()
{
scanf("%d",&n);
dfs(0,0);
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n;
void dfs(string s,int cnt,char c){
if(cnt==n){
cout << s << endl;
return;
}
for(int i=0;i<c-'a'+2;i++){
char x=i+'a';
dfs(s+x,cnt+1,max(c,x));
}
}
int main(){
cin >> n;
string s="a";
dfs(s,1,'a');
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
void dfs(string s) {
if (s.size() == N) {
cout << s << "\n";
return;
} else {
char mx = *max_element(s.begin(), s.end());
for (char c = 'a'; c <= mx + 1; c++) {
dfs(s + c);
}
}
}
int main() {
cin >> N;
dfs("a");
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
void dfs(string s, char mx) {
if((int)s.length() == N) {
cout << s << endl;
} else {
for(char c = 'a'; c <= mx; c++) {
dfs(s + c, ((c == mx)? (char) (mx+1) : mx));
}
}
}
int main() {
cin >> N;
dfs("", 'a');
}
|
#include<stdio.h>
#include<string>
using namespace std;
int N;
void dfs(string s, char mx);
int main(void)
{
scanf("%d", &N);
dfs("", 'a');
return 0;
}
void dfs(string s, char mx)
{
if (s.length() == N)
printf("%s\n", s.c_str());
else
for (char ch = 'a'; ch <= mx; ch++)
dfs(s + ch, ch == mx ? mx + 1 : mx);
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
void DFS(string S, char mx){
if(S.size() == N){
cout << S << endl;
return;
}
for(char i = 'a'; i <= mx + 1; i++){
string t = S;
t += i;
DFS(t, max(mx, i));
}
}
int main(){
cin >> N;
DFS("", 'a' - 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
void dfs(string s,char mx){
if(s.size() == n) {
cout << s << endl;
return;
}
for (char c = 'a'; c <= mx+1; c++) {
string t = s;
t += c;
dfs(t, max(mx, c));
}
}
int main() {
cin >> n;
dfs("",'a'-1);
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int N;
void dfs(char a = 'a', string b = "") {
if (b.size() == N) cout << b << endl;
else {
for (char i = 'a'; i < a; i++) dfs(a, b + i);
dfs(a + 1, b + a);
}
}
int main() {
cin >> N;
dfs();
}
|
// D - String Equivalence
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
set<string> s{"a"};
while(--N){
set<string>t; swap(s,t);
for(auto pre:t){
set<char> types{'a'}; for(auto c:pre) types.insert(c+1);
for(auto c:types) s.insert(pre + c);
}
}
for(auto x:s) cout<< x <<endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int n;
void dfs(string s, char mx) {
if (s.length() == n)
cout << s << endl;
else {
for (char c = 'a'; c <= mx; c++)
dfs(s + c, ((c == mx) ? (char)(mx + 1) : mx));
}
}
int main()
{
cin >> n;
dfs("", 'a');
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
void dfs(string s, char mx) {
if (s.length() == n) {
cout << s.c_str() << '\n';
}
else {
for (char c = 'a'; c <= mx; ++c) {
dfs(s + c, ((c == mx) ? (char) (mx + 1) : mx));
}
}
}
int main() {
cin >> n;
dfs("", 'a');
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
void dfs(string s, char mx){
if (s.size() == n){
cout << s << endl;
return;
}
for (char c = 'a'; c <= mx + 1; c++){
string t = s;
t += c;
dfs(t, max(c, mx));
}
}
int main(){
cin >> n;
dfs("", 'a' - 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
void dfs(string s, char c)
{
if (s.size() == N)
{
cout << s << endl;
}
else
{
for (char i = 'a'; i <= c; i++)
{
if (i != c)
dfs(s + i, c);
else
dfs(s + i, c + 1);
}
}
}
int main()
{
cin >> N;
dfs("", 'a');
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
string ans;
void dfs(int now,int nn)
{
if(now==n)
{
cout<<ans<<endl;
return ;
}
for(int i = 0;i<=nn+1;i++)
{
ans[now] = 'a'+i;
dfs(now+1,max(nn,i));
}
}
int main()
{
cin >> n;
ans = string(n,'a');
dfs(0,-1);
}
|
#include<iostream>
#include<string>
using namespace std;
int N;
void dfs(string s, char mx){
if(s.size()==N){
cout << s << endl;
}else{
for(char c = 'a'; c<=mx;c++){
dfs(s+c, ((c==mx)?mx+1:mx));
}
}
}
int main(){
cin >>N;
dfs("",'a');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
void dfs(string s, char c) {
if (s.size() == n) {
cout << s << '\n';
} else {
for (char i = 'a'; i <= c; i++)
dfs(s + i, (i == c) ? c + 1 : c);
}
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n;
dfs("", 'a');
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
void f(string s, int sl){
if (s.size() == n){
cout << s << '\n';
return;
}
for (int i = 0; i < sl; i++){
f(s+(char)('a'+i), sl);
}
f(s+(char)('a'+sl), sl+1);
}
int main(){
cin >> n;
f("a", 1);
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
void dfs(string s, int mx){
if(s.size()==n){
cout<<s<<'\n';
return;
}
for(int i=0;i<=mx+1;++i){
dfs(s+char('a'+i), max(mx, i));
}
}
int main(){
cin>>n;
dfs("a", 0);
}
|
#include <iostream>
#include <string>
int n;
void dfs(std::string s, char alph) {
if (s.length() == n) {
std::cout << s << std::endl;
return;
}
for (char c = 'a'; c <= alph; c++) {
dfs(s + c, ((c == alph) ? char(alph + 1) : char(alph)));
}
}
int main() {
std::cin >> n;
dfs("", 'a');
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
int a[22];
void dfs(int dep, int ma) {
if(dep==n) {
for(int i=0;i<n;i++) putchar(a[i]+'a');
puts("");
return;
}
for(int i=0;i<ma;i++) {
a[dep] = i;
dfs(dep+1, ma);
}
a[dep] = ma;
dfs(dep+1, ma+1);
}
int main() {
scanf("%d", &n);
dfs(0, 0);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.