JeffreyDDD的博客

#include<stdio.h> #include<string.h> int main(){ char a[101]={0},tempb[101]={0},b[101]={0},lst[14]="0123456789JQK"; int len1,len2,i; scanf("%s %s",a,tempb); len1=strlen(a); len2=s

#include<stdio.h>#include<math.h>int main(){ int Galleon1,Sickle1,Knut1,sum1=0; int Galleon2,Sickle2,Knut2,sum2=0; int Galleon3=0,Sickle3=0,Knut3=0; int fee; scanf("%d.%d.%d",&Gal

#include<stdio.h> #include<stdlib.h> int legal(char a[]){ int dot = 0, i = 0, n1 = 0, n2 = 0; if(a[0]=='-') i=1;//跳过逗号计算数值 for(;a[i]!='\0';i++){//下面四句判断的顺序不能改变！！！ if((a[i]<48||a[i

#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;int origin[110],changed[110],temp[110],output[110];bool equals(int A[], int B[], int len){ for(in

#include<stdio.h> int main(){ int N,D,i,j,K,empty=0,mayempty=0,c=0; double e,select; scanf("%d %lf %d",&N,&e,&D); for(i=0;i<N;i++){ c=0;//一定不要忘记恢复初值 scanf("%d",&K);

#include <stdio.h>int main(){ int num,i,max,s[10001]={0},score,school; scanf("%d",&num); for(i=0;i<num;i++){ scanf("%d %d",&school,&score); s[school]=s[school]+score; }

#include<iostream>#include <string> using namespace std;int get (string hand,string a[]){//用于把初始三个字符串转换成不含[]的三个string数组 int k=0; for(int i=0;i<hand.size();i++){ if(hand[i]!='['&&hand

#include<stdio.h>void swap(int *A,int *B);void sort(int n[],int num);int main(){ int n[4]={},num=0,i=0,temp=0,a=0,b=0; scanf("%d",&num); temp=num; do{ for(i=0;i<4;i++){

#include<stdio.h> #include<math.h> int main(){ int num,i; double R1,P1,R2,P2,R,P; scanf("%lf %lf %lf %lf",&R1,&P1,&R2,&P2); P=R1*R2*(cos(P1+P2)); R=R1*R2*(sin(P1+P2)); if(P>-0

#include<cstring>#include<iostream>#include<algorithm>using namespace std;int main(){ int num=0,i=0,j=0,m=0,n=0,min,k=0; int a[10005]; scanf("%d",&num); min=num; for(i=0;i<num;i

#include<stdio.h> int main(){ int num,i; double a[100001],sum=0; scanf("%d",&num); for(i=0;i<num;i++){ scanf("%lf",&a[i]); sum+=a[i]*(num-i)*(i+1); } printf("%.

#include <stdio.h>#include <string.h>#include <ctype.h>int main(){ char br[300]={0}; char str[100010]; int i,j; scanf("%s%s",br,str); for(i=0;i<strlen(br);i++){ br[tolowe

#include<stdio.h>int main(){ int i,j,num,temp; char c; scanf("%d %c",&num,&c); temp=(num+1)/2; for(i=0;i<num;i++) printf("%c",c); printf("\n"); for(i=0;i<temp-2;i++){

#include<stdio.h>#include<math.h>int main(){ int num1,grade[100000],num2,count[100000],i,b[105]={0}; scanf("%d",&num1); for(i=0;i<num1;i++){ scanf("%d",&grade[i]); b[grade

#include<stdio.h>#include<string.h>int main(){ char sale[1005],red[1005],ch; int count[150]={0},len1,len2,i,count1=0,count2=0; gets(sale); gets(red); len1=strlen(sale); len2=s

#include<stdio.h> int main(){ int num,i,c[1001]={0},g,n1,n2,max=0,t=0; scanf("%d",&num); for(i=0;i<num;i++){ scanf("%d-%d %d",&n1,&n2,&g); c[n1]+=g; } for(i=0;i<100

#include<iostream>#include<algorithm>#include<string.h>using namespace std;int main(){ int num=0,i=0,max=0,count=0; int a[100005]={0},b[100005]={0},m[100005]={0}; scanf("%d",&num);

#include<stdio.h> int main(){ int num,i,c1=0,c2=0; int a1,a2,b1,b2; scanf("%d",&num); for(i=0;i<num;i++){ scanf("%d %d %d %d",&a1,&a2,&b1,&b2); if(a2!=a1+b1&&b2==a1+b1)

#include<stdio.h>#include<string.h>typedef struct tempString { char *mars; }tempString; int main(){ int n,i,j,num=0,len; char temp[10]; tempString low[13]={"tret", "jan", "feb

#include<stdio.h> #include<string.h> #include<ctype.h> int main(){ int num,i,len,sum=0,c1=0,c2=0; char a[10001]; gets(a); len=strlen(a); for(i=0;i<len;i++){ if('a'<=tolow

