yyd_s的博客

#include <stdio.h>int main(void){ int k, j, l, n, i; char ch[2]; scanf("%d %s",&n,ch); k = 22; while (2 * k * k > n + 1) k--; for (i = k; i >= 1;i--) { for (j = 1;j<=k-i; j++) printf(" "); for (j = 1;j<=2*i-1; j++)...

#include <iostream>#include <string.h>using namespace std;int main(){ char str[100010]; cin>>str; int countp=0,countt=0; int length=strlen(str); int flag[length][2]; int count=0; int p=0,t=length-1; wh.

#include <stdio.h>#include <string.h>int main(){ char h[1000], s[1000]; int book[1000] = { 0 }, i, j, a, b; scanf("%s %s",s,h); a = strlen(h); b = strlen(s) - strlen(h); for (i = 0; i < strlen(h); i++) { for (j = 0; j < strlen(.

#include<stdio.h>int main(void){ int book[101] = { 0 }; int i, j,m,k; scanf("%d", &m); for (i = 0; i < m; i++) { scanf("%d", &j); book[j]++; } scanf("%d", &k); for (i = 0; i < k; i++) {.

#include <stdio.h>#include <string.h>#include<math.h>int main(void){ int i, s, k, j, m ,n ,t; long g, suma = 0,sump = 0,r; char p[20], a[20]; g = 0; s = k = 0; scanf("%s %s", p, a); m = 0; n = 2; for (i = 0; i < strlen(p);.

#include <stdio.h>int main(void){ int i, j, l, h; char ch[2]; scanf("%d %s", &l, ch); if (l % 2 == 0) h = l / 2; else h = l / 2 + 1; for (i = 0; i < l; i++) printf("%c", ch[0]); printf("\n"); for (i = 1; i < h - 1; i++) { .

#include <stdio.h>struct num { long long u; long long d;};void sn( long long a1,long long a2) { if (a1 == 0) { printf("0"); return; } long long t,a,b; if (a1 > 0) a = a1; else a = -a1; b = a2; if (a >= b) { while (a % b .

#include<iostream>#include<string>#include<cctype>using namespace std;int main(void) { int a,book[127] = {0},i,f; string ch, p; getline(cin,ch); getline(cin, p); a=f=0; for (i = 0; i <ch.size(); i++) { if (ch[i]=='+') a.

#include<stdio.h>int main(void) { int i, max,maxi,m, sum[100002] = {0},bh,score,bhmax; bhmax = 0; scanf("%d", &m); for (i = 0; i < m; i++) { scanf("%d %d",&bh,&score); sum[bh] += score; if (bhm.

#include <stdio.h>int main(void) { int q[17] = { 7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2 },i,m,sum,j,k,p,t; char w[11][1] = {'1','0','X','9','8','7','6','5','4','3','2'};//1 0 X 9 8 7 6 5 4 3 2 char ch[1000][180]; sum=k=0; t = 17; scanf("%d", &am.

#include<stdio.h>#include<string.h>void quicksort(long left,long right,long* b) { int i, j, t, temp; if (left > right) return; temp = b[left]; i = left; j = right; while (i != j) { while (b[j] >= temp && i < j) .

#include <stdio.h>#include <string.h>#include <ctype.h>int main(void) { char ch[85], fa[85]; int i; int book[127] = { 0 }; scanf("%[^\n]", ch); getchar(); scanf("%[^\n]", fa); for (i = 0; i <strlen(ch); i++) { if (!strchr(.

#include<stdio.h>#include<string.h>int main(void) { int i, j, m; long a, max, min; char name[6],age[11],aname[6],iname[6]; max = 0; min = 20140907; scanf("%d", &m); j = 0; for (i = 0; i < m; i++) { scanf("%s %s", name, .

#include <stdio.h>int main(void) { long c1, c2; int t,s,f,m; double a; scanf("%ld %ld", &c1, &c2); s = f = m = 0; t = (int)(c2 - c1) * 1.0 / 100 + 0.5; if (a >= 0.5) t += 1; if (t > 3600) { s = t / 3600; t = t % 3600; }.

#include <stdio.h>#include<string.h>#include<math.h>int main(void) { int n, p, i, m, book[2] = {0}, sum, s, x; char ch[99990]; x = 0; scanf("%s", ch); if (ch[0] == '-') book[0] = 1; if (ch[1] == '0') x = 1; for (i = 1; i &l.

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

#include<stdio.h>void f(long long i,int d){ int j; j=i%d; if(i>=d) f(i/d,d); printf("%d",j);}int main(void){ long long A,B; int D; scanf("%lld %lld %d",&A,&B,&D); f(A+B,D); return 0;}

#include<stdio.h>#include<string.h>int main(void) { int i, a[10] = { 0 }, max = 0; char ch[1001]; scanf("%s", ch); for (i = 0; i < strlen(ch); i++){ a[ch[i] - '0']++; } for (i = 9; i >= 0; i--) { if (a[i] > 0 &&.

#include<stdio.h>struct bing { double ton; double sp; double p;};int main(void){ struct bing q[1001],t; int i,m,total,j; scanf("%d %d", &m, &total); for (i = 1; i <= m; i++) { scanf("%lf", &q[i]..

