- 博客(17)
- 资源 (4)
- 收藏
- 关注
原创 POJ-2350
#include#includeusing namespace std;int gradeArray[1000];int main(int argc, char *argv[]){ int caseNum; cin>>caseNum; for(int i=0; i<caseNum;i++){ int studentNum; cin>>studentNum; int
2015-10-31 16:45:50 447
原创 POJ-2328
#include#includeusing namespace std;#define MAX 10#define MIN 1int main(int argc, char *argv[]){ bool isCheating=false; int regionLow=MIN-1; int regionHigh=MAX+1; int guessNum; while(cin>
2015-10-31 16:06:14 346
原创 POJ-2301
#includeusing namespace std;int main(int argc, char *argv[]){ int caseSum; cin>>caseSum; for(int i=0;i<caseSum;i++){ int sum, diff; cin>>sum>>diff; float bigger=(sum+diff)*1.0/2; float
2015-10-31 14:26:48 390
原创 POJ-2247
#includeusing namespace std;#define MAX_INPUT 5842 int index2=0; int index3=0; int index5=0; int index7=0; int humbleNum[MAX_INPUT]={1}; void calcHumbleNum(){ int index=1; while(1){
2015-10-31 14:10:25 467
原创 POJ-2209
#include#includeusing namespace std;int main(int argc, char *argv[]){int sonNum;cin>>sonNum;int exponent;cin>>exponent;int sum=0;for(int i=0; iint potential;cin>>pote
2015-10-18 15:13:27 261
原创 POJ-2190
#include#include#includeusing namespace std;int main(int argc, char *argv[]){ string line1; while(cin>>line1){ int sum=0; int index; for(int i=0; i<line1.length(); i++){ if(line1[i]=
2015-10-18 14:53:11 354
原创 POJ-2163
#include#includeusing namespace std;int main(int argc, char *argv[]){ int m, n, k; cin>>m>>n>>k; float price[10000]; for(int i=0; i<k; i++){ cin>>price[i]; } bool preIsBull; for(int i=n
2015-10-18 11:38:32 404
原创 POJ-2159
#include#include#includeusing namespace std;int alphabet1[26];int alphabet2[26];int main(int argc, char *argv[]){ string line1; cin>>line1; memset(alphabet1, 0, 26); string line1Org="";
2015-10-18 10:47:19 375
原创 POJ-2141
#include#includeusing namespace std;string abc="abcdefghijklmnopqrstuvwxyz";int main(int argc, char *argv[]){ string key; cin>>key; getchar(); string encryptedMsg; getline(cin, encryptedMs
2015-10-17 23:46:40 352
原创 POJ-2128
#include#includeusing namespace std;int main(int argc, char *argv[]){ int cityNum; cin>>cityNum; int e1, s2; int shortDistance=pow(10.0,9); int preDistance; int firstCityDistance;// int tw
2015-10-17 13:26:27 418
原创 POJ-2109
#include#includeusing namespace std;double exponent(double a, double b){ double e=0; while(pow(e*1.0, a)!=b){ e++; //cout<<pow(a*1.0,e)<<endl; } return e;}int main(int argc, char *arg
2015-10-17 12:07:56 293
原创 POJ-2105
#include#include#include#includeusing namespace std;string binaryTranslateDecimal(string s){ string result=""; for(int i=0;i<4;i++){ int decimal=0; for(int j=0;j<8;j++){ if(s[i*8+j]=='
2015-10-17 11:49:14 274
原创 POJ-2081
#include#includeusing namespace std;#define MAX_K 500000int main(int argc, char *argv[]){ int v[MAX_K+1]; bool hash[3012501]; memset(hash,false,sizeof(hash)); int aM_1=0; v[0]=aM_1; hash[0
2015-10-11 21:32:12 386
原创 POJ-2070
#includeusing namespace std;int main(int argc, char *argv[]){ float speed,weight,strength; while(cin>>speed>>weight>>strength,speed||weight||strength){ bool flag1=false; bool flag2=false; b
2015-10-11 12:26:56 356
原创 POJ-2039
#include#includeusing namespace std;int main(int argc, char *argv[]){ int colume; while(cin>>colume,colume){ string s; cin>>s; for(int i=0;i<colume;i++){ for(int j=i;j<s.size();j+=colum
2015-10-11 12:05:21 245
原创 POJ-2028
#include#include#includeusing namespace std;int main(int argc, char *argv[]){ int n,q; while(cin>>n>>q,n!=0 || q!=0){ map date; map::iterator pos=date.begin(); for(int i=0;i<n;i++){ in
2015-10-11 11:19:29 324
原创 POJ-2027
#includeusing namespace std;int main(int argc, char *argv[]){ int num; cin>>num; for(int i=0;i<num;i++){ int a,b; cin>>a>>b; if(a<b){ cout<<"NO BRAINS"<<endl; }else{ cout<<"MMM B
2015-10-11 09:20:19 329
tpipv6.h(头文件)
2013-01-09
Putty资源合集
2012-11-30
windows界面下的网络编程
2011-12-28
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人