Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define pb push_back
- #define fo(n) for(int i=0;i<n;i++)
- #define fos(o,n) for(int i=o;i<=n;i++)
- int Pow(long long x, int n, long long mod) {
- long long Ans = 1, t = x;
- while(n) {
- if(n&1)
- Ans *= t, Ans %= mod;
- t *= t, t %= mod, n >>= 1;
- }
- return (int)Ans;
- }
- int isPrime(int n) {
- if(n == 2 || n == 3) return 1;
- if(n == 1) return 0;
- if(!(n & 1)) return 0;
- int a, x, flag = 1, t;
- for(a = 0; a < 2; a++) {
- x = rand() % (n - 4) + 2;
- t = Pow( x , n-1 , n );
- if(t != 1) return 0;
- }
- return 1;
- }
- vector<int> p;
- map<int,bool> mp;
- void build(){
- p.pb(1);
- p.pb(2);
- p.pb(3);
- p.pb(5);
- p.pb(7);
- mp[2] = 1;
- mp[3] = 1;
- mp[5] = 1;
- mp[7] = 1;
- int pri = 7;
- for( int i = 4 ; pri < 100 ; i = 6 - i ){
- pri += i;
- if( isPrime( pri ) ) p.pb(pri) , mp[pri] = 1;
- }
- }
- int main(){
- build();
- int T;
- cin >> T;
- while( T-- ){
- int a , b , ans = 0;
- cin >> a >> b;
- fos( a , b ){
- if( i % 2 == 0 ) continue;
- if( (i&1) && !isPrime(i) ) ans += i;
- }
- cout << ans << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement