na的博客

约瑟夫环问题，C语言（输出先后被淘汰顺序`#include<stdio.h>int main(){ int n,m,count=0,i,j; int flags[42]; scanf("%d%d",&n,&m); for(i=1;i<=n;i++) flags[i]=1; for(i=1,j=0;;i++) { if(flag

#include<stdio.h>struct player{ int num,score,rand;}p[1001];int main(){ int n,i,j; struct player tmp1,tmp2,tmp3; scanf("%d",&n); for(i=0;i<n;i++){ p[i].num=i+1; scan

ccf消除类游戏#include<stdio.h>int main(){ int m,n; int i,j,num; int a[31][31]; int flags[31][31]; scanf("%d%d",&m,&n); for(i=0;i<m;i++) { for(j=0;j<n;j++) {

ccf画图#include<stdio.h>int main(){ struct Rec { int x1;int y1; int x2;int y2; }; int n,x,y,num=0,x1,y1,x2,y2; struct Rec r; int flag[100][100]={0}; scanf("%d

ccf最大矩形#include<stdio.h>int main(){ int n,i,j,k,m; int h[1001]; int minhigh,area,maxarea=-1; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&h[i]); } for(k=1;k

ccf日期计算#include<stdio.h>int isrun(int y){ if(y%4==0&&y%100!=0||y%400==0) { return 1; }else { return 0; }} int main(){ int year,month=0,day,days=0,sum=0,

ccf数字排序#include<stdio.h>struct Rank { int v; int s; }a[1001];int main(){ int n,i,x,j; int num=0; scanf("%d",&n); for(i=0;i<1001;i++) { a[i].v=i;

ccf窗口include

ccf之ISBN号码#include<stdio.h>#include<string.h>char isbn(char s[13]){ int a[10]; a[0]=s[0]-'0'; a[1]=s[2]-'0'; a[2]=s[3]-'0'; a[3]=s[4]-'0'; a[4]=s[6]-'0'; a[5]=s[7]-'0';

ccf节日（C语言）#include<stdio.h> int isrun(int y) { if((y%4==0&&y%100!=0)||(y%400==0)) { return 1; }else{ return 0; } }int main(){ in

CCF火车购票（C语言） /**/#include<stdio.h>int main(){ int i,n,a[21][6],flag,j,k,x; int flags[20][5]={0}; for(i=0;i<20;i++) { a[i][5]=5; } scanf("%d",&n); for(k=0;k<n;k++