- 博客(20)
- 资源 (4)
- 收藏
- 关注
原创 POJ-2013
#include#include#include#include#include#includeusing namespace std;int main(int argc, char *argv[]){ int num; int caseNum=0; while(cin>>num,num){ caseNum++; multimap mInput; for(int
2015-09-20 13:21:44 280
原创 POJ-2006
#include#include#includeusing namespace std;int main(int argc, char *argv[]){ double k,a; int m,n; while(cin>>k>>a>>m>>n,k||a||m||n){ double hC=(-1*k+sqrt(k*k+4*a*k*m*n))/2/n; double pH=-1
2015-09-20 12:07:49 256
原创 POJ-1939
#include#includeusing namespace std;int main(int argc, char *argv[]){ int groupNum; while(cin>>groupNum){ double initX, initY; double preX, preY; double x,y; for(int i=0;i<groupNum;i++){
2015-09-20 11:05:01 377
原创 POJ-1887
#include#include#include#includeusing namespace std;int main(int argc, char *argv[]){ int m,n; int index=0; while(cin>>m>>n,m|n){ index++; vector v; for(int i=0;i<m;i++){ for(int j=0
2015-09-19 19:35:31 255
原创 POJ-1750
#include#include#includeusing namespace std;int main(int argc, char *argv[]){ string preWord=""; string curWord; int preSpaceNum=0; char cString[20]; //scanf("%s",cString) while(gets(cStrin
2015-09-19 15:50:39 374
原创 POJ-1658
#includeusing namespace std;bool isSubstraction(int a, int b, int c, int d){ if(b-a==c-b && d-c==c-b){ return true; }else{ return false; }}int main(int argc, char *argv[]){ int cnt;
2015-09-19 13:13:46 428
原创 POJ-1656
#include#include#includeusing namespace std;//0-white 1-blackint paintArray[100][100];void blackOperation(int x,int y,int L){ for(int i=x-1;i<=x+L-1-1;i++){ for(int j=y-1;j<=y+L-1-1;j++){
2015-09-19 12:50:56 511
原创 POJ-1595
#includeusing namespace std;int prime[1000];int findPrime(int n){ int primeSum=0; for(int i=1;i<=n;i++){ bool isPrimeFlag=true; for(int j=2;j<i;j++){ if(1.0*i/j==i/j){ isPrimeFlag=f
2015-09-19 11:57:15 389
原创 POJ-1580(一直WA,没有找到原因)
#include#includeusing namespace std;void faction(int *numerator, int *denominator){ for(int i=2;i<=(*numerator);i++){ if((*numerator)*1.0/i==(*numerator)/i && (*denominator)*1.0/i==(*denom
2015-09-13 15:00:26 275
原创 POJ-1575(一直WA,但找不到原因)
#include#includeusing namespace std;bool isVowel(char c){ if(c=='a'|| c=='e'|| c=='i'|| c=='o'|| c=='u'){ return true; }else{ return false; }}bool rule(string s){ bool c
2015-09-13 12:57:13 556
原创 POJ-1552
#include#includeusing namespace std;int main(int argc, char *argv[]){ int num; vector v; int cnt=0; while(cin>>num,num!=-1){ if(num!=0){ v.push_back(num); }else{ for(vector::iterator
2015-09-13 10:15:43 426
原创 POJ-1543
#includeusing namespace std;int main(int argc, char *argv[]){ int x; cin>>x; for(int n=6;n<=x;n++){ for(int i=2;i<n;i++){ for(int j=i+1;j<n;j++){ for(int k=j+1;k<n;k++){ if(n*n*n==
2015-09-13 09:37:02 274
原创 POJ-1528
#include#includeusing namespace std;int calc(int n){ if(n==1){ return 0; } int sum=1; for(int i=2;i<n;i++){ if(1.0*n/i-n/i==0){ sum+=i; } } return sum;}int main(int argc, char
2015-09-12 18:30:42 432
原创 POJ-1517
#include#includeusing namespace std;int factorial(int n){ int result=1; if(n==0){ return result; } for(int i=n;i>=1;i--){ result*=i; } return result;}double calc(int n){ double re
2015-09-12 17:40:11 338
原创 POJ-1504
#include#include#includeusing namespace std;string reverse(char* c, int size){ string s1=""; int cnt=0; bool cntFlag=true; for(int i=size-1;i>=0;i--){ if(cntFlag){ if(c[i]!='0'){ cnt
2015-09-12 17:09:24 401
原创 POJ-1493
#include#include#include#includeusing namespace std;int main(int argc, char *argv[]){ int cnt; int spaceNum[13]; while(cin>>cnt,cnt){ getchar(); memset(spaceNum,0,cnt); int minSpaceNum
2015-09-12 12:59:35 440
原创 POJ-1477
#include#includeusing namespace std;int main(int argc, char *argv[]){ int stacksNum; vector v(50); int setNum=0; while(cin>>stacksNum, stacksNum!=0){ int bricksNum=0; int moveTimes=0; s
2015-09-05 18:10:56 532
原创 POJ-1450
#includeusing namespace std;int main(int argc, char *argv[]){ int num; cin>>num; for(int i=0;i<num;i++){ int m,n; cin>>m>>n; cout<<"Scenario #"<<i+1<<":"<<endl; if(m%2==0 || n%2==0){
2015-09-05 17:53:32 294
原创 POJ-1350
#include#include#include#includeusing namespace std;int calcMax(vector v, int validNum){ //0 1 2 3 if(validNum==0){ return 0; }else if(validNum==1){ return v[3]; }else if(validNum==2){
2015-09-05 17:01:13 492
原创 POJ-1338
#includeusing namespace std;int uglyNum[1500];int index2=0;int index3=0;int index5=0;int min(int a,int b,int c){ int min1=a<b?a:b; return min1<c?min1:c;}void calcUglyNum(){ uglyNum[0]=1;
2015-09-05 17:00:05 419
tpipv6.h(头文件)
2013-01-09
Putty资源合集
2012-11-30
windows界面下的网络编程
2011-12-28
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人