左岸的博客

第一次使用Python.总结一下基础操作：1、输入语句input函数input([prompt]) 函数和 raw_input([prompt]) 函数基本类似，但是 input 可以接收一个Python表达式作为输入，并将运算结果返回。str = input("请输入：")print "你输入的内容是: ", str请输入：[x*5 for x in range(2,10,2)]...

PAT_B_1013#include#define N 1001000int ss[N] = { 0 };int s[N] = { 0 };int main(){ int i, j, k; int a, b; ss[0] = ss[1] = 1; ss[2] = 0; for (i = 2, k = 1; i 1000000; i++)

PAT_B_1068#include#include#include#includeusing namespace std;int color[1010][1010];map int,int> vis;int m, n;int dirx[8] = {1,1,1,-1,-1,-1,0,0};int diry[8] = {-1,0,1,-1,0,1,-1,1};int

PAT B 1027#includeint main(){ int sum; char c; int n; scanf("%d %c", &sum, &c); for (int i = 0; i 100; i++) { if ((i*i) * 2 - 1 == sum) { n =

PAT B 1064#includeint main(){ int Out[100]; int n, a, sum, ans; for (int i = 0; i 100; i++) { Out[i] = -1; } scanf("%d", &n); ans = 0; while (n--) {

PAT B 1066#includeint Picture[510][510];int main(){ int m, n, a, b, d; //scanf_s("%d%d%d%d%d", &m, &n, &a, &b, &d); scanf("%d%d%d%d%d", &m, &n, &a, &b, &d); for(int i = 1; i m;

PAT B 1065#includeint In[100000][2];int Out[100000];void Init(){ for (int i = 1; i 100000; i++) { In[i][0] = In[i][1] = -1; Out[i] = -1; }}int main(){ Init()

PAT_B_1028#include#include#define NOWYEAR 2014#define NOWMONTH 9#define NOWDAY 6#define OLDYEAR 1814#define OLDMONTH 9#define OLDDAY 6int Compare(int year1, int month1, int day1, int year

PAT_B_1077#includestdio.h>int main(){ float ans,G1,G2; int n, m,sum; float a, Max, Min; int i, j; scanf("%d%d", &n, &m); for (i = 0; i n; i++) { Max = 0;

PAT_B_1057#include<stdio.h>#include<string.h>#define N 100000+10int main(){ char s[N]; int l, i, sum, ans0, ans1; l = i = sum = ans0 = ans1 = 0; gets(s); l = st...

PAT_B_1049#include<stdio.h>int main(){ int n, i; double a, ans = 0; scanf("%d", &n); for (i = 1; i <= n; i++) { scanf("%lf", &a); ans += (dou...

PAT_B_1048#include<stdio.h>#include<string.h>#define N 100+10int main(){ char A[N], B[N], C[N]; int LA, LB; int i,j,t,a; scanf("%s %s", A, B); LA = strlen(A); ...

#include<stdio.h>#include<algorithm>using namespace std;#define N 1010struct mc{ double sum; double val; double up; }a[N];bool com(mc a,mc b){ return a.up>b.up;}int main(){

还没写完……#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;#define N 1010bool cmpmin(int a,int b){ return a<=b;}bool cmpmax(int a,int b){ return a>=b;}int judge(c

PAT_B_1014#include&lt;iostream&gt;#include&lt;string.h&gt;#include&lt;string&gt;using namespace std;int main(){ char a1[100], a2[100], a3[100], a4[100]; char ans1[10]; int ans2, ans3,...

PAT_B_1010#include&lt;iostream&gt; #include&lt;cstdio&gt;#include&lt;string.h&gt;using namespace std;int counter;void Solve(int a, int b){ static int f = 0; if (!(b == 0)) { ...

PAT_B_1019#include&lt;stdio.h&gt;#include&lt;algorithm&gt;#include&lt;string.h&gt;using namespace std;int Isequ(int c){ int num[10]; int i = 1; while (i &lt;= 4) { num...

PAT_B_1078#include&lt;stdio.h&gt;#include&lt;string.h&gt;void Co_Printf(int i, char b){ if (i == 1) printf("%c", b); else printf("%d%c", i, b);}void De_Printf(int i, cha...

PAT_B_1058#include&lt;stdio.h&gt;#include&lt;string.h&gt;typedef struct question_ans{ int score, sum, t; char ans[10]; int counter;}ANS;int Is_Judge(char a[], char b[], int c){ ...

PAT_B_1047#include&lt;stdio.h&gt;#define N 1000+10int main(){ int a[N] = { 0 }; int n, team, mem, score, i, j, maxt,maxs; maxt = maxs = 0; scanf("%d", &amp;n); for (i = 1; i...

PAT_B_1076#includeint main(){ int n,l,i=0; int pw[110]; char ans[20]; scanf("%d", &n); //rewind(stdin);//清除输入缓冲区的回车; getchar(); while (n--) { gets(ans);

PAT B 1044火星文两位的时候，个位的0不需要，小坑。（代码好烂，时间久了，已经不想看了，也不想改了）#include#include#include#includeusing namespace std;char s1[20][10] = { "tret","jan","feb","mar","apr","may", "jun",

#include<iostream> #include<cstdio>#include<string.h>#define LL long long#define N 100000using namespace std;int main(){ char s[100]; gets(s+1); int l=strlen(s+1); int sum=0;

#include<iostream> #include<cstdio>#include<string.h>#define LL long long#define N 100000using namespace std;int main(){ int a[110]; int n,m,p1,p2; scanf("%d%d",&n,&m); for(int i=

#include<iostream> #include<cstdio>#include<string.h>#define LL long long#define N 100000using namespace std;int prim[N]={1,1,0};//0:素数 1:非素数 int main(){ for(int i=2;i<=N;i++) {

#include<iostream> #include<cstdio>#include<string.h>#define LL long long#define N 10000using namespace std;int main(){ int n; int a[5]={0},i; char ans[5];ans[3]='B',ans[2]='S';

#include<iostream>#include<cstdio>#include<algorithm>#include<string.h>using namespace std;#define N 10000int ans[N],j=1;int a[N],z[N];int main(){ int n; memset(a,0,sizeof(a)); scanf

#include<iostream>#include<cstdio>#include<string.h>using namespace std;#define N 200struct n{ char name[15],xh[15]; int v;}A[2];int main(){ int n; int Min=100,Max=0; scanf("%d",&n);

#include<iostream>#include<cstdio>#include<algorithm>#include<string.h>using namespace std;#define N 10000int main(){ int t; scanf("%d",&t); while(t--) { char a[110]; int l,num[5

#include<iostream>#include<cstdio>#include<string.h>using namespace std;#define N 200struct n{ char s[10];}A[10];int main(){ strcpy(A[0].s,"ling"); strcpy(A[1].s,"yi"); strcpy(A[2].s,"e

#include<iostream> #include<cstdio>#include<string.h>#define LL long long#define N 100000using namespace std;int main(){ int t,n=1; scanf("%d",&t); while(t--) { LL a,b,c;

#include<iostream> #include<stdio.h>#include<algorithm>using namespace std;#define N 100010bool cmp(int a,int b){ return a>b;}int main(){ int n,ans=0; int a[N]; scanf("%d",&n);

#include<iostream> #include<stdio.h>#include<string.h>#include<cmath>#include<algorithm>using namespace std;#define N 100int main(){ int n; scanf("%d",&n); double ans=0; for(int

#include<stdio.h>#include<time.h>#define C 100int main(){ int h,m,s; double c1,c2,c; scanf("%lf%lf",&c1,&c2); c=(c2-c1)/C; h=c/3600; c=c-h*3600; m=c/60; c=c-m*60;

#include<stdio.h>#include<string.h>#define N 1010 char a[N]; char ans[N];int b;int main(){ int ansd,i,k,l; scanf("%s%d",a,&b); l=strlen(a); ansd=0; for(i=0,k=0;i<l;i++) {

#include<stdio.h>#include<string.h>#define N 1010 int fun(int A,int Da){ int a,ans=0; while(A) { a=A%10; if(a==Da) ans++; A=A/10; } return ans

#include<stdio.h>#include<string.h>#define N 1010 char a[N];int l;int ans[10]={0};int main(){ int i,j,k; gets(a); l=strlen(a); for(i=0;i<l;i++) { ans[a[i]-'0']++; }

一:初始化vector对象的方法头文件#include<vector>vector<T> v1 v1是一个空vector,它潜在的元素是T类型的,执行默认初始化vector<T> v2(v1) v2中包含有v1所有元素的副本vector<T> v2=v1 等价于v2(v1),v2中包含有v1所有元素的副本 vector<T> v3(n,val) v3包

#include<iostream>#include<string.h>#include<cmath>#include<algorithm>using namespace std;int main(){ int n,a; int A1=0,A2=0,A3=0,A5=0; int A1n=0,A2n=0,A3n=0,A4n=0,A5n=0; double A

#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#define N 100000#define e 1e-3using namespace std;int n,m,s[N]={1,1};struct stu{ char id[10]; int mc,f;}A[N];bool