Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include <vector> #include <cstring> #include <algorithm> using namespace std; int n; int m; int dp[100005]; vector<int>graph[100005]; int rec(int node){ int result=0; if(node==n){ return 1; } if(dp[node]!=-1){ return dp[node]; } int MOD = 1e9 + 7; for(int i=0; i<graph[node].size(); i++){ int sosed=graph[node][i]; result+=rec(sosed); result %= MOD; } return dp[node]=result; } int main() { cin>>n>>m; for(int i=0; i<m; i++){ int a, b; cin>>a>>b; graph[a].push_back(b); } memset(dp, -1, sizeof dp); cout<<rec(1); return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
