Street Numbers
2013-08-29 22:16
169 查看
http://www.bnuoj.com/bnuoj/contest_show.php?cid=2322#problem/25799
// File Name: bo_jwolf1.cpp // Author: rudolf // Created Time: 2013年08月23日 星期五 22:08:38 #include<vector> #include<list> #include<map> #include<set> #include<deque> #include<stack> #include<bitset> #include<algorithm> #include<functional> #include<numeric> #include<utility> #include<sstream> #include<iostream> #include<iomanip> #include<cstdio> #include<cmath> #include<cstdlib> #include<cstring> #include<ctime> using namespace std; int main() { int x = 3 , y = 1 , tempx , tempy , Case = 10 ; while( Case-- ) { tempx = 3 * x + 8 * y ; tempy = x + 3 * y ; printf( "%10d%10d\n" , tempy , ( tempx - 1 ) / 2 ) ; x = tempx ; y = tempy ; } return 0; }
相关文章推荐
- POJ 1320:Street Numbers
- UVaOJ138 - Street Numbers
- UVa 138 Street Numbers / 佩尔方程
- POJ 1320:Street Numbers 佩尔方程
- UVA 138 - Street Numbers
- joj 1753: Street Numbers
- uva 138 Street Numbers
- Runaround Numbers chapter 2.2
- Leetcode 2--Add Two Numbers
- leetcode Sum Root to Leaf Numbers(所有路径之和)
- LeetCode-Add Two Numbers
- LeetCode | Sum Root to Leaf Numbers
- poj Sum of Consecutive Prime Numbers 模拟
- Sicily 1158. Pick numbers
- [LeetCode]Add Two Numbers
- hdu 1058 Humble Numbers
- HDU1128:Self Numbers
- Codeforces Beta Round #51 D. Beautiful numbers
- Lc 2 - Add Two Numbers
- 【second】Add Two Numbers