算法基础——【枚举】

完美立方

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

typedef long long ll;

int main(){
	int N = 0;
	cin>>N;
	for(int i = 2;i<=N;i++ ){
		for(int j = 2;j<i;j++){
			for(int k = j;k<i;k++){
				for(int m = k;m<i;m++){
					if(i*i*i==j*j*j+k*k*k+m*m*m)
				    printf("%d = (%d,%d,%d)\n",i,j,k,m);
				}
			}
		}
	}
	return 0;
}

生理周期

#include <iostream>
#include <cstdio>
using namespace std;
#define N 21252
int gcd(int a,int b){
	return b?a:gcd(b,a%b);
}
int lcm(int a,int b){
	return a*b/gdc(a,b); 
}
int main(){
		int p,e,i,d,caseNo = 0;
		while( cin >> p >> e >>i >>d && p!= -1) {
			++ caseNo;
			int k = d+1;
			while((k-p)%23) k++;
			while((k-p)%28) k+=23;
			while((k-p)%33) k+=lcm(23,28);
			 
			cout << "Case " << caseNo << ": the next triple peak occurs in " << k-d << " days." << endl; }
		return 0;
	}
//23 28 33