- 博客(42)
- 资源 (3)
- 收藏
- 关注
原创 杭电OJ-2123(C)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=2123#include <stdio.h>#include <string.h>int main(){ int n,m,num[10][10],i,j,k; memset(num,0,sizeof(num)); for(i=1;i<10;i++) for(j...
2020-02-29 23:26:38 170
原创 杭电OJ-2107(C)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=2107#include <stdio.h>#include <string.h>int main(){ int n,max,num; while(scanf("%d",&n)!=EOF) { if(n==0) break; scanf("%d",&a...
2020-02-29 23:09:16 194
原创 杭电OJ-2265(C)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=2265#include <stdio.h>#include <string.h>typedef struct{ char ch; int flag;}aa;int main(){ char a[800]; aa en[800]; memset(a,0,siz...
2020-02-29 17:47:26 116
原创 杭电OJ-2101(C)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=2101#include <stdio.h>int main(){ int a,b; while(scanf("%d%d",&a,&b)!=EOF) { if((a+b)%86==0) printf("yes\n"); else printf("no\n")...
2020-02-29 16:51:26 168
原创 杭电OJ-1235(C)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1235#include <stdio.h>#include <string.h>int main(){ int n,a[1100],score,count; while(scanf("%d",&n)!=EOF) { if(n==0) break; cou...
2020-02-29 16:37:03 172
原创 杭电OJ-1229(C)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1229#include <stdio.h>#include <math.h>int main(){ int a,b,n; while(scanf("%d %d",&a,&b)!=EOF) { if(a==0&&b==0) brea...
2020-02-29 16:19:20 168
原创 杭电OJ-2074(C)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=2074`#include <stdio.h>#include <string.h>int main(){ int n,flag,count=0; char a[6],b,pic[90][90]; while(~scanf("%d %c %c",&n,&...
2020-02-28 22:27:44 424
原创 杭电OJ-2034(C)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=2034#include <stdio.h>typedef struct{ int num,flag;}aa;aa a[110],b;int n,m,count;void deal(int num){ for(int i=0;i<n;i++) if(a[i].num==...
2020-02-28 16:57:47 355
原创 杭电OJ-1039(C)
#include <stdio.h>#include <string.h>int is_vowel(char ch){ switch(ch) { case 'a': return 1;break; case 'e': return 2;break; case 'i': return 3;break; case 'o': return 4;break...
2020-02-28 15:26:53 257
原创 杭电OJ-1076(C)
#include <stdio.h>#define ll long longint is_y(ll y){ if(y%4==0&&y%100!=0) return 1; else if(y%400==0) return 1; return 0;}int main(){ int n,t; ll y; scanf("%d",&n); ...
2020-02-27 16:08:54 262
原创 杭电OJ-1020(C)
#include <stdio.h>int main(){ int n; char a[10008],ch; scanf("%d",&n); getchar(); for(int i=0;i<n;i++) { gets(a); int count=0,j=0; while(a[j]) { ch=a[j++];count++; w...
2020-02-27 15:40:00 369
原创 杭电OJ-1228(C)
#include <stdio.h>#include <string.h>#include <ctype.h>char num[][10]={"zero","one","two","three","four","five","six","seven","eight","nine"};int deal(char a[]){ for(int i=0;i&...
2020-02-27 08:59:26 168
原创 杭电OJ-1219(C)
#include <stdio.h>#include <string.h>#include <ctype.h>#define max 100008int main(){ int a[30]; char b[max]; while(gets(b)) { memset(a,0,sizeof(a)); for(int i=0;i<str...
2020-02-26 22:40:04 183
原创 杭电OJ-1002(C)
#include <stdio.h>#include <string.h>int main(){ //笨办法,但能AC char a[1000],b[1000],c[2000]; int t,count,lenth1,lenth2; scanf("%d",&t); getchar(); for(int i=1;i<=t;i++) { me...
2020-02-26 21:47:09 167
原创 杭电OJ-1058(C)
#include <stdio.h>#include <string.h>int MIN(long long a,long long b){ if(a>b) return b; else return a;}int main(){//先找出满足题意的所有数 int n,pos1,pos2,pos3,pos4; long long a[5843],m...
2020-02-26 17:25:31 200
原创 杭电OJ-1042(C)
#include <stdio.h>#include <string.h>#define max 100000int main(){ //大数阶乘,多位一存 int a[100005],n; long long jinwei,weishu,num; while(scanf("%d",&n)!=EOF) { memset(a,0,sizeof(a...
2020-02-25 23:13:35 244
原创 杭电OJ-1040(C)
#include <stdio.h>#include <string.h>#define MAX 1000000int main(){ int t,n,i,a,max,num[MAX]; scanf("%d",&t); while(t--) { max=0; memset(num,0,sizeof(num)); scanf("%d"...
2020-02-24 22:15:33 465
原创 杭电OJ-2095(C)
#include <stdio.h>#include <string.h>int main(){ int n,a[9999][2],i,j,num,count; //a[][0]:number a[][1]:count while(scanf("%d",&n)&&n!=0) { count=0; memset(a,0,sizeof...
2020-02-15 21:46:29 350
原创 杭电OJ-2043(C)
#include <stdio.h>#include <string.h>#include <ctype.h>int main(){ int n,i,b[4],count_type,count_num; char ch; scanf("%d",&n); getchar(); for(i=0;i<n;i++) { memset...
2020-02-15 21:17:02 211
原创 杭电OJ-2138(C)
#include <stdio.h>#include <math.h>//素数英文:prime numberint deal(int a){ int i; if(a==2||a==3) return 1; for(i=2;i<=(int)sqrt(a*1.0);i++) if(a%i==0) return 0; return 1;}int ma...
2020-02-15 14:17:49 282
原创 杭电OJ-1108(C)
#include <stdio.h>int deal(int a,int b){ if(a%b==0) return b; else return deal(b,a%b);}int main(){ int a,b,c,r; //缺少!=EOF,提示TLE while(scanf("%d %d",&a,&b)!=EOF) { if(a<b)...
2020-02-15 13:11:07 302
原创 杭电OJ-2099(C)
#include <stdio.h>#include <string.h>int main(){ int a,b,i,c,d[100],count; while(scanf("%d %d",&a,&b)&&a!=0&&b!=0) { a=a*100;count=0; memset(d,0,sizeof(d)...
2020-02-15 11:35:52 263
原创 杭电OJ-2098(C)
#include <stdio.h>#include <math.h>int deal(int a){ int i,flag=1; if(a==2||a==3) return 1; for(i=2;i<=(int)sqrt(a*1.0);i++) if(a%i==0) flag=0; return flag;}int main(){ int n...
2020-02-15 11:16:04 417
原创 杭电OJ-2097(C)
#include <stdio.h>int deal(int n,int m){ int sum=0; while(n!=0) { sum=sum+n%m; n=n/m; } return sum;}int main(){ int n,sum10,sum16,sum12; while(scanf("%d",&n)&&n!=0) ...
2020-02-14 23:23:45 285
原创 杭电OJ-2096(C)
#include <stdio.h>int deal(int a){ if(a>=100) a=a%100; return a;}int main(){ int t,i,a,b,sum; scanf("%d",&t); for(i=0;i<t;i++) { scanf("%d %d",&a,&b); a=deal(a);...
2020-02-14 23:13:30 325
原创 杭电OJ-2070(C)
#include <stdio.h>int main(){ long long i,n,a1,a2,sum; while(scanf("%lld",&n)&&n!=-1) { sum=0;a1=0;a2=1; if(n==0) sum=0; else if(n==1) sum=1; else { for(i=2;i<=n;i...
2020-02-14 21:17:57 332 1
原创 杭电OJ-2071(C)
#include <stdio.h>int main(){ int t,n,i,j; double m,max; scanf("%d",&t); for(i=0;i<t;i++) { max=0; scanf("%d",&n); for(j=0;j<n;j++) { scanf("%lf",&m); if(m...
2020-02-14 21:05:30 298
原创 杭电OJ-2091(C)
#include <stdio.h>#include <string.h>#include <stdlib.h>int main(){ char b[500][500],ch; int n,i,j,flag=1; while(scanf("%c",&ch)&&ch!='@') { scanf("%d",&n);...
2020-02-14 20:57:17 207
原创 杭电OJ-1004(C)
#include <stdio.h>#include <string.h>int main(){ int n,t[1000]={0},i,j,num,max,pos; char a[20],b[1000][20]; while(scanf("%d",&n)!=EOF&&n!=0) { num=0; memset(t,0,size...
2020-02-13 22:31:13 420
原创 杭电OJ-2030(C)
#include <stdio.h>#include <string.h>int main(){ char a[10000]; int n,i,j,t; scanf("%d",&n);getchar(); for(i=1;i<=n;i++) { gets(a); t=0; for(j=0;j<strlen(a);j++)...
2020-02-12 23:30:00 274
原创 杭电OJ-2055(C)
#include <stdio.h>int main(){ int n,i,x,y; scanf("%d",&n); for(i=1;i<=n;i++) { getchar(); scanf("%c %d",&x,&y); if(x>='a'&&x<='z') printf("%d\n",-1*(x-9...
2020-02-12 23:06:35 375
原创 杭电OJ-2032(C)
#include <stdio.h>#include <string.h>int main(){ int n,a[40][40],i,j; //!=EOF是我PE原因 while(scanf("%d",&n)!=EOF) { memset(a,0,sizeof(a)); for(i=1;i<=n;i++) for(j=1;j<...
2020-02-12 21:48:45 195
原创 杭电OJ-2040(C)
#include <stdio.h>int main(){ int n,a,b,i,sum1,sum2,j; scanf("%d",&n); for(i=1;i<=n;i++) { sum1=sum2=1; scanf("%d%d",&a,&b); for(j=2;j<a;j++) if(a%j==0) sum1+=j...
2020-02-12 21:13:49 164
原创 杭电OJ-2042(C)
#include <stdio.h>int main(){ int n,i,m,sum; scanf("%d",&n); for(i=0;i<n;i++) { sum=3; scanf("%d",&m); for(int j=1;j<=m;j++) sum=(sum-1)*2; printf("%d\n",sum); } ...
2020-02-12 20:55:56 134
原创 杭电OJ-2024(C)
#include <stdio.h>#include <string.h>#include <ctype.h>int main(){ int n,i; char a[80]; scanf("%d",&n); getchar(); while(n>=1) { gets(a); //puts(a); if(!(a[0...
2020-02-12 15:51:28 172
原创 杭电OJ-1197(C)
#include <stdio.h>int main(){ int n,sum1,sum2,sum3,a,b; for(n=2992;n<=9999;n++) { sum2=sum3=0; sum1=n/1000+n%1000/100+n%100/10+n%10; a=b=n; while(!(a==0&&b==0)) { su...
2020-02-12 15:27:26 403 2
原创 杭电OJ-2734(C)
#include <stdio.h>#include <string.h>#include <ctype.h>int main(){ char a[300],ch; int i,sum; gets(a); while(strcmp(a,"#")!=0) { sum=0; for(i=0;i<=strlen(a);i++) if...
2020-02-11 23:02:10 462
原创 杭电OJ-1064(C)
#include <stdio.h>int main(){ double n,sum=0; int i=0; while(scanf("%lf",&n)) { sum=sum+n; i++; if(i==12) { printf("$%.2lf\n",sum/12); break; } } return 0;}
2020-02-11 22:39:11 509
原创 杭电OJ-2104(C)
#include <stdio.h>int main(){ int i,n,m,a; while(scanf("%d%d",&n,&m)&&m!=-1&&n!=-1) { if(n>m) {//m大,n小 a=m;m=n;n=a; } while(n!=0&&n!=1) { ...
2020-02-11 22:31:42 374
原创 杭电OJ-1062(C)
#include <stdio.h>#include <string.h>int main(){ int t,i,mem; char a[1000]; scanf("%d",&t); getchar(); for(i=0;i<t;i++) { gets(a); mem=0; for(int j=0;j<=strlen(a);...
2020-02-11 21:52:02 892
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人