| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 936760 |
2024-03-02T16:54:12 Z |
Habiba |
Trol (COCI19_trol) |
C++17 |
|
1 ms |
512 KB |
#include <bits/stdc++.h>
#define HABIBA ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0);
#define PP push_back
#define LL long long
#define F first
#define S second
#define lp int Q; cin >>Q; while (Q--)
#define inp for(LL i=0; i<n;i++){cin >>a[i];}
#define sorting sort (a,a+n);
#define outp for (LL I=0; I<N;I++) {cout <<ARRAY[I]<<"\n";}
#define cout(X) for(auto V:X)cout<<V<<"\n";
#define coutp(X) for(auto V:X)cout<<V.F<<' '<<V.S<<'\n';
#define cin(X) for(auto &V:X)cin>>V;
#define pb(X) push_back(X);
#define all(X) X.begin(),X.end()
#define OR or
#define AND and
const LL MOD = 1e9 + 7;
const LL N = 1e5 + 7;
using namespace std;
int main() {
HABIBA
lp{
int a,b; cin >>a>>b;
cout <<((b*(b+1))/2)-((a*(a+1))/2)<<"\n";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
512 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
