Cod sursa(job #3314678)
| Utilizator | Data | 10 octombrie 2025 17:44:32 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.29 kb |
#include <fstream>
using namespace std; int sp[500001],fr[100001]; int main(){ifstream f("divk.in"); ofstream o("divk.out"); int n,k,a,b,x; f>>n>>k>>a>>b; int64_t r=0,i; for( i=1;i<=n;i++){f>>x; sp[i]=(sp[i-1]+x)%k; if(i-a>=0)++fr[sp[i-a]]; if(i-b-1>=0)--fr[sp[i-b-1]]; r+=fr[sp[i]];} o<<r;}