#include<stdio.h>#include<math.h>int powa(int i) { int j,k=1; for (j = 1; j <= i; j++) { k*= 10; } return k;}int main(void) { int i, j, n,max,min,middle; scanf("%d", &n); max = min = 0; if (n .

#include<stdio.h> int main(void){ int m, i, a[4] = { 0 }, b[4] = { 0 }, wj, mj, lj, wy, my, ly, maxa,maxb; wj = mj = lj = wy = my = ly = 0; maxa = maxb = -1; char jh[2], yh[2]; scanf("%d", &m); for (i = 0; i <..

#include<stdio.h>#include<string.h>int main() { char a[1000], q[1000]; int b, r, i; r = 0; scanf("%s",a); scanf("%d", &b); for (i = 0; i < strlen(a); i++) { r= r * 10 + a[i] - '0'; q[i] = r / b+.

#include<stdio.h>int pow(int i) { int j, k=1; for (j = 0; j <i; j++) { k *= 10; } return k;}int main(void) { int da, na,db, nb, m; long int a, b; na = nb = 0; m = -1; scanf("%ld %d %ld %d", &a, &.

#include<stdio.h>#include<string.h>int main(void) { int i, k; char a[60], b[60], c[60], d[60]; scanf("%s %s %s %s", a, b, c, d); k = (strlen(a) < strlen(b)) ? strlen(a) : strlen(b); for (i = 0; i < k; i++) { if (a[i] >= 'A' &.

#include<stdio.h>#include<vector>using namespace std;bool s(int i) { int j; for (j = 2; j * j <= i; j++) { if (i % j == 0) return false; } return true;}int main(void) { int M, N,i,j; vector<int> a; i = 0; j = 2; whi.

#include<stdio.h>#include<vector>using namespace std;int main(void) { int i, j, k, max,a,b,c,m,n; double D,d; a=b=c=k=max=n=0; D=d=0.0; vector<int> num; scanf("%d",&m); for(j=0;j<m;j++){ scanf("%d", &i); num..

#include<stdio.h>int main(void) { long long a, b, c; int i, k; scanf("%d", &k); getchar(); for (i = 0; i < k; i++) { scanf("%lld %lld %lld", &a, &b, &c); getchar(); if ((a + b) > c) printf("Case #%d: true\n",.

#include<stdio.h>#include<vector>using namespace std;int main(void) { int i; vector<int> num; while (scanf("%d", &i) != EOF) { num.push_back(i); } if (num[1]==0) { printf("0 0"); return 0; } for (i = 0; i < num.siz.

#include<stdio.h>int main(){ int num = 0; char ans[80][80]; while(scanf("%s", ans[num]) != EOF){ num++; } for(int i = num - 1; i >= 0; i--){ printf("%s", ans[i]); if(i > 0) .

#include <stdio.h>void exchange(int* a,int k) { int i, r, p; r = a[0]; p = a[1]; for (i = 0; i<=k-2; i++) { p = a[i + 1]; a[i + 1] = r; r = p; } a[0] = p; return;}int main(void){ int n, m, a[101],i; scanf("%d %d", &n, &m.

#include<stdio.h>#include<vector>using namespace std;bool ss(int a) { int k; for (k = 2; k * k<=a; k++) { if (a % k == 0) return false; } return true;}int main(void) { int i,n,m,len; vector&l.

#include<stdio.h>int main(void) { int a, i,j, num[3] = {0}; i= 0; j = 1; scanf("%d", &a); while (a != 0) { num[i] = a % 10; a = a / 10; i++; } while (num[2]!= 0) { printf("B"); num[2]--; } while (num[1]!= 0) { printf("S");.

#include<stdio.h>#include<string.h> int main(void) { int k, i, j,m,q,w; int num[100], s[10000] = {0}; int boot[101] = {0}; j = q=w=0; scanf("%d", &k); for (i = 0; i < k; i++) { scanf("%d", &num[i]);.

#include<stdio.h>#include<string.h>int main(void){ int n, min, max, score,i; char name[11], bh[11]; char iname[11],ibh[11]; char aname[11],abh[11]; min = 101; max = 0; scanf("%d", &n); for (i = 0; i < n; i++) { scanf("%s %.

#include<stdio.h>#include<string.h>int main(void){ char a[101]; int b[10]; int sum, j, n, i; sum = 0; i = 0; scanf("%s", a); for (j = 0; j < strlen(a); j++) sum += a[j]-'0'; while (sum > 0) { .

#include<stdio.h>#include<string.h>int main(void){ int p,t,others,xp,xt,i,examine,j; char str[100]; scanf("%d", &examine); for (j = 0; j < examine; j++) { p = t = others =0; scanf("%s", str); for (i = 0; i < strlen(st.

#include<stdio.h>int main(void){ int a,b; b=0; scanf("%d",&a); while(a!=1) { if(a%2==0) a=a/2; else a=(3*a+1)/2; b++;} printf("%d",b); return 0;}注意3*a别写成3a。