点击这里更换您喜欢的皮肤wtboj 首页
请点击这里登入noios   首页 入门 c++讲义 入门教程视频 金牌教程 入门视频 站务 公告 | 题库 记录 竞测 测试 闯关 作业 排名 团队 讨论 | 换肤 | 登入 注册  
News >>   新增功能:各团队管理员可以发布本团队作业了 ()

From sina007
分糖果
讨论 Discussion
 
d
#include<bits/stdc++.h>
using namespace std;
int main(){
 freopen("p1681.in","r",stdin);
 freopen("p1681.out","w",stdout);
int a,b,c,d,e;
cin>>a>>b>>c>>d>>e;
b=b+a/3;e=e+a/3;a=a/3;
c+=b/3;a+=b/3;b=b/3;
d+=c/3;b+=c/3;c=c/3;
e+=d/3;c+=d/3;d=d/3;
a+=e/3;d+=e/3;e=e/3;
cout<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<e;
 fclose(stdin);
 fclose(stdout);
return 0;
}
( )

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

( )
发布讨论主题 回复讨论主题
Flag
  
题号
  P1681
  模拟
通过
  87人
提交
  302次
通过率
  29%
难度
  0
提交 讨论 题解
 Copyright wtboj © 2005-2006. www.wutuobang.date Powered by wtboj 关于 联系 帮助
 wtboj Information ---- Total Users : 1325 | Online Users / Processes : 0 / 83 | Processed Time : 51 ms | Server Time : 2025/10/31 15:41:09