ACM Dream

#include #include using namespace std; #define MAXLENGTH 8 void lcd_display (long size, long number){ // 将number拆分为单个的数字。 int digits[MAXLENGTH]; memset (

题意：给一串字符串字典，再给一串字符串，求字典中是否存在与字符串字符相同的字符串。#include #include #include #include using namespace std;void main(){ map dictionary; string s, t; while (cin >> s && s != "XXX

题意：如题。#include#include#define N 1000001int visited[N];int Self(int n){ int sum=n; while(n/10) { sum+=n%10; n/=10; } sum+=n; return sum;}

题意：如题。#include #include using namespace std;int dd(int x, int y);void main(){ vector > tmpbox; unsigned int a; unsigned int b; while (cin >> a >>

题意：如题。 #include #include #include int cmp(const void *a,const void *b){ return *(int*)a-*(int*)b; }int main(){ int i,count; char s[1005],*p; int num[1005]; while(sc

#include using namespace std;void main(){int n,m;cin>>n;while(n--){while(cin>>m){int a,sum=0;while(m--){cin>>a;sum+=a;}cout<<sum<<endl;}}}

题意：如题。#include using namespace std;void main(){int a,b;while (cin>>a>>b)cout<<a+b<<endl;}

题意：这题是性价比问题，牛奶的平均价格=价格/天数，比较一下，当这个相等是，就要比较一下它们各自的容量了。考虑到这两点就可以了。 #include #include #include #include using namespace std;struct milk{ char brand[101]; int price; int vol

题意：如题。#include void main(){ double month; double average = 0; int n = 0; while (n < 12) { scanf("%lf", &month); average += month; ++n;

题意：如题。#include #include #include #include using namespace std;void deal(string& line, int start, int end){ end -= 1; while (start < end) { line[start] ^= line[e

题意：如题。#include void main(){ double length; double l[300]; l[1] = 1.0/2; int i; for (i = 2;; ++i) { l[i] = l[i-1] + 1.0/(i+1); if (l[i] >= 5.20)

题意：求给定一排数的排序之后的中点。#include#include#includeusing namespace std;#define N 10000int A[N];int main(){ //freopen("1007.txt","rt",stdin); int n; while(scanf("%d",&n)!=EOF)

题意：如题。 #include #include using namespace std;int main(){ int T; cin>>T; int A,B; char C; while(T--) { cin>>C>>A>>B; if(C=='+') cout<<A+B<<

#include #include using namespace std;void main(){ int n, sum, flag = 0; while (cin >> n && n) { flag++; sum = 0; int t = n; int *p = n

#include#define N 20int A[N];int main(){ int i=0; while(scanf("%d",&A[i])) { if(i==0 && A[i]==-1) { break; } if(A[i]==0)

#includeusing namespace std;int main(){ int N; cin >> N; while (N--) { int map[8] = { 0, 1, 2, 3, 4, 5, 6, 7 }; int n; cin >> n; while (

#include #include #include using namespace std;int main(){ double num[205]; int i; double s; char f; double sum; while(cin>>s) { memset(num,'\0',s

题意：如题#include using namespace std;int main(){ int ncases; scanf("%d",&ncases); while(ncases--) { __int64 maxvalue=-1,sweetkinds,sum=0; scanf("%I64u",&sweetkinds); __int6

题意：如题。  #include#includeint main(){ int i,n; while(scanf("%d",&n)!=EOF&&n!=0) { i=0; while(!(n%2)) {

#include #include using namespace std; int n, m;int main(){ string openPer, closePer; string openTime, closeTime; string s1, s2, s3; cin >> n; while (n--) {

题意：编码方式：把字符串一列一列的排下来，一共排成n列。则一行一行读下来（奇数行从前往后读，偶数行从后往前读），得到的字符串为编码加密后的字符串。给一个数n，和一个字符串，求给字符串解密。 #include #include void main(){ int column; char message[201]; while (scanf("

