neuike的博客

C. Pearls in a Row time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output There are n pearls in a row. Let's enume

我真是不知道为什么有人会想到并查集。。 大水题一个，直接遍历一下就好啦。 需要注意的是输出，每人对应一个ID号，为5位数字 即就是ID为1，输出为00001，而不是1#include<cstdio> #include<cstring> #include<vector> using namespace std;int vis[1000000]; int main() { int n;

简单数学题#include<cstdio> #include<cmath> #include<algorithm> #include<cstring> using namespace std;int n;int main() { while(scanf("%d",&n)!=EOF) { if(n==0) break; int a

模拟。 注意模拟的方法，记录235分别上一次乘的数字。直接暴力会超时。#include<cstdio> #include<cmath> #include<algorithm> #include<cstring> using namespace std; int a[2000]; int n;bool ok(int x) { int flag=1; while(flag) {

Hopscotch Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3284 Accepted: 2271 DescriptionThe cows play the child’s game of hopscotch in a non-traditional way. Instead of a linear

Backward Digit Sums Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6223 Accepted: 3602 DescriptionFJ and his cows enjoy playing a mental game. They write down the numbers from 1

ZOJ_1122: Clock Time Limit: 2000 MS  Memory Limit: 64 MB   64bit IO Format: %lld Submitted: 1  Accepted: 1 [Submit][Status][Web Board] Description You are given a standard 12-hour clock wi

ZOJ_1151: Word Reversal Time Limit: 2000 MS  Memory Limit: 64 MB   64bit IO Format: %lld [Submit][Status][Web Board] Description For each list of words, output a line with each word rever

ZOJ_1139: Rectangles Time Limit: 10000 MS  Memory Limit: 32 MB   64bit IO Format: %lld [Submit][Status][Web Board] Description specialist in VLSI design testing must decide if there are s

Ivan and Powers of Two Time Limit:500MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u Submit Status Description Ivan has got an array of n non-negative integers a1, a2, ...

1268: 火柴棒 Time Limit: 1 Sec  Memory Limit: 128 MB   64bit IO Format: %lld Submitted: 43  Accepted: 21 [Submit][Status][Web Board] Description 用n根火柴，拼成一个a+b=c的等式，’+’和’=’各占两根火柴，每个数字占固定的火柴，

直接搜索因子。注意题干要求因子的乘积不大于n。输出最小的乘积的因子，即 如果没有连续的因数，那么输出最小的那个因数。代码#include<cstdio> #include<cstring> #include<iostream> #include<cmath> #include<map> #include<string> #include<algorithm> using namespace std;