![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
joj
fangzhiyang
这个作者很懒,什么都没留下…
展开
-
joj1000
#includeint main(){int a,b;while(scanf("%d%d",&a,&b) !=EOF){printf("%d\n", a+b);}return 0;原创 2011-10-07 13:43:45 · 519 阅读 · 0 评论 -
joj1009
#include #include using namespace std;int main (){ int n,i,j;char ch,h;int temp=1;while (c原创 2011-10-07 13:49:19 · 274 阅读 · 0 评论 -
joj1997
1997: Simple Problem IResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s10240K2002699StandardI have just typed an article, but I didn't notice that my原创 2011-10-20 17:56:29 · 292 阅读 · 0 评论 -
joj2318
2318: DiamondResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s16384K1552578StandardDraw a diamond shape with character '*'.InputThere are several原创 2011-10-19 19:16:26 · 345 阅读 · 0 评论 -
joj 1270
1270: Triangle WaveResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K1339684StandardIn this problem you are to generate a triangular wave for原创 2011-10-19 18:33:06 · 320 阅读 · 0 评论 -
joj1240
1240: The DecoderResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K849169StandardWrite a complete program that will correctly decode a set of cha原创 2011-10-23 16:16:32 · 460 阅读 · 0 评论 -
joj 2526
ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s65536K1066244Standard辰辰是个天资聪颖的孩子,他的梦想是成为世界上最伟大的医师。为此,他想拜附近最有威望的医师为师。医师为了判断他的资质,给他出了一个难题。医师把他带到一个到处都是草药的山洞里对他说:“孩原创 2011-11-06 20:56:05 · 370 阅读 · 0 评论 -
2534: The Hero Rescued The Princess
2534: The Hero Rescued The PrincessResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s65536K30892Standard美丽的公主被关在古老的施了咒语的城堡中,你作为当今世上最勇敢的英雄,决定救出这位美丽的公主。原创 2011-12-11 17:43:16 · 401 阅读 · 0 评论 -
joj 2431: Shift and Increment
2431: Shift and IncrementResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE5s16384K1362215StandardShift and increment is the basic operations of the ALU原创 2011-12-11 17:36:28 · 391 阅读 · 0 评论 -
joj1006
#includeusing namespace std;int main(){ int r,a,b,c,t,i,n; int count,count1 ,count2; int h[1000]={0},m[1000]={0},w[1000]={0};原创 2011-10-07 13:47:19 · 276 阅读 · 0 评论 -
joj1005
#includeusing namespace std;int main(){ int n; while(cin>>n,n) { if(n%4==2) cout<<n<<" "<<"is the sum of four consecuti原创 2011-10-07 13:46:32 · 249 阅读 · 0 评论 -
joj1004
/*#includemain(){ double n; double sum=0; while(scanf("%lf",&n)!=EOF) { sum+=n; } if(sum>(int)su原创 2011-10-07 13:11:06 · 348 阅读 · 0 评论 -
joj1004
#include #include #include #include using namespace std;const int maxn=2000;double oct[8]={0,125,250,3原创 2011-10-07 13:45:49 · 294 阅读 · 0 评论 -
joj1011
#include using namespace std;int cmp(constvoid *a, constvoid *b){return *(int *)a - *(int *)b;}原创 2011-10-07 13:50:00 · 391 阅读 · 0 评论 -
joj1006
#include#includeusing namespace std;int main(){ int n; while(cin>>n) { while(n--) { int a[1000]={0},b[1000]={0}原创 2011-10-07 13:19:55 · 301 阅读 · 0 评论 -
joj1011
/*#includeusing namespace std;void sort(int *a,int m,int n){ int i,j,temp,k; if(m { i=m,j=n+1,k=a[m]; while(i { i=i原创 2011-10-07 13:23:10 · 269 阅读 · 0 评论 -
joj1007
#includeint main(){ int n, i, j,c; while(scanf("%d", &n), n) { for(j=1;j*(j+1) { if(j*(j+1)==2*n) { print原创 2011-10-07 13:30:52 · 258 阅读 · 0 评论 -
joj1001
#includemain(){double n;double sum=0; while(scanf("%lf",&n)!=EOF){sum+=n;}if(s原创 2011-10-07 13:44:42 · 410 阅读 · 0 评论 -
1007joj
#includeint main(){int n , i , j , k;while(scanf("%d", &n), n){ for(i=1;i*(i+1) < 2*n ; i++); { if(i*(i+1) == 2*n)原创 2011-10-07 13:48:07 · 317 阅读 · 0 评论 -
joj2484
#include#includeusing namespace std;int main(){ int n,i;while(cin>>n,n){for(i=1;i2*n+1;i++)原创 2011-10-07 13:50:40 · 340 阅读 · 0 评论 -
joj 1195
1195: Prime Ring ProblemResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE10s8192K1973499StandardA ring is composed of n circles as shown in diagram. Pu原创 2011-12-13 20:06:02 · 362 阅读 · 0 评论