sicily
wyx819
这个作者很懒,什么都没留下…
展开
-
sicily 1381
<br />#include <iostream><br />#include <string><br />using namespace std;<br />int main()<br />{<br /> long cs;<br /> cin>>cs;<br /> while(cs--)<br /> {<br /> string str;<br /> long num;<br /> cin>>str>>num;<br /> if(str=="0"||num==0)<br /> cout<<"0原创 2011-03-22 20:22:00 · 312 阅读 · 0 评论 -
1721. Gray code[Special judge]
#include#include#includeusing namespace std;void gray(int a[16],int n){ printf("%d",a[0]); for( int i=1; i<n ; i++ ) { if( (a[i]+a[i-1])%2==0 ) { printf("%c",'0'); }原创 2011-11-08 20:01:51 · 507 阅读 · 0 评论 -
2499. 平方数
/* * ===================================================================================== * * Filename: 1.cpp * * Description: * * Version: 1.0 * Created: 2011年11月原创 2011-11-13 13:24:45 · 777 阅读 · 0 评论 -
2014. Dairy Queen
//利用母函数求排列组合//母函数详解见 http://www.wutianqi.com/?p=596#include#include#includeusing namespace std;int main(int argc, char *argv[]){ int t; cin>>t; int a[2000]; int b[2000]; int n;原创 2011-12-09 22:55:28 · 920 阅读 · 0 评论 -
1002. Anti-prime Sequences
/* * ===================================================================================== * * Filename: 1002.cpp * * Description: * * Version: 1.0 * Created原创 2012-09-11 14:28:40 · 390 阅读 · 0 评论 -
Scily 1011. Lenny's Lucky Lotto
#include #include #includeusing namespace std;long N,m;long long dp[11][2001];int main(){ memset(dp,0,sizeof(dp)); /*init the array*/ for( int j = 1; j<=2000 ; j++ ) { d原创 2012-12-27 00:16:36 · 497 阅读 · 0 评论 -
1048 Inverso
// Problem#: 1048// Submission#: 1829258// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License// URI: http://creativecommons.org/licenses/by原创 2012-12-27 14:35:49 · 537 阅读 · 0 评论 -
siciy 1003. Hit or Miss
#include#include#include#includeusing namespace std;int main(int argc, char *argv[]){ int t; scanf("%d",&t); for( int k = 1; k<=t ; k++) { int current_count[10]; int last_remove[10]; i原创 2013-02-28 13:02:08 · 435 阅读 · 0 评论 -
1004. I Conduit!
#include#include#include#include#includeusing namespace std;const double MAX=999999;struct point{ double x; double y;};struct segment{ point p1; point p2; double k; double b;};voi原创 2013-03-03 12:14:21 · 746 阅读 · 0 评论 -
1298. 数制转换
#include#include#includeusing namespace std;void change(long n){ string str; int tmp=0; int num; while( n/3!=0 ) { num=n%3+tmp; if( num==2 ) { tmp=1; str='-'+str原创 2011-11-08 18:25:29 · 562 阅读 · 0 评论 -
1150. 简单魔板[Special judge]
#include#include#include#includeusing namespace std;int factoral[]={1,1,2,6,24,120,720,5040,40320};//0到8的阶乘struct statue{ long data;//记录当前的状态,技巧是将一个数组转换成整数 string path;//记录路径};原创 2011-11-07 20:00:29 · 659 阅读 · 0 评论 -
sicily 1020 高精度求余
<br />#include <iostream><br />#include <string><br />using namespace std;<br />int main()<br />{<br /> int cs;<br /> cin>>cs;<br /> while(cs--)<br /> {<br /> int n;<br /> cin>>n;<br /> int nr[100],i;<br /> for ( i=0;i<n;i++)<br /> {<br /> cin>>nr[原创 2011-03-22 21:17:00 · 380 阅读 · 0 评论 -
sicily 1020 高精度求余
<br />#include <iostream><br />#include <string><br />using namespace std;<br />int main()<br />{<br /> int cs;<br /> cin>>cs;<br /> while(cs--)<br /> {<br /> int n;<br /> cin>>n;<br /> int nr[100],i;<br /> for ( i=0;i<n;i++)<br /> {<br /> cin>>nr[原创 2011-03-22 21:15:00 · 539 阅读 · 0 评论 -
1201. 01000001
<br />高精度的加法,但是纳米了很久,其实是一道很简单的题<br />/* * ===================================================================================== * * Filename: k.cpp * * Description: * * Version: 1.0 * Created: 2011-5-1 16:46:28原创 2011-05-01 17:46:00 · 979 阅读 · 1 评论 -
1158. Pick numbers
<br />#include <iostream>#include <queue>using namespace std;int row,clo;struct node{ int x; int y; int sum;};int dx[]={0,1};int dy[]={1,0};bool check(int a,int b){ if(a>=1&&a<=row&&b>=1&&b<=clo){ return true; } else ret原创 2011-05-06 20:55:00 · 754 阅读 · 0 评论 -
1093. Air Express
<br />#include <iostream>#include <algorithm>using namespace std;int main(){ int wr[4]; int rate[4]; int count=0; while(cin>>wr[0]) { cin>>rate[0]; cin>>wr[1]>>rate[1]; cin>>wr[2]>>rate[2]; cin>>rate[3]; wr[3]=1原创 2011-05-07 18:46:00 · 835 阅读 · 0 评论 -
1035. DNA matching
<br />/* * ===================================================================================== * * Filename: DNA.cpp * * Description: * * Version: 1.0 * Created: 2011-5-7 18:57:28 * Revision: none *原创 2011-05-07 20:14:00 · 555 阅读 · 0 评论 -
2011. Nine Digits
<br />#include <algorithm>#include <iostream>#include <queue>using namespace std;class Node{ public: int a[3][3]; int sum; Node(int s,int array[3][3]) { sum=s; for(int i=0;i<=2;i++) for(int j=0;j<=2;j++)原创 2011-05-08 13:47:00 · 699 阅读 · 0 评论 -
sicily 1137 河床
//大一大二以前看起来毫无思路的问题,现在积累思考多了,却很容易解决了#include#include#includeusing namespace std;int maxLen(int *a, int start, int end, int k){//special caseif( k==0 ){return 1;}if( k < 0 ){return 0;}if( start == end )原创 2013-09-18 16:58:09 · 738 阅读 · 0 评论