hdoj_1215_七夕节(代码片段)

phalq phalq     2023-01-27     800

关键词:

AC代码:

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;

long int hanshu(long int a)

    long int sum=1;
    long int bi=(int)sqrt((double)a);
    for(long int i=2;i<=bi;i++)
    
        if(a%i==0)
        
            sum+=i;
            if(i!=a/i)
                sum+=a/i;
        
    
    
    return sum;


int main(void)

    freopen("in.txt","r",stdin);
    long long n;
    scanf("%lld",&n);
    while(n--)
    
        long int a,sum;
        scanf("%ld",&a);
        sum=hanshu(a);
        printf("%lld
",sum);
    

    fclose(stdin);
    return 0;

 

hdoj_1008_elevator(代码片段)

elevator:电梯denote:vt. 指代;预示;代表;意思是;compute:v. 计算,估算;推断;用计算机计算; n. 计算; FontSize:←→ProblemDescriptionThehighestbuildinginourcityhasonlyoneelevator.ArequestlistismadeupwithNposit 查看详情

hdoj_1003_maxsum(代码片段)

AC代码:#include<iostream>#include<cstdio>#defineMax100005usingnamespacestd;inta[Max];intmain(void)freopen("in.txt","r",stdin);intT,count=0;longlongn;scanf("%d",&T);while(T--)inthead=1, 查看详情

hdoj_1019_大二写_leastcommonmultiple(代码片段)

思路:最小公倍数=两个数相乘除以两个数的最大公约数。AC代码:#include<iostream>#include<cstdio>usingnamespacestd;unsignedintgcd(unsignedintt1,unsignedintt2)if(t2==0)return(t1);elsereturngcd(t2,t1%t2);intmain(void)fr 查看详情

hdoj_1005_numbersequence(代码片段)

找规律:(0,0),(0,1)......(6,6);每次a和b的值是一样的。找规律,每49一次循环。 FontSize:←→ProblemDescriptionAnumbersequenceisdefinedasfollows:f(1)=1,f(2)=1,f(n)=(A*f(n-1)+B*f(n-2))mod7.GivenA,B,andn,youaretocalculatetheval 查看详情

hdoj1069_大二写(代码片段)

AC代码://HDOJ1069#include<iostream>#include<cstdio>#include<algorithm>#defineMax100usingnamespacestd;structdimensinosintl;intw;intd;longintmax_deadline_unit;block[Max];boolcompare(di 查看详情

七夕节hdu-1215(唯一分解素数筛法因子之和加强版)(代码片段)

七夕节HDU-1215题目链接:https://vjudge.net/problem/HDU-1215#author=0题目:七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!"人们纷纷来到告... 查看详情

hdoj_1002(代码片段)

AC代码:#include<iostream>#include<cstdio>#include<cstring>#defineMax1050usingnamespacestd;voidhanshu(char*s1,char*s2,char*s);intmain(void)freopen("in.txt","r",stdin);intT,count=0;char 查看详情

hdoj_1228_a+b(代码片段)

AC代码:#include<iostream>#include<cstdio>#include<cstring>#defineMax105usingnamespacestd;intmain(void)freopen("in.txt","r",stdin);inti,j,sum1,sum2,flag,a,len;chars[Max],s1[Max];while( 查看详情

hdoj_1235_统计同成绩学生人数(代码片段)

AC代码:#include<iostream>#include<cstdio>#defineMax1005usingnamespacestd;inta[Max];intmain(void)freopen("in.txt","r",stdin);intn;while(scanf("%d",&n)!=EOF&&n)inttemp,count=0;fo 查看详情

hdoj1001_sumproblem(代码片段)

AC代码:#include<iostream>#include<cstdio>usingnamespacestd;intmain(void)freopen("in.txt","r",stdin);longlongn;while(scanf("%lld",&n)!=EOF)if(n%2==0)printf("%lld",n/2*(n+1));elsepri 查看详情

hdoj_2047_阿牛的eof牛肉串(代码片段)

AC代码:#include<iostream>#include<cstdio>usingnamespacestd;intmain(void)freopen("in.txt","r",stdin);intn;while(scanf("%d",&n)!=EOF)longlongsum1,sum2,sum;sum1=3;sum2=8;if(n==1)sum=sum1; 查看详情

hdu1215(代码片段)

HDU1215七夕节思路:求一个数的约数和。一:打表#include<cmath>#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>usingnamespacestd;constintmaxn=5e5+10;intsum[maxn];voidinit 查看详情

hdoj_2045_不容易系列之——lele的rpg难题(代码片段)

AC代码:#include<iostream>#include<cstdio>#include<cstring>#defineMax55usingnamespacestd;longlonginta[Max][1005];voidhanshu()memset(a,0,sizeof(a));inti,j;a[1][0]=3;a[2][0]=6;a[3][0]=6; 查看详情

hdoj_1290_大二写_献给杭电五十周年校庆的礼物(代码片段)

AC代码:#include<iostream>#include<cstdio>usingnamespacestd;intmain(void)freopen("in.txt","r",stdin);intn;while(scanf("%d",&n)!=EOF)printf("%lld",1+(n*n*n+5*n)/6);fclose(stdin);retur 查看详情

html5七夕情人节表白网页制作__浪漫空中散落的花瓣3d相册__html+css+javascript(代码片段)

HTML5七夕情人节表白网页制作❤浪漫空中散落的花瓣3D相册❤HTML+CSS+JavaScript这是程序员表白系列中的100款网站表白之一,旨在让任何人都能使用并创建自己的表白网站给心爱的人看。此波共有100个表白网站,可以任... 查看详情

hdu1215七夕节-(埃氏筛+唯一分解定理)(代码片段)

七夕节TimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):56666    AcceptedSubmission(s):18239ProblemDescription七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人... 查看详情

hdoj2099_整数的尾数(代码片段)

一道我以为不会这么简单,然后暴力盲打竟然给过了的题。HDOJ2099_整数的尾数#include<stdio.h>#include<stdlib.h>#include<ctype.h>#include<math.h>intmain()inta,b,n;inti,j;while(scanf("%d%d",&a,&b)!=EOF)intn2[100];intcnt=0;if(a==0&... 查看详情

七夕节写那些结伴而行的特殊方法

__getattr__和__setattr__这两个特别简单,__getattr__是通过属性操作符.或者反射getattr(),hasattr()无法获取到指定属性(对象,类,父类)的时候,该方法被调用__setattr__则是设置属性的时候被调用classA:def__getattr__(self,item):print(‘%s找不到这个属... 查看详情