10 2019 档案

摘要:http://poj.org/problem?id=2096 Description Ivan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he 阅读全文
posted @ 2019-10-29 20:23 Xxiaoyu 阅读(210) 评论(0) 推荐(0) 编辑
摘要:http://acm.hdu.edu.cn/downloads/CCPC2018-Hangzhou-ProblemSet.pdf 阅读全文
posted @ 2019-10-24 01:25 Xxiaoyu 阅读(147) 评论(0) 推荐(0) 编辑
摘要:https://www.luogu.org/problem/P2622 题目描述 现有n盏灯,以及m个按钮。每个按钮可以同时控制这n盏灯——按下了第i个按钮,对于所有的灯都有一个效果。按下i按钮对于第j盏灯,是下面3中效果之一:如果a[i][j]为1,那么当这盏灯开了的时候,把它关上,否则不管;如果 阅读全文
posted @ 2019-10-22 21:17 Xxiaoyu 阅读(175) 评论(0) 推荐(0) 编辑
摘要:http://codeforces.com/gym/101615/attachments 除了除法分块,还需要注意的是一定要用 unsigned 否则会wa。 阅读全文
posted @ 2019-10-22 10:03 Xxiaoyu 阅读(165) 评论(0) 推荐(0) 编辑
摘要:Cersei and Jaime has stolen n gold coins from the Casterly Rock reserves. They decided to play a game while the disappearence is not detected. The gam 阅读全文
posted @ 2019-10-14 14:49 Xxiaoyu 阅读(135) 评论(0) 推荐(0) 编辑
摘要:The day of opening of the greatest shop in the world is coming. To show the full potential of their shop, in particular, the unbelievable speed of the 阅读全文
posted @ 2019-10-14 14:19 Xxiaoyu 阅读(140) 评论(0) 推荐(0) 编辑
摘要:Pavel loves Far Manager very much. By default, Far shows files in a certain number of columns each of which holds p files. Besides, there is also a «z 阅读全文
posted @ 2019-10-14 14:17 Xxiaoyu 阅读(142) 评论(0) 推荐(0) 编辑
摘要:1 #include<bits/stdc++.h> 2 3 using namespace std; 4 5 vector<int> ve[1000005]; 6 int a[1000005]; 7 8 struct node 9 { 10 int id; 11 int num; 12 int jieguo; 13 }s[1000005]; 14 15 bool cmp(node a, node 阅读全文
posted @ 2019-10-10 15:55 Xxiaoyu 阅读(210) 评论(0) 推荐(0) 编辑
摘要:1 #include <stdio.h> 2 #include <string.h> 3 4 int main() 5 { 6 long long n, x, sum; 7 scanf("%lld", &n); 8 x = n; 9 10 sum = 0; 11 while(x>0) 12 { 13 sum = sum + (x%10) * (x%10); 14 x /= 10; 15 } 16 阅读全文
posted @ 2019-10-09 20:20 Xxiaoyu 阅读(134) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示