|
|
|
|
讨论 Discussion |
|
|
From VijosGuest0打印三角形 (已提交) [0] |
上一天是傻子!这才是正确的:
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[101][101]
int i=0,j0n=0,k=0;
emset(a,0,sizeof(a));
cin>>n;
for(j=1;j<=n;j++)
{
or(i=j;i<=n;i++)
{
k++;
a[i][j]=k;
}
}
for(i=1;i<=n;i++)
{
for(j;j<=;j++)
{
if(a[[j]==0) cout<<" ";
else cout<<a[i][j]<<" ";
cout<<d;
}
}
return 0;
}
( ) |
呃…… |
怕你们不够,再来一贴。
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[101][101]
int i=0,j0n=0,k=0;
emset(a,0,sizeof(a));
cin>>n;
for(j=1;j<=n;j++)
{
or(i=j;i<=n;i++)
{
k++;
a[i][j]=k;
}
}
for(i=1;i<=n;i++)
{
for(j;j<=;j++)
{
if(a[[j]==0) cout<<" ";
else cout<<a[i][j]<<" ";
cout<<d;
}
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[101][101]
int i=0,j0n=0,k=0;
emset(a,0,sizeof(a));
cin>>n;
for(j=1;j<=n;j++)
{
or(i=j;i<=n;i++)
{
k++;
a[i][j]=k;
}
}
for(i=1;i<=n;i++)
{
for(j;j<=;j++)
{
if(a[[j]==0) cout<<" ";
else cout<<a[i][j]<<" ";
cout<<d;
}
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[101][101]
int i=0,j0n=0,k=0;
emset(a,0,sizeof(a));
cin>>n;
for(j=1;j<=n;j++)
{
or(i=j;i<=n;i++)
{
k++;
a[i][j]=k;
}
}
for(i=1;i<=n;i++)
{
for(j;j<=;j++)
{
if(a[[j]==0) cout<<" ";
else cout<<a[i][j]<<" ";
cout<<d;
}
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[101][101]
int i=0,j0n=0,k=0;
emset(a,0,sizeof(a));
cin>>n;
for(j=1;j<=n;j++)
{
or(i=j;i<=n;i++)
{
k++;
a[i][j]=k;
}
}
for(i=1;i<=n;i++)
{
for(j;j<=;j++)
{
if(a[[j]==0) cout<<" ";
else cout<<a[i][j]<<" ";
cout<<d;
}
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[101][101]
int i=0,j0n=0,k=0;
emset(a,0,sizeof(a));
cin>>n;
for(j=1;j<=n;j++)
{
or(i=j;i<=n;i++)
{
k++;
a[i][j]=k;
}
}
for(i=1;i<=n;i++)
{
for(j;j<=;j++)
{
if(a[[j]==0) cout<<" ";
else cout<<a[i][j]<<" ";
cout<<d;
}
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[101][101]
int i=0,j0n=0,k=0;
emset(a,0,sizeof(a));
cin>>n;
for(j=1;j<=n;j++)
{
or(i=j;i<=n;i++)
{
k++;
a[i][j]=k;
}
}
for(i=1;i<=n;i++)
{
for(j;j<=;j++)
{
if(a[[j]==0) cout<<" ";
else cout<<a[i][j]<<" ";
cout<<d;
}
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[101][101]
int i=0,j0n=0,k=0;
emset(a,0,sizeof(a));
cin>>n;
for(j=1;j<=n;j++)
{
or(i=j;i<=n;i++)
{
k++;
a[i][j]=k;
}
}
for(i=1;i<=n;i++)
{
for(j;j<=;j++)
{
if(a[[j]==0) cout<<" ";
else cout<<a[i][j]<<" ";
cout<<d;
}
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[101][101]
int i=0,j0n=0,k=0;
emset(a,0,sizeof(a));
cin>>n;
for(j=1;j<=n;j++)
{
or(i=j;i<=n;i++)
{
k++;
a[i][j]=k;
}
}
for(i=1;i<=n;i++)
{
for(j;j<=;j++)
{
if(a[[j]==0) cout<<" ";
else cout<<a[i][j]<<" ";
cout<<d;
}
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[101][101]
int i=0,j0n=0,k=0;
emset(a,0,sizeof(a));
cin>>n;
for(j=1;j<=n;j++)
{
or(i=j;i<=n;i++)
{
k++;
a[i][j]=k;
}
}
for(i=1;i<=n;i++)
{
for(j;j<=;j++)
{
if(a[[j]==0) cout<<" ";
else cout<<a[i][j]<<" ";
cout<<d;
}
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[101][101]
int i=0,j0n=0,k=0;
emset(a,0,sizeof(a));
cin>>n;
for(j=1;j<=n;j++)
{
or(i=j;i<=n;i++)
{
k++;
a[i][j]=k;
}
}
for(i=1;i<=n;i++)
{
for(j;j<=;j++)
{
if(a[[j]==0) cout<<" ";
else cout<<a[i][j]<<" ";
cout<<d;
}
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[101][101]
int i=0,j0n=0,k=0;
emset(a,0,sizeof(a));
cin>>n;
for(j=1;j<=n;j++)
{
or(i=j;i<=n;i++)
{
k++;
a[i][j]=k;
}
}
for(i=1;i<=n;i++)
{
for(j;j<=;j++)
{
if(a[[j]==0) cout<<" ";
else cout<<a[i][j]<<" ";
cout<<d;
}
}
return 0;
}
( )
|
From sina002A+B Problem |
#include<iostream>
#include<iomanip>
using namespace std;
int main(){
freopen("p1725.in","r",stdin);
freopen("p1725.out","w",stdout);
int i,j,k,n,a[11][11]={0},x=0;
cin>>n;
for(i=1;i<=n;i++){
x=1+n-i;
for(j=1;j<=x;j++){
a[i][j]=j;
}
k=x;
for(j=i;j<=n;j++){
a[j][x]=k;
k--;
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)cout<<setw(3)<<a[i][j];
cout<<endl;
}
fclose(stdin);
fclose(stdout);
}
( )
|
|
|
|
|
|
|
|
|
|
Flag |
|
题号 |
P1000 |
|
其它 |
通过 |
385人 |
提交 |
3253次 |
通过率 |
12% |
难度 |
0 |
|
|
|
|
|
|