换牙

摘要： #include<iostream>#include<cstdio>#include<cstring>using namespace std;int main (){ int t; cin>>t; while(t--) { char c[10]; cin>>c; int m=strlen(c); f 阅读全文

摘要： #include<iostream>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;int day[1005];int main (){ int t; cin>>t; while(t--) { int n 阅读全文

摘要： #include<iostream>#include<cstdio>#include<cstring>using namespace std;int main (){ int t; cin>>t; while(t--) { int m,k=1; scanf("%d",&m); int sum=0; 阅读全文

摘要： #include<iostream>#include<cstdio>using namespace std;typedef long long ll;ll t[305];ll w[305];int main (){ int n; cin>>n; int k=1; while(n--) { w[0]= 阅读全文

摘要： #include<iostream>#include<cstring>#include<cstdio>#include<algorithm>using namespace std;struct str{ char a[105]; int len;};bool cmp(str x,str y){ re 阅读全文

摘要： #include<iostream>#include<stdio.h>using namespace std;int gcd(int a,int b){ if(b==0) return a; return gcd(b,a%b);}int main (){ int a,b,c,d; char ch1, 阅读全文

摘要： #include<iostream>#include<string.h>#include<stdio.h>using namespace std;int main (){ char s[1005]; while(gets(s)) { int m=strlen(s); int n=m; for(int 阅读全文

摘要： #include<iostream>#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;#define maxn 1000005typedef long long ll; int p[4]={2,3,5, 阅读全文

摘要： #include<iostream>#include<stdio.h>using namespace std;typedef long long ll;ll q_pow(ll a,ll b,ll mod){ ll ans=1; while(b!=0) { if(b&1) ans=ans*a%mod; 阅读全文

摘要： #include<iostream>#include<math.h>using namespace std;int main (){ int t; cin>>t; while(t--) { int n; cin>>n; int count=0; while(n!=0) { if(n%2==1) co 阅读全文