题意：如题。 题中 0  参考别人推出一些公式：m=0时 A(m,n)=n+1;m=1时 A(m,n)=A(0,A(1,n-1))=A(1,n-1)+1=A(1,n-2)+1+1=……=n+2;m=2时 A(m,n)=n*2+3m=3时 A(m,n)=A(2,A(m,n-1))=A(m,n-1)*2+3#includeint a[4][10000

题意：如题。 #include #include int all[13] = { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365 };struct Date{ int year, month, day; Date() {} Date(int y, int m, int

#include using namespace std;void main(){ int n,m; cin>>n; int*p=new int[n]; int d=n; while(n--) { cin>>m; int a,sum=0;

#include using namespace std;void main(){int a,b;while(cin>>a>>b)cout<<a+b<<endl<<endl;}

题意：如题. #includeint main(){ int n; while(scanf("%d",&n)!=EOF) { if(n%4==2) printf("yes\n"); else printf("no\n"); } return 0;}

题意：如题。 #include #include using namespace std;void main(){ int n; int a, b; scanf("%d", &n); while (n--) { int cas = 0; while (scanf("

题意：如果两个数不互质，则输出“Bad Choice”，否则“Good Choice”.  #includeint gcd(int a,int b){ if(a%b==0) return b; else return gcd(b,a%b);}int main(){ int i,j,k,m,n,s; while(scanf("%d%d",&

题意：求一个数，各个数位相加，如果结果小于10则输出，否者递归进行数位相加。 #include #include #include #include using namespace std;int result(int n){ int sum = 0; while (n > 0) { sum += n % 10;

题意：如题。 #include"stdio.h"int main(){ double sum; int i,j,k,p; printf("n e\n- -----------\n"); for(i=0;i<=9;i++) { sum=1; for(j=1;j<=i;j++) {

题意：给一个数n，后跟着n个数，代表电梯要到的层数，如果是上升，则每层花费6分钟，下降每层划分4分钟，停着话费5分钟，求电梯总共花费多少时间。 #include using namespace std;void main(){ int n, m, t, total; while (cin >> n && n != 0) {

题意：输入n，求1~n之和。import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner s=new Scanner(System.in); int n=0; int sum;

#include int main(){ int a, b; while (scanf("%d%d", &a, &b) != EOF) { printf("%d\n", a+b); }}

题意：根据火车的进队序列，问知否会出现给定的出队序列。输入：火车数  进队序列  出队序列。 用栈模拟：#include #include #include using namespace std;char a[12], b[12];bool inque[24];bool solve(int l){ stack q; int i

题意：如题。 #include#includeint main (){ int t ; char str[10005]; while( scanf("%d" , &t ) != EOF ) { while( t-- ) { scanf("%s" , str); int len = strlen ( str );

题意：// 考虑如下的序列生成算法：从整数 n 开始，如果 n 是偶数，把它除以 2；如果 n 是奇数，把它乘 3 加// 1。用新得到的值重复上述步骤，直到 n = 1 时停止。例如，n = 22 时该算法生成的序列是：//// 22，11，34，17，52，26，13，40，20，10，5，16，8，4，2，1//// 人们猜想（没有得到证明）对于任意整数 n，该算法总能终

题意：如题。#include #include using namespace std;void main(){ int T; int n; int *p; while(cin >> T){ while (T--) { cin >> n; p=new int[n]; int t=n; while (t--)

#include using namespace std;void main(){int n;while(cin>>n){int a,sum=0;while(n--){cin>>a;sum+=a;}cout<<sum<<endl;}}

#include using namespace std;void main(){int n;while(cin>>n&&n!=0){int a,sum=0;while(n--){cin>>a;sum+=a;}cout<<sum<<endl;}}

#include using namespace std;void main(){int a,b;while (cin>>a>>b){if(a==0&&b==0)return;cout<<a+b<<endl;}}