codeforces New Year Transportation
題意
有一個交通運輸體系,非常簡單的體系。共有N個地點,這n-1個網站的值代表能從前一個地點載乘客到下a[i]個地點。判斷t 是否能到達。
思路
第一時間想到的是模擬一遍,應該沒啥好說的。
code
#include<stdio.h> int line[30005]; int Find(int t,int n) { int w; w=n+line[n]; if(t<w) { return -1; } else if(t>w) { Find(t,w); } else return 1; } int main() { int n; int t; while(scanf("%d%d",&n,&t)!=EOF) { for(int i=1;i<n;i++) scanf("%d",&line[i]); if(Find(t,1)==1) printf("YES\n"); else printf("NO\n"); } return 0; }
相關推薦
codeforces New Year Transportation
題意 有一個交通運輸體系,非常簡單的體系。共有N個地點,這n-1個網站的值代表能從前一個地點載乘客到下a[i]個地點。判斷t 是否能到達。 思路 第一時間想到的是模擬一遍,應該沒啥好說的。 code #include<stdio.h> int line[30005]
S - New Year Transportation
size esc ear lower see rom sys rip user Problem description New Year is coming in Line World! In this world, there are n cells numbered b
Codeforces 611D.New Year and Ancient Prophecy (dp + lcp)
ack com names getchar turn 一個數 長度 getc targe 題目鏈接: http://codeforces.com/problemset/problem/611/D 題意: 長為n的只有數字組成的字符串(n<=5000),問能分割成多少組
Codeforces Round #100 E. New Year Garland (第二類斯特林數+dp)
using 情況 inline 顏色不同 force jai 相同 其中 problem 題目鏈接: http://codeforces.com/problemset/problem/140/E 題意: 聖誕樹上掛彩球,要求從上到下掛\(n\)層彩球。已知有\(m\)種顏色
[Codeforces 750E]New Year and Old Subsequence
ons lin def aws swa rip 我們 can space Description 題庫鏈接 給出一個長度為 \(n\) 的僅包含數字的字符串。 \(q\) 次詢問,每次詢問該串 \([a,b]\) 段內刪去幾個數能夠使其不含 \(2016\) 的子串,但存在
Codeforces 908 D New Year and Arbitrary Arrangement
ble other have span pri res ould com rmi Discription You are given three integers k, pa and pb. You will construct a sequence with the fo
Codeforces 908D New Year and Arbitrary Arrangement(概率DP,邊界條件處理)
sin color 一個 pan ++ urn fin [1] bsp 題目鏈接 Goodbye 2017 Problem D 題意 一個字符串開始,每次有$\frac{pa}{pa+pb}$的概率在後面加一個a,$\frac{pb}{pa+pb}$的概率在後面加一個
Codeforces 379 F. New Year Tree
數組 urn names its break amp 復雜 emp void \(>Codeforces \space 379 F. New Year Tree<\) 題目大意 : 有一棵有 \(4\) 個節點個樹,有連邊 \((1,2) (1,3) (1,
Codeforces 620E New Year Tree
LINK 題目大意 給你一棵樹 讓你支援子樹染色,子樹查詢顏色個數,顏色數<=60, 節點數<=4e5 思路 因為顏色數很少,考慮狀態壓縮變成二進位制 然後直接在dfs序上用線段樹維護就可以了 //Author: dream_maker #include<bits/s
codeforces 750A New Year and Hurry
題目描述: Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, e
【Codeforces-140C】New Year Snowmen(貪心+優先佇列、二分)
As meticulous Gerald sets the table and caring Alexander sends the postcards, Sergey makes snowmen. Each showman should consist of three snowballs:
New Year Snowmen codeforces 140C
題目 As meticulous Gerald sets the table and caring Alexander sends the postcards, Sergey makes snowmen. Each showman should consist of three s
【CodeForces - 140C】New Year Snowmen (貪心)
題幹: As meticulous Gerald sets the table and caring Alexander sends the postcards, Sergey makes snowmen. Each showman should consist of three snowb
CodeForces - 500B New Year Permutation floyd+選擇排序
User ainta has a permutation p1, p2, ..., pn. As the New Year is coming, he wants to make his permutation as pretty as possible. Permutation&nb
CodeForces - 500D New Year Santa Network 樹形dp 記憶化 求期望
New Year is coming in Tree World! In this world, as the name implies, there are ncities connected by n - 1 roads, and for any two disti
Codeforces-Good Bye 2017 B. New Year and Buggy Bot(模擬)
Describe Bob programmed a robot to navigate through a 2d maze. The maze has some obstacles.
codeforces 908A new year and counting cards
這題看著真TM嚇人,其實很假 只要讀懂題,都會做 題意: 如果一個字元是母音字母,則它對應的數字必為0,2,4,6,8(偶數)中的一個,否則為false。就是如果是母音字母,則要判斷,如果是奇數也要判斷(因為如果它的對應字元為母音,那麼則為false)如果是偶數或非子音字母則不用判斷。要保證
Codeforces 1091D New Year and the Permutation Concatenation 找規律,數學 B
Codeforces 1091D New Year and the Permutation Concatenation https://codeforces.com/contest/1091/problem/D 題目: Let n be an integer. C
Codeforces Good Bye 2018 D (1091D) New Year and the Permutation Concatenation
題意:給n!個n的排列,按字典序從小到大連成一條序列,例如3的情況為:[1,2,3, 1,3,2, 2,1,3 ,2,3,1 ,3,1,2 ,3,2,1],問其中長度為n,且和為sum=n*(n+1)/2的序列有多少個? 思路(官方題解):我們考慮一下nex
codeforces goodbye 2018 C. New Year and the Sphere Transmission D. New Year and the Permutation Concatenation
這兩題都是打表找的規律,C題發現具有相同最大因子的數字所走的點是一樣的,D題發現排列數和開頭有幾個相同的數字有關,所以用排列數公式算出有幾個這樣的開頭再乘上這種開頭的種類數就可以了 C題 #include<bits/stdc++.h> using namespace std; typed