07 2021 档案
摘要：#include<iostream> #include<cmath> #include<cstdio> using namespace std; int main(){ int b,n,i,d,di,p,t; while(scanf("%d%d",&b,&n)==2&&b){ di = 1; i =
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ char a[10],b[10]; int len,p; while(gets(a)){ puts(a); } return
阅读全文
摘要：#include<iostream> #include<cmath> #include<cstdio> using namespace std; #define PI 3.1415927 int main(){ int n; double D,d,s,tmp; scanf("%d",&n); for
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ long long n,m,i,ans; scanf("%lld",&i); for(int kase=1;kase<=i;kase++){ scanf("%ll
阅读全文
摘要：#include<iostream> #include<cmath> #include<cstring> #include<cstdio> using namespace std; int main(){ char a[50],b[50]; int sa[30],sb[30]; int n,kase
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int l,m,s,e,ans; while(scanf("%d%d",&l,&m)==2&&l){ ans = l+1; while(m--){ scanf("
阅读全文
摘要：#include<iostream> #include<cmath> #include<cstdio> using namespace std; int main(){ long long n,x,y,s,n1,ans; scanf("%lld",&n); while(n--){ scanf("%l
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int k1,k2,k3,a[3]; while(scanf("%d%d%d",&k1,&k2,&k3)==3){ a[0] = k1-3*k2+3*k3; a[
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int a[3],pos; scanf("%d%d%d",&a[0],&a[1],&a[2]); bool flag = true; for(int i=0;i<
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int n,m,p,c; while(scanf("%d%d%d%d",&n,&m,&p,&c)==4&&n)//真币数：m+c-p,亏损：n+c-(m+c-p)
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ int n,kase = 1,pos,sum,len,i,v[3] = {9,3,7}; char d[10]; scanf(
阅读全文
摘要：#include<iostream> #include<cmath> #include<cstdio> using namespace std; #define PI 3.1415927 int main(){ double D,V,d; while(scanf("%lf%lf",&D,&V)==2
阅读全文
摘要：#include<iostream> #include<cmath> #include<cstdio> using namespace std; int main(){ unsigned R,M,Y; scanf("%u%u%u",&R,&M,&Y); unsigned ans = floor(po
阅读全文
摘要：#include<iostream> #include<algorithm> #include<cstdio> using namespace std; int main(){ int n,d[10005]; scanf("%d",&n); for(int i=0;i<n;i++) scanf("%
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int ans,sum,c,n,data[1005]; double avg,per; scanf("%d",&c); while(c--){ scanf("%d
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ int p; char a[10]; int s=0,e=11; while(true){ scanf("%d",&p); i
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int s,d,p,q,n; scanf("%d",&n); while(n--){ scanf("%d%d",&s,&d); if(d>s||(s-d)%2==
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ long long n,k,i,j,sum; while(scanf("%lld%lld",&n,&k)==2&&n){ if(n-k<k){ k = n-k;
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; #define PI 3.141592653589793 #include<cmath> int main(){ double x1,y1,x2,y2,x3,y3; double k1,
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int n,p,q,data[25]; while(scanf("%d",&n)==1){ p = q = 0; for(int i=0;i<n;i++) sca
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; bool test(int n){ int p,s1,s2,s3; s1 = s2 = s3 = 0; p = n; while(p>0){ s1 += p%10; p /= 10; }
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main(){ char a[15]; scanf("%s",a); int i,sum,pos; sum = 0; for(i=0;i<10
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ char k[27],data[85],ans[85]; gets(k); gets(data); for(int i=0;i
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; bool wr(double sp,double w,double s){ if(sp<=4.5&&w>=150&&s>=200)return true; else return fal
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int n,x,y; scanf("%d",&n); while(n--){ scanf("%d%d",&x,&y); if(x>=y)printf("MMM B
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int n,sum,s[15],t[15]; while(scanf("%d",&n)&&n!=-1){ for(int i=1;i<=n;i++){ scanf
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ char data[20][30]; int n,kase = 1; while(scanf("%d",&n)&&n){ for(int i=1;i<=n;i++
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int n,sum,i,j,t; while(scanf("%d",&n)&&n){ i=1; while(i*(i+1)/2<n)i++; i--; sum =
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int n; while(scanf("%d",&n)==1){ int k = 1; while(k*(k+1)/2<n)k++; k--; int t = n
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; char s[100005],t[100005]; int main(){ while(scanf("%s%s",s,t)==2){ int i,j,
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int n,x,y; while(scanf("%d",&n)&&n){ int a = ~(unsigned)0>>1; while(n--){ scanf("
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int s; scanf("%d",&s); int n = 1; while(n*(n+1)/2<s){ n++; } while((n*(n+1)/2-s)%
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cmath> using namespace std; #define PI 3.1415927 int main(){ int t,n; double R,tmp; scanf("%d",&t); for(i
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cmath> #define PI 3.1415927 using namespace std; double a,b,c,tmp = acos(-1.0/2)*180/PI,x[4],y[4]; bool y
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; #define PI 3.1415927 int main(){ double d,r,t,ansl,ansspd; int kase = 1; while(scanf("%lf%lf%
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int f(int m,int n){ if(m==0||n==1)return 1; if(m<n){ return f(m,m); } return f(m,n-1)+f(m-n,n
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int n,x,y; scanf("%d",&n); while(n--){ scanf("%d%d",&x,&y); if(x==y){ printf("%d\
阅读全文
摘要：#include<iostream> #include<cmath> #include<cstdio> using namespace std; int main(){ int n,a,b,c,d; char start[25][3],end[25][3]; scanf("%d",&n); for(
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int data[100]; double ans[100]; int i=0; while(scanf("%d",&data[i])==1){ ans[i] =
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int n,maxv,maxi,minv,mini,a,b,c,v; char data[10][10]; while(scanf("%d",&n)==1&&n!
阅读全文
摘要：#include<iostream> #include<cstdio> /* PERFECTION OUTPUT 15 DEFICIENT 28 PERFECT 6 PERFECT 56 ABUNDANT 60000 ABUNDANT 22 DEFICIENT 496 PERFECT END OF
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ int i,j; bool flag = true; char data[1000]; int l = 0; while(ge
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int t,n,k,ans; scanf("%d",&t); while(t--){ scanf("%d",&n); if(n==1)printf("0\n");
阅读全文
摘要：#include<iostream> #include<cstdio> #include<ctime> int main(){ int t,n,ans,base; scanf("%d",&t); while(t--){ scanf("%d",&n); base = 5; ans = 0; while
阅读全文
摘要：#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ char a[100],b[100],f[2],tmp[100]; int m,sum; sum = 0; while(tru
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; #define ll long long int main(){ ll N,M,ans,i,q; while(scanf("%lld%lld",&N,&M)==2&&N){ ans =
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; int main(){ int n,data[31]; while(scanf("%d",&n)==1&&n){ for(int i=1;i<=n;i++){ scanf("%d",&d
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main(){ int n,p; int i,j; scanf("%d",&n); bool data[101]; for(i=3;i<=10
阅读全文
摘要：#include<iostream> #include<cstdio> #define ll long long using namespace std; int main(){ ll a,m,n; scanf("%lld",&a);//b = a+m,c = a+n,mn = a*a+1 for(
阅读全文
摘要：#include<iostream> #include<cstdio> using namespace std; #define ll long long void gcd(ll a,ll b,ll&d,ll&x,ll&y){ if(!b){ d = a;x = 1;y = 0; } else{ g
阅读全文
摘要：#include<iostream> using namespace std; int main(){ int ansi,ansD,rgb[16][3],trgb[3]; for(int i=0;i<16;i++){ for(int j=0;j<3;j++){ cin>>rgb[i][j]; } }
阅读全文
摘要：#include<iostream> #include<cmath> using namespace std; int main(){ int n; double Vr,Vs,R,C,w; cin>>Vs>>R>>C>>n; while(n--){ cin>>w; Vr = Vs*w*C*R*(1/
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; int f[1005],l[105][505],r[105][505]; char c[105]; int main(){ int n,k,i,j,w[505],t,ans,ansi,
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; char s[205],ans[205]; int a[205],b[205],len[205]; int n; void transpose(){ memset(len,0,size
阅读全文
摘要：#include<iostream> #include<string> #include<stack> using namespace std; string a,url; stack<string>s1,s2; int main(){ s1.push("Ignored"); while(true)
阅读全文
摘要：#include<iostream> #include<cmath> #include<algorithm> using namespace std; int main(){ int n,d,kase=1,r; double p[1005][2],island[1005][2]; while(cin
阅读全文
摘要：#include<iostream> #include<vector> using namespace std; char a[5][5]; bool s[5][5]; int ans = 20,path[5][5],ans_path[5][5]; bool test(){ for(int i=0;
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; char a[27],b[27]; int L; struct Node{ int data; Node*left; Node*right; }; int find(int astar
阅读全文
摘要：#include<iostream> #include<cstring> #include<cmath> using namespace std; int*data; int len; void init(){ int n; for(n=2;n*n<=1000000;n++){ if(data[n]
阅读全文
摘要：#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<ctime> using namespace std; bool data[1000005]; void init(){ data[1] =
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; int data[10]; void reverse(char*s,char*t){ for(int i=0;i<10;i++){ data[i] = 0; } for(int i=0
阅读全文
摘要：#include<iostream> #include<cmath> using namespace std; const int maxn = 32768; long long a[maxn],s[maxn]; void init(){ s[0] = 0; a[1] = s[1] = 1; for
阅读全文
摘要：#include<iostream> #include<cstring> #include<algorithm> using namespace std; int n,m; int dp[21][801],path[21][801]; int p[201],d[201],s[201],v[201];
阅读全文
摘要：#include<iostream> using namespace std; int d[5][5]; char c[5][5]; int mm = 65536; bool all = false; void change(int i,int j){ d[i][j] = 1-d[i][j]; if
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; const int maxn = 105; int n,dp[maxn][maxn],len1,len2; char data1[maxn],data2[maxn]; int val[
阅读全文
摘要：#include<iostream> using namespace std; const int maxn = 355; int n,data[maxn][maxn],dp[maxn]; int main(){ cin>>n; for(int i=1;i<=n;i++){ for(int j=1;
阅读全文
摘要：#include<iostream> using namespace std; const int maxn = 1005; int n,data[maxn],dp[maxn]; int main(){ ios::sync_with_stdio(false); cin.tie(0); cin>>n;
阅读全文
摘要：#include<iostream> #include<cstring> #include<algorithm> using namespace std; const int maxn = 105; const int inf = 0x7f; int a[maxn],p[maxn],r[maxn],
阅读全文
摘要：#include<iostream> using namespace std; const int maxn = 1005; double data[maxn]; int f[maxn],g[maxn],n,ans; int main(){ ios::sync_with_stdio(false);
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; char dict[605][26]; char mes[305]; int dp[305]; int main(){ int W,L; while(cin>>W>>L){ cin>>
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; const int maxn = 105; char a[maxn],b[maxn]; int dp[maxn][maxn]; int main(){ while(cin>>a>>b)
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; const int maxn = 105; char a[maxn],b[maxn]; int dp[2][maxn]; int main(){ while(cin>>a>>b){ i
阅读全文
摘要：ios::sync_with_stdio(false); cin.tie(0);
阅读全文
摘要：#include<iostream> #include<stack> using namespace std; const int maxn = 105; int n,data[maxn],t[maxn]; stack<int>s; int main(){ int ans; while(cin>>n
阅读全文
摘要：#include<iostream> using namespace std; const int maxn = 105; int n,h[maxn]; int S(int i){ int j,k,t; for(j=i;j>=1;j--){ if(h[j]<h[i])break; } j++; fo
阅读全文
摘要：#include<cstdio> #include<cstring> const int maxn = 20; int main(){ int D,I; while(scanf("%d%d",&D,&I)==2){ int k = 1; for(int i=0;i<D-1;i++){ if(I%2)
阅读全文
摘要：#include<cstdio> #include<cstring> const int maxd = 20; int s[1<<maxd]; int main(){ int D,I; while(scanf("%d%d",&D,&I)==2){ memset(s,0,sizeof(s)); int
阅读全文
摘要：#include<cstdio> const int maxn = 100005; int n,left[maxn],right[maxn]; void link(int L,int R){ right[L] = R; left[R] = L; } void swap(int&X,int&Y){ i
阅读全文
摘要：#include<cstdio> #include<cstring> const int maxn = 100005; int last,cur,next[maxn]; char s[maxn]; int main(){ while(scanf("%s",s+1)==1){ int n = strl
阅读全文
摘要：#include<iostream> #include<stack> #include<string> using namespace std; struct Matrix{ int a,b; Matrix(int a=0,int b=0):a(a),b(b){} }m[26]; stack<Mat
阅读全文
摘要：#include<iostream> using namespace std; #include<stack> #include<cstdio> const int maxn = 1000+5; int a[maxn]; int main(){ int n; scanf("%d",&n);//3 s
阅读全文
摘要：#include<iostream> using namespace std; #include<string> #include<algorithm> const int len = 60; const int maxn = 1000+5; string data[maxn]; void prin
阅读全文
摘要：#include<iostream> using namespace std; #include<vector> #include<cstring> struct BigInteger{ static const int BASE = 100000000; static const int WIDT
阅读全文
摘要：#include<iostream> using namespace std; #include<vector> #include<cstring> struct BigInteger{ static const int BASE = 100000000; static const int WIDT
阅读全文
摘要：#include<iostream> #include<set> #include<vector> #include<queue> using namespace std; typedef long long LL; int coeff[3] = {2,3,5}; int main(){ prior
阅读全文
摘要：//find_block //找到a所在堆p和高度h //clear_above //将p堆h高度上方所有方块归位 //pile_onto //将p堆h高度及上方所有方块移至p2 //print //打印 #include<iostream> #include<cstdio> #include<ve
阅读全文
摘要：#include<cstdio> #include<algorithm> using namespace std; const int maxn = 10000; int main(){ int n,q,x,a[maxn],kase = 0; while(scanf("%d%d",&n,&q)==2
阅读全文
摘要：#include<iostream> #include<string> #include<sstream> using namespace std; int main(){ string line; while(getline(cin,line)){ long long sum = 0,x; str
阅读全文
