qq_2918的博客

#include<stdio.h>int main(){int i, j, n, jia=0, yi=0, a[110][4];scanf("%d",&n);for(i=0;i<n;i++){ for(j=0;j<4;j++) scanf("%d",&a[i][j]);}for(i=0;i<n;i++){ if(a[i][0]+a...

#include<stdio.h>#include<string.h>int main(){char s1[85], s2[85];int i, j;int table[130]={0};scanf("%s%s",s1,s2);for(i=0;i<strlen(s1);i++){ if(s1[i]>='a'&&s1[i]<='...

#include<stdio.h>char name[100003][7]={""};int main(){ int i, yy, mm, dd, birthday=0, max=0, min=10000000, da=0, xiao=0, count=0, n, score[1001]={0}; scanf("%d",&n); for(i=1;i<=n;i++...

#include<stdio.h>int main(){int n, i, j, sum=0, rest=0,loop=1;char c;scanf("%d %c",&n,&c);for(i=1;sum<=n;i=i+2){ if(i==1){sum+=i; } else {sum=sum+i*2; }}if(i!=3){sum=sum-(i-2...

#include<stdio.h>#include<time.h>int main(){ long long c1, c2; double cha; int h, m, s; scanf("%lld%lld",&c1,&c2); cha=((double)(c2-c1))/100; if((cha-(int)cha)<0.5)cha=(...

#include<stdio.h>#include<algorithm>using namespace std;struct pnode{ int address; int data; int next; int order;}node[100010];bool cmp(pnode a,pnode b){ return a.order<b....

#include<stdio.h>#include<string.h>int main(){ int i, j, z=0, len1, posi, exp=0; double temp=0.0, weigh=0.1; char cc[100000]; scanf("%s",cc); len1=strlen(cc); if(cc[0]=='-')printf...

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

#include<stdio.h>int main(){int i=1, j, a, b , d, sum;int yushu[31];scanf("%d%d%d",&a,&b,&d);sum=a+b;do{ yushu[i++]=sum%d; sum=sum/d;}while(sum!=0);for(j=i-1;j>0;j--)pr...

#include<stdio.h>#include<string.h>int main(){ int i, n, lenth, ans[10]={0,0,0,0,0,0,0,0,0,0}; char c[1002]; gets(c); lenth=strlen(c); for(i=0;i<lenth;i++){ ans[c[i]-'0']...

#include<stdio.h>#include<algorithm>using namespace std;struct thing{ double store, sell, price;}things[1010]; bool cmp(thing a, thing b){ return a.price>b.price;}int main(){i...

#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;bool cmp(int a, int b){ return a>b; }char n[4]={'0','0','0','0'};int main(){int i, len, temp1,t...

#includechar a[100002][2];int main(){int i, j, n, jias=0, ping=0, yis=0;int jiab=0, jiac=0, jiaj=0, yib=0, yic=0, yij=0;char jia, yi;scanf("%d",&n);for(i=0;i<n;i++) for(j=0;j<2;j++) scanf("%

#include#includestruct big{ int d[1010] , len; big(){ len=0; memset(d,0,sizeof(d)); }};big change(char a[]){ int i,len; len=strlen(a); big c; for(i=0;i<len;i++){ c.len=len; c.d[i]=a

#include#includeusing namespace std;int aa[100010]={0};int main(){int i, j, n, p, m, M, left, right, mid, ans=1;scanf("%d%d",&n,&p);for(i=0;i<n;i++)scanf("%d",&aa[i]);sort(aa,aa+n);for(i=0;i

#include#includeint result(int a, char b){ if(a==0&&b=='1')return 1; if(a==1&&b=='0')return 1; if(a==2&&b=='X')return 1; if(a==3&&b=='9')return 1; if(a==4&&b=='8')return 1; if(a==5&&b=='7')ret

#include&lt;stdio.h&gt;#include&lt;algorithm&gt;using namespace std;int a[100010]={0},maxx[100010]={0},minn[100010]={0},ans[100010]={0};int main(){int i, n, max=0, min=1000000000;scanf("%d",&amp...

#include&lt;stdio.h&gt;#include&lt;iostream&gt;#include&lt;string&gt;#include&lt;map&gt;using namespace std;string aaa[13]={"tret","jan","feb","mar","apr","may&quot

#include&lt;stdio.h&gt;#include&lt;string.h&gt;int main(){int i, len, ascall[130]={0};char maxc,s[10010];gets(s);len=strlen(s);for(i=0;i&lt;len;i++){ if(s[i]=='P')ascall[s[i]]++; if(s[i]=='A'...

#include&lt;stdio.h&gt;#include&lt;string.h&gt;int main(){int i, len, max=-1,ascall[130]={0};char maxc,s[1010];gets(s);len=strlen(s);for(i=0;i&lt;len;i++){ if(s[i]&gt;='A'&amp;&amp;s[i]&lt;='Z...

#include&lt;stdio.h&gt;int main(){ int i, j, k, n, m, zuowei[1001][2]={0}, s[1001]={0}; char c[1001][15]={""}; scanf("%d",&amp;n); for(i=0;i&lt;n;i++){ scanf("%s%d%d",c[i],&amp;zuowei[i][0],&a..

