제출 #1008056

#제출 시각아이디문제언어결과실행 시간메모리
1008056kaysanFancy Fence (CEOI20_fancyfence)C++17
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #define ll long long #define pb push_back #define pp pop_back #define fi first #define se second #define lb lower_bound #define ub upper_bound #define pll pair<ll,ll> #define pii pair<int,int> #define vl vector<ll> #define nikah ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); const ll maxn = 1e5+7, modn1 = 1e9+7, modn2 = 998244353; using namespace std; // kalo kamu ngga emas nanti nadya merasa bersalah, ayo san demi nadya!!! // Kalo emang soalnya susah, pindah soal dulu // Jangan sampe diem, pikirin sesuatu, pasti bisa!!! // Cobain semua approach, jangan ngestuck di satu pemikiran // Jangan overthinking, jangan panik, tenangin pikiranmu ll t,n; ll h[maxn], w[maxn]; ll f (ll x) { ll ret = 1; ret = ((x * (x+1)) / 2) % modn1; return ret; } void solve () { cin>>n; for (ll i=1; i<=n; i++) { cin>>h[i]; } ll sum = 0; for (ll i=1; i<=n; i++) { cin>>w[i]; sum += w[i]; } /*for (ll i=1; i<=n; i++) { if (h[i] == 2) { cnt+=w[i]; } else { ans += (cnt * (cnt + 1)) % modn1; cnt = 0; } } ans += (cnt * (cnt + 1)) % modn1;*/ ans = (f(sum) * f(h[1])) % modn1; cout<<ans<<endl; } int main () { nikah t = 1; // cin>>t; while (t--) { solve(); // cout<<endl; } }

컴파일 시 표준 에러 (stderr) 메시지

fancyfence.cpp: In function 'void solve()':
fancyfence.cpp:51:2: error: 'ans' was not declared in this scope; did you mean 'abs'?
   51 |  ans = (f(sum) * f(h[1])) % modn1;
      |  ^~~
      |  abs