qq_40643731的博客

#include<stdio.h>#include<string.h>main(){ int n,len,flag1,flag2,flag3; scanf("%d",&n); char a[100];getchar();//消除enter while(n--) { gets(a);//有空格，不能用scanf flag1=0; flag2=0; flag...

#include<stdio.h>#include<math.h>int isprime(int x){ int n=sqrt(x)+1; if(x==1)return 0; if(x==2)return 1; for(int i=2;i<n;i++) { if(x%i==0)return 0; } return 1;}int solve(...

阅览室时间限制400 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者陈越天梯图书阅览室请你编写一个简单的图书借阅统计程序。当读者借书时，管理员输入书号并按下S键，程序开始计时；当读者还书时，管理员输入书号并按下E键，程序结束计时。书号为不超过1000的正整数。当管理员将0作为书号输入时，表示一天工作结束，你的程序应输出当天的读者借书次数和平均阅读时间。注意：由于线...

#include<stdio.h>#include<string.h>main(){ int n; char a[1005]; scanf("%d",&n); getchar(); gets(a); int len=strlen(a); int m=len/n+1; char b[100][100]; int k=0; for(int i...

#include<stdio.h>#include<string.h>#include<ctype.h>int solve(char a[]){ int len=strlen(a); int sum=0; for(int i=0;i<len;i++) { if(a[i]>='0'&&a[i]<='9') ...

#include<stdio.h>#include<string.h>main(){ int m,n,t,a[100000]={0}; scanf("%d",&m); while(m--) { scanf("%d",&n); if(n>1) {for(int i=0;i<n;i++) { scanf("%d&

#include<stdio.h>#include<string.h>int weight[18]={7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2};char s[]={'1','0','X','9','8','7','6','5','4','3','2'};int judge1(char a[]){ for(int i=0;i<...

#include<stdio.h>#include<string.h>main(){ char a[10005],c[10005]; int b[200]={0}; gets(a); gets(c); int len1=strlen(a); int len2=strlen(c); for(int i=0;i<len2;i++) { b[c[i...

#include<stdio.h>int main(void){ int n; char c; scanf("%d %c",&n,&c); int sum=1,k=1; for(int i=3;;i+=2) { sum+=2*i; if(sum<=n) { k++; } else break; } int space=0; for(int i=k;i...

#include<stdio.h>#include<string.h>typedef struct n{ int grade; int x; int y; char s[10];}problem;main(){ int m,n,flag[100]={0},sum,max=0;    char c; problem a[100]; scanf("%d %d",&m,&...

#include<stdio.h>#include<string.h>main(){ int n,i; char a[30],b[100]; scanf("%s %d",a,&n); getchar(); for(i=0;i<n;i++) { gets(b);//可能有空格，要用gets（） if(b[0]=='#'&&strlen(b)=...

#include<stdio.h>#include<stdlib.h>#define MAXN 1005typedef struct m{ int k; float kn;}num;int cmp(const void*a,const void*b){ num s1=*(num*)a; num s2=*(num*)b; return s2.k-s1....

#include<stdio.h>#include<stdlib.h>#include<string.h>#include<ctype.h>#define MAXN 100005struct node{ char name[7]; int grade; int num;}man[MAXN]={"",0,0,0};int cmp(const void ...

#include<stdio.h>#include<string.h>typedef struct n{ char name[16]; int h1; int m1; int s1; int h2; int m2; int s2;}man;int judge(man a,man b,int flag){ if(flag) { if(a.h1!...

#include<stdio.h>#include<stdlib.h>typedef struct d{ int id; int grade;}man;int cmp(const void*a,const void*b){ man s1=*(man*)a; man s2=*(man*)b; return s1.grade-s2.grade;}main(){ int n; m...

#include<stdio.h>#include<string.h>int flag[101];void solve(int x){ flag[x]=-1; for(int i=0;i<101;i++) { if(flag[i]==x) solve(i); }}main(){ ...