#include&lt;stdio.h&gt;#include&lt;algorithm&gt;#include&lt;string.h&gt;using namespace std;int main(){char c[100010];int i, len, nump[100010]={0},numt[100010]={0};long long ans=0;scanf("%s",...

#include#includeint main(){int i, len, flag=0, sum=0, ascall[130]={0};char shop[1010], eva[1010];scanf("%s%s",shop,eva);len=strlen(shop);for(i=0;i<len;i++){ ascall[shop[i]]++;}len=strlen(ev

#includeint main(){int i, n, k, temp, grade[105]={0};scanf("%d",&n);for(i=0;i<n;i++){ scanf("%d",&temp); grade[temp]++;}scanf("%d",&k);for(i=0;i<k;i++){ scanf("%d",&temp); printf("%d",grade

#includeint main(){ int a, b, c, m, n, p,t1=0,t2=0, t3=0; long long temp=0, sum1=0,sum2=0; scanf("%d.%d.%d %d.%d.%d",&a,&b,&c,&m,&n,&p); sum1=a*17*29+b*29+c; sum2=m*17*29+n*29+p; if(sum1>sum2){

#includeint main(){ int i, j, n, hang; char c; scanf("%d %c",&n,&c); if(n%2==0)hang=n/2; else hang=n/2+1; for(i=0;i<n;i++)printf("%c",c); printf("\n"); for(i=0;i<hang-2;i++){ printf("%c"

#include#includeusing namespace std;long long gcd(long long a,long long b){ if(b==0)return a; else return gcd(b,a%b);}void show(long long up,long long down){ long long d; if(down<0){up=-

#include#includechar s1[100010];int main(){int i, j, len, big=0, ascall[130], outflag=0;memset(ascall,0,sizeof(ascall));gets(s1);len=strlen(s1);for(i=0;i<len;i++){//处理s1 if(s1[i]=='+')big=1;

#includeint a[100010];int main(){int n,i, k, temp=0, max=0,maxk=0,maxtemp=0;scanf("%d",&n);for(i=0;i<n;i++){ scanf("%d",&k); scanf("%d",&temp); a[k]+=temp;}for(i=1;i<=n;i++){ if(maxtemp<a[

#includeint main(){ int i, a, b; long long temp, da, db, suma=0, sumb=0; scanf("%lld%d%lld%d",&da,&a,&db,&b); for(temp=da;temp!=0;temp=temp/10){ if(temp%10==a) suma=suma*10+a; } fo

#include#include#includeusing namespace std;struct people{ char id[16]; int tanlent; int vietue; int clas;}peo[100010];bool cmp(people a, people b){ if( a.clas!=b.clas )return a.clas<b.clas

#include#includeint main(){ int i, j, len1, len2, ans[120]={0},tempweek, temphour, tempm; char aa[65], bb[65], cc[65], dd[65]; char week[7][4]={"MON","TUE","WED","THU","FRI","SAT","SUN"}; scanf(

#include&lt;stdio.h&gt;int main(){int i, j, n, m, a, b, to, temp;scanf("%d%d%d%d%d",&amp;m,&amp;n,&amp;a,&amp;b,&amp;to);for(i=0;i&lt;m;i++){ for(j=0;j&lt;n;j++){ scanf("%d",&amp;temp); i

#include#includeusing namespace std;int peo[100010]={0};int main(){int i, n, a, b, m;scanf("%d",&n);for(i=0;i<n;i++){ scanf("%d%d",&a,&b); peo[a]=b; peo[b]=a;}scanf("%d",&m);set st, temp;

#include#includeusing namespace std;int getnum(int a){ int sum=0; while(a>0){ sum+=a%10; a/=10; } return sum;}int main(){int i, n, a;set st;scanf("%d",&n);for(i=0;i<n;i++){ scanf("%d

#include//#include#includeusing namespace std;double get(int a, int b){ return sqrt(double(a*a+b*b));}int main(){int i, n, a, b;double ans=0;scanf("%d",&n);for(i=0;i<n;i++){ scanf("%d%d",&

#include#includeusing namespace std;int gcd(int a, int b){ if(b==0) return a; else return gcd(b,a%b);}int main(){int i, n1,m1, n2,m2, k, count=0;double low=0, high=0;scanf("%d/%d %d/%d %d",&

#includeint main(){int i, j, n, m, temp, score;int standard[110]={0}, sta_ans[110]={0};scanf("%d%d",&n,&m);for(i=1;i<=m;i++)scanf("%d",&standard[i]);for(i=1;i<=m;i++)scanf("%d",&sta_ans[i]);fo

#includeint day[1000010]={0}, day1[1000010]={0};int main(){int i, n, max=0, temp, pre=1000005, sum=0, result=0;scanf("%d",&n);for(i=0;i<n;i++){ scanf("%d",&temp); day[temp]++; if(temp>max)max

#include#includeint flag[10010]={0};bool check(int k){ int i, sqr=(int)sqrt(double(k)); for(i=2;i<=sqr;i++){ if(k%i==0)return false; } return true;}int main(){int i, n, k, rank=1, temp;sc