王贺鹏

#include<bits/stdc++.h>
using namespace std;
int main(){
//freopen("p1730.in","r",stdin);
//freopen("p1730.out","w",stdout);
int i,j,k,n,a[11][11]={0},x=0;
cin>>n;
for(i=n;i>=1;i--){  
x=1+n-i;
for(j=1;j<=i;j++){
a[j][x]=i;
}
for(j=x;j<=n;j++){
a[i][j]=i;
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)cout<<setw(3)<<a[i][j];
cout<<endl;
//fclose(stdin);
//fclose(stdout);
}
}
( )

4221

#include <bits/stdc++.h>
using namespace std;
long long X, Y, cnt = 0;
int main() {
freopen("p1490.in", "r", stdin);
freopen("p1490.out", "w", stdout);
scanf("%d%d", &X, &Y);
char num[10];
for (long long i = sqrt(X); i <= sqrt(Y); i ++) {
long long n = i * i;
sprintf(num, "%d", n);
if (strlen(num) % 2) continue;
char a[10], b[10];
strncpy(a, num, strlen(num) / 2);
strncpy(b, num + strlen(num) / 2, strlen(num) / 2);
long long n1 = atoi(a), n2 = atoi(b);
if ((n1 + n2) == i) printf("%d\n", n), cnt ++;
}
if (!cnt) printf("0");
fclose(stdin);
fclose(stdout);
return 0;
}
( )

4221

#include <bits/stdc++.h>
using namespace std;
long long X, Y, cnt = 0;
int main() {
freopen("p1490.in", "r", stdin);
freopen("p1490.out", "w", stdout);
scanf("%d%d", &X, &Y);
char num[10];
for (long long i = sqrt(X); i <= sqrt(Y); i ++) {
long long n = i * i;
sprintf(num, "%d", n);
if (strlen(num) % 2) continue;
char a[10], b[10];
strncpy(a, num, strlen(num) / 2);
strncpy(b, num + strlen(num) / 2, strlen(num) / 2);
long long n1 = atoi(a), n2 = atoi(b);
if ((n1 + n2) == i) printf("%d\n", n), cnt ++;
}
if (!cnt) printf("0");
fclose(stdin);
fclose(stdout);
return 0;
}
( )

4221

#include<iostream>
using namespace std;
int main(){
freopen("p1619.in","r",stdin);
freopen("p1619.out","w",stdout);
int n=0,i=0,j=0,k=0;
cin>>n;
while(n>1){
if(n%2==0){
cout<<n<<"/"<<2<<"="<<n/2<<endl;
n=n/2;
}
else if(n%2==1){
cout<<n<<"*"<<3<<"+"<<1<<"="<<n*3+1<<endl;
n=n*3+1;
}
}
fclose(stdin);
fclose(stdout);
return 0;
}
( )

4221

#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("p1099.in","r",stdin);
freopen("p1099.out","w",stdout);
　　int i,j,k,m,n,a[55]={0},dp[55]={0};
　　cin>>n;
　　for(i=1;i<=n;i++){
　　 cin>>a[i];
}
dp[1]=a[1];
dp[2]=max(a[1],a[2]);
for(i=3;i<=n;i++){
dp[i]=max(dp[i-2]+a[i],dp[i-1]);
}
cout<<dp[n];
fclose(stdin);
fclose(stdout);
return 0;
}
( )

4221

#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("p1099.in","r",stdin);
freopen("p1099.out","w",stdout);
　　int i,j,k,m,n,a[55]={0},dp[55]={0};
　　cin>>n;
　　for(i=1;i<=n;i++){
　　 cin>>a[i];
}
dp[1]=a[1];
dp[2]=max(a[1],a[2]);
for(i=3;i<=n;i++){
dp[i]=max(dp[i-2]+a[i],dp[i-1]);
}
cout<<dp[n];
fclose(stdin);
fclose(stdout);
return 0;
}
( )