PAT
baiduwangpan1
这个作者很懒,什么都没留下…
展开
-
PATB1023
#include <iostream>#include <stdio.h>using namespace std;int main(){ int a[10]; for(int i=0;i<10;i++) { scanf("%d",&a[i]); } if(a[0]!=0){ for(int i=1;;i++) {原创 2016-02-25 10:02:50 · 333 阅读 · 0 评论 -
PATB1020
#include <iostream>#include<stdio.h>#include<algorithm>using namespace std;struct yuebing{ double sum1; double sum2; double d;}y[1010];bool cmp( yuebing a,yuebing b){ if(a.d!=b.d原创 2016-02-25 09:41:19 · 290 阅读 · 0 评论 -
PATB1019
#include <iostream>#include<stdio.h>#include<algorithm>using namespace std;int main(){ int n,t[4],m,a,f; scanf("%d",&n); do { f=n; for(int i=3;i>=0;i--) {原创 2016-03-04 19:31:50 · 398 阅读 · 0 评论 -
PATB1009
!PATB1009(http://img.blog.csdn.net/20160216184105416)#include <iostream>#include<stdio.h>using namespace std;int main(){ char a[90][90]; int mun=0; while(scanf("%s",a[mun])!=EOF) {翻译 2016-02-16 18:42:18 · 359 阅读 · 0 评论 -
PAT B1036
#include <stdio.h>#include<cmath>using namespace std;int main(){ double n; char a; scanf("%lf %c",&n,&a); for(int i=0;i<n;i++) { printf("%c",a); } printf("\n");原创 2016-02-14 11:20:26 · 258 阅读 · 0 评论 -
1002. A+B for Polynomials (25)
#include<iostream>#include<malloc.h>#include<iomanip>using namespace std;typedef struct node{ int e; double c; struct node *next;}link;int main(){ int k1,k2,count,e1; double c原创 2016-01-27 14:25:37 · 202 阅读 · 0 评论 -
1001. A+B Format (20)
#include<iostream>#include<cstdlib>using namespace std;int main(){ int a,b,c,stack[100],p=0; cin>>a>>b; c=a+b; if(abs(c)<10) cout<<c; else{ do{ a=abs(c%1原创 2016-01-27 14:22:56 · 201 阅读 · 0 评论 -
PAT B1003
#include <iostream>#include<stdio.h>#include<cstring>using namespace std;char s[11][110];int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%s",s[i]); }原创 2016-03-22 16:39:17 · 254 阅读 · 0 评论