#include<bits/stdc++.h>
using namespace std;
int main(){
cout<<"Good code is its own best documentation.";
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int a,b;
int main(){
cin>>a>>b;
a+=b;
cout<<a-16<<"\n"<<a-3<<"\n"<<a-1<<"\n"<<a;
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,k;
string x;
cin>>n>>x>>m>>k;
if(k==n){
cout<<"mei you mai "<<x<<" de";
}
else if(k==m){
cout<<"kan dao le mai "<<x<<" de";
}
else{
cout<<"wang le zhao mai "<<x<<" de";
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
int a,b,c;
cin>>a>>b>>c;
if(c==a*b){
cout<<"Lv Yan\n";
}
else if(c==a+b){
cout<<"Tu Dou\n";
}
else{
cout<<"zhe du shi sha ya!\n";
}
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int a[105];
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
int t;
cin>>t;
while(t--){
int x;
int flag=0;
for(int i=0;i<n;i++){
cin>>x;
if(x!=0){
if(a[i]!=x){
flag=0;
for(int j=i+1;j<n;j++)cin>>x;
break;
}
else{
flag++;
}
}
}
if(flag)cout<<"Da Jiang!!!\n";
else cout<<"Ai Ya\n";
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int n;
cin>>n;
while(n--){
int l,r;
string a,b,x,y;
cin>>l>>r>>a>>b;
x=a+b;
y=s.substr(l-1,r-l+1);
s=s.substr(0,l-1)+s.substr(r);
int pos=s.find(x);
if(pos!=-1)s=s.substr(0,pos+a.size())+y+s.substr(pos+a.size());
else s=s+y;
}
cout<<s;
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main(){
int w,m,n;
cin>>w>>m>>n;
int x,y,p=w+m;
int flag=0;
for(int i=1;i<n;i++){//女生宿舍的寝室数量
int k=n-i;//男生宿舍数量
int l=w/i,r=m/k;//宿舍人数
if(l*i==w&&r*k==m&&l!=1&&r!=1){//正好每间宿舍人数相同
flag=1;
if(abs(l-r)<p){
x=i;
y=k;
p=abs(l-r);
}
}
}
if(flag){
cout<<x<<' '<<y;
}
else{
cout<<"No Solution";
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int t;
cin>>t;
while(t--){
int l=0,r=0;
ll x,y,sx,sy;
cin>>x>>y;
sx=x,sy=y;
int sa=0,sb=0;
while(sx>0){
sa+=sx%10;
sx/=10;
}
while(sy>0){
sb+=sy%10;
sy/=10;
}
if(x%sb==0){
l++;
}
if(y%sa==0){
r++;
}
if(l!=r){
if(l){
cout<<"A";
}
else cout<<"B";
}
else{
if(x>y)cout<<"A";
else cout<<"B";
}
cout<<"\n";
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int cnt;
int p;
vector<int>a,b;
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
int x;
cin>>x;
if(i==1){
a.push_back(x);
}
else{
if(x<a[a.size()-1]){
a.push_back(x);
}
else{
if(b.size()==0||b[b.size()-1]<x){
b.push_back(x);
}
else{
p=max(p,(int)a.size());
cnt++;
a.clear();
while(b.size()&&b[b.size()-1]>x){
a.push_back(b[b.size()-1]);
b.pop_back();
}
a.push_back(x);
}
}
}
}
if(a.size()){
cnt++;
p=max(p,(int)a.size());
}
if(b.size()){
cnt++;
p=max(p,(int)b.size());
}
cout<<cnt<<' '<<p;
return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int cnt;
vector<int>a;
priority_queue<int,vector<int>,less<>>pq;
int main(){
int n,c;
cin>>n>>c;
for(int i=0;i<n;i++){
string s;
cin>>s;
int k,p=0;
cin>>k;
p=k/c;
cnt+=p;
int t=k%c;
if(t){
pq.push(t);
p++;
}
cout<<s<<' '<<p<<"\n";
}
while(pq.size()){
int t=pq.top();
pq.pop();
if(a.empty()){
int qq=c-t;
a.push_back(qq);
}
else{
int pos=lower_bound(a.begin(),a.end(),t)-a.begin();
if(pos==a.size()){
int qq=c-t;
a.insert(lower_bound(a.begin(),a.end(),qq),qq);
}
else{
int qq=a[pos]-t;
a.erase(a.begin()+pos);
a.insert(lower_bound(a.begin(),a.end(),qq),qq);
}
}
}
cnt+=a.size();
cout<<cnt;
return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n, m;
string s[100005];
int ax[] = { 0,1,0,-1 };
int ay[] = { 1,0,-1,0 };
int cnt, bz,t;
void dfs(int x, int y) {
if(s[x][y]!='0'&&s[x][y]!='1')t=1;
s[x][y] = '0';
for (int i = 0; i < 4; i++) {
int sx = x + ax[i];
int sy = y + ay[i];
if (sx >= 0 && sx < n && sy >= 0 && sy < m && s[sx][sy] != '0') {
dfs(sx, sy);
}
}
}
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (s[i][j] != '0') {
cnt++;
t=0;
dfs(i, j);
if(t)bz++;
}
}
}
cout << cnt << ' ' << bz;
return 0;
}