제출 #473224

#제출 시각아이디문제언어결과실행 시간메모리
473224Mr_PhGaraža (COCI17_garaza)C++14
0 / 160
4072 ms1100 KiB
///made by : Mr_Ph :D #include<bits/stdc++.h> #include<unordered_map> typedef long long ll; typedef long long int lli; typedef unsigned long long ull; using namespace std; const double PI=acos(-1.0); const ll mod=(ll)1e9+7; //int dx[4] = {0, 0, 1, -1}; //int dy[4] = {1, -1, 0, 0}; ///the defines :) #define endl '\n' #define vi vector<int> #define vll vector<ll> #define lower(s) transform(s.begin(),s.end(),s.begin(),::tolower) #define upper(s) transform(s.begin(),s.end(),s.begin(),::toupper) #define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i]; #define all(arr) arr.begin(),arr.end() #define allr(arr) arr.rbegin(),arr.rend() #define sz size() ///the end of the defines ;) void solve() { int n,q; cin>>n>>q; vll arr(n); ent(arr); ll y=0; int cnt=0; while(q--) { int x; cin>>x; if(x==1) { int e,w; cin>>e>>w; e--; arr[e]=w; } else { int l,r; cin>>l>>r; l--,r--; for(int i=l; i<=r; i++) { y=0; for(int k=i; k<=r; k++) { y=__gcd(y,arr[k]); if(y>1) cnt++; } } } } cout<<cnt<<endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); //freopen("window.in","r",stdin); //freopen("output.txt","w",stdout); int t=1;//int st; //cin>>t;//cin>>st; while(t--) solve(); }

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

garaza.cpp: In function 'void solve()':
garaza.cpp:18:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | #define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
      |                              ~^~~~~~~~~~~
garaza.cpp:28:5: note: in expansion of macro 'ent'
   28 |     ent(arr);
      |     ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...