ACM_Codeforces
ITAK
这个作者很懒,什么都没留下…
展开
-
Codeforces 672 C. Recycling Bottles(Codeforces Round #352 (Div. 2))
传送门C. Recycling Bottles time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output It was recycling day in Kekoland. To celebrate it Adil and Bera we原创 2016-05-16 13:12:47 · 1154 阅读 · 0 评论 -
CodeForces 659 A. Round House(简单数学推理)
传送门 A. Round House time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Vasya lives in a round building, whose entrances are numbered sequentia原创 2016-06-07 20:02:28 · 1608 阅读 · 0 评论 -
CodeForces 659 B. Qualifying Contest(结构体排序的问题)
传送门 B. Qualifying Contest time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Very soon Berland will hold a School Team Programming Olympiad.原创 2016-06-07 20:10:34 · 2973 阅读 · 0 评论 -
CodeForces 659 C. Tanya and Toys
传送门 C. Tanya and Toys time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output In Berland recently a new collection of toys went on sale. This coll原创 2016-06-07 20:14:54 · 1582 阅读 · 0 评论 -
CodeForces 659 D. Bicycle Race(计算几何 + 数学公式)
传送门 D. Bicycle Race time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Maria participates in a bicycle race.The speedway takes place on the s原创 2016-06-07 20:38:28 · 2179 阅读 · 0 评论 -
Educational Codeforces Round 13 A.Johny Likes Numbers && B. The Same Calendar
传送门 A. Johny Likes Numbers time limit per test0.5 seconds memory limit per test256 megabytes inputstandard input outputstandard output Johny likes numbers n and k very much. Now Johny wants to fi原创 2016-06-25 21:02:17 · 2823 阅读 · 0 评论 -
Codeforces 678 C. Joty and Chocolate
传送门C. Joty and Chocolate time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Little Joty has got a task to do. She has a line of n tiles indexe原创 2016-06-25 21:09:59 · 2465 阅读 · 0 评论 -
Codeforces 148D. Bag of mice(概率DP)
传送门The dragon and the princess are arguing about what to do on the New Year’s Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the princess thinks they原创 2017-09-03 18:23:18 · 573 阅读 · 0 评论 -
Codeforces Round #308 (Div. 2) A. Vanya and Table
题目链接:http://codeforces.com/contest/552/problem/A hint: 就是求几个矩形的面积#include <iostream>#include <cmath>using namespace std;struct point{ int x; int y;}a[2];int main(){ int m; while原创 2015-06-22 15:34:33 · 770 阅读 · 0 评论 -
Codeforces 548 A. Mike and Fax
题目链接:http://codeforces.com/contest/548/problem/A 题目大意:给你一个字符串和一个数k,将这个字符串分成k个子字符串,判断每一个是不是回文串,如果是,输出YES,不是输出NO。#include <iostream>#include <cstring>#include <cstdio>using namespace std;char s[1005原创 2015-07-11 17:22:30 · 804 阅读 · 0 评论 -
Codeforces 510 A.Fox and Snake
题目链接:http://codeforces.com/contest/510/problem/AA. Fox And Snaketime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel starts to learn program原创 2015-07-11 11:56:38 · 1135 阅读 · 0 评论 -
Codeforces 534 A. Exam
题目链接:http://codeforces.com/contest/534/problem/A 题意大意:给出n个学生,编号为1~n,要求学生坐在一排并且相邻的学生编号相差不能为1,求出满足这样要求的最大学生数量并输出方案。 解题思路:除了1,2,3,4以外,其他的都要按照先找奇数,在排偶数。或者先排偶数,再排奇数。#include <iostream>using namespace std原创 2015-07-12 11:06:13 · 848 阅读 · 0 评论 -
codeforces 7 A. Kalevitch and Chess
题目链接:http://codeforces.com/contest/7/problem/A 以前写的时候写的有点不是很好有点麻烦,看了一些大牛们的思路后感觉自己以前的代码真是弱爆了。 AC代码如下:#include <iostream>#include <cstring>#include <cstdio>using namespace std;char s[10][10];int m原创 2015-07-10 22:27:07 · 744 阅读 · 1 评论 -
Codeforces Round #307 (Div. 2) A
http://codeforces.com/contest/551/problem/A#include <iostream>using namespace std;int data[2005];int main(){ int m; while(cin>>m) { for(int i=0; i<m; i++) cin>>data[i]原创 2015-06-14 14:02:24 · 425 阅读 · 0 评论 -
A. Case of the Zeros and Ones
题目链接:http://codeforces.com/contest/556/problem/A#include <iostream>#include <cstdlib>using namespace std;int main(){ int m; string s; cin>>m>>s; int j=0; for(int i=0; i<m; i++)原创 2015-07-04 22:04:32 · 527 阅读 · 0 评论 -
Codeforces 451 A . Game With Sticks
题目链接:http://codeforces.com/contest/451/problem/A#include <iostream>#include <cstdio>using namespace std;int main(){ int m,n; cin>>m>>n; if(m==1 || n==1) puts("Akshat"); else原创 2015-07-05 21:18:05 · 551 阅读 · 0 评论 -
Codeforces 451 B. Sort the Array
题目链接:http://codeforces.com/contest/451/problem/B#include <iostream>#include <cstdio>#include <cmath>#include <algorithm>using namespace std;typedef long long LL;const int maxn=1e5+5;int a[maxn];原创 2015-07-05 22:10:37 · 653 阅读 · 0 评论 -
codeforces 560 A. Currency System in Geraldion
题目链接:http://codeforces.com/problemset/problem/560/A#include <iostream>using namespace std;int main(){ int m,num,ans=1; cin>>m; for(int i=0; i<m; i++) { cin>>num; if(n原创 2015-07-27 14:38:58 · 778 阅读 · 0 评论 -
hdu 2539 点球大战
题目链接:http://codeforces.com/contest/538/problem/A 题意:找子串是codeforces的串 提示:就是找结点#include <iostream>#include <cstring>#include <cstdio>using namespace std;char s[105];int main(){ cin>>s; in原创 2015-07-13 19:33:08 · 957 阅读 · 0 评论 -
codeforces 448 A. Rewards
题目链接:http://codeforces.com/contest/448/problem/A 提示:水,看懂题即可#include <iostream>#include <cstdio>using namespace std;int main(){ int a[3]; int b[3]; int m; int suma=0,sumb=0; for(原创 2015-07-10 15:48:09 · 795 阅读 · 0 评论 -
codeforces 450B Jzzhu and Sequences
题目链接:http://codeforces.com/contest/450/problem/B B. Jzzhu and Sequences time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Jzzhu has invented原创 2015-07-10 15:25:07 · 1051 阅读 · 0 评论 -
Codeforces Round #308 (Div. 2) Vanya and Books
题目链接:http://codeforces.com/contest/552/problem/B 题意:就是求有几个数字; eg:13:1 2 3 4 5 6 4 7 8 9 1 0 1 1 1 2 1 3 一共17个数字#include <iostream>using namespace std;long long a[12]={0,9,99,999,9999,99999,999999原创 2015-06-22 16:20:20 · 805 阅读 · 0 评论 -
Codeforces Round #309 (Div. 2) A. Kyoya and Photobooks
题目链接:http://codeforces.com/contest/554/problem/A#include <iostream>#include <cstring>using namespace std;int main(){ char s[25]; while(cin>>s) { int len=strlen(s); int su原创 2015-06-25 19:24:10 · 543 阅读 · 0 评论 -
Codeforces Round #299 (Div. 2) A. Tavas and Nafas
题目链接:http://codeforces.com/problemset/problem/535/A#include <iostream>#include <string>using namespace std;int main(){ string s1[10]={"zero","one","two","three","four","five","six","seven","eigh原创 2015-06-24 14:40:34 · 665 阅读 · 0 评论 -
Codeforces Round #309 (Div. 2) B. Ohana Cleans Up
题目链接:http://codeforces.com/contest/554/problem/B#include <iostream>#include <string>#include <cmath>using namespace std;int main(){ int ans=0,m; while(cin>>m) { string s[105];原创 2015-06-25 19:57:18 · 714 阅读 · 0 评论 -
Looksery Cup 2015 A
http://codeforces.com/contest/549/problem/A 做的实在是太暴力了,嘿嘿#include <iostream>#include <cstring>using namespace std;char st[55][55];int main(){ int m,n; while(cin>>m>>n) { memset原创 2015-06-07 17:09:18 · 452 阅读 · 0 评论 -
Codeforces 3 C. Tic-tac-toe
题目链接:http://codeforces.com/contest/3/problem/C 提示:此题巨坑,一定要注意是illegal的情况#include <iostream>#include <cstdio>using namespace std;char s[5][5];int main(){ int f1=0,f2=0; int sumx=0,sum0=0;原创 2015-07-08 22:36:46 · 893 阅读 · 0 评论 -
Codeforces Round #311 (Div. 2) B. Pasha and Tea
题目链接:http://codeforces.com/contest/557/problem/B 题意:给你n个boy,n个girl ,然后w表示茶壶的最大容量,然后n个茶杯,每个都有不同的容量,要求boy的茶杯里的茶水是girl的两倍,且boy和boy的容量一样,girl和girl的容量一样,问如何倒茶,求最大的倒茶量#include <iostream>#include <cstdio>#原创 2015-07-02 21:07:09 · 580 阅读 · 0 评论 -
Codeforces 347 A. Difference Row
题目链接:http://codeforces.com/contest/347/problem/A 提示:只需要看懂题就行了,大体意思就是只需要找出最大值和最小值, 剩下的从小到大排序就行了#include <iostream>#include <algorithm>using namespace std;int data[105];int main(){ int m;原创 2015-07-09 20:11:45 · 619 阅读 · 0 评论 -
codeforces 448 B. Suffix Structures
题目链接:http://codeforces.com/contest/448/problem/B 题目大意:已知字符串a,b,要把a转换成b。如需删除输出automaton,如需交换输出array,都需要输出both,不可能成功输出need tree。 提示:用两个数组记一下26个字母的个数,在比较字母个数的大小,也就是先找need tree的时候#include <iostream>#inc原创 2015-07-10 16:32:37 · 724 阅读 · 0 评论 -
Codeforces Round #311 (Div. 2) A. Ilya and Diplomas
题目链接:http://codeforces.com/contest/557/problem/A#include <iostream>using namespace std;int minn[3];int maxx[3];int main(){ int m; while(cin>>m) { int ans[3]={0}; for(int原创 2015-07-02 18:26:04 · 608 阅读 · 0 评论 -
Codeforces 456 A. Laptops
题目链接:http://codeforces.com/contest/456/problem/A 提示:一共有n个数,而且a[i],b[i]都<=n;所以我们只需要找当a!=b的时候就行了,代码如下:#include <cstdio>#include <iostream>#include <algorithm>using namespace std;int main(){ boo原创 2015-07-07 09:43:04 · 1234 阅读 · 3 评论 -
CF 260 B. Fedya and Maths
cf 260 B 提示:找规律#include <cstdio>#include <iostream>#include <algorithm>#include <cstring>using namespace std;const int maxn=1e5+5;char s[maxn];int main(){ cin>>s; int len=strlen(s); i原创 2015-07-07 10:36:50 · 615 阅读 · 0 评论 -
Codeforces A. Vasya and Socks
题目链接:http://codeforces.com/contest/460/problem/A#include <iostream>using namespace std;int main(){ int m,n; cin>>m>>n; int sum; for(sum=1; m>0; sum++) { m--; if(sum原创 2015-07-06 22:40:29 · 636 阅读 · 0 评论 -
Codeforces 566 F. Clique in the Divisibility Graph
Codeforces 566F 的传送门As you must know, the maximum clique problem in an arbitrary graph is NP-hard. Nevertheless, for some graphs of specific kinds it can be solved effectively.Just in case, let us remi原创 2015-08-08 18:47:09 · 1134 阅读 · 0 评论 -
Codeforces 43 A. Football
点击打开链接A. Footballtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Vasya decided to have a loo原创 2015-09-08 21:21:37 · 874 阅读 · 0 评论 -
Codeforces 550 C. Divisibility by Eight
C. Divisibility by Eighttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a non-negative integ原创 2015-09-04 20:10:31 · 691 阅读 · 0 评论 -
Codeforces 569 A Music
click here ~~ ***A. Music***inputstandard inputoutputstandard outputLittle Lesha loves listening to music via his smartphone. But the smartphone doesn't have m原创 2015-08-20 19:19:38 · 730 阅读 · 0 评论 -
Codeforces 569 B. Inventory
click here~~ **B. Inventory**time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputCompanies always have a lot o原创 2015-08-20 16:53:27 · 801 阅读 · 0 评论 -
接上一篇 580 B. Kefa and Company [ Codeforces Round #321 (Div. 2)]
B. Kefa and Companytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKefa wants to celebrate his first big s原创 2015-09-24 21:05:22 · 1335 阅读 · 0 评论