Submission #921598

#TimeUsernameProblemLanguageResultExecution timeMemory
921598vjudge1Lightning Rod (NOI18_lightningrod)C++17
4 / 100
1 ms348 KiB
#include <bits/stdc++.h> #define F first #define S second #define ent '\n' #define int long long #define pb push_back typedef long double ld; typedef long long ll; using namespace std; const int maxn = 1e6+12; const int T = 0; const int mod = 1e9+7; int n,m,k,x,y,l,r; int a[maxn],b[maxn],p[maxn],pref[maxn],fact[maxn]; void solve(){ cin>>n; cout<<n; } //BEKSULTAN TOP signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t=1; if(T)cin>>t; while(t--)solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...