![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
pat
vczhfan
这个作者很懒,什么都没留下…
展开
-
1005
#include#include#include#includeusing namespace std;int main(){ freopen("in.txt","r",stdin); map cache; int t; cin>>t; while(t--){ int x; cin>>x; while(x!=1){ cache[x]++; if(x&0原创 2014-07-10 22:06:37 · 339 阅读 · 0 评论 -
1010
#include#include#includeusing namespace std;struct term{ int coef; int exp; friend istream& operator>>(istream &is,term& );};istream& operator>>(istream& is,term& t){ return is>>t.coef>>t.e原创 2014-07-11 11:20:09 · 254 阅读 · 0 评论 -
1002
#include#include#include#include#includeusing namespace std;string dic[]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};int main(){ifstream cin("in.txt");string s;cin>>原创 2014-07-10 20:59:29 · 385 阅读 · 0 评论 -
1003
#include#include#includeusing namespace std;int main(){fstream cin("in.txt");int t;cin>>t;while(t--){string s;cin>>s;int i,j,k;i=j=k=0;while(iif(icoutcontinue;}j=原创 2014-07-10 21:22:47 · 293 阅读 · 0 评论 -
304
#include#include#include#include#include#includeusing namespace std;struct record{ int coef; int exp; bool operator<(const record& r){ return exp<r.exp; }};int main()原创 2014-07-12 09:36:56 · 272 阅读 · 0 评论 -
206
#include#include#include#includeusing namespace std;int main(){ freopen("in.txt","r",stdin); int a,n; cin>>a>>n; vector sum(n,0); for(int i=0;i<n;i++){ sum[i]=(n-i)*a; } int carry=0; f原创 2014-07-11 17:18:42 · 315 阅读 · 0 评论 -
1010
#include#include#includeusing namespace std;int main(){freopen("in.txt","r",stdin);int t;cin>>t;int i=0;for(int i=0;iint a,b,c;cin>>a>>b>>c;coutc ? "true" : "false")}}原创 2014-07-11 11:47:09 · 296 阅读 · 0 评论 -
1009
#include#include#includeusing namespace std;int main(){ freopen("in.txt","r",stdin); string s; vector v; while(cin>>s){ v.push_back(s); } for(vector::reverse_iterator itr=v.rbegin();itr!=原创 2014-07-11 11:04:46 · 278 阅读 · 0 评论 -
1007
#include#include#includeusing namespace std;bool ptable[100000];int main(){ freopen("in.txt","r",stdin); int n; cin>>n; ptable[0]=ptable[1]=1; int cnt=0; if(n<=2){ cout<<0<<endl; retur原创 2014-07-11 10:40:49 · 288 阅读 · 0 评论 -
1006
#include#include#includeusing namespace std;int main(){ freopen("in.txt","r",stdin); int n; cin>>n; int b,s,g; b=n/100,s=(n-b*100)/10,g=n%10; while(b--) cout<<"B"; while(s--) cout<<"S"; f原创 2014-07-11 10:32:40 · 291 阅读 · 0 评论 -
211
#include#include#include#include#includeusing namespace std;int main(){ freopen("in.txt","r",stdin); int n; cin>>n; vector vec; while(n--){ int x; cin>>x;原创 2014-07-11 21:22:44 · 360 阅读 · 0 评论 -
求逆序对的nlgn算法
def inversion(A,p,r): #inversion return inversion num and sort the arr if(r-p<=1): return 0 else: q=(p+r)//2 n1,n2=inversion(A,p,q),inversion(A,q,r) n3=0 L=A[p:q原创 2014-07-13 16:44:07 · 379 阅读 · 0 评论 -
305
#include#include#includeusing namespace std;int main(){ freopen("in.txt","r",stdin); int k; cin>>k; list lst; int x; while(cin>>x&&x>=0){ lst.push_back(x); } list::iterator itr1=lst.be原创 2014-07-12 09:58:27 · 289 阅读 · 0 评论 -
207
#include#include#include#include#includeusing namespace std;int main(){ freopen("in.txt","r",stdin); long int n; cin>>n; cout<<n<<"="; if(n==1){ cout<<1<<endl; return 0; } map htable原创 2014-07-11 18:24:12 · 295 阅读 · 0 评论 -
205
#include#include#include#includeusing namespace std;int main(){ freopen("in.txt","r",stdin); vector vec; int n; cin>>n; double sum=0; for(int i=0;i<n;i++){ double x; cin>>x; vec.push原创 2014-07-11 17:10:16 · 335 阅读 · 0 评论 -
1004
#include#include#include#include#includeusing namespace std;struct record{ string name; string id; int grade; bool operator<(const record& r)const{ return grade>r.grade; } friend ostream原创 2014-07-10 21:43:52 · 316 阅读 · 0 评论 -
1001
#includeusing namespace std;int main(){ int n; cin>>n; int cnt=0; while(n!=1){ if(n&01) n=(3*n+1)/2; else n/=2; cnt++; } cout<<cnt<<endl;}原创 2014-07-10 21:01:31 · 275 阅读 · 0 评论 -
212
#include#include#include#includeusing namespace std;int main(){ freopen("in.txt","r",stdin); vector v1,v2,v3; int x; while(cin>>x&&x!=-1){ v1.push_back(x); } bool原创 2014-07-11 21:56:42 · 365 阅读 · 0 评论