Excel 真係好撚難 可以點學？ 返工返到灰
會員369號
987 回覆
290 Like
37 Dislike
第 1 頁第 2 頁第 3 頁第 4 頁第 5 頁第 6 頁第 7 頁第 8 頁第 9 頁第 10 頁第 11 頁第 12 頁第 13 頁第 14 頁第 15 頁第 16 頁第 17 頁第 18 頁第 19 頁第 20 頁第 21 頁第 22 頁第 23 頁第 24 頁第 25 頁第 26 頁第 27 頁第 28 頁第 29 頁第 30 頁第 31 頁第 32 頁第 33 頁第 34 頁第 35 頁第 36 頁第 37 頁第 38 頁第 39 頁第 40 頁
有咩唔識就即刻google,通常有埋片
我好中意用excel都用到好advance
有時試下自己砌個database出黎好有滿足感
其實逐個逐個function去學 好難有motivation
一陣我睇吓有冇現成database/table既樣板貼上黎
咁樣容易學啲
鍾意玩單條長formula多過砌dB
咩叫砌database
直接用mysql / mssql database咪得
我好中意用excel
有時試下自己砌個database出黎好有滿足感
其實逐個逐個function去學 好難有motivation
一陣我睇吓有冇現成database/table既樣板貼上黎
咁樣容易學啲
鍾意玩單條長formula多過砌dB
咩叫砌database
直接用mysql / mssql database咪得
或者用access
如果每日都要用九個字
由A到sort啲資料
再係B 到用vlookup 食Asort啲資料
VBA 係咪會幫到手？
A同B係唔同檔案
點解要sort
range_lookup 呢到用false咪得
用vlookup點解要sort
因為同一個資料可通會有幾個日期
我要sort 返今日日期
Google 大把教學⋯⋯
媽啊好柒，我發現自己都不識excel啦
我見有時 同事人手input data都會笑佢
明明有formula 可以省卻時間
求以下既情景點做
A 9 B 2 C 5 D 6
每粒字入係一個cell入面, 喺同一個Row
如果我想係第二行 一格寫 9 , 隔離嗰格look返個A出黎
(即係搵到9字既話就將佢左一格既cell read出黎)
應該點做？
用if 上面那格是9,出旁邊那格的data,else show nothing
咁如果推多一步 我想係呢個row 度 有數字嗰啲做比較 搵到最大值嗰個 再抄佢左邊個英文出黎呢？
呢啲跳column搵加埋抄其他位 呢啲最唔識
假設A1:H1就裝住 A 9 B 2 C 5 D 6
用下面呢個都搵到最大值然後抄英文嘅
INDEX(A1:H1;0;MATCH(MAX(A1:H1);A1:H1;0)-1)
巴打
但係如果 嗰啲 A B C D 轉左做數字
咁呢啲數字又有可能大過右邊個cell既數 咁咪唔準囉？
有無辦法淨係搵B1 D1 F1 咁樣隔住隔住搵？
姐係
A1 B1 C1 D1 E1 F1 G1 H1
7 11 7.5 6 8 2 12 1
咁就會搵左12 跟住抄6
有無得搵到11跟住抄7咁？
因為其實個格局係 Price , Frequency , price , frequency 咁梅花間竹
咁首先你第一Row要加返「Price」「Frequency」呢d Heading落去先
然後咁改
INDEX(A2:H2;0;MATCH(
MAX(IF(A1:H1="Frequency";A2:H2));
A2:H2;0)-1)
入完要撳ctr+shift+enter因為係array formula
如果每日都要用九個字
由A到sort啲資料
再係B 到用vlookup 食Asort啲資料
VBA 係咪會幫到手？
A同B係唔同檔案
點解要sort
range_lookup 呢到用false咪得
用vlookup點解要sort
因為同一個資料可通會有幾個日期
我要sort 返今日日期
lookup埋個日期咪得
姐係我有物件 日期同人名
個vlookup value 係物件 我要撞返個人名岀黎
平時 我係sort 完 今日日期再 copy 成個excel去新一頁 再用vlookup
如果每日都要用九個字
由A到sort啲資料
再係B 到用vlookup 食Asort啲資料
VBA 係咪會幫到手？
A同B係唔同檔案
點解要sort
range_lookup 呢到用false咪得
用vlookup點解要sort
因為同一個資料可通會有幾個日期
我要sort 返今日日期
lookup埋個日期咪得
姐係我有物件 日期同人名
個vlookup value 係物件 我要撞返個人名岀黎
平時 我係sort 完 今日日期再 copy 成個excel去新一頁 再用vlookup
好心俾作 D sample data出來, 其它人會易D俾意見.....
但係只有我睇唔明
我講砌係有好多formula同堆好多個別entry要特別處理我好中意用excel
有時試下自己砌個database出黎好有滿足感
其實逐個逐個function去學 好難有motivation
一陣我睇吓有冇現成database/table既樣板貼上黎
咁樣容易學啲
鍾意玩單條長formula多過砌dB
咩叫砌database
直接用mysql / mssql database咪得
佢話搵database黎學麻
其實我都唔知佢指緊咩db
Row/col各自有好多唔同combinations
可以每行計法都唔同或每行係dependent of 其他行
最易係用excel再用pivot table
如果每日都要用九個字
由A到sort啲資料
再係B 到用vlookup 食Asort啲資料
VBA 係咪會幫到手？
A同B係唔同檔案
點解要sort
range_lookup 呢到用false咪得
用vlookup點解要sort
因為同一個資料可通會有幾個日期
我要sort 返今日日期
lookup埋個日期咪得
姐係我有物件 日期同人名
個vlookup value 係物件 我要撞返個人名岀黎
平時 我係sort 完 今日日期再 copy 成個excel去新一頁 再用vlookup
好心俾作 D sample data出來, 其它人會易D俾意見.....
但係只有我睇唔明
定係呀文盲
如果每日都要用九個字
由A到sort啲資料
再係B 到用vlookup 食Asort啲資料
VBA 係咪會幫到手？
A同B係唔同檔案
點解要sort
range_lookup 呢到用false咪得
用vlookup點解要sort
因為同一個資料可通會有幾個日期
我要sort 返今日日期
lookup埋個日期咪得
姐係我有物件 日期同人名
個vlookup value 係物件 我要撞返個人名岀黎
平時 我係sort 完 今日日期再 copy 成個excel去新一頁 再用vlookup
聽落好似好慘咁
一齊係連登玩OK?? 但咁私下玩好自私, 我好悶.
如果每日都要用九個字
由A到sort啲資料
再係B 到用vlookup 食Asort啲資料
VBA 係咪會幫到手？
A同B係唔同檔案
點解要sort
range_lookup 呢到用false咪得
用vlookup點解要sort
因為同一個資料可通會有幾個日期
我要sort 返今日日期
lookup埋個日期咪得
姐係我有物件 日期同人名
個vlookup value 係物件 我要撞返個人名岀黎
平時 我係sort 完 今日日期再 copy 成個excel去新一頁 再用vlookup
聽落好似好慘咁
一齊係連登玩OK?? 但咁私下玩好自私, 我好悶.
google code jam 岩唔岩玩？
咁我又未去到呢個level, 個D係神人玩~
如果每日都要用九個字
由A到sort啲資料
再係B 到用vlookup 食Asort啲資料
VBA 係咪會幫到手？
A同B係唔同檔案
點解要sort
range_lookup 呢到用false咪得
用vlookup點解要sort
因為同一個資料可通會有幾個日期
我要sort 返今日日期
lookup埋個日期咪得
姐係我有物件 日期同人名
個vlookup value 係物件 我要撞返個人名岀黎
平時 我係sort 完 今日日期再 copy 成個excel去新一頁 再用vlookup
好心俾作 D sample data出來, 其它人會易D俾意見.....
但係只有我睇唔明
唔該哂巴打
我都係google 下再上黎問
Google Code Jam 2017
Qualification Round:
================
Problem:
Last year, the Infinite House of Pancakes introduced a new kind of pancake. It has a happy face made of chocolate chips on one side (the "happy side"), and nothing on the other side (the "blank side").
You are the head cook on duty. The pancakes are cooked in a single row over a hot surface. As part of its infinite efforts to maximize efficiency, the House has recently given you an oversized pancake flipper that flips exactly K consecutive pancakes. That is, in that range of K pancakes, it changes every happy-side pancake to a blank-side pancake, and vice versa; it does not change the left-to-right order of those pancakes.
You cannot flip fewer than K pancakes at a time with the flipper, even at the ends of the row (since there are raised borders on both sides of the cooking surface). For example, you can flip the first K pancakes, but not the first K - 1 pancakes.
Your apprentice cook, who is still learning the job, just used the old-fashioned single-pancake flipper to flip some individual pancakes and then ran to the restroom with it, right before the time when customers come to visit the kitchen. You only have the oversized pancake flipper left, and you need to use it quickly to leave all the cooking pancakes happy side up, so that the customers leave feeling happy with their visit.
Given the current state of the pancakes, calculate the minimum number of uses of the oversized pancake flipper needed to leave all pancakes happy side up, or state that there is no way to do it.
Input
The first line of the input gives the number of test cases, T. T test cases follow. Each consists of one line with a string S and an integer K. S represents the row of pancakes: each of its characters is either + (which represents a pancake that is initially happy side up) or - (which represents a pancake that is initially blank side up).
Output
For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is either IMPOSSIBLE if there is no way to get all the pancakes happy side up, or an integer representing the the minimum number of times you will need to use the oversized pancake flipper to do it.
Limits
1 ≤ T ≤ 100.
Every character in S is either + or -.
2 ≤ K ≤ length of S.
Small dataset
2 ≤ length of S ≤ 10.
Large dataset
2 ≤ length of S ≤ 1000.
Sample
Input
3
---+-++- 3
+++++ 4
-+-+- 4
Output
Case #1: 3
Case #2: 0
Case #3: IMPOSSIBLE
In Case #1, you can get all the pancakes happy side up by first flipping the leftmost 3 pancakes, getting to ++++-++-, then the rightmost 3, getting to ++++---+, and finally the 3 pancakes that remain blank side up. There are other ways to do it with 3 flips or more, but none with fewer than 3 flips.
In Case #2, all of the pancakes are already happy side up, so there is no need to flip any of them.
In Case #3, there is no way to make the second and third pancakes from the left have the same side up, because any flip flips them both. Therefore, there is no way to make all of the pancakes happy side up.
Qualification Round:
================
Problem:
Last year, the Infinite House of Pancakes introduced a new kind of pancake. It has a happy face made of chocolate chips on one side (the "happy side"), and nothing on the other side (the "blank side").
You are the head cook on duty. The pancakes are cooked in a single row over a hot surface. As part of its infinite efforts to maximize efficiency, the House has recently given you an oversized pancake flipper that flips exactly K consecutive pancakes. That is, in that range of K pancakes, it changes every happy-side pancake to a blank-side pancake, and vice versa; it does not change the left-to-right order of those pancakes.
You cannot flip fewer than K pancakes at a time with the flipper, even at the ends of the row (since there are raised borders on both sides of the cooking surface). For example, you can flip the first K pancakes, but not the first K - 1 pancakes.
Your apprentice cook, who is still learning the job, just used the old-fashioned single-pancake flipper to flip some individual pancakes and then ran to the restroom with it, right before the time when customers come to visit the kitchen. You only have the oversized pancake flipper left, and you need to use it quickly to leave all the cooking pancakes happy side up, so that the customers leave feeling happy with their visit.
Given the current state of the pancakes, calculate the minimum number of uses of the oversized pancake flipper needed to leave all pancakes happy side up, or state that there is no way to do it.
Input
The first line of the input gives the number of test cases, T. T test cases follow. Each consists of one line with a string S and an integer K. S represents the row of pancakes: each of its characters is either + (which represents a pancake that is initially happy side up) or - (which represents a pancake that is initially blank side up).
Output
For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is either IMPOSSIBLE if there is no way to get all the pancakes happy side up, or an integer representing the the minimum number of times you will need to use the oversized pancake flipper to do it.
Limits
1 ≤ T ≤ 100.
Every character in S is either + or -.
2 ≤ K ≤ length of S.
Small dataset
2 ≤ length of S ≤ 10.
Large dataset
2 ≤ length of S ≤ 1000.
Sample
Input
3
---+-++- 3
+++++ 4
-+-+- 4
Output
Case #1: 3
Case #2: 0
Case #3: IMPOSSIBLE
In Case #1, you can get all the pancakes happy side up by first flipping the leftmost 3 pancakes, getting to ++++-++-, then the rightmost 3, getting to ++++---+, and finally the 3 pancakes that remain blank side up. There are other ways to do it with 3 flips or more, but none with fewer than 3 flips.
In Case #2, all of the pancakes are already happy side up, so there is no need to flip any of them.
In Case #3, there is no way to make the second and third pancakes from the left have the same side up, because any flip flips them both. Therefore, there is no way to make all of the pancakes happy side up.
如果每日都要用九個字
由A到sort啲資料
再係B 到用vlookup 食Asort啲資料
VBA 係咪會幫到手？
A同B係唔同檔案
點解要sort
range_lookup 呢到用false咪得
用vlookup點解要sort
因為同一個資料可通會有幾個日期
我要sort 返今日日期
lookup埋個日期咪得
姐係我有物件 日期同人名
個vlookup value 係物件 我要撞返個人名岀黎
平時 我係sort 完 今日日期再 copy 成個excel去新一頁 再用vlookup
聽落好似好慘咁
一齊係連登玩OK?? 但咁私下玩好自私, 我好悶.
google code jam 岩唔岩玩？
咁我又未去到呢個level, 個D係神人玩~
有d 可以用純formula做到
(上年qualification round交左個xlsx上去
Post 左 2017 qualification round 出來, 睇題目都睇左10分鐘~
夠竟連登仔有無人過到2017 Qualification round 呢?
---+-++-
++++-++-
+++++---
++++++++
騎劫正式開始!!!
---+-++-
++++-++-
+++++---
++++++++
騎劫正式開始!!!