POJ 2572

 1 #include<stdio.h>
 2 #include<iostream>
 3 #include<string>
 4 using namespace std;
 5
 6 int main()
 7 {
 8     //freopen("acm.acm","r",stdin);
 9     string s;
10     int pos;
11     int pos1;
12     string s1;
13     string s2;
14     string s3;
15     int i;
16     int sum1;
17     int sum2;
18     int sum3;
19     while(cin>>s)
20     {
21         sum1 = 0;
22         sum2 = 0;
23         sum3 = 0;
24         pos = s.find(‘+‘);
25         s1.assign(s.begin(),s.begin()+pos);
26         for(i = s1.length()-1; i >= 0; -- i)
27         {
28             sum1 = sum1*10 + s1[i]-‘0‘;
29         }
30         pos1 = s.find(‘=‘);
31         s2.assign(s.begin()+pos+1,s.begin()+pos1);
32         for(i = s2.length()-1; i >= 0; -- i)
33         {
34             sum2 = sum2*10 + s2[i]-‘0‘;
35         }
36         s3.assign(s.begin()+pos1+1,s.end());
37         for(i = s3.length()-1; i >= 0; -- i)
38         {
39             sum3 = sum3*10 + s3[i]-‘0‘;
40         }
41         if(sum3 == sum1 + sum2)
42             cout<<"True"<<endl;
43         else
44             cout<<"False"<<endl;
45     }
46 }
时间: 2024-10-06 07:21:09

POJ 2572的相关文章

poj 2572 Hard to Believe, but True!

Hard to Believe, but True! Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 3537   Accepted: 2024 Description The fight goes on, whether to store numbers starting with their most significant digit or their least significant digit. Sometim

POJ - 3186 Treats for the Cows (区间DP)

题目链接:http://poj.org/problem?id=3186 题意:给定一组序列,取n次,每次可以取序列最前面的数或最后面的数,第n次出来就乘n,然后求和的最大值. 题解:用dp[i][j]表示i~j区间和的最大值,然后根据这个状态可以从删前和删后转移过来,推出状态转移方程: dp[i][j]=max(dp[i+1][j]+value[i]*k,dp[i][j-1]+value[j]*k) 1 #include <iostream> 2 #include <algorithm&

POJ 2533 - Longest Ordered Subsequence(最长上升子序列) 题解

此文为博主原创题解,转载时请通知博主,并把原文链接放在正文醒目位置. 题目链接:http://poj.org/problem?id=2533 Description A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK)

POJ——T2271 Guardian of Decency

http://poj.org/problem?id=2771 Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 5932   Accepted: 2463 Description Frank N. Stein is a very conservative high-school teacher. He wants to take some of his students on an excursion, but he is

POJ——T2446 Chessboard

http://poj.org/problem?id=2446 Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 18560   Accepted: 5857 Description Alice and Bob often play games on chessboard. One day, Alice draws a board with size M * N. She wants Bob to use a lot of c

poj 1088 滑雪 DP(dfs的记忆化搜索)

题目地址:http://poj.org/problem?id=1088 题目大意:给你一个m*n的矩阵 如果其中一个点高于另一个点 那么就可以从高点向下滑 直到没有可以下滑的时候 就得到一条下滑路径 求最大的下滑路径 分析:因为只能从高峰滑到低峰,无后效性,所以每个点都可以找到自己的最长下滑距离(只与自己高度有关).记忆每个点的最长下滑距离,当有另一个点的下滑路径遇到这个点的时候,直接加上这个点的最长下滑距离. dp递推式是,dp[x][y] = max(dp[x][y],dp[x+1][y]+

POJ 1385 计算几何 多边形重心

链接: http://poj.org/problem?id=1385 题意: 给你一个多边形,求它的重心 题解: 模板题,但是不知道为啥我的结果输出的确是-0.00 -0.00 所以我又写了个 if (ans.x == 0) ans.x = 0 感觉好傻逼 代码: 1 #include <map> 2 #include <set> 3 #include <cmath> 4 #include <queue> 5 #include <stack> 6

POJ 1741 Tree(树的点分治,入门题)

Tree Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 21357   Accepted: 7006 Description Give a tree with n vertices,each edge has a length(positive integer less than 1001).Define dist(u,v)=The min distance between node u and v.Give an in

poj 1655 树的重心

Balancing Act Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 13178   Accepted: 5565 Description Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or m