#include<stdio.h>int main(){ int n,i=0,j=0,a[11],sum1=0,sum2=0; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d",&a[i]); sum1+=a[i]; } sum2=sum1*11*(n-1); printf("%

#include<iostream>#include<cstring>#include<algorithm>using namespace std;struct Student{ char name[10]; int height;};bool cmp(struct Student s1,struct Student s2){ if(s1.height!=s2.h

#include<stdio.h>#include<string.h>#include<ctype.h>int main(){ char a[10001],count[70001]={0}; int i,len1,P=0,A=1,T=2,e=3,s=4,t=5; gets(a); len1=strlen(a); for(i=0;i<len1;i++){

#include<stdio.h>#include<string.h>#include<ctype.h>int main(){ char c[1001]; int count[1001]={0},i,len1,max=0,temp; gets(c); len1=strlen(c); for(i=0;i<len1;i++){ count[t

#include<stdio.h>typedef struct Stu{ long long num; int seat1; int seat2;}Stu;int main(){ Stu stu[1000]; int N,M,i,j,s1[1000]; scanf("%d",&N); for(i=0;i<N;i++){ s

#include<stdio.h>#include<string.h>int main(){ int len,i,t=0,at=0,pat=0; char str[100000]; gets(str); len = strlen(str); for(i=len-1;i>=0;i--){ if(str[i]=='T'){

#include <stdio.h>long long GCD(long long a, long long b) { //求最大公约数 long long m = a%b; while(m) { a=b; b=m; m=a%b; } return b; } void printF

大家应该都会玩“锤子剪刀布”的游戏：两人同时给出手势，胜负规则如图所示： 现给出两人的交锋记录，请统计双方的胜、平、负次数，并且给出双方分别出什么手势的胜算最大。输入格式：输入第1行给出正整数N（<=105），即双方交锋的次数。随后N行，每行给出一次交锋的信息，即甲、乙双方同时给出的的手势。C代表“锤子”、J代表“剪刀”、B代表“布”，第1个字母代表甲方，第2个代表乙方，中间有1个空格。输出格

#include<stdio.h>#include<string.h>int main(){ char A[1001]={0},Q[1001]={0};//注意数组初始值 int B=0,R=0,i=0,j=0; scanf("%s %d",A,&B); while(A[i]!=0){//如果A[i]=0则Q[i]=0 Q[i]=(R*10+A[i

#include<stdio.h>int main(){ int num,i; long long a[11]={0},b[11]={0},c[11]={0}; scanf("%d",&num); if(num<10){ for(i=0;i<num;i++){ scanf("%ld %ld %ld",&a[i],&b[i],&

#include<stdio.h> int main(){ int a=0,b=0,flag=0; char ch; do{ scanf("%d %d",&a,&b); ch=getchar(); if(b==0){ if(flag==0) printf("0 0");

#include<stdio.h>#include<string.h>int main(){ char s[20000]; int n=0,i,E; scanf("%s",&s); E=strchr(s,'E')-s;//E的位置 1 for(i=E+2;i<strlen(s);i++){ n=n*10+s[i]-'0';//小数点需要移

#include<stdio.h> #include <string.h>int main(){ char s[100]=""; gets(s); if(strchr(s,' ')==NULL){ printf(s); }else{ while(strchr(s,' ')!=NULL){ printf("%

#include<stdio.h>int main(){ int a[10]={0},i=0; for(i=0;i<10;i++){ scanf("%d",&a[i]); } for(i=1;i<10;i++){ if(a[i]!=0){ printf("%d",i); a[i]--;

#include<stdio.h>int main(){ int a=0,b=0,sum=0,d=0,i=0,count; int n[100]={0}; scanf("%d %d %d",&a,&b,&d); sum=a+b; while(sum!=0){ n[i]=sum%d; sum=sum/d; i++

#include<stdio.h>int main(){ char n[1001]={0}; int i,c[10]={0},t=0; scanf("%s",n); for(i=0;n[i]!=0;i++){ c[n[i]-'0']++; } for(i=0;i<10;i++){ if(c[i]>0){

#include<stdio.h> #include<math.h> int main(){ int num,i,j,t=0,s[100000]={0},count=0; scanf("%d",&num); if(num<100000){ for(i=2;i<=num;i++){ if(isPrime(i)){

#include<stdio.h>int main(){ int n,m,i,a[1000]={0}; scanf("%d",&n); scanf("%d",&m); m=m%n; for(i=0;i<n;i++){ scanf("%d",&a[i]); } for(i=0;i<n;i++){ a[n+i]=a

#include<stdio.h>int main(){ int num=0,a=0,b=0,c=0,i=0; scanf("%d",&num); if(num<1000){ if(num>=100){ a=num/100; b=(num-100*a)/10; c=num-100*a-1

#include<stdio.h>#include <string.h>int main(){ int num,i; int score=0,max=-1,min=101; char maxname[20],maxstuNum[20],minname[20],minstuNum[20],name[20],stuNum[20]; scanf("%d",&num);