Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
codechef
#include<bits/stdc++.h> using namespace std; #define mem(A) memset(A,0,sizeof(A)) #define loop(i,a,n) for(long long i=a;i<n;i++) #define pb push_back #define mkp make_pair #define prq priority_queue #define fir first #define sec second #define all(A) A.begin(),A.end() #define mod 1000000007 #define take(t) ll t;cin>>t; typedef long long ll; typedef pair<ll,ll> pll; int main() { //freopen("input.txt", "r", stdin); ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); string s; vector<string> A[10]; loop(i,0,(1<<6)-1) { cin>>s; A[s.length()].pb(s); } loop(i,3,8) { loop(j,0,A[i].size()) cout<<A[i][j]<<endl; cout<<endl; } }
run
|
edit
|
history
|
help
0
Discounting
MyStringv2
alm7ly
Void main
factor
ADP_campus
asa
Building squares using smallest amount of matches
HashFold
Wipro Problem 1: generate roll number