04 2012 档案
摘要：1 #include<stdio.h> 2 #include<math.h> 3 int main() 4 { 5 int N,K; 6 while(scanf("%d%d",&N,&K)!=EOF) 7 { 8 int m; 9 double t;10 for(m=1;m<=20;++m)11 {12 t=200*pow(1+K*1.0/100,m-1);13 if(N*m*1.0>=t)14 {15 ...
阅读全文
摘要：1 #include<stdio.h> 2 int map[301][301]; 3 int cal(int n) 4 { 5 int i,j,sum=0; 6 for(i=1;i<n;++i) 7 { 8 for(j=i+1;j<=n;++j) 9 sum+=map[i][j];10 }11 return sum;12 }13 int main()14 {15 int n,k,a,b,w;16 while(scanf("%d",&n)!=EOF)17 {18 int i,...
阅读全文
摘要：#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;typedef struct { int weight; char hat[101];}mouse;int cmp(mouse a,mouse b){ return a.weight>b.weight;}int main(){ int n; mouse m[101]; while(scanf("%d",&n)!=EOF) { int i; for(i=0;i<n;++i)
阅读全文
摘要：1 #include<stdio.h> 2 #include<string.h> 3 #include<algorithm> 4 using namespace std; 5 6 typedef struct 7 { 8 int start; 9 int end;10 int cost;11 }Ege;12 Ege s[10001];13 int fa[1001];14 int cmp(Ege a,Ege b)15 {16 return a.cost<b.cost;17 }18 int get_father(int n)19 {20 if(fa[n..
阅读全文
摘要：1 #include<stdio.h> 2 #include<string.h> 3 #include<algorithm> 4 5 typedef struct TreeNode 6 { 7 int value; 8 struct TreeNode*left; 9 struct TreeNode*right;10 }*Node;11 void insert(Node &root,int v)12 {13 if(!root)14 {15 root=(Node)malloc(sizeof(TreeNode));16 ro...
阅读全文
摘要：1 #include <stdio.h> 2 #include <math.h> 3 int num[1005]; 4 int main() 5 { 6 int n; 7 while(scanf("%d",&n)!=EOF) 8 { 9 int i;10 for(i=1;i<=n;i++)11 scanf("%d",&num[i]);12 int d;13 scanf("%d",&d);14 if(d==1)15 printf("%d\n",num[1]);16
阅读全文
摘要：1 #include<stdio.h> 2 #include<string.h> 3 #include<iostream> 4 #include<stack> 5 using namespace std; 6 7 typedef struct 8 { 9 char ch;10 int pos;11 }Symbol;12 int main()13 {14 char s[100],flag[100];15 stack<Symbol> st;16 while(cin.getline(s,100))17 {18 memset(fl...
阅读全文
摘要：1 /**/ 2 3 4 #include<stdio.h> 5 typedef struct 6 { 7 int num; 8 int book_num; 9 int flag;10 }Student;11 Student s[1000];12 int main()13 {14 int n,m;15 while(scanf("%d%d",&n,&m)!=EOF&&n>=2&&m<=200)16 {17 int i,j;18 for(i=0;i<n;++i)19 {20 ...
阅读全文
摘要：#include<iostream>#include<stdio.h>#include<algorithm>using namespace std;typedef struct { int data; int pos; int cur;}Num; Num num[10001]; int cmp(Num a,Num b) { return a.data<b.data; }int main(){ int n; while(scanf("%d",&n)!=EOF&&n) { int i; for(i=0;i<
阅读全文
摘要：#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>using namespace std;int main(){ int n,a[10000]; while(scanf("%d",&n)!=EOF) { int k; memset(a,0,sizeof(a)); int i; for(i=0;i<n;++i) { scanf("%d",&a[i]); } cin>>k; sort(
阅读全文
摘要：#include<iostream>#include<queue>using namespace std;int main(){ int n; while(cin>>n&&n) { priority_queue<int,less<int>> PQ; for(int i=0;i<n;++i) { int temp; cin>>temp; PQ.push(temp); } int ret=0; while(PQ.size()>1) { int temp=0; temp+=PQ.top(); PQ.p
阅读全文
摘要：#include<stdio.h>#include<string.h>int bit_sum(int n){ int count=0; while(n) { count+=n%10; n/=10; } return count;} int main(){ int n; while(scanf("%d",&n)!=EOF&&n) { int count=0; int temp; count=bit_sum(n); temp=bit_sum(n*n); printf("%d %d\n",count,temp);
阅读全文
摘要：#include<stdio.h>#include<string.h>int main(){ char s[100]; while(gets(s)&&strcmp(s,"!")) { int i,len=strlen(s); for(i=0;i<len;++i) { char ch=s[i]; if(ch>='a'&&ch<='z') { s[i]='a'+'z'-ch; } else if(ch>='A'&
阅读全文
摘要：#include<stdio.h>int main(){ int n; long long kind[91]; kind[1]=1; kind[2]=2; kind[3]=3; kind[4]=5; int i; for(i=3;i<=90;++i) kind[i]=kind[i-1]+kind[i-2]; while(scanf("%d",&n)!=EOF) { printf("%lld\n",kind[n]); } return 0;}
阅读全文
摘要：#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>using namespace std;typedef struct { char name[103]; int num; int pulish;}Team;int cmp(Team a,Team b){ if(a.num!=b.num) return a.num>b.num; else { if(a.pulish!=b.pulish) return a.pulish<b.pulish; el
阅读全文
摘要：这个题大意了，没有看见不包含N，其它的就没什么注意的了#include<stdio.h>#include<math.h>#include<string.h>bool IsPrime(int n){ int i; for(i=2;i<=sqrt(n*1.0);i++) { if(n%i==0) return false; } return true;}int main(){ int n,a[1000]; while(scanf("%d",&n)!=EOF&&n>=2) { int i; int count
阅读全文
摘要：#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;int main(){ int n,a[10000]; while(scanf("%d",&n)!=EOF&&n) { int i; for(i=0;i<n;++i) { scanf("%d",&a[i]); } sort(a,a+n); if(n%2!=0) { printf("%d\n",a[n/2]); } e
阅读全文
摘要：#include<stdio.h>#include<string.h>int main(){ char s[1002]; while(scanf("%s",s)!=EOF) { int i,j; for(i=0,j=strlen(s)-1;i<j;++i,--j) { if(s[i]!=s[j]) break; } if(i<j) printf("No!\n"); else printf("Yes!\n"); } return 0;}
阅读全文
摘要：#include<stdio.h>int main(){ int n; while(scanf("%d",&n)!=EOF) { int num=n*n; while(n) { if(n%10!=num%10) break; else { n/=10; num/=10; } } if(n==0) { printf("Yes!\n"); } else printf("No!\n"); } return 0;}
阅读全文
摘要：#include<stdio.h>#include<string.h>#define NUM 100000int main(){ int m,n,a[NUM]; while(scanf("%d",&n)!=EOF) { memset(a,0,sizeof(a)); int i,t; for(i=0;i<n;++i) { scanf("%d",&t); ++a[t]; } scanf("%d",&m); for(i=0;i<m;++i) { scanf("%d&quo
阅读全文
摘要：#include<iostream>#include<algorithm>#include<stdio.h>using namespace std;typedef struct{ int a; int b;}Array;Array t[1000];int cmp(Array m,Array n){ if(m.a==n.a) return m.b<n.b; return m.a<n.a;}int main(){ int n; while(scanf("%d",&n)!=EOF) { int i; for(i=0;i<
阅读全文
摘要：#include<stdio.h>int main(){ int h; while(scanf("%d",&h)!=EOF) { int i,j; for(i=0;i<h;++i) { for(j=0;j<(h-1-i)*2;++j) printf(" "); for(j=0;j<h+2*i;++j) printf("*"); printf("\n"); } } return 0;}
阅读全文
摘要：#include<iostream>#include<stdio.h>#include<string.h>using namespace std;int main(){ int n; int a; int num[105]; while(scanf("%d%d",&a,&n)!=EOF) { int i; memset(num,0,105); for(i=1;i<=n;++i) { num[i]=a*(n-i+1); } for(i=1;i<=n;++i) { num[i]+=num[i-1]/10; num[
阅读全文
摘要：#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){ char s[203]; while(gets(s)) { sort(s,s+strlen(s)); puts(s); } return 0;}
阅读全文
摘要：坑爹呀！原来数字和冒号之间要有空格#include<stdio.h>#include<math.h>int judge_e(int n){ int temp=0,i; for(i=2;i<=sqrt(n*1.0);++i) { if(n%i==0) { if(n/i!=i) temp=temp+i+n/i; else temp+=i; } } ++temp; if(temp==n) return 1; else if(temp>n) return -1; else return 0;}int main(){ int e[60],g[60],ei,gi; ei
阅读全文
摘要：#include<stdio.h>#include<string.h>int main(){ char str[203]; while(scanf("%s",str)!=EOF) { int len=strlen(str); int i; for(i=len-1;i>=0;--i) printf("%c",str[i]); printf("\n"); } return 0;}
阅读全文
摘要：#include<stdio.h>int main(){ int m,n; while(scanf("%d%d",&m,&n)!=EOF) { int i,temp; temp=(m<n)?m:n; int t; for(i=1;i<=temp;++i) { if(m%i==0&&n%i==0) { t=i; } } printf("%d\n",t); } return 0;}
阅读全文
摘要：需要注意的是：由于abs的参数只能为float,double,longlong型，故只能为abs(n*1.0)而不能abs(n)#include<iostream>#include<stdio.h>#include<cmath>using namespace std;int main(){ int n; while(scanf("%d",&n)!=EOF) { int i; int temp; temp=abs(n*1.0); int sum=0; for(i=temp;i<=temp*2;++i) { sum+=i; }
阅读全文
摘要：#include<stdio.h>int main(){ int a[201],x,flag,n; while(scanf("%d",&n)!=EOF) { int i; for(i=0;i<n;++i) scanf("%d",&a[i]); scanf("%d",&x); flag=-1; for(i=0;i<n;++i) { if(a[i]==x) { flag=i; break; } } printf("%d\n",flag); } return 0;}
阅读全文
摘要：#include<stdio.h>int main(){ int a,b,c; for(a=0;a<=5;++a) { for(b=0;b<=5;++b) { for(c=0;c<=9;++c) { if(a*100+b*10+c+b*100+c*10+c==532) printf("%d %d %d\n",a,b,c); } } } return 0;}
阅读全文
摘要：scanf("%d",&n)!=EOF很重要，要不就会一直OLE#include<iostream>#include<stdio.h>#include<math.h>using namespace std;int main(){ int n,t; while(scanf("%d",&n)!=EOF&&n) { while(n--) { cin>>t; int i; int num=0; for(i=1;i<=sqrt(t);++i) { if(t%i==0) { if(
阅读全文
浙公网安备 33010602011771号