u013570474的专栏

http://acm.hdu.edu.cn/showproblem.php?pid=1008#include #include #include #define maxn 1000 +10using namespace std;int main(void){   int num[maxn];   int t;   while(sc

逆向递推#include #include #include #include using namespace std;#define LL long longLL a[100];int main(){   char s[] = "T.T^__^";   a[1] = 4;   a[2] = 3;   int n;

一开始想用二分， 可是后来看到网上有这个。。。ORZ#include#includeusing namespace std;double n,p;int main(){    while(cin>>n>>p){        cout    }}

神精度问题，好题#include#include#include#includeusing namespace std;const int N = 110;double eps = 1e-5;int A[N];int main() { int n; while(scanf("%d", &n) != EOF) { double total = 0; for(i

A. Queue on Bus Stoptime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt's that time of the year when the Rus

#include #include #include #include using namespace std;long long int num[100005]={0};long long int a[100005]={0};long long int b[100005]={0};int main(){    //memset(a,

C. Devu and Partitioning of the Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDevu being a small kid

#include #include #include using namespace std;int main(){    int num[5][5];    for( int i = 0;i      for( int j = 0; j       scanf("%d", &num[i][j]);      __int64

B. Devu, the Dumb Guytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDevu is a dumb guy, his learning curve

#include #includeusing namespace std;int main(){    int n,t;    int num[105] = {0};    int sum = 0;    scanf("%d %d",&n, &t);    for( int i = 0; i         {             s

#include #include #include using namespace std;int main(){    int t,n,m,x;    scanf("%d",&t);    while(t--)    {        int maxn = 0;        int sum = 0;        int ans

#include #include #include #include #include using namespace std;struct node{    int h;    int m;    int s;    int p;}num[20010];int cmp ( node a, node b){

#include #include using namespace std;int main(){    int n,m,t;    int p,q;    scanf("%d",&t);    while(t--)    {   scanf("%d %d",&n, &m);        int sum1 = 0; int sum2

#include#include#includestring.h>int main(){ int n,tables,corridor[200],i,j,start,end,time,x,y; scanf("%d",&n); while(n-->0){ memset(corridor,0,sizeof(corridor)); time=0

#include #include #include using namespace std;#define maxn 100000 + 10struct node{    int x,y;}team[maxn];int num1[maxn];int num2[maxn];int hos[maxn];i

注意比较两个代码绿色的部分，WA中先算出性价比W再通过W*N算出整个物体的价值。会有一定的误差；所以AC中整个物体的价值是单存的。WA#include #include #include #include #define maxn 1000 + 10using namespace std;struct node{    doubl

提问全局题号1756添加于2009-10-29提交次数3652尝试人数2039通过人数1929评价此题共有12人评分33.3% 16.7% 8.3% 25.0% 16.7% 你的提交记录#结果时间2Accepted0