散乱题目
RR-RR
一拳也就能打两个嘤嘤怪
展开
-
E - {A}+{B}(10)问题
E - {A}+{B}(10) HDU - 1412 给你两个集合,要求{A} + {B}. 注:同一个集合中不会有两个相同的元素.Input每组输入数据分为三行,第一行有两个数字n,m(0<n,m<=10000),分别表示集合A和集合B的元素个数.后两行分别表示集合A和集合B.每个元素为不超出int范围的整数,每个元素之间有一个空格隔开.Output针对每组...原创 2018-08-10 21:06:00 · 317 阅读 · 0 评论 -
Digital Roots HDU - 1013
Digital Roots HDU - 1013 The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the re...原创 2018-08-21 16:18:51 · 178 阅读 · 0 评论 -
Who's in the Middle
Who's in the MiddleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23050 Accepted Submission(s): 9789 Problem DescriptionFJ is survey...原创 2018-08-21 15:18:55 · 386 阅读 · 0 评论 -
骨牌铺方格变形计H - Tiling_easy version(15) HDU - 2501
#include<stdio.h>#include<stdlib.h>#include<math.h>int main(){ int n; int t; long long int f[55]; scanf("%d",&t); while(t--) { scanf("%d",&...原创 2018-08-16 20:56:49 · 359 阅读 · 0 评论 -
1018骨牌铺方格
骨牌铺方格Time Limit: 1000 ms Memory Limit: 32768 KiBProblem Description在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n ,输出铺放方案的总数. 例如n=3时,为2× 3方格,骨牌的铺放方案有三种,如下图: Input输入数据由多行组成,每行包含一个整数n,表示该测试实例的长方形方格的规格是2×n (...原创 2018-08-16 20:45:36 · 156 阅读 · 0 评论 -
G最小公倍数
#include<stdio.h>int f(int m,int n);int main(){ int m,n,c; while(~scanf("%d",&m)) { scanf("%d",&n); c=f( m, n); printf("%d\n",c); } return...原创 2018-08-16 19:10:30 · 233 阅读 · 0 评论 -
B完美的字符串
#include<stdio.h>#include<string.h>#include<stdlib.h>int main(){ int b[26],c[26]; char a[10010]; int i,len; int j=0; int t,d; int sum=0; gets(a);...原创 2018-08-16 19:06:58 · 122 阅读 · 0 评论 -
A排队接水
#include<stdio.h>#include<stdlib.h>#include<math.h>int main(){ int n,a[1010],sum; scanf("%d",&n); int i; int t,d,j; sum=0; t=0; ...原创 2018-08-16 19:03:12 · 182 阅读 · 0 评论 -
L - MaratonIME doesn't like odd numbers Gym - 101375L
L - MaratonIME doesn't like odd numbers Gym - 101375L Estrela is known for defending tolerance time in delay tolerance. When he was attending to his MAC101 classes, there was a 15 minutes toleranc...原创 2018-08-18 21:23:25 · 235 阅读 · 0 评论 -
D - MaratonIME in the golden moment Gym - 101375D
D - MaratonIME in the golden moment Gym - 101375D It is a common knowledge the importance in practicing a physical activity, mainly when you take part in ICPC competitions. Keeping this in mind, G...原创 2018-08-18 20:47:46 · 343 阅读 · 0 评论 -
F - MaratonIME educates
F - MaratonIME educates Gym - 101375F USP has many lunch options between all the uni cafeterias and the restaurants inside the campus. An option that is usually chosen by MaratonIME seniors is the...原创 2018-08-18 20:36:35 · 227 阅读 · 0 评论 -
A - MaratonIME stacks popcorn buckets Gym - 101375A
On a Friday afternoon, some members of MaratonIME decided to watch a movie at CinIME.There were n members who received popcorn buckets numbered from 1 to n.At a certain moment, bucket 1 had one po...原创 2018-08-18 19:47:01 · 222 阅读 · 0 评论 -
G 测试你是否和LTC水平一样高
#include<stdio.h>#include<stdlib.h>#include<math.h>void f(int sum){ int i,j,k; for(i=1; i<100; i++) { for(j=1; j<100; j++) {...原创 2018-08-15 20:15:25 · 295 阅读 · 0 评论 -
A 旋转字符串
旋转字符串S0...n−10...n−1是一个长度为n的字符串,定义旋转函数Left(S)=S1…n−11…n−1+S00.比如S=”abcd”,Left(S)=”bcda”.一个串是对串当且仅当这个串长度为偶数,前半段和后半段一样。比如”abcabc”是对串,”aabbcc”则不是。现在问题是给定一个字符串,判断他是否可以由一个对串旋转任意次得到。Input第1行:给出一个字符串...原创 2018-08-15 19:32:41 · 399 阅读 · 0 评论 -
D - Parity UVA - 10931
#include<stdio.h>#include<stdlib.h>#include<string.h>int a[1010];int main(){ int i,r,n,t,s; int top=0; while(~scanf("%d",&n)&&n!=0) { mem...原创 2018-08-17 21:01:57 · 197 阅读 · 0 评论 -
A MaratonIME helps Pablito Gym 100985A
♬ Caloventor tiene miedo... ♬Benedetto, NathanAs is well known by any cultured person, rats are the smartest beings on earth. Followed directly by dolphins.MaratonIME knows about the species hie...原创 2018-08-11 20:42:15 · 390 阅读 · 0 评论 -
水仙花数
#include<stdio.h>int main(){ int num,i,m,n,x,y,z; while(scanf("%d %d",&m,&n) != EOF) { i = 0; for(num=m; num<=n; num++) { x = num/...原创 2018-08-10 21:24:24 · 135 阅读 · 0 评论 -
Let the Balloon Rise HDU - 1004
Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will cou...原创 2018-08-21 20:05:54 · 190 阅读 · 0 评论