submission_id,user_id,create_at,language,score,problem_set_problem_id,problem_id,skill_id,code,response,time_consume,memory_consume
1370984537806790656,2a218d1f332cf0ce7d74fac8feecee5eabf01c3ed0029334c70e03dc666d04d6,2021-03-14 14:26:00,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace 蓝桥杯天梯赛\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int zongshu = Convert.ToInt32(Console.ReadLine());\n            int[] kuang = new int[zongshu+1];\n            string[] s = Console.ReadLine().Split(' ');\n            for (int i = 1; i <= zongshu  ; i++)\n            {\n                kuang[i] = Convert.ToInt32(s[i-1]);\n            }\n            int maifa = Convert.ToInt32(Console.ReadLine());\n            int[] jiage = new int[maifa];\n            for (int i = 0; i < maifa ; i++)\n            {\n                string ss = Console.ReadLine();\n                int a, b;string[] s1 = ss.Split(' ');\n                a = Convert.ToInt32(s1[0]);b = Convert.ToInt32(s1[1]);\n                jiage[i] = 1;\n                for (int j = a; j <= b; j++)\n                {\n                    jiage[i] *= kuang[j];\n                }\n            }\n            for (int i = 0; i < maifa ; i++)\n            {\n                Console.WriteLine(jiage[i]);\n            }\n            Console.ReadKey();\n        }\n    }\n\n}\n",TIME_LIMIT_EXCEEDED,62,3640
1370984988501532672,c71ec6d78a24325b78ed72075b29bcc47d5c19c82eb38182c9dd81a1de2eac68,2021-03-14 14:27:47,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint ans=1;\nint a[100005];\nint main(){\n\tint n;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t}\n\tint m;\n\tcin>>m;\n\tint l,r;\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>l>>r;\n\t\tans=1;\n\t\tfor(int j=l;j<=r;j++){\n\t\t\tans*=a[j];\n\t\t\tans%=1000000007;\n\t\t\tif(ans==0) ans=1;\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,8,424
1370985756805844992,c71ec6d78a24325b78ed72075b29bcc47d5c19c82eb38182c9dd81a1de2eac68,2021-03-14 14:30:50,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint ans=1;\nint a[100005];\nint sum[100005];\nint main(){\n\tint n;\n\tcin>>n;\n\tsum[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t\tsum[i]=sum[i-1]*a[i];\n\t\tsum[i]%=1000000007;\n\t}\n\tint m;\n\tcin>>m;\n\tint l,r;\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>l>>r;\n\t\tcout<<sum[r]/sum[l-1]<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,239,1344
1370986052223258624,c118514b9494c219ce92d2176fb3e7a2095835e5de0066e8d43db71c7f5bc672,2021-03-14 14:32:01,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a;\n\tcin>>a;\n\tint b[100055];\n\tfor(int i=1;i<=a;i++)\n\t{\n\t\tcin>>b[i];\n\t}\n\tint c;\n\tcin>>c;\n\tfor(int i=1;i<=c;i++)\n\t{\n\t\tint long long  d,e,num=1;\n\t\tcin>>d>>e;\n\t\tfor(int j=d;j<=e;j++)\n\t\t{\n\t\t\tnum=(num*b[j])%1000000007;\n            \n\t\t}\n\t\tcout<<num<<endl;\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,5,308
1370986193525166080,2a218d1f332cf0ce7d74fac8feecee5eabf01c3ed0029334c70e03dc666d04d6,2021-03-14 14:32:34,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace lanqiaobei\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int zongshu = Convert.ToInt32(Console.ReadLine());\n            int[] kuang = new int[zongshu+1];\n            string[] s = Console.ReadLine().Split(' ');\n            for (int i = 1; i <= zongshu  ; i++)\n            {\n                kuang[i] = Convert.ToInt32(s[i-1]);\n            }\n            int maifa = Convert.ToInt32(Console.ReadLine());\n            int[] jiage = new int[maifa];\n            for (int i = 0; i < maifa ; i++)\n            {\n                int a, b;string[] s1 = Console.ReadLine().Split(' ');\n                a = Convert.ToInt32(s1[0]);b = Convert.ToInt32(s1[1]);\n                jiage[i] = 1;\n                for (int j = a; j <= b; j++)\n                {\n                    jiage[i] *= kuang[j];\n                }\n            }\n            for (int i = 0; i < maifa ; i++)\n            {\n                Console.WriteLine(jiage[i]);\n            }\n        }\n    }\n\n}\n",TIME_LIMIT_EXCEEDED,28,3744
1370986414703398912,c118514b9494c219ce92d2176fb3e7a2095835e5de0066e8d43db71c7f5bc672,2021-03-14 14:33:27,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint a;\n\tcin>>a;\n\tint b[100050];\n\tfor(int i=1;i<=a;i++)\n\t{\n\t\tcin>>b[i];\n\t}\n\tint c;\n\tcin>>c;\n\tfor(int i=1;i<=c;i++)\n\t{\n\t\tint long long  d,e,num=1;\n\t\tcin>>d>>e;\n\t\tfor(int j=d;j<=e;j++)\n\t\t{\n\t\t\tnum=(num*b[j])%1000000007;\n            \n\t\t}\n\t\tcout<<num<<endl;\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,4,316
1370986492922974208,c118514b9494c219ce92d2176fb3e7a2095835e5de0066e8d43db71c7f5bc672,2021-03-14 14:33:46,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nint b[100050];\nint main()\n{\n\tint a;\n\tcin>>a;\n\t\n\tfor(int i=1;i<=a;i++)\n\t{\n\t\tcin>>b[i];\n\t}\n\tint c;\n\tcin>>c;\n\tfor(int i=1;i<=c;i++)\n\t{\n\t\tint long long  d,e,num=1;\n\t\tcin>>d>>e;\n\t\tfor(int j=d;j<=e;j++)\n\t\t{\n\t\t\tnum=(num*b[j])%1000000007;\n            \n\t\t}\n\t\tcout<<num<<endl;\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,4,452
1370986571599634432,c118514b9494c219ce92d2176fb3e7a2095835e5de0066e8d43db71c7f5bc672,2021-03-14 14:34:04,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\nusing namespace std;\nint b[100050];\nint main()\n{\n\tint a;\n\tcin>>a;\n\t\n\tfor(int i=1;i<=a;i++)\n\t{\n\t\tcin>>b[i];\n\t}\n\tint c;\n\tcin>>c;\n\tfor(int i=1;i<=c;i++)\n\t{\n\t\tint long long  d,e,num=1;\n\t\tcin>>d>>e;\n\t\tfor(int j=d;j<=e;j++)\n\t\t{\n\t\t\tnum=(num*b[j])%1000000007;\n            \n\t\t}\n\t\tcout<<num<<endl;\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,9,436
1370986656450404352,c71ec6d78a24325b78ed72075b29bcc47d5c19c82eb38182c9dd81a1de2eac68,2021-03-14 14:34:25,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint ans=1;\nint a[100005];\nunsigned long long sum[100005];\nint main(){\n\tint n;\n\tcin>>n;\n\tsum[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t\tsum[i]=sum[i-1]*a[i];\n\t}\n\tint m;\n\tcin>>m;\n\tint l,r;\n\tfor(int i=1;i<=n;i++){\n\t\tcout<<sum[i]<<\"" \"";\n\t}\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>l>>r;\n\t\tcout<<(sum[r]/sum[l-1])%1000000007<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,376
1370987069220249600,5e93ea64db0357ac1ced483b2116694ac3482f73e8a1c15b72b4fdba5b747fbe,2021-03-14 14:36:03,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n  int a, b, c, d, e;\n  cin >> a;\n  int array[100];\n  for(int i=0;i<a;i++)\n  {\n      cin>>array[i];\n  }\n  cout<< 120<<endl;\n  cout<< 24 << endl;\n  \n  \n  \n\n\n\n  return 0;\n}",WRONG_ANSWER,5,436
1370987284757143552,c118514b9494c219ce92d2176fb3e7a2095835e5de0066e8d43db71c7f5bc672,2021-03-14 14:36:55,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\nusing namespace std;\nint b[100050];\nint main()\n{\n\tint a;\n\tcin>>a;\n\t\n\tfor(int i=1;i<=a;i++)\n\t{\n\t\tcin>>b[i];\n\t}\n\tint c;\n\tcin>>c;\n\tfor(int i=1;i<=c;i++)\n\t{\n\t\tint long long  d,e,num=1;\n\t\tcin>>d>>e;\n\t\tfor(int j=d;j<=e;j++)\n\t\t{\n\t\t\tnum=(num*b[j])%1000000007;\n            \n\t\t}\n\t\tcout<<num<<endl;\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,4,600
1370987708511870976,e5fd69e644b3d48ae051efca395aae6e74522626fccc66b8b2d023d530057b48,2021-03-14 14:38:36,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<bits/stdc++.h>\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\nusing namespace std;\nint main(int argc, char** argv) {\n  int n;cin>>n;\n  for(int i=0;i<n;i++)\n   {\n   \tint a;cin>>a;\n   }\n   int Q;cin>>Q;\n   int daan[Q][2];\n   for(int i=0;i<Q;i++)\n   {\n   \tfor(int j=0;j<2;j++)\n   \t{\n   \t\tcin>>daan[i][j];\n   \t}\n   }\n   for(int i=0;i<Q;i++)\n   {\n   \t  unsigned long long sum=1;\n   \t  for(int j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum<<endl;\n   }\n}",WRONG_ANSWER,14,316
1370987843119763456,ecf2fd58bcc17797e309b456075638cec843b7f8a94819430ec127b480f7f95d,2021-03-14 14:39:08,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nconst int mod=1e9+7;\nint a[100001];\nlong long b[100001];\nint main()\n{\n\tb[0]=1;\n\tint n,q;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tcin>>a[i];\n\t\tb[i]=a[i];\n\t\tb[i]*=b[i-1];\n\t\tb[i]=b[i]%mod;\n\t}\n\tcin>>q;\n\tfor(int i=1;i<=q;i++)\n\t{\n\t\tint c,d;\n\t\tcin>>c>>d;\n\t\tcout<<b[d]/b[c-1]<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,255,1728
1370988052528779264,a4a5d1d401d6103c6ddbc030ec62a7038dca05e4e4c9517500b0a549f4f5d4d5,2021-03-14 14:39:58,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace _7_4_Rurirat给fffteam买橘子\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] ai = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q = int.Parse(Console.ReadLine());\n            string[] str = new string[Q];\n            for(int i=0;i<Q;i++)\n            {\n                str[i] = Console.ReadLine();\n            }\n            for (int i = 0; i < Q; i++)\n            {\n                int[] t = Array.ConvertAll(str[i].Split(' '), int.Parse);\n                int L = t[0], R = t[1];\n                int m = 1;\n                for(int j=L-1;j<R;j++)\n                {\n                    m *= ai[j];\n                }\n                Console.WriteLine(m % (Math.Pow(10, 9) + 7));\n            }\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,48,3464
1370988242522267648,a4a5d1d401d6103c6ddbc030ec62a7038dca05e4e4c9517500b0a549f4f5d4d5,2021-03-14 14:40:43,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace _7_4_Rurirat给fffteam买橘子\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] ai = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q = int.Parse(Console.ReadLine());\n            string[] str = new string[Q];\n            for(int i=0;i<Q;i++)\n            {\n                str[i] = Console.ReadLine();\n            }\n            for (int i = 0; i < Q; i++)\n            {\n                int[] t = Array.ConvertAll(str[i].Split(' '), int.Parse);\n                int L = t[0], R = t[1];\n                int m = 1;\n                for(int j=L-1;j<R;j++)\n                {\n                    m *= ai[j];\n                }\n                Console.WriteLine(m % (Math.Pow(10, 9) + 7));\n            }\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,39,3576
1370988305537585152,e5fd69e644b3d48ae051efca395aae6e74522626fccc66b8b2d023d530057b48,2021-03-14 14:40:58,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<bits/stdc++.h>\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\nusing namespace std;\nint main(int argc, char** argv) {\n  int n;cin>>n;\n  for(int i=0;i<n;i++)\n   {\n   \tint a;cin>>a;\n   }\n   int Q;cin>>Q;\n   int daan[Q][2];\n   for(int i=0;i<Q;i++)\n   {\n   \tfor(int j=0;j<2;j++)\n   \t{\n   \t\tcin>>daan[i][j];\n   \t}\n   }\n   for(int i=0;i<Q;i++)\n   {\n   \t if(i<Q-1)\n   \t  {\n   \t  unsigned long long sum=1;\n   \t  for(int j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum<<endl;\n     }\n     else\n     {\n     \t unsigned long long sum=1;\n   \t  for(int j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum;\n     }\n     \n   }\n}",WRONG_ANSWER,6,432
1370988462786236416,302ae5737edb7c44c6eacd636612e9e544276a6e18651a8536b48aae19ba28ef,2021-03-14 14:41:35,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<string> \nusing namespace std;\nconst int maxn =100007;\nconst int yu=1000000007;\nint price[maxn];\nint sum[maxn];\nint main()\n{\n\tint n,q,l,r;\n\tcin>>n;\n\tlong long ts;\n\tfor(int i=1;i<=n;i++)\n\t\tcin>>price[i];\n\tcin>>q;\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tcin>>l>>r;\n\t\tts=1;\n\t\tfor(int j=l;j<=r;j++)\n\t\t{\n\t\t\tif(ts==0)\n\t\t\t\tts=1;\n\t\t\tts*=price[j];\n\t\t\tif(ts>=yu)\n\t\t\t\tts%=yu;\n\t\t}\n\t\tsum[i]=ts;\n\t}\n\tfor(int i=0;i<q;i++)\n\t\tcout<<sum[i]<<endl;\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,11,320
1370988504653778944,2a218d1f332cf0ce7d74fac8feecee5eabf01c3ed0029334c70e03dc666d04d6,2021-03-14 14:41:45,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace lanqiaobei\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int zongshu = Convert.ToInt32(Console.ReadLine());\n            int[] kuang = new int[zongshu+1];\n            string[] s = Console.ReadLine().Split(' ');\n            for (int i = 1; i <= zongshu  ; i++)\n            {\n                kuang[i] = Convert.ToInt32(s[i-1]);\n            }\n            int maifa = Convert.ToInt32(Console.ReadLine());\n            int[] jiage = new int[maifa];\n            for (int i = 0; i < maifa ; i++)\n            {\n                int a, b;string[] s1 = Console.ReadLine().Split(' ');\n                a = Convert.ToInt32(s1[0]);b = Convert.ToInt32(s1[1]);\n                jiage[i] = 1;\n                for (int j = a; j <= b; j++)\n                {\n                    jiage[i] *= kuang[j];\n                }\n            }\n            for (int i = 0; i < maifa ; i++)\n            {\n                Console.WriteLine(jiage[i]);\n            }\n        }\n    }\n\n}\n",TIME_LIMIT_EXCEEDED,44,3500
1370988599025524736,ecf2fd58bcc17797e309b456075638cec843b7f8a94819430ec127b480f7f95d,2021-03-14 14:42:08,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nconst int mod=1e9+7;\nint a[100001];\nlong long b[100001];\nint main()\n{\n\tb[0]=1;\n\tint n,q;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tcin>>a[i];\n\t\tb[i]=a[i];\n\t\tb[i]*=b[i-1];\n\t\tb[i]=b[i]%mod;\n\t}\n\tcin>>q;\n\tfor(int i=1;i<q;i++)\n\t{\n\t\tint c,d;\n\t\tcin>>c>>d;\n\t\tcout<<b[d]/b[c-1]<<endl;\n\t}\n\tint c,d;\n\tcin>>c>>d;\n\tcout<<b[d]/b[c-1];\n\treturn 0;\n}",WRONG_ANSWER,261,1812
1370989114933399552,981fcea4af5b388931133b5df074af3636635b2ab46b3668f45141b7faa52f82,2021-03-14 14:44:11,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include <cmath>\n#include <queue>\n#include <deque>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <unordered_map>\n#include <sstream>\n#include <bitset>\n#include <unordered_set>\n#include <set>\n#include <stdio.h>\n#include <complex>\n#include <numeric>\n#include <functional>\nusing namespace std;\n\nint count(long long  temp)\n{\n\tint count = 0;\n\twhile (temp != 0)\n\t{\n\t\ttemp /= 10;\n\t\tcount++;\n\t}\n\treturn count;\n}\nint main()\n{\n\tlong long mod = 1e+9;\n\tint n; cin >> n;\n\tvector<int> re(n,0);\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> re[i];\n\t}\n\tint q; cin >> q;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tint a, b; cin >> a >> b;\n\t\ta -= 1; b -= 1;\n\t\tint c=1;\n\t\tfor (int i = a; i <= b; i++)\n\t\t{\n\t\t\tc *= re[i];\n\t\t\tc %= mod;\n\t\t}\n\t\tcout << c << endl;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",COMPILE_ERROR,0,0
1370989161045577728,1568a21a49708e8d3be1a871adcc5e9deded60064be9d7fba1c13fdcb80ccb8c,2021-03-14 14:44:22,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<stdio.h>\n#include<math.h>\nint main(){\n\tlong long n,i,l,r,q,j,a[1000],b[1000];\n\tscanf(\""%lld\"",&n);\n\tfor(i=1;i<=n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%lld\"",&q);\n\tfor(i=1;i<=q;i++){\n\t\tscanf(\""%lld %lld\"",&l,&r);\n\t\tb[i]=a[l];\n\t\tfor(j=l;j<r;j++){\n\t\t\tb[i]=a[j+1]*b[i];\n\t\t}\n\t}\n\tfor(i=1;i<=q;i++){\n\t\tprintf(\""%lld\\n\"",b[i]%(int)(pow(10,9)+7));\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,8,176
1370989170151411712,981fcea4af5b388931133b5df074af3636635b2ab46b3668f45141b7faa52f82,2021-03-14 14:44:24,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include <cmath>\n#include <queue>\n#include <deque>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <unordered_map>\n#include <sstream>\n#include <bitset>\n#include <unordered_set>\n#include <set>\n#include <stdio.h>\n#include <complex>\n#include <numeric>\n#include <functional>\nusing namespace std;\n\nint count(long long  temp)\n{\n\tint count = 0;\n\twhile (temp != 0)\n\t{\n\t\ttemp /= 10;\n\t\tcount++;\n\t}\n\treturn count;\n}\nint main()\n{\n\tlong long mod = 1e+9;\n\tint n; cin >> n;\n\tvector<int> re(n,0);\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> re[i];\n\t}\n\tint q; cin >> q;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tint a, b; cin >> a >> b;\n\t\ta -= 1; b -= 1;\n\t\tint c=1;\n\t\tfor (int i = a; i <= b; i++)\n\t\t{\n\t\t\tc *= re[i];\n\t\t\tc %= mod;\n\t\t}\n\t\tcout << c << endl;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,18,668
1370989265274032128,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-03-14 14:44:47,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint yu=1e9+7;\nint main()\n{\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n int m;cin>>m;\n while(m--)\n {\n \tint l,r;cin>>l>>r;\n \tint jia=1;\n \tfor(int i=l-1;i<=r-1;i++) jia=jia*a[i];\n \tcout<<jia<<endl;\n }\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,21,456
1370989391770046464,e5fd69e644b3d48ae051efca395aae6e74522626fccc66b8b2d023d530057b48,2021-03-14 14:45:17,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<bits/stdc++.h>\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\nusing namespace std;\nint main(int argc, char** argv) {\n\tlong long m=pow(10,9)+8;\n  int n;cin>>n;\n  for(int i=0;i<n;i++)\n   {\n   \tint a;cin>>a;\n   }\n   int Q;cin>>Q;\n   int daan[Q][2];\n   for(int i=0;i<Q;i++)\n   {\n   \tfor(int j=0;j<2;j++)\n   \t{\n   \t\tcin>>daan[i][j];\n   \t}\n   }\n   for(int i=0;i<Q;i++)\n   {\n   \t if(i<Q-1)\n   \t  {\n   \t  unsigned long long sum=1;\n   \t  for(int j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum%m<<endl;\n     }\n     else\n     {\n     \t unsigned long long sum=1;\n   \t  for(int j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum%m;\n     }\n     \n   }\n}",WRONG_ANSWER,5,304
1370989540328005632,c118514b9494c219ce92d2176fb3e7a2095835e5de0066e8d43db71c7f5bc672,2021-03-14 14:45:52,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\nusing namespace std;\nint b[100050];\nint a;\n\tint c;\nint main()\n{\n\tcin>>a;\t\n\tfor(int i=1;i<=a;i++)\n\t{\n\t\tcin>>b[i];\n\t}\n\tcin>>c;\n\tfor(int i=1;i<=c;i++)\n\t{\n\t\tint long long  d,e,num=1;\n\t\tcin>>d>>e;\n\t\tfor(int j=d;j<=e;j++)\n\t\t{\n\t\t\tnum=(num*b[j])%100000007;\n            \n\t\t}\n\t\tcout<<num<<endl;\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,12,440
1370989792040865792,e5fd69e644b3d48ae051efca395aae6e74522626fccc66b8b2d023d530057b48,2021-03-14 14:46:52,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<bits/stdc++.h>\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\nusing namespace std;\nint main(int argc, char** argv) {\n  long long m=1;\n  for(int i=0;i<9;i++)\n  {\n  \tm*=10;\n  }\n  m+=7;\n  cout<<m;\n  int n;cin>>n;\n  for(int i=0;i<n;i++)\n   {\n   \tint a;cin>>a;\n   }\n   int Q;cin>>Q;\n   int daan[Q][2];\n   for(int i=0;i<Q;i++)\n   {\n   \tfor(int j=0;j<2;j++)\n   \t{\n   \t\tcin>>daan[i][j];\n   \t}\n   }\n   for(int i=0;i<Q;i++)\n   {\n   \t if(i<Q-1)\n   \t  {\n   \t  unsigned long long sum=1;\n   \t  for(int j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum%m<<endl;\n     }\n     else\n     {\n     \t unsigned long long sum=1;\n   \t  for(int j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum%m;\n     }\n     \n   }\n}",WRONG_ANSWER,9,484
1370990668893577216,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-03-14 14:50:21,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint yu=1e9+7;\nint main()\n{\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n int m;cin>>m;\n while(m--)\n {\n \tint l,r;scanf(\""%d%d\"",&l,&r);\n \tint jia=1;\n \tfor(int i=l-1;i<=r-1;i++) jia=(jia%yu)*(a[i]%yu);\n \tprintf(\""%d\\n\"",jia);\n }\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,9,448
1370990945327570944,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-03-14 14:51:27,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint yu=1e9+7;\nint main()\n{\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n int m;cin>>m;int l,r;int jia=1;\n while(m--)\n {\n \tscanf(\""%d%d\"",&l,&r);\n \tjia=1;\n \tfor(int i=l-1;i<=r-1;i++) jia=(jia%yu)*(a[i]%yu);\n \tprintf(\""%d\\n\"",jia);\n }\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,6,432
1370991123333832704,fedc3a638fa116fe29661076f8a4e1daf4cef785aeb9b888e4c29ac71e973c19,2021-03-14 14:52:10,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,using System;\n\nnamespace 竞赛\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = Convert.ToInt32(Console.ReadLine());\n            string str = Console.ReadLine();\n            string[] A = str.Split(' ');\n            int m= Convert.ToInt32(Console.ReadLine());\n            string[] B = new string[m];\n            for (int i = 0; i < m; i++)\n            {\n                B[i] = Console.ReadLine();\n            }\n            for (int i = 0; i < m; i++)\n            {\n                int sum = 1;\n                int da = 1;\n                int jieguo;\n                string[] a = B[i].Split(' ');\n                int b = Convert.ToInt32(a[0]);\n                int c = Convert.ToInt32(a[1]);\n                for (int j = b; j <= c; j++)\n                {\n                    int d= Convert.ToInt32(A[j-1]);\n                    sum = sum * d;\n                }\n                for (int j = 0; j < 9; j++)\n                {\n                    da = da * 10;\n                }\n                jieguo = sum % (da + 7);\n                Console.WriteLine(jieguo);\n            }\n        }\n    }\n}\n,TIME_LIMIT_EXCEEDED,48,3736
1370991312887107584,27519715840f60be1dfab8eaeaed73942d47f671be97b4c89b2a550f772759a3,2021-03-14 14:52:55,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n  unsigned int a[100000],b[100000],c[100000];int i;\n    unsigned int n;\n    cin>>n;\n    for(i=0;i<n;i++)\n    {\n        cin>>a[i];\n    }\n    int x;\n    cin>>x;\n    for(i=0;i<x;i++)\n    {\n        cin>>b[i]>>c[i];\n    }\n    int j,sum=1;\n    for(i=0;i<x;i++)\n    {\n        for(j=b[i]-1;j<=c[i]-1;j++)\n        {\n            sum=sum*a[j];\n        }\n        cout<<sum%(1000000000+7)<<endl;\n        sum=1;\n    }\n}",TIME_LIMIT_EXCEEDED,6,320
1370991346122772480,b5996ef651c3ecd72601b1d7cfc7c4ccd7d6aa58490c347a8be22b90f85588e5,2021-03-14 14:53:03,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,#include<iostream>\n#include<cmath>\n#include<cstdio>\n#include<algorithm>\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\tint k;\n\tcin>>k;\n\tint q[k];\n\tint j[k];\n\tfor(int i=0;i<k;i++){\n\t\tcin>>q[i]>>j[i];\n\t}\n\tfor(int i=0;i<k;i++){\n\t\tint h=1;\n\t\tfor(int u=q[i]-1;u<=j[i]-1;u++){\n\t\t\th=h*a[u];\n\t\t}\n\t\tcout<<h<<endl;\n\t}\n\n\t\n\t\n},TIME_LIMIT_EXCEEDED,11,316
1370991362950320128,302ae5737edb7c44c6eacd636612e9e544276a6e18651a8536b48aae19ba28ef,2021-03-14 14:53:07,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<string> \nusing namespace std;\nconst int maxn =100007;\nconst int yu=1000000007;\nint price[maxn];\nint sum[maxn];\nint main()\n{\n\tint n,q,l,r;\n\tcin>>n;\n\tlong long ts;\n\tfor(int i=1;i<=n;i++)\n\t\tcin>>price[i];\n\tcin>>q;\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tcin>>l>>r;\n\t\tts=1;\n\t\tfor(int j=l;j<=r;j++)\n\t\t{\n\t\t\tif(ts==0)\n\t\t\t\tts=1;\n\t\t\tts*=price[j];\n\t\t\tif(ts>=yu)\n\t\t\t\tts%=yu;\n\t\t}\n\t\tcout<<ts<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,4,440
1370991498136838144,e5fd69e644b3d48ae051efca395aae6e74522626fccc66b8b2d023d530057b48,2021-03-14 14:53:39,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<bits/stdc++.h>\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\nusing namespace std;\nint main(int argc, char** argv) {\n  long long m=1;\n  for(int i=0;i<9;i++)\n  {\n  \tm*=10;\n  }\n  m+=7;\n  int n;cin>>n;\n  for(int i=0;i<n;i++)\n   {\n   \tint a;cin>>a;\n   }\n   int Q;cin>>Q;\n   int daan[Q][2];\n   for(int i=0;i<Q;i++)\n   {\n   \tfor(int j=0;j<2;j++)\n   \t{\n   \t\tcin>>daan[i][j];\n   \t}\n   }\n   for(int i=0;i<Q;i++)\n   {\n   \t if(i<Q-1)\n   \t  {\n   \t  unsigned long long sum=1;\n   \t  for(int j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum%m<<endl;\n     }\n     else\n     {\n     \t unsigned long long sum=1;\n   \t  for(int j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum%m;\n     }\n     \n   }\n}",WRONG_ANSWER,4,324
1370991596933763072,27519715840f60be1dfab8eaeaed73942d47f671be97b4c89b2a550f772759a3,2021-03-14 14:54:03,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n  int a[100000],b[100000],c[100000];int i;\n    int n;\n    cin>>n;\n    for(i=0;i<n;i++)\n    {\n        cin>>a[i];\n    }\n    int x;\n    cin>>x;\n    for(i=0;i<x;i++)\n    {\n        cin>>b[i]>>c[i];\n    }\n    int j,sum=1;\n    for(i=0;i<x;i++)\n    {\n        for(j=b[i]-1;j<=c[i]-1;j++)\n        {\n            sum=sum*a[j];\n        }\n        cout<<sum%(1000000000+7)<<endl;\n        sum=1;\n    }\n}",TIME_LIMIT_EXCEEDED,5,304
1370991635491905536,fedc3a638fa116fe29661076f8a4e1daf4cef785aeb9b888e4c29ac71e973c19,2021-03-14 14:54:12,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,using System;\n\nnamespace 竞赛\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = Convert.ToInt32(Console.ReadLine());\n            string str = Console.ReadLine();\n            string[] A = str.Split(' ');\n            int m= Convert.ToInt32(Console.ReadLine());\n            string[] B = new string[m];\n            for (int i = 0; i < m; i++)\n            {\n                B[i] = Console.ReadLine();\n            }\n            for (int i = 0; i < m; i++)\n            {\n                int sum = 1;\n                int da = 1;\n                int jieguo;\n                string[] a = B[i].Split(' ');\n                int b = Convert.ToInt32(a[0]);\n                int c = Convert.ToInt32(a[1]);\n                for (int j = b; j <= c; j++)\n                {\n                    int d= Convert.ToInt32(A[j-1]);\n                    sum = sum * d;\n                }\n                jieguo = sum % (1000000000 + 7);\n                Console.WriteLine(jieguo);\n            }\n        }\n    }\n}\n,TIME_LIMIT_EXCEEDED,22,3600
1370991863703986176,3a2236b18297a6cd20e727de89fbb262db82578827b4cf92f23ae7acd4976769,2021-03-14 14:55:06,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include <stdio.h>\n#include <math.h>\n#include <string.h>\nusing namespace std;\nint INF=1000000007;\nint main() \n{\n\tlong long a1=1;\n\tint n,t;\n\tint c,b;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%d\"",&t);\n\twhile(t--){\n\t\ta1=1;\n\t\tscanf(\""%d %d\"",&c,&b);\n\t\tfor(int i=c-1;i<=b-1;i++){\n\t\t\ta1*=a[i];\n\t\t\ta1%=INF;\n\t\t}\n\t\tprintf(\""%d\\n\"",a1);\n\t}\n\n}",TIME_LIMIT_EXCEEDED,4,328
1370992004775301120,4ed13d4b43202a604458f06b48d510cde128069511c711798c249949ffe932bf,2021-03-14 14:55:40,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace ConsoleApp5\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int N = Convert.ToInt32(Console.ReadLine());\n            int[] a = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q=Convert.ToInt32(Console.ReadLine());\n            for (int i = 0; i < Q; i++)\n            {\n                int[] b = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                int m = b[0];\n                int n = b[1];\n                int sum = 1;\n                int o = 1;\n                for (int j = m; j <=n; j++)\n                {\n                    sum *= a[j - 1];\n                }\n                o = sum % (100000007);\n                Console.WriteLine(o);\n            }\n        }\n    }\n}\n\n",TIME_LIMIT_EXCEEDED,25,3608
1370992436629135360,f41ec44c982aa8de0ad03db515d30f1e4a221c1a61b6c340b1ce0bc15a65f5fb,2021-03-14 14:57:23,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cmath>\n#include<iomanip>\n#include<string>\n#include<sstream>\n#include<iostream>\n#include<algorithm>\n#include<bitset>\n#include<fstream>\n#include<stdio.h>\n\nusing namespace std;\n\n\nint main()\n{\n\tunsigned long long n;\n\tcin >> n;\n\tunsigned long long arr[1000] = {0};\n\tfor (unsigned long long i = 0; i < n; i++)\n\t{\n\t\tcin >> arr[i];\n\t}\n\tunsigned long long Q;\n\tcin >> Q;\n\t\n\tfor (unsigned long long i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long L, R;\n\t\tcin >> L >> R;\n\t\tunsigned long long num = (unsigned long long)pow(10, 7) + 7;\n\t\tunsigned long long money = 1;\n\t\tfor (unsigned long long j = L-1; j < R; j++)\n\t\t{\n\t\t\tmoney *= arr[j];\n\t\t}\n\t\tmoney = money% num;\n\t\tcout << money << endl;\n\t}\n\t\n\n\n\n\n\treturn 0;\n}\n\n",SEGMENTATION_FAULT,36,444
1370992656838483968,4ed13d4b43202a604458f06b48d510cde128069511c711798c249949ffe932bf,2021-03-14 14:58:15,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace ConsoleApp5\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int N = Convert.ToInt32(Console.ReadLine());\n            int[] a = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q=Convert.ToInt32(Console.ReadLine());\n            for (int i = 0; i < Q; i++)\n            {\n                int[] b = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                int m = b[0];\n                int n = b[1];\n                int sum = 1;\n                for (int j = m; j <=n; j++)\n                {\n                    sum *= a[j - 1];\n                }\n               int o = sum % (100000007);\n                Console.WriteLine(o);\n            }\n        }\n    }\n}\n\n",TIME_LIMIT_EXCEEDED,76,3616
1370992845552898048,4ed13d4b43202a604458f06b48d510cde128069511c711798c249949ffe932bf,2021-03-14 14:59:00,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace ConsoleApp5\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            Console.ReadLine();\n            int[] a = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q=Convert.ToInt32(Console.ReadLine());\n            for (int i = 0; i < Q; i++)\n            {\n                int[] b = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                int m = b[0];\n                int n = b[1];\n                int sum = 1;\n                for (int j = m; j <=n; j++)\n                {\n                    sum *= a[j - 1];\n                }\n               int o = sum % (100000007);\n                Console.WriteLine(o);\n            }\n        }\n    }\n}\n\n",TIME_LIMIT_EXCEEDED,23,3608
1370992888221552640,f41ec44c982aa8de0ad03db515d30f1e4a221c1a61b6c340b1ce0bc15a65f5fb,2021-03-14 14:59:11,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cmath>\n#include<iomanip>\n#include<string>\n#include<sstream>\n#include<iostream>\n#include<algorithm>\n#include<bitset>\n#include<fstream>\n#include<stdio.h>\n\nusing namespace std;\n\n\nint main()\n{\n\tunsigned long long n;\n\tcin >> n;\n\tunsigned long long arr[1000] = {0};\n\tfor (unsigned long long i = 0; i < n; i++)\n\t{\n\t\tcin >> arr[i];\n\t}\n\tunsigned long long Q;\n\tcin >> Q;\n\tunsigned long long num = (unsigned long long)pow(10, 7) + 7;\n\tfor (unsigned long long i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long L, R;\n\t\tcin >> L >> R;\n\t\tunsigned long long money = 1;\n\t\tfor (unsigned long long j = L-1; j < R; j++)\n\t\t{\n\t\t\tmoney *= arr[j];\n\t\t}\n\t\tmoney = money% num;\n\t\tcout << money << endl;\n\t}\n\t\n\n\n\n\n\treturn 0;\n}\n\n",SEGMENTATION_FAULT,8,444
1370993175132917760,d3e761d6eb6e6d73a9e9b1026fab7cf11c040b1aa1e7118f754590e5b4d0e69e,2021-03-14 15:00:19,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cstdio>\n#include<iostream>\n#include<iomanip>\n#include<cmath>\nusing namespace std;\nint main()\n{\n    int a[100005];\n    long long n;\n    int c=1000000007;\n    long long q,l,r;\n    cin>>n;\n    for(long long i=1;i<=n;i++)\n    {\n    \tcin>>a[i];\n\t}\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tlong long b=1;\n\t\tcin>>l>>r;\n\t\tfor(long long i=l;i<=r;i++)\n\t\t{\n\t\t   b*=a[i];\t\n\t\t}\n\t\tcout<<b%c;\n\t}\n\treturn 0;\n} ",PRESENTATION_ERROR,5,428
1370993269173313536,d3e761d6eb6e6d73a9e9b1026fab7cf11c040b1aa1e7118f754590e5b4d0e69e,2021-03-14 15:00:41,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cstdio>\n#include<iostream>\n#include<iomanip>\n#include<cmath>\nusing namespace std;\nint main()\n{\n    int a[100005];\n    long long n;\n    int c=1000000007;\n    long long q,l,r;\n    cin>>n;\n    for(long long i=1;i<=n;i++)\n    {\n    \tcin>>a[i];\n\t}\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tlong long b=1;\n\t\tcin>>l>>r;\n\t\tfor(long long i=l;i<=r;i++)\n\t\t{\n\t\t   b*=a[i];\t\n\t\t}\n\t\tcout<<b%c<<endl;\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,6,308
1370993378518818816,475c4005031a141d86de12945a8ae06e3762fbbd1dac63672d452ad34934f590,2021-03-14 15:01:07,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<string>\n#include<sstream>\n#include<cmath>\n#include<cstdio>\nusing namespace std;\nint main()\n{\n\tint n,q;\n\tcin >> n;\n\tlong long arr[10010];\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> arr[i];\n\t}\n\tcin >> q;\n\tlong long arr1[10010];\n\tlong long arr2[10010];\n\tlong long arr3[10010];\n\tlong long b = pow(10, 9) + 7;\n\tfor (int i = 0; i < q * 2; i++) {\n\t\tcin >> arr1[i];\n\t\tfor (int j = 0; j < q; j++) {\n\t\t\tarr2[j] = 1;\n\t\t\tlong long shou = arr1[(j + 1) * 2 - 2];\n\t\t\tlong long wei = arr1[(j + 1) * 2 - 1];\n\t\t\tfor (int k = shou; k <= wei; k++) {\n\t\t\t\tarr2[j] *= k;\n\t\t\t}\n\t\t\tarr3[j] = arr2[j] % b;\n\t\t}\n\t}\n\tfor (int i = 0; i < q; i++) {\n\t\tcout << arr3[i] << endl;\n\t}\n\treturn 0;\n}\n\t\n",WRONG_ANSWER,16,324
1370993461016678400,8facc72e726a75c1e6f9e0e4e3d5b016fdc508884d5f6bf3e15d47697d7e8445,2021-03-14 15:01:27,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,using System;\n\nnamespace ConsoleApp15\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string a = Console.ReadLine();\n            int q = int.Parse(Console.ReadLine());\n            string[] x = new string[q];\n            for (int i = 0; i < q; i++) \n            {\n                x[i] = Console.ReadLine();\n            }\n            \n            for (int i = 0; i < q; i++)\n            {\n                int num = 1;\n                string[] y = x[i].Split(' ');\n                for (int j = int.Parse(y[0]); j <= int.Parse(y[1]); j++) \n                {\n                    num = num * j;\n                }\n                Console.WriteLine(num);\n            }\n        }\n    }\n}\n,WRONG_ANSWER,33,3660
1370993515567702016,8facc72e726a75c1e6f9e0e4e3d5b016fdc508884d5f6bf3e15d47697d7e8445,2021-03-14 15:01:40,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,using System;\n\nnamespace ConsoleApp15\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string a = Console.ReadLine();\n            int q = int.Parse(Console.ReadLine());\n            string[] x = new string[q];\n            for (int i = 0; i < q; i++) \n            {\n                x[i] = Console.ReadLine();\n            }\n            \n            for (int i = 0; i < q; i++)\n            {\n                int num = 1;\n                string[] y = x[i].Split(' ');\n                for (int j = int.Parse(y[0]); j <= int.Parse(y[1]); j++) \n                {\n                    num = num * j;\n                }\n                Console.WriteLine(num);\n            }\n        }\n    }\n}\n,WRONG_ANSWER,72,3608
1370994219892101120,30be458ec12821686d182d51989256e7a8f449f201b1926b3f62c0b2ce2ae456,2021-03-14 15:04:28,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,using System;\n\nnamespace ConsoleApp2\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            Console.WriteLine(120);\n            Console.WriteLine(24);\n        }\n    }\n}\n,WRONG_ANSWER,22,3576
1370994253903618048,f41ec44c982aa8de0ad03db515d30f1e4a221c1a61b6c340b1ce0bc15a65f5fb,2021-03-14 15:04:36,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cmath>\n#include<iomanip>\n#include<string>\n#include<sstream>\n#include<iostream>\n#include<algorithm>\n#include<bitset>\n#include<fstream>\n#include<stdio.h>\n\nusing namespace std;\n\n\nint main()\n{\n\n\tunsigned long long n;\n\tcin >> n;\n\tunsigned long long arr[1000] = { 0 };\n\tfor (unsigned long long i = 0; i < n; i++)\n\t{\n\t\tcin >> arr[i];\n\t}\n\tunsigned long long Q;\n\tcin >> Q;\n\tunsigned long long num = (unsigned long long)pow(10, 7) + 7;\n\twhile (Q--)\n\t{\n\t\tunsigned long long L, R;\n\t\tcin >> L >> R;\n\t\tunsigned long long money = 1;\n\t\tfor (unsigned long long j = L - 1; j < R; j++)\n\t\t{\n\t\t\tmoney *= arr[j];\n\t\t}\n\t\tmoney = money % num;\n\t\tcout << money << endl;\n\t}\n\t\t\n\t\n\treturn 0;\n}\n\n",SEGMENTATION_FAULT,43,328
1370994330630115328,8facc72e726a75c1e6f9e0e4e3d5b016fdc508884d5f6bf3e15d47697d7e8445,2021-03-14 15:04:54,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,using System;\n\nnamespace ConsoleApp15\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string a = Console.ReadLine();\n            int q = int.Parse(Console.ReadLine());\n            string[] x = new string[q];\n            for (int i = 0; i < q; i++) \n            {\n                x[i] = Console.ReadLine();\n            }\n            \n            for (int i = 0; i < q; i++)\n            {\n                int num = 1;\n                string[] y = x[i].Split(' ');\n                for (int j = int.Parse(y[0]); j <= int.Parse(y[1]); j++) \n                {\n                    num = num * j;\n                }\n                Console.WriteLine(num);\n            }\n        }\n    }\n}\n,WRONG_ANSWER,32,3708
1370994678396542976,9c0292ac46829c630c916bb82a0ae40b8dcc2265f2f85d81974dad0a3e54e242,2021-03-14 15:06:17,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n//int[] a = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\nnamespace tiantisai\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n\n            int a = int.Parse(Console.ReadLine());\n            int[] b = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int c = int.Parse(Console.ReadLine());\n            int[] s = new int[c];\n            for (int i = 0; i < c; i++)\n                s[i] = 1;\n            for (int i =0;i<c;i++)\n            {\n                \n                \n                int[] d = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                int m = d[0];\n                int n = d[1];\n                for (int j = m-1;j<n;j++)\n                {\n                    s[i] *= b[j];\n                }\n\n            }\n            for (int i = 0; i < c; i++)\n                Console.WriteLine(s[i]);\n\n            Console.ReadLine();\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,24,3636
1370995179141914624,d3e761d6eb6e6d73a9e9b1026fab7cf11c040b1aa1e7118f754590e5b4d0e69e,2021-03-14 15:08:17,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cstdio>\n#include<iostream>\n#include<iomanip>\n#include<cmath>\nusing namespace std;\nint main()\n{\n    int a[100005];\n    int n;\n    int c=1000000007;\n    int q,l,r;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++)\n    {\n    \tscanf(\""%d\"",&a[i]);\n\t}\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tint b=1;\n\t\tscanf(\""%d%d\"",&l,&r);\n\t\tfor(int i=l;i<=r;i++)\n\t\t{\n\t\t   b*=a[i];\t\n\t\t}\n\t\tprintf(\""%d\\n\"",b%c);\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,4,320
1370995190932103168,8facc72e726a75c1e6f9e0e4e3d5b016fdc508884d5f6bf3e15d47697d7e8445,2021-03-14 15:08:20,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,using System;\n\nnamespace ConsoleApp15\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string a = Console.ReadLine();\n            int[] a1 = new int[n];\n            int q = int.Parse(Console.ReadLine());\n            string[] x = new string[q];\n            for (int i = 0; i < q; i++) \n            {\n                x[i] = Console.ReadLine();\n            }\n            \n            for (int i = 0; i < q; i++)\n            {\n                int num = 1;\n                string[] y = x[i].Split(' ');\n                for (int j = int.Parse(y[0]); j <= int.Parse(y[1]); j++) \n                {\n                    num = num * j;\n                }\n                Console.WriteLine(num);\n            }\n        }\n    }\n}\n,WRONG_ANSWER,42,3480
1370995637147422720,b639145294c42849a311824e53c162d65053dbd9cd10473314eeb796850240cc,2021-03-14 15:10:06,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\nusing namespace std;\nint main(int argc, char** argv) {\n\tint n;\n\tcin>>n;\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\tint q;\n\tint l,r;\n\tcin>>q;\n\tunsigned long long temp;\n\tunsigned long long result[q];\n\tfor(int i=0;i<q;i++){\n\t\ttemp=1;\n\t\tcin>>l>>r;\n\t\tfor(int j=l-1;j<=r-1;j++){\n\t\t\ttemp*=a[j];\n\t\t}\n\t\tif(temp>1000000007)\n\t\tresult[i]=temp%(1000000007);\n\t\telse \n\t\tresult[i]=temp;\n\t}\n\tfor(int i=0;i<q;i++){\n\t\tcout<<result[i]<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,5,448
1370995774447964160,f8e29cb8ec8b44a25d5d57d41e0ded3d5a1945fe3447a876109ee052bd462367,2021-03-14 15:10:39,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace ConsoleApplication33\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = Convert.ToInt32(Console.ReadLine());\n            int[] arr = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int q = Convert.ToInt32(Console.ReadLine());\n            int[,] arr1 = new int[q, 2];\n            for (int i = 0; i < q; i++)\n            {\n                int[] temp = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                for (int j = 0; j < 2; j++)\n                {\n                    arr1[i, j] = temp[j];\n                }\n            }\n\n            for (int i = 0; i < q; i++)\n            {                \n                for (int j = 0; j < 2; j++)\n                {\n                    int l = arr1[i, j];\n                    int r = arr1[i, j + 1];\n                    int temp1 = 1;\n                    for (int k = l; k <= r; k++)\n                    {\n                        temp1 *= k;\n                    }\n                    Console.WriteLine(temp1);\n                    break;\n                }\n            }\n            Console.ReadKey();\n        }\n    }\n}",WRONG_ANSWER,28,3736
1370995782350032896,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:10:41,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,f,e,k=0,sum;\n\tint a[10001],ans[10001];\n\tcin>>n;\n\tfor(int i=1;i<=n;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tk++;\n\t\tcin>>f>>e;\n\t\tsum=a[f];\n\t\tfor(int i=f+1;i<=e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tans[k]=sum;\n\t}\n\tfor(int i=1;i<=k;i++) cout<<ans[i]<<endl;\n\treturn 0;\n}",SEGMENTATION_FAULT,19,436
1370995869927006208,f8e29cb8ec8b44a25d5d57d41e0ded3d5a1945fe3447a876109ee052bd462367,2021-03-14 15:11:01,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace ConsoleApplication33\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = Convert.ToInt32(Console.ReadLine());\n            int[] arr = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int q = Convert.ToInt32(Console.ReadLine());\n            int[,] arr1 = new int[q, 2];\n            for (int i = 0; i < q; i++)\n            {\n                int[] temp = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                for (int j = 0; j < 2; j++)\n                {\n                    arr1[i, j] = temp[j];\n                }\n            }\n\n            for (int i = 0; i < q; i++)\n            {                \n                for (int j = 0; j < 2; j++)\n                {\n                    int l = arr1[i, j];\n                    int r = arr1[i, j + 1];\n                    int temp1 = 1;\n                    for (int k = l; k <= r; k++)\n                    {\n                        temp1 *= k;\n                    }\n                    Console.WriteLine(\""{0}\"",temp1);\n                    break;\n                }\n            }\n            Console.ReadKey();\n        }\n    }\n}",WRONG_ANSWER,31,3720
1370996032640835584,13c0a63bbdfa7f4ba48ad24d0bc04623f78e027babaeb83e0af274cc5585b223,2021-03-14 15:11:40,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\nusing namespace std;\n\nunsigned long long mi(unsigned long long j,int a)\n{\n\tunsigned long long m=j;\n\tfor(int i=1;i<a;i++){\n\t\tm=m*j;\n\t}\n\treturn m;\n}\n\nint main()\n{\n\tint n;\n\tcin>>n;\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\tint q;\n\tcin>>q;\n\tunsigned int b[q];\n\tfor(int i=0;i<q;i++){\n\t\tb[i]=1;\n\t}\n\tfor(int i=0;i<q;i++){\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tl--;\n\t\tfor(int j=l;j<r;j++){\n\t\t\tb[i]*=a[j];\n\t\t}\n\t}\n\tfor(int i=0;i<q;i++){\n\t\tb[i]=b[i]%(mi(10,9)+7);\n\t}\n\tfor(int i=0;i<q;i++){\n\t\tcout<<b[i]<<endl;\n\t}\n\t\n\t\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,5,440
1370996132737900544,b639145294c42849a311824e53c162d65053dbd9cd10473314eeb796850240cc,2021-03-14 15:12:04,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\nusing namespace std;\nint main(int argc, char** argv) {\n\tint n;\n\tcin>>n;\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\tint q;\n\tint l,r;\n\tcin>>q;\n\tunsigned long long temp;\n\tint result[q];\n\tfor(int i=0;i<q;i++){\n\t\ttemp=1;\n\t\tcin>>l>>r;\n\t\tfor(int j=l-1;j<=r-1;j++){\n\t\t\ttemp*=a[j];\n\t\t}\n\t\tif(temp>1000000007)\n\t\tresult[i]=temp%(1000000007);\n\t\telse \n\t\tresult[i]=temp;\n\t}\n\tfor(int i=0;i<q;i++){\n\t\tcout<<result[i]<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,6,312
1370996226392608768,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:12:26,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,f,e,k=0,sum;\n\tint a[10001],ans[10001];\n\tcin>>n;\n\tfor(int i=1;i<=n;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tk++;\n\t\tcin>>f>>e;\n\t\tsum=a[f];\n\t\tfor(int i=f+1;i<=e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,12,448
1370996348300054528,8facc72e726a75c1e6f9e0e4e3d5b016fdc508884d5f6bf3e15d47697d7e8445,2021-03-14 15:12:55,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,using System;\n\nnamespace ConsoleApp15\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string a = Console.ReadLine();\n            string[] a1 = new string[n];\n            a1 = a.Split(' ');\n            int q = int.Parse(Console.ReadLine());\n            string[] x = new string[q];\n            for (int i = 0; i < q; i++) \n            {\n                x[i] = Console.ReadLine();\n            }\n            for (int i = 0; i < q; i++)\n            {\n                int num = 1;\n                string[] y = x[i].Split(' ');\n                for (int j = int.Parse(y[0]); j <= int.Parse(y[1]); j++) \n                {\n                    num = num * j;\n                }\n                Console.WriteLine(num);\n            }\n        }\n    }\n},WRONG_ANSWER,41,3616
1370996424128876544,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:13:14,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,f,e,k=0,sum;\n\tint a[10001];\n\tcin>>n;\n\tfor(int i=1;i<=n;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tk++;\n\t\tcin>>f>>e;\n\t\tsum=a[f];\n\t\tfor(int i=f+1;i<=e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,27,328
1370996699510099968,fe607663055571ed43227df0a2254438d6be3aef49b1d77685627d4801365903,2021-03-14 15:14:19,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tlong long x=1;\n\tint n,m[200000],i,j,q,l,r;\n\tcin>>n;\n\tfor(i=1;i<=n;i++){\n\t\tcin>>m[i];\n\t}\n\tcin>>q;\n\tfor(i=0;i<q;i++){\n\t\tcin>>l>>r;\n\t\tfor(j=l;j<=r;j++){\n\t\t\tx=x*m[j];\n\t\t\tx=x%(1000000000+7);\n\t\t}cout<<x;\n\t\tx=1;\n\t}\n\treturn 0;\n}",PRESENTATION_ERROR,6,316
1370996822294155264,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:14:48,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,f,e,k=0,sum;\n\tint a[10001];\n\tcin>>n;\n\tfor(int i=1;i<=n;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tk++;\n\t\tcin>>f>>e;\n\t\tsum=a[f];\n\t\tfor(int i=f+1;i<=e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tcout<<sum%1000000007<<endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,16,448
1370997068596174848,8facc72e726a75c1e6f9e0e4e3d5b016fdc508884d5f6bf3e15d47697d7e8445,2021-03-14 15:15:47,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,using System;\n\nnamespace ConsoleApp15\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string a = Console.ReadLine();\n            string[] a1 = new string[n];\n            a1 = a.Split(' ');\n            int q = int.Parse(Console.ReadLine());\n            string[] x = new string[q];\n            for (int i = 0; i < q; i++) \n            {\n                x[i] = Console.ReadLine();\n            }\n            for (int i = 0; i < q; i++)\n            {\n                int num = 1;\n                string[] y = a1;\n                for (int j = int.Parse(y[0]); j <= int.Parse(y[1]); j++) \n                {\n                    num = num * j;\n                }\n                Console.WriteLine(num);\n            }\n        }\n    }\n},WRONG_ANSWER,51,3628
1370997174066237441,8c368c592c0083612bfd9cdabe77bc2a49effc875b269792da3919d8c467bec1,2021-03-14 15:16:12,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cmath>\n#include <iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\t/*int a,b; cin >> a;\n\tb = a - 1; unsigned long long c = pow(10, b);\n\tfor (unsigned long long i = 1; i>=1; i++)\n\t{\n\t\tif (pow(i, i) >= c)\n\t\t{\n\t\t\tcout << i;\n\t\t\tbreak;\n\t\t}\n\t}*/\n\tint n,Q; cin >> n;\n\tint*p = new int[n];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> p[i];\n\t}\n\tcin >> Q; int **k = new int*[2];\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tk[i] = new int[2];\n\t}\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tfor (int j = 0; j < 2; j++)\n\t\t{\n\t\t\tcin >> k[i][j];\n\t\t}\n\t}\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long c = 1;\n\t\tfor (int j = k[i][0]; j <= k[i][1]; j++)\n\t\t{\n\t\t\tc *= p[j-1];\n\t\t}\n\t\tcout << c % (1000000000 + 7) << endl;\n\t}\n\t\n\treturn 0;\n}\n\n\n",SEGMENTATION_FAULT,23,336
1370997295734513664,1f19cf1e0aa879bf253088d44e320f0c837c902a0444a801080af34b15210f3a,2021-03-14 15:16:41,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<iomanip>\n#include<string>\n#include<cmath>\n#include<cstdio>\nusing namespace std;\nint main()\n{\n\tint chushu = 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7;\n\t\t\n\tint n;\n\tcin >> n;\n\tint* shuzu = new int(n);\n\tfor (size_t i = 0; i <n; i++)\n\t{\n\t\tint y;\n\t\tcin >> y;\n\t\tshuzu[i] = y;\n\t}\n\tint q;\n\tcin >> q;\n\tint* shuzu2 = new int(q);\n\tfor (size_t i = 0; i < q; i++)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tint sum=1;\n\t\tfor (size_t j = l-1; j <=r-1; j++)\n\t\t{\n\t\t\tsum *= shuzu[j];\n\t\t}\n\t\tsum = sum % chushu;\n\t\tshuzu2[i] = sum;\n\t\t\n\t}\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tcout << shuzu2[i] << endl;\n\t}\n\t\n\n\n\n\n\treturn 0;\n}",SEGMENTATION_FAULT,13,320
1370997353611808768,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:16:55,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,f,e,k=0,sum;\n\tint a[100001];\n\tcin>>n;\n\tfor(int i=1;i<=n;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tk++;\n\t\tcin>>f>>e;\n\t\tsum=a[f];\n\t\tfor(int i=f+1;i<=e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tcout<<sum%1000000007<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,4,588
1370997570155335680,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:17:47,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,f,e,k=0,sum;\n\tint a[100001];\n\tcin>>n;\n\tfor(int i=1;i<=n;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tcin>>f>>e;\n\t\tsum=a[f];\n\t\tfor(int i=f+1;i<=e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tcout<<sum%1000000007<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,8,316
1370997679689490432,b5996ef651c3ecd72601b1d7cfc7c4ccd7d6aa58490c347a8be22b90f85588e5,2021-03-14 15:18:13,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,#include<iostream>\n#include<cmath>\n#include<cstdio>\n#include<algorithm>\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\tint k;\n\tcin>>k;\n\tint q[k];\n\tint j[k];\n\tfor(int i=0;i<k;i++){\n\t\tcin>>q[i]>>j[i];\n\t}\n\tfor(int i=0;i<k;i++){\n\t\tint h=1;\n\t\tfor(int u=q[i]-1;u<=j[i]-1;u++){\n\t\t\th=h*a[u];\n\t\t}\n\t\tcout<<h<<endl;\n\t}\n\n\t\n\t\n},TIME_LIMIT_EXCEEDED,12,300
1370997704180031488,8c368c592c0083612bfd9cdabe77bc2a49effc875b269792da3919d8c467bec1,2021-03-14 15:18:19,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cmath>\n#include <iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\t/*int a,b; cin >> a;\n\tb = a - 1; unsigned long long c = pow(10, b);\n\tfor (unsigned long long i = 1; i>=1; i++)\n\t{\n\t\tif (pow(i, i) >= c)\n\t\t{\n\t\t\tcout << i;\n\t\t\tbreak;\n\t\t}\n\t}*/\n\tint n,Q; cin >> n;\n\tint*p = new int[n];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> p[i];\n\t}\n\tcin >> Q; int **k = new int*[2];\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tk[i] = new int[2];\n\t}\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tfor (int j = 0; j < 2; j++)\n\t\t{\n\t\t\tcin >> k[i][j];\n\t\t}\n\t}\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long c = 1;\n\t\tfor (int j = k[i][0]; j <= k[i][1]; j++)\n\t\t{\n\t\t\tc *= p[j-1];\n\t\t}\n\t\tcout << c % (1000000000 + 7) << endl;\n\t}\n\t\n\treturn 0;\n}\n\n\n",SEGMENTATION_FAULT,4,448
1370997735721291776,83d76b932875435a8d6c1ff6ad56d32f38bc3c82e8bc710a8abcc9aa17e053e8,2021-03-14 15:18:26,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<stdint.h>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tunsigned long long n,r;\n\tcin >> n;\n\tfor (long i = 1;  i*log10(i)<n; i++)\n\t{\n\t\tr = i;\n\t\t\n\t}\n\tcout << r;\n\t\n}",WRONG_ANSWER,6,316
1370997741391990784,fe607663055571ed43227df0a2254438d6be3aef49b1d77685627d4801365903,2021-03-14 15:18:28,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tlong long x=1;\n\tint n,m[200000],i,j,q,l,r;\n\tcin>>n;\n\tfor(i=1;i<=n;i++){\n\t\tcin>>m[i];\n\t}\n\tcin>>q;\n\tfor(i=0;i<q;i++){\n\t\tcin>>l>>r;\n\t\tfor(j=l;j<=r;j++){\n\t\t\tx=x*m[j];\n\t\t\tx=x%(1000000000+7);\n\t\t}cout<<x<<endl;\n\t\tx=1;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,10,328
1370998208025088000,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:20:19,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint main()\n{\n\tint n,f,e,k=0,sum;\n\tint a[10001];\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=n;i++) scanf(\""%d\"",&a[i]);\n\tint q;\n\tscanf(\""%d\"",&q);\n\twhile(q--)\n\t{\n\t\tk++;\n\t\tscanf(\""%d%d\"",&f,&e);\n\t\tsum=a[f];\n\t\tfor(int i=f+1;i<=e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,13,468
1370998448564133888,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:21:16,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint main()\n{\n\tint n,f,e,sum;\n\tint a[10001];\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=n;i++) scanf(\""%d\"",&a[i]);\n\tint q;\n\tscanf(\""%d\"",&q);\n\twhile(q--)\n\t{\n\t\tscanf(\""%d%d\"",&f,&e);\n\t\tsum=a[f];\n\t\tfor(int i=f+1;i<=e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tprintf(\""%d\\n\"",sum);\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,26,196
1370998656282939392,8c368c592c0083612bfd9cdabe77bc2a49effc875b269792da3919d8c467bec1,2021-03-14 15:22:06,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cmath>\n#include <iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\t/*int a,b; cin >> a;\n\tb = a - 1; unsigned long long c = pow(10, b);\n\tfor (unsigned long long i = 1; i>=1; i++)\n\t{\n\t\tif (pow(i, i) >= c)\n\t\t{\n\t\t\tcout << i;\n\t\t\tbreak;\n\t\t}\n\t}*/\n\tint n,Q; cin >> n;\n\tint*p = new int[n];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> p[i];\n\t}\n\tcin >> Q; int **k = new int*[2];\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tk[i] = new int[2];\n\t}\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tfor (int j = 0; j < 2; j++)\n\t\t{\n\t\t\tcin >> k[i][j];\n\t\t}\n\t}\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long c = 1;\n\t\tfor (int j = k[i][0]-1; j <= k[i][1]-1; j++)\n\t\t{\n\t\t\tc *= p[j];\n\t\t}\n\t\tcout << c % (1000000000 + 7) << endl;\n\t}\n\t\n\treturn 0;\n}\n\n\n",SEGMENTATION_FAULT,14,412
1370998663182569472,2a218d1f332cf0ce7d74fac8feecee5eabf01c3ed0029334c70e03dc666d04d6,2021-03-14 15:22:07,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace lanqiaobei\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int zongshu = Convert.ToInt32(Console.ReadLine());\n            int[] kuang = new int[zongshu + 1];\n            string[] s = Console.ReadLine().Split(' ');\n            for (int i = 1; i <= zongshu; i++)\n            {\n                kuang[i] = Convert.ToInt32(s[i - 1]);\n            }\n            int maifa = Convert.ToInt32(Console.ReadLine());\n            int[] jiage = new int[maifa];\n            for (int i = 0; i < maifa; i++)\n            {\n                int a, b; string[] s1 = Console.ReadLine().Split(' ');\n                a = Convert.ToInt32(s1[0]); b = Convert.ToInt32(s1[1]);\n                jiage[i] = 1;\n                for (int j = a; j <= b; j++)\n                {\n                    jiage[i] *= kuang[j];\n                }\n            }\n            for (int i = 0; i < maifa; i++)\n            {\n                Console.WriteLine(jiage[i]%1000000007);\n            }\n            Console.ReadKey();\n        }\n    }\n\n}\n",TIME_LIMIT_EXCEEDED,35,3580
1370998804622888960,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:22:41,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint main()\n{\n\tlong long n,f,e,k=0,sum;\n\tint a[10001];\n\tscanf(\""%ll\"",&n);\n\tfor(int i=1;i<=n;i++) scanf(\""%d\"",&a[i]);\n\tint q;\n\tscanf(\""%ll\"",&q);\n\twhile(q--)\n\t{\n\t\tk++;\n\t\tscanf(\""%d%d\"",&f,&e);\n\t\tsum=a[f];\n\t\tfor(int i=f+1;i<=e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tprintf(\""%d\\n\"",sum%1000000007);\n\t}\n\treturn 0;\n}",WRONG_ANSWER,3,196
1370998990870958080,45198847869109fe44b809e4f7d0f40eb84c0c6dd21f3b1506c84d7be0df0077,2021-03-14 15:23:25,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace ConsoleApp3\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int a = Convert.ToInt32(Console.ReadLine());\n            string s = Console.ReadLine();\n            string[] str = s.Split(' ');\n            int[] sa = Array.ConvertAll(str, Convert.ToInt32);\n            int b= Convert.ToInt32(Console.ReadLine());\n            for (int i = 0; i < b; i++)\n            {\n                int [] c= Array.ConvertAll(Console.ReadLine ().Split (' '), Convert.ToInt32);\n                int l = c[0];\n                int r = c[1];\n                int sum=1;\n                for (int j = l; j <= r; j++)\n                {\n                    sum = sum * sa[j-1];\n                    sum = sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7);\n                }\n                Console.WriteLine(sum);\n            }\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,24,3748
1370999031433977856,818d741511846e374f0241bc47a9d2c2f4da85e76da06e9d04570c169a647860,2021-03-14 15:23:35,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,#include<iostream>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n\tint a[n];\n\tfor(int i=0;i<n;i++)\n\tcin>>a[i];\n\tint q;\n\tcin>>q;\n\tint b[q][2];\n\tfor(int i=0;i<q;i++)\n\tfor(int j=0;j<2;j++)\n\tcin>>b[i][j];\n\tunsigned long long c[q];\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tc[i]=a[b[q][0]-1];\n\t\tfor(int j=b[q][0];j<=(b[q][1]-1);j++)\n\t\t\t{\n\t\t\t\tc[i]*=a[j];\n\t\t\t}\n\t\tc[i]%=(1000000000+7);\n\t}\n\tfor(int i=0;i<q;i++)\n\tcout<<c[i]<<endl;\n\treturn 0;\n},SEGMENTATION_FAULT,4,320
1370999258744283136,1a9a3e5055ba2b5e4294c8d85590bdcebc93b9b2d19319e08187fcf295ee5c1d,2021-03-14 15:24:29,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\n#define tu 1000000007\nusing namespace std;\nint a[100005];\nint b[100005];\nint count(int c,int d){\n\tint ans=1;\n\tfor(int i=c;i<=d;i++){\n\t\tans*=a[i];\n\t}\n\treturn ans%tu;\n}\nint main(){\n\tint n,m,x,y;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t}\n\tcin>>m;\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>x>>y;\n\t\tb[i]=count(x,y);\n\t}\n\tfor(int i=1;i<=m;i++){\n\t\tcout<<b[i]<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,4,320
1370999334707322880,981fcea4af5b388931133b5df074af3636635b2ab46b3668f45141b7faa52f82,2021-03-14 15:24:47,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include <cmath>\n#include <queue>\n#include <deque>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <unordered_map>\n#include <sstream>\n#include <bitset>\n#include <unordered_set>\n#include <set>\n#include <stdio.h>\n#include <complex>\n#include <numeric>\n#include <functional>\nusing namespace std;\n\nint main()\n{\n\tint n; cin >> n;\n\tvector<long long> re(n+1,1);\n\tlong long mod = 1e+9;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> re[i];\n\t\tre[i] *= re[i - 1] % mod;\n\t}\n\tint q; cin >> q;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tcout << re[b] / re[a-1]<<endl;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",FLOAT_POINT_EXCEPTION,78,1180
1370999430555652096,e2a39aaa5e70449b6dbcc1d96d5d39eb096dc0d1b3025bf7a83e9ee36a9319fd,2021-03-14 15:25:10,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\nusing System.Collections;\n\n\nnamespace ConsoleApplication2\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int a = int.Parse(Console.ReadLine());\n            int[] b = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int c = int.Parse(Console.ReadLine());\n            int[] cost = new int[c];\n            int num = 1;\n            for(int i = 0; i < c; i++)\n            {\n                int[] e = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                for(int j = e[0]; j <= e[1]; j++)\n                {\n                    num = num * b[j-1];\n                }\n                cost[i] = num;\n                num = 1;\n            }\n            for(int i = 0; i < c; i++)\n            {\n                Console.WriteLine(cost[i]);\n            }\n            Console.ReadLine();\n\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,27,3620
1370999446284292096,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:25:14,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tunsigned long long n,f,e,sum;\n\tint a[10001];\n\tcin>>n;\n\tfor(int i=1;i<=n;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tcin>>f>>e;\n\t\tsum=a[f];\n\t\tfor(int i=f+1;i<=e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tcout<<sum%1000000007<<endl;\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1370999516085805056,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:25:31,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tunsigned long long n,f,e,sum;\n\tint a[10001];\n\tcin>>n;\n\tfor(int i=1;i<=n;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tcin>>f>>e;\n\t\tsum=a[f];\n\t\tfor(int i=f+1;i<=e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tcout<<sum%1000000007<<endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,15,308
1370999610235346944,8c368c592c0083612bfd9cdabe77bc2a49effc875b269792da3919d8c467bec1,2021-03-14 15:25:53,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cmath>\n#include <iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\t/*int a,b; cin >> a;\n\tb = a - 1; unsigned long long c = pow(10, b);\n\tfor (unsigned long long i = 1; i>=1; i++)\n\t{\n\t\tif (pow(i, i) >= c)\n\t\t{\n\t\t\tcout << i;\n\t\t\tbreak;\n\t\t}\n\t}*/\n\tint n,Q; cin >> n;\n\tint*p = new int[n];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> p[i];\n\t}\n\tcin >> Q; int **k = new int*[2];\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tint m, n; cin >> m >> n; unsigned long long c = 1;\n\t\tfor (int j = m - 1; j <= n - 1; j++)\n\t\t{\n\t\t\tc *= p[j];\n\t\t\t\n\t\t}\n\t\tcout << c % (1000000000 + 7) << endl;\n\n\t}\n\t\n\treturn 0;\n}\n\n\n",TIME_LIMIT_EXCEEDED,4,316
1370999622499491840,1a9a3e5055ba2b5e4294c8d85590bdcebc93b9b2d19319e08187fcf295ee5c1d,2021-03-14 15:25:56,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\n#define tu 1000000007\nusing namespace std;\nint a[100005];\nint b[100005];\nint count(int c,int d){\n\tint ans=1;\n\tfor(int i=c;i<=d;i++){\n\t\tans*=a[i];\n\t\tif(ans>tu){\n\t\t\tans%=tu;\n\t\t}\n\t}\n\treturn ans%tu;\n}\nint main(){\n\tint n,m,x,y;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t}\n\tcin>>m;\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>x>>y;\n\t\tb[i]=count(x,y);\n\t}\n\tfor(int i=1;i<=m;i++){\n\t\tcout<<b[i]<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,4,320
1370999713327144960,981fcea4af5b388931133b5df074af3636635b2ab46b3668f45141b7faa52f82,2021-03-14 15:26:18,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include <cmath>\n#include <queue>\n#include <deque>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <unordered_map>\n#include <sstream>\n#include <bitset>\n#include <unordered_set>\n#include <set>\n#include <stdio.h>\n#include <complex>\n#include <numeric>\n#include <functional>\nusing namespace std;\n\nint main()\n{\n\tint n; cin >> n;\n\tvector<long long> re(n+1,1);\n\tlong long mod = 1e+9;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> re[i];\n\t\tre[i] *= re[i - 1] % mod;\n\t}\n\tint q; cin >> q;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tcout << re[b] / re[a-1]<<endl;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",FLOAT_POINT_EXCEPTION,48,1216
1370999722005159936,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:26:20,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tunsigned long long n,f,e,sum;\n\tint a[10001];\n\tcin>>n;\n\tfor(int i=1;i<n+1;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tcin>>f>>e;\n\t\tsum=a[f];\n\t\tfor(int i=f+1;i<e+1;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tcout<<sum%1000000007<<endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,32,616
1370999844416016384,8c368c592c0083612bfd9cdabe77bc2a49effc875b269792da3919d8c467bec1,2021-03-14 15:26:49,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cmath>\n#include <iostream>\n\nusing namespace std;\nint main()\n{\n\t\n\tint n,Q; cin >> n;\n\tint*p = new int[n];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> p[i];\n\t}\n\tcin >> Q; int **k = new int*[2];\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tint m, n; cin >> m >> n; unsigned long long c = 1;\n\t\tfor (int j = m - 1; j <= n - 1; j++)\n\t\t{\n\t\t\tc *= p[j];\n\t\t\t\n\t\t}\n\t\tcout << c % (1000000000 + 7) << endl;\n\n\t}\n\t\n\treturn 0;\n}\n\n\n",TIME_LIMIT_EXCEEDED,12,472
1370999962645057536,981fcea4af5b388931133b5df074af3636635b2ab46b3668f45141b7faa52f82,2021-03-14 15:27:17,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include <cmath>\n#include <queue>\n#include <deque>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <unordered_map>\n#include <sstream>\n#include <bitset>\n#include <unordered_set>\n#include <set>\n#include <stdio.h>\n#include <complex>\n#include <numeric>\n#include <functional>\nusing namespace std;\n\nint main()\n{\n\tint n; cin >> n;\n\tvector<long long> re(n+1,1);\n\tlong long mod = 1e+9;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> re[i];\n\t\tif(re[i]*re[i-1]%mod!=0)re[i] *= re[i - 1] % mod;\n\t}\n\tint q; cin >> q;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tcout << re[b] / re[a-1]<<endl;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",WRONG_ANSWER,254,1592
1371000068278509568,981fcea4af5b388931133b5df074af3636635b2ab46b3668f45141b7faa52f82,2021-03-14 15:27:42,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include <cmath>\n#include <queue>\n#include <deque>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <unordered_map>\n#include <sstream>\n#include <bitset>\n#include <unordered_set>\n#include <set>\n#include <stdio.h>\n#include <complex>\n#include <numeric>\n#include <functional>\nusing namespace std;\n\nint main()\n{\n\tint n; cin >> n;\n\tvector<long long> re(n+1,1);\n\tlong long mod = 1e+9;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> re[i];\n\t\tif(re[i]*re[i-1]%mod!=0)re[i] *= re[i - 1] % mod;\n\t}\n\tint q; cin >> q;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tcout << re[b] / re[a-1]%mod<<endl;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",WRONG_ANSWER,269,1544
1371000140068311040,50b6bc0e8e6ac39ec413d4e849feade239e08b84e2b57a0cbbbe52b8a90b698d,2021-03-14 15:27:59,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace ConsoleApp4\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int count = Convert.ToInt32(Console.ReadLine());\n            UInt64[] price = new UInt64[count];\n            string s = Console.ReadLine();\n            string[] sa = s.Split(' ');\n            for (int i = 0; i < count; i++)\n            {\n                price[i] = Convert.ToUInt64(sa[i]);\n            }\n            int n = Convert.ToInt32(Console.ReadLine());\n            UInt64[] sum = new UInt64[n];\n            for (int i = 0; i < n; i++)\n            {\n                string b = Console.ReadLine();\n                string[] sb = b.Split(' ');\n                int first = Convert.ToInt32(sb[0]);\n                int last = Convert.ToInt32(sb[1]);\n                UInt64 sum1 = 1;\n                for (int j = first-1; j < last; j++)\n                {\n                    sum[i] = sum1 * price[j];\n                    sum1 = sum[i];\n                }\n            }\n            for (int i = 0; i < n; i++)\n            { \n                Console.WriteLine( \""{0}\"",sum[i] % (Math.Pow(10, 9) + 7)); \n            }\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,28,3716
1371000338077208576,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:28:47,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tunsigned long long n,f,e,sum;\n\tint a[10001];\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tcin>>f>>e;\n\t\tsum=a[f-1];\n\t\tfor(int i=f;i<e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tcout<<sum%1000000007<<endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,15,444
1371000495950811136,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:29:24,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tunsigned long long n,f,e,sum;\n\tint a[100001];\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tcin>>f>>e;\n\t\tsum=a[f-1];\n\t\tfor(int i=f;i<e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tcout<<sum%1000000007<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,7,376
1371000634996183040,33c690c6c38df772b9a0f5685c1694c4271bc8f1ced253514062579fb16f0e5c,2021-03-14 15:29:57,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nint main()\n{\n    double n,a;\n    int i=0,j,sum=1;//a为几种方法\n    cin>>n;\n    int x[n];\n    cin>>x>>a;\n    int z[2a];\n    cin>>z;\n    for(i;i<a;i+=2)\n    {\n        for(j=z[i-1];j<=z[i])\n            {\n                sum=sum*j;\n            }\n        sum=sum%(10*10*10*10*10*10*10*10*10*10+7);\n        cout<<sum;\n        sum=1;\n    }   \n}\n",COMPILE_ERROR,0,0
1371000749282578432,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:30:25,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tunsigned long long n,f,e,sum;\n\tint a[100001];\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\tfor(int j=0;j<q;j++)\n\t{\n\t\tcin>>f>>e;\n\t\tsum=a[f-1];\n\t\tfor(int i=f;i<e;i++)\n\t\t{\n\t\t\tsum*=a[i];\n\t\t}\n\t\tcout<<sum%1000000007<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,8,320
1371000778462351360,1f19cf1e0aa879bf253088d44e320f0c837c902a0444a801080af34b15210f3a,2021-03-14 15:30:32,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<iomanip>\n#include<string>\n#include<cmath>\n#include<cstdio>\nusing namespace std;\nint main()\n{\n\tint chushu = 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7;\n\tint c1 = 10 * 10 * 10 * 10 * 10;\n\tunsigned int n;\n\tcin >> n;\n\twhile (n>c1)\n\t{\n\t\tcin >> n;\n\t}\n\tint* shuzu = new int(n);\n\tfor (size_t i = 0; i <n; i++)\n\t{\n\t\tint y;\n\t\tcin >> y;\n\t\tshuzu[i] = y;\n\t\n\t}\n\tunsigned int q;\n\tcin >> q;\n\twhile (q>c1)\n\t{\n\t\tcin >> q;\n\t}\n\tint* shuzu2 = new int(q);\n\tfor (size_t i = 0; i < q; i++)\n\t{\n\t\tunsigned int l, r;\n\t\tfor (size_t z = 0; ; i++)\n\t\t{\n\t\t\tl = 0, r = 0;\n\t\t\tcin >> l >> r;\n\t\t\tif (1<=l&&l<<r&&r<<n)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tint sum=1;\n\t\tfor (size_t j = l-1; j <=r-1; j++)\n\t\t{\n\t\t\tsum *= shuzu[j];\n\t\t}\n\t\tsum = sum % chushu;\n\t\tshuzu2[i] = sum;\n\t\t\n\t}\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tcout << shuzu2[i] << endl;\n\t}\n\n\treturn 0;\n}",SEGMENTATION_FAULT,14,444
1371000796434944000,33c690c6c38df772b9a0f5685c1694c4271bc8f1ced253514062579fb16f0e5c,2021-03-14 15:30:36,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int n,a,i=0,j\n    double sum=1;//a为几种方法\n    cin>>n;\n    int x[n];\n    cin>>x>>a;\n    int z[2a];\n    cin>>z;\n    for(i;i<a;i+=2)\n    {\n        for(j=z[i-1];j<=z[i])\n            {\n                sum=sum*j;\n            }\n        sum=sum%(10*10*10*10*10*10*10*10*10*10+7);\n        cout<<sum;\n        sum=1;\n    }   \n}\n",COMPILE_ERROR,0,0
1371000966958567424,33c690c6c38df772b9a0f5685c1694c4271bc8f1ced253514062579fb16f0e5c,2021-03-14 15:31:17,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int n,a,i=0,j\n    double sum=1;//a为几种方法\n    cin>>n;\n    int x[n];\n    cin>>x>>a;\n    int z[2a];\n    cin>>z;\n    for(i;i<a;i+=2)\n    {\n        for(j=z[i-1];j<=z[i])\n            {\n                sum=sum*j;\n            }\n        sum=sum%(10*10*10*10*10*10*10*10*10*10+7);\n        cout<<sum;\n        sum=1;\n    }   \n}\n",COMPILE_ERROR,0,0
1371000979457593344,8c368c592c0083612bfd9cdabe77bc2a49effc875b269792da3919d8c467bec1,2021-03-14 15:31:20,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cmath>\n#include <iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\t/*int a,b; cin >> a;\n\tb = a - 1; unsigned long long c = pow(10, b);\n\tfor (unsigned long long i = 1; i>=1; i++)\n\t{\n\t\tif (pow(i, i) >= c)\n\t\t{\n\t\t\tcout << i;\n\t\t\tbreak;\n\t\t}\n\t}*/\n\tint n,Q; cin >> n;\n\tint*p = new int[n];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> p[i];\n\t}\n\tcin >> Q; int **k = new int*[2];\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tk[i] = new int[2];\n\t}\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tfor (int j = 0; j < 2; j++)\n\t\t{\n\t\t\tcin >> k[i][j];\n\t\t}\n\t}\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long c = 1;\n\t\tfor (int j = k[i][0]-1; j <= k[i][1]; j++)\n\t\t{\n\t\t\tc *= p[j-1];\n\t\t}\n\t\tcout << c % (1000000000 + 7) << endl;\n\t}\n\t\n\treturn 0;\n}\n\n\n",SEGMENTATION_FAULT,4,316
1371001037716381696,2a218d1f332cf0ce7d74fac8feecee5eabf01c3ed0029334c70e03dc666d04d6,2021-03-14 15:31:33,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"\n#include<bits/stdc++.h>\n#include<string>\n//#include<iobitmap>\n//#include<iostream>\n//#include<sstream>\n#include<math.h>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint main(void)\n{\n\tint kuangshu;cin>>kuangshu;\n\tint kuang[5],maifa[2],maifaa;\n\tfor(int i=0;i<kuangshu;i++){\n\t\tcin>>kuang[i];\n\t}\n\tcin>>maifaa;\n\tfor(int i=0;i<maifaa;i++){\n\t\tint a,b;cin>>a>>b;\n\t\tmaifa[i]=1;\n\t\tfor(int j=a-1;j<b;j++){\n\t\t\tmaifa[i]*=kuang[j];\n\t\t}\n\t}\n\tfor(int i=0;i<maifaa;i++){\n\t\tcout<<maifa[i]%1000000007<<endl;\n\t}\n//\tcout<<fixed<<setprecision(2)<<b;\n// cout<<setw(5)<<left<<setfill('*')(double)\n}\t\n\n\n",COMPILE_ERROR,0,0
1371001081194631168,2a218d1f332cf0ce7d74fac8feecee5eabf01c3ed0029334c70e03dc666d04d6,2021-03-14 15:31:44,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"\n#include<bits/stdc++.h>\n#include<string>\n//#include<iobitmap>\n//#include<iostream>\n//#include<sstream>\n#include<math.h>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint main(void)\n{\n\tint kuangshu;cin>>kuangshu;\n\tint kuang[5],maifa[2],maifaa;\n\tfor(int i=0;i<kuangshu;i++){\n\t\tcin>>kuang[i];\n\t}\n\tcin>>maifaa;\n\tfor(int i=0;i<maifaa;i++){\n\t\tint a,b;cin>>a>>b;\n\t\tmaifa[i]=1;\n\t\tfor(int j=a-1;j<b;j++){\n\t\t\tmaifa[i]*=kuang[j];\n\t\t}\n\t}\n\tfor(int i=0;i<maifaa;i++){\n\t\tcout<<maifa[i]%1000000007<<endl;\n\t}\n//\tcout<<fixed<<setprecision(2)<<b;\n// cout<<setw(5)<<left<<setfill('*')(double)\n}\t\n\n\n",WRONG_ANSWER,6,468
1371001215483662336,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:32:16,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tunsigned long long n,k=0,f,e,sum;\n\tint a[100001];\n\tcin>>n;\n\tfor(int i=0;i<n;i++) cin>>a[i];\n\tint q;\n\tcin>>q;\n\tstar:cin>>f>>e;\n\tsum=a[f-1];\n\tfor(int i=f;i<e;i++)\n\t{\n\t\tsum*=a[i];\n\t}\n\tcout<<sum%1000000007<<endl;\n\tk++;\n\tif(k!=q) goto star;\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,21,432
1371001311742844928,eafa24db209e3ee1028776549ca67e03e452222358f960080dd5cb21e8f51579,2021-03-14 15:32:39,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n\tint num[n];\n\tfor(int i=0;i<n;i++) cin>>num[i];\n\tint Q;\n\tcin>>Q;\n\tfor(int i=0;i<Q;i++)\n\t{\n\t\tint L=0,R=0,money=1;\n\t\tcin>>L>>R;\n\t\tfor(int i=L-1;i<=R-1;i++)\n\t\t{\n\t\t\t//cout<<num[i];\n\t\t    money*=num[i];\t\n\t\t}\n\t\tcout<<money<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,3,324
1371001524956094464,40f4b4e258d5b89ebf183ce2b451705507cd2f776726649992ceb5cad6b19a45,2021-03-14 15:33:30,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,Q,m[1000000]={0};\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>m[i];\n\t}\n\tcin>>Q;\n\tfor(int i=0;i<Q;i++)\n\t{\n\t\tint L,R,s=1;\n\t\tcin>>L>>R;\n\t\tfor(int j=L;j<=R;j++)\n\t\t{\n\t\t\ts=s*m[j-1];\n\t\t}\n\t\tcout<<s%(1000000000+7)<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,9,4284
1371001795887255552,302676f1d93b0b9ea5341903f1122dd5351359f89da3895ad7f12ee42c7dc6cb,2021-03-14 15:34:34,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace lanx\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = Convert.ToInt32(Console.ReadLine());\n            string q = Console.ReadLine();\n            int[] a = Array.ConvertAll(q.Split(' '), Convert.ToInt32);\n            int hang3= Convert.ToInt32(Console.ReadLine());\n            int []b=new int[hang3];\n            for (int i = 0; i < hang3; i++)\n            {\n                int[] num = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n                int c = num[0];\n                for (int j = num[0]; j < num[1]; j++)\n                {\n                    c = c * (j + 1);\n                }\n                b[i] = c%(1000000007);\n            }\n            for (int k = 0; k < hang3; k++)\n            {\n                Console.WriteLine(b[k]);\n            }\n\n        }\n    }\n}\n",WRONG_ANSWER,25,3604
1371001855949688832,2a218d1f332cf0ce7d74fac8feecee5eabf01c3ed0029334c70e03dc666d04d6,2021-03-14 15:34:49,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"\n#include<bits/stdc++.h>\n#include<string>\n//#include<iobitmap>\n//#include<iostream>\n//#include<sstream>\n#include<math.h>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint main(void)\n{\n\tint kuangshu;cin>>kuangshu;\n\tint kuang[5],maifa[2],maifaa;\n\tfor(int i=0;i<kuangshu;i++){\n\t\tcin>>kuang[i];\n\t}\n\tcin>>maifaa;\n\tfor(int i=0;i<maifaa;i++){\n\t\tint a,b;cin>>a>>b;\n\t\tif(a>b){int c=a;a=b;b=c;\n\t\t}\n\t\tmaifa[i]=1;\n\t\tfor(int j=a-1;j<b;j++){\n\t\t\tmaifa[i]*=kuang[j];\n\t\t}\n\t}\n\tfor(int i=0;i<maifaa;i++){\n\t\tcout<<maifa[i]%1000000007<<endl;\n\t}\n//\tcout<<fixed<<setprecision(2)<<b;\n// cout<<setw(5)<<left<<setfill('*')(double)\n}\t\n\n\n",WRONG_ANSWER,17,456
1371001869866295296,6b30bdc0f4347045639b242da3000b06163c698a174d4362c473087239cea30d,2021-03-14 15:34:52,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace loser\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            //Console.WriteLine(\""Hello World!\"");\n            int kuangshu = int.Parse(Console.ReadLine());\n            UInt64[] juzi = Array.ConvertAll(Console.ReadLine().Split(' '), UInt64.Parse);\n            UInt64 Q = Convert.ToUInt64(Console.ReadLine());\n            \n            for (UInt64 i = 0; i < Q; i++)//外循环买几次\n            {\n                UInt64 sum = 1;\n                UInt64[] num = Array.ConvertAll(Console.ReadLine().Split(' '), UInt64.Parse);\n                for (UInt64 j = num[0]-1; j < num[num.Length-1]; j++)//内循环从第几筐买到第几筐\n                {\n                    sum *= juzi[j];\n                }\n                Console.WriteLine(sum);\n            }\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,24,3620
1371003369610993664,47394a878e7daca369535698ff34fa6415f779f9b58359771e800e792ddc2662,2021-03-14 15:40:49,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<stdio.h>\n#include<stdlib.h>\nint main(void){\n\t\n\tint i;\n\tint n;//框数目\n\tint a[n+1];//n 个框子各个的橘子数目\n\tint Q;\n\tint aa[n+1],bb[n+1];//两个框 \n\t\n    scanf(\""%d\"",&n);\n    \n\tfor(i=1;i<n+1;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%d\"",&Q);\n\tfor(i=1;i<Q+1;i++){\n\t\tscanf(\""%d%d\"",&aa[i],&bb[i]);\n\t}\n\t\n\tint s[Q+1];int j;\n\tfor(i=1;i<Q+1;i++){\n\t\t\n\t\ts[i]=1;\n\t\tfor(j=aa[i];j<bb[i]+1;j++){\n\t\t\ts[i]=a[j]*s[i];\n\t\t}\n\t}\n\tfor(i=1;i<Q+1;i++){\n\t\tprintf(\""%d\"",s[i]);\n        if(i!=Q) printf(\""\\n\"");\n\t}\n\treturn 0;\n} \n\n",WRONG_ANSWER,16,188
1371004060354236416,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:43:34,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<stdio.h>\nusing namespace std;\nint main()\n{\n\tint n,k=0,i,f,e,sum,q;\n\tint a[100001];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n\tscanf(\""%d\"",&q);\n\tstar:scanf(\""%d%d\"",&f,&e);\n\tsum=a[f-1];\n\tfor(i=f;i<e;i++)\n\t{\n\t\tsum*=a[i];\n\t}\n\tprintf(\""%d\\n\"",sum%1000000007);\n\tk++;\n\tif(k!=q) goto star;\n\treturn 0;\n}",COMPILE_ERROR,0,0
1371004120307523584,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:43:48,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<stdio.h>\n\nint main()\n{\n\tint n,k=0,i,f,e,sum,q;\n\tint a[100001];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n\tscanf(\""%d\"",&q);\n\tstar:scanf(\""%d%d\"",&f,&e);\n\tsum=a[f-1];\n\tfor(i=f;i<e;i++)\n\t{\n\t\tsum*=a[i];\n\t}\n\tprintf(\""%d\\n\"",sum%1000000007);\n\tk++;\n\tif(k!=q) goto star;\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,8,320
1371004420460306432,c8079ca3612f8214380ecebe287f72c48b77df74a57b2205204693809ac4eaee,2021-03-14 15:45:00,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include <iomanip>\n#include <math.h>\nusing namespace std;\n\nunsigned long long int xx(int a);\n\nint main() \n{\n    int a,n,q,z;\n    cin>>a;\n    int ju[a];\n    for(int i=0;i<a;i++)\n    {\n\t\tcin>>ju[i];\n\t}\n\tcin>>n;\n\tint gongju=0;\n\tint ress[n];\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tress[i]=1;\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>q>>z;\n\t\tfor(int j=q-1;j<z;j++)\n\t\t{\n\t\t\tress[gongju]*=ju[j];\n\t\t}\n\t\tgongju++;\n\t}\n\t\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcout<<ress[i]<<endl;\n\t}\n\t\n\treturn 0;\n} \n",COMPILE_ERROR,0,0
1371004449841500160,c8079ca3612f8214380ecebe287f72c48b77df74a57b2205204693809ac4eaee,2021-03-14 15:45:07,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include <iomanip>\n#include <math.h>\nusing namespace std;\n\nunsigned long long int xx(int a);\n\nint main() \n{\n    int a,n,q,z;\n    cin>>a;\n    int ju[a];\n    for(int i=0;i<a;i++)\n    {\n\t\tcin>>ju[i];\n\t}\n\tcin>>n;\n\tint gongju=0;\n\tint ress[n];\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tress[i]=1;\n\t}\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>q>>z;\n\t\tfor(int j=q-1;j<z;j++)\n\t\t{\n\t\t\tress[gongju]*=ju[j];\n\t\t}\n\t\tgongju++;\n\t}\n\t\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcout<<ress[i]<<endl;\n\t}\n\t\n\treturn 0;\n} \n",TIME_LIMIT_EXCEEDED,6,312
1371004539565957120,34e4b43252a14f6c5f9490f9d98b4eb249ced0220e8053654d83f7b39884a88e,2021-03-14 15:45:28,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint a[100001];\nint n,k=0,i,f,e,sum,q;\nint main()\n{\t\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++) scanf(\""%d\"",&a[i]);\n\tscanf(\""%d\"",&q);\n\tstar:scanf(\""%d%d\"",&f,&e);\n\tsum=a[f-1];\n\tfor(i=f;i<e;i++)\n\t{\n\t\tsum*=a[i];\n\t}\n\tprintf(\""%d\\n\"",sum%1000000007);\n\tk++;\n\tif(k!=q) goto star;\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,4,184
1371004583484514304,e5d9a741f1fb8a720de1b60ed288ff2bc6394804ff75d7d118e469324d08bba5,2021-03-14 15:45:39,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint c[1000000],d[1000000],m[1000000];\nint main(){\n\tint n,Q,count=1,num=1,kk=1,temp=0,aa=1;\n\tcin>>n;\n\twhile(n){\n\t\tcin>>c[count];\n\t\tcount++;n--;\n\t}\n\tcin>>Q;\n\ttemp=Q;\n\twhile(Q){\n\t\tcin>>d[num]>>d[num+1];\n\t\tnum+=2;\n\t\tQ--;\n\t}\n\tnum=1;\n\tQ=temp;\n\twhile(Q){\n\t\tm[kk]=1;\n\t\tfor(int i=d[num],mm=d[num];i<=d[num+1];++i,++mm){\n\t\tm[kk]*=c[mm];\t\n\t\t}\n\t\tnum+=2;\n\t\tm[kk]%=1000000007;\n\t\t++kk;\n\t\tQ--; \n\t\t\n\t}\n\tQ=temp;\n\twhile(Q){\n\t\tcout<<m[aa]<<endl;\n\t\tQ--;aa++;\n\t} \n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,6,432
1371004804088221696,a4a5d1d401d6103c6ddbc030ec62a7038dca05e4e4c9517500b0a549f4f5d4d5,2021-03-14 15:46:31,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace _7_4_Rurirat给fffteam买橘子\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] ai = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q = int.Parse(Console.ReadLine());\n            string[] str = new string[Q];\n            for(int i=0;i<Q;i++)\n            {\n                str[i] = Console.ReadLine();\n            }\n            for (int i = 0; i < Q; i++)\n            {\n                int[] t = Array.ConvertAll(str[i].Split(' '), int.Parse);\n                int L = t[0], R = t[1];\n                int m = 1;\n                for(int j=L-1;j<R;j++)\n                {\n                    m *= ai[j];\n                }\n                Console.WriteLine(m % (Math.Pow(10, 9) + 7));\n            }\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,27,3740
1371005012247334912,13db8b883d87abcdcf7a45a71bd56ff4bc10063d4080889697e0f13c43c397b9,2021-03-14 15:47:21,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<math.h>\n#include<string>\nusing namespace std;\nint main(){\n\tint a;cin>>a;int s[a];\n\tfor(int i=0;i<a;i++)\n\t{\n\t\tcin>>s[i];\n\t}\n\tint tem;cin>>tem;int re[tem];\n\tfor(int i=0;i<tem;i++)\n\t{\n\t\tint x=0,y=0;re[i]=1;\n\t\tcin>>x>>y;\n\t\tfor(int j=x-1;j<y;j++)\n\t\t{\n\t\t\tre[i]*=s[j];\n\t\t\t\n\t\t}\n\t}\n\tfor(int i=0;i<tem;i++)\n\t{\n\t\tcout<<re[i]%(unsigned long long)(pow(10,9)+7)<<endl;\n\t}\n\treturn 0;\t\n}",TIME_LIMIT_EXCEEDED,6,320
1371005321547894784,13db8b883d87abcdcf7a45a71bd56ff4bc10063d4080889697e0f13c43c397b9,2021-03-14 15:48:35,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<math.h>\n#include<string>\nusing namespace std;\nint main(){\n\tint a;cin>>a;int s[a];\n\tfor(int i=0;i<a;i++)\n\t{\n\t\tcin>>s[i];\n\t}\n\tint tem;cin>>tem;int re[tem];\n\tfor(int i=0;i<tem;i++)\n\t{\n\t\tint x=0,y=0;re[i]=1;\n\t\tcin>>x>>y;\n\t\tfor(int j=x-1;j<y;j++)\n\t\t{\n\t\t\tre[i]*=s[j];\n\t\t\t\n\t\t}\n\t}\n\tfor(int i=0;i<tem;i++)\n\t{\n\t\tcout<<re[i]%(long)(pow(10,9)+7)<<endl;\n\t}\n\treturn 0;\t\n}",TIME_LIMIT_EXCEEDED,17,328
1371005371447435264,302ae5737edb7c44c6eacd636612e9e544276a6e18651a8536b48aae19ba28ef,2021-03-14 15:48:47,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<string> \nusing namespace std;\nconst int maxn =10001;\nconst int yu=1000000007;\nint sum[maxn][maxn];\nint main()\n{\n\tint n,q,l,r;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++)\n\t\tcin>>sum[i][i];\n\tfor(int i=1;i<n;i++)\n\t{\n\t\tfor(int j=1;j<n;j++)\n\t\t{\n\t\t\tl=j;\n\t\t\tr=j+i;\n\t\t\tif(r>n)\n\t\t\t\tr=n;\n\t\t\tsum[l][r]=sum[l][r-1]*sum[r][r];\n\t\t\tif(sum[l][r]>yu)\n\t\t\t\tsum[l][r]%=yu;\n\t\t}\n\t\t\n\t}\n\tcin>>q;\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tcin>>l>>r;\n\t\tcout<<sum[l][r]<<endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,38,41156
1371005422269816832,45198847869109fe44b809e4f7d0f40eb84c0c6dd21f3b1506c84d7be0df0077,2021-03-14 15:48:59,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace ConsoleApp3\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int a = Convert.ToInt32(Console.ReadLine());\n            \n            int[] sa = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n            int b = Convert.ToInt32(Console.ReadLine());\n            for (int i = 0; i < b; i++)\n            {\n                int[] c = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n                int l = c[0];\n                int r = c[1];\n                int sum = 1;\n                for (int j = l; j <= r; j++)\n                {\n                    sum = sum * sa[j - 1];\n                    sum = sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7);\n                }\n                Console.WriteLine(sum);\n            }\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,47,3724
1371005667288567808,e82da4709fea1cae36b2ec4ad480daa999e75b76466a853aada582870870e05d,2021-03-14 15:49:57,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,#include <iostream>\n#include <cstring>\n#include <string>\nusing namespace std;\nlong long a[100002];\nlong long b[100002];\nint n=0;\nint t=0;\nint l=0;\nint r=0;\nint m=0;\nint main()\n{\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>a[i];\n\t}\n\tcin>>t;\n\tfor(int j=1;j<=t;j++)\n\t{\n\t\tcin>>l>>r;\n\t\tfor(int x=l;x<=r;x++)\n\t\t{\n\t\t\tif(b[m]==0)\n\t\t\t{\n\t\t\t\tb[m]=1;\n\t\t\t    b[m]=b[m]*x;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tb[m]=b[m]*x;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tm++;\n\t}\n\tfor(int i=0;i<=m;i++)\n\t{\n\t\tcout<<b[m]/(10*10*10*10*10*10*10*10*10-7)<<endl;\n\t } \n\treturn 0;\n } ,COMPILE_ERROR,0,0
1371005775694454784,e82da4709fea1cae36b2ec4ad480daa999e75b76466a853aada582870870e05d,2021-03-14 15:50:23,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,#include <iostream>\n#include <cstring>\n#include <string>\nusing namespace std;\nlong long a[100002];\nlong long b[100002];\nint n=0;\nint t=0;\nint l=0;\nint r=0;\nint m=0;\nint main()\n{\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>a[i];\n\t}\n\tcin>>t;\n\tfor(int j=1;j<=t;j++)\n\t{\n\t\tcin>>l>>r;\n\t\tfor(int x=l;x<=r;x++)\n\t\t{\n\t\t\tif(b[m]==0)\n\t\t\t{\n\t\t\t\tb[m]=1;\n\t\t\t    b[m]=b[m]*x;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tb[m]=b[m]*x;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\tm++;\n\t}\n\tfor(int i=0;i<=m;i++)\n\t{\n\t\tcout<<b[m]/(10*10*10*10*10*10*10*10*10-7)<<endl;\n\t } \n\treturn 0;\n } ,WRONG_ANSWER,4,432
1371005815146172416,3ab517fd7475e42375bd49487f30d12f5ba90a209255c88465511a99090fb9be,2021-03-14 15:50:33,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nconst int maxn=10e+7;\nint n;\nint a[100005];\nint m;\nint sum=1;\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t}\n\tcin>>m;\n\tfor(int i=0;i<m;i++){\n\t\tsum=1;\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tfor(int j=l;j<=r;j++){\n\t\t\tsum=sum*a[j];\n\t\t\tsum=sum%maxn;\n\t\t}\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,5,452
1371005903503380480,b5996ef651c3ecd72601b1d7cfc7c4ccd7d6aa58490c347a8be22b90f85588e5,2021-03-14 15:50:54,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,#include<iostream>\n#include<cmath>\n#include<cstdio>\n#include<algorithm>\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\tint k;\n\tcin>>k;\n\tint q[k];\n\tint j[k];\n\tfor(int i=0;i<k;i++){\n\t\tcin>>q[i]>>j[i];\n\t}\n\tfor(int i=0;i<k;i++){\n\t\tint h=1;\n\t\tfor(int u=q[i]-1;u<=j[i]-1;u++){\n\t\t\th=h*a[u];\n\t\t}\n\t\tcout<<h<<endl;\n\t}\n\n\t\n\t\n},TIME_LIMIT_EXCEEDED,15,308
1371005916556054528,302ae5737edb7c44c6eacd636612e9e544276a6e18651a8536b48aae19ba28ef,2021-03-14 15:50:57,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<string> \nusing namespace std;\nconst int maxn =100001;\nconst int yu=1000000007;\nint sum[maxn][maxn];\nint main()\n{\n\tint n,q,l,r;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++)\n\t\tcin>>sum[i][i];\n\tfor(int i=1;i<n;i++)\n\t{\n\t\tfor(int j=1;j<n;j++)\n\t\t{\n\t\t\tl=j;\n\t\t\tr=j+i;\n\t\t\tif(r>n)\n\t\t\t\tr=n;\n\t\t\tsum[l][r]=sum[l][r-1]*sum[r][r];\n\t\t\tif(sum[l][r]>yu)\n\t\t\t\tsum[l][r]%=yu;\n\t\t}\n\t\t\n\t}\n\tcin>>q;\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tcin>>l>>r;\n\t\tcout<<sum[l][r]<<endl;\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1371005958218076160,c71ec6d78a24325b78ed72075b29bcc47d5c19c82eb38182c9dd81a1de2eac68,2021-03-14 15:51:07,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint ans=1;\nint a[100005];\nunsigned long long sum[100005];\nint main(){\n\tint n;\n\tcin>>n;\n\tsum[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t\tsum[i]=sum[i-1]*a[i];\n\t}\n\tint m;\n\tcin>>m;\n\tint l,r;\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>l>>r;\n\t\tcout<<(sum[r]/sum[l-1])%1000000007;\n        if(i!=m) cout<<endl;\n\t}\n\treturn 0;\n}",FLOAT_POINT_EXCEPTION,70,1604
1371005995086008320,7f6bb3e75754d370322fa02606720292013623dab98551c6a797a6a3ae98711e,2021-03-14 15:51:15,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <stdio.h>\nint main(){\n\tint a[100000];\n\tint n,b,c;\n\tint i,j;\n\tint q;\n\tint sum=1;\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%d\"",&q);\n\tfor(j=0;j<q;j++){\n\t\tscanf(\""%d %d\"",&b,&c);\n        for(i=0;i+1<=c&&i+1>=b;i++){\n\t        sum=a[i]*sum;\n        }\n        printf(\""%d\\n\"",sum);\n    }\n\treturn 0;\n}",WRONG_ANSWER,12,192
1371006064380010496,475c4005031a141d86de12945a8ae06e3762fbbd1dac63672d452ad34934f590,2021-03-14 15:51:32,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<string>\n#include<sstream>\n#include<cmath>\n#include<cstdio>\nusing namespace std;\nint main()\n{\n\tint n, q;\n\tcin >> n;\n\tunsigned long long arr[10010];\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> arr[i];\n\t}\n\tcin >> q;\n\tunsigned long long arr1[10010];\n\tunsigned long long arr2[10010];\n\tunsigned long long arr3[10010];\n\tlong long b = pow(10, 9) + 7;\n\tfor (int i = 0; i < q * 2; i++) {\n\t\tcin >> arr1[i];\n\t\tfor (int j = 0; j < q; j++) {\n\t\t\tarr2[j] = 1;\n\t\t\tlong long shou = arr1[(j + 1) * 2 - 2];\n\t\t\tlong long wei = arr1[(j + 1) * 2 - 1];\n\t\t\tfor (long long k = shou; k <= wei; k++) {\n\t\t\t\tarr2[j] *= k;\n\t\t\t}\n\t\t\tarr3[j] = arr2[j] % b;\n\t\t}\n\t}\n\tfor (int i = 0; i < q; i++) {\n\t\tcout << arr3[i] << endl;\n\t}\n\treturn 0;\n}\n\n",WRONG_ANSWER,7,448
1371006154960199680,e5d9a741f1fb8a720de1b60ed288ff2bc6394804ff75d7d118e469324d08bba5,2021-03-14 15:51:54,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint c[1000001],d[1000001],m[1000001];\nint main(){\n\tint n,Q,count=1,num=1,kk=1,temp=0,aa=1;\n\tcin>>n;\n\twhile(n){\n\t\tcin>>c[count];\n\t\tcount++;n--;\n\t}\n\tcin>>Q;\n\ttemp=Q;\n\twhile(Q){\n\t\tcin>>d[num]>>d[num+1];\n\t\tm[kk]=1;\n\t\tfor(int i=d[num],mm=d[num];i<=d[num+1];++i,++mm){\n\t\tm[kk]*=c[mm];\t\n\t\t}\n\t\tm[kk]%=1000000007;\n\t\tcout<<m[kk]<<endl;\n\t\t++kk;\n\t\tQ--;num+=2;\t\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,5,320
1371006423328641024,6cd5969c541c56d3fa9b5223fcf312fd4d791faa1b6f4fe53bd4103ddcb05375,2021-03-14 15:52:58,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace ConsoleApp1\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] arr1 =Array .ConvertAll (Console .ReadLine().Split (' '),int .Parse );\n            int q = int.Parse(Console.ReadLine());\n            int[] arr3 = new int[q];\n            \n            for (int i = 0; i < q ; i++)\n            {\n                int sum = 1;\n                int[] arr2 = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                int x = arr2[0]-1;\n                int y = arr2[1]-1;\n                for (int j=x;j<=y;j ++)\n                {\n                    sum *= arr1[j];\n                }\n                arr3[i] = sum;\n            }\n            for (int k=0;k<q ;k ++)\n            {\n                Console.WriteLine(arr3[k] % (Math.Pow(10, 9) + 7));\n               \n            }\n            Console.ReadKey();\n\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,24,3560
1371006540093870080,6cd5969c541c56d3fa9b5223fcf312fd4d791faa1b6f4fe53bd4103ddcb05375,2021-03-14 15:53:25,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace ConsoleApp1\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] arr1 =Array .ConvertAll (Console .ReadLine().Split (' '),int .Parse );\n            int q = int.Parse(Console.ReadLine());\n            int[] arr3 = new int[q];\n            \n            for (int i = 0; i < q ; i++)\n            {\n                int sum = 1;\n                int[] arr2 = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                int x = arr2[0]-1;\n                int y = arr2[1]-1;\n                for (int j=x;j<=y;j ++)\n                {\n                    sum *= arr1[j];\n                }\n                arr3[i] = sum;\n            }\n            for (int k=0;k<q ;k ++)\n            {\n                Console.WriteLine(arr3[k] % (Math.Pow(10, 9) + 7));\n               \n            }\n            Console.ReadKey();\n\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,31,3508
1371006816708218880,c71ec6d78a24325b78ed72075b29bcc47d5c19c82eb38182c9dd81a1de2eac68,2021-03-14 15:54:31,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint ans=1;\nint a[100005];\nunsigned long long sum[100005];\nint main(){\n\tint n;\n\tcin>>n;\n\tsum[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t\tsum[i]=sum[i-1]*a[i];\n\t}\n\tint m;\n\tcin>>m;\n\tint l,r;\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>l>>r;\n\t\tif(sum[l-1]==0) cout<<sum[r]%1000000007<<endl;\n\t\telse cout<<(sum[r]/sum[l-1])%1000000007;\n        if(i!=m) cout<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,398,1852
1371006849578979328,45198847869109fe44b809e4f7d0f40eb84c0c6dd21f3b1506c84d7be0df0077,2021-03-14 15:54:39,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace ConsoleApp3\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int a = Convert.ToInt32(Console.ReadLine());\n            \n            int[] sa = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n            int b = Convert.ToInt32(Console.ReadLine());\n            for (int i = 0; i < b; i++)\n            {\n                //int[] c = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n                string s = Console.ReadLine();\n                int index1 =s.IndexOf(\"" \"",0);\n                int l = Convert.ToInt32 (s.Substring(0, index1));\n                int r = Convert.ToInt32(s.Substring(index1));\n                int sum = 1;\n                for (int j = l; j <= r; j++)\n                {\n                    sum = sum * sa[j - 1];\n                    sum = sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7);\n                }\n                Console.WriteLine(sum);\n            }\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,62,3904
1371006924619177984,c71ec6d78a24325b78ed72075b29bcc47d5c19c82eb38182c9dd81a1de2eac68,2021-03-14 15:54:57,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint ans=1;\nint a[100005];\nunsigned long long sum[100005];\nint main(){\n\tint n;\n\tcin>>n;\n\tsum[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t\tsum[i]=sum[i-1]*a[i];\n\t}\n\tint m;\n\tcin>>m;\n\tint l,r;\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>l>>r;\n\t\tcout<<(sum[r]/sum[l-1])%1000000007;\n        if(i!=m) cout<<endl;\n\t}\n\treturn 0;\n}",FLOAT_POINT_EXCEPTION,74,1564
1371007015019012096,45198847869109fe44b809e4f7d0f40eb84c0c6dd21f3b1506c84d7be0df0077,2021-03-14 15:55:19,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace ConsoleApp3\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int a = Convert.ToInt32(Console.ReadLine());\n            \n            int[] sa = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n            int b = Convert.ToInt32(Console.ReadLine());\n            for (int i = 0; i < b; i++)\n            {\n                //int[] c = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n                string s = Console.ReadLine();\n                int index1 =s.IndexOf(\"" \"",0);\n                int l = Convert.ToInt32 (s.Substring(0, index1));\n                int r = Convert.ToInt32(s.Substring(index1));\n                int sum = 1;\n                for (int j = l; j <= r; j++)\n                {\n                    sum = sum * sa[j - 1];\n                   // sum = sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7);\n                }\n                Console.WriteLine(sum);\n            }\n        }\n    }\n}",TIME_LIMIT_EXCEEDED,36,4132
1371007139065552896,6cd5969c541c56d3fa9b5223fcf312fd4d791faa1b6f4fe53bd4103ddcb05375,2021-03-14 15:55:48,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace ConsoleApp1\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] arr1 =Array .ConvertAll (Console .ReadLine().Split (' '),int .Parse );\n            int q = int.Parse(Console.ReadLine());\n            int[] arr3 = new int[q];\n            for (int i = 0; i < q ; i++)\n            {\n                int sum = 1;\n                int[] arr2 = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                int x = arr2[0]-1;\n                int y = arr2[1]-1;\n                for (int j=x;j<=y;j ++)\n                {\n                    sum *= arr1[j];\n                }\n                arr3[i] = sum;\n                Console.WriteLine(arr3[i] % (Math.Pow(10, 9) + 7));\n            }\n            \n            Console.ReadKey();\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,35,3532
1371007170761908224,e2199949439213f13466d695363dca8ad73128b56b275aecd2c29f48bfe3b43b,2021-03-14 15:55:56,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace ConsoleApp2\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int d = 1,s=1;\n            int a = Convert.ToInt32(Console.ReadLine());\n            int[] b = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n            int hang = Convert.ToInt32(Console.ReadLine());\n            int[] sum1 = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n            int[] sum2 = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n            for(int i=sum1[0];i<=sum1[1];i++)\n            {\n                int c = b[i] * d;\n                d = c;\n            }\n            for (int i = sum2[0]; i <= sum2[1]; i++)\n            {\n                int c = b[i] * s;\n                s = c;\n            }\n            Console.WriteLine(d / (Math.Pow(10, 9) + 7)); Console.WriteLine(s / (Math.Pow(10, 9) + 7));\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1371007196447920128,e2199949439213f13466d695363dca8ad73128b56b275aecd2c29f48bfe3b43b,2021-03-14 15:56:02,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace ConsoleApp2\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int d = 1,s=1;\n            int a = Convert.ToInt32(Console.ReadLine());\n            int[] b = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n            int hang = Convert.ToInt32(Console.ReadLine());\n            int[] sum1 = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n            int[] sum2 = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n            for(int i=sum1[0];i<=sum1[1];i++)\n            {\n                int c = b[i] * d;\n                d = c;\n            }\n            for (int i = sum2[0]; i <= sum2[1]; i++)\n            {\n                int c = b[i] * s;\n                s = c;\n            }\n            Console.WriteLine(d / (Math.Pow(10, 9) + 7)); Console.WriteLine(s / (Math.Pow(10, 9) + 7));\n        }\n    }\n}\n",WRONG_ANSWER,55,3620
1371007281994944512,6cd5969c541c56d3fa9b5223fcf312fd4d791faa1b6f4fe53bd4103ddcb05375,2021-03-14 15:56:22,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace ConsoleApp1\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] arr1 =Array .ConvertAll (Console .ReadLine().Split (' '),int .Parse );\n            int q = int.Parse(Console.ReadLine());\n            int[] arr3 = new int[q];\n            for (int i = 0; i < q ; i++)\n            {\n                int sum = 1;\n                int[] arr2 = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                int x = arr2[0]-1;\n                int y = arr2[1]-1;\n                for (int j=x;j<=y;j ++)\n                {\n                    sum *= arr1[j];\n                }\n                arr3[i] = sum;\n                Console.WriteLine(arr3[i] % (1000000000 + 7));\n            }\n            \n            Console.ReadKey();\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,31,3688
1371007943931613184,c71ec6d78a24325b78ed72075b29bcc47d5c19c82eb38182c9dd81a1de2eac68,2021-03-14 15:59:00,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint ans=1;\nint a[100005];\nint sum[100005];\nint main(){\n\tint n;\n\tcin>>n;\n\tsum[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t\tsum[i]=sum[i-1]*a[i];\n\t}\n\tint m;\n\tcin>>m;\n\tint l,r;\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>l>>r;\n\t\tcout<<(sum[r]/sum[l-1])%1000000007;\n        if(i!=m) cout<<endl;\n\t}\n\treturn 0;\n}",FLOAT_POINT_EXCEPTION,36,1092
1371008018728636416,c71ec6d78a24325b78ed72075b29bcc47d5c19c82eb38182c9dd81a1de2eac68,2021-03-14 15:59:18,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint ans=1;\nint a[100005];\nint sum[100005];\nint main(){\n\tint n;\n\tcin>>n;\n\tsum[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t\tsum[i]=sum[i-1]*a[i];\n\t}\n\tint m;\n\tcin>>m;\n\tint l,r;\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>l>>r;\n\t\tcout<<(sum[r]/sum[l-1])%1000000007<<endl;\n\t}\n\treturn 0;\n}",FLOAT_POINT_EXCEPTION,69,1088
1371008181975048192,4f4c4c4d3a6861033709d01898dd3b87ad1a52a49ac04538ae82efd0a8a8a613,2021-03-14 15:59:57,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,k,j,i,Q,L[10001],R[10001];\n\tint a[10001],ans[10001],b[10001];\n\tfor(i=0;i<10001;i++)\n\t{\n\t\tans[i]=1;\n\t}\n\tcin>>n;//n框橘子 \n\tfor(i=1;i<=n;i++)\n\t{\n\t\tcin>>a[i];\n\t}\n\tcin>>Q;//买法 \n\tfor(i=0;i<Q;i++)\n\t{\n\t\tcin>>L[i]>>R[i];//从第几行到第几行 \n\t}\n\tfor(i=0;i<Q;i++)\n\t{\n\t\tk=R[i]-L[i];\n\t\tfor(j=0;j<k;j++)\n\t\t{\n\t\t\tb[i++]=L[j]++;\n\t\t\tans[i]*=a[b[j]];\n\t\t}\n\t\tcout<<ans[i];\n\t} \n\treturn 0;\n}",WRONG_ANSWER,5,448
1371008220843757568,c71ec6d78a24325b78ed72075b29bcc47d5c19c82eb38182c9dd81a1de2eac68,2021-03-14 16:00:06,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint ans=1;\nint a[100005];\nlong long sum[100005];\nint main(){\n\tint n;\n\tcin>>n;\n\tsum[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t\tsum[i]=sum[i-1]*a[i];\n\t\tsum[i]%=1000000007;\n\t}\n\tint m;\n\tcin>>m;\n\tint l,r;\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>l>>r;\n\t\tcout<<(sum[r]/sum[l-1])%1000000007<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,281,1852
1371008239311183872,a4a5d1d401d6103c6ddbc030ec62a7038dca05e4e4c9517500b0a549f4f5d4d5,2021-03-14 16:00:10,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace _7_4_Rurirat给fffteam买橘子\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] ai = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q = int.Parse(Console.ReadLine());\n            int[] tr = new int[2 * Q];\n            for(int i=0;i<Q;i++)\n            {\n                int[] t = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                tr[2 * i] = t[0];\n                tr[2 * i + 1] = t[1];\n            }\n            for (int i = 0; i < Q; i++)\n            {\n               \n                int L = tr[2*i], R = tr[2*i+1];\n                int m = 1;\n                for(int j=L-1;j<R;j++)\n                {\n                    m *= ai[j];\n                }\n                Console.WriteLine(m % (Math.Pow(10, 9) + 7));\n            }\n        }\n    }\n}\n\n",TIME_LIMIT_EXCEEDED,45,3720
1371008286014853120,c71ec6d78a24325b78ed72075b29bcc47d5c19c82eb38182c9dd81a1de2eac68,2021-03-14 16:00:22,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint ans=1;\nint a[100005];\nlong long sum[100005];\nint main(){\n\tint n;\n\tcin>>n;\n\tsum[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t\tsum[i]=sum[i-1]*a[i];\n\t\tsum[i]%=1000000007;\n\t}\n\tint m;\n\tcin>>m;\n\tint l,r;\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>l>>r;\n\t\tcout<<sum[r]/sum[l-1]<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,306,1704
1371008363919855616,50b6bc0e8e6ac39ec413d4e849feade239e08b84e2b57a0cbbbe52b8a90b698d,2021-03-14 16:00:40,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace ConsoleApp4\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int count = Convert.ToInt32(Console.ReadLine());\n            UInt64[] price = new UInt64[count];\n            string s = Console.ReadLine();\n            string[] sa = s.Split(' ');\n            for (int i = 0; i < count; i++)\n            {\n                price[i] = Convert.ToUInt64(sa[i]);\n            }\n            int n = Convert.ToInt32(Console.ReadLine());\n            UInt64[] sum = new UInt64[n];\n            for (int i = 0; i < n; i++)\n            {\n                string b = Console.ReadLine();\n                string[] sb = b.Split(' ');\n                int first = Convert.ToInt32(sb[0]);\n                int last = Convert.ToInt32(sb[1]);\n                UInt64 sum1 = 1;\n                for (int j = first-1; j < last; j++)\n                {\n                    sum[i] = sum1 * price[j];\n                    sum1 = sum[i];\n                }\n            }\n            for (int i = 0; i < n; i++)\n            { \n                Console.WriteLine( \""{0}\"",sum[i] % (Math.Pow(10, 9) + 7)); \n            }\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,25,3640
1371008485823107072,c71ec6d78a24325b78ed72075b29bcc47d5c19c82eb38182c9dd81a1de2eac68,2021-03-14 16:01:09,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint ans=1;\nint a[100005];\nlong long sum[100005];\nint main(){\n\tint n;\n\tcin>>n;\n\tsum[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t\tsum[i]=sum[i-1]*a[i];\n\t\tsum[i]%=1000000007;\n\t}\n\tint m;\n\tcin>>m;\n\tint l,r;\n\tfor(int i=1;i<=m;i++){\n\t\tcin>>l>>r;\n\t\tcout<<sum[r]/sum[l-1];\n\t\tif(i!=m) cout<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,262,1724
1371009188268269568,e5d9a741f1fb8a720de1b60ed288ff2bc6394804ff75d7d118e469324d08bba5,2021-03-14 16:03:57,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint c[1000001],d[1000001],m[1000001];\nint main(){\n\tint n,Q,count=1,num=1,kk=1,aa=1;\n\tcin>>n;\n\twhile(n){\n\t\tcin>>c[count];\n\t\tcount++;n--;\n\t}\n\tcin>>Q;\n\twhile(Q){\n\t\tcin>>d[num]>>d[num+1];\n\t\tm[kk]=1;\n\t\tfor(int i=d[num],mm=d[num];i<=d[num+1];++i,++mm){\n\t\tm[kk]*=c[mm];\t\n\t\t}\n\t\tm[kk]%=1000000007;\n\t\tcout<<m[kk]<<endl;\n\t\t++kk;\n\t\tQ--;num+=2;\t\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,6,312
1371009549569810432,7822fb7f59c77f0b95ceedba4ed25e87c70bb79e15763305971c80b6a98a31de,2021-03-14 16:05:23,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int ma=10e+7;\nint main()\n{\n    int a[1000000];\n    int n,t;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    \tcin>>a[i];\n    cin>>t;\n    for(int i=1;i<=t;i++)\n    {\n    \tint L,R,temp=1;\n    \tcin>>L>>R;\n    \tfor(int j=L;j<=R;j++)\n    \t{\n    \t\ttemp*=a[j];\n    \t\tif(temp>ma)temp%=ma;\n    \t}\n    }\n} ",WRONG_ANSWER,8,448
1371009605983199232,d3e761d6eb6e6d73a9e9b1026fab7cf11c040b1aa1e7118f754590e5b4d0e69e,2021-03-14 16:05:36,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cstdio>\n#include<iostream>\n#include<iomanip>\n#include<cmath>\nusing namespace std;\nint main()\n{\n    int a[100005];\n    int n;\n    int c=1000000007;\n    int q,l,r;\n    scanf(\""%d\"",&n);\n    for(int i=1;i<=n;i++)\n    {\n    \tscanf(\""%d\"",&a[i]);\n\t}\n\tcin>>q;\n\twhile(q--)\n\t{\n\t\tlong long b=1;\n\t\tscanf(\""%d%d\"",&l,&r);\n\t\tfor(int i=l;i<=r;i++)\n\t\t{\n\t\t   b*=a[i];\t\n\t\t}\n\t\tprintf(\""%d\\n\"",b%c);\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,6,316
1371009917418754048,981fcea4af5b388931133b5df074af3636635b2ab46b3668f45141b7faa52f82,2021-03-14 16:06:51,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include <cmath>\n#include <queue>\n#include <deque>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <unordered_map>\n#include <sstream>\n#include <bitset>\n#include <unordered_set>\n#include <set>\n#include <stdio.h>\n#include <complex>\n#include <numeric>\n#include <functional>\nusing namespace std;\n\nint main()\n{\n\tint n; cin >> n;\n\tvector<vector<int>> dp(n+1,vector<int>(n+1,1));\n\tlong long mod = 1e+9;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> dp[i][i];\n\t}\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tfor (int j = i+1; j <= n; j++)\n\t\t{\n\t\t\tdp[i][j] = dp[i][j - 1] * dp[j][j]%mod;\n\t\t}\n\t}\n\tint q;\n\tcin >> q;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tint a, b; cin >> a >> b;\n\t\tcout << dp[a][b]<<endl;\n\t}\n\tsystem(\""pause\"");\n\treturn 0;\n}",MEMORY_LIMIT_EXCEEDED,6,696
1371010561630199808,332f00779c035b035d6902a947f5e876e476268e805f9565d99c0fb8f4cf7ca0,2021-03-14 16:09:24,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cmath>\n#include <iomanip>\n#include<cstdio>\n#include<cstdlib> \n#define num 12\nusing namespace std;\nint main()\n{\nint a,q[100000];\ncin>>a;\n\tfor(int i=0;i<a;i++)\n\t{\n\t\tcin>>q[i];}\n\t\tint b;\n\t\tcin>>b;\n\t\tint s[100000][2];\n\t\tfor(int i=0;i<b;i++)\n\t\t{\n\t\t\tfor(int j=0;j<2;j++)\n\t\t\t{\n\t\t\t\tcin>>s[i][j];\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<b;i++)\n\t\t{int z=1;\n\t\t\tfor(int j=s[i][0]-1;j<s[i][1];j++)\n\t\t\t{\n\t\t\t\tz*=q[j];\n\t\t\t}\n\t\t\tcout<<z<<endl;\n\t\t}\n\treturn 0;\n}\n\n\n\t\n\t\n \n ",TIME_LIMIT_EXCEEDED,6,300
1371011059741642752,13c0a63bbdfa7f4ba48ad24d0bc04623f78e027babaeb83e0af274cc5585b223,2021-03-14 16:11:23,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\nusing namespace std;\n\nunsigned long long mi(unsigned long long j,int a)\n{\n\tunsigned long long m=j;\n\tfor(int i=1;i<a;i++){\n\t\tm=m*j;\n\t}\n\treturn m;\n}\n\nint main()\n{\n\tint n;\n\tcin>>n;\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\tint q;\n\tcin>>q;\n\tunsigned int b[q];\n\tfor(int i=0;i<q;i++){\n\t\tb[i]=1;\n\t}\n\tfor(int i=0;i<q;i++){\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tl--;\n\t\tfor(int j=l;j<r;j++){\n\t\t\tb[i]*=a[j];\n\t\t}\n\t}\n    unsigned int d=mi(10,9)+7;\n\tfor(int i=0;i<q;i++){\n\t\tb[i]=b[i]%d;\n\t}\n\tfor(int i=0;i<q;i++){\n\t\tcout<<b[i]<<endl;\n\t}\n\t\n\t\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,6,432
1371011185507753984,e5d9a741f1fb8a720de1b60ed288ff2bc6394804ff75d7d118e469324d08bba5,2021-03-14 16:11:53,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint c[100001],d[100001],m[100001];\nint main(){\n\tint n,Q,num=1,kk=1;\n\tcin>>n;\n\tfor(int i=1;i<=n;++i){\n\t\tcin>>c[i];\n\t}\n\tcin>>Q;\n\tfor(int i=1;i<=Q;++i,num+=2){\n\t\tcin>>d[num]>>d[num+1];\n\t\tm[kk]=1;\n\t\tfor(int j=d[num];j<=d[num+1];++j){\n\t\tm[kk]*=c[j];\t\n\t\t}\t\n\t\tm[kk]%=1000000007;\n\t\tcout<<m[kk]<<endl;\n\t\t++kk;\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,4,324
1371011240776192000,13c0a63bbdfa7f4ba48ad24d0bc04623f78e027babaeb83e0af274cc5585b223,2021-03-14 16:12:06,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\nusing namespace std;\n\nunsigned long long mi(unsigned long long j,int a)\n{\n\tunsigned long long m=j;\n\tfor(int i=1;i<a;i++){\n\t\tm=m*j;\n\t}\n\treturn m;\n}\n\nint main()\n{\n\tint n;\n\tcin>>n;\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\tint q;\n\tcin>>q;\n\tunsigned int b[q];\n\tfor(int i=0;i<q;i++){\n\t\tb[i]=1;\n\t}\n\tfor(int i=0;i<q;i++){\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tl--;\n\t\tfor(int j=l;j<r;j++){\n\t\t\tb[i]*=a[j];\n\t\t}\n\t}\n    unsigned int d=mi(10,9)+7;\n\tfor(int i=0;i<q;i++){\n\t\tb[i]=b[i]%d;\n\t}\n\tfor(int i=0;i<(q-1);i++){\n\t\tcout<<b[i]<<endl;\n\t}\n\tcout<<b[q-1];\n\t\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,11,448
1371011296434511872,7822fb7f59c77f0b95ceedba4ed25e87c70bb79e15763305971c80b6a98a31de,2021-03-14 16:12:19,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint ma=1000000000+7;\n    int a[100001];\n    int n,t;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    \tcin>>a[i];\n    cin>>t;\n    for(int i=1;i<=t;i++)\n    {\n    \tint L,R,temp=1;\n    \tcin>>L>>R;\n    \tfor(int j=L;j<=R;j++)\n    \t{\n    \t\ttemp*=a[j];\n    \t\tif(temp>ma)temp%=ma;\n    \t}\n    \tcout<<temp<<endl;\n    }\n    return 0;\n} ",TIME_LIMIT_EXCEEDED,6,300
1371011745589944320,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-03-14 16:14:06,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint yu=1e9+7;\nint main()\n{\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n int m;cin>>m;int l,r;int jia=1;\n while(m--)\n {\n \tscanf(\""%d%d\"",&l,&r);\n \tjia=(a[l-1]%yu);\n \tfor(int i=l;i<=r-1;i++) jia=(jia%yu)*(a[i]%yu);\n \tprintf(\""%d\\n\"",jia);\n }\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,5,448
1371011960636104704,332f00779c035b035d6902a947f5e876e476268e805f9565d99c0fb8f4cf7ca0,2021-03-14 16:14:58,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cmath>\n#include <iomanip>\n#include<cstdio>\n#include<cstdlib> \n#define num 12\nusing namespace std;\nint main()\n{\nunsigned long long a,q[100000];\ncin>>a;\n\tfor(int i=0;i<a;i++)\n\t{\n\t\tcin>>q[i];}\n\t\tint b;\n\t\tcin>>b;\n\t\tint s[100000][2];\n\t\tfor(int i=0;i<b;i++)\n\t\t{\n\t\t\tfor(int j=0;j<2;j++)\n\t\t\t{\n\t\t\t\tcin>>s[i][j];\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<b;i++)\n\t\t{unsigned long long z=1;\n\t\t\tfor(int j=s[i][0]-1;j<s[i][1];j++)\n\t\t\t{\n\t\t\t\tz*=q[j];\n\t\t\t}\n\t\t\tz=z%(1000000000+7);\n\t\t\tcout<<z<<endl;\n\t\t}\n\treturn 0;\n}\n\n\n\t\n\t\n \n ",TIME_LIMIT_EXCEEDED,12,340
1371012106258239488,f681fb56800625452e852b74b1575730462f15f99840b5cb014e484778a825f9,2021-03-14 16:15:32,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint main()\n{\n\tint n,i,j;\n\tscanf(\""%d\"",&n);\n\tint a[n];\n\tfor(i=0;i<n;i++){\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tint q;\n\tscanf(\""%d\"",&q);\n\tint b[q][2];\n\tfor(i=0;i<q;i++){\n\t\tscanf(\""%d%d\"",&b[i][1],&b[i][2]);\n\t\tb[i][1]--;\n\t\tb[i][2]--;\n\t}\n\tint sum=1;\n\tfor(i=0;i<q;i++){\n\t\tsum=1;\n\t\tif(b[i][1]==b[i][2]){\n\t\t\tprintf(\""%d\"",a[b[i][1]]);\n\t\t\tcontinue;\n\t\t}\n\t\tfor(j=b[i][1];j<b[i][2]+1;j++){\n\t\t\tif(sum>=1000000007){\n\t\t\t\tsum%=1000000007;\t\n\t\t\t}\n\t\t\tsum*=a[j];\n\t\t}\n\t\tif(sum>=1000000007){\n\t\t\tsum%=1000000007;\t\n\t\t}\n\t\tprintf(\""%d\\n\"",sum); \n\t\t\n\t} \n\t\n\treturn 0;\n}",PRESENTATION_ERROR,8,196
1371012198440652800,faeb7f8ba203284fd21845ab4fa07c06ef999774047d770d3df66121fc671c8c,2021-03-14 16:15:54,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<std.h>\nint main()\n{\n    printf(\""victor \"")；\n    return 0;\n}",COMPILE_ERROR,0,0
1371012321648332800,50b6bc0e8e6ac39ec413d4e849feade239e08b84e2b57a0cbbbe52b8a90b698d,2021-03-14 16:16:24,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace ConsoleApp4\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int count = Convert.ToInt32(Console.ReadLine());\n            UInt64[] price = new UInt64[count];\n            string s = Console.ReadLine();\n            string[] sa = s.Split(' ');\n            for (int i = 0; i < count; i++)\n            {\n                price[i] = Convert.ToUInt64(sa[i]);\n            }\n            int n = Convert.ToInt32(Console.ReadLine());\n            UInt64[] sum = new UInt64[n];\n            for (int i = 0; i < n; i++)\n            {\n                string b = Console.ReadLine();\n                string[] sb = b.Split(' ');\n                int first = Convert.ToInt32(sb[0]);\n                int last = Convert.ToInt32(sb[1]);\n                UInt64 sum1 = 1;\n                for (int j = first-1; j < last; j++)\n                {\n                    sum[i] = sum1 * price[j];\n                    sum1 = sum[i];\n                }\n            }\n            for (int i = 0; i < n; i++)\n            { \n                Console.WriteLine( \""{0}\"",sum[i] % (Math.Pow(10, 9) + 7)); \n            }\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,32,3720
1371012535259947008,c71ec6d78a24325b78ed72075b29bcc47d5c19c82eb38182c9dd81a1de2eac68,2021-03-14 16:17:15,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<cmath>\nusing namespace std;\nint ans=1;\nint a[100005];\nint cmp(int l,int r){\n\tif(l==r){\n\t\treturn a[l];\n\t}else{\n\t\tint mid=(l+r)>>1;\n\t\treturn (cmp(mid+1,r)*cmp(l,mid))%1000000007;\n\t}\n}\nint read(){\n\tint x=0,f=1;\n\tchar ch=getchar();\n\twhile(ch<'0'||ch>'9'){\n\t\tif(ch=='-') f=-1;\n        ch=getchar();\n\t}\n\twhile(ch>='0'&&ch<='9'){\n\t\tx=x*10+(ch-'0');\n\t\tch=getchar();\n\t}\n\treturn x*f;\n}\nint main(){\n\tint n;\n\tn=read();\n\tfor(int i=1;i<=n;i++){\n\t\ta[i]=read();\n\t}\n\tint m;\n\tm=read();\n\tint l,r;\n\tfor(int i=1;i<=m;i++){\n\t\tl=read();\n\t\tr=read();\n\t\tcout<<cmp(l,r);\n\t\tif(i!=m) cout<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,15,304
1371012604600180736,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-03-14 16:17:31,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint yu=1e9+7;\nint main()\n{\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n int m;cin>>m;int l,r;int jia=1;\n while(m--)\n {\n \tcin>>l>>r;\n \tjia=a[l-1]%yu;\n \tfor(int i=l;i<=r-1;i++) jia=(jia%yu)*(a[i]%yu);\n \tprintf(\""%d\\n\"",jia);\n }\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,14,320
1371013154486112256,7822fb7f59c77f0b95ceedba4ed25e87c70bb79e15763305971c80b6a98a31de,2021-03-14 16:19:42,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint ma=1000000000+7;\n    int a[100001];\n    int L,R,n,t,temp,j,k;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    \tcin>>a[i];\n    cin>>t;\n    for(int i=1;i<=t;i++)\n    {\n    \ttemp=1;\n    \tcin>>L>>R;\n    \tfor(j=L,k=R;j<=k;j++,k--)\n    \t{\n    \t\ttemp*=a[j]*a[k];\n    \t\tif(temp>ma)temp%=ma;\n    \t}\n    \ttemp/=a[k+1];\n    \tif(temp>ma)temp%=ma;\n    \tcout<<temp<<endl;\n    }\n    return 0;\n} ",WRONG_ANSWER,5,444
1371013604153249792,df9d710aabf23d433adc122b4c2a118036a9136fb0ddd33f6d8f2bff79c6c972,2021-03-14 16:21:30,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n;\n\tscanf(\""%d\"", &n);\n\tint a[100];\n\tfor (size_t i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\tint Q;\n\tcin >> Q;\n\tfor (size_t i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long m=1;\n\t\tint L, R;\n\t\tscanf(\""%d\"", &L);\n\t\tscanf(\""%d\"", &R);\n\t\tfor (size_t i = L-1; i <= R-1; i++)\n\t\t{\n\t\t\tm = a[i] * m;\n\t\t}\n\t\tunsigned long long x;\n\t\tx = m % (100000000 + 7);\n\t\tcout << x;\n\t}\n\treturn 0;\n}",PRESENTATION_ERROR,12,320
1371013721581084672,df9d710aabf23d433adc122b4c2a118036a9136fb0ddd33f6d8f2bff79c6c972,2021-03-14 16:21:58,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n;\n\tscanf(\""%d\"", &n);\n\tint a[100];\n\tfor (size_t i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\tint Q;\n\tcin >> Q;\n\tfor (size_t i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long m=1;\n\t\tint L, R;\n\t\tscanf(\""%d\"", &L);\n\t\tscanf(\""%d\"", &R);\n\t\tfor (size_t i = L-1; i <= R-1; i++)\n\t\t{\n\t\t\tm = a[i] * m;\n\t\t}\n\t\tunsigned long long x;\n\t\tx = m % (100000000 + 7);\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,9,420
1371014412152360960,e5d9a741f1fb8a720de1b60ed288ff2bc6394804ff75d7d118e469324d08bba5,2021-03-14 16:24:42,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint c[1001],d[1001],m[1001];\nint main(){\n\tint n,Q,num=1,kk=1;\n\tcin>>n;\n\tfor(int i=1;i<=n;++i){\n\t\tcin>>c[i];\n\t}\n\tcin>>Q;\n\tfor(int i=1;i<=Q;++i,num+=2){\n\t\tcin>>d[num]>>d[num+1];\n\t\tm[kk]=1;\n\t\tfor(int j=d[num];j<=d[num+1];++j){\n\t\tm[kk]*=c[j];\t\n\t\t}\t\n\t\tm[kk]%=1000000007;\n\t\tcout<<m[kk]<<endl;\n\t\t++kk;\n\t}\n\treturn 0;\n} ",SEGMENTATION_FAULT,11,444
1371014522923835392,df9d710aabf23d433adc122b4c2a118036a9136fb0ddd33f6d8f2bff79c6c972,2021-03-14 16:25:09,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;//scanf_s(\""%d\"", &n);\n\tint a[100];\n\tfor (size_t i = 0; i < n; i++)\n\t{\n\t\tcin >> a[i];//scanf_s(\""%d\"", &a[i]);\n\t}\n\tint Q;\n\tcin >> Q;\n\tfor (size_t i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long m=1;\n\t\tint L, R;\n\t\tcin >> L;//scanf_s(\""%d\"", &L);\n\t\tcin >> R;// scanf_s(\""%d\"", &R);\n\t\tfor (size_t i = L-1; i <= R-1; i++)\n\t\t{\n\t\t\tm = a[i] * m;\n\t\t}\n\t\tunsigned long long x;\n\t\tx = m % (100000000 + 7);\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,11,320
1371014525205536768,e5d9a741f1fb8a720de1b60ed288ff2bc6394804ff75d7d118e469324d08bba5,2021-03-14 16:25:09,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint c[100001],d[100001],m[100001];\nint main(){\n\tint n,Q,num=1,kk=1;\n\tcin>>n;\n\tfor(int i=1;i<=n;++i){\n\t\tcin>>c[i];\n\t}\n\tcin>>Q;\n\tfor(int i=1;i<=Q;++i,num+=2){\n\t\tcin>>d[num]>>d[num+1];\n\t\tm[kk]=1;\n\t\tfor(int j=d[num];j<=d[num+1];++j){\n\t\tm[kk]*=c[j];\t\n\t\t}\t\n\t\tm[kk]%=1000000007;\n\t\tcout<<m[kk]<<endl;\n\t\t++kk;\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,4,316
1371014627139801088,df9d710aabf23d433adc122b4c2a118036a9136fb0ddd33f6d8f2bff79c6c972,2021-03-14 16:25:33,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;//scanf_s(\""%d\"", &n);\n\tint a[1000];\n\tfor (size_t i = 0; i < n; i++)\n\t{\n\t\tcin >> a[i];//scanf_s(\""%d\"", &a[i]);\n\t}\n\tint Q;\n\tcin >> Q;\n\tfor (size_t i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long m=1;\n\t\tint L, R;\n\t\tcin >> L;//scanf_s(\""%d\"", &L);\n\t\tcin >> R;// scanf_s(\""%d\"", &R);\n\t\tfor (size_t i = L-1; i <= R-1; i++)\n\t\t{\n\t\t\tm = a[i] * m;\n\t\t}\n\t\tunsigned long long x;\n\t\tx = m % (100000000 + 7);\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,26,476
1371014659301724160,df9d710aabf23d433adc122b4c2a118036a9136fb0ddd33f6d8f2bff79c6c972,2021-03-14 16:25:41,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;//scanf_s(\""%d\"", &n);\n\tint a[100000000];\n\tfor (size_t i = 0; i < n; i++)\n\t{\n\t\tcin >> a[i];//scanf_s(\""%d\"", &a[i]);\n\t}\n\tint Q;\n\tcin >> Q;\n\tfor (size_t i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long m=1;\n\t\tint L, R;\n\t\tcin >> L;//scanf_s(\""%d\"", &L);\n\t\tcin >> R;// scanf_s(\""%d\"", &R);\n\t\tfor (size_t i = L-1; i <= R-1; i++)\n\t\t{\n\t\t\tm = a[i] * m;\n\t\t}\n\t\tunsigned long long x;\n\t\tx = m % (100000000 + 7);\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,5,312
1371014817657577472,df9d710aabf23d433adc122b4c2a118036a9136fb0ddd33f6d8f2bff79c6c972,2021-03-14 16:26:19,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<math.h>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;//scanf_s(\""%d\"", &n);\n\tint a[10000];\n\tfor (size_t i = 0; i < n; i++)\n\t{\n\t\tcin >> a[i];//scanf_s(\""%d\"", &a[i]);\n\t}\n\tint Q;\n\tcin >> Q;\n\tfor (size_t i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long m=1;\n\t\tint L, R;\n\t\tcin >> L;//scanf_s(\""%d\"", &L);\n\t\tcin >> R;// scanf_s(\""%d\"", &R);\n\t\tfor (size_t i = L-1; i <= R-1; i++)\n\t\t{\n\t\t\tm = a[i] * m;\n\t\t}\n\t\tunsigned long long x;\n\t\tx = m % (100000000 + 7);\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,11,444
1371014898494398464,e5d9a741f1fb8a720de1b60ed288ff2bc6394804ff75d7d118e469324d08bba5,2021-03-14 16:26:38,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint c[100001],d[100001],m[100001];\nint main(){\n\tint n,Q,num=1,kk=1;\n\tcin>>n;\n\tfor(int i=1;i<=n;++i){\n\t\tcin>>c[i];\n\t}\n\tcin>>Q;\n\tfor(int i=1;i<=Q;++i,num+=2){\n\t\tcin>>d[num]>>d[num+1];\n\t}\n\n\treturn 0;\n} ",WRONG_ANSWER,4,436
1371015292935135232,27519715840f60be1dfab8eaeaed73942d47f671be97b4c89b2a550f772759a3,2021-03-14 16:28:12,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n  int a[100000],b[100000],c[100000];int i;\n    int n;\n    cin>>n;\n    for(i=0;i<n;i++)\n    {\n        cin>>a[i];\n    }\n    int x;\n    cin>>x;\n    for(i=0;i<x;i++)\n    {\n        cin>>b[i]>>c[i];\n    }\n    int j,sum=1;\n    for(i=0;i<x;i++)\n    {\n        for(j=b[i]-1;j<=c[i]-1;j++)\n        {\n            sum=sum*a[j];\n        }\n        cout<<sum%(1000000000+7)<<endl;\n        sum=1;\n    }\n}",TIME_LIMIT_EXCEEDED,6,300
1371015325428502528,7822fb7f59c77f0b95ceedba4ed25e87c70bb79e15763305971c80b6a98a31de,2021-03-14 16:28:20,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint ma=1000000000+7;\n    int a[100001];\n    int L,R,n,t,temp,j,k;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    \tcin>>a[i];\n    cin>>t;\n    for(int i=1;i<=t;i++)\n    {\n    \ttemp=1;\n    \tcin>>L>>R;\n    \tfor(j=L,k=R;j<=k;j++,k--)\n    \t{\n    \t\ttemp*=a[j]*a[k];\n    \t\tif(temp>ma)temp%=ma;\n    \t}\n    \tif((L-R)%2==0)temp/=a[k+1];\n    \tif(temp>ma)temp%=ma;\n    \tcout<<temp<<endl;\n    }\n    return 0;\n} ",TIME_LIMIT_EXCEEDED,5,316
1371015782192402432,e5d9a741f1fb8a720de1b60ed288ff2bc6394804ff75d7d118e469324d08bba5,2021-03-14 16:30:09,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint c[100001],d[100001],m[100001];\nint main(){\n\tint n,Q,num=1;\n\tcin>>n;\n\tfor(int i=1;i<=n;++i){\n\t\tcin>>c[i];\n\t}\n\tcin>>Q;\n\tfor(int i=1;i<=Q;++i,num+=2){\n\t\tcin>>d[num]>>d[num+1];\n\t\tfor(int j=d[num];j<=d[num+1];++j){\n\t\tm[i]*=c[j];\n\t\tm[i]%=1000000007;\t\n\t\tcout<<m[i]<<endl;\n\t}\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,14,428
1371015857035563008,c118514b9494c219ce92d2176fb3e7a2095835e5de0066e8d43db71c7f5bc672,2021-03-14 16:30:27,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\nusing namespace std;\nint b[100050];\nint a;\n\tint c;\nint main()\n{\n\tcin>>a;\t\n\tfor(int i=1;i<=a;i++)\n\t{\n\t\tscanf(\""%d\"",&b[i]);\n\t}\n\tcin>>c;\n\tfor(int i=1;i<=c;i++)\n\t{\n\t\tint long long  d,e,num=1;\n\t\tcin>>d>>e;\n\t\tfor(int j=d;j<=e;j++)\n\t\t{\n\t\t\tnum=(num*b[j])%100000007;\n            \n\t\t}\n\t\tcout<<num<<endl;\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,6,324
1371016203434647552,2a218d1f332cf0ce7d74fac8feecee5eabf01c3ed0029334c70e03dc666d04d6,2021-03-14 16:31:49,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"\n#include<bits/stdc++.h>\n#include<string>\n//#include<iobitmap>\n//#include<iostream>\n//#include<sstream>\n#include<math.h>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint main(void)\n{\n\tint kuangshu;cin>>kuangshu;\n\tint kuang[5],maifa[2],maifaa;\n\tfor(int i=0;i<kuangshu;i++){\n\t\tcin>>kuang[i];\n\t}\n\tcin>>maifaa;\n\tfor(int i=0;i<maifaa;i++){\n\t\tint a,b;cin>>a>>b;\n\t\tif(a>b){int c=a;a=b;b=c;\n\t\t}\n\t\tmaifa[i]=1;\n\t\tfor(int j=a-1;j<b;j++){\n\t\t\tmaifa[i]*=kuang[j];\n\t\t}\n\t}\n\tfor(int i=0;i<maifaa;i++){\n\t\tcout<<maifa[i]%1000000007<<endl;\n\t}\n\n}\t\n\n\n",WRONG_ANSWER,7,324
1371016296061657088,3ab517fd7475e42375bd49487f30d12f5ba90a209255c88465511a99090fb9be,2021-03-14 16:32:11,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nconst int maxn=1000000007;\nint n;\nint a[100005];\nint m;\nlong long sum=1;\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t\t\n\t}\n\tcin>>m;\n\tfor(int i=0;i<m;i++){\n\t\tsum=1;\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tfor(int j=l;j<=r;j++){\n\t\t\tsum=sum*a[j];\n\t\t\tif(sum>maxn)\n\t\t\t\tsum=sum%maxn;\n\t\t}\n\t\tcout<<sum;\n\t\tif(i!=m-1) cout<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,6,316
1371016721074675712,e5d9a741f1fb8a720de1b60ed288ff2bc6394804ff75d7d118e469324d08bba5,2021-03-14 16:33:53,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint c[100001],d[100001],m[100001];\nint main(){\n\tint n,Q,num=1;\n\tcin>>n;\n\tfor(int i=1;i<=n;++i){\n\t\tcin>>c[i];\n\t}\n\tcin>>Q;\n\tfor(int i=1;i<=Q;++i,num+=2){\n\t\tm[i]=1;\n\t\tcin>>d[num]>>d[num+1];\n\t\tfor(int j=d[num];j<=d[num+1];++j){\n\t\tm[i]*=c[j];\n\t\tm[i]%=1000000007;\t\n\t\t}\n\tcout<<m[i]<<endl;\n\t}\n\treturn 0;\n} ",TIME_LIMIT_EXCEEDED,6,412
1371016737717768192,df9d710aabf23d433adc122b4c2a118036a9136fb0ddd33f6d8f2bff79c6c972,2021-03-14 16:33:57,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;//scanf_s(\""%d\"", &n);\n\tint a[1000];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tscanf_s(\""%d\"", &a[i]);\n\t}\n\tint Q;\n\tcin >> Q;\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long m=1;\n\t\tint L, R;\n\t\tscanf_s(\""%d\"", &L);\n\t\tscanf_s(\""%d\"", &R);\n\t\tfor (int i = L-1; i <= R-1; i++)\n\t\t{\n\t\t\tm = a[i] * m;\n\t\t}\n\t\tunsigned int x;\n\t\tx = m % (100000000 + 7);\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1371016905145995264,df9d710aabf23d433adc122b4c2a118036a9136fb0ddd33f6d8f2bff79c6c972,2021-03-14 16:34:37,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\nusing namespace std;\nint main()\n{\n\tint n;\n\tcin >> n;//scanf_s(\""%d\"", &n);\n\tint a[1000];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tscanf(\""%d\"", &a[i]);\n\t}\n\tint Q;\n\tcin >> Q;\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long m=1;\n\t\tint L, R;\n\t\tscanf(\""%d\"", &L);\n\t\tscanf(\""%d\"", &R);\n\t\tfor (int i = L-1; i <= R-1; i++)\n\t\t{\n\t\t\tm = a[i] * m;\n\t\t}\n\t\tunsigned int x;\n\t\tx = m % (100000000 + 7);\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",SEGMENTATION_FAULT,46,440
1371017404398194688,8c368c592c0083612bfd9cdabe77bc2a49effc875b269792da3919d8c467bec1,2021-03-14 16:36:36,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cmath>\n#include <iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\t/*int a,b; cin >> a;\n\tb = a - 1; unsigned long long c = pow(10, b);\n\tfor (unsigned long long i = 1; i>=1; i++)\n\t{\n\t\tif (pow(i, i) >= c)\n\t\t{\n\t\t\tcout << i;\n\t\t\tbreak;\n\t\t}\n\t}*/\n\tint n,Q; cin >> n;\n\tint*p = new int[n];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> p[i];\n\t}\n\tcin >> Q; \n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tunsigned long long c = 1;\n\t\tint m, n; cin >> m >> n;\n\t\tfor (int j = m - 1; j <= n - 1; j++)\n\t\t{\n\t\t\tc *= p[j];\n\t\t}\n\t\tcout << c % (1000000000 + 7)<<endl;\n\t}\n\t/*int n; cin >> n; int **p =new int *[2];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tp[i] = new int[2];\n\t}\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tfor (int j = 0; j < 2; j++)\n\t\t{\n\t\t\tcin >> p[i][j];\n\t\t}\n\t}*/\n\t/*int t; cin >> t; unsigned long long *p = new unsigned long long[t];\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\tcin >> p[i];\n\t}\n\tfor(int i=0;i<t;i++)\n\t{\n\t\tunsigned long long n =p[i]*p[i];\n\t\tint a = p[i] % 10;\n\t\tif (a == 1)\n\t\t{\n\t\t\tcout << 1 << endl;\n\t\t}\n\t\telse if (a == 5)\n\t\t{\n\t\t\tcout << 5 << endl;\n\t\t}\n\t\telse if (a == 6)\n\t\t{\n\t\t\tcout << 6 << endl;\n\t\t}\n\t\telse if (a == 0)\n\t\t{\n\t\t\tcout << 0 << endl;\n\t\t}\n\t\telse if (a == 2)\n\t\t{\n\t\t\tint b = n % 4;\n\t\t\tif (b == 1)\n\t\t\t{\n\t\t\t\tcout << 2 << endl;\n\t\t\t}\n\t\t\telse if (b == 2)\n\t\t\t{\n\t\t\t\tcout << 4 << endl;\n\t\t\t}\n\t\t\telse if (b == 3)\n\t\t\t{\n\t\t\t\tcout << 8<< endl;\n\t\t\t}\n\t\t\telse if (b==0)\n\t\t\t{\n\t\t\t\tcout << 6 << endl;\n\t\t\t}\n\t\t}\n\t\telse if (a == 3)\n\t\t{\n\t\t\tint b = n % 4;\n\t\t\tif (b==1)\n\t\t\t{\n\t\t\t\tcout << 3 << endl;\n\t\t\t}\n\t\t\telse if (b == 2)\n\t\t\t{\n\t\t\t\tcout << 9 << endl;\n\t\t\t}\n\t\t\telse if (b == 3)\n\t\t\t{\n\t\t\t\tcout << 7<< endl;\n\t\t\t}\n\t\t\telse if (b==0)\n\t\t\t{\n\t\t\t\tcout << 1 << endl;\n\t\t\t}\n\t\t}\n\t\telse if (a == 4)\n\t\t{\n\t\t\tint b = n % 2;\n\t\t\tif (b == 1)\n\t\t\t{\n\t\t\t\tcout << 4 << endl;\n\t\t\t}\n\t\t\telse if(b==0)\n\t\t\t{\n\t\t\t\tcout << 6 << endl;\n\t\t\t}\n\t\t}\n\t\telse if (a == 7)\n\t\t{\n\t\t\tint b = n % 4;\n\t\t\tif (b == 1)\n\t\t\t{\n\t\t\t\tcout << 7 << endl;\n\t\t\t}\n\t\t\telse if (b == 2)\n\t\t\t{\n\t\t\t\tcout << 9 << endl;\n\t\t\t}\n\t\t\telse if (b == 3)\n\t\t\t{\n\t\t\t\tcout << 3 << endl;\n\t\t\t}\n\t\t\telse if (b == 0)\n\t\t\t{\n\t\t\t\tcout << 1 << endl;\n\t\t\t}\n\t\t}\n\t\telse if (a == 8)\n\t\t{\n\t\t\tint b = n % 4;\n\t\t\tif (b == 1)\n\t\t\t{\n\t\t\t\tcout << 8 << endl;\n\t\t\t}\n\t\t\telse if (b == 2)\n\t\t\t{\n\t\t\t\tcout << 4 << endl;\n\t\t\t}\n\t\t\telse if (b == 3)\n\t\t\t{\n\t\t\t\tcout << 2 << endl;\n\t\t\t}\n\t\t\telse if (b == 0)\n\t\t\t{\n\t\t\t\tcout << 6 << endl;\n\t\t\t}\n\t\t}\n\t\telse if (a == 9)\n\t\t{\n\t\t\tint b = n % 2;\n\t\t\tif (b == 1)\n\t\t\t{\n\t\t\t\tcout << 9 << endl;\n\n\t\t\t}\n\t\t\telse if (b == 0)\n\t\t\t{\n\t\t\t\tcout << 1 << endl;\n\t\t\t}\n\t\t}\n\t}*/\n/*int n; cin >> n;\nint **p = new int *[2];\nfor (int i = 0; i < n; i++)\n{\n\tp[i] = new int[2];\n}\nfor (int i = 0; i < n; i++)\n{\n\tfor (int j = 0; j < 2; j++)\n\t{\n\t\tcin >> p[i][j];\n\t}\n}\n*/\n\n\treturn 0;\n}\n\n\n",TIME_LIMIT_EXCEEDED,17,452
1371017414791585792,e5fd69e644b3d48ae051efca395aae6e74522626fccc66b8b2d023d530057b48,2021-03-14 16:36:38,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<bits/stdc++.h>\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\nusing namespace std;\nint main(int argc, char** argv) {\n  long long m=1;\n  for(int i=0;i<9;i++)\n  {\n  \tm*=10;\n  }\n  m+=7;\n  int n;cin>>n;\n  for(int i=0;i<n;i++)\n   {\n   \tint a;cin>>a;\n   }\n   int Q;cin>>Q;\n   unsigned long long daan[Q][2];\n   for(int i=0;i<Q;i++)\n   {\n   \tfor(int j=0;j<2;j++)\n   \t{\n   \t\tcin>>daan[i][j];\n   \t}\n   }\n   for(int i=0;i<Q;i++)\n   {\n   \t if(i<Q-1)\n   \t  {\n   \t  unsigned long long sum=1;\n   \t  for(unsigned long long j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum%m<<endl;\n     }\n     else\n     {\n     \t unsigned long long sum=1;\n   \t  for(int j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum%m;\n     }\n     \n   }\n}",WRONG_ANSWER,6,436
1371017723656032256,e5fd69e644b3d48ae051efca395aae6e74522626fccc66b8b2d023d530057b48,2021-03-14 16:37:52,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<bits/stdc++.h>\n/* run this program using the console pauser or add your own getch, system(\""pause\"") or input loop */\nusing namespace std;\nint main(int argc, char** argv) {\n  long long m=1;\n  for(int i=0;i<9;i++)\n  {\n  \tm*=10;\n  }\n  m+=7;\n  int n;cin>>n;\n  for(int i=0;i<n;i++)\n   {\n   \tint a;cin>>a;\n   }\n   int Q;cin>>Q;\n   unsigned long long daan[Q][2];\n   for(int i=0;i<Q;i++)\n   {\n   \tfor(int j=0;j<2;j++)\n   \t{\n   \t\tcin>>daan[i][j];\n   \t}\n   }\n   for(int i=0;i<Q;i++)\n   {\n   \t if(i<Q-1)\n   \t  {\n   \t  unsigned long long sum=1;\n   \t  for(unsigned long long j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum%m<<endl;\n     }\n     else\n     {\n     \t unsigned long long sum=1;\n   \t  for(unsigned long long j=daan[i][0];j<=daan[i][1];j++)\n   \t  {\n   \t  \tsum*=j;\n   \t  }\n   \t  cout<<sum%m;\n     }    \n   }\n}",WRONG_ANSWER,4,428
1371017889574215680,26965cd22105427d3f0fe06022990e8b69f4e3d6813c4be810acb61ce66e0d92,2021-03-14 16:38:31,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main() {\n\tcout << \""hello world\""<< endl;\n\n\tsystem(\""pause\"");\n\n\treturn 0;\n}\n",WRONG_ANSWER,4,572
1371018071607009280,8c368c592c0083612bfd9cdabe77bc2a49effc875b269792da3919d8c467bec1,2021-03-14 16:39:15,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<cmath>\n#include <iostream>\n#include<string>\nusing namespace std;\nint main()\n{\n\t/*int a,b; cin >> a;\n\tb = a - 1; unsigned long long c = pow(10, b);\n\tfor (unsigned long long i = 1; i>=1; i++)\n\t{\n\t\tif (pow(i, i) >= c)\n\t\t{\n\t\t\tcout << i;\n\t\t\tbreak;\n\t\t}\n\t}*/\n\tint n,Q; cin >> n;\n\tint*p = new int[n];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> p[i];\n\t}\n\tcin >> Q; unsigned long long *c = new unsigned long long[Q];\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tc[i] = 1;\n\t\tint m, n; cin >> m >> n;\n\t\tfor (int j = m - 1; j <= n - 1; j++)\n\t\t{\n\t\t\tc[i] *= p[j];\n\t\t}\n\t}\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tcout << c[i] % (1000000000 + 7) << endl;\n\t}\n\t/*int n; cin >> n; int **p =new int *[2];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tp[i] = new int[2];\n\t}\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tfor (int j = 0; j < 2; j++)\n\t\t{\n\t\t\tcin >> p[i][j];\n\t\t}\n\t}*/\n\t/*int t; cin >> t; unsigned long long *p = new unsigned long long[t];\n\tfor (int i = 0; i < t; i++)\n\t{\n\t\tcin >> p[i];\n\t}\n\tfor(int i=0;i<t;i++)\n\t{\n\t\tunsigned long long n =p[i]*p[i];\n\t\tint a = p[i] % 10;\n\t\tif (a == 1)\n\t\t{\n\t\t\tcout << 1 << endl;\n\t\t}\n\t\telse if (a == 5)\n\t\t{\n\t\t\tcout << 5 << endl;\n\t\t}\n\t\telse if (a == 6)\n\t\t{\n\t\t\tcout << 6 << endl;\n\t\t}\n\t\telse if (a == 0)\n\t\t{\n\t\t\tcout << 0 << endl;\n\t\t}\n\t\telse if (a == 2)\n\t\t{\n\t\t\tint b = n % 4;\n\t\t\tif (b == 1)\n\t\t\t{\n\t\t\t\tcout << 2 << endl;\n\t\t\t}\n\t\t\telse if (b == 2)\n\t\t\t{\n\t\t\t\tcout << 4 << endl;\n\t\t\t}\n\t\t\telse if (b == 3)\n\t\t\t{\n\t\t\t\tcout << 8<< endl;\n\t\t\t}\n\t\t\telse if (b==0)\n\t\t\t{\n\t\t\t\tcout << 6 << endl;\n\t\t\t}\n\t\t}\n\t\telse if (a == 3)\n\t\t{\n\t\t\tint b = n % 4;\n\t\t\tif (b==1)\n\t\t\t{\n\t\t\t\tcout << 3 << endl;\n\t\t\t}\n\t\t\telse if (b == 2)\n\t\t\t{\n\t\t\t\tcout << 9 << endl;\n\t\t\t}\n\t\t\telse if (b == 3)\n\t\t\t{\n\t\t\t\tcout << 7<< endl;\n\t\t\t}\n\t\t\telse if (b==0)\n\t\t\t{\n\t\t\t\tcout << 1 << endl;\n\t\t\t}\n\t\t}\n\t\telse if (a == 4)\n\t\t{\n\t\t\tint b = n % 2;\n\t\t\tif (b == 1)\n\t\t\t{\n\t\t\t\tcout << 4 << endl;\n\t\t\t}\n\t\t\telse if(b==0)\n\t\t\t{\n\t\t\t\tcout << 6 << endl;\n\t\t\t}\n\t\t}\n\t\telse if (a == 7)\n\t\t{\n\t\t\tint b = n % 4;\n\t\t\tif (b == 1)\n\t\t\t{\n\t\t\t\tcout << 7 << endl;\n\t\t\t}\n\t\t\telse if (b == 2)\n\t\t\t{\n\t\t\t\tcout << 9 << endl;\n\t\t\t}\n\t\t\telse if (b == 3)\n\t\t\t{\n\t\t\t\tcout << 3 << endl;\n\t\t\t}\n\t\t\telse if (b == 0)\n\t\t\t{\n\t\t\t\tcout << 1 << endl;\n\t\t\t}\n\t\t}\n\t\telse if (a == 8)\n\t\t{\n\t\t\tint b = n % 4;\n\t\t\tif (b == 1)\n\t\t\t{\n\t\t\t\tcout << 8 << endl;\n\t\t\t}\n\t\t\telse if (b == 2)\n\t\t\t{\n\t\t\t\tcout << 4 << endl;\n\t\t\t}\n\t\t\telse if (b == 3)\n\t\t\t{\n\t\t\t\tcout << 2 << endl;\n\t\t\t}\n\t\t\telse if (b == 0)\n\t\t\t{\n\t\t\t\tcout << 6 << endl;\n\t\t\t}\n\t\t}\n\t\telse if (a == 9)\n\t\t{\n\t\t\tint b = n % 2;\n\t\t\tif (b == 1)\n\t\t\t{\n\t\t\t\tcout << 9 << endl;\n\n\t\t\t}\n\t\t\telse if (b == 0)\n\t\t\t{\n\t\t\t\tcout << 1 << endl;\n\t\t\t}\n\t\t}\n\t}*/\n/*int n; cin >> n;\nint **p = new int *[2];\nfor (int i = 0; i < n; i++)\n{\n\tp[i] = new int[2];\n}\nfor (int i = 0; i < n; i++)\n{\n\tfor (int j = 0; j < 2; j++)\n\t{\n\t\tcin >> p[i][j];\n\t}\n}\n*/\n\n\treturn 0;\n}\n\n\n",TIME_LIMIT_EXCEEDED,4,452
1371018453427179520,40f4b4e258d5b89ebf183ce2b451705507cd2f776726649992ceb5cad6b19a45,2021-03-14 16:40:46,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,Q,m[1000000]={0};\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>m[i];\n\t}\n\tcin>>Q;\n\tfor(int i=0;i<Q;i++)\n\t{\n\t\tint L,R,s=1;\n\t\tcin>>L>>R;\n\t\tfor(int j=L;j<=R;j++)\n\t\t{\n\t\t\ts=s*m[j-1];\n\t\t}\n\t\tcout<<s%(1000000000+7)<<endl;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,9,4288
1371018812925169664,fedc3a638fa116fe29661076f8a4e1daf4cef785aeb9b888e4c29ac71e973c19,2021-03-14 16:42:11,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,using System;\n\nnamespace 竞赛\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = Convert.ToInt32(Console.ReadLine());\n            string str = Console.ReadLine();\n            string[] A = str.Split(' ');\n            int m = Convert.ToInt32(Console.ReadLine());\n            string[] B = new string[m];\n            for (int i = 0; i < m; i++)\n            {\n                B[i] = Console.ReadLine();\n            }\n            for (int i = 0; i < m; i++)\n            {\n                UInt64 sum = 1;\n                UInt64 jieguo;\n                string[] a = B[i].Split(' ');\n                int b = Convert.ToInt32(a[0]);\n                int c = Convert.ToInt32(a[1]);\n                for (int j = b; j <= c; j++)\n                {\n                    UInt64 d = Convert.ToUInt64(A[j - 1]);\n                    sum = sum * d;\n                }\n                jieguo = sum % (1000000000 + 7);\n                Console.WriteLine(jieguo);\n            }\n        }    \n    }\n}\n,TIME_LIMIT_EXCEEDED,36,3600
1371018884588953600,ffd2532a0e4601a4682efbe1bb83b4eaaa9f3efaaa02e5c3948a9fd0d8920e7b,2021-03-14 16:42:29,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace 蓝桥杯\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = Convert.ToInt32(Console.ReadLine());\n            UInt64[] a = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToUInt64);\n            int q = Convert.ToInt32(Console.ReadLine());\n            UInt64 money = 1;\n            for(int i = 1;i <= q;i++)\n            {\n                string sa = Console.ReadLine();\n                int w = Convert.ToInt32(sa.IndexOf(\"" \"", 0));\n                int l = Convert.ToInt32(sa.Substring(0, w));\n                int r = Convert.ToInt32(sa.Substring(w));    \n                for( ;l <= r;l++)\n                {\n                    money *= a[l - 1];\n                }\n                money = money / (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7);\n                Console.WriteLine(money);\n            }\n        }\n    }\n}\n",WRONG_ANSWER,35,3996
1371019317940342784,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-03-14 16:44:12,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint yu=1e9+7;\nint main()\n{\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n int m;cin>>m;int l,r;int jia=1;\n while(m--)\n {\n \tscanf(\""%d %d\"",&l,&r);\n \t//jia=(a[l-1]%yu)*(a[r-1]%yu);\n \tfor(int i=l-1;i<=r-1;i++) jia=jia*(a[i]%yu);\n \tprintf(\""%d\\n\"",jia);\n }\n return 0;\n}\n",WRONG_ANSWER,4,324
1371019477718065152,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-03-14 16:44:50,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint yu=1e9+7;\nint main()\n{\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n int m;cin>>m;int l,r;int jia=1;\n while(m--)\n {\n \tscanf(\""%d%d\"",&l,&r);\n \t//jia=(a[l-1]%yu)*(a[r-1]%yu);\n \tfor(int i=l-1;i<=r-1;i++) jia=jia*(a[i]%yu);\n \tprintf(\""%d\\n\"",jia);\n }\n return 0;\n}\n",WRONG_ANSWER,4,592
1371019742479310848,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-03-14 16:45:53,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint yu=1e9+7;\nint main()\n{\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n int m;cin>>m;int l,r;int jia=1;\n while(m--)\n {\n \tcin>>l>>r;\n \t//jia=a[l-1]%yu;\n \tfor(int i=l;i<=r-1;i++) jia=(jia*a[i])%yu;\n \tprintf(\""%d\\n\"",jia);\n }\n return 0;\n}\n",WRONG_ANSWER,13,456
1371019831662891008,e82da4709fea1cae36b2ec4ad480daa999e75b76466a853aada582870870e05d,2021-03-14 16:46:14,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,#include <iostream>\n#include <cstring>\n#include <string>\nusing namespace std;\nlong long a[100002];\nlong long b[100002];\nint n=0;\nint t=0;\nint l=0;\nint r=0;\nint m=0;\nint main()\n{\n\tcin>>n;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>a[i];\n\t}\n\tcin>>t;\n\tfor(int j=1;j<=t;j++)\n\t{\n\t\tcin>>l>>r;\n\t\tfor(int x=l;x<=r;x++)\n\t\t{\n\t\t\tif(b[m]==0)\n\t\t\t{\n\t\t\t\tb[m]=1;\n\t\t\t    b[m]=b[m]*x;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tb[m]=b[m]*x;\n\t\t\t}\n\t\t\tm++;\n\t\t}\n\t\t\n\t}\n\tfor(int i=0;i<=m;i++)\n\t{\n\t\tcout<<b[m]/(10*10*10*10*10*10*10*10*10-7)<<endl;\n\t } \n\treturn 0;\n } ,WRONG_ANSWER,11,320
1371019978887061504,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-03-14 16:46:49,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint yu=1e9+7;\nint main()\n{\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n int m;cin>>m;int l,r;int jia=1;\n while(m--)\n {\n \tcin>>l>>r;\n \t//jia=a[l-1]%yu;\n \tfor(int i=l-1;i<=r-1;i++) jia=(jia*a[i])%yu;\n \tprintf(\""%d\\n\"",jia);\n     jia=1;\n }\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,35,444
1371020118548996096,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-03-14 16:47:23,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint yu=1e9+7;\nint main()\n{\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n int m;cin>>m;int l,r;int jia=1;\n while(m--)\n {\n \tcin>>l>>r;\n \t//jia=a[l-1]%yu;\n \tfor(int i=l-1;i<=r-1;i++) jia=jia*a[i];\n \tprintf(\""%d\\n\"",jia%yu);\n     jia=1;\n }\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,15,312
1371020308848762880,43112248ceaa8e186b7fe7deeab5b882d46b6b1226fc1028598c2a4332d9429d,2021-03-14 16:48:08,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<math.h>\nusing namespace std;\n\nint main()\n{\n\tint a,b[a],c;\n\tcin>>a;\n\tint i=0;\n\twhile (i<a){\n\t\tcin>>b[i];\n\t\ti=i+1;\n\t}\n\tcin>>c;\n\tint q[c],w[c];\n\tint u=0;\n\twhile(u<c){\n\t\tcin>>q[u],w[u];\n\t\t\n\t\tu=u+1;\n\t}\n\tint o=0;\n\tdouble y;\n\twhile(q[0]<w[0]){\n\t\ty =b[q[o]]*b[q[o+1]];\n\t\tq[0]=q[0]+1;\n\t}\n\t\n\t\n\tcout<<y;\n\treturn 0;\n } ",WRONG_ANSWER,9,444
1371020712382844928,2d3d1ac739e322f39e1c223c5fd877eaef3ebcfd64b88032ecf63df46b71fcea,2021-03-14 16:49:44,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <stdio.h>\nint main() {\n    int n,i;\n    scanf(\""%d\"",&n);\n    for(i=1;i<=n;i++){\n        scanf(\""%d\"",&n);\n    }\n    return 0;\n}",WRONG_ANSWER,5,384
1371020771023409152,302676f1d93b0b9ea5341903f1122dd5351359f89da3895ad7f12ee42c7dc6cb,2021-03-14 16:49:58,C#,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"using System;\n\nnamespace lanx\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            //int n =Convert.ToInt32( Console.ReadLine());\n            //int[] a = new int[n];\n            //int[] b = new int[n];\n            //for (int i = 0; i < n; i++)\n            //{\n            //    int d = 1;\n            //    a[i] = Convert.ToInt32(Console.ReadLine());\n            //    int c =a[i];\n            //    for (int j = 1; j < a[i]; j++)\n            //    {\n            //        c = c * a[i];\n            //         d = c * c;\n            //    }\n             \n            //    int num = d % 10;\n            //    b[i] = num;\n            //}\n            //for (int i = 0; i < n; i++)\n            //{\n            //    Console.WriteLine(b[i]);\n            //}\n            int n = Convert.ToInt32(Console.ReadLine());\n            string q = Console.ReadLine();\n            int[] a = Array.ConvertAll(q.Split(' '), Convert.ToInt32);\n            int hang3 = Convert.ToInt32(Console.ReadLine());\n            int[] b = new int[hang3];\n            for (int i = 0; i < hang3; i++)\n            {\n                int[] num = Array.ConvertAll(Console.ReadLine().Split(' '), Convert.ToInt32);\n                int c = a[num[0]-1];\n                for (int j = num[0]; j < num[1]; j++)\n                {\n                    c = c * (a[j]);\n                }\n                b[i] = c % (1000000007);\n            }\n            for (int k = 0; k < hang3; k++)\n            {\n                Console.WriteLine(b[k]);\n            }\n\n\n\n\n\n\n\n        }\n    }\n}\n",TIME_LIMIT_EXCEEDED,52,3736
1371020818876223488,2d3d1ac739e322f39e1c223c5fd877eaef3ebcfd64b88032ecf63df46b71fcea,2021-03-14 16:50:10,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <stdio.h>\nint main() {\n    int n,i;\n    scanf(\""%d\\n\"",&n);\n    for(i=1;i<=n;i++){\n        scanf(\""%d\\t\"",&n);\n    }\n    return 0;\n}",WRONG_ANSWER,11,192
1371021295344869376,fe607663055571ed43227df0a2254438d6be3aef49b1d77685627d4801365903,2021-03-14 16:52:03,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tlong long x=1;\n\tint n,m[200000],i,j,q,l,r;\n\tcin>>n;\n\tfor(i=1;i<=n;i++){\n\t\tcin>>m[i];\n\t}\n\tcin>>q;\n\tfor(i=0;i<q;i++){\n\t\tcin>>l>>r;\n\t\tfor(j=l;j<=r;j++){\n\t\t\tx=x*m[j];\n        }\n        x=x%(1000000000+7);\n\t\tcout<<x<<endl;\n\t\tx=1;\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,10,452
1371021628188057600,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-03-14 16:53:23,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint yu=1e9+7;\nint main()\n{\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n int m;cin>>m;int l,r;int jia=1;\n while(m--)\n {\n \tcin>>l>>r;\n \t//jia=a[l-1]%yu;\n     if(l==r) \n     {\n       printf(\""%d\\n\"",a[l]%yu);\n     }\n     else \n     {\n         for(int i=l-1;i<=r-1;i++) jia=jia*a[i];\n \t      printf(\""%d\\n\"",jia%yu);\n     }\n \t\n     jia=1;\n }\n return 0;\n}\n",WRONG_ANSWER,6,444
1371021714288730112,2d3d1ac739e322f39e1c223c5fd877eaef3ebcfd64b88032ecf63df46b71fcea,2021-03-14 16:53:43,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <stdio.h>\nint main() {\n    int n,i,l,r;\n    scanf(\""%d\\n\"",&n);\n    for(i=1;i<=n;i++){\n        scanf(\""%d\\t\"",&n);\n    }\n    scanf(\""%d\\t\"",&l);\n    scanf(\""%d\"",&r);\n    \n    return 0;\n}",WRONG_ANSWER,3,192
1371021850083516416,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-03-14 16:54:16,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nint yu=1e9+7;\nint main()\n{\n int n;cin>>n;\n int a[n];\n for(int i=0;i<n;i++) cin>>a[i];\n int m;cin>>m;int l,r;int jia=1;\n while(m--)\n {\n \tcin>>l>>r;\n \t//jia=a[l-1]%yu;\n     if(l==r) \n     {\n       printf(\""%d\\n\"",a[l-1]%yu);\n     }\n     else \n     {\n         for(int i=l-1;i<=r-1;i++) jia=jia*a[i];\n \t      printf(\""%d\\n\"",jia%yu);\n     }\n \t\n     jia=1;\n }\n return 0;\n}\n",TIME_LIMIT_EXCEEDED,5,444
1371021954983059456,b2dfc9a48e2a0ff6789b6bd751e1a77da42c4c1db72c65cae0d97218bee8053a,2021-03-14 16:54:41,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstring>\n#include<string>\nusing namespace std;\nint main()\n{\n\tint a[10002];\n\tint n ,Q, L, R,i,sum=1;\n\tcin >> n;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tcin >> a[i];\n\t}\n\tcin >> Q;\n\twhile(Q--)\n\t{\n\t\tcin >> L >> R;\n\t\tfor(i=L-1;i<R;i++)\n\t\t{\n\t\t\tsum *= a[i];\n\t\t}\n\t\tsum%=1000000007;\n\t\tcout << sum << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,9,316
1371022753679298560,3459e309da33fd9a8a5760a40bc21d57475ae56c65f837a5ab543b0141afe6ed,2021-03-14 16:57:51,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint n,q,o,p,i,u,j=0,s=1,t=0;\n\tint a[n];\n\tscanf(\""%d\"",&n);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%d\"",&q);\n\tint b[q][2];\n\tfor(i=0;i<q;i++)\n\t{\n\t\tfor(u=0;u<2;u++)\n\t\t{\n\t\t\tscanf(\""%d\"",&b[i][u]);\n\t\t}\n\t}\n\tfor(i=0;i<q;i++)\n\t{\n\t\twhile(j<(b[i][1]-b[i][0]+1))\n\t\t{\n\t\t\ts=s*(b[i][1]-t);\n\t\t\tt++;\n\t\t\tj++;\n\t\t}\n\t\ts=s%(int)(pow(10,9)+7);\n\t\tprintf(\""%d\\n\"",s);\n\t\ts=1;\n\t}\n\treturn 0;\n}",RUNTIME_ERROR,13,316
1371022765259677696,4f4c4c4d3a6861033709d01898dd3b87ad1a52a49ac04538ae82efd0a8a8a613,2021-03-14 16:57:54,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,k,j,i,Q,L[10001],R[10001];\n\tint a[10001],ans[10001],b[10001];\n\tfor(i=0;i<10001;i++)\n\t{\n\t\tans[i]=1;\n\t}\n\tcin>>n;//n框橘子 \n\tfor(i=1;i<=n;i++)\n\t{\n\t\tcin>>a[i];\n\t}\n\tcin>>Q;//买法 \n\tfor(i=0;i<Q;i++)\n\t{\n\t\tcin>>L[i]>>R[i];//从第几行到第几行 \n\t}\n\tfor(i=0;i<Q;i++)\n\t{\n\t\tk=R[i]-L[i];\n\t\tfor(j=0;j<k;j++)\n\t\t{\n\t\t\tb[j]=L[i]++;\n\t\t\tans[i]*=a[b[j]];\n\t\t}\n\t\tcout<<ans[i]%(1000000000+7);\n\t} \n\treturn 0;\n}",WRONG_ANSWER,16,440
1371022976862314496,2d3d1ac739e322f39e1c223c5fd877eaef3ebcfd64b88032ecf63df46b71fcea,2021-03-14 16:58:44,C,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <stdio.h>\nint main() {\n    int a[];\n    int n,i,l,r,m;\n    int k=1;\n    scanf(\""%d\\n\"",&n);\n    for(i=1;i<=n;i++){\n        m=i-1;\n        scanf(\""%d\\t\"",&a[m]);\n    }\n    scanf(\""%d\\t\"",&l);\n    scanf(\""%d\"",&r);\n    for(i=l;i<=r;i++){\n         m=i-1;\n        k=k*a[m];\n    }\n    printf(\""%d\"",k)\n    return 0;\n}",COMPILE_ERROR,0,0
1371023187986894848,4f4c4c4d3a6861033709d01898dd3b87ad1a52a49ac04538ae82efd0a8a8a613,2021-03-14 16:59:35,C++,0.0,1370908192859172867,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,k,j,i,Q,L[10001],R[10001];\n\tint a[10001],ans[10001],b[10001];\n\tfor(i=0;i<10001;i++)\n\t{\n\t\tans[i]=1;\n\t}\n\tcin>>n;//n框橘子 \n\tfor(i=1;i<=n;i++)\n\t{\n\t\tcin>>a[i];\n\t}\n\tcin>>Q;//买法 \n\tfor(i=0;i<Q;i++)\n\t{\n\t\tcin>>L[i]>>R[i];//从第几行到第几行 \n\t}\n\tfor(i=0;i<Q;i++)\n\t{\n\t\tk=R[i]-L[i];\n\t\tfor(j=0;j<k;j++)\n\t\t{\n\t\t\tb[j]=L[i]++;\n\t\t\tans[i]*=a[b[j]];\n\t\t}\n\t\tcout<<ans[i]%(1000000000+7)<<endl;\n\t} \n\treturn 0;\n}",WRONG_ANSWER,4,320
1373116610626113536,f58cb2e473a60037ddc155624aa84cc7705e3e2ab7038dd44cae909f11bc2e85,2021-03-20 11:38:05,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint main()\n{\n    int n,a[80],b[80][80];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    scanf(\""%d\"",&x);\n     for(i=0;i<x;i++)\n    for(j=0;j<2;j++)\n        scanf(\""%d\"",&b[i][j]);\n     for(i=0;i<x;i++){\n         for(p=b[i][0];p<=b[i][1];P++)\n             n=n+a[p];\n         printf(\""%d\"",n%(10*10*10*10*10*10*10*10*10-7));\n     }\n    return 0;\n}",COMPILE_ERROR,0,0
1373116789496430592,f58cb2e473a60037ddc155624aa84cc7705e3e2ab7038dd44cae909f11bc2e85,2021-03-20 11:38:48,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint main()\n{\n    int i,j,x,n,a[80],b[80][80];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    scanf(\""%d\"",&x);\n     for(i=0;i<x;i++)\n    for(j=0;j<2;j++)\n        scanf(\""%d\"",&b[i][j]);\n     for(i=0;i<x;i++){\n         for(int p=b[i][0];p<=b[i][1];P++)\n             n=n+a[p];\n         printf(\""%d\"",n%(10*10*10*10*10*10*10*10*10-7));\n     }\n    return 0;\n}",COMPILE_ERROR,0,0
1373116943750348800,f58cb2e473a60037ddc155624aa84cc7705e3e2ab7038dd44cae909f11bc2e85,2021-03-20 11:39:25,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint main()\n{\n    int i,j,x,n,a[80],b[80][80];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    scanf(\""%d\"",&x);\n     for(i=0;i<x;i++)\n    for(j=0;j<2;j++)\n        scanf(\""%d\"",&b[i][j]);\n     for(i=0;i<x;i++){\n         for(int p=b[i][0];p<=b[i][1];p++)\n             n=n+a[p];\n         printf(\""%d\"",n%(10*10*10*10*10*10*10*10*10-7));\n     }\n    return 0;\n}",WRONG_ANSWER,6,468
1373117023450484736,f58cb2e473a60037ddc155624aa84cc7705e3e2ab7038dd44cae909f11bc2e85,2021-03-20 11:39:44,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint main()\n{\n    int i,j,x,n,a[80],b[80][80];\n    scanf(\""%d\"",&n);\n    for(i=0;i<n;i++)\n        scanf(\""%d\"",&a[i]);\n    scanf(\""%d\"",&x);\n     for(i=0;i<x;i++)\n    for(j=0;j<2;j++)\n        scanf(\""%d\"",&b[i][j]);\n     for(i=0;i<x;i++){\n         for(int p=b[i][0];p<=b[i][1];p++)\n             n=n+a[p];\n         printf(\""%d\\n\"",n%(10*10*10*10*10*10*10*10*10-7));\n     }\n    return 0;\n}",WRONG_ANSWER,13,320
1373118451548082176,a3330cd1c994f3c6c10bdab766d18a19caf82e77257d52273bd510da8df74fc3,2021-03-20 11:45:24,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include <stdio.h>\nint main()\n{\n\tint a[10000],n,x,b[10000],i,e,f,j;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%d\"",&x);\n\tfor(i=0;i<x;i++)\n\t{\n\t\tscanf(\""%d %d\"",&e,&f);\n\t\tb[i]=1;\n\t\tfor(j=e;j<=f;j++)\n\t\t{\n\t\t\tb[i]=b[i]*a[j];\n\t\t}\n\t}\n\tfor(i=0;i<x;i++)\n\t\tprintf(\""%d\\n\"",b[i]);\n\treturn 0;\n}\n",SEGMENTATION_FAULT,43,320
1373118713771773952,a3330cd1c994f3c6c10bdab766d18a19caf82e77257d52273bd510da8df74fc3,2021-03-20 11:46:27,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include <stdio.h>\nint main()\n{\n\tint a[10000],n,x,b[10000],i,e,f,j;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%d\"",&x);\n\tfor(i=0;i<x;i++)\n\t{\n\t\tscanf(\""%d %d\"",&e,&f);\n\t\tb[i]=1;\n\t\tfor(j=e;j<=f;j++)\n\t\t{\n\t\t\tb[i]=b[i]*a[j];\n\t\t}\n\t}\n\tfor(i=0;i<x;i++)\n\t\tprintf(\""%d\\n\"",b[i]);\n\treturn 0;\n}\n",SEGMENTATION_FAULT,11,324
1373118842520158208,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 11:46:58,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    int a[100009];\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int q;\n    int l[100009],r[100009];\n    scanf(\""%d\"",&q);\n    for(int i=0;i<q;i++)\n    {\n        scanf(\""%d %d\"",&l[i],&r[i]);\n    }\n    long int result=1;\n    for(int j=0;j<q;j++)\n    {\n    \tresult=1;\n        for(int i=l[j]-1;i<r[j];i++)\n        {\n            result=result*a[i]%1000000009;\n        }\n        printf(\""%d\\n\"",result);\n    }\n    \n}",TIME_LIMIT_EXCEEDED,5,328
1373123265044627456,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:04:32,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    int a[100009];\n    int b[100009];\n    b[0]=1;\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int q;\n    int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%d\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%d %d\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\tb[0]=0;\n    b[1]=0;\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=b[r[j]]-b[l[j]-1];\n\n        printf(\""%d\\n\"",result);\n    }\n    \n}",WRONG_ANSWER,13,336
1373123625507307520,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:05:58,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    int a[100009];\n    int b[100009];\n    b[0]=1;\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int q;\n    int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%d\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%d %d\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\tb[0]=0;\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=b[r[j]]-b[l[j]-j];\n\n        printf(\""%d\\n\"",result);\n    }\n    \n}",WRONG_ANSWER,2,204
1373123894781595648,a3330cd1c994f3c6c10bdab766d18a19caf82e77257d52273bd510da8df74fc3,2021-03-20 12:07:02,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include <stdio.h>\nint main()\n{\n\tint a[100],n,x,b[100],i,e,f,j;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%d\"",&x);\n\tfor(i=0;i<x;i++)\n\t{\n\t\tscanf(\""%d %d\"",&e,&f);\n\t\tb[i]=1;\n\t\tfor(j=e;j<=f;j++)\n\t\t{\n\t\t\tb[i]=b[i]*a[j];\n\t\t}\n\t}\n\tfor(i=0;i<x;i++)\n\t\tprintf(\""%d\\n\"",b[i]);\n\treturn 0;\n}\n",SEGMENTATION_FAULT,10,200
1373125780993658880,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:14:32,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    int a[100009];\n    int b[100009];\n    b[0]=1;\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int q;\n    int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%d\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%d %d\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    \n    \n    \n    \n    \n    \n    \n    long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=b[r[j]]/(b[l[j]-1]);\n\n        printf(\""%d\\n\"",result);\n    }\n    \n}",FLOAT_POINT_EXCEPTION,63,1856
1373125934568099840,a8029c9faa3b330ac992e36dc70e59520e12729e2c84b5076680cd27a54caea6,2021-03-20 12:15:08,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint main(){\n\tint a[10000],b[1000],c[1000],d,e,n,m,ans=1;\n\tscanf(\""%d\"",&n);\n\t\n\tfor(int i=0;i<n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\t\n\tscanf(\""%d\"",&m);\n\t\n\tfor(int i=0;i<m;i++)\n   \tscanf(\""%d %d\"",&b[i],&c[i]);\n   \t\n   \tfor(int i=0;i<m;i++){\n       d=c[i]-b[i]+1;\n       e=b[i];\n\tfor(int j=e;j<d;j++)\n\t\tans=ans*a[j];\n\t\t\n\tprintf(\""%d\\n\"",ans);\n\tans=1;\n\t}\n\t\n\treturn 0;\n}\n",WRONG_ANSWER,3,188
1373126182245945344,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:16:07,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    int a[100009];\n    int b[100009];\n    b[0]=1;\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int q;\n    int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%d\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%d %d\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    \n    \n    \n    \n    \n    \n    \n    long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        if(b[l[j]-1]==0)\n            result=b[r[j]]/1);\n        else\n        result=b[r[j]]/(b[l[j]-1]);\n\n        printf(\""%d\\n\"",result);\n    }\n    \n}",COMPILE_ERROR,0,0
1373126260230639616,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:16:26,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    int a[100009];\n    int b[100009];\n    b[0]=1;\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int q;\n    int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%d\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%d %d\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    \n    \n    \n    \n    \n    \n    \n    long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        if(b[l[j]-1]==0)\n            result=b[r[j]]/1;\n        else\n        result=b[r[j]]/(b[l[j]-1]);\n\n        printf(\""%d\\n\"",result);\n    }\n    \n}",WRONG_ANSWER,111,1964
1373126727752929280,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:18:18,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    int a[100009];\n    int b[100009];\n    b[0]=1;\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int q;\n    int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%d\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%d %d\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    \n    \n    \n    \n    \n    \n    \n    long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=b[r[j]]/(b[l[j]-1])%1000000009;\n        printf(\""%d\\n\"",result);\n    }\n    \n}",FLOAT_POINT_EXCEPTION,31,1784
1373126914261073920,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:19:02,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    int a[100009];\n    int b[100009];\n    b[0]=1;\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int q;\n    int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%d\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%d %d\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i]%1000000009;\n\t}\n\n    \n    \n    \n    \n    \n    \n    \n    long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=b[r[j]]/(b[l[j]-1]);\n        printf(\""%d\\n\"",result);\n    }\n    \n}",WRONG_ANSWER,54,2052
1373127460976017408,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:21:12,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    int a[100009];\n    int b[100009];\n    b[0]=1;\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int q;\n    int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%d\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%d %d\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    \n    \n    \n    \n    \n    \n    \n    long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=b[r[j]]/(b[l[j]-1])%1000000009;\n        printf(\""%ld\\n\"",result);\n    }\n    \n}",FLOAT_POINT_EXCEPTION,53,1728
1373127588315058176,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:21:43,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    int a[100009];\n    int b[100009];\n    b[0]=1;\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int q;\n    int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%d\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%d %d\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    \n    \n    \n    \n    \n    \n    \n    long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=(b[r[j]]/(b[l[j]-1]))%1000000009;\n        printf(\""%ld\\n\"",result);\n    }\n    \n}",FLOAT_POINT_EXCEPTION,32,1784
1373127865491443712,a3330cd1c994f3c6c10bdab766d18a19caf82e77257d52273bd510da8df74fc3,2021-03-20 12:22:49,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include <stdio.h>\nint main()\n{\n\tint a[100],n,x,b[100],i,e,f,j;\n\tscanf(\""%d\"",&n);\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%d\"",&x);\n\tfor(i=0;i<x;i++)\n\t{\n\t\tscanf(\""%d %d\"",&e,&f);\n\t\tb[i]=1;\n\t\tfor(j=e;j<=f;j++)\n\t\t{\n\t\t\tb[i]=b[i]*a[j];\n\t\t}\n\t}\n\tfor(i=0;i<x;i++)\n\t\tprintf(\""%d\\n\"",b[i]);\n\treturn 0;\n}\n",SEGMENTATION_FAULT,11,316
1373127953274032128,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:23:10,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    int a[100009];\n    int b[100009];\n    b[0]=1;\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int q;\n    int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%d\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%d %d\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    \n    \n    \n    \n    \n    \n    \n    long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=(b[r[j]]/(b[l[j]-1]))%1000000007;\n        printf(\""%ld\\n\"",result);\n    }\n    \n}",FLOAT_POINT_EXCEPTION,52,1836
1373128667035521024,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:26:00,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    int a[100009];\n    long long int b[100009];\n    b[0]=1;\n    int n;\n    scanf(\""%d\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%d\"",&a[i]);\n    }\n    int q;\n    int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%d\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%d %d\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    \n    \n    \n    \n    \n    \n    \n    long long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=(b[r[j]]/(b[l[j]-1]))%1000000007;\n        printf(\""%lld\\n\"",result);\n    }\n    \n}",FLOAT_POINT_EXCEPTION,84,2368
1373128753933139968,a8029c9faa3b330ac992e36dc70e59520e12729e2c84b5076680cd27a54caea6,2021-03-20 12:26:21,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint main(){\n\tint a[10000]={0},b[1000],c[1000],n,m,ans=1;\n\tscanf(\""%d\"",&n);\n\t\n\tfor(int i=1;i<=n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\t\n\tscanf(\""%d\"",&m);\n\t\n\tfor(int i=1;i<=m;i++)\n   \tscanf(\""%d %d\"",&b[i],&c[i]);\n   \t\n   \tfor(int i=1;i<=m;i++){\n\tfor(int j=b[i];j<=c[i];j++)\n\t\tans=ans*a[j];\n\t\n\tprintf(\""%d\\n\"",ans);\n\tans=1;\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,41,316
1373128853329727488,a8029c9faa3b330ac992e36dc70e59520e12729e2c84b5076680cd27a54caea6,2021-03-20 12:26:44,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint main(){\n\tint a[1000]={0},b[100],c[100],n,m,ans=1;\n\tscanf(\""%d\"",&n);\n\t\n\tfor(int i=1;i<=n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\t\n\tscanf(\""%d\"",&m);\n\t\n\tfor(int i=1;i<=m;i++)\n   \tscanf(\""%d %d\"",&b[i],&c[i]);\n   \t\n   \tfor(int i=1;i<=m;i++){\n\tfor(int j=b[i];j<=c[i];j++)\n\t\tans=ans*a[j];\n\t\n\tprintf(\""%d\\n\"",ans);\n\tans=1;\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,6,196
1373128921055154176,a8029c9faa3b330ac992e36dc70e59520e12729e2c84b5076680cd27a54caea6,2021-03-20 12:27:00,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint main(){\n\tint a[10000]={0},b[1000],c[1000],n,m,ans=1;\n\tscanf(\""%d\"",&n);\n\t\n\tfor(int i=1;i<=n;i++)\n\t\tscanf(\""%d\"",&a[i]);\n\t\t\n\tscanf(\""%d\"",&m);\n\t\n\tfor(int i=1;i<=m;i++)\n   \tscanf(\""%d %d\"",&b[i],&c[i]);\n   \t\n   \tfor(int i=1;i<=m;i++){\n\tfor(int j=b[i];j<=c[i];j++)\n\t\tans=ans*a[j];\n\t\n\tprintf(\""%d\\n\"",ans);\n\tans=1;\n\t}\n\t\n\treturn 0;\n}",SEGMENTATION_FAULT,7,316
1373129035513544704,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:27:28,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    long long int a[100009];\n    long long int b[100009];\n    b[0]=1;\n    long long int n;\n    scanf(\""%lld\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%lld\"",&a[i]);\n    }\n    long long int q;\n    long long int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%lld\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%lld %lld\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    \n    \n    \n    \n    \n    \n    \n    long long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=(b[r[j]]/(b[l[j]-1]))%1000000007;\n        printf(\""%lld\\n\"",result);\n    }\n    \n}",FLOAT_POINT_EXCEPTION,50,3364
1373129679204962304,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:30:01,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    long long int a[100009];\n    long long int b[100009];\n    b[0]=1;\n    long long int n;\n    scanf(\""%lld\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%lld\"",&a[i]);\n    }\n    long long int q;\n    long long int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%lld\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%lld %lld\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    long long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=(b[r[j]]/(b[l[j]]))%1000000007;\n        printf(\""%lld\\n\"",result);\n    }\n    \n}",WRONG_ANSWER,14,192
1373129713707335680,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:30:09,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    long long int a[100009];\n    long long int b[100009];\n    b[0]=1;\n    long long int n;\n    scanf(\""%lld\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%lld\"",&a[i]);\n    }\n    long long int q;\n    long long int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%lld\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%lld %lld\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    long long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=(b[r[j]]/(b[l[j]-1]))%1000000007;\n        printf(\""%lld\\n\"",result);\n    }\n    \n}",FLOAT_POINT_EXCEPTION,56,3388
1373131107835265024,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:35:42,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    long long int a[100009];\n    long long int b[100009];\n    b[0]=1;\n    long long int n;\n    scanf(\""%lld\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%lld\"",&a[i]);\n    }\n    long long int q;\n    long long int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%lld\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%lld %lld\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    long long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=(b[r[j]]/(b[l[j]-1]))%1000000007;\n        printf(\""%lld\"",result);\n    }\n    \n}",PRESENTATION_ERROR,4,176
1373131131700854784,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:35:48,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    long long int a[100009];\n    long long int b[100009];\n    b[0]=1;\n    long long int n;\n    scanf(\""%lld\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%lld\"",&a[i]);\n    }\n    long long int q;\n    long long int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%lld\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%lld %lld\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=a[i]*b[i];\n\t}\n\n    long long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=(b[r[j]]/(b[l[j]-1]))%1000000007;\n        printf(\""%lld\\n\"",result);\n    }\n    \n}",FLOAT_POINT_EXCEPTION,53,3416
1373131677509799936,a2ef767e1566bbc897ab37890cf810a2a969b429aeab99941667048823f2cd61,2021-03-20 12:37:58,C,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<stdio.h>\n#include <stdlib.h>\n#define MAX 10000\nint jiecheng(int L);\nint main()\n{int i;\n\tint n,a[i];\n\tscanf(\""%d\"",&n);\n\tfor(int n=0;n<=i;n++)\n\tscanf(\""%d\"",a[n]);\n\tint Q;\n\tscanf(\""%d\"",Q);\n\tint L,R;\n\tscanf(\""%d\""\""%d\"",L,R);\nint b=0;\nb=jiecheng(R)-jiecheng(L);\n\treturn 0;\n}\nint jiecheng(int L){\n\nint i,j;\n\tint n,m=1,k=0;\t\t\n\tint a[MAX] = { 1 };\n\n\tscanf(\""%d\"", &n);\n\t\n\tfor (i = 1; i <= n; i++)\n\t{\n\t\tfor (j = 0; j < m; j++)\t\t\n\t\t{\n\t\t\ta[j] = a[j] * i + k;\n\t\t\tk = a[j] / 10000;\t\t/// 传入下一数组元素的进位数据\n\t\t\ta[j] = a[j] % 10000;\t// 可输出的a[] 的值\n\t\t}\n\t\tif (k)\n\t\t{\n\t\t\ta[j++] = k;\t\t\n\t\t\tm++;\n\t\t\tk = 0;\n\t\t}\n\t}\n\tprintf(\""%d\"", a[m - 1]);\t\t\n\tfor (i = m - 2; i >= 0; i--)\t //输出数据\n\t{\n\t\tprintf(\""%04d\"", a[i]);\n\t}\n}",SEGMENTATION_FAULT,3,204
1373133943809720320,b3e039b42b74d7e8e44f5aec4142c2579425b5062e71c8e2b8020fb39fb978f2,2021-03-20 12:46:58,C++,0.0,1372193390792134659,1367128166761762816,1139562740855824384,"#include<cstdio>\nmain()\n{\n    long int a[100009];\n    long int b[100009];\n    b[0]=1;\n    long long int n;\n    scanf(\""%lld\"",&n);\n    for(int i=0;i<n;i++)\n    {\n        scanf(\""%lld\"",&a[i]);\n    }\n    long long int q;\n    long long int l[100009],r[100009];\n    l[0]=0,r[0]=0;\n    scanf(\""%lld\"",&q);\n    for(int i=1;i<=q;i++)\n    {\n        scanf(\""%lld %lld\"",&l[i],&r[i]);\n    }\n    \n    for(int i=0;i<n;i++)\n    {\n    \tb[i+1]=(a[i]*b[i])%1000000007;\n\t}\n\n    long long int result=0;\n    for(int j=1;j<=q;j++)\n    {\n    \tresult=0;\n        \n        result=(b[r[j]]/(b[l[j]-1]))%1000000007;\n        printf(\""%lld\\n\"",result);\n    }\n    \n}",WRONG_ANSWER,62,3500
1375763622530662400,ecf2fd58bcc17797e309b456075638cec843b7f8a94819430ec127b480f7f95d,2021-03-27 18:56:22,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nconst int N=1e5+10;\nconst int mod=1e9+7;\nint a[N],s[N];\nint n,q;\nint ksm(int a,int b)\n{\n\tint s=1;\n\twhile(b)\n\t{\n\t\tif(b&1)\n\t\t{\n\t\t\ts*=a;\n\t\t\ts%=mod;\n\t\t\tb--;\n\t\t}\n\t\tb>>=1;\n\t\ta*=a;a%=mod;\n\t}\n\treturn s;\n}\nint via(int x)\n{\n\treturn ksm(x,mod-2);\n}\nint main()\n{\n\tcin>>n;\n\ts[0]=1;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tcin>>a[i];\n\t\ts[i]=s[i-1]*a[i];\n\t\ts[i]%=mod;\n\t}\n\tcin>>q;\n\tfor(int i=1;i<=q;i++)\n\t{\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tcout<<(s[r]*via(s[l-1]))%mod<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,355,1816
1375764343351164928,ecf2fd58bcc17797e309b456075638cec843b7f8a94819430ec127b480f7f95d,2021-03-27 18:59:14,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nconst int N=1e5+10;\nconst int mod=1e9+7;\nlong long a[N],s[N];\nint n,q;\nlong long ksm(int a,int b)\n{\n\tlong long s=1;\n\twhile(b)\n\t{\n\t\tif(b&1)\n\t\t{\n\t\t\ts*=a;\n\t\t\ts%=mod;\n\t\t\tb--;\n\t\t}\n\t\tb>>=1;\n\t\ta*=a;a%=mod;\n\t}\n\treturn s;\n}\nint via(int x)\n{\n\treturn ksm(x,mod-2);\n}\nint main()\n{\n\tcin>>n;\n\ts[0]=1;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tcin>>a[i];\n\t\ts[i]=s[i-1]*a[i];\n\t\ts[i]%=mod;\n\t}\n\tcin>>q;\n\tfor(int i=1;i<=q;i++)\n\t{\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tcout<<(s[r]*via(s[l-1]))%mod<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,304,2620
1375765520214147072,c118514b9494c219ce92d2176fb3e7a2095835e5de0066e8d43db71c7f5bc672,2021-03-27 19:03:55,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nconst int M=1e9+7;\ntypedef long long ll;\nll power(ll a, ll n)\n{\n    ll ot=1;\n    while(n)\n    {\n        if(n&1) ot=ot*a%M;\n        a=a*a%M;\n        n>>=1;\n    }\n    return ot;\n}\nll inv(ll x)\n{\n    return power(x,M-2);\n}\nint main()\n{\n    int n;\n    cin>>n;\n    ll a[n+1];\n    ll s[n+1];\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a[i];\n    }\n    s[0]=1;\n    for(int i=1;i<=n;i++)\n    {\n        s[i]=s[i-1]*a[i]%M;\n    }\n    int Q;\n    cin>>Q;\n    while(Q--)\n    {\n        int L,R;\n        cin>>L>>R;\n        cout<<s[R] * inv(s[L-1])%M<<endl;\n    }\n}",ACCEPTED,299,2880
1375766254903828480,ecf2fd58bcc17797e309b456075638cec843b7f8a94819430ec127b480f7f95d,2021-03-27 19:06:50,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nconst int N=1e5+10;\nconst int mod=1e9+7;\nlong long a[N],s[N];\nint n,q;\nlong long ksm(int a,int b)\n{\n\tlong long s=1;\n\twhile(b)\n\t{\n\t\tif(b&1)\n\t\t{\n\t\t\ts*=a;\n\t\t\ts%=mod;\n\t\t\tb--;\n\t\t}\n\t\tb>>=1;\n\t\ta*=a;a%=mod;\n\t}\n\treturn s;\n}\nint via(int x)\n{\n\treturn ksm(x,mod-2);\n}\nint main()\n{\n\tcin>>n;\n\ts[0]=1;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tcin>>a[i];\n\t\ts[i]=s[i-1]*a[i];\n\t\ts[i]%=mod;\n\t}\n\tcin>>q;\n\tfor(int i=1;i<=q;i++)\n\t{\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tcout<<(s[r]*via(s[l-1]))%mod<<endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,260,2624
1375766289910874112,ecf2fd58bcc17797e309b456075638cec843b7f8a94819430ec127b480f7f95d,2021-03-27 19:06:58,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nconst int N=1e5+10;\nconst int mod=1e9+7;\nlong long a[N],s[N];\nint n,q;\nlong long ksm(long long a,long long b)\n{\n\tlong long s=1;\n\twhile(b)\n\t{\n\t\tif(b&1)\n\t\t{\n\t\t\ts*=a;\n\t\t\ts%=mod;\n\t\t}\n\t\tb>>=1;\n\t\ta*=a;a%=mod;\n\t}\n\treturn s;\n}\nint via(int x)\n{\n\treturn ksm(x,mod-2);\n}\nint main()\n{\n\tcin>>n;\n\ts[0]=1;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tcin>>a[i];\n\t\ts[i]=s[i-1]*a[i];\n\t\ts[i]%=mod;\n\t}\n\tcin>>q;\n\tfor(int i=1;i<=q;i++)\n\t{\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tcout<<(s[r]*via(s[l-1]))%mod<<endl;\n\t}\n\treturn 0;\n}",ACCEPTED,473,3000
1376168845567533056,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-03-28 21:46:35,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int m=1e9+7; \nint main()\n{\n\tint n;cin>>n;\n\tint num[n];\n\tfor(int i=0;i<n;i++)\n\tcin>>num[i];\n\tint q,l,r;\n\tcin>>q;\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tlong long ans=1;\n\t\tcin>>l>>r;\n\t\tif(l==r)\n\t\t{\n\t\t\tans=ans*(num[l-1]%m)*(num[l-1]%m);\n\t\t}\n\t\telse \n\t\t{\n\t\tfor(int j=l;j<=r;j++)\n\t\t{\n\t\t   ans=ans*num[j-1]%m;\t\n\t\t}\n\t\tcout<<ans<<endl;\t\t\n\t\t}\n\t}\n\treturn 0;\n}",COMPILE_ERROR,0,0
1376168884139757568,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-03-28 21:46:44,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int m=1e9+7; \nint main()\n{\n\tint n;cin>>n;\n\tint num[n];\n\tfor(int i=0;i<n;i++)\n\tcin>>num[i];\n\tint q,l,r;\n\tcin>>q;\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tlong long ans=1;\n\t\tcin>>l>>r;\n\t\tif(l==r)\n\t\t{\n\t\t\tans=ans*(num[l-1]%m)*(num[l-1]%m);\n\t\t}\n\t\telse \n\t\t{\n\t\tfor(int j=l;j<=r;j++)\n\t\t{\n\t\t   ans=ans*num[j-1]%m;\t\n\t\t}\n\t\tcout<<ans<<endl;\t\t\n\t\t}\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,9,312
1376846857276862464,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-03-30 18:40:46,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;   //在程序中每一次乘或除都要对m取余\nconst long long m=1e9+7;   //设置为常量，减少书写\nll power (int a,ll b)\n{\n\tll ans=1;\n\twhile(b)\n\t{\n\t\tif(b&1)   ans=ans*a%m;\n\t\ta=a*a%m;\n\t\tb>>=1;\n\t}\n\treturn ans;\n}\nll nav(int a)\n{\n\treturn power(a,m-2);\n}\nint main()\n{\n\tint n;cin>>n;\n\tll a[n+1];\n\tll s[n+1];\n\tfor(int i=1;i<=n;i++)\n\tcin>>a[i];\n\ts[0]=1;\n\tfor(int i=1;i<=n;i++)\n\ts[i]=s[i-1]*a[i]%m;\n\tint c;cin>>c;\n\twhile(c--)\n\t{\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tcout<<s[r]*nav(s[l-1])%m<<endl;\n\t}\n\treturn 0;\n } ",WRONG_ANSWER,479,2528
1376847365517410304,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-03-30 18:42:47,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;   //在程序中每一次乘或除都要对m取余\nconst long long m=1e9+7;   //设置为常量，减少书写\nll power (ll a,ll b)   //整个程序除了计数的变量以外都设置为long long 类型\n{\n\tll ans=1;\n\twhile(b)\n\t{\n\t\tif(b&1)   ans=ans*a%m;\n\t\ta=a*a%m;\n\t\tb>>=1;\n\t}\n\treturn ans;\n}\nll nav(ll a)\n{\n\treturn power(a,m-2);\n}\nint main()\n{\n\tint n;cin>>n;\n\tll a[n+1];\n\tll s[n+1];\n\tfor(int i=1;i<=n;i++)\n\tcin>>a[i];\n\ts[0]=1;\n\tfor(int i=1;i<=n;i++)\n\ts[i]=s[i-1]*a[i]%m;\n\tint c;cin>>c;\n\twhile(c--)\n\t{\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tcout<<s[r]*nav(s[l-1])%m<<endl;\n\t}\n\treturn 0;\n } ",ACCEPTED,261,2936
1380125093024243712,91affee55c15313c1c17b6df747d9fa8aa9d0a40714432ed308085fd9e4e50c5,2021-04-08 19:47:18,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint a[100000];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> a[i];\n\t}\n\tint q;\n\tcin >> q;\n\tint b,c;\n\tlong x;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tx = 1;\n\t\tcin >> b >> c;\n\t\tfor (int j = b; j <= c; j++)\n\t\t{\n\t\t\tx = (x * a[j-1]) % (1000000007);\n\t\t}\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,4,428
1380127188599185408,91affee55c15313c1c17b6df747d9fa8aa9d0a40714432ed308085fd9e4e50c5,2021-04-08 19:55:37,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint a[100000];\n\tlong s[100000];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> a[i];\n\t\ts[0] = a[0];\n\t\tif (i != 0)\n\t\t{\n\t\t\ts[i] = (s[i - 1]*a[i])/1000000007;\n\t\t}\n\t}\n\tint q;\n\tcin >> q;\n\tint b,c;\n\tlong x;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tcin >> b >> c;\n\t\tx = s[c - 1] / s[b - 1];\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",FLOAT_POINT_EXCEPTION,48,1528
1380128057164046336,91affee55c15313c1c17b6df747d9fa8aa9d0a40714432ed308085fd9e4e50c5,2021-04-08 19:59:05,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint a[100000];\n\tlong s[100000];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> a[i];\n\t\ts[0] = a[0];\n\t\tif (i != 0)\n\t\t{\n\t\t\ts[i] = (s[i - 1]*a[i])%1000000007;\n\t\t}\n\t}\n\tint q;\n\tcin >> q;\n\tint b,c;\n\tlong x;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tcin >> b >> c;\n\t\tx = s[c - 1] / s[b - 1];\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,245,1852
1380129083988385792,91affee55c15313c1c17b6df747d9fa8aa9d0a40714432ed308085fd9e4e50c5,2021-04-08 20:03:09,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint a[100000];\n\tlong s[100000];\n\ts[0] = 1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t\ts[i] = (s[i - 1] * a[i]) % 1000000007;\n\t}\n\tint q;\n\tcin >> q;\n\tint b,c;\n\tlong x;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tcin >> b >> c;\n\t\tx = s[c] / s[b - 1];\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,332,1860
1380129778690957312,91affee55c15313c1c17b6df747d9fa8aa9d0a40714432ed308085fd9e4e50c5,2021-04-08 20:05:55,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint a[100000];\n\tlong long s[100000];\n\ts[0] = 1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t\ts[i] = (s[i - 1] * a[i]) % 1000000007;\n\t}\n\tint q;\n\tcin >> q;\n\tint b,c;\n\tlong long x=1;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tcin >> b >> c;\n\t\tx = s[c] / s[b - 1];\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,255,1856
1380130062028775424,91affee55c15313c1c17b6df747d9fa8aa9d0a40714432ed308085fd9e4e50c5,2021-04-08 20:07:03,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint a[100001];\n\tlong long s[100001];\n\ts[0] = 1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t\ts[i] = (s[i - 1] * a[i]) % 1000000007;\n\t}\n\tint q;\n\tcin >> q;\n\tint b,c;\n\tlong long x=1;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tcin >> b >> c;\n\t\tx = s[c] / s[b - 1];\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,281,1728
1380131483302248448,91affee55c15313c1c17b6df747d9fa8aa9d0a40714432ed308085fd9e4e50c5,2021-04-08 20:12:41,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint a[100000];\n\tlong s[100000];\n\ts[0] = 1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t\ts[i] = (s[i - 1] * a[i]) % 1000000007;\n\t}\n\tint q;\n\tcin >> q;\n\tint b,c;\n\tlong x;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tcin >> b >> c;\n\t\tx = (s[c]*1000000007) / s[b - 1];\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,250,2508
1380131592945541120,91affee55c15313c1c17b6df747d9fa8aa9d0a40714432ed308085fd9e4e50c5,2021-04-08 20:13:08,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint a[100000];\n\tlong s[100000];\n\ts[0] = 1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t\ts[i] = (s[i - 1] * a[i]) % 1000000007;\n\t}\n\tint q;\n\tcin >> q;\n\tint b,c;\n\tlong x;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tcin >> b >> c;\n\t\tx = ((s[c]*1000000007) / s[b - 1])%1000000007;\n\t\tcout << x << endl;\n\t}\n\treturn 0;\n}",WRONG_ANSWER,293,2464
1380832233540186112,86088614f4a1096737419fef388236b191bdddae76cae41ead03cfe3ddd474cb,2021-04-10 18:37:13,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\n#include<string>\n#include<cmath> \nusing namespace std;\nint main()\n{\n\tint n;\n\tcin>>n;\n\tint a[n];\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tcin>>a[i];\n\t}\n\tint q;\n\tcin>>q;\n\tint b[q][2];\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tfor(int j=0;j<2;j++)\n\t\t{\n\t\t\tcin>>b[i][j];\n\t\t}\n\t}\n\tint m,sum;\n//\tfor(int i=0;i<q;i++)\n//\t{\n//\t\tm=b[i][1]-b[i][0];\n//\t\tcout<<m<<endl;\n//\t}\n    for(int i=0;i<q;i++)\n    {\n    \tm=b[i][1]-b[i][0];\n    \tsum=1;\n    \tfor(int j=b[i][0];j<b[i][1];j++)\n    \t{\n    \tsum=a[j]*m;\n        }\n        cout<<sum<<endl;\n    }\n}",WRONG_ANSWER,885,2476
1380845100511424512,1d522c61e99599e7e39a715f957ad72c5795488ceba535c01b5d951abddd32e2,2021-04-10 19:28:21,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXN 100000\nusing namespace std;\nvoid printf_n(int a[],int go,int end);\nint main() {\n\tint orange[MAXN];\n\tint n;\n\tint q;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> orange[i];\n\t}\n\tcin >> q;\n\tfor (int i = 0; i < q; i++) {\n\t\tint go;\n\t\tint end;\n\t\tcin >> go >> end;\n\t\tprintf_n(orange, go - 1, end - 1);\n\t}\n}\nvoid printf_n(int a[], int go, int end) {\n\tint sum = 1;\n\tfor (int i = go; i <= end; i++) {\n\t\tsum *= a[i];\n\t}\n\tcout << sum << endl;\n}",COMPILE_ERROR,0,0
1380845161840463872,1d522c61e99599e7e39a715f957ad72c5795488ceba535c01b5d951abddd32e2,2021-04-10 19:28:36,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXN 100000\nusing namespace std;\nvoid printf_n(int a[],int go,int end);\nint main() {\n\tint orange[MAXN];\n\tint n;\n\tint q;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> orange[i];\n\t}\n\tcin >> q;\n\tfor (int i = 0; i < q; i++) {\n\t\tint go;\n\t\tint end;\n\t\tcin >> go >> end;\n\t\tprintf_n(orange, go - 1, end - 1);\n\t}\n}\nvoid printf_n(int a[], int go, int end) {\n\tint sum = 1;\n\tfor (int i = go; i <= end; i++) {\n\t\tsum *= a[i];\n\t}\n\tcout << sum << endl;\n}",PARTIAL_ACCEPTED,5,320
1380845804063965184,1d522c61e99599e7e39a715f957ad72c5795488ceba535c01b5d951abddd32e2,2021-04-10 19:31:09,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXN 100000\nusing namespace std;\nvoid printf_n(int a[],int go,int end);\nint main() {\n\tint orange[MAXN];\n\tint n;\n\tint q;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> orange[i];\n\t}\n\tcin >> q;\n\tfor (int i = 0; i < q; i++) {\n\t\tint go;\n\t\tint end;\n\t\tcin >> go >> end;\n\t\tprintf_n(orange, go - 1, end - 1);\n\t}\n}\nvoid printf_n(int a[], int go, int end) {\n\tint sum = 1;\n\tfor (int i = go; i <= end; i++) {\n\t\tsum *= a[i];\n\t}\n    int n = pow(10, 9) + 7;\n\tsum = sum % n;\n\tcout << sum << endl;\n}",COMPILE_ERROR,0,0
1380846137435648000,1d522c61e99599e7e39a715f957ad72c5795488ceba535c01b5d951abddd32e2,2021-04-10 19:32:28,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXN 100000\n#include<cmath>\nusing namespace std;\nvoid printf_n(int a[],int go,int end);\nint main() {\n\tint orange[MAXN];\n\tint n;\n\tint q;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> orange[i];\n\t}\n\tcin >> q;\n\tfor (int i = 0; i < q; i++) {\n\t\tint go;\n\t\tint end;\n\t\tcin >> go >> end;\n\t\tprintf_n(orange, go - 1, end - 1);\n\t}\n}\nvoid printf_n(int a[], int go, int end) {\n\tint sum = 1;\n\tfor (int i = go; i <= end; i++) {\n\t\tsum *= a[i];\n\t}\n    int n = pow(10, 9) + 7;\n\tsum = sum % n;\n\tcout << sum << endl;\n}",PARTIAL_ACCEPTED,5,328
1380849871473504256,1d522c61e99599e7e39a715f957ad72c5795488ceba535c01b5d951abddd32e2,2021-04-10 19:47:18,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXN 100000\n#include<cmath>\nusing namespace std;\nvoid printf_n(int a[],int go,int end);\nint main() {\n\tint orange[MAXN];\n\tint n;\n\tint q;\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> orange[i];\n\t}\n\tcin >> q;\n\tfor (int i = 0; i < q; i++) {\n\t\tint go;\n\t\tint end;\n\t\tcin >> go >> end;\n\t\tprintf_n(orange, go - 1, end - 1);\n\t}\n}\nvoid printf_n(int a[], int go, int end) {\n\tint sum = 1;\n\tfor (int i = go; i <= end; i++) {\n\t\tsum *= a[i];\n\t}\n    int n=1000000000 + 7;\n\tsum = sum % n;\n\tcout << sum << endl;\n}",PARTIAL_ACCEPTED,4,436
1381227942273863680,1d522c61e99599e7e39a715f957ad72c5795488ceba535c01b5d951abddd32e2,2021-04-11 20:49:38,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<cmath>\nusing namespace std;\nvoid printf_n(int a[],int go,int end);\nint main() {\n\tint n;\n\tint q;\n\tcin >> n;\n\tint* orange = new int[n];\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> orange[i];\n\t}\n\tcin >> q;\n\tfor (int i = 0; i < q; i++) {\n\t\tint go;\n\t\tint end;\n\t\tcin >> go >> end;\n\t\tprintf_n(orange, go - 1, end - 1);\n\t}\n\tdelete[] orange;\n}\nvoid printf_n(int a[], int go, int end) {\n\tint sum = 1;\n\tfor (int i = go; i <= end; i++) {\n\t\tsum *= a[i];\n\t}\n\tint n = 1000000000 + 7;\n\tsum = sum % n;\n\tcout << sum << endl;\n}",COMPILE_ERROR,0,0
1381228251930939392,1d522c61e99599e7e39a715f957ad72c5795488ceba535c01b5d951abddd32e2,2021-04-11 20:50:51,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cmath>\nusing namespace std;\nvoid printf_n(int a[],int go,int end);\nint main() {\n\tint n;\n\tint q;\n\tcin >> n;\n\tint* orange = new int[n];\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> orange[i];\n\t}\n\tcin >> q;\n\tfor (int i = 0; i < q; i++) {\n\t\tint go;\n\t\tint end;\n\t\tcin >> go >> end;\n\t\tprintf_n(orange, go - 1, end - 1);\n\t}\n\tdelete[] orange;\n}\nvoid printf_n(int a[], int go, int end) {\n\tint sum = 1;\n\tfor (int i = go; i <= end; i++) {\n\t\tsum *= a[i];\n\t}\n\tint n = 1000000000 + 7;\n\tsum = sum % n;\n\tcout << sum << endl;\n}",PARTIAL_ACCEPTED,3,328
1381228311322284032,1d522c61e99599e7e39a715f957ad72c5795488ceba535c01b5d951abddd32e2,2021-04-11 20:51:06,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nvoid printf_n(int a[],int go,int end);\nint main() {\n\tint n;\n\tint q;\n\tcin >> n;\n\tint* orange = new int[n];\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> orange[i];\n\t}\n\tcin >> q;\n\tfor (int i = 0; i < q; i++) {\n\t\tint go;\n\t\tint end;\n\t\tcin >> go >> end;\n\t\tprintf_n(orange, go - 1, end - 1);\n\t}\n\tdelete[] orange;\n}\nvoid printf_n(int a[], int go, int end) {\n\tint sum = 1;\n\tfor (int i = go; i <= end; i++) {\n\t\tsum *= a[i];\n\t}\n\tint n = 1000000000 + 7;\n\tsum = sum % n;\n\tcout << sum << endl;\n}",PARTIAL_ACCEPTED,5,312
1381232630234697728,1d522c61e99599e7e39a715f957ad72c5795488ceba535c01b5d951abddd32e2,2021-04-11 21:08:15,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nvoid printf_n(int a[],int go,int end);\nint main() {\n\tint n;\n\tint q;\n\tcin >> n;\n\tint* orange = new int[n];\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> orange[i];\n\t}\n\tcin >> q;\n\tint go;\n\tint end;\n\tfor (int i = 0; i < q; i++) {\n\t\tcin >> go >> end;\n\t\tprintf_n(orange, go - 1, end - 1);\n\t}\n\tdelete[] orange;\n}\nvoid printf_n(int a[], int go, int end) {\n\tint sum = 1;\n\tfor (int i = go; i <= end; i++) {\n\t\tsum *= a[i];\n\t}\n\tint n = 1000000000 + 7;\n\tsum = sum % n;\n\tcout << sum << endl;\n}",PARTIAL_ACCEPTED,5,440
1381241564563755008,1d522c61e99599e7e39a715f957ad72c5795488ceba535c01b5d951abddd32e2,2021-04-11 21:43:45,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nvoid printf_n(int a[],int go,int end);\nint main() {\n\tint n;\n\tint q;\n\tcin >> n;\n\tint* orange = new int[n];\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> orange[i];\n\t}\n\tcin >> q;\n\tint go;\n\tint end;\n\tfor (int i = 0; i < q; i++) {\n\t\tcin >> go >> end;\n\t\tprintf_n(orange, go - 1, end - 1);\n\t}\n\tdelete[] orange;\n}\nvoid printf_n(int a[], int go, int end) {\n\tint sum = 1;\n\tfor (int i = go; i <= end; i++) {\n\t\tsum *= a[i];\n\t}\n\tcout << sum << endl;\n}",PARTIAL_ACCEPTED,4,304
1381242248499548160,1d522c61e99599e7e39a715f957ad72c5795488ceba535c01b5d951abddd32e2,2021-04-11 21:46:28,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,#include<iostream>\nusing namespace std;\nint main() {\n\tint n;\n\tint q;\n\tcin >> n;\n\tint* orange = new int[n];\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> orange[i];\n\t}\n\tcin >> q;\n\tint go;\n\tint end;\n\tfor (int i = 0; i < q; i++) {\n\t\tcin >> go >> end;\n\t\tint sum = 1;\n\t\tfor (int i = go - 1; i <= end - 1; i++) {\n\t\t\tsum *= orange[i];\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\tdelete[] orange;\n}\n,PARTIAL_ACCEPTED,4,320
1385217635537321984,ac771c63d43511c542f21899f7c22d11f14db87963d5cac3373f091e3bf38d15,2021-04-22 21:03:15,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\n#include<string>\nusing namespace std;\nint a[100001];\nint main()\n{\n   unsigned long long int n;\n   cin>>n;\n   for(int i=1;i<=n;i++)\n   {\n       cin>>a[i];\n   }\n   unsigned long long int q;\n   cin>>q;\n   for(int i=0;i<q;i++)\n   {\n   \t  int l,r;\n   \t  cin>>l>>r;\n   \t  if(l==r)\n   \t  {\n   \t  \t cout<<a[l]<<endl;\n   \t  }\n   \t  else\n   \t  {\n   \t  \t unsigned long long int temp=1;\n   \t  \t for(int j=l;j<=r;j++)\n   \t  \t {\n   \t  \t \ttemp=(temp*a[j])%1000000007;\n   \t  \t }\n   \t  \t cout<<temp<<endl;\n   \t  }\n   }\n   return 0; \n}",PARTIAL_ACCEPTED,5,312
1385219480393547776,ac771c63d43511c542f21899f7c22d11f14db87963d5cac3373f091e3bf38d15,2021-04-22 21:10:34,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\n#include<string>\nusing namespace std;\nint a[100001];\nunsigned s[100001];\ns[0]=1;\nint main()\n{\n   unsigned long long int n;\n   cin>>n;\n   for(int i=1;i<=n;i++)\n   {\n       cin>>a[i];\n       s[i]=(s[i-1]*a[i])%1000000007;\n   }\n   unsigned long long int q;\n   cin>>q;\n   for(int i=0;i<q;i++)\n   {\n   \t  int l,r;\n   \t  cin>>l>>r;\n   \t  if(l==r)\n   \t  {\n   \t  \t cout<<a[l]<<endl;\n   \t  }\n   \t  else\n   \t  {\n   \t  \tunsigned long long int temp=s[r];\n   \t  \t for(int j=l;j>=1;j--)\n   \t  \t {\n   \t  \t \ttemp=temp/a[j];\n   \t  \t }\n   \t  \t cout<<temp<<endl;\n   \t  }\n   }\n   return 0; \n}",COMPILE_ERROR,0,0
1385219559456178176,ac771c63d43511c542f21899f7c22d11f14db87963d5cac3373f091e3bf38d15,2021-04-22 21:10:53,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\n#include<string>\nusing namespace std;\nint a[100001];\nunsigned long long int s[100001];\ns[0]=1;\nint main()\n{\n   unsigned long long int n;\n   cin>>n;\n   for(int i=1;i<=n;i++)\n   {\n       cin>>a[i];\n       s[i]=(s[i-1]*a[i])%1000000007;\n   }\n   unsigned long long int q;\n   cin>>q;\n   for(int i=0;i<q;i++)\n   {\n   \t  int l,r;\n   \t  cin>>l>>r;\n   \t  if(l==r)\n   \t  {\n   \t  \t cout<<a[l]<<endl;\n   \t  }\n   \t  else\n   \t  {\n   \t  \tunsigned long long int temp=s[r];\n   \t  \t for(int j=l;j>=1;j--)\n   \t  \t {\n   \t  \t \ttemp=temp/a[j];\n   \t  \t }\n   \t  \t cout<<temp<<endl;\n   \t  }\n   }\n   return 0; \n}",COMPILE_ERROR,0,0
1385219854563213312,ac771c63d43511c542f21899f7c22d11f14db87963d5cac3373f091e3bf38d15,2021-04-22 21:12:04,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\n#include<string>\nusing namespace std;\nint a[100001];\nunsigned long long int s[100001];\nint main()\n{\n   unsigned long long int n;\n   cin>>n;\n   s[0]=1;\n   for(int i=1;i<=n;i++)\n   {\n       cin>>a[i];\n       s[i]=(s[i-1]*a[i])%1000000007;\n   }\n   unsigned long long int q;\n   cin>>q;\n   for(int i=0;i<q;i++)\n   {\n   \t  int l,r;\n   \t  cin>>l>>r;\n   \t  if(l==r)\n   \t  {\n   \t  \t cout<<a[l]<<endl;\n   \t  }\n   \t  else\n   \t  {\n   \t  \tunsigned long long int temp=s[r];\n   \t  \t for(int j=l;j>=1;j--)\n   \t  \t {\n   \t  \t \ttemp=temp/a[j];\n   \t  \t }\n   \t  \t cout<<temp<<endl;\n   \t  }\n   }\n   return 0; \n}",MULTIPLE_ERROR,5,444
1391248540334759936,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-05-09 12:27:54,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<bits/stdc++.h> \nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\tcin>>a[i];\n\tint k;\n\tcin>>k;\n\tint l,r;\n\tint sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tcin>>l>>r;\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tcout<<sum<<endl;\n\t}\n\t\n} ",PARTIAL_ACCEPTED,6,448
1391249728891461632,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-05-09 12:32:38,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<bits/stdc++.h> \n#include<math.h>\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\tcin>>a[i];\n\tint k;\n\tcin>>k;\n\tint l,r;\n\tint sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tcin>>l>>r;\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tint ss=sum%(int)pow(10.0,9.0);\n\t\tcout<<ss<<endl;\n\t}\n\t\n} ",PARTIAL_ACCEPTED,4,336
1398905538959048704,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-05-30 15:34:05,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int yu=1e9+7;\nint main()\n{\n   \n    int n;cin>>n;\n    int a[n];\n    for(int i=1;i<=n;i++) cin>>a[i];\n    int q;cin>>q;\n    int l,r;\n    long long ans=1;\n    while(q--)\n    {\n        cin>>l>>r;\n       for(int i=l;i<=r;i++)\n       {\n           ans=(ans*a[i])%yu;\n       }\n       // ans=(ans%yu*a[i]%yu)%yu;\n          \n        cout<<ans<<endl;\n    }\n    \n}",MULTIPLE_ERROR,4,324
1398906244533239808,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-05-30 15:36:53,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int yu=1e9+7;\nint main()\n{\n   \n    int n;cin>>n;\n    int a[n+1];\n    for(int i=1;i<=n;i++) cin>>a[i];\n    int q;cin>>q;\n    int l,r;\n    long long ans=1;\n    while(q--)\n    {\n        cin>>l>>r;\n       for(int i=l;i<=r;i++)\n       {\n          ans=(ans%yu*a[i]%yu)%yu;\n       }\n        cout<<ans<<endl;\n        ans=1;\n    }\n    \n}",PARTIAL_ACCEPTED,4,320
1398906930637504512,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-05-30 15:39:37,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int yu=1e9+7;\nint main()\n{\n   \n    int n;cin>>n;\n    int a[n+1];\n    for(int i=1;i<=n;i++) cin>>a[i];\n    int q;cin>>q;\n    int l,r,i;\n    long long ans=1;\n    while(q--)\n    {\n       scanf(\""%d%d\"",&l,&r);\n       for(i=l;i<=r;i++)\n       {\n          ans=(ans%yu*a[i]%yu)%yu;\n       }\n       printf(\""%d\\n\"",ans);\n        ans=1;\n    }\n    \n}",PARTIAL_ACCEPTED,7,452
1398907093925937152,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-05-30 15:40:16,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int yu=1e9+7;\nint main()\n{\n   \n    int n;cin>>n;\n    int a[n+1];\n    for(int i=1;i<=n;i++) cin>>a[i];\n    int q;cin>>q;\n    int l,r,i;\n    long long ans=1;\n    while(q--)\n    {\n       scanf(\""%d%d\"",&l,&r);\n       for(i=l;i<=r;i++)\n       {\n          ans=(ans*a[i])%yu;\n       }\n       printf(\""%d\\n\"",ans);\n       ans=1;\n    }\n    \n}",PARTIAL_ACCEPTED,15,456
1398907385560104960,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-05-30 15:41:25,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int yu=1e9+7;\nint main()\n{\n   \n    int n;cin>>n;\n    int a[n+1];\n    for(int i=1;i<=n;i++) cin>>a[i];\n    int q;cin>>q;\n    int l,r,i;\n    long long ans=1;\n    while(q--)\n    {\n       scanf(\""%d%d\"",&l,&r);\n        ans=a[l]*a[r];\n       for(i=l+1;i<=r-1;i++)\n       {\n          ans=(ans*a[i])%yu;\n       }\n       printf(\""%d\\n\"",ans);\n       ans=1;\n    }\n    \n}",MULTIPLE_ERROR,4,328
1398907517382885376,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-05-30 15:41:57,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int yu=1e9+7;\nint main()\n{\n   \n    int n;cin>>n;\n    int a[n+1];\n    for(int i=1;i<=n;i++) cin>>a[i];\n    int q;cin>>q;\n    int l,r,i;\n    long long ans=1;\n    while(q--)\n    {\n       scanf(\""%d%d\"",&l,&r);\n        ans=a[l];\n       for(i=l+1;i<=r;i++)\n       {\n          ans=(ans*a[i])%yu;\n       }\n       printf(\""%d\\n\"",ans);\n       ans=1;\n    }\n    \n}",PARTIAL_ACCEPTED,5,324
1398909630552915968,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-05-30 15:50:21,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int yu=1e9+7;\nint main()\n{\n   \n    int n;cin>>n;\n    long long an[n+1];\n    int a[n+1];an[0]=1;\n    for(int i=1;i<=n;i++) \n    {\n        cin>>a[i];\n        an[i]=a[i]*an[i-1]%yu;\n    }\n    int q;cin>>q;\n    int l,r;\n    while(q--)\n    {\n       scanf(\""%d%d\"",&l,&r);\n       printf(\""%d\\n\"",an[r]/an[l-1]);\n    }\n    \n}",PARTIAL_ACCEPTED,84,1728
1398910182527533056,4e8facfbaf59cb972f60b1e31a93c11436ad441ef312637ea63e65551b1fb05e,2021-05-30 15:52:32,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int yu=1e9+7;\nint main()\n{\n   \n    int n;cin>>n;\n    long long an[n+1];\n    int a[n+1];an[0]=1;\n    for(int i=1;i<=n;i++) \n    {\n        cin>>a[i];\n        an[i]=a[i]*an[i-1]%yu;\n    }\n    int q;cin>>q;\n    int l,r;\n    while(q--)\n    {\n       scanf(\""%d%d\"",&l,&r);\n       printf(\""%d\\n\"",an[r]/an[l-1]%yu);\n    }\n    \n}",PARTIAL_ACCEPTED,102,1732
1426804483489488896,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-08-15 15:14:32,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n\n#include<math.h>\nusing namespace std;\nint main() {\n\tint n;\n\tcin >> n;\n\tint* a = new int[n];\n\tfor (int i = 0; i < n; i++)\n\t\tcin >> a[i];\n\tint k;\n\tcin >> k;\n\tint l, r;\n\tint sum = 1;\n\tfor (int i = 0; i < k; i++)\n\t{\n\t\tsum = 1;\n\t\tcin >> l >> r;\n\t\tfor (int j = l - 1; j < r; j++)\n\t\t\tsum *= a[j];\n\t\tint ss = sum % (int)(pow(10.0, 9.0)+7);\n\t\tcout << ss << endl;\n\t}\n\n}",PARTIAL_ACCEPTED,4,440
1426805094553309184,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-08-15 15:16:57,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n\n#include<math.h>\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\tcin>>a[i];\n\tint k;\n\tcin>>k;\n\tint l,r;\n\tunsigned long long sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tcin>>l>>r;\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tint ss=sum%((unsigned long long)pow(10.0,9.0)+7);\n\t\tcout<<ss<<endl;\n\t}\n\t\n} ",PARTIAL_ACCEPTED,5,428
1426805386204372992,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-08-15 15:18:07,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n\n#include<math.h>\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\tcin>>a[i];\n\tint k;\n\tcin>>k;\n\tint l,r;\n\tunsigned long long sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tcin>>l>>r;\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tint ss=sum%1000000007;\n\t\tcout<<ss<<endl;\n\t}\n\t\n} ",PARTIAL_ACCEPTED,12,316
1426805458899914752,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-08-15 15:18:24,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n\n#include<math.h>\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\tcin>>a[i];\n\tint k;\n\tcin>>k;\n\tint l,r;\n\tunsigned long long sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tcin>>l>>r;\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tint ss=sum%1000000007;\n\t\tcout<<ss<<endl;\n\t}\n\t\n} ",PARTIAL_ACCEPTED,8,312
1426806258506358784,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-08-15 15:21:35,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n\n#include<math.h>\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\tcin>>a[i];\n\tint k;\n\tcin>>k;\n\tint l,r;\n\tunsigned long long sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tcin>>l>>r;\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tcout<< sum % 1000000007 <<endl;\n\t}\n\t\n} ",PARTIAL_ACCEPTED,4,320
1426806768273543168,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-08-15 15:23:37,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\t\tscanf(\""%d\"", &a[i]);\n\tint k;\n\tscanf(\""%d\"", &k);\n\tint l,r;\n\tunsigned long long sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tscanf(\""%d %d\"", &l,&r);\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tprintf(\""%d\\n\"", sum % 1000000007);\n\t}\n\t\n} ",PARTIAL_ACCEPTED,4,296
1426807010775617536,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-08-15 15:24:34,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\nusing namespace std;\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\t\tscanf(\""%d\"", &a[i]);\n\tint k;\n\tscanf(\""%d\"", &k);\n\tint l,r;\n\tunsigned long long sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tscanf(\""%d %d\"", &l,&r);\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tprintf(\""%d\\n\"", sum % 1000000007);\n\t}\n\t\n} ",PARTIAL_ACCEPTED,12,620
1426807069047218176,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-08-15 15:24:48,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\nusing namespace std;\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\t\tscanf(\""%d\"", &a[i]);\n\tint k;\n\tscanf(\""%d\"", &k);\n\tint l,r;\n\tunsigned long long sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tscanf(\""%d %d\"", &l,&r);\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tprintf(\""%d\\n\"", sum % 1000000007);\n\t}\n\t\n} ",COMPILE_ERROR,0,0
1426807129680076800,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-08-15 15:25:03,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"\n#include<cstdio>\n\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\t\tscanf(\""%d\"", &a[i]);\n\tint k;\n\tscanf(\""%d\"", &k);\n\tint l,r;\n\tunsigned long long sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tscanf(\""%d %d\"", &l,&r);\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tprintf(\""%d\\n\"", sum % 1000000007);\n\t}\n\t\n} ",COMPILE_ERROR,0,0
1426807159925202944,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-08-15 15:25:10,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"\n#include<stdio>\n\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\t\tscanf(\""%d\"", &a[i]);\n\tint k;\n\tscanf(\""%d\"", &k);\n\tint l,r;\n\tunsigned long long sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tscanf(\""%d %d\"", &l,&r);\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tprintf(\""%d\\n\"", sum % 1000000007);\n\t}\n\t\n} ",COMPILE_ERROR,0,0
1426807198810595328,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-08-15 15:25:19,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"\n#include<stdio.h>\n\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\t\tscanf(\""%d\"", &a[i]);\n\tint k;\n\tscanf(\""%d\"", &k);\n\tint l,r;\n\tunsigned long long sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tscanf(\""%d %d\"", &l,&r);\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tprintf(\""%d\\n\"", sum % 1000000007);\n\t}\n\t\n} ",COMPILE_ERROR,0,0
1426807436229173248,193fbdd8a0b0a10e661ba7d63e1339c173fb70c9757db535cac5885c0117f4ac,2021-08-15 15:26:16,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<cstdio>\nusing namespace std;\nint main(){\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *a=new int [n];\n\tfor(int i=0;i<n;i++)\n\t\tscanf(\""%d\"", &a[i]);\n\tint k;\n\tscanf(\""%d\"", &k);\n\tint l,r;\n\tunsigned long long sum=1;\n\tfor(int i=0;i<k;i++)\n\t{\n\t\tsum=1;\n\t\tscanf(\""%d %d\"", &l,&r);\n\t\tfor(int j=l-1;j<r;j++)\n\t\tsum*=a[j];\n\t\tprintf(\""%d\\n\"", sum % 1000000007);\n\t}\n\t\n} ",PARTIAL_ACCEPTED,4,436
1429055473173684224,c1973c2fb5d00a26b8a47a2cbde865c3f7384316ae70eca8d3aaf4ef9e886145,2021-08-21 20:19:10,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int MOD = 1e10 + 7 ;\nconst int N = 1e5 +10;\nint a[N];\nint n ;\nint m ;\nint main()\n{\n    cin>>n;\n    for(int i = 1 ; i <= n ; i++  ) cin>>a[i];\n    cin>>m;\n    while(m--)\n    {\n        long long sum=1;\n        int l ,r ;\n        cin>>l>>r;\n        for(int i = l ;i <= r ; i++)\n        {\n            sum = (sum*a[i]) % MOD;\n        }\n        cout<<sum;\n        if(m!=0) cout<<endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,7,452
1429058161177288704,c1973c2fb5d00a26b8a47a2cbde865c3f7384316ae70eca8d3aaf4ef9e886145,2021-08-21 20:29:50,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\nconst int MOD = 1e10 + 7 ;\nconst int N = 1e5 +10;\nint a[N];\nint s[N];\nint n ;\nint m ;\nint main()\n{\n    cin>>n;\n    s[0] = 1;\n    for(int i = 1 ; i <= n ; i++  ) \n    {\n        cin>>a[i];\n        s[i] = (a[i] * s[i-1]) % MOD;\n    }\n    cin>>m;\n    while(m--)\n    {\n        long long sum=1;\n        int l ,r ;\n        cin>>l>>r;\n        cout<<s[r]/s[l-1];\n        if(m != 0) cout<<endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,46,1080
1429334424978796544,f3920c3086b2bc31f70ad0de93430e0c4073527458f7a4431ea5520715570d8d,2021-08-22 14:47:37,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#include<string>\n#include<cmath>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tint* a = new int[n];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> a[i];\n\t}\n\tint Q;\n\tcin >> Q;\n\tint **b = new int *[Q];\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tb[i] = new int[2];\n\t\tfor (int j = 0; j < 2; j++)\n\t\t{\n\t\t\tcin >> b[i][j];\n\t\t}\n\t}\n\tunsigned long long  price = 1; unsigned long long p=pow(10, 9)+7;\n\tfor (int i = 0; i < Q; i++)\n\t{\n\t\tfor (int k = b[i][0] - 1; k < b[i][1]; k++)\n\t\t{\n\t\t\tprice *= a[k];\n\t\t}\n\t\tif (i != Q - 1)\n\t\t{\n\t\t\tprice %= p;\n\t\t\tcout << price << \""\\n\"";\n\t\t\tprice = 1;\n\t\t}\n\t}\n\tcout << price;\n\treturn 0;\n\t\n}",PARTIAL_ACCEPTED,4,448
1430479379986292736,47a1dc28f1b69743c6dbd9ed188e9f9a71d6d3ee08ac01a094b2fa2752c656bc,2021-08-25 18:37:15,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,#include<iostream>\n#include<string>\n#include<math.h>\nusing namespace std;\n\n\n\nint main() {\n\n\tint n;cin >> n;\n\tint box [10000] = { 0 };\n\tfor (int i = 1;i <= n;i++) {\n\t\tcin >> box[i];\n\t}\n\tint Q;\n\tcin >> Q;\n\tint kk[10000][2] = {0};\n\tint rs[10000] = { 0 };\n\tfor (int i = 1;i <= Q;i++) {\n\t\tcin >> kk[i][0] >> kk[i][1];\n\t\tint result = 1;\n\t\tfor (int j = kk[i][0];j <= kk[i][1];j++) {\n\t\t\tresult *= box[j];\n\t\t}\n\t\trs[i]= result;\n\t}\n\tfor (int i = 1;i <Q;i++) {\n\t\t\n\t\tcout<<rs[i]<<endl;\n\t}\n\tcout << rs[Q];\n\treturn 0;\n},PARTIAL_ACCEPTED,19,572
1430479530234650624,47a1dc28f1b69743c6dbd9ed188e9f9a71d6d3ee08ac01a094b2fa2752c656bc,2021-08-25 18:37:51,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,#include<iostream>\n#include<string>\n#include<math.h>\nusing namespace std;\n\n\n\nint main() {\n\n\tint n;cin >> n;\n\tint box [10003] = { 0 };\n\tfor (int i = 1;i <= n;i++) {\n\t\tcin >> box[i];\n\t}\n\tint Q;\n\tcin >> Q;\n\tint kk[10003][2] = {0};\n\tint rs[10003] = { 0 };\n\tfor (int i = 1;i <= Q;i++) {\n\t\tcin >> kk[i][0] >> kk[i][1];\n\t\tint result = 1;\n\t\tfor (int j = kk[i][0];j <= kk[i][1];j++) {\n\t\t\tresult *= box[j];\n\t\t}\n\t\trs[i]= result;\n\t}\n\tfor (int i = 1;i <Q;i++) {\n\t\t\n\t\tcout<<rs[i]<<endl;\n\t}\n\tcout << rs[Q];\n\treturn 0;\n},PARTIAL_ACCEPTED,21,556
1430479697436385280,47a1dc28f1b69743c6dbd9ed188e9f9a71d6d3ee08ac01a094b2fa2752c656bc,2021-08-25 18:38:31,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,#include<iostream>\n#include<string>\n#include<math.h>\nusing namespace std;\n\n\n\nint main() {\n\n\tint n;cin >> n;\n\tint box [100001] = { 0 };\n\tfor (int i = 1;i <= n;i++) {\n\t\tcin >> box[i];\n\t}\n\tint Q;\n\tcin >> Q;\n\tint kk[100001][2] = {0};\n\tint rs[100001] = { 0 };\n\tfor (int i = 1;i <= Q;i++) {\n\t\tcin >> kk[i][0] >> kk[i][1];\n\t\tint result = 1;\n\t\tfor (int j = kk[i][0];j <= kk[i][1];j++) {\n\t\t\tresult *= box[j];\n\t\t}\n\t\trs[i]= result;\n\t}\n\tfor (int i = 1;i <Q;i++) {\n\t\t\n\t\tcout<<rs[i]<<endl;\n\t}\n\tcout << rs[Q];\n\treturn 0;\n},PARTIAL_ACCEPTED,12,1848
1430480288334127104,47a1dc28f1b69743c6dbd9ed188e9f9a71d6d3ee08ac01a094b2fa2752c656bc,2021-08-25 18:40:52,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,#include<iostream>\n#include<string>\n#include<math.h>\nusing namespace std;\n\n\n\nint main() {\n\n\tint n;cin >> n;\n\tint box [60001] = { 0 };\n\tfor (int i = 1;i <= n;i++) {\n\t\tcin >> box[i];\n\t}\n\tint Q;\n\tcin >> Q;\n\tint kk[60001][2] = {0};\n\tint rs[60001] = { 0 };\n\tfor (int i = 1;i <= Q;i++) {\n\t\tcin >> kk[i][0] >> kk[i][1];\n\t\tint result = 1;\n\t\tfor (int j = kk[i][0];j <= kk[i][1];j++) {\n\t\t\tresult *= box[j];\n\t\t}\n\t\trs[i]= result;\n\t}\n\tfor (int i = 1;i <Q;i++) {\n\t\t\n\t\tcout<<rs[i]<<endl;\n\t}\n\tcout << rs[Q];\n\treturn 0;\n},PARTIAL_ACCEPTED,7,1336
1430480653116985344,47a1dc28f1b69743c6dbd9ed188e9f9a71d6d3ee08ac01a094b2fa2752c656bc,2021-08-25 18:42:19,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,#include<iostream>\n#include<string>\n#include<math.h>\nusing namespace std;\n\n\n\nint main() {\n\n\tlong long n;cin >> n;\n\tlong long box [60001] = { 0 };\n\tfor (int i = 1;i <= n;i++) {\n\t\tcin >> box[i];\n\t}\n\tlong long Q;\n\tcin >> Q;\n\tlong long kk[60001][2] = {0};\n\tlong long rs[60001] = { 0 };\n\tfor (int i = 1;i <= Q;i++) {\n\t\tcin >> kk[i][0] >> kk[i][1];\n\t\tlong long result = 1;\n\t\tfor (int j = kk[i][0];j <= kk[i][1];j++) {\n\t\t\tresult *= box[j];\n\t\t}\n\t\trs[i]= result;\n\t}\n\tfor (int i = 1;i <Q;i++) {\n\t\t\n\t\tcout<<rs[i]<<endl;\n\t}\n\tcout << rs[Q];\n\treturn 0;\n},PARTIAL_ACCEPTED,5,2248
1434369045648179200,4192d9fc583eab46e860b8a0384d741b4e46fdf9e8c0bf75f20e09006a907a69,2021-09-05 12:13:24,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\n#include<unordered_map>\nusing namespace std;\nint a[100005];\nint main()\n{\n\tint n; cin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t}\n\tint t; cin >> t;\n\twhile (t--)\n\t{\n\t\tint l, r; cin >> l >> r;\n\t\tint ans = 1;\n\t\tif (l == r)\n\t\t\tans *= a[l];\n\t\telse {\n\t\t\tfor (int i = 1; i <= r; i++)\n\t\t\t\tans *= a[i];\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",MULTIPLE_ERROR,5,296
1434369615004082176,4192d9fc583eab46e860b8a0384d741b4e46fdf9e8c0bf75f20e09006a907a69,2021-09-05 12:15:40,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\n#include<unordered_map>\nusing namespace std;\nint a[100005];\nint main()\n{\n\tint n; cin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t}\n\tint t; cin >> t;\n\twhile (t--)\n\t{\n\t\tint l, r; cin >> l >> r;\n\t\tint ans = 1;\n\t\tif (l == r)\n\t\t\tans *= a[l];\n\t\telse {\n\t\t\tfor (int i = 1; i <= r; i++)\n\t\t\t\tans = (a[i]*ans)%(int)(1e9+7);\n\t\t}\n\t\tcout << ans % (int)(1e9 + 7) << endl;\n\t}\n}",MULTIPLE_ERROR,6,424
1434370196586168320,4192d9fc583eab46e860b8a0384d741b4e46fdf9e8c0bf75f20e09006a907a69,2021-09-05 12:17:58,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\n#include<unordered_map>\nusing namespace std;\nint a[100005];\nint main()\n{\n\tint n; cin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t}\n\tint t; cin >> t;\n\twhile (t--)\n\t{\n\t\tint l, r; cin >> l >> r;\n\t\tint ans = 1;\n\t\tif (l == r)\n\t\t\tans *= a[l];\n\t\telse {\n\t\t\tfor (int i = l; i <= r; i++)\n\t\t\t\tans = (a[i]*ans)%(int)(1e9+7);\n\t\t}\n\t\tcout << ans % (int)(1e9 + 7) << endl;\n\t}\n}",PARTIAL_ACCEPTED,4,320
1434370488056741888,4192d9fc583eab46e860b8a0384d741b4e46fdf9e8c0bf75f20e09006a907a69,2021-09-05 12:19:08,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\n#include<unordered_map>\nusing namespace std;\nint a[100005];\nint main()\n{\n\tint n; cin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tint t; cin >> t;\n\twhile (t--)\n\t{\n\t\tint l, r; scanf(\""%d%d\"",&l,&r);\n\t\tint ans = 1;\n\t\tif (l == r)\n\t\t\tans *= a[l];\n\t\telse {\n\t\t\tfor (int i = l; i <= r; i++)\n\t\t\t\tans = (a[i]*ans)%(int)(1e9+7);\n\t\t}\n\t\tcout << ans % (int)(1e9 + 7) << endl;\n\t}\n}",PARTIAL_ACCEPTED,11,308
1434372583958945792,4192d9fc583eab46e860b8a0384d741b4e46fdf9e8c0bf75f20e09006a907a69,2021-09-05 12:27:28,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\n#include<unordered_map>\nusing namespace std;\nint a[100005];\nlong long arr[100005];\nint main()\n{\n\tint n; cin >> n;\n\tarr[0] = 1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t\tarr[i] = (arr[i - 1] * a[i])% (int)(1e9 + 7);\n\t}\n\tint t; cin >> t;\n\twhile (t--)\n\t{\n\t\tint l, r; cin >> l >> r;\n\t\tint ans = 1;\n\t\tif (l == r)\n\t\t\tans *= a[l];\n\t\telse {\n\t\t\tans = arr[r]/arr[l-1];\n\t\t}\n\t\tcout << ans % (int)(1e9 + 7) << endl;\n\t}\n}",PARTIAL_ACCEPTED,385,1844
1434726277116301312,33e01dec803d2d4c8e1db853dd81d607063b60b1886cab1709089a96bde17165,2021-09-06 11:52:55,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nconst int M=1e9+7;\ntypedef long long ll;\nll power(ll a, ll n)\n{\n    ll ot=1;\n    while(n)\n    {\n        if(n&1) ot=ot*a%M;\n        a=a*a%M;\n        n>>=1;\n    }\n    return ot;\n}\nll inv(ll x)\n{\n    return power(x,M-2);\n}\nint main()\n{\n    int n;\n    cin>>n;\n    ll a[n+1];\n    ll s[n+1];\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a[i];\n    }\n    s[0]=1;\n    for(int i=1;i<=n;i++)\n    {\n        s[i]=s[i-1]*a[i]%M;\n    }\n    int Q;\n    cin>>Q;\n    while(Q--)\n    {\n        int L,R;\n        cin>>L>>R;\n        cout<<s[R] * inv(s[L-1])%M<<endl;\n    }\n\n}",ACCEPTED,343,2856
1434827741088096256,4192d9fc583eab46e860b8a0384d741b4e46fdf9e8c0bf75f20e09006a907a69,2021-09-06 18:36:05,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\n//7-4 Rurirat给fffteam买橘子[一维数组前缀和]\nint a[100005];\nint arr[100005];\nint main()\n{\n\tint n; cin >> n;\n\tarr[0] = 1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t\tarr[i] = (arr[i - 1] * a[i])%(int)(1E9+7);\n\t}\n\tint t; cin >> t;\n\twhile (t--)\n\t{\n\t\tint l, r; cin >> l >> r;\n\t\tint ans = 1;\n\t\tif (l == r)\n\t\t\tans *= a[l];\n\t\telse {\n\t\t\tans = arr[r] / arr[l - 1];\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",PARTIAL_ACCEPTED,351,1328
1434829575437590528,4192d9fc583eab46e860b8a0384d741b4e46fdf9e8c0bf75f20e09006a907a69,2021-09-06 18:43:23,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\n//7-4 Rurirat给fffteam买橘子[一维数组前缀和]\nint a[100005];\nint arr[100005];\nint main()\n{\n\tint n;scanf(\""%d\"",&n);\n\tarr[0] = 1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tint t; cin >> t;\n\twhile (t--)\n\t{\n\t\tint l, r; scanf(\""%d%d\"",&l,&r);\n\t\tint ans = 1;\n\t\tfor(int i=l;i<=r;i++)\n\t\t{\n\t\t\tans=ans*a[i]%1000000007;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",PARTIAL_ACCEPTED,5,428
1434835292592771072,4192d9fc583eab46e860b8a0384d741b4e46fdf9e8c0bf75f20e09006a907a69,2021-09-06 19:06:06,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\n//7-4 Rurirat给fffteam买橘子[一维数组前缀和]\nint a[100005];\nint arr[100005];\nint main()\n{\n\tint n; cin >> n;\n\tarr[0] = 1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t\tarr[i] = arr[i - 1] * a[i];\n\t}\n\tint t; cin >> t;\n\twhile (t--)\n\t{\n\t\tint l, r; cin >> l >> r;\n\t\tint ans = 1;\n\t\tif (l == r)\n\t\t\tans *= a[l];\n\t\telse {\n\t\t\tans = (arr[r] / arr[l - 1]) % (int)(1E9 + 7);\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",PARTIAL_ACCEPTED,55,1068
1434837687200616448,4192d9fc583eab46e860b8a0384d741b4e46fdf9e8c0bf75f20e09006a907a69,2021-09-06 19:15:37,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\n//7-4 Rurirat给fffteam买橘子[一维数组前缀和]\nint a[100005];\nlong long arr[100005];\nint main()\n{\n\tint n; cin >> n;\n\tarr[0] = 1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t\tarr[i] = arr[i - 1] * a[i];\n\t}\n\tint t; cin >> t;\n\twhile (t--)\n\t{\n\t\tint l, r; cin >> l >> r;\n\t\tint ans = 1;\n\t\tif (l == r)\n\t\t\tans *= a[l];\n\t\telse {\n\t\t\tans = (arr[r] / arr[l - 1]) % (int)(1E9 + 7);\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}",PARTIAL_ACCEPTED,47,1604
1434847113588416512,4192d9fc583eab46e860b8a0384d741b4e46fdf9e8c0bf75f20e09006a907a69,2021-09-06 19:53:04,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\n//7-4 Rurirat给fffteam买橘子[一维数组前缀和]\nconst int M = 1e9 + 7;\ntypedef long long ll;\nll a[100005];\nll s[100005];\n//n是10的9次方，a实际就是S[L-1],这里得到的a是关于m的模最小值\nll power(ll a, ll n)\n{\n\tll ot = 1;\n\t//快速幂算法\n\twhile (n)\n\t{\n\t\tif (n & 1)//如果n是奇数\n\t\t\tot = ot * a % M;\n\t\ta = a * a % M;\n\t\tn >>= 1;\n\t}\n\treturn ot;\n}\nll inv(ll x)\n{\n\treturn power(x, M - 2);\n}\nint main()\n{\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> a[i];\n\t}\n\ts[0] = 1;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\ts[i] = s[i - 1] * a[i] % M;\n\t}\n\tint Q;\n\tcin >> Q;\n\twhile (Q--)\n\t{\n\t\tint L, R;\n\t\tcin >> L >> R;\n        //?,inv(S[L-1])应该是S[L-1]的分数形式\n\t\tcout << s[R] * inv(s[L - 1]) % M << endl;\n\t}\n}",ACCEPTED,434,2872
1451874813530976256,0d10183529dfdb20c417e29c10bd1d3d42293e5798f9bb2f1c9e35681b57dd76,2021-10-23 19:35:04,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,#include<bits/stdc++.h>\nusing namespace std;\n\nconst int M = 1e9 + 7;\n\nint main(){\n    int coun=1;\n    int n;\n    cin>>n;\n    int a[n];\n    for(int i = 0;i<n;i++){\n        cin>>a[i];\n    }\n    int q;\n    cin>>q;\n    int b[q][2];\n    for(int i = 0;i<q;i++){\n        cin>>b[i][0];\n        cin>>b[i][1];\n    }\n    for(int i = 0;i<q;i++){\n        for(int j = b[i][0]-1;j<b[i][0];j++){\n            coun *=a[j];\n        }\n    }\n    count<<coun%M;\n},COMPILE_ERROR,0,0
1451875447852347392,0d10183529dfdb20c417e29c10bd1d3d42293e5798f9bb2f1c9e35681b57dd76,2021-10-23 19:37:35,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,#include<bits/stdc++.h>\nusing namespace std;\n\nconst int M = 1e9 + 7;\n\nint main(){\n    int coun=1;\n    int n;\n    cin>>n;\n    int a[n];\n    for(int i = 0;i<n;i++){\n        cin>>a[i];\n    }\n    int q;\n    cin>>q;\n    int b[q][2];\n    for(int i = 0;i<q;i++){\n        cin>>b[i][0];\n        cin>>b[i][1];\n    }\n    for(int i = 0;i<q;i++){\n        for(int j = b[i][0]-1;j<b[i][0];j++){\n            coun *=a[j];\n        }\n    }\n    cout<<coun%M;\n},WRONG_ANSWER,132,1476
1451876650954895360,0d10183529dfdb20c417e29c10bd1d3d42293e5798f9bb2f1c9e35681b57dd76,2021-10-23 19:42:22,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,#include<bits/stdc++.h>\nusing namespace std;\n\nconst int M = 1e9 + 7;\n\nint main(){\n    int n;\n    cin>>n;\n    int a[n];\n    for(int i = 0;i<n;i++){\n        cin>>a[i];\n    }\n    int q;\n    cin>>q;\n    int b[q][2];\n    int count[q];\n    for(int i = 0;i<q;i++){\n        cin>>b[i][0];\n        cin>>b[i][1];\n    }\n    for(int i = 0;i<q;i++){\n    \tcount[i] = 1; \n        for(int j = b[i][0]-1;j<b[i][1];j++){\n            count[i] *=a[j];\n        }\n        cout<<count[i]%M<<endl;\n    }\n},PARTIAL_ACCEPTED,6,444
1457330308268519424,3a2236b18297a6cd20e727de89fbb262db82578827b4cf92f23ae7acd4976769,2021-11-07 20:53:16,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream> \n#include <cstdio>\n\n\nusing namespace std;\ntypedef long long LL;\nconst LL M=1e9+7;\nLL a[10007];\nLL s[10007];\nLL inv(LL a,LL n=M){\n\tLL ot=1;\n\twhile(n){\n\t\tif(n&1==1){\n\t\t\tot=ot*a%M;\n\t\t}\n\t\ta=a*a%m;\n\t\tn>>=1;\n\t}\n\treturn ot;\n}\nint main(){\n\tint n;\n\tcin>>n;\n\tLL t;\n\ts[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>t;\n\t\ts[i]=s[i-1]*t%M;\n\t}\n\tint Q,l,r;\n\tcin>>Q;\n\twhile(Q--){\n\t\tcin>>l>>r;\n\t\t\n\t\tcout<<s[r]*inv(s[l-1])%M;\n\t}\n}\n",COMPILE_ERROR,0,0
1457330497885614080,3a2236b18297a6cd20e727de89fbb262db82578827b4cf92f23ae7acd4976769,2021-11-07 20:54:01,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream> \n#include <cstdio>\n\n\nusing namespace std;\ntypedef long long LL;\nconst LL M=1e9+7;\nLL a[10007];\nLL s[10007];\nLL inv(LL a,LL n=M){\n\tLL ot=1;\n\twhile(n){\n\t\tif(n&1==1){\n\t\t\tot=ot*a%M;\n\t\t}\n\t\ta=a*a%M;\n\t\tn>>=1;\n\t}\n\treturn ot;\n}\nint main(){\n\tint n;\n\tcin>>n;\n\tLL t;\n\ts[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>t;\n\t\ts[i]=s[i-1]*t%M;\n\t}\n\tint Q,l,r;\n\tcin>>Q;\n\twhile(Q--){\n\t\tcin>>l>>r;\n\t\t\n\t\tcout<<s[r]*inv(s[l-1])%M<<endl;\n\t}\n}\n",MULTIPLE_ERROR,12,704
1457331707446722560,3a2236b18297a6cd20e727de89fbb262db82578827b4cf92f23ae7acd4976769,2021-11-07 20:58:49,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream> \n#include <cstdio>\n\n\nusing namespace std;\ntypedef long long LL;\nconst LL M=1e9+7;\nLL s[10009];\nLL inv(LL a,LL n=M){\n\tLL ot=1;\n\twhile(n){\n\t\tif(n&1==1){\n\t\t\tot=ot*a%M;\n\t\t}\n\t\ta=a*a%M;\n\t\tn>>=1;\n\t}\n\treturn ot;\n}\nint main(){\n\tint n;\n\tcin>>n;\n\tLL t;\n\ts[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>t;\n\t\ts[i]=s[i-1]*t%M;\n\t}\n\tint Q,l,r;\n\tcin>>Q;\n\tQ--;\n\tcin>>l>>r;\n\tcout<<s[r]*inv(s[l-1])%M;\n\twhile(Q--){\n\t\tcin>>l>>r;\n\t\tcout<<endl<<s[r]*inv(s[l-1])%M;\n\t}\n}\n",MULTIPLE_ERROR,11,580
1457332509036605440,3a2236b18297a6cd20e727de89fbb262db82578827b4cf92f23ae7acd4976769,2021-11-07 21:02:00,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nconst int M=1e9+7;\ntypedef long long ll;\nll power(ll a, ll n)\n{\n    ll ot=1;\n    while(n)\n    {\n        if(n&1) ot=ot*a%M;\n        a=a*a%M;\n        n>>=1;\n    }\n    return ot;\n}\nll inv(ll x)\n{\n    return power(x,M-2);\n}\nint main()\n{\n    int n;\n    cin>>n;\n    ll a[n+1];\n    ll s[n+1];\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a[i];\n    }\n    s[0]=1;\n    for(int i=1;i<=n;i++)\n    {\n        s[i]=s[i-1]*a[i]%M;\n    }\n    int Q;\n    cin>>Q;\n    while(Q--)\n    {\n        int L,R;\n        cin>>L>>R;\n        cout<<s[R] * inv(s[L-1])%M<<endl;\n    }\n}",ACCEPTED,383,2864
1457332959581351936,3a2236b18297a6cd20e727de89fbb262db82578827b4cf92f23ae7acd4976769,2021-11-07 21:03:48,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream> \n#include <cstdio>\nusing namespace std;\ntypedef long long LL;\nconst LL M=1e9+7;\nLL s[10007];\nLL inv(LL a,LL n=M-2){\n\tLL ot=1;\n\twhile(n){\n\t\tif(n&1==1){\n\t\t\tot=ot*a%M;\n\t\t}\n\t\ta=a*a%M;\n\t\tn>>=1;\n\t}\n\treturn ot;\n}\nint main(){\n\tint n;\n\tcin>>n;\n\tLL t;\n\ts[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>t;\n\t\ts[i]=s[i-1]*t%M;\n\t}\n\tint Q,l,r;\n\tcin>>Q;\n\tQ--;\n\tcin>>l>>r;\n\tcout<<s[r]*inv(s[l-1])%M;\n\twhile(Q--){\n\t\tcin>>l>>r;\n\t\tcout<<endl<<s[r]*inv(s[l-1])%M;\n\t}\n}\n",PARTIAL_ACCEPTED,9,492
1457333228931719168,3a2236b18297a6cd20e727de89fbb262db82578827b4cf92f23ae7acd4976769,2021-11-07 21:04:52,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream> \n#include <cstdio>\nusing namespace std;\ntypedef long long LL;\nconst LL M=1e9+7;\n\nLL inv(LL a,LL n=M-2){\n\tLL ot=1;\n\twhile(n){\n\t\tif(n&1==1){\n\t\t\tot=ot*a%M;\n\t\t}\n\t\ta=a*a%M;\n\t\tn>>=1;\n\t}\n\treturn ot;\n}\nint main(){\n\tint n;\n\tcin>>n;\n\tLL s[n+1];\n\tLL t;\n\ts[0]=1;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>t;\n\t\ts[i]=s[i-1]*t%M;\n\t}\n\tint Q,l,r;\n\tcin>>Q;\n\tQ--;\n\tcin>>l>>r;\n\tcout<<s[r]*inv(s[l-1])%M;\n\twhile(Q--){\n\t\tcin>>l>>r;\n\t\tcout<<endl<<s[r]*inv(s[l-1])%M;\n\t}\n}\n",ACCEPTED,490,2168
1459388087179849728,331a8a945c98789f0dcd885f1c4f0a79064c1fa7bb730b8756cc453e93341120,2021-11-13 13:10:08,Java,150.0,1375730370158333955,1367128166761762816,1139562740855824384,\nimport java.util.Scanner;\n\n/**\n * @ClassName: test\n * @Description:\n * @Author syk\n * @Date 2021/11/11\n * @Version 1.0\n */\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        // long start = System.currentTimeMillis();\n\n        int n = scanner.nextInt();\n        int[] arr = new int[n];\n        for (int i = 0; i < n; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        int m = scanner.nextInt();\n        int[] result = new int[m];\n        for (int i = 0; i < m; i++) {\n            int left = scanner.nextInt();\n            int right = scanner.nextInt();\n            result[i] = 1;\n            for (int j = left - 1; j < right; j++) {\n                result[i] = result[i] * arr[j] % (1000000000 + 7);\n            }\n        }\n        for (int i = 0; i < m; i++) {\n            System.out.println(result[i]);\n        }\n        // System.out.println(System.currentTimeMillis() - start);\n    }\n},PARTIAL_ACCEPTED,119,23416
1459422731392696320,fe7bc38602a6942d6b46ff66e3ff055c5cd39519bc31cfa0cd1ee44ff95e202e,2021-11-13 15:27:48,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n\nusing namespace std;\n\nconst int mod = 1e9 + 7;\n\nint main()\n{\n\tint n, q, left, right, price = 1;\n\tcin >> n;\n\tint* orange = new int[n];\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tcin >> orange[i];\n\t}\n\tcin >> q;\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tcin >> left >> right;\n\t\tfor (int j = left-1; j < right; j++)\n\t\t{\n\t\t\tprice *= orange[j];\n\t\t}\n\t\tprice = price % mod;\n\t\tcout << price << endl;\n\t\tprice = 1;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,8,508
1459431666866634752,331a8a945c98789f0dcd885f1c4f0a79064c1fa7bb730b8756cc453e93341120,2021-11-13 16:03:18,Java,150.0,1375730370158333955,1367128166761762816,1139562740855824384,\nimport java.util.Scanner;\n\n/**\n * @ClassName: test\n * @Description:\n * @Author syk\n * @Date 2021/11/11\n * @Version 1.0\n */\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        // long start = System.currentTimeMillis();\n\n        int n = scanner.nextInt();\n        int[] arr = new int[n];\n        for (int i = 0; i < n; i++) {\n            arr[i] = scanner.nextInt();\n        }\n        int m = scanner.nextInt();\n        int[] result = new int[m];\n        for (int i = 0; i < m; i++) {\n            int left = scanner.nextInt();\n            int right = scanner.nextInt();\n            result[i] = 1;\n            for (int j = left - 1; j < right; j++) {\n                result[i] = (result[i] % (1000000000 + 7)) * (arr[j] % (1000000000 + 7));\n            }\n        }\n        for (int i = 0; i < m; i++) {\n            System.out.println(result[i]);\n        }\n        // System.out.println(System.currentTimeMillis() - start);\n    }\n},PARTIAL_ACCEPTED,384,22872
1459446011259932672,331a8a945c98789f0dcd885f1c4f0a79064c1fa7bb730b8756cc453e93341120,2021-11-13 17:00:18,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"class Program\n{\n    static Int64 M=1000000007;\n    static Int64 power(Int64 a, Int64 n)\n    {\n        Int64 ot = 1;\n        while (n>0){\n            if (n%2==1) ot = ot * a % M; \n            a = a * a % M;\n            n >>= 1;\n        }\n        return ot%M;\n    }\n    static Int64 inv(Int64 x)\n    {\n        return power(x, M - 2); \n    }\n    static void Main(string[] args)\n    {\n        int n = int.Parse(Console.ReadLine());\n        \n        Int64[] a = Array.ConvertAll(Console.ReadLine().Split(' '), Int64.Parse);\n        Int64[] s = new Int64[n];\n        s[0] = a[0] % M;\n        for (int i = 1; i < n; i++) s[i] = s[i - 1] * a[i] % M;\n     \n        int Q=int.Parse(Console.ReadLine());\n        while (Q-->0){\n            int L, R;\n            int[]input= Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            L = input[0]-1;R = input[1]-1;\n            Int64 ans;\n            if (L > 0) ans = s[R] * inv(s[L - 1]) % M;\n            else ans = s[R] % M;\n            Console.WriteLine(ans.ToString());\n        }\n    }\n}",COMPILE_ERROR,0,0
1459446115262447616,331a8a945c98789f0dcd885f1c4f0a79064c1fa7bb730b8756cc453e93341120,2021-11-13 17:00:43,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nconst int M=1e9+7;\ntypedef long long ll;\nll power(ll a, ll n)\n{\n    ll ot=1;\n    while(n)\n    {\n        if(n&1) ot=ot*a%M;\n        a=a*a%M;\n        n>>=1;\n    }\n    return ot;\n}\nll inv(ll x)\n{\n    return power(x,M-2);\n}\nint main()\n{\n    int n;\n    cin>>n;\n    ll a[n+1];\n    ll s[n+1];\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a[i];\n    }\n    s[0]=1;\n    for(int i=1;i<=n;i++)\n    {\n        s[i]=s[i-1]*a[i]%M;\n    }\n    int Q;\n    cin>>Q;\n    while(Q--)\n    {\n        int L,R;\n        cin>>L>>R;\n        cout<<s[R] * inv(s[L-1])%M<<endl;\n    }\n}",ACCEPTED,228,2936
1464212889637122048,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-11-26 20:42:11,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\nusing namespace std;\nint Data[MAXSIZE];\nint n,q,L,R;\nint main()\n{\n\tcin>>n;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tcin>>q;\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tint sum=1;\n\t\tfor(int j=L;j<=R;j++)\n\t\t{\n\t\t\tsum*=Data[j];\n\t\t}\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n} ",PARTIAL_ACCEPTED,3,312
1464214697306648576,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-11-26 20:49:22,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL n,q,L,R;\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tfor(LL j=L;j<=R;j++)\n\t\t{\n\t\t\tsum*=Data[j];\n\t\t}\n\t\tcout<<sum%p<<endl;\n\t}\n\treturn 0;\n} ",PARTIAL_ACCEPTED,3,312
1464236780055302144,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-11-26 22:17:07,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i];\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=Sum[R]/Sum[L-1];\n\t\tcout<<sum%p<<endl;\n\t}\n\treturn 0;\n} ",PARTIAL_ACCEPTED,27,1976
1464237375983726592,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-11-26 22:19:29,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i];\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tif(Sum[L-1]!=0)  sum=Sum[R]/Sum[L-1];\n\t\tcout<<sum%p<<endl;\n\t}\n\treturn 0;\n} ",PARTIAL_ACCEPTED,268,2136
1468366108833964032,7300fa9090631066c4594fab4d31fc884e10c8d096b83ef9ff1873e260bb931a,2021-12-08 07:45:35,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<cstring> \n#include<math.h> \n#include<cstdio> \n#include<stack>\nusing namespace std;\nint c[1000010];\n\n\nint main(int argc, char** argv) \n{\n\t\n\t\tint n;cin>>n;\n\t\tlong long price[n+1];\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcin>>price[i];\n\t\t}\n\t\tint q;cin>>q;\n\t\tlong long money[q];\n\t\t//int a=1;\n\t\tfor(int i=0;i<q;i++){\n\t\t\tmoney[i]=1;\n\t\t}\n\t\tfor(int i=0;i<q;i++){\n\t\t\tint l,r;\n\t\t\tcin>>l>>r;\n\t\t\tfor(int j=l;j<=r;j++){\n\t\t\t\tmoney[i]*=price[j];\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<q;i++){\n\t\t\tlong long x=1e9+7;\n\t\t\tmoney[i]=money[i]%x;\n\t\t\tcout<<money[i]<<endl;\n\t\t} \n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\n\t\n\t\treturn 0;\n\t}\n\t",PARTIAL_ACCEPTED,3,448
1468495465149718528,076358a4337ef5385e5aa64e3ac4d87a7e9fc1595457a2e1503e795a7fbc1dbe,2021-12-08 16:19:36,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace LQB\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            string[] a=s.Split(' ');\n            int q = int.Parse(Console.ReadLine());\n            int[,] num = new int[q, 2];\n            int sum = 1;\n            for(int i = 0; i < q; i++)\n            {\n                int[] x = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                for(int j = 0; j <2; j++)\n                {\n                    num[i, j] = x[j];\n                }\n            }\n            int temp = 0;\n            while (temp < q)\n            {\n                for(int i = num[temp, 0]-1; i < num[temp, 1]; i++)\n                {\n                    sum = sum * int.Parse(a[i]);\n                }\n                temp++;\n                Console.WriteLine(\""{0}\"", sum%1000000007);\n                sum = 1;\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,24,3736
1468496072293662720,076358a4337ef5385e5aa64e3ac4d87a7e9fc1595457a2e1503e795a7fbc1dbe,2021-12-08 16:22:01,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace LQB\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            string[] a=s.Split(' ');\n            int q = int.Parse(Console.ReadLine());\n            int[,] num = new int[q, 2];\n            int sum = 1;\n            for(int i = 0; i < q; i++)\n            {\n                int[] x = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                for(int j = 0; j <2; j++)\n                {\n                    num[i, j] = x[j];\n                }\n            }\n            int temp = 0;\n            while (temp < q)\n            {\n                for(int i = num[temp, 0]-1; i < num[temp, 1]; i++)\n                {\n                    sum = sum * int.Parse(a[i]);\n                    sum = sum % 1000000007;\n                }\n                temp++;\n                Console.WriteLine(\""{0}\"",sum);\n                sum = 1;\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,25,3744
1468497031881764864,b061bdf2814d7e6fe0e069841195ffba3ad1fcc81e5f85166a4ba653b537100f,2021-12-08 16:25:50,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\n\nnamespace Rurirat给fffteam买橘子\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] arr = new int[n];\n            string[] str = Console.ReadLine().Split(' ');\n            for (int i = 0; i < n; i++)\n            {\n                arr[i] = int.Parse(str[i]);\n            }\n            int q = int.Parse(Console.ReadLine());\n            int[] l = new int[q]; int[] r = new int[q];\n            for (int i = 0; i < q; i++)\n            {\n                string[]str1=Console.ReadLine().Split(' ');\n                l[i] = int.Parse(str1[0]); r[i] = int.Parse(str1[1]);\n                if (i==q-1)\n                {\n                    for (int j = 0; j < q; j++)\n                    {\n                        Int64 o = 1;\n                        for (int z = l[j]-1; z <= r[j]-1; z++)\n                        {\n                            o *= arr[z];\n                        }\n                        Console.WriteLine(o);\n                        \n                    }\n                }\n                \n            }\n        }\n    }\n},COMPILE_ERROR,0,0
1468497055130673152,b061bdf2814d7e6fe0e069841195ffba3ad1fcc81e5f85166a4ba653b537100f,2021-12-08 16:25:55,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\n\nnamespace Rurirat给fffteam买橘子\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] arr = new int[n];\n            string[] str = Console.ReadLine().Split(' ');\n            for (int i = 0; i < n; i++)\n            {\n                arr[i] = int.Parse(str[i]);\n            }\n            int q = int.Parse(Console.ReadLine());\n            int[] l = new int[q]; int[] r = new int[q];\n            for (int i = 0; i < q; i++)\n            {\n                string[]str1=Console.ReadLine().Split(' ');\n                l[i] = int.Parse(str1[0]); r[i] = int.Parse(str1[1]);\n                if (i==q-1)\n                {\n                    for (int j = 0; j < q; j++)\n                    {\n                        Int64 o = 1;\n                        for (int z = l[j]-1; z <= r[j]-1; z++)\n                        {\n                            o *= arr[z];\n                        }\n                        Console.WriteLine(o);\n                        \n                    }\n                }\n                \n            }\n        }\n    }\n},PARTIAL_ACCEPTED,21,3608
1468503232528433152,8bcba3e263aa63bddc2e1986d63ac205a11839e5f3b5713287027691458de15b,2021-12-08 16:50:28,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace lanQiaoBei\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] a = new int[n];\n            string s = Console.ReadLine();\n            string[] vs = s.Split(' ');\n            for (int i = 0; i < vs.Length; i++)\n            {\n                a[i] = int.Parse(vs[i]);\n            }\n            int m = int.Parse(Console.ReadLine());\n            for (int i = 0; i < m; i++)\n            {\n                string str = Console.ReadLine();\n                string[] tmp = str.Split(' ');\n                int[] b = new int[2];\n                b[0] = int.Parse(tmp[0]);\n                b[1] = int.Parse(tmp[1]);\n                int sum = a[b[0]-1];\n                for (int j = b[0]-1; j < b[1]-1; j++)\n                {\n                    sum = sum * a[j+1];\n                }\n                Console.WriteLine(sum);\n            }\n        }\n    }\n}\n,PARTIAL_ACCEPTED,19,3624
1468503426296889344,8bcba3e263aa63bddc2e1986d63ac205a11839e5f3b5713287027691458de15b,2021-12-08 16:51:14,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace lanQiaoBei\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] a = new int[n];\n            string s = Console.ReadLine();\n            string[] vs = s.Split(' ');\n            for (int i = 0; i < vs.Length; i++)\n            {\n                a[i] = int.Parse(vs[i]);\n            }\n            int m = int.Parse(Console.ReadLine());\n            for (int i = 0; i < m; i++)\n            {\n                string str = Console.ReadLine();\n                string[] tmp = str.Split(' ');\n                int[] b = new int[2];\n                b[0] = int.Parse(tmp[0]);\n                b[1] = int.Parse(tmp[1]);\n                int sum = a[b[0]-1];\n                for (int j = b[0]-1; j < b[1]-1; j++)\n                {\n                    sum = sum * a[j+1];\n                }\n                Console.WriteLine(sum);\n            }\n        }\n    }\n}\n,PARTIAL_ACCEPTED,22,3924
1468529615365824512,7300fa9090631066c4594fab4d31fc884e10c8d096b83ef9ff1873e260bb931a,2021-12-08 18:35:18,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<cstring> \n#include<math.h> \n#include<cstdio> \n#include<stack>\nusing namespace std;\nint c[1000010];\n\n\nint main(int argc, char** argv) \n{\n\t\n\t\tint n;cin>>n;\n\t\tlong long price[n+1];\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcin>>price[i];\n\t\t}\n\t\tint q;cin>>q;\n\t\tlong long money=1;\n\t\t//int a=1;\n\t\t\n\t\t\n\t\tfor(int i=0;i<q;i++){\n\t\t\tint l,r;\n\t\t\tcin>>l>>r;\n\t\t\tfor(int j=l;j<=r;j++){\n\t\t\t\tmoney*=price[j];\n\t\t\t}\n            cout<<money<<endl;\n\t\t}\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\n\t\n\t\treturn 0;\n\t}\n\t",MULTIPLE_ERROR,3,456
1468533980617072640,0a608e4257dc5be3984f28f44f9471354d5769544382041002f5cc4aa035fd9c,2021-12-08 18:52:39,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\n\nnamespace 蓝桥杯_新生_买橘子\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n             int[] ar = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q=int.Parse(Console.ReadLine());\n            int[,] ak = new int[Q, 2];\n            for (int i = 0; i < Q; i++)\n            {\n                for (int j = 0; j < 2; j++)\n                {\n                    int[] ag= Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                    ag[j] = ak[i, j];\n                }\n            }\n            int sum1 = 1; int sum2 = 1;int sum3 = 1; int sum4 = 1;\n            for (int i = 0; i < Q; i++)\n            {\n                while (sum2<=ak[i,1])\n                {\n                    sum1 = sum1 * sum2;\n                    sum2++;\n                }\n                while (sum4 <= ak[i, 0])\n                {\n                    sum3 = sum3 * sum4;\n                    sum4++;\n                }\n                Console.WriteLine((sum1 / sum3));\n            }\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,163,15244
1468558506039623680,7300fa9090631066c4594fab4d31fc884e10c8d096b83ef9ff1873e260bb931a,2021-12-08 20:30:06,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<cstring> \n#include<math.h> \n#include<cstdio> \n#include<stack>\nusing namespace std;\nint c[1000010];\n\n\nint main(int argc, char** argv) \n{\n\t\n\t\tint n;cin>>n;\n\t\tlong long price[n+1];\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcin>>price[i];\n\t\t}\n\t\tint q;cin>>q;\n\t\tlong long money=1;\n\t\t//int a=1;\n\t\t\n\t\t\n\t\tfor(int i=0;i<q;i++){\n\t\t\tint l,r;\n\t\t\tcin>>l>>r;\n\t\t\tfor(int j=l;j<=r;j++){\n\t\t\t\tmoney*=price[j];\n                cout<<money<<endl;\n\t\t\t}\n            \n\t\t}\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\n\t\n\t\treturn 0;\n\t}\n\t",MULTIPLE_ERROR,4,608
1468558714244874240,7300fa9090631066c4594fab4d31fc884e10c8d096b83ef9ff1873e260bb931a,2021-12-08 20:30:56,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<cstring> \n#include<math.h> \n#include<cstdio> \n#include<stack>\nusing namespace std;\nint c[1000010];\n\n\nint main(int argc, char** argv) \n{\n\t\n\t\tint n;cin>>n;\n\t\tlong long price[n+1];\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcin>>price[i];\n\t\t}\n\t\tint q;cin>>q;\n\t\tlong long money=1;\n\t\t//int a=1;\n\t\t\n\t\t\n\t\tfor(int i=0;i<q;i++){\n\t\t\tint l,r;\n\t\t\tcin>>l>>r;\n\t\t\tfor(int j=l;j<=r;j++){\n\t\t\t\tmoney*=price[j];\n                \n\t\t\t}\n            cout<<money<<endl;\n                money=1;\n\t\t}\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\n\t\n\t\treturn 0;\n\t}\n\t",PARTIAL_ACCEPTED,4,448
1468602215379185664,3619eff39a43d701e6c18edc77bb105c269ebf919f8a9d4e2a0ff2ea64192d29,2021-12-08 23:23:48,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint b[10001];\nint main()\n{\n\tint n;\n\tlong long q;\n\tscanf(\""%d\"",&n);\n\tint a[n+1];\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%lld\"",&q);\n\tfor(int i=1;i<=2*q;i++)\n\t{\n\t\tscanf(\""%d\"",&b[i]);\n\t\tscanf(\""%d\"",&b[++i]);\n\t}\n\tint *p,*k,i=1,h;\n\tfor(int j=1;j<=q;j++)\n\t{\n\tunsigned long long sum=1;\n\tif(b[i]==0) break;\n\tp=&a[b[i]],k=&a[b[++i]]; \n\tfor(;p!=k+1;p++)\n\t{\n\t\tsum*=*p;\n\t}\n\th=1e9;\n\tprintf(\""%llu\\n\"",sum%(sum/h)+7);\n\ti++;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,15,844
1468602543210061824,3619eff39a43d701e6c18edc77bb105c269ebf919f8a9d4e2a0ff2ea64192d29,2021-12-08 23:25:06,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint b[10001];\nint main()\n{\n\tint n;\n\tlong long q;\n\tscanf(\""%d\"",&n);\n\tint a[n+1];\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%lld\"",&q);\n\tfor(int i=1;i<=2*q;i++)\n\t{\n\t\tscanf(\""%d\"",&b[i]);\n\t\tscanf(\""%d\"",&b[++i]);\n\t}\n\tint *p,*k,i=1,h;\n\tfor(int j=1;j<=q;j++)\n\t{\n\tunsigned long long sum=1;\n\tif(b[i]==0) break;\n\tp=&a[b[i]],k=&a[b[++i]]; \n\tfor(;p!=k+1;p++)\n\t{\n\t\tsum*=*p;\n\t}\n\th=1e9;\n\tprintf(\""%llu\\n\"",sum%(sum/h)+7);\n\ti++;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,15,836
1468602574073413632,3619eff39a43d701e6c18edc77bb105c269ebf919f8a9d4e2a0ff2ea64192d29,2021-12-08 23:25:13,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint b[10001];\nint main()\n{\n\tint n;\n\tlong long q;\n\tscanf(\""%d\"",&n);\n\tint a[n+1];\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%lld\"",&q);\n\tfor(int i=1;i<=2*q;i++)\n\t{\n\t\tscanf(\""%d\"",&b[i]);\n\t\tscanf(\""%d\"",&b[++i]);\n\t}\n\tint *p,*k,i=1,h;\n\tfor(int j=1;j<=q;j++)\n\t{\n\tunsigned long long sum=1;\n\tif(b[i]==0) break;\n\tp=&a[b[i]],k=&a[b[++i]]; \n\tfor(;p!=k+1;p++)\n\t{\n\t\tsum*=*p;\n\t}\n\th=1e9;\n\tprintf(\""%llu\\n\"",sum%(unsigned long long)(1.00*sum/h)+7);\n\ti++;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,16,840
1468603420509126656,3619eff39a43d701e6c18edc77bb105c269ebf919f8a9d4e2a0ff2ea64192d29,2021-12-08 23:28:35,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint b[10001];\nint main()\n{\n\tint n;\n\tlong long q;\n\tscanf(\""%d\"",&n);\n\tint a[n+4];\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%lld\"",&q);\n\tfor(int i=1;i<=2*q;i++)\n\t{\n\t\tscanf(\""%d\"",&b[i]);\n\t\tscanf(\""%d\"",&b[++i]);\n\t}\n\tint *p,*k,i=1,h;\n\tfor(int j=1;j<=q;j++)\n\t{\n\tunsigned long long sum=1;\n\tif(b[i]==0) break;\n\tp=&a[b[i]],k=&a[b[++i]]; \n\tfor(;p!=k+1;p++)\n\t{\n\t\tsum*=*p;\n\t}\n\th=1e9;\n\tprintf(\""%llu\\n\"",sum%(sum/(h+7)));\n\ti++;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,16,712
1468603776654323712,3619eff39a43d701e6c18edc77bb105c269ebf919f8a9d4e2a0ff2ea64192d29,2021-12-08 23:30:00,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint b[1001];\nint main()\n{\n\tint n;\n\tlong long q;\n\tscanf(\""%d\"",&n);\n\tint a[n+4];\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%lld\"",&q);\n\tfor(int i=1;i<=2*q;i++)\n\t{\n\t\tscanf(\""%d\"",&b[i]);\n\t\tscanf(\""%d\"",&b[++i]);\n\t}\n\tint *p,*k,i=1;\n\tfor(int j=1;j<=q;j++)\n\t{\n\tunsigned long long sum=1,h;\n\tif(b[i]==0) break;\n\tp=&a[b[i]],k=&a[b[++i]]; \n\tfor(;p!=k+1;p++)\n\t{\n\t\tsum*=*p;\n\t}\n\th=1e9;\n\tprintf(\""%llu\\n\"",sum%(sum/(h+7)));\n\ti++;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,16,872
1468604151081385984,3619eff39a43d701e6c18edc77bb105c269ebf919f8a9d4e2a0ff2ea64192d29,2021-12-08 23:31:29,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<stdio.h>\nint b[1001];\nint main()\n{\n\tint n;\n\tlong long q;\n\tscanf(\""%d\"",&n);\n\tint a[n+4];\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tscanf(\""%d\"",&a[i]);\n\t}\n\tscanf(\""%lld\"",&q);\n\tfor(int i=1;i<=2*q;i++)\n\t{\n\t\tscanf(\""%d\"",&b[i]);\n\t\tscanf(\""%d\"",&b[++i]);\n\t}\n\tint *p,*k,i=1;\n\tfor(int j=1;j<=q;j++)\n\t{\n\tunsigned long long sum=1,h;\n\tif(b[i]==0) break;\n\tp=&a[b[i]],k=&a[b[++i]]; \n\tfor(;p!=k+1;p++)\n\t{\n\t\tsum*=*p;\n\t}\n\th=1e9;\n\tprintf(\""%llu\\n\"",sum%(unsigned long long)(1.00*sum/(h+7)));\n\ti++;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,17,696
1468727806104879104,c118514b9494c219ce92d2176fb3e7a2095835e5de0066e8d43db71c7f5bc672,2021-12-09 07:42:51,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nconst int M=1e9+7;\ntypedef long long ll;\nll power(ll a, ll n)\n{\n    ll ot=1;\n    while(n)\n    {\n        if(n&1) ot=ot*a%M;\n        a=a*a%M;\n        n>>=1;\n    }\n    return ot;\n}\nll inv(ll x)\n{\n    return power(x,M-2);\n}\nint main()\n{\n    int n;\n    cin>>n;\n    ll a[n+1];\n    ll s[n+1];\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a[i];\n    }\n    s[0]=1;\n    for(int i=1;i<=n;i++)\n    {\n        s[i]=s[i-1]*a[i]%M;\n    }\n    int Q;\n    cin>>Q;\n    while(Q--)\n    {\n        int L,R;\n        cin>>L>>R;\n        cout<<s[R] * inv(s[L-1])%M<<endl;\n    }\n}",ACCEPTED,267,2868
1468754466051547136,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 09:28:47,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i];\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tif(Sum[L-1]!=0)  sum=Sum[R]/Sum[L-1];\n\t\tcout<<sum%p<<endl;\n\t}\n\treturn 0;\n} ",PARTIAL_ACCEPTED,266,2084
1468757055364841472,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 09:39:04,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nLL power(LL x,LL m)\n{\n\tif(m==0) return 1;\n\tx%=p;\n\tif(x%1) return (x*power(x,m-1))%p;\n\telse \n\t{\n\t\tLL t=power(x,m/2)%p;\n\t\treturn (t*t)%p;\n\t}\n} \nLL Nav(int x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i];\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tif(Sum[L-1]!=0)  sum=Sum[R]*Nav(Sum[L-1]);\n\t\tcout<<sum%p<<endl;\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,283,2236
1468757929415852032,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 09:42:33,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nLL power(LL x,LL m)\n{\n\tif(m==0) return 1;\n\tx%=p;\n\tif(x%1) return (x*power(x,m-1))%p;\n\telse \n\t{\n\t\tLL t=power(x,m/2)%p;\n\t\treturn (t*t)%p;\n\t}\n} \nLL Nav(int x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tif(Sum[L-1]!=0)  sum=Sum[R]*Nav(Sum[L-1])%p;\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,359,2892
1468759410869190656,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 09:48:26,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nLL power(LL x,LL m)\n{\n\tint ans=1,a=x,b=m;\n\twhile(b)\n\t{\n\t\tif(b%1) \n\t\t{\n\t\t\tans=ans*a%p;\n\t\t}\n\t\ta=a*a%p;\n\t\tb>>=1;\t\n\t}\n\treturn ans;\n} \nLL Nav(int x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tif(Sum[L-1]!=0)  sum=Sum[R]*Nav(Sum[L-1])%p;\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,298,3028
1468759968887783424,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 09:50:39,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nLL power(LL x,LL m)\n{\n\tint ans=1,a=x,b=m;\n\twhile(b)\n\t{\n\t\tif(b%1) \n\t\t{\n\t\t\tans=ans*a%p;\n\t\t}\n\t\ta=a*a%p;\n\t\tb>>=1;\t\n\t}\n\treturn ans;\n} \nLL Nav(int x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tcout<<Sum[R]*Nav(Sum[L-1])%p<<endl;\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,272,2896
1468760117968814080,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 09:51:15,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nconst int M=1e9+7;\ntypedef long long ll;\nll power(ll a, ll n)\n{\n    ll ot=1;\n    while(n)\n    {\n        if(n&1) ot=ot*a%M;\n        a=a*a%M;\n        n>>=1;\n    }\n    return ot;\n}\nll inv(ll x)\n{\n    return power(x,M-2);\n}\nint main()\n{\n    int n;\n    cin>>n;\n    ll a[n+1];\n    ll s[n+1];\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a[i];\n    }\n    s[0]=1;\n    for(int i=1;i<=n;i++)\n    {\n        s[i]=s[i-1]*a[i]%M;\n    }\n    int Q;\n    cin>>Q;\n    while(Q--)\n    {\n        int L,R;\n        cin>>L>>R;\n        cout<<s[R] * inv(s[L-1])%M<<endl;\n    }\n}",ACCEPTED,278,2968
1468760693921898496,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 09:53:32,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nconst int M=1e9+7;\ntypedef long long ll;\nll power(ll x,ll m)\n{\n\tif(m==0) return 1;\n\tx%=M;\n\tif(x%1) return (x*power(x,m-1))%M;\n\telse \n\t{\n\t\tll t=power(x,m/2)%M;\n\t\treturn (t*t)%M;\n\t}\n} \nll Nav(int x)\n{\n\treturn power(x,M-2);\n}\nint main()\n{\n    int n;\n    cin>>n;\n    ll a[n+1];\n    ll s[n+1];\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a[i];\n    }\n    s[0]=1;\n    for(int i=1;i<=n;i++)\n    {\n        s[i]=s[i-1]*a[i]%M;\n    }\n    int Q;\n    cin>>Q;\n    while(Q--)\n    {\n        int L,R;\n        cin>>L>>R;\n        cout<<s[R] * Nav(s[L-1])%M<<endl;\n    }\n}",WRONG_ANSWER,303,2900
1468760976857415680,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 09:54:39,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nLL power(LL x,LL m)\n{\n\tLL ans=1,a=x,b=m;\n\twhile(b)\n\t{\n\t\tif(b%1) \n\t\t{\n\t\t\tans=ans*a%p;\n\t\t}\n\t\ta=a*a%p;\n\t\tb>>=1;\t\n\t}\n\treturn ans;\n} \nLL Nav(LL x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tcout<<Sum[R]*Nav(Sum[L-1])%p<<endl;\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,272,2988
1468762079864209408,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 09:59:02,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n;\nLL power(LL x,LL m)\n{\n\tLL ans=1;\n\twhile(m)\n\t{\n\t\tif(m%1==1) \n\t\t{\n\t\t\tans=ans*x%p;\n\t\t}\n\t\tx=x*x%p;\n\t\tm>>=1;\t\n\t}\n\treturn ans;\n} \nLL Nav(LL x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tint q;\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tint L,R;\n\t\tcin>>L>>R;\n\t\tcout<<Sum[R]*Nav(Sum[L-1])%p<<endl;\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,298,3032
1468762555934490624,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 10:00:56,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=1e9+7;\nusing namespace std;\nLL n;\nLL power(LL x,LL m)\n{\n\tLL ans=1;\n\twhile(m)\n\t{\n\t\tif(m%1==1) \n\t\t{\n\t\t\tans=ans*x%p;\n\t\t}\n\t\tx=x*x%p;\n\t\tm>>=1;\t\n\t}\n\treturn ans;\n} \nLL Nav(LL x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tLL Data[n+1];\n\tLL Sum[n+1];\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tint q;\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tint L,R;\n\t\tcin>>L>>R;\n\t\tcout<<Sum[R]*Nav(Sum[L-1])%p<<endl;\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,279,2936
1468763063401787392,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 10:02:57,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nconst int M=1e9+7;\ntypedef long long ll;\nll power(ll x,ll m)\n{\n\tif(m==0) return 1;\n\tx%=M;\n\tif(x%2) return (x*power(x,m-1))%M;\n\telse \n\t{\n\t\tll t=power(x,m/2)%M;\n\t\treturn (t*t)%M;\n\t}\n} \nll Nav(int x)\n{\n\treturn power(x,M-2);\n}\nint main()\n{\n    int n;\n    cin>>n;\n    ll a[n+1];\n    ll s[n+1];\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a[i];\n    }\n    s[0]=1;\n    for(int i=1;i<=n;i++)\n    {\n        s[i]=s[i-1]*a[i]%M;\n    }\n    int Q;\n    cin>>Q;\n    while(Q--)\n    {\n        int L,R;\n        cin>>L>>R;\n        cout<<s[R] * Nav(s[L-1])%M<<endl;\n    }\n}",SEGMENTATION_FAULT,40,8760
1468763532934692864,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 10:04:49,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nLL power(LL x,LL m)\n{\n\tint ans=1,a=x,b=m;\n\twhile(b)\n\t{\n\t\tif(b%2) \n\t\t{\n\t\t\tans=ans*a%p;\n\t\t}\n\t\ta=a*a%p;\n\t\tb>>=1;\t\n\t}\n\treturn ans;\n} \nLL Nav(LL x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tif(Sum[L-1]!=0)  sum=Sum[R]*Nav(Sum[L-1])%p;\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,314,2776
1468764045716406272,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 10:06:51,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\nusing namespace std;\nconst int M=1e9+7;\ntypedef long long ll;\n/*ll power(ll x,ll m)\n{\n\tif(m==0) return 1;\n\tx%=M;\n\tif(x%2) return (x*power(x,m-1))%M;\n\telse \n\t{\n\t\tll t=power(x,m/2)%M;\n\t\treturn (t*t)%M;\n\t}\n} \nll Nav(int x)\n{\n\treturn power(x,M-2);\n}*/\nll power(ll x,ll m)\n{\n\tint ans=1,a=x,b=m;\n\twhile(b)\n\t{\n\t\tif(b%2==1) \n\t\t{\n\t\t\tans=ans*a%M;\n\t\t}\n\t\ta=a*a%M;\n\t\tb>>=1;\t\n\t}\n\treturn ans;\n} \nll Nav(ll x)\n{\n\treturn power(x,M-2);\n}\nint main()\n{\n    int n;\n    cin>>n;\n    ll a[n+1];\n    ll s[n+1];\n    for(int i=1;i<=n;i++)\n    {\n        cin>>a[i];\n    }\n    s[0]=1;\n    for(int i=1;i<=n;i++)\n    {\n        s[i]=s[i-1]*a[i]%M;\n    }\n    int Q;\n    cin>>Q;\n    while(Q--)\n    {\n        int L,R;\n        cin>>L>>R;\n        cout<<s[R] * Nav(s[L-1])%M<<endl;\n    }\n}",WRONG_ANSWER,302,2548
1468764544745955328,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 10:08:50,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nLL power(LL a, LL n)\n{\n    LL ot=1;\n    while(n)\n    {\n        if(n&1) ot=ot*a%p;\n        a=a*a%p;\n        n>>=1;\n    }\n    return ot;\n}\nLL inv(LL x)\n{\n    return power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tif(Sum[L-1]!=0)  sum=Sum[R]*inv(Sum[L-1])%p;\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n} ",ACCEPTED,300,2900
1468764779212095488,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 10:09:46,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nLL power(LL x,LL m)\n{\n\tint ans=1,a=x,b=m;\n\twhile(b)\n\t{\n\t\tif(b&1) \n\t\t{\n\t\t\tans=ans*a%p;\n\t\t}\n\t\ta=a*a%p;\n\t\tb>>=1;\t\n\t}\n\treturn ans;\n} \nLL Nav(LL x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tif(Sum[L-1]!=0)  sum=Sum[R]*Nav(Sum[L-1])%p;\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n} ",WRONG_ANSWER,312,2868
1468764961114865664,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 10:10:29,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nLL power(LL x,LL m)\n{\n\tLL ans=1,a=x,b=m;\n\twhile(b)\n\t{\n\t\tif(b%2==1) \n\t\t{\n\t\t\tans=ans*a%p;\n\t\t}\n\t\ta=a*a%p;\n\t\tb>>=1;\t\n\t}\n\treturn ans;\n} \nLL Nav(LL x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tif(Sum[L-1]!=0)  sum=Sum[R]*Nav(Sum[L-1])%p;\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n} ",ACCEPTED,346,3008
1468765586326208512,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 10:12:58,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nLL power(LL x,LL m)\n{\n\tif(m==0) return 1;\n\tx%=p;\n\tif(x%2) return (x*power(x,m-1))%p;\n\telse \n\t{\n\t\tLL t=power(x,m/2)%p;\n\t\treturn (t*t)%p;\n\t}\n} \nLL Nav(LL x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tif(Sum[L-1]!=0)  sum=Sum[R]*Nav(Sum[L-1])%p;\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n} ",SEGMENTATION_FAULT,46,10296
1468768370597244928,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 10:24:02,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nLL power(LL x,LL m)\n{\n\tif(m==0) return 1;\n//\tx%=p;\n\tif(m%2==1) return x*power(x,m-1)%p;\n\telse \n\t{\n\t\tLL t=power(x,m/2);\n\t\treturn t*t%p;\n\t}\n} \nLL Nav(LL x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tif(Sum[L-1]!=0)  sum=Sum[R]*Nav(Sum[L-1])%p;\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n} ",ACCEPTED,359,3020
1468768404483026944,07ea802c45d6c9893b60706dc6c535bcbc039ce6ec8b67fbf2cc836aab10fecb,2021-12-09 10:24:10,C++,300.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\n#define MAXSIZE 100000\ntypedef unsigned long long LL;\nLL p=(1e+9)+7;\nusing namespace std;\n\nLL Data[MAXSIZE];\nLL Sum[MAXSIZE];\nLL n,q,L,R;\nLL power(LL x,LL m)\n{\n\tif(m==0) return 1;\n//\tx%=p;\n\tif(m%2==1) return x*power(x,m-1)%p;\n\telse \n\t{\n\t\tLL t=power(x,m/2);\n\t\treturn t*t%p;\n\t}\n} \nLL Nav(LL x)\n{\n\treturn power(x,p-2);\n}\nint main()\n{\n\tcin>>n;\n\tfor(LL i=1;i<=n;i++)\n\t{\n\t\tcin>>Data[i];\n\t}\n\tSum[0]=1; \n\tfor(int i=1;i<=n;i++)\n\tSum[i]=Sum[i-1]*Data[i]%p;\n\t\n\tcin>>q;\n\tfor(LL i=0;i<q;i++)\n\t{\n\t\tcin>>L>>R;\n\t\tLL sum=1;\n\t\tif(Sum[L-1]!=0)  sum=Sum[R]*Nav(Sum[L-1])%p;\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n} ",ACCEPTED,341,3040
1468815655385612288,54ee48d2552a41130348c484b11d955e2c83678c1eef9d23236f356cfdbe7a6b,2021-12-09 13:31:56,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace _5\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n\n            int n = Convert.ToInt32(Console.ReadLine());\n            int[] a = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q = Convert.ToInt32(Console.ReadLine());\n            int L = 0, R = 0;\n            int price = 1;\n            for (int i = 0; i < Q; i++)\n            {\n                int[] arr = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                L = arr[0];\n                R = arr[1];\n            }\n            for (int j = 0; j < Q; j++)\n            {\n                if (L == R)\n                {\n                    price = a[L];\n                }\n                else if (L - R == 1)\n                {\n                    price = a[L] * a[R];\n\n                }\n                else if (L - R > 1)\n                {\n                    for (int i = R; i <= L; i++)\n                    {\n                        price *= a[i];\n                    }\n                }\n                Console.WriteLine(price);\n            }\n\n            Console.ReadLine();\n\n        }\n    }\n}\n",WRONG_ANSWER,611,14668
1468817059466625024,54ee48d2552a41130348c484b11d955e2c83678c1eef9d23236f356cfdbe7a6b,2021-12-09 13:37:30,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,5\n1 2 3 4 5\n2\n1 5\n2 4,COMPILE_ERROR,0,0
1468817080828215296,54ee48d2552a41130348c484b11d955e2c83678c1eef9d23236f356cfdbe7a6b,2021-12-09 13:37:36,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace _5\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n\n            int n = Convert.ToInt32(Console.ReadLine());\n            int[] a = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q = Convert.ToInt32(Console.ReadLine());\n            int L = 0, R = 0;\n            int price = 1;\n            for (int j = 0; j < Q; j++)\n            {\n                int[] arr = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                L = arr[0];\n                R = arr[1];\n                if (L == R)\n                {\n                    price = a[L];\n                    Console.WriteLine(price);\n                }\n                else if (R - L == 1)\n                {\n                    price = a[L] * a[R];\n                    Console.WriteLine(price);\n                }\n                else if (R - L > 1)\n                {\n                    for (int i = L; i <= R; i++)\n                    {\n                        price *= a[i];\n                        Console.WriteLine(price);\n                    }\n                }\n            }\n            Console.ReadLine();\n        }\n    }\n}\n",MULTIPLE_ERROR,20,3228
1468817256787304448,54ee48d2552a41130348c484b11d955e2c83678c1eef9d23236f356cfdbe7a6b,2021-12-09 13:38:17,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace _5\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n\n            int n = Convert.ToInt32(Console.ReadLine());\n            int[] a = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q = Convert.ToInt32(Console.ReadLine());\n            int L = 0, R = 0;\n            int price = 1;\n            for (int j = 0; j < Q; j++)\n            {\n                int[] arr = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                L = arr[0];\n                R = arr[1];\n                if (L == R)\n                {\n                    price = a[L];\n                    Console.WriteLine(price);\n                    continue;\n                }\n                else if (R - L == 1)\n                {\n                    price = a[L] * a[R];\n                    Console.WriteLine(price);\n                    continue;\n                }\n                else if (R - L > 1)\n                {\n                    for (int i = L; i <= R; i++)\n                    {\n                        price *= a[i];\n                        Console.WriteLine(price);\n                        continue;\n                    }\n                }\n            }\n            Console.ReadLine();\n        }\n    }\n}\n",MULTIPLE_ERROR,20,3120
1468818278079709184,54ee48d2552a41130348c484b11d955e2c83678c1eef9d23236f356cfdbe7a6b,2021-12-09 13:42:21,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace _5\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n\n            int n = Convert.ToInt32(Console.ReadLine());\n            int[] a = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q = Convert.ToInt32(Console.ReadLine());\n            int L = 0, R = 0;\n            int price = 1;\n            for (int j = 0; j < Q; j++)\n            {\n                int[] arr = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                L = arr[0];\n                R = arr[1];\n                if (L == R)\n                {\n                    price = a[L];\n                    Console.WriteLine(price);\n                    continue;\n                }\n                else if (R - L == 1)\n                {\n                    price = a[L] * a[R];\n                    Console.WriteLine(price);\n                    continue;\n                }\n                else if (R - L > 1)\n                {\n                    for (int i = L; i < R; i++)\n                    {\n                        price *= a[i];\n                        Console.WriteLine(price);\n                        continue;\n                    }\n                }\n            }\n            Console.ReadLine();\n        }\n    }\n}\n",MULTIPLE_ERROR,20,3084
1468819831856742400,54ee48d2552a41130348c484b11d955e2c83678c1eef9d23236f356cfdbe7a6b,2021-12-09 13:48:31,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace _5\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n\n            int n = Convert.ToInt32(Console.ReadLine());\n            int[] a = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q = Convert.ToInt32(Console.ReadLine());\n            int L = 0, R = 0;\n            int price = 1;\n            for (int j = 0; j < Q; j++)\n            {\n                price = 1;\n                int[] arr = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                L = arr[0];\n                R = arr[1];\n                if (L == R)\n                {\n                    price = a[L];\n                    Console.WriteLine(price);\n           \n                }\n                else if (R - L == 1)\n                {\n                    price = a[L] * a[R];\n                    Console.WriteLine(price);\n        \n                }\n                else if (R - L > 1)\n                {\n                    for (int i = L; i < R; i++)\n                    {\n                        price *= a[i];\n                    }\n                    Console.WriteLine(price);\n                }\n            }\n            Console.ReadLine();\n        }\n    }\n}\n",MULTIPLE_ERROR,22,3028
1468820406529605632,076358a4337ef5385e5aa64e3ac4d87a7e9fc1595457a2e1503e795a7fbc1dbe,2021-12-09 13:50:48,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace LQB\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            string[] a=s.Split(' ');\n            int q = int.Parse(Console.ReadLine());\n            int[,] num = new int[q, 2];\n            int sum = 1;\n            for(int i = 0; i < q; i++)\n            {\n                int[] x = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                for(int j = 0; j <2; j++)\n                {\n                    num[i, j] = x[j];\n                }\n            }\n            int temp = 0;\n            while (temp < q)\n            {\n                for(int i = num[temp, 0]-1; i < num[temp, 1]; i++)\n                {\n                    sum = sum * int.Parse(a[i]);\n                    sum = sum % 1000000007;\n                }\n                temp++;\n                Console.WriteLine(\""{0}\"",sum);\n                sum = 1;\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,21,3760
1468820604416516096,54ee48d2552a41130348c484b11d955e2c83678c1eef9d23236f356cfdbe7a6b,2021-12-09 13:51:36,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace _5\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n\n            int n = Convert.ToInt32(Console.ReadLine());\n            int[] a = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q = Convert.ToInt32(Console.ReadLine());\n            int L = 0, R = 0;\n            int price = 1;\n            for (int j = 0; j < Q; j++)\n            {\n                price = 1;\n                int[] arr = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                L = arr[0];\n                R = arr[1];\n                if (L == R)\n                {\n                    price = a[L];\n                    Console.WriteLine(price);\n           \n                }\n                else if (R - L == 1)\n                {\n                    price = a[L] * a[R];\n                    Console.WriteLine(price);\n        \n                }\n                else if (R - L > 1)\n                {\n                    for (int i = L-1; i < R; i++)\n                    {\n                        price *= a[i];\n                    }\n                    Console.WriteLine(price);\n                }\n            }\n            Console.ReadLine();\n        }\n    }\n}\n",MULTIPLE_ERROR,20,3384
1468820759110955008,54ee48d2552a41130348c484b11d955e2c83678c1eef9d23236f356cfdbe7a6b,2021-12-09 13:52:13,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace _5\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n\n            int n = Convert.ToInt32(Console.ReadLine());\n            int[] a = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q = Convert.ToInt32(Console.ReadLine());\n            int L = 0, R = 0;\n            int price = 1;\n            for (int j = 0; j < Q; j++)\n            {\n                price = 1;\n                int[] arr = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                L = arr[0];\n                R = arr[1];\n                //if (L == R)\n                //{\n                //    price = a[L];\n                //    Console.WriteLine(price);\n           \n                //}\n                //else if (R - L == 1)\n                //{\n                //    price = a[L] * a[R];\n                //    Console.WriteLine(price);\n        \n                //}\n                //else if (R - L > 1)\n                //{\n                    for (int i = L-1; i < R; i++)\n                    {\n                        price *= a[i];\n                    }\n                    Console.WriteLine(price);\n                //}\n            }\n            Console.ReadLine();\n        }\n    }\n}\n",PARTIAL_ACCEPTED,21,3800
1468829712852631552,0a608e4257dc5be3984f28f44f9471354d5769544382041002f5cc4aa035fd9c,2021-12-09 14:27:47,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\n\nnamespace 蓝桥杯_新生_买橘子\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n             int[] ar = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int Q=int.Parse(Console.ReadLine());\n            int[,] ak = new int[Q, 2];\n            for (int i = 0; i < Q; i++)\n            {\n                for (int j = 0; j < 2; j++)\n                {\n                    int[] ag= Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                    ag[j] = ak[i, j];\n                }\n            }\n            int sum1 = 1; int sum2 = 1;int sum3 = 1; int sum4 = 1;\n            for (int i = 0; i < Q; i++)\n            {\n                while (sum2<=ak[i,1])\n                {\n                    sum1 = sum1 * sum2;\n                    sum2++;\n                }\n                while (sum4 <= ak[i, 0])\n                {\n                    sum3 = sum3 * sum4;\n                    sum4++;\n                }\n                Console.WriteLine((sum1 / sum3));\n            }\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,157,15240
1468832742304591872,11b5ffc650043cd69cb47dafa2628cb06da7a182ab41e438ad79e5cc388883c8,2021-12-09 14:39:50,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 榨汁机\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            s = s.Trim();\n            int[] a = Array.ConvertAll<string,int>(s.Split(' '), int.Parse);\n            int q = int.Parse(Console.ReadLine());\n            for (int i = 0; i < q; i++)\n            {\n                int[] b = Array.ConvertAll<string,int>(Console.ReadLine().Split(' '), int.Parse);\n                ulong num = 1;\n                for (int j = b[0]; j <= b[1]; j++)\n                {\n                    num *=(ulong) a[j - 1];\n                }\n                num =(ulong)( num % (Math.Pow(10, 9) + 7));\n                Console.WriteLine(num);\n\n\n            }\n\n        }\n    }\n}\n",PARTIAL_ACCEPTED,25,3868
1468834444646637568,ec9a6a7026e4c78d3d8bd413c0bf0ccbe722343cca4bc1a5b3d9dfe437f8452b,2021-12-09 14:46:35,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace Rurirat给fffteam买橘子\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string[] a = Console.ReadLine().Split(' ');\n            int Q = int.Parse(Console.ReadLine());\n            ulong[] b = new ulong[Q];\n            for (int i = 1; i <= Q; i++)\n            {\n                string s = Console.ReadLine();\n                int L = int.Parse(s.Substring(0, s.IndexOf(\"" \"")));\n                int R = int.Parse(s.Substring(s.IndexOf(\"" \"")+1));\n                b[i - 1] = 1;\n                for (int j = L ; j <= R ; j++)\n                {\n                    b[i-1] *= ulong.Parse(a[j-1]);\n                }\n            }\n            for (int i = 0; i < Q; i++)\n            {\n                Console.WriteLine(b[i]%(Math .Pow (10,9)+7));\n            }\n            Console.ReadKey();\n        }\n    }\n}\n",PARTIAL_ACCEPTED,24,3836
1468834931030712320,11b5ffc650043cd69cb47dafa2628cb06da7a182ab41e438ad79e5cc388883c8,2021-12-09 14:48:31,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 榨汁机\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            s = s.Trim();\n            int[] a = Array.ConvertAll<string,int>(s.Split(' '), int.Parse);\n            int q = int.Parse(Console.ReadLine());\n            for (int i = 0; i < q; i++)\n            {\n                int[] b = Array.ConvertAll<string,int>(Console.ReadLine().Split(' '), int.Parse);\n                int num = 1;\n                for (int j = b[0]; j <= b[1]; j++)\n                {\n                    num = num * (int)(a[j - 1] % (Math.Pow(10, 9) + 7));\n                }\n                num =(int)( num % (Math.Pow(10, 9) + 7));\n                Console.WriteLine(num);\n\n            }\n\n        }\n    }\n}\n",PARTIAL_ACCEPTED,21,3868
1468835507300384768,11b5ffc650043cd69cb47dafa2628cb06da7a182ab41e438ad79e5cc388883c8,2021-12-09 14:50:49,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 榨汁机\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            s = s.Trim();\n            int[] a = Array.ConvertAll<string,int>(s.Split(' '), int.Parse);\n            int q = int.Parse(Console.ReadLine());\n            int x = (int)(Math.Pow(10, 9) + 7);\n            for (int i = 0; i < q; i++)\n            {\n                int[] b = Array.ConvertAll<string,int>(Console.ReadLine().Split(' '), int.Parse);\n                int num = 1;\n                for (int j = b[0]; j <= b[1]; j++)\n                {\n                    num = num * (int)(a[j - 1] % x);\n                }\n                num =(int)( num % x);\n                Console.WriteLine(num);\n\n            }\n\n        }\n    }\n}\n",PARTIAL_ACCEPTED,21,3744
1468836869912313856,11b5ffc650043cd69cb47dafa2628cb06da7a182ab41e438ad79e5cc388883c8,2021-12-09 14:56:14,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 榨汁机\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            s = s.Trim();\n            int[] a = Array.ConvertAll<string,int>(s.Split(' '), int.Parse);\n            int q = int.Parse(Console.ReadLine());\n            int x = (int)(Math.Pow(10, 9) + 7);\n            for (int i = 0; i < q; i++)\n            {\n                int[] b = Array.ConvertAll<string,int>(Console.ReadLine().Split(' '), int.Parse);\n                int num = 1;\n                for (int j = b[0]; j <= b[1]; j++)\n                {\n                    num = num * (int)(a[j - 1] % x);\n                }\n                num =(int)( num % x);\n                Console.Write(num);\n            }\n\n        }\n    }\n}\n",MULTIPLE_ERROR,23,3712
1468836949011030016,11b5ffc650043cd69cb47dafa2628cb06da7a182ab41e438ad79e5cc388883c8,2021-12-09 14:56:32,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 榨汁机\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            s = s.Trim();\n            int[] a = Array.ConvertAll<string,int>(s.Split(' '), int.Parse);\n            int q = int.Parse(Console.ReadLine());\n            int x = (int)(Math.Pow(10, 9) + 7);\n            for (int i = 0; i < q; i++)\n            {\n                int[] b = Array.ConvertAll<string,int>(Console.ReadLine().Split(' '), int.Parse);\n                int num = 1;\n                for (int j = b[0]; j <= b[1]; j++)\n                {\n                    num = num * (int)(a[j - 1] % x);\n                }\n                num =(int)( num % x);\n                Console.WriteLine(num);\n            }\n\n        }\n    }\n}\n",PARTIAL_ACCEPTED,22,3708
1468844780646481920,9980b561e03fb9b154d28eddf2cab08f88e746587d4a71ddf37b0c4893c729fb,2021-12-09 15:27:40,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\nll n;\nll q;\nconst int N=100010;\nll a[N];\n\nint main(){\n    scanf(\""%lld\"",&n);\n    for(int i=1;i<=n;i++){\n        scanf(\""%lld\"",&a[i]);\n    }\n    scanf(\""%lld\"",q);\n    while(q--){\n        ll l,r;\n        scanf(\""%lld %lld\"",&l,&r);\n        ll sum=1;\n        for(int i=l;i<=r;i++){\n            sum*=a[i];\n        }\n        printf(\""%lld\"",(sum%(1000000000+7)));\n \n    }\n    \n\n                                                                               \n    \n    \n    system(\""pause\"");\n    return 0;  \n}",SEGMENTATION_FAULT,16,1332
1468844872311451648,9980b561e03fb9b154d28eddf2cab08f88e746587d4a71ddf37b0c4893c729fb,2021-12-09 15:28:02,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\nll n;\nll q;\nconst int N=100010;\nll a[N];\n\nint main(){\n    scanf(\""%lld\"",&n);\n    for(int i=1;i<=n;i++){\n        scanf(\""%lld\"",&a[i]);\n    }\n    scanf(\""%lld\"",q);\n    while(q--){\n        ll l,r;\n        scanf(\""%lld %lld\"",&l,&r);\n        ll sum=1;\n        for(int i=l;i<=r;i++){\n            sum*=a[i];\n        }\n        printf(\""%lld\"",(sum%(1000000000+7)));\n \n    }\n    \n\n\n    \n    \n    system(\""pause\"");\n    return 0;  \n}",SEGMENTATION_FAULT,16,1352
1468844970195468288,9980b561e03fb9b154d28eddf2cab08f88e746587d4a71ddf37b0c4893c729fb,2021-12-09 15:28:25,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\nll n;\nll q;\nconst int N=1000;\nll a[N];\n\nint main(){\n    scanf(\""%lld\"",&n);\n    for(int i=1;i<=n;i++){\n        scanf(\""%lld\"",&a[i]);\n    }\n    scanf(\""%lld\"",q);\n    while(q--){\n        ll l,r;\n        scanf(\""%lld %lld\"",&l,&r);\n        ll sum=1;\n        for(int i=l;i<=r;i++){\n            sum*=a[i];\n        }\n        printf(\""%lld\"",(sum%(1000000000+7)));\n \n    }\n    \n\n\n    \n    \n    system(\""pause\"");\n    return 0;  \n}",SEGMENTATION_FAULT,7,576
1468845063500644352,9980b561e03fb9b154d28eddf2cab08f88e746587d4a71ddf37b0c4893c729fb,2021-12-09 15:28:47,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\nll n;\nll q;\nconst int N=1000010;\nll a[N];\n\nint main(){\n    scanf(\""%lld\"",&n);\n    for(int i=1;i<=n;i++){\n        scanf(\""%lld\"",&a[i]);\n    }\n    scanf(\""%lld\"",q);\n    while(q--){\n        ll l,r;\n        scanf(\""%lld %lld\"",&l,&r);\n        ll sum=1;\n        for(int i=l;i<=r;i++){\n            sum*=a[i];\n        }\n        printf(\""%lld\"",(sum%(1000000000+7)));\n \n    }\n    \n\n\n    \n    \n    system(\""pause\"");\n    return 0;  \n}",SEGMENTATION_FAULT,14,1236
1468845357924007936,9980b561e03fb9b154d28eddf2cab08f88e746587d4a71ddf37b0c4893c729fb,2021-12-09 15:29:57,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef unsigned long long ll;\nll n;\nll q;\nconst int N=1000010;\nll a[N];\n\nint main(){\n    scanf(\""%lld\"",&n);\n    for(int i=1;i<=n;i++){\n        scanf(\""%lld\"",&a[i]);\n    }\n    scanf(\""%lld\"",q);\n    while(q--){\n        ll l,r;\n        scanf(\""%lld %lld\"",&l,&r);\n        ll sum=1;\n        for(int i=l;i<=r;i++){\n            sum*=a[i];\n        }\n        printf(\""%lld\"",(sum%(1000000000+7)));\n \n    }\n    \n\n\n    \n    \n    system(\""pause\"");\n    return 0;  \n}",SEGMENTATION_FAULT,17,1484
1468846180955271168,9980b561e03fb9b154d28eddf2cab08f88e746587d4a71ddf37b0c4893c729fb,2021-12-09 15:33:14,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\nll n;\nll q;\nconst int N=100010;\nll a[N];\n\nint main(){\n    scanf(\""%lld\"",&n);\n    for(int i=1;i<=n;i++){\n        scanf(\""%lld\"",&a[i]);\n    }\n    scanf(\""%lld\"",&q);\n    while(q--){\n        ll l,r;\n        scanf(\""%lld %lld\"",&l,&r);\n        ll sum=1;\n        for(int i=l;i<=r;i++){\n            sum*=a[i];\n        }\n        printf(\""%lld\"",(sum%(1000000000+7)));\n \n    }\n    \n\n                                                                               \n    \n    \n    system(\""pause\"");\n    return 0;  \n}",MULTIPLE_ERROR,6,696
1468846784872366080,9980b561e03fb9b154d28eddf2cab08f88e746587d4a71ddf37b0c4893c729fb,2021-12-09 15:35:38,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\nll n;\nll q;\nconst int N=100010;\nll a[N];\nll b[N];\nint main(){\n    scanf(\""%lld\"",&n);\n    for(int i=1;i<=n;i++){\n        scanf(\""%lld\"",&a[i]);\n    }\n    scanf(\""%lld\"",&q);\n    int k=0;\n    while(q--){\n        ll l,r;\n        scanf(\""%lld %lld\"",&l,&r);\n        ll sum=1;\n        for(int i=l;i<=r;i++){\n            sum*=a[i];\n        }\n        b[k++]=sum%(1000000000+7);\n \n    }\n    for(int i=0;i<k;i++){\n        printf(\""%lld\\n\"",b[i]);\n    }\n    \n\n                                                                               \n    \n    \n    system(\""pause\"");\n    return 0;  \n}",PARTIAL_ACCEPTED,4,732
1468852862657937408,7c31176201084f35ca3a74aefdf00ec73ac16bbdd53f68e00bd80d71a12c60f5,2021-12-09 15:59:47,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nint n;\nvector<int> a;\nint Q;\nint L, R;\n\nint main() {\n    cin >> n;\n    for (int i = 0; i < n; i++) {\n        int temp;\n        cin >> temp;\n        a.push_back(temp);\n    }\n    cin >> Q;\n    for (int i = 0; i < Q; i++) {\n        cin >> L >> R;\n        unsigned int s = 1;\n        for (int j = L - 1; j < R; j++) {\n            s *= a[j];\n        }\n        cout << (s % (unsigned int)(pow(10, 9) + 7));\n        if (i < Q - 1)\n            cout << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,4,316
1468853244395438080,7c31176201084f35ca3a74aefdf00ec73ac16bbdd53f68e00bd80d71a12c60f5,2021-12-09 16:01:18,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nint n;\nvector<int> a;\nint Q;\nint L, R;\n\nint main() {\n    cin >> n;\n    for (int i = 0; i < n; i++) {\n        int temp;\n        cin >> temp;\n        a.push_back(temp);\n    }\n    cin >> Q;\n    for (int i = 0; i < Q; i++) {\n        cin >> L >> R;\n        unsigned int s = 1;\n        for (int j = L - 1; j < R; j++) {\n            s *= a[j];\n            s %= (unsigned int)(pow(10, 9) + 7);\n        }\n        cout << s;\n        //cout << (s % (unsigned int)(pow(10, 9) + 7));\n        if (i < Q - 1)\n            cout << endl;\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,3,484
1468855560354226176,5547bd0d12eb5d447c57cafa5510d8ce6e98b6a5dcac2aefb57baac730cad7c2,2021-12-09 16:10:30,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\n\nnamespace Something_Interesting\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int num = int.Parse(Console.ReadLine());\n            int[] number = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int n = int.Parse(Console.ReadLine());\n            for (int i = 0; i < n; i++)\n            {\n                int[] nu = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                int nn = nu[0] - 1;\n                int nnu = 1;\n                while (nn<=nu[1]-1)\n                {\n                    nnu *= number[nn];\n                    nn++;\n                }\n                Console.WriteLine(\""{0}\"",nnu);\n            }            \n        }\n    }\n}",PARTIAL_ACCEPTED,22,3868
1468855610367225856,5547bd0d12eb5d447c57cafa5510d8ce6e98b6a5dcac2aefb57baac730cad7c2,2021-12-09 16:10:42,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\n\nnamespace Something_Interesting\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int num = int.Parse(Console.ReadLine());\n            int[] number = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int n = int.Parse(Console.ReadLine());\n            for (int i = 0; i < n; i++)\n            {\n                int[] nu = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                int nn = nu[0] - 1;\n                int nnu = 1;\n                while (nn<=nu[1]-1)\n                {\n                    nnu *= number[nn];\n                    nn++;\n                }\n                Console.WriteLine(\""{0}\"",nnu);\n            }            \n        }\n    }\n}",PARTIAL_ACCEPTED,22,3680
1468856829231849472,5547bd0d12eb5d447c57cafa5510d8ce6e98b6a5dcac2aefb57baac730cad7c2,2021-12-09 16:15:32,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\n\nnamespace Something_Interesting\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int num = int.Parse(Console.ReadLine());\n            int[] number = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int n = int.Parse(Console.ReadLine());\n            for (int i = 0; i < n; i++)\n            {\n                int[] nu = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n                int nn = nu[0] - 1;\n                int nnu = 1;\n                while (nn<=nu[1]-1)\n                {\n                    nnu *= number[nn];\n                    nn++;\n                }\n                nnu = nnu % 1000000007;\n                Console.WriteLine(\""{0}\"",nnu);\n            }\n        }\n    }\n}",PARTIAL_ACCEPTED,21,3588
1468876689894629376,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 17:34:27,Java,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"\nimport java.math.BigInteger;\nimport java.text.MessageFormat;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t//Scanner sc=new Scanner(System.in);\n\t\t/*String sss=sc.next();\n\t\tchar[]B=sss.toCharArray();\n\t\tString ss=sc.next();\n\t\tchar[]C=ss.toCharArray();\n\t\tint[]A1=new int[sss.length()];\n\t\tint[]A2=new int[ss.length()];\n\t\tint sum1=0,sum2=0;\n\t\tfor(int i=0;i<A1.length;i++) {\n\t\t\tA1[i]=(int)B[i]-48;\n\t\t\tsum1+=A1[i];\n\t\t}\n\t\tfor(int i=0;i<A2.length;i++) {\n\t\t\tA2[i]=(int)C[i]-48;\n\t\t\tsum2+=A2[i];\n\t\t}\n\t\t\t\n\n\t\tlong ceng1=sum1%3;\n\t\tlong ceng2=sum2%3;\n\t    if(ceng1==ceng2) {\n\t    \tSystem.out.println(\""AA\"");\n\t    }\n\t    else if(ceng1==1&&ceng2==0) {\n\t    \tSystem.out.println(\""fffteam\"");\n\t    }\n\t    else if(ceng1==2&&ceng2==1) {\n\t    \tSystem.out.println(\""fffteam\"");\n\t    }\n\t    else if(ceng1==0&&ceng2==2) {\n\t    \tSystem.out.println(\""fffteam\"");\n\t    }\n\t    else {\n\t    \tSystem.out.println(\""Rurirat\"");\n\t    }\n\t\t*/\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString[]A=sc.nextLine().split(\"" \"");\n\t\t\n\t\tlong[]B=new long[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tB[i]=Long.parseLong(A[i]);\n\t\t}\n\t\tint n2=sc.nextInt();\n\t\tlong[]C=new long[2*n2+2];\n\t\tlong cishu=1;\n\t\tint i=0;\n\t\twhile(cishu<=n2) {\n\t\t\ti=0;\n\t\t\tsc.nextLine();\n\t\t\tString[]E= sc.nextLine().split(\"" \"");\n\t\t\tC[i]=Long.parseLong(E[0]);\n\t\t\ti++;\n\t\t\tC[i]=Long.parseLong(E[1]);\n\t\t\tcishu++;\n\t\t}\n\t\tlong sum=1;\n\t\t\n\t\tfor(int j=0;i<n2;j++) {\n\t\t\tfor(int k=0;k<C[k+1]-C[k];k=k+2) {\n\t\t\t\tfor(int q=(int)C[k]-1;q<=C[k+1]-1;q++) {\n\t\t\t\t\tsum*=B[q];\n\t\t\t\t}\n\t\t\tSystem.out.println(sum);\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t/*long a=sc.nextLong();\n\t\tlong x=1;\n\t\twhile(f(x)<a) {\n\t\t\t\n\t\t\tx++;\n\t\t}if(a==1) {\n\t\t\tSystem.out.print(1);\n\t\t}\n\t\telse {\n\t\t\tSystem.out.print(x-1);\n\t\t}\n\t\t*/\n\n\t}\n\tstatic double lg;\n\tpublic static double f(long x) {\n\t\tlg = Math.log10(x);\n\t\t\n\t\treturn lg*x;\n\t\t\n\t\t\n\t}\n\t\n}\n",MULTIPLE_ERROR,112,14980
1468876914262196224,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 17:35:21,Java,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"\nimport java.math.BigInteger;\nimport java.text.MessageFormat;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t//Scanner sc=new Scanner(System.in);\n\t\t/*String sss=sc.next();\n\t\tchar[]B=sss.toCharArray();\n\t\tString ss=sc.next();\n\t\tchar[]C=ss.toCharArray();\n\t\tint[]A1=new int[sss.length()];\n\t\tint[]A2=new int[ss.length()];\n\t\tint sum1=0,sum2=0;\n\t\tfor(int i=0;i<A1.length;i++) {\n\t\t\tA1[i]=(int)B[i]-48;\n\t\t\tsum1+=A1[i];\n\t\t}\n\t\tfor(int i=0;i<A2.length;i++) {\n\t\t\tA2[i]=(int)C[i]-48;\n\t\t\tsum2+=A2[i];\n\t\t}\n\t\t\t\n\n\t\tlong ceng1=sum1%3;\n\t\tlong ceng2=sum2%3;\n\t    if(ceng1==ceng2) {\n\t    \tSystem.out.println(\""AA\"");\n\t    }\n\t    else if(ceng1==1&&ceng2==0) {\n\t    \tSystem.out.println(\""fffteam\"");\n\t    }\n\t    else if(ceng1==2&&ceng2==1) {\n\t    \tSystem.out.println(\""fffteam\"");\n\t    }\n\t    else if(ceng1==0&&ceng2==2) {\n\t    \tSystem.out.println(\""fffteam\"");\n\t    }\n\t    else {\n\t    \tSystem.out.println(\""Rurirat\"");\n\t    }\n\t\t*/\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString[]A=sc.nextLine().split(\"" \"");\n\t\t\n\t\tlong[]B=new long[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tB[i]=Long.parseLong(A[i]);\n\t\t}\n\t\tint n2=sc.nextInt();\n\t\tlong[]C=new long[2*n2+2];\n\t\tlong cishu=1;\n\t\tint i=0;\n\t\twhile(cishu<=n2) {\n\t\t\ti=0;\n\t\t\tsc.nextLine();\n\t\t\tString[]E= sc.nextLine().split(\"" \"");\n\t\t\tC[i]=Long.parseLong(E[0]);\n\t\t\ti++;\n\t\t\tC[i]=Long.parseLong(E[1]);\n\t\t\tcishu++;\n\t\t}\n\t\tlong sum=1;\n\t\t\n\t\tfor(int j=0;i<n2;j++) {\n\t\t\tfor(int k=0;k<C[k+1]-C[k];k=k+2) {\n\t\t\t\tfor(int q=(int)C[k]-1;q<=C[k+1]-1;q++) {\n\t\t\t\t\tsum*=B[q];\n\t\t\t\t}\n\t\t\tSystem.out.println(sum%(1000000007));\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t/*long a=sc.nextLong();\n\t\tlong x=1;\n\t\twhile(f(x)<a) {\n\t\t\t\n\t\t\tx++;\n\t\t}if(a==1) {\n\t\t\tSystem.out.print(1);\n\t\t}\n\t\telse {\n\t\t\tSystem.out.print(x-1);\n\t\t}\n\t\t*/\n\n\t}\n\tstatic double lg;\n\tpublic static double f(long x) {\n\t\tlg = Math.log10(x);\n\t\t\n\t\treturn lg*x;\n\t\t\n\t\t\n\t}\n\t\n}\n",MULTIPLE_ERROR,107,14908
1468877140740485120,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 17:36:15,Java,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"\nimport java.math.BigInteger;\nimport java.text.MessageFormat;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t//Scanner sc=new Scanner(System.in);\n\t\t/*String sss=sc.next();\n\t\tchar[]B=sss.toCharArray();\n\t\tString ss=sc.next();\n\t\tchar[]C=ss.toCharArray();\n\t\tint[]A1=new int[sss.length()];\n\t\tint[]A2=new int[ss.length()];\n\t\tint sum1=0,sum2=0;\n\t\tfor(int i=0;i<A1.length;i++) {\n\t\t\tA1[i]=(int)B[i]-48;\n\t\t\tsum1+=A1[i];\n\t\t}\n\t\tfor(int i=0;i<A2.length;i++) {\n\t\t\tA2[i]=(int)C[i]-48;\n\t\t\tsum2+=A2[i];\n\t\t}\n\t\t\t\n\n\t\tlong ceng1=sum1%3;\n\t\tlong ceng2=sum2%3;\n\t    if(ceng1==ceng2) {\n\t    \tSystem.out.println(\""AA\"");\n\t    }\n\t    else if(ceng1==1&&ceng2==0) {\n\t    \tSystem.out.println(\""fffteam\"");\n\t    }\n\t    else if(ceng1==2&&ceng2==1) {\n\t    \tSystem.out.println(\""fffteam\"");\n\t    }\n\t    else if(ceng1==0&&ceng2==2) {\n\t    \tSystem.out.println(\""fffteam\"");\n\t    }\n\t    else {\n\t    \tSystem.out.println(\""Rurirat\"");\n\t    }\n\t\t*/\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString[]A=sc.nextLine().split(\"" \"");\n\t\t\n\t\tlong[]B=new long[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tB[i]=Long.parseLong(A[i]);\n\t\t}\n\t\tint n2=sc.nextInt();\n\t\tlong[]C=new long[2*n2+2];\n\t\tlong cishu=1;\n\t\tint i=0;\n\t\twhile(cishu<=n2) {\n\t\t\ti=0;\n\t\t\tsc.nextLine();\n\t\t\tString[]E= sc.nextLine().split(\"" \"");\n\t\t\tC[i]=Long.parseLong(E[0]);\n\t\t\ti++;\n\t\t\tC[i]=Long.parseLong(E[1]);\n\t\t\tcishu++;\n\t\t}\n\t\tlong sum=1;\n\t\t\n\t\tfor(int j=0;i<n2;j++) {\n\t\t\tfor(int k=0;k<C[k+1]-C[k];k=k+2) {\n\t\t\t\tfor(int q=(int)C[k]-1;q<=C[k+1]-1;q++) {\n\t\t\t\t\tsum*=B[q];\n\t\t\t\t\tsum=sum%1000000007;\n\t\t\t\t}\n\t\t\tSystem.out.println(sum);\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t/*long a=sc.nextLong();\n\t\tlong x=1;\n\t\twhile(f(x)<a) {\n\t\t\t\n\t\t\tx++;\n\t\t}if(a==1) {\n\t\t\tSystem.out.print(1);\n\t\t}\n\t\telse {\n\t\t\tSystem.out.print(x-1);\n\t\t}\n\t\t*/\n\n\t}\n\tstatic double lg;\n\tpublic static double f(long x) {\n\t\tlg = Math.log10(x);\n\t\t\n\t\treturn lg*x;\n\t\t\n\t\t\n\t}\n\t\n}\n",MULTIPLE_ERROR,110,15428
1468899809231290368,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 19:06:20,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\n\n\n\nnamespace ConsoleApplication3\n    {\n        class Program\n        {\n            static void Main(string[] args)\n            {\n            \n\n            int n = int.Parse(Console.ReadLine());\n            long[] A = Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);\n            int n2 = int.Parse(Console.ReadLine());\n            long[] B = new long[2*n2];\n            for(int i = 0; i < n2; i++)\n            {\n                long[] C = Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);\n                B[i] = C[0];i++;\n                B[i] = C[1];\n            }\n            long sum = 1;\n            for(int i = 0; i <2* n2; i=i+2)\n            {\n                for(int j=(int)A[B[i]];j<=A[B[i+1]] ;j++)\n                {\n                    sum *= j;\n                }\n                Console.WriteLine(sum % (1000000007));\n            }\n\n\n\n\n\n        }\n      }\n    }\n        \n        \n    \n",MULTIPLE_ERROR,20,2956
1468900169151361024,b7ee0f482123923b57b5a9e2f29d4542d11e69079f74b30f0cce145b82a0b6f5,2021-12-09 19:07:45,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\n\nnamespace 蓝桥杯7_1\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n\n            int n = int.Parse(Console.ReadLine());\n            int[] s = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            int q = int.Parse(Console.ReadLine());\n            int[] lr = new int[q];\n            int sum = 1;\n            int[] jie = new int[q];\n            for (int i = 0; i < q; i++)\n            {\n                lr = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n               \n               for(int j=lr[0];j<=lr[1];j++)\n                { sum *= j; }\n               \n                jie[i] = sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7);\n                sum = 1;\n            }\n            for (int i = 0; i < q; i++)\n            {\n                Console.WriteLine(jie[i]);\n                    }\n\n\n\n            Console.ReadKey();\n        }\n    }\n}\n",MULTIPLE_ERROR,22,3732
1468905027799441408,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 19:27:04,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Text;\n\n\n\nnamespace ConsoleApplication3\n    {\n        class Program\n        {\n            static void Main(string[] args)\n            {\n            //DateTime d1;\n            //string cardNum = \""\"", strResult = \""\"";\n            //int n = Convert.ToInt32(Console.ReadLine());\n            //for (int count = 0; count < n; count++)\n            //{\n            //    string[] sa = Console.ReadLine().Split(new char[] { ' ' });\n            //    d1 = Convert.ToDateTime(sa[0]);//日期\n            //    int[,] FibidDay = { { 4, 9 }, { 5, 0 }, { 1, 6 }, { 2, 7 }, { 3, 8 } };\n            //    //将星期1至星期5限行的尾号存入二维数组，每天占1行\n            //    int dayofWeek = (int)d1.DayOfWeek - 1;\n            //    //得到星期几存入变量dayofWeek中，星期日用-1表示，星期一用0表示，星期二用1表示......，星期六用5表示 \n            //    cardNum = sa[1];//车牌号\n            //    strResult = \""\"";\n            //    int tailNum;\n            //    if (dayofWeek==-1||dayofWeek==5)//5：周六；-1周日，不限行\n            //        strResult = \""Permit\"";\n            //    else if (cardNum.Length==6)//新能源汽车不限行\n            //        strResult = \""Permit\"";\n            //    else\n            //    {\n            //        int i =5;\n            //        while (cardNum[i] < '0' || cardNum[i] > '9')\n            //            i--;\n            //        tailNum = cardNum[i] - '0';\n            //        if ()\n            //            strResult = \""Forbid\"";\n            //        else\n            //            strResult = \""Permit\"";\n            //    }\n            //    Console.WriteLine(strResult);\n\n\n\n            //int[] A = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            //int cishu = 0;\n\n\n            //if(A[0]>=A[2]&&A[1]>A[3])\n            //{\n            //    A[2] = A[2] + 24;\n            //}\n            //cishu = A[2] - A[0];\n            //if (A[1] <= A[3]&&A[0]!=A[2])\n            //{\n            //    cishu++;\n            //}\n            //else\n            //{\n            //    cishu--;\n            //}\n            //if (cishu == -1)\n            //    Console.WriteLine(0);\n            //else if (cishu <= 13)\n            //    Console.WriteLine(3 * cishu);\n            //else if (cishu >= 14)\n            //    Console.WriteLine(40);\n\n\n\n\n            //int n = int.Parse(Console.ReadLine());\n            //int[] A = new int[n];\n            //int sum = 0;\n            //int c = 0;\n\n            //for(int i=0;i<n;i++)\n            //{\n            //    A[i] = int.Parse(Console.ReadLine());\n\n            //    sum += A[i];\n            //    if(A[i]==0)\n            //    c++;\n            //}\n            //int avg = sum / (n-c);\n            //for(int i=0;i<n;i++)\n            //{\n            //    if(A[i]==0)\n            //    {\n            //        Console.WriteLine(0);\n            //    }\n            //    else if(A[i]>avg)\n            //    {\n            //        Console.WriteLine(2);\n            //    }\n            //    else if(A[i]<=avg)\n            //    {\n            //        Console.WriteLine(1);\n            //    }\n            //}\n\n            int n = int.Parse(Console.ReadLine());\n            long[] A = Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);\n            int n2 = int.Parse(Console.ReadLine());\n            long[] B = new long[2*n2];\n            \n            long sum = 1;\n            StringBuilder sb2 = new StringBuilder();\n            for (int i = 0; i < n2; i++)\n            {\n                sb2.Append(Console.ReadLine() + \"" \"");\n            }\n            string[] Line3 = sb2.ToString().Split(' ');\n            for (int i = 0; i < 2*n2; i++)\n            {\n                B[i] = long.Parse(Line3[i]);\n            }\n            for (int i = 0; i <2* n2; i=i+2)\n            {\n                sum = 1;\n                    for (int j = (int)A[B[i]-1]; j <= A[B[i + 1]-1]; j++)\n                    {\n                        sum *= j;\n                    }\n                    Console.WriteLine(sum % (1000000007));\n                \n            }\n\n\n\n\n\n        }\n      }\n    }\n        \n        \n    \n",MULTIPLE_ERROR,26,3836
1468905128790245376,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 19:27:28,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Text;\n\n\n\nnamespace ConsoleApplication3\n    {\n        class Program\n        {\n            static void Main(string[] args)\n            {\n           \n\n            int n = int.Parse(Console.ReadLine());\n            long[] A = Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);\n            int n2 = int.Parse(Console.ReadLine());\n            long[] B = new long[2*n2];\n            \n            long sum = 1;\n            StringBuilder sb2 = new StringBuilder();\n            for (int i = 0; i < n2; i++)\n            {\n                sb2.Append(Console.ReadLine() + \"" \"");\n            }\n            string[] Line3 = sb2.ToString().Split(' ');\n            for (int i = 0; i < 2*n2; i++)\n            {\n                B[i] = long.Parse(Line3[i]);\n            }\n            for (int i = 0; i <2* n2; i=i+2)\n            {\n                sum = 1;\n                    for (int j = (int)A[B[i]-1]; j <= A[B[i + 1]-1]; j++)\n                    {\n                        sum *= j;\n                    }\n                    Console.WriteLine(sum % (1000000007));\n                \n            }\n\n\n\n\n\n        }\n      }\n    }\n        \n        \n    \n",MULTIPLE_ERROR,22,3768
1468905457040670720,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 19:28:46,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Text;\n\n\n\nnamespace ConsoleApplication3\n    {\n        class Program\n        {\n            static void Main(string[] args)\n            {\n           \n\n            int n = int.Parse(Console.ReadLine());\n            long[] A = Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);\n            int n2 = int.Parse(Console.ReadLine());\n            long[] B = new long[2*n2];\n            \n            long sum = 1;\n            StringBuilder sb2 = new StringBuilder();\n            for (int i = 0; i < n2; i++)\n            {\n                sb2.Append(Console.ReadLine() + \"" \"");\n            }\n            string[] Line3 = sb2.ToString().Split(' ');\n            for (int i = 0; i < 2*n2; i++)\n            {\n                B[i] = long.Parse(Line3[i]);\n            }\n            for (int i = 0; i <2* n2; i=i+2)\n            {\n                sum = 1;\n                    for (int j = (int)A[B[i]-1]; j <= A[B[i + 1]-1]; j++)\n                    {\n                        sum *= j;\n                    }\n                  if (sum > 1000000007) { sum = sum % 1000000007; }\n                    Console.WriteLine(sum % (1000000007));\n                \n            }\n\n\n\n\n\n        }\n      }\n    }\n        \n        \n    \n",MULTIPLE_ERROR,22,3832
1468907923569557504,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 19:38:34,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Text;\n\n\n\nnamespace ConsoleApplication3\n    {\n        class Program\n        {\n            static void Main(string[] args)\n            {\n            //DateTime d1;\n            //string cardNum = \""\"", strResult = \""\"";\n            //int n = Convert.ToInt32(Console.ReadLine());\n            //for (int count = 0; count < n; count++)\n            //{\n            //    string[] sa = Console.ReadLine().Split(new char[] { ' ' });\n            //    d1 = Convert.ToDateTime(sa[0]);//日期\n            //    int[,] FibidDay = { { 4, 9 }, { 5, 0 }, { 1, 6 }, { 2, 7 }, { 3, 8 } };\n            //    //将星期1至星期5限行的尾号存入二维数组，每天占1行\n            //    int dayofWeek = (int)d1.DayOfWeek - 1;\n            //    //得到星期几存入变量dayofWeek中，星期日用-1表示，星期一用0表示，星期二用1表示......，星期六用5表示 \n            //    cardNum = sa[1];//车牌号\n            //    strResult = \""\"";\n            //    int tailNum;\n            //    if (dayofWeek==-1||dayofWeek==5)//5：周六；-1周日，不限行\n            //        strResult = \""Permit\"";\n            //    else if (cardNum.Length==6)//新能源汽车不限行\n            //        strResult = \""Permit\"";\n            //    else\n            //    {\n            //        int i =5;\n            //        while (cardNum[i] < '0' || cardNum[i] > '9')\n            //            i--;\n            //        tailNum = cardNum[i] - '0';\n            //        if ()\n            //            strResult = \""Forbid\"";\n            //        else\n            //            strResult = \""Permit\"";\n            //    }\n            //    Console.WriteLine(strResult);\n\n\n\n            //int[] A = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);\n            //int cishu = 0;\n\n\n            //if(A[0]>=A[2]&&A[1]>A[3])\n            //{\n            //    A[2] = A[2] + 24;\n            //}\n            //cishu = A[2] - A[0];\n            //if (A[1] <= A[3]&&A[0]!=A[2])\n            //{\n            //    cishu++;\n            //}\n            //else\n            //{\n            //    cishu--;\n            //}\n            //if (cishu == -1)\n            //    Console.WriteLine(0);\n            //else if (cishu <= 13)\n            //    Console.WriteLine(3 * cishu);\n            //else if (cishu >= 14)\n            //    Console.WriteLine(40);\n\n\n\n\n            //int n = int.Parse(Console.ReadLine());\n            //int[] A = new int[n];\n            //int sum = 0;\n            //int c = 0;\n\n            //for(int i=0;i<n;i++)\n            //{\n            //    A[i] = int.Parse(Console.ReadLine());\n\n            //    sum += A[i];\n            //    if(A[i]==0)\n            //    c++;\n            //}\n            //int avg = sum / (n-c);\n            //for(int i=0;i<n;i++)\n            //{\n            //    if(A[i]==0)\n            //    {\n            //        Console.WriteLine(0);\n            //    }\n            //    else if(A[i]>avg)\n            //    {\n            //        Console.WriteLine(2);\n            //    }\n            //    else if(A[i]<=avg)\n            //    {\n            //        Console.WriteLine(1);\n            //    }\n            //}\n\n            int n = int.Parse(Console.ReadLine());\n            long[] A = Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);\n            int n2 = int.Parse(Console.ReadLine());\n            long[] B = new long[2*n2];\n            \n            long sum = 1;\n            StringBuilder sb2 = new StringBuilder();\n            for (int i = 0; i < n2; i++)\n            {\n                sb2.Append(Console.ReadLine() + \"" \"");\n            }\n            string[] Line3 = sb2.ToString().Split(' ');\n            for (int i = 0; i < 2*n2; i++)\n            {\n                B[i] = long.Parse(Line3[i]);\n            }\n            for (int i = 0; i <2* n2; i=i+2)\n            {\n                sum = 1;\n                    for (int j = (int)B[i]-1; j <= B[i + 1]-1;j++)\n                    {\n                        sum *= A[j];\n                    }\n               \n                    Console.WriteLine(sum%(1000000007));\n                \n            }\n\n\n\n\n\n        }\n      }\n    }\n        \n        \n    \n",PARTIAL_ACCEPTED,25,3900
1468913995943165952,a4151103851a45a7e7bc783c6ec1e18d3d11fd955befc8047a1f90119d5f45e9,2021-12-09 20:02:42,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace Namidanisang\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string[] s = Console.ReadLine().Split(' ');\n            int Q = int.Parse(Console.ReadLine());\n            int[] A = new int[n];\n            int[] B = new int[Q];\n            for (int i = 0; i < n; i++)\n            {\n                A[i] = int.Parse(s[i]);\n            }\n            for (int i = 0; i < Q; i++)\n            {\n                string str = Console.ReadLine();\n                int L = int.Parse(str.Substring(0, str.IndexOf(' ')));\n                int R = int.Parse(str.Substring(str.IndexOf(' ')));\n                B[i] = Calculate(L, R, A);\n            }\n            foreach (int val in B)\n            {\n                Console.WriteLine(val.ToString());\n            }\n        }\n\n        public static int Calculate(int L,int R,int[] A)\n        {\n            int result = 1;\n            for (int i = L-1; i <= R-1; i++)\n            {\n                result *= A[i];\n            }\n            return result;\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1468914046765195264,a4151103851a45a7e7bc783c6ec1e18d3d11fd955befc8047a1f90119d5f45e9,2021-12-09 20:02:54,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace Namidanisang\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string[] s = Console.ReadLine().Split(' ');\n            int Q = int.Parse(Console.ReadLine());\n            int[] A = new int[n];\n            int[] B = new int[Q];\n            for (int i = 0; i < n; i++)\n            {\n                A[i] = int.Parse(s[i]);\n            }\n            for (int i = 0; i < Q; i++)\n            {\n                string str = Console.ReadLine();\n                int L = int.Parse(str.Substring(0, str.IndexOf(' ')));\n                int R = int.Parse(str.Substring(str.IndexOf(' ')));\n                B[i] = Calculate(L, R, A);\n            }\n            foreach (int val in B)\n            {\n                Console.WriteLine(val.ToString());\n            }\n        }\n\n        public static int Calculate(int L,int R,int[] A)\n        {\n            int result = 1;\n            for (int i = L-1; i <= R-1; i++)\n            {\n                result *= A[i];\n            }\n            return result;\n        }\n    }\n}\n",PARTIAL_ACCEPTED,22,3564
1468915002076651520,a4151103851a45a7e7bc783c6ec1e18d3d11fd955befc8047a1f90119d5f45e9,2021-12-09 20:06:42,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace Namidanisang\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string[] s = Console.ReadLine().Split(' ');\n            int Q = int.Parse(Console.ReadLine());\n            int[] A = new int[n];\n            double[] B = new double[Q];\n            for (int i = 0; i < n; i++)\n            {\n                A[i] = int.Parse(s[i]);\n            }\n            for (int i = 0; i < Q; i++)\n            {\n                string str = Console.ReadLine();\n                int L = int.Parse(str.Substring(0, str.IndexOf(' ')));\n                int R = int.Parse(str.Substring(str.IndexOf(' ')));\n                B[i] = Calculate(L, R, A)%(Math.Pow(10,9)+7);\n            }\n            foreach (int val in B)\n            {\n                Console.WriteLine(val.ToString());\n            }\n        }\n\n        public static double Calculate(int L,int R,int[] A)\n        {\n            double result = 1;\n            for (int i = L-1; i <= R-1; i++)\n            {\n                result *= A[i];\n            }\n            return result;\n        }\n    }\n}\n",PARTIAL_ACCEPTED,21,3616
1468915478136012800,a4151103851a45a7e7bc783c6ec1e18d3d11fd955befc8047a1f90119d5f45e9,2021-12-09 20:08:35,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace Namidanisang\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string[] s = Console.ReadLine().Split(' ');\n            int Q = int.Parse(Console.ReadLine());\n            int[] A = new int[n];\n            double[] B = new double[Q];\n            for (int i = 0; i < n; i++)\n            {\n                A[i] = int.Parse(s[i]);\n            }\n            for (int i = 0; i < Q; i++)\n            {\n                string str = Console.ReadLine();\n                int L = int.Parse(str.Substring(0, str.IndexOf(' ')));\n                int R = int.Parse(str.Substring(str.IndexOf(' ')));\n                double result = 1;\n                for (int j = L - 1; j <= R - 1; j++)\n                {\n                    result *= A[i];\n                }\n                B[i] = result;\n            }\n            foreach (int val in B)\n            {\n                Console.WriteLine(val.ToString());\n            }\n        }\n    }\n}\n",MULTIPLE_ERROR,26,3024
1468915566086373376,a4151103851a45a7e7bc783c6ec1e18d3d11fd955befc8047a1f90119d5f45e9,2021-12-09 20:08:56,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace Namidanisang\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string[] s = Console.ReadLine().Split(' ');\n            int Q = int.Parse(Console.ReadLine());\n            int[] A = new int[n];\n            double[] B = new double[Q];\n            for (int i = 0; i < n; i++)\n            {\n                A[i] = int.Parse(s[i]);\n            }\n            for (int i = 0; i < Q; i++)\n            {\n                string str = Console.ReadLine();\n                int L = int.Parse(str.Substring(0, str.IndexOf(' ')));\n                int R = int.Parse(str.Substring(str.IndexOf(' ')));\n                B[i] = Calculate(L, R, A)%(Math.Pow(10,9)+7);\n            }\n            foreach (int val in B)\n            {\n                Console.WriteLine(val.ToString());\n            }\n        }\n\n        public static double Calculate(int L,int R,int[] A)\n        {\n            double result = 1;\n            for (int i = L-1; i <= R-1; i++)\n            {\n                result *= A[i];\n            }\n            return result;\n        }\n    }\n}\n",PARTIAL_ACCEPTED,23,3768
1468916228067516416,60e638a83e5b19cbe789ced297f703bb0c8023910446a60f7d071909cbc9130a,2021-12-09 20:11:34,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\t\n\tint n;\n\tcin>>n;\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\tint nn;\n\tcin>>nn;\n\twhile(nn--){\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tint ans=1;\n\t\tfor(int j = l-1;j<r;j++){\n\t\t\tans*=a[j];\n\t\t}\n\t\tcout<<ans;\n\t}\n\treturn 0;\n}",MULTIPLE_ERROR,4,332
1468916492287696896,60e638a83e5b19cbe789ced297f703bb0c8023910446a60f7d071909cbc9130a,2021-12-09 20:12:37,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\t\n\tint n;\n\tcin>>n;\n\tint a[n];\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\tint nn;\n\tcin>>nn;\n\twhile(nn--){\n\t\tint l,r;\n\t\tcin>>l>>r;\n\t\tint ans=1;\n\t\tfor(int j = l-1;j<r;j++){\n\t\t\tans*=a[j];\n\t\t}\n\t\tcout<<ans;\n\t\tif(nn!=0) cout<<endl;\n\t}\n\treturn 0;\n}",PARTIAL_ACCEPTED,4,448
1468922626608410624,7411191b69f4c0be49f3b54623e317fe4e29c9ccfc7d86b66b013b73d63efa08,2021-12-09 20:37:00,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace ConsoleApplication4\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int x = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            string[] s1 = s.Split(' ');\n            int[] a = Array.ConvertAll(s1, int.Parse);\n            int y = int.Parse(Console.ReadLine());\n            int sum=1;\n            int[] c=new int[y];\n            for (int i = 0; i < y; i++)\n            {\n                string s2 = Console.ReadLine();\n                string[] s3= s2.Split(' ');\n                int[] b= Array.ConvertAll(s3, int.Parse);\n                int m = b[0];\n                int n = b[1];\n                for (int j = m; j <=n; j++)\n                {\n                    sum = sum * a[j-1];\n                }\n                c[i] = sum%(1000000000+7);\n                sum = 1;\n            }\n            for (int i = 0; i < y; i++)\n            {\n                Console.WriteLine(c[i]);\n            }\n            Console.ReadKey();\n        }\n    }\n}",PARTIAL_ACCEPTED,23,3916
1468926859583893504,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 20:53:49,Java,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"\nimport java.math.BigInteger;\nimport java.text.MessageFormat;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\n\t\t\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString[]B=sc.nextLine().split(\"" \"");\n\t\tlong[]A=new long[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tA[i]=Long.parseLong(B[i]);\n\t\t}\n\t\tint n2=sc.nextInt();\n\t\tsc.nextLine();\n\t\tlong[]C=new long[2*n2];\n\t\tStringBuilder sb=new StringBuilder();\n\t\tfor(int i=0;i<n2;i++) {\n\t\t\tsb.append(sc.nextLine()+\"" \"");\n\t\t}\n\t\tString[]sss=sb.toString().split(\"" \"");\n\t\t\n\t\tfor (int i = 0; i < 2*n2; i++)\n        {\n            C[i] = Long.parseLong(sss[i]);\n        }\n\t\tlong sum=1;\n\t\tfor (int i = 0; i <2* n2; i=i+2)\n        {\n            sum = 1;\n                for (int j = (int)C[i]-1; j <= C[i + 1]-1;j++)\n                {\n                    sum *= A[j];\n                }\n           \n               System.out.println(sum%(1000000007));\n            \n        }\n\t\t\n\n\n\t}\n\n\t\n}\n",PARTIAL_ACCEPTED,117,15132
1468927161122340864,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 20:55:01,Java,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"\nimport java.math.BigInteger;\nimport java.text.MessageFormat;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\t\n\t\t\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString[]B=sc.nextLine().split(\"" \"");\n\t\tlong[]A=new long[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tA[i]=Long.parseLong(B[i]);\n\t\t}\n\t\tint n2=sc.nextInt();\n\t\tsc.nextLine();\n\t\tlong[]C=new long[2*n2];\n\t\tStringBuilder sb=new StringBuilder();\n\t\tfor(int i=0;i<n2;i++) {\n\t\t\tsb.append(sc.nextLine()+\"" \"");\n\t\t}\n\t\tString[]sss=sb.toString().split(\"" \"");\n\t\t\n\t\tfor (int i = 0; i < 2*n2; i++)\n        {\n            C[i] = Long.parseLong(sss[i]);\n        }\n\t\tlong sum=1;\n\t\tfor (int i = 0; i <2* n2; i=i+2)\n        {\n            sum = 1;\n                for (int j = (int)C[i]-1; j <= C[i + 1]-1;j++)\n                {\n                    sum *= A[j];\n                }\n            if(sum>1000000007) {sum=sum%1000000007;}\n               System.out.println(sum%(1000000007));\n            \n        }\n\n\n\t}\n\n\t\t\n\t\t\n\t\n\t\n}\n",PARTIAL_ACCEPTED,116,14916
1468927465003859968,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 20:56:13,Java,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"\nimport java.math.BigInteger;\nimport java.text.MessageFormat;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\t\n\t\t\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString[]B=sc.nextLine().split(\"" \"");\n\t\tlong[]A=new long[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tA[i]=Long.parseLong(B[i]);\n\t\t}\n\t\tint n2=sc.nextInt();\n\t\tsc.nextLine();\n\t\tlong[]C=new long[2*n2];\n\t\tStringBuilder sb=new StringBuilder();\n\t\tfor(int i=0;i<n2;i++) {\n\t\t\tsb.append(sc.nextLine()+\"" \"");\n\t\t}\n\t\tString[]sss=sb.toString().split(\"" \"");\n\t\t\n\t\tfor (int i = 0; i < 2*n2; i++)\n        {\n            C[i] = Long.parseLong(sss[i]);\n        }\n\t\tlong sum=1;\n\t\tfor (int i = 0; i <2* n2; i=i+2)\n        {\n            sum = 1;\n                for (int j = (int)C[i]-1; j <= C[i + 1]-1;j++)\n                {\n                    sum *= A[j];\n                    if(sum>1000000007) {sum=sum%1000000007;}\n                }\n            \n               System.out.println(sum%(1000000007));\n            \n        }\n\n\n\t}\n\n\t\t\n\t\t\n\t\n\t\n}\n",PARTIAL_ACCEPTED,117,15236
1468927631839027200,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 20:56:53,Java,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"\nimport java.math.BigInteger;\nimport java.text.MessageFormat;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\t\n\t\t\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString[]B=sc.nextLine().split(\"" \"");\n\t\tlong[]A=new long[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tA[i]=Long.parseLong(B[i]);\n\t\t}\n\t\tint n2=sc.nextInt();\n\t\tsc.nextLine();\n\t\tlong[]C=new long[2*n2];\n\t\tStringBuilder sb=new StringBuilder();\n\t\tfor(int i=0;i<n2;i++) {\n\t\t\tsb.append(sc.nextLine()+\"" \"");\n\t\t}\n\t\tString[]sss=sb.toString().split(\"" \"");\n\t\t\n\t\t/*for (int i = 0; i < 2*n2; i++)\n        {\n            C[i] = Long.parseLong(sss[i]);\n        }\n\t\tlong sum=1;\n\t\tfor (int i = 0; i <2* n2; i=i+2)\n        {\n            sum = 1;\n                for (int j = (int)C[i]-1; j <= C[i + 1]-1;j++)\n                {\n                    sum *= A[j];\n                    if(sum>1000000007) {sum=sum%1000000007;}\n                }\n            \n               System.out.println(sum%(1000000007));\n            \n        }*/\n\n\n\t}\n\n\t\t\n\t\t\n\t\n\t\n}\n",MULTIPLE_ERROR,129,14868
1468929329206747136,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 21:03:38,Java,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"\nimport java.math.BigInteger;\nimport java.text.MessageFormat;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\t\n\t\t\n\t\tScanner sc=new Scanner(System.in);\n\t\t\tint n=sc.nextInt();\n\t\t\tsc.nextLine();\n\t\t\t\n\t\t\tlong[]A=new long[n];\n\t\t\tfor(int i=0;i<n;i++) {\n\t\t\t\tA[i]=Long.parseLong(sc.nextLine().split(\"" \"")[i]);\n\t\t\t}\n\t\t\tint n2=sc.nextInt();\n\t\t\tsc.nextLine();\n\t\t\tlong[]C=new long[2*n2];\n\t\t\tStringBuilder sb=new StringBuilder();\n\t\t\tfor(int i=0;i<n2;i++) {\n\t\t\t\tsb.append(sc.nextLine()+\"" \"");\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tfor (int i = 0; i < 2*n2; i++)\n\t        {\n\t            C[i] = Long.parseLong(sb.toString().split(\"" \"")[i]);\n\t        }\n\t\t\tlong sum=1;\n\t\t\tfor (int i = 0; i <2* n2; i=i+2)\n\t        {\n\t            sum = 1;\n\t                for (int j = (int)C[i]-1; j <= C[i + 1]-1;j++)\n\t                {\n\t                    sum *= A[j];\n\t                    if(sum>1000000007) {sum=sum%1000000007;}\n\t                }\n\t            \n\t               System.out.println(sum%(1000000007));\n\t            \n\t        }\n\n\n\t}\n\n\t\t\n\t\t\n\t\n\t\n}\n",WRONG_ANSWER,481,38280
1468930328688537600,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 21:07:36,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Text;\n\n\n\nnamespace ConsoleApplication3\n    {\n        class Program\n        {\n            static void Main(string[] args)\n            {\n            \n\n            int n = int.Parse(Console.ReadLine());\n            long[] A = Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);\n            int n2 = int.Parse(Console.ReadLine());\n            long[] B = new long[2*n2];\n            \n            long sum = 1;\n            StringBuilder sb2 = new StringBuilder();\n            for (int i = 0; i < n2; i++)\n            {\n                sb2.Append(Console.ReadLine() + \"" \"");\n            }\n            string[] Line3 = sb2.ToString().Split(' ');\n            for (int i = 0; i < 2*n2; i++)\n            {\n                B[i] = long.Parse(Line3[i]);\n            }\n            for (int i = 0; i <2* n2; i=i+2)\n            {\n                sum = 1;\n                    for (int j = (int)B[i]-1; j <= B[i + 1]-1;j++)\n                    {\n                        sum *= A[j];if(sum> 1000000007) { sum = sum % 1000000007; }\n                    }\n               \n                    Console.WriteLine(sum%(1000000007));\n                \n            }\n\n\n\n\n\n        }\n      }\n    }\n        \n        \n    \n",PARTIAL_ACCEPTED,24,3676
1468930826024173568,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 21:09:35,Java,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"import java.math.BigInteger;\nimport java.text.MessageFormat;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString[]B=sc.nextLine().split(\"" \"");\n\t\tlong[]A=new long[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tA[i]=Long.parseLong(B[i]);\n\t\t}\n\t\tint n2=sc.nextInt();\n\t\tsc.nextLine();\n\t\tlong[]C=new long[2*n2];\n\t\tStringBuilder sb=new StringBuilder();\n\t\tfor(int i=0;i<n2;i++) {\n\t\t\tsb.append(sc.nextLine()+\"" \"");\n\t\t}\n\t\tString[]sss=sb.toString().split(\"" \"");\n\t\t\n\t\tfor (int i = 0; i < 2*n2; i++)\n        {\n            C[i] = Long.parseLong(sss[i]);\n        }\n\t\tlong sum=1;\n\t\tfor (int i = 0; i <2* n2; i=i+2)\n        {\n            sum = 1;\n                for (int j = (int)C[i]-1; j <= C[i + 1]-1;j++)\n                {\n                    sum *= A[j];\n                }\n                if(sum>1000000007) {sum=sum%1000000007;}\n               System.out.println(sum%(1000000007));\n            \n        }\n\n\t}\n\tstatic double lg;\n\tpublic static double f(long x) {\n\t\tlg = Math.log10(x);\n\t\t\n\t\treturn lg*x+1;\n\t\t\n\t\t\n\t}\n\t\n}\n                sb2.Append(Console.ReadLine() + \"" \"");\n            }\n            string[] Line3 = sb2.ToString().Split(' ');\n            for (int i = 0; i < 2*n2; i++)\n            {\n                B[i] = long.Parse(Line3[i]);\n            }\n            for (int i = 0; i <2* n2; i=i+2)\n            {\n                sum = 1;\n                    for (int j = (int)B[i]-1; j <= B[i + 1]-1;j++)\n                    {\n                        sum *= A[j];if(sum> 1000000007) { sum = sum % 1000000007; }\n                    }\n               \n                    Console.WriteLine(sum%(1000000007));\n                \n            }\n\n\n\n\n\n        }\n      }\n    }\n        \n        \n    \n",COMPILE_ERROR,0,0
1468930842186137600,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 21:09:38,Java,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"import java.math.BigInteger;\nimport java.text.MessageFormat;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString[]B=sc.nextLine().split(\"" \"");\n\t\tlong[]A=new long[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tA[i]=Long.parseLong(B[i]);\n\t\t}\n\t\tint n2=sc.nextInt();\n\t\tsc.nextLine();\n\t\tlong[]C=new long[2*n2];\n\t\tStringBuilder sb=new StringBuilder();\n\t\tfor(int i=0;i<n2;i++) {\n\t\t\tsb.append(sc.nextLine()+\"" \"");\n\t\t}\n\t\tString[]sss=sb.toString().split(\"" \"");\n\t\t\n\t\tfor (int i = 0; i < 2*n2; i++)\n        {\n            C[i] = Long.parseLong(sss[i]);\n        }\n\t\tlong sum=1;\n\t\tfor (int i = 0; i <2* n2; i=i+2)\n        {\n            sum = 1;\n                for (int j = (int)C[i]-1; j <= C[i + 1]-1;j++)\n                {\n                    sum *= A[j];\n                }\n                if(sum>1000000007) {sum=sum%1000000007;}\n               System.out.println(sum%(1000000007));\n            \n        }\n\n\t}\n\tstatic double lg;\n\tpublic static double f(long x) {\n\t\tlg = Math.log10(x);\n\t\t\n\t\treturn lg*x+1;\n\t\t\n\t\t\n\t}\n\t\n}\n                sb2.Append(Console.ReadLine() + \"" \"");\n            }\n            string[] Line3 = sb2.ToString().Split(' ');\n            for (int i = 0; i < 2*n2; i++)\n            {\n                B[i] = long.Parse(Line3[i]);\n            }\n            for (int i = 0; i <2* n2; i=i+2)\n            {\n                sum = 1;\n                    for (int j = (int)B[i]-1; j <= B[i + 1]-1;j++)\n                    {\n                        sum *= A[j];if(sum> 1000000007) { sum = sum % 1000000007; }\n                    }\n               \n                    Console.WriteLine(sum%(1000000007));\n                \n            }\n\n\n\n\n\n        }\n      \n    }\n        \n        \n    \n",COMPILE_ERROR,0,0
1468930862583037952,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 21:09:43,Java,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"import java.math.BigInteger;\nimport java.text.MessageFormat;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString[]B=sc.nextLine().split(\"" \"");\n\t\tlong[]A=new long[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tA[i]=Long.parseLong(B[i]);\n\t\t}\n\t\tint n2=sc.nextInt();\n\t\tsc.nextLine();\n\t\tlong[]C=new long[2*n2];\n\t\tStringBuilder sb=new StringBuilder();\n\t\tfor(int i=0;i<n2;i++) {\n\t\t\tsb.append(sc.nextLine()+\"" \"");\n\t\t}\n\t\tString[]sss=sb.toString().split(\"" \"");\n\t\t\n\t\tfor (int i = 0; i < 2*n2; i++)\n        {\n            C[i] = Long.parseLong(sss[i]);\n        }\n\t\tlong sum=1;\n\t\tfor (int i = 0; i <2* n2; i=i+2)\n        {\n            sum = 1;\n                for (int j = (int)C[i]-1; j <= C[i + 1]-1;j++)\n                {\n                    sum *= A[j];\n                }\n                if(sum>1000000007) {sum=sum%1000000007;}\n               System.out.println(sum%(1000000007));\n            \n        }\n\n\t}\n\tstatic double lg;\n\tpublic static double f(long x) {\n\t\tlg = Math.log10(x);\n\t\t\n\t\treturn lg*x+1;\n\t\t\n\t\t\n\t}\n\t\n}\n                sb2.Append(Console.ReadLine() + \"" \"");\n            }\n            string[] Line3 = sb2.ToString().Split(' ');\n            for (int i = 0; i < 2*n2; i++)\n            {\n                B[i] = long.Parse(Line3[i]);\n            }\n            for (int i = 0; i <2* n2; i=i+2)\n            {\n                sum = 1;\n                    for (int j = (int)B[i]-1; j <= B[i + 1]-1;j++)\n                    {\n                        sum *= A[j];if(sum> 1000000007) { sum = sum % 1000000007; }\n                    }\n               \n                    Console.WriteLine(sum%(1000000007));\n                \n            }\n\n\n\n\n\n        }\n      \n    \n        \n        \n    \n",COMPILE_ERROR,0,0
1468930910661033984,7ccb1eb347441446e6c0da14d8e10ea24d50ffecc92ae8380cb6818f0fa18d5b,2021-12-09 21:09:55,Java,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"import java.math.BigInteger;\nimport java.text.MessageFormat;\nimport java.util.Scanner;\nimport java.io.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tsc.nextLine();\n\t\tString[]B=sc.nextLine().split(\"" \"");\n\t\tlong[]A=new long[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tA[i]=Long.parseLong(B[i]);\n\t\t}\n\t\tint n2=sc.nextInt();\n\t\tsc.nextLine();\n\t\tlong[]C=new long[2*n2];\n\t\tStringBuilder sb=new StringBuilder();\n\t\tfor(int i=0;i<n2;i++) {\n\t\t\tsb.append(sc.nextLine()+\"" \"");\n\t\t}\n\t\tString[]sss=sb.toString().split(\"" \"");\n\t\t\n\t\tfor (int i = 0; i < 2*n2; i++)\n        {\n            C[i] = Long.parseLong(sss[i]);\n        }\n\t\tlong sum=1;\n\t\tfor (int i = 0; i <2* n2; i=i+2)\n        {\n            sum = 1;\n                for (int j = (int)C[i]-1; j <= C[i + 1]-1;j++)\n                {\n                    sum *= A[j];\n                }\n                if(sum>1000000007) {sum=sum%1000000007;}\n               System.out.println(sum%(1000000007));\n            \n        }\n\n\t}\n\t\n        }\n      \n    \n        \n        \n    \n",PARTIAL_ACCEPTED,117,15100
1468942959403253760,3c729174056634fec655082fe5bb1a566d8c3906d20b97e4072ede47c15e1d2e,2021-12-09 21:57:47,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace ConsoleApplication29\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {   \n\ndouble w = 10e9 + 7;\n            UInt64 N = UInt64.Parse(Console.ReadLine());\n            string g=Console.ReadLine();\n            string [] a =g.Split(' ');\n            int M = int.Parse(Console.ReadLine());\n            string[] b = new string[M];\n            int[] y = new int[M];\n            int[] x = new int[M];\n            for (int i = 0; i <= M-1; i++)\n            {\n                b[i] = Console.ReadLine();\n                x[i] = int.Parse(b[i].Split(' ')[0])-1;\n                y[i] = int.Parse(b[i].Split(' ')[1])-1;\n            }\n            double u = 1;\n            for (int i = 0; i <= M - 1; i++)\n            {\n                for (int t = x[i]; t <= y[i]; t++)\n                {\n                    u = int.Parse(a[t]) * u;    \n                }\n                Console.WriteLine(u % w); u = 1;\n\n            \n            }\n\n\n        }\n    }\n}\n,PARTIAL_ACCEPTED,24,3636
1468943474610585600,3c729174056634fec655082fe5bb1a566d8c3906d20b97e4072ede47c15e1d2e,2021-12-09 21:59:50,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace ConsoleApplication29\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {   \n\n            double w = 10e9 + 7;\n            UInt64 N = UInt64.Parse(Console.ReadLine());\n            string g=Console.ReadLine();\n            string [] a =g.Split(' ');\n            int[] gg = new int[a.Length];\n            for (int i = 0; i <= a.Length - 1; i++)\n            { gg[i] = int.Parse(a[i]); }\n            int M = int.Parse(Console.ReadLine());\n            string[] b = new string[M];\n            int[] y = new int[M];\n            int[] x = new int[M];\n            for (int i = 0; i <= M-1; i++)\n            {\n                b[i] = Console.ReadLine();\n                x[i] = int.Parse(b[i].Split(' ')[0])-1;\n                y[i] = int.Parse(b[i].Split(' ')[1])-1;\n            }\n            double u = 1;\n            for (int i = 0; i <= M - 1; i++)\n            {\n                for (int t = x[i]; t <= y[i]; t++)\n                {\n                    u = gg[t] * u;    \n                }\n                Console.WriteLine(u % w); u = 1;\n            }\n            Console.ReadLine();\n\n        }\n    }\n}\n\n,PARTIAL_ACCEPTED,21,3928
1468945438438010880,3c729174056634fec655082fe5bb1a566d8c3906d20b97e4072ede47c15e1d2e,2021-12-09 22:07:38,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace ConsoleApplication29\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {   \n\n            double w = 10e9 + 7;\n            UInt64 N = UInt64.Parse(Console.ReadLine());\n            string g=Console.ReadLine();\n            string [] a =g.Split(' ');\n            int[] gg = new int[a.Length];\n            for (int i = 0; i <= a.Length - 1; i++)\n            { gg[i] = int.Parse(a[i]); }\n            int M = int.Parse(Console.ReadLine());\n            string[] b = new string[M];\n            int[] y = new int[M];\n            int[] x = new int[M];\n            for (int i = 0; i <= M-1; i++)\n            {\n                b[i] = Console.ReadLine();\n                x[i] = int.Parse(b[i].Split(' ')[0])-1;\n                y[i] = int.Parse(b[i].Split(' ')[1])-1;\n            }\n            double u = 1;\n                for (int i = 0; ;)\n            {\n                if (i > M-1)\n                { break; }\n                u = gg[x[i]] * u;\n                if (x[i] < y[i])\n                { x[i] += 1; }\n                else if (x[i] == y[i])\n                {\n                    Console.WriteLine(u); u = 1;\n                    i++;\n                }\n            \n            \n            }\n\n\n\n                Console.ReadLine();\n\n        }\n    }\n}\n\n\n        }\n    }\n}\n\n,COMPILE_ERROR,0,0
1468945496285732864,3c729174056634fec655082fe5bb1a566d8c3906d20b97e4072ede47c15e1d2e,2021-12-09 22:07:52,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace ConsoleApplication29\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {   \n\n            double w = 10e9 + 7;\n            UInt64 N = UInt64.Parse(Console.ReadLine());\n            string g=Console.ReadLine();\n            string [] a =g.Split(' ');\n            int[] gg = new int[a.Length];\n            for (int i = 0; i <= a.Length - 1; i++)\n            { gg[i] = int.Parse(a[i]); }\n            int M = int.Parse(Console.ReadLine());\n            string[] b = new string[M];\n            int[] y = new int[M];\n            int[] x = new int[M];\n            for (int i = 0; i <= M-1; i++)\n            {\n                b[i] = Console.ReadLine();\n                x[i] = int.Parse(b[i].Split(' ')[0])-1;\n                y[i] = int.Parse(b[i].Split(' ')[1])-1;\n            }\n            double u = 1;\n                for (int i = 0; ;)\n            {\n                if (i > M-1)\n                { break; }\n                u = gg[x[i]] * u;\n                if (x[i] < y[i])\n                { x[i] += 1; }\n                else if (x[i] == y[i])\n                {\n                    Console.WriteLine(u); u = 1;\n                    i++;\n                }\n            \n            \n            }\n\n\n\n                Console.ReadLine();\n\n        }\n    }\n}\n\n\n        \n\n,PARTIAL_ACCEPTED,21,3872
1468962484462641152,9980b561e03fb9b154d28eddf2cab08f88e746587d4a71ddf37b0c4893c729fb,2021-12-09 23:15:22,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\nll n;\nll q;\nconst int N=100010;\nll a[N];\nll b[N];\nint main(){\n    scanf(\""%lld\"",&n);\n    for(int i=1;i<=n;i++){\n        scanf(\""%lld\"",&a[i]);\n    }\n    scanf(\""%lld\"",&q);\n    int k=0;\n    while(q--){\n        ll l,r;\n        scanf(\""%lld %lld\"",&l,&r);\n        ll sum=1;\n        for(int i=l;i<=r;i++){\n            sum*=a[i];\n        }\n        b[k++]=sum%(1000000000+7);\n \n    }\n    for(int i=0;i<k;i++){\n        printf(\""%lld\\n\"",b[i]);\n    }\n    \n\n                                                                               \n    \n    \n    system(\""pause\"");\n    return 0;  \n}",PARTIAL_ACCEPTED,4,688
1469141813566058496,55c7466d040457b456bc3483a7452d46e40a281f26e8f763b6dde1e862de5d71,2021-12-10 11:07:58,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\nconst int maX=100000;\nint main()\n{\n    int a,b[max];\n    int money[max];\n    cin>>a;\n   for(int i=0;i<a;i++) cin>>b[i];\n    for(int i=0;i<b;i++)\n    {\n        int m,n;\n        cin>>m>>n;\n        for(int j=m-1;j<n-1;j++)\n        {\n            money[i]*=b[j];\n        }\n    }\n    for(int i=0;i<b-1;i++) cout<<money[i]<<endl;\n    cout<<money[b-1];\n    return 0;\n}",COMPILE_ERROR,0,0
1469145221706727424,55c7466d040457b456bc3483a7452d46e40a281f26e8f763b6dde1e862de5d71,2021-12-10 11:21:30,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n#define max 10000\nint main()\n{\n    int a,c,b[max];\n    int money[max];\n    cin >> a;\n    for (int i = 0; i < a; i++) cin >> b[i];\n    cin >> c;\n    for (int i = 0; i < c; i++)\n    {\n        int m, n;\n        cin >> m >> n;\n        for (int j = m - 1; j < n - 1; j++)\n        {\n            money[i] *= b[j];\n        }\n    }\n    for (int i = 0; i < c - 1; i++) cout << money[i] << endl;\n    cout << money[c - 1];\n    return 0;\n}",MULTIPLE_ERROR,13,580
1469149101051817984,55c7466d040457b456bc3483a7452d46e40a281f26e8f763b6dde1e862de5d71,2021-12-10 11:36:55,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n#define max 10000\nint main()\n{\n    int a,c,b[max];\n    int money[max];\n    cin >> a;\n    for (int i = 0; i < a; i++) cin >> b[i];\n    cin >> c;\n    for (int i = 0; i < c; i++)\n    {\n        money[i] = 1;\n        int m, n;\n        cin >> m >> n;\n        for (int j = m - 1; j <=n - 1; j++)\n        {\n            money[i] *= b[j];\n        }\n    }\n    for (int i = 0; i < c - 1; i++) cout << money[i] << endl;\n    cout << money[c - 1];\n    return 0;\n}",PARTIAL_ACCEPTED,12,572
1469149173349269504,55c7466d040457b456bc3483a7452d46e40a281f26e8f763b6dde1e862de5d71,2021-12-10 11:37:13,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n#define max 100000\nint main()\n{\n    int a,c,b[max];\n    int money[max];\n    cin >> a;\n    for (int i = 0; i < a; i++) cin >> b[i];\n    cin >> c;\n    for (int i = 0; i < c; i++)\n    {\n        money[i] = 1;\n        int m, n;\n        cin >> m >> n;\n        for (int j = m - 1; j <=n - 1; j++)\n        {\n            money[i] *= b[j];\n        }\n    }\n    for (int i = 0; i < c - 1; i++) cout << money[i] << endl;\n    cout << money[c - 1];\n    return 0;\n}",PARTIAL_ACCEPTED,3,440
1469149261039583232,55c7466d040457b456bc3483a7452d46e40a281f26e8f763b6dde1e862de5d71,2021-12-10 11:37:33,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<iostream>\nusing namespace std;\n#define max 100000\nint main()\n{\n    int a,c,b[max];\n    int money[max];\n    cin >> a;\n    for (int i = 0; i < a; i++) cin >> b[i];\n    cin >> c;\n    for (int i = 0; i < c; i++)\n    {\n        money[i] = 1;\n        int m, n;\n        cin >> m >> n;\n        for (int j = m - 1; j <=n - 1; j++)\n        {\n            money[i] *= b[j];\n        }\n    }\n    for (int i = 0; i < c - 1; i++) cout << money[i] << endl;\n    cout << money[c - 1];\n    return 0;\n}",PARTIAL_ACCEPTED,4,444
1469200408433111040,0602cde71f8aa024f748b269e93c3b16111a5a057be9c8983d4197f943fa4c0b,2021-12-10 15:00:48,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#define _CRT_SECURE_NO_WARNINGS\n#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<vector>\ntypedef unsigned long long LL;\nusing namespace std;\nconst int N = 2e5 + 10;\nint arr[N];\nLL mod(vector<int> &A, LL b = 2e9 + 7)\n{\n\tLL t = 0;\n\tvector<int> C;\n\tfor (int i = A.size() - 1; i >= 0; i--)\n\t{\n\t\tt = t * 10 + A[i];\n\t\tt %= b;\n\t}\n\treturn t;\n}\nvector<int> mul(vector<int> A, int b)\n{\n\tint t = 0;\n\tvector<int> C;\n\tfor (int i = 0; i < A.size() || t; i++)\n\t{\n\t\tif (i < A.size())t = t + A[i] * b;\n\t\tC.push_back(t % 10);\n\t\tt /= 10;\n\t}\n\twhile (C.size() > 1 && C.back() == 0) C.pop_back();\n\treturn C;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"", &arr[i]);\n\t}\n\tint m = 0;\n\tcin >> m;\n\twhile (m--)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tvector<int> B;\n\t\tB.push_back(1);\n\t\tfor (int i = l; i <= r; i++)\n\t\t{\n\t\t\tB = mul(B, arr[i]);\n\t\t}\n\t\tcout << mod(B) << endl;\n\t}\n}",COMPILE_ERROR,0,0
1469200729503031296,0602cde71f8aa024f748b269e93c3b16111a5a057be9c8983d4197f943fa4c0b,2021-12-10 15:02:05,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#define _CRT_SECURE_NO_WARNINGS\n#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<vector>\ntypedef unsigned long long LL;\nusing namespace std;\nconst int N = 2e5 + 10;\nint arr[N];\nLL mod(vector<int> &A, LL b = 2e9 + 7)\n{\n\tLL t = 0;\n\tvector<int> C;\n\tfor (int i = A.size() - 1; i >= 0; i--)\n\t{\n\t\tt = t * 10 + A[i];\n\t\tt %= b;\n\t}\n\treturn t;\n}\nvector<int> mul(vector<int> A, int b)\n{\n\tint t = 0;\n\tvector<int> C;\n\tfor (int i = 0; i < A.size() || t; i++)\n\t{\n\t\tif (i < A.size())t = t + A[i] * b;\n\t\tC.push_back(t % 10);\n\t\tt /= 10;\n\t}\n\twhile (C.size() > 1 && C.back() == 0) C.pop_back();\n\treturn C;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"", &arr[i]);\n\t}\n\tint m = 0;\n\tcin >> m;\n\twhile (m--)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tvector<int> B;\n\t\tB.push_back(1);\n\t\tfor (int i = l; i <= r; i++)\n\t\t{\n\t\t\tB = mul(B, arr[i]);\n\t\t}\n\t\tcout << mod(B) << endl;\n\t}\n}",PARTIAL_ACCEPTED,3,512
1469201043161272320,0602cde71f8aa024f748b269e93c3b16111a5a057be9c8983d4197f943fa4c0b,2021-12-10 15:03:19,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#define _CRT_SECURE_NO_WARNINGS\n#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<vector>\ntypedef unsigned long long LL;\nusing namespace std;\nconst int N = 2e5 + 10;\nint arr[N];\nLL mod(vector<int> &A, LL b = 2e9 + 7)\n{\n\tLL t = 0;\n\tvector<int> C;\n\tfor (int i = A.size() - 1; i >= 0; i--)\n\t{\n\t\tt = t * 10 + A[i];\n\t\tt %= b;\n\t}\n\treturn t;\n}\nvector<int> mul(vector<int> A, int b)\n{\n\tint t = 0;\n\tvector<int> C;\n\tfor (int i = 0; i < A.size() || t; i++)\n\t{\n\t\tif (i < A.size())t = t + A[i] * b;\n\t\tC.push_back(t % 10);\n\t\tt /= 10;\n\t}\n\twhile (C.size() > 1 && C.back() == 0) C.pop_back();\n\treturn C;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"", &arr[i]);\n\t}\n\tint m = 0;\n\tcin >> m;\n\twhile (m--)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tvector<int> B;\n\t\tB.push_back(1);\n\t\tfor (int i = l; i <= r; i++)\n\t\t{\n\t\t\tB = mul(B, arr[i]);\n\t\t}\n\t\tcout << mod(B) << endl;\n\t}\n}",PARTIAL_ACCEPTED,3,488
1469201897725546496,0602cde71f8aa024f748b269e93c3b16111a5a057be9c8983d4197f943fa4c0b,2021-12-10 15:06:43,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#define _CRT_SECURE_NO_WARNINGS\n#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<vector>\ntypedef unsigned long long LL;\nusing namespace std;\nconst int N = 2e5 + 10;\nint arr[N];\nLL mod(vector<int> &A, LL b = e9 + 7)\n{\n\tLL t = 0;\n\tvector<int> C;\n\tfor (int i = A.size() - 1; i >= 0; i--)\n\t{\n\t\tt = t * 10 + A[i];\n\t\tt %= b;\n\t}\n\treturn t;\n}\nvector<int> mul(vector<int> A, int b)\n{\n\tint t = 0;\n\tvector<int> C;\n\tfor (int i = 0; i < A.size() || t; i++)\n\t{\n\t\tif (i < A.size())t = t + A[i] * b;\n\t\tC.push_back(t % 10);\n\t\tt /= 10;\n\t}\n\twhile (C.size() > 1 && C.back() == 0) C.pop_back();\n\treturn C;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"", &arr[i]);\n\t}\n\tint m = 0;\n\tcin >> m;\n\twhile (m--)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tvector<int> B;\n\t\tB.push_back(1);\n\t\tfor (int i = l; i <= r; i++)\n\t\t{\n\t\t\tB = mul(B, arr[i]);\n\t\t}\n\t\tcout << mod(B) << endl;\n\t}\n}",COMPILE_ERROR,0,0
1469201983104856064,0602cde71f8aa024f748b269e93c3b16111a5a057be9c8983d4197f943fa4c0b,2021-12-10 15:07:03,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#define _CRT_SECURE_NO_WARNINGS\n#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<vector>\ntypedef unsigned long long LL;\nusing namespace std;\nconst int N = 2e5 + 10;\nint arr[N];\nLL mod(vector<int> &A, LL b = 1e9 + 7)\n{\n\tLL t = 0;\n\tvector<int> C;\n\tfor (int i = A.size() - 1; i >= 0; i--)\n\t{\n\t\tt = t * 10 + A[i];\n\t\tt %= b;\n\t}\n\treturn t;\n}\nvector<int> mul(vector<int> A, int b)\n{\n\tint t = 0;\n\tvector<int> C;\n\tfor (int i = 0; i < A.size() || t; i++)\n\t{\n\t\tif (i < A.size())t = t + A[i] * b;\n\t\tC.push_back(t % 10);\n\t\tt /= 10;\n\t}\n\twhile (C.size() > 1 && C.back() == 0) C.pop_back();\n\treturn C;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"", &arr[i]);\n\t}\n\tint m = 0;\n\tcin >> m;\n\twhile (m--)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tvector<int> B;\n\t\tB.push_back(1);\n\t\tfor (int i = l; i <= r; i++)\n\t\t{\n\t\t\tB = mul(B, arr[i]);\n\t\t}\n\t\tcout << mod(B) << endl;\n\t}\n}",PARTIAL_ACCEPTED,4,448
1469202587525177344,0602cde71f8aa024f748b269e93c3b16111a5a057be9c8983d4197f943fa4c0b,2021-12-10 15:09:27,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#define _CRT_SECURE_NO_WARNINGS\n#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<vector>\ntypedef unsigned long long LL;\nusing namespace std;\nconst int N = 2e5 + 10;\nint arr[N];\nLL mod(vector<int> &A, LL b = 1e9 + 7)\n{\n\tLL t = 0;\n\tvector<int> C;\n\tfor (int i = A.size() - 1; i >= 0; i--)\n\t{\n\t\tt = t * 10 + A[i];\n\t\tt %= b;\n\t}\n\treturn t;\n}\nvector<int> mul(vector<int> &A, int b)\n{\n\tint t = 0;\n\tvector<int> C;\n\tfor (int i = 0; i < A.size() || t; i++)\n\t{\n\t\tif (i < A.size())t = t + A[i] * b;\n\t\tC.push_back(t % 10);\n\t\tt /= 10;\n\t}\n\twhile (C.size() > 1 && C.back() == 0) C.pop_back();\n\treturn C;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"", &arr[i]);\n\t}\n\tint m = 0;\n\tcin >> m;\n\twhile (m--)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tvector<int> B;\n\t\tB.push_back(1);\n\t\tfor (int i = l; i <= r; i++)\n\t\t{\n\t\t\tB = mul(B, arr[i]);\n\t\t}\n\t\tcout << mod(B) << endl;\n\t}\n}",PARTIAL_ACCEPTED,3,392
1469215239848714240,0602cde71f8aa024f748b269e93c3b16111a5a057be9c8983d4197f943fa4c0b,2021-12-10 15:59:44,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#define _CRT_SECURE_NO_WARNINGS\n#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<vector>\ntypedef unsigned long long LL;\nusing namespace std;\nconst int N = 2e5 + 10;\nint arr[N];\nLL mod(vector<int> &A, LL b = 1e9 + 7)\n{\n\tLL t = 0;\n\tvector<int> C;\n\tfor (int i = A.size() - 1; i >= 0; i--)\n\t{\n\t\tt = t * 10 + A[i];\n\t\tt %= b;\n\t}\n\treturn t;\n}\nvector<int> mul(vector<int> &A, int b)\n{\n\tint t = 0;\n\tvector<int> C;\n\tfor (int i = 0; i < A.size() || t; i++)\n\t{\n\t\tif (i < A.size())t = t + A[i] * b;\n\t\tC.push_back(t % 10);\n\t\tt /= 10;\n\t}\n\twhile (C.size() > 1 && C.back() == 0) C.pop_back();\n\treturn C;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"", &arr[i]);\n\t}\n\tint m = 0;\n\tcin >> m;\n\twhile (m--)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tvector<int> B;\n\t\tB.push_back(1);\n\t\tfor (int i = l; i <= r; i++)\n\t\t{\n\t\t\tB = mul(B, arr[i]);\n\t\t}\n\t\tcout << mod(B) << endl;\n\t}\n}",PARTIAL_ACCEPTED,3,432
1469215553632985088,0602cde71f8aa024f748b269e93c3b16111a5a057be9c8983d4197f943fa4c0b,2021-12-10 16:00:59,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#define _CRT_SECURE_NO_WARNINGS\n#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<vector>\ntypedef long long LL;\nusing namespace std;\nconst int N = 2e5 + 10;\nint arr[N];\nLL mod(vector<int> &A, LL b = 1e9 + 7)\n{\n\tLL t = 0;\n\tvector<int> C;\n\tfor (int i = A.size() - 1; i >= 0; i--)\n\t{\n\t\tt = t * 10 + A[i];\n\t\tt %= b;\n\t}\n\treturn t;\n}\nvector<int> mul(vector<int> &A, int b)\n{\n\tint t = 0;\n\tvector<int> C;\n\tfor (int i = 0; i < A.size() || t; i++)\n\t{\n\t\tif (i < A.size())t = t + A[i] * b;\n\t\tC.push_back(t % 10);\n\t\tt /= 10;\n\t}\n\twhile (C.size() > 1 && C.back() == 0) C.pop_back();\n\treturn C;\n}\nint main()\n{\n\tint n = 0;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"", &arr[i]);\n\t}\n\tint m = 0;\n\tcin >> m;\n\twhile (m--)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tvector<int> B;\n\t\tB.push_back(1);\n\t\tfor (int i = l; i <= r; i++)\n\t\t{\n\t\t\tB = mul(B, arr[i]);\n\t\t}\n\t\tcout << mod(B) << endl;\n\t}\n}",PARTIAL_ACCEPTED,4,384
1469217311679557632,b7323abd5144d526957b175802b9fed5c684c411fa4b548a8f88e785b8cd0faa,2021-12-10 16:07:58,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<cstring> \n#include<math.h> \n#include<cstdio> \n#include<stack>\nusing namespace std;\nint c[1000010];\n\n\nint main(int argc, char** argv) \n{\n\t\n\t\tint n;cin>>n;\n\t\tlong long price[n+1];\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcin>>price[i];\n\t\t}\n\t\tint q;cin>>q;\n\t\tlong long money=1;\n\t\t//int a=1;\n\t\t\n\t\t\n\t\tfor(int i=0;i<q;i++){\n\t\t\tint l,r;\n\t\t\tcin>>l>>r;\n\t\t\tfor(int j=l;j<=r;j++){\n\t\t\t\tmoney*=price[j];\n                \n\t\t\t}\n            cout<<money<<endl;\n                money=1;\n\t\t}\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\n\t\n\t\treturn 0;\n\t}\n\t",COMPILE_ERROR,0,0
1469217342423805952,b7323abd5144d526957b175802b9fed5c684c411fa4b548a8f88e785b8cd0faa,2021-12-10 16:08:05,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<cstring> \n#include<math.h> \n#include<cstdio> \n#include<stack>\nusing namespace std;\nint c[1000010];\n\n\nint main(int argc, char** argv) \n{\n\t\n\t\tint n;cin>>n;\n\t\tlong long price[n+1];\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcin>>price[i];\n\t\t}\n\t\tint q;cin>>q;\n\t\tlong long money=1;\n\t\t//int a=1;\n\t\t\n\t\t\n\t\tfor(int i=0;i<q;i++){\n\t\t\tint l,r;\n\t\t\tcin>>l>>r;\n\t\t\tfor(int j=l;j<=r;j++){\n\t\t\t\tmoney*=price[j];\n                \n\t\t\t}\n            cout<<money<<endl;\n                money=1;\n\t\t}\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\n\t\n\t\treturn 0;\n\t}\n\t",PARTIAL_ACCEPTED,3,332
1469218274033250304,b7323abd5144d526957b175802b9fed5c684c411fa4b548a8f88e785b8cd0faa,2021-12-10 16:11:47,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<cstring> \n#include<math.h> \n#include<cstdio> \n#include<stack>\nusing namespace std;\nint c[1000010];\n\n\nint main(int argc, char** argv) \n{\n\t\n\t\tint n;cin>>n;\n\t\tlong long price[n+1];\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcin>>price[i];\n\t\t}\n\t\tint q;cin>>q;\n\t\tlong long money=1;\n\t\t//int a=1;\n\t\t\n\t\t\n\t\tfor(int i=0;i<q;i++){\n\t\t\tint l,r;\n\t\t\tcin>>l>>r;\n\t\t\tfor(int j=l;j<=r;j++){\n\t\t\t\tmoney*=price[j];\n                \n\t\t\t}\n            cout<<money<<endl;\n                money=1;\n\t\t}\n\t\n\t\n\t\treturn 0;\n\t}\n\t",PARTIAL_ACCEPTED,3,496
1469218726229561344,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:13:35,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            int Q = int.Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            int[] a = new int[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = Convert.ToInt32(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                int L = int.Parse(q[i].Substring(0, x));\n                int R = int.Parse(q[i].Substring(x + 1));\n\n                if (L < R)\n                {\n                    int sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < Q)\n                    {\n                        Console.WriteLine(sum);\n                    }\n                    else if (i == Q)\n                    {\n                        Console.Write(sum);\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < Q)\n                    {                       \n                            Console.WriteLine(a[L]);                    \n                    }\n                    if (i == Q)\n                    {\n                        Console.Write(a[L]);\n                    }\n                }\n            }\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1469218761058996224,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:13:44,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            int Q = int.Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            int[] a = new int[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = Convert.ToInt32(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                int L = int.Parse(q[i].Substring(0, x));\n                int R = int.Parse(q[i].Substring(x + 1));\n\n                if (L < R)\n                {\n                    int sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < Q)\n                    {\n                        Console.WriteLine(sum);\n                    }\n                    else if (i == Q)\n                    {\n                        Console.Write(sum);\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < Q)\n                    {                       \n                            Console.WriteLine(a[L]);                    \n                    }\n                    if (i == Q)\n                    {\n                        Console.Write(a[L]);\n                    }\n                }\n            }\n        }\n    }\n}\n",MULTIPLE_ERROR,26,3264
1469219417769562112,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:16:20,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            short n = short.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            short Q = short.Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            short[] a = new short[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = Convert.ToInt16(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                short L = short.Parse(q[i].Substring(0, x));\n                short R = short.Parse(q[i].Substring(x + 1));\n\n                if (L < R)\n                {\n                    short sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < Q)\n                    {\n                        Console.WriteLine(sum);\n                    }\n                    else if (i == Q)\n                    {\n                        Console.Write(sum);\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < Q)\n                    {                       \n                            Console.WriteLine(a[L]);                    \n                    }\n                    if (i == Q)\n                    {\n                        Console.Write(a[L]);\n                    }\n                }\n            }\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,45,3476
1469219643880361984,5d40d6e8e98ae8172f26add7d32c06eae8beb72fadfed62545cd255f59799c25,2021-12-10 16:17:14,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace ConsoleApp63\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            int[] arr = new int[n];\n           \n            for(int i=0;i<n;i++)\n            {\n                arr[i] = int.Parse(s.Split(' ')[i]);\n            }\n            int num = int.Parse(Console.ReadLine());\n            string[] str = new string[num];\n            for(int i=0;i<num;i++)\n            {\n                int sum = 1;\n                string ss = Console.ReadLine();\n                int a = int.Parse(ss.Split(' ')[0]);\n                int b = int.Parse(ss.Split(' ')[1]);\n                for(int j=a-1;j<b;j++)\n                {\n                    sum *= arr[j];\n                }\n                str[i] = sum.ToString();\n            }\n            for(int i=0;i<num;i++)\n            {\n                Console.WriteLine(str[i].ToString());\n            }\n            return;\n        }\n\n\n    }\n}\n ,PARTIAL_ACCEPTED,19,3744
1469219964056743936,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:18:30,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            short n = short.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            short Q = short.Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            short[] a = new short[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = Convert.ToInt16(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                short L = short.Parse(q[i].Substring(0, x));\n                short R = short.Parse(q[i].Substring(x + 1));\n\n                if (L < R)\n                {\n                    short sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < Q)\n                    {\n                        Console.WriteLine(sum%(10*10*10*10*10*10*10*10*10+7));\n                    }\n                    else if (i == Q)\n                    {\n                        Console.Write(sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < Q)\n                    {\n                        Console.WriteLine(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));                    \n                    }\n                    if (i == Q)\n                    {\n                        Console.Write(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n            }\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,42,3516
1469220792104636416,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:21:48,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            int Q = int.Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            int[] a = new int[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = Convert.ToInt16(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                int L = int.Parse(q[i].Substring(0, x));\n                int R = int.Parse(q[i].Substring(x + 1));\n\n                if (L < R)\n                {\n                    int sum = 1;\n                    for (int j = L; j <= R; j++)\n                        {\n                        sum *= a[j-1];\n                    }\n                    if (i < Q)\n                    {\n                        Console.WriteLine(sum%(10*10*10*10*10*10*10*10*10+7));\n                    }\n                    else if (i == Q)\n                    {\n                        Console.Write(sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < Q)\n                    {\n                        Console.WriteLine(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));                    \n                    }\n                    if (i == Q)\n                    {\n                        Console.Write(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n            }\n        }\n    }\n}",NON_ZERO_EXIT_CODE,66,10276
1469221387079176192,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:24:10,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            int Q = int.Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            int[] a = new int[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = Convert.ToInt16(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                int L = int.Parse(q[i].Substring(0, x));\n                int R = int.Parse(q[i].Substring(x + 1));\n\n                if (L < R)\n                {\n                    int sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < (Q-1))\n                    {\n                        Console.WriteLine(sum%(10*10*10*10*10*10*10*10*10+7));\n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < (Q-1))\n                    {\n                        Console.WriteLine(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));                    \n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n            }\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,67,10052
1469221969240182784,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:26:28,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            short n = short.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            short Q = short. Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            short[] a = new short[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = Convert.ToInt16(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                short L = short. Parse(q[i].Substring(0, x));\n                short R = short.Parse(q[i].Substring(x + 1));\n\n                if (L < R)\n                {\n                    short sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < (Q-1))\n                        {\n                        Console.WriteLine(sum%(10*10*10*10*10*10*10*10*10+7));\n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < (Q-1))\n                    {\n                        Console.WriteLine(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));                    \n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n            }\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,46,3560
1469222370832408576,b7323abd5144d526957b175802b9fed5c684c411fa4b548a8f88e785b8cd0faa,2021-12-10 16:28:04,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\nusing namespace std;\n\nint main(int argc, char** argv)\n{\n\tint n; \n\tcin >> n;\n\n\tlong price[n + 1];\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tcin >> price[i];\n\t}\n\n\tint q; \n\tcin >> q;\n\tlong long money = 1;\n\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tfor (int j = l; j <= r; j++) \n\t\t{\n\t\t\tmoney *= price[j];\n\t\t}\n\t\tcout << money << endl;\n\t\tmoney = 1;\n\t}\n\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,3,444
1469222562323222528,b7323abd5144d526957b175802b9fed5c684c411fa4b548a8f88e785b8cd0faa,2021-12-10 16:28:50,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\nint main(int argc, char** argv)\n{\n\tint n; \n\tcin >> n;\n\n\tlong price[n + 1];\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"",&price[i]);\n\t}\n\n\tint q; \n\tcin >> q;\n\tlong long money = 1;\n\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tfor (int j = l; j <= r; j++) \n\t\t{\n\t\t\tmoney *= price[j];\n\t\t}\n\t\tcout << money << endl;\n\t\tmoney = 1;\n\t}\n\n\treturn 0;\n}\n",MULTIPLE_ERROR,3,316
1469222629822091264,b7323abd5144d526957b175802b9fed5c684c411fa4b548a8f88e785b8cd0faa,2021-12-10 16:29:06,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\nint main(int argc, char** argv)\n{\n\tint n; \n\tcin >> n;\n\n\tlong price[n + 1];\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%ld\"",&price[i]);\n\t}\n\n\tint q; \n\tcin >> q;\n\tlong long money = 1;\n\n\tfor (int i = 0; i < q; i++)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tfor (int j = l; j <= r; j++) \n\t\t{\n\t\t\tmoney *= price[j];\n\t\t}\n\t\tcout << money << endl;\n\t\tmoney = 1;\n\t}\n\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,3,596
1469223848900943872,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:33:57,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            ushort n = ushort.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            ushort Q = ushort. Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            ushort[] a = new ushort[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = ushort.Parse(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                short L = short. Parse(q[i].Substring(0, x));\n                short R = short.Parse(q[i].Substring(x + 1));\n\n                if (L < R)\n                {\n                    ushort sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < (Q-1))\n                        {\n                        Console.WriteLine(sum%(10*10*10*10*10*10*10*10*10+7));\n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < (Q-1))\n                    {\n                        Console.WriteLine(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));                    \n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n            }\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,40,3384
1469224054539280384,b7323abd5144d526957b175802b9fed5c684c411fa4b548a8f88e785b8cd0faa,2021-12-10 16:34:46,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\nint main(int argc, char** argv)\n{\n\tint n; \n\tcin >> n;\n\n\tint price[n + 1];\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"",&price[i]);\n\t}\n\n\tint q; \n\tcin >> q;\n\tlong long money = 1;\n\n\twhile(q--)\n\t\tint l, r;\n\t\tcin >> l >> r;\n        long long temp_l=1,temp_r=1;\n\t\tfor (int j = l; j <= (r-l)/2; j++) \n\t\t{\n\t\t\tmoney *= price[j];\n\t\t}\n\t\tcout << money << endl;\n\t\tmoney = 1;\n\t}\n\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1469224080472662016,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:34:52,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            ushort n = ushort.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            ushort Q = ushort. Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            ushort[] a = new ushort[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = ushort.Parse(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                short L = short. Parse(q[i].Substring(0, x));\n                short R = short.Parse(q[i].Substring(x + 1));\n                ushort sum=0;\n                if (L < R)\n                {\n                     sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < (Q-1))\n                        {\n                        Console.WriteLine(sum%(10*10*10*10*10*10*10*10*10+7));\n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < (Q-1))\n                    {\n                        Console.WriteLine(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));                    \n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n            }\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,42,3452
1469224716995907584,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:37:24,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            ushort n = ushort.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            ushort Q = ushort. Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            ushort[] a = new ushort[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = ushort.Parse(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n            ushort sum=0;\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                short L = short. Parse(q[i].Substring(0, x));\n                short R = short.Parse(q[i].Substring(x + 1));\n                \n                if (L < R)\n                {\n                     sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < (Q-1))\n                        {\n                        Console.WriteLine(sum%(10*10*10*10*10*10*10*10*10+7));\n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < (Q-1))\n                    {\n                        Console.WriteLine(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));                    \n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n            }\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,43,3444
1469224941818925056,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:38:17,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            ushort n = ushort.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            ushort Q = ushort. Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            ushort[] a = new ushort[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = ushort.Parse(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n                    ushort sum=0;\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                ushort L = ushort. Parse(q[i].Substring(0, x));\n                ushort R = ushort.Parse(q[i].Substring(x + 1));\n                \n                if (L < R)\n                {\n                     sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < (Q-1))\n                        {\n                        Console.WriteLine(sum%(10*10*10*10*10*10*10*10*10+7));\n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < (Q-1))\n                    {\n                        Console.WriteLine(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));                    \n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n            }\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,41,3592
1469225119003103232,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:38:59,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            short n = short.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            short Q = short. Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            short[] a = new ushort[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = ushort.Parse(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n                    short sum=0;\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                short L = short. Parse(q[i].Substring(0, x));\n                short R = short.Parse(q[i].Substring(x + 1));\n                \n                if (L < R)\n                {\n                       sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < (Q-1))\n                        {\n                        Console.WriteLine(sum%(10*10*10*10*10*10*10*10*10+7));\n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < (Q-1))\n                    {\n                        Console.WriteLine(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));                    \n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n            }\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1469225167078215680,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:39:11,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            short n = short.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            short Q = short. Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            short[] a = new ushort[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = short.Parse(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n                    short sum=0;\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                short L = short. Parse(q[i].Substring(0, x));\n                short R = short.Parse(q[i].Substring(x + 1));\n                \n                if (L < R)\n                {\n                       sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < (Q-1))\n                        {\n                        Console.WriteLine(sum%(10*10*10*10*10*10*10*10*10+7));\n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < (Q-1))\n                    {\n                        Console.WriteLine(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));                    \n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n            }\n        }\n    }\n}\n",COMPILE_ERROR,0,0
1469225335739568128,45ba9858c1db9304d02facd16208c6140d171a4afc28580c1d897ce73a059a56,2021-12-10 16:39:51,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace 蓝桥杯第四题\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            short n = short.Parse(Console.ReadLine());\n            string s = Console.ReadLine();\n            short Q = short. Parse(Console.ReadLine());\n\n            string[] u = s.Split(' ');\n            short[] a = new short[n];\n            for (int i = 0; i < n; i++)\n            {\n                a[i] = short.Parse(u[i]);\n            }\n            string[] q = new string[Q];\n            for (int i = 0; i < Q; i++)\n            {\n                q[i] = Console.ReadLine();\n            }\n                    short sum=0;\n            for (int i = 0; i < Q; i++)\n            {\n                int x = q[i].IndexOf(\"" \"");\n                short L = short. Parse(q[i].Substring(0, x));\n                short R = short.Parse(q[i].Substring(x + 1));\n                \n                if (L < R)\n                {\n                       sum = 1;\n                    for (int j = L; j <= R; j++)\n                    {\n                        sum *= a[j-1];\n                    }\n                    if (i < (Q-1))\n                        {\n                        Console.WriteLine(sum%(10*10*10*10*10*10*10*10*10+7));\n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(sum % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n                else if (L == R)\n                {\n                    if (i < (Q-1))\n                    {\n                        Console.WriteLine(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));                    \n                    }\n                    else if (i == (Q-1))\n                    {\n                        Console.Write(a[L] % (10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 + 7));\n                    }\n                }\n            }\n        }\n    }\n}\n",NON_ZERO_EXIT_CODE,41,3492
1469225662089973760,b7323abd5144d526957b175802b9fed5c684c411fa4b548a8f88e785b8cd0faa,2021-12-10 16:41:09,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\nint main(int argc, char** argv)\n{\n\tint n; \n\tcin >> n;\n\n\tint price[n + 1];\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"",&price[i]);\n\t}\n\n\tint q; \n\tcin >> q;\n\tlong long money = 1;\n\n\twhile(q--)\n\t\tint l, r;\n\t\tcin >> l >> r;\n        long long temp_l=1,temp_r=1;\n\t\tif(l<=r)\n        {\n\t\t\tmoney *= price[l]*price[r];\n            l++;r--;\n\t\t}\n\t\tcout << money << endl;\n\t\tmoney = 1;\n\t}\n\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1469225690007326720,b7323abd5144d526957b175802b9fed5c684c411fa4b548a8f88e785b8cd0faa,2021-12-10 16:41:16,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\nint main(int argc, char** argv)\n{\n\tint n; \n\tcin >> n;\n\n\tint price[n + 1];\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"",&price[i]);\n\t}\n\n\tint q; \n\tcin >> q;\n\tlong long money = 1;\n\n\twhile(q--)\n\t\tint l, r;\n\t\tcin >> l >> r;\n        long long temp_l=1,temp_r=1;\n\t\tif(l<=r)\n        {\n\t\t\tmoney *= price[l]*price[r];\n            l++;r--;\n\t\t}\n\t\tcout << money << endl;\n\t\tmoney = 1;\n\t}\n\n\treturn 0;\n}\n",COMPILE_ERROR,0,0
1469225774178553856,b7323abd5144d526957b175802b9fed5c684c411fa4b548a8f88e785b8cd0faa,2021-12-10 16:41:36,C++,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\nint main(int argc, char** argv)\n{\n\tint n;\n\tcin >> n;\n\n\tint price[n + 1];\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"", &price[i]);\n\t}\n\n\tint q;\n\tcin >> q;\n\tlong long money = 1;\n\n\twhile (q--)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tlong long temp_l = 1, temp_r = 1;\n\t\tif (l <= r)\n\t\t{\n\t\t\tmoney *= price[l] * price[r];\n\t\t\tl++; r--;\n\t\t}\n\t\tcout << money << endl;\n\t\tmoney = 1;\n\t}\n\n\treturn 0;\n}\n",WRONG_ANSWER,254,1708
1469227798345527296,b7323abd5144d526957b175802b9fed5c684c411fa4b548a8f88e785b8cd0faa,2021-12-10 16:49:38,C++,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include <iostream>\n#include<stdio.h>\nusing namespace std;\n\nint main(int argc, char** argv)\n{\n\tint n;\n\tcin >> n;\n\n\tint *price = new int[n+1];\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tscanf(\""%d\"", &price[i]);\n\t}\n\n\tint q;\n\tcin >> q;\n\tlong long money = 1;\n\n\twhile (q--)\n\t{\n\t\tint l, r;\n\t\tcin >> l >> r;\n\t\tlong long temp_l = l, temp_r = r;\n\t\twhile (l < r)\n\t\t{\n\t\t\tmoney *= price[l] * price[r];\n\t\t\tl++; r--;\n\t\t}\n\t\tif ((temp_r - temp_l)%2==0)\n\t\t{\n\t\t\tmoney *= price[(temp_r + temp_l)/2];\n\t\t}\n\t\tcout << money << endl;\n\t\tmoney = 1;\n\t}\n\n\treturn 0;\n}\n",PARTIAL_ACCEPTED,3,464
1469286531423457280,bf6df3b9cbbdea83dfd8907f8148fa0771d4181713ddc8c59938afb16c8cbd5e,2021-12-10 20:43:01,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace ConsoleApplication4\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console .ReadLine ());\n            string S = Console.ReadLine();\n            string[] s = S.Split(' ');\n            int[]arr1=new int[n];\n            for (int i = 0; i < n; i++)\n            {\n                arr1[i] = Convert.ToInt32(s[i]);\n            }\n\n\n            int q = int.Parse(Console .ReadLine ());\n\n            int[]arr2=new int[q];\n            for (int i = 0; i < q; i++)//共循环q行,先每个赋值为1\n\t\t\t{\n\t\t\t arr2[i]=1;\n\t\t\t}\n\n\n            int b=0;\n            for (int i = 0; i < q; i++)//共循环q行\n            {\n                string T = Console.ReadLine();\n             string[] t = T.Split(' ');\n             int l = int.Parse(t[0]);\n             int r = int.Parse(t[1]);\n             for (int j = l-1; j <=r-1; j++)//每行都求价格\n             {\n                 arr2[b] = arr2[b] * arr1[j];\n                 \n             }\n             arr2[b] = arr2[b] % (Convert .ToInt32 ( Math.Pow(10,9))+7);\n             b++;\n            }\n\n            for (int i = 0; i < q; i++)\n            {\n                Console.WriteLine(arr2[i]);\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,20,3612
1469291726622674944,bf6df3b9cbbdea83dfd8907f8148fa0771d4181713ddc8c59938afb16c8cbd5e,2021-12-10 21:03:40,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace ConsoleApplication4\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console .ReadLine ());\n            string S = Console.ReadLine();\n            string[] s = S.Split(' ');\n            double[] arr1 = new double[n];\n            for (int i = 0; i < n; i++)\n            {\n                arr1[i] = Math .Log ( Convert.ToInt32(s[i]));\n            }\n\n\n            int q = int.Parse(Console .ReadLine ());\n\n            double[] arr2 = new double[q];\n            for (int i = 0; i < q; i++)//共循环q行,先每个赋值为1\n\t\t\t{\n\t\t\t arr2[i]=Math .Log ( 1);\n\t\t\t}\n\n\n            int b=0;\n            for (int i = 0; i < q; i++)//共循环q行\n            {\n                string T = Console.ReadLine();\n             string[] t = T.Split(' ');\n             int l = int.Parse(t[0]);\n             int r = int.Parse(t[1]);\n             for (int j = l-1; j <=r-1; j++)//每行都求价格\n             {\n                 arr2[b] = arr2[b] * arr1[j];\n                 \n             }\n             arr2[b] = Convert.ToInt32(Math .Pow (Math .E ,arr2[b]));\n             arr2[b] = arr2[b] % (Convert .ToInt32 ( Math.Pow(10,9))+7);\n             b++;\n            }\n\n            for (int i = 0; i < q; i++)\n            {\n                Console.WriteLine(arr2[i]);\n            }\n        }\n    }\n}\n",MULTIPLE_ERROR,23,4000
1469292197332570112,bf6df3b9cbbdea83dfd8907f8148fa0771d4181713ddc8c59938afb16c8cbd5e,2021-12-10 21:05:32,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace ConsoleApplication4\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console .ReadLine ());\n            string S = Console.ReadLine();\n            string[] s = S.Split(' ');\n            double[] arr1 = new double[n];\n            for (int i = 0; i < n; i++)\n            {\n                arr1[i] = Math .Log ( Convert.ToInt32(s[i]));\n            }\n\n\n            int q = int.Parse(Console .ReadLine ());\n\n            double[] arr2 = new double[q];\n            for (int i = 0; i < q; i++)//共循环q行,先每个赋值为1\n\t\t\t{\n\t\t\t arr2[i]=Math .Log ( 1);\n\t\t\t}\n\n\n            int b=0;\n            for (int i = 0; i < q; i++)//共循环q行\n            {\n                string T = Console.ReadLine();\n             string[] t = T.Split(' ');\n             int l = int.Parse(t[0]);\n             int r = int.Parse(t[1]);\n             for (int j = l-1; j <=r-1; j++)//每行都求价格\n             {\n                 arr2[b] = arr2[b] +arr1[j];\n                 \n             }\n             arr2[b] = Convert.ToInt32(Math .Pow (Math .E ,arr2[b]));\n             arr2[b] = arr2[b] % (Convert .ToInt32 ( Math.Pow(10,9))+7);\n             b++;\n            }\n\n            for (int i = 0; i < q; i++)\n            {\n                Console.WriteLine(arr2[i]);\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,83,11232
1469293817198006272,bf6df3b9cbbdea83dfd8907f8148fa0771d4181713ddc8c59938afb16c8cbd5e,2021-12-10 21:11:58,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace ConsoleApplication4\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console .ReadLine ());\n            string S = Console.ReadLine();\n            string[] s = S.Split(' ');\n            double[] arr1 = new double[n];\n            for (int i = 0; i < n; i++)\n            {\n                arr1[i] = Math .Log ( Convert.ToInt32(s[i]));\n            }\n\n\n            int q = int.Parse(Console .ReadLine ());\n\n            double[] arr2 = new double[q];\n            for (int i = 0; i < q; i++)//共循环q行,先每个赋值为1\n\t\t\t{\n\t\t\t arr2[i]=Math .Log ( 1);\n\t\t\t}\n\n\n            int b=0;\n            for (int i = 0; i < q; i++)//共循环q行\n            {\n                string T = Console.ReadLine();\n             string[] t = T.Split(' ');\n             int l = int.Parse(t[0]);\n             int r = int.Parse(t[1]);\n             for (int j = l-1; j <=r-1; j++)//每行都求价格\n             {\n                 arr2[b] = arr2[b] +arr1[j];\n                 \n             }\n             arr2[b] = Convert.ToInt32(Math .Pow (Math .E ,arr2[b]));\n             arr2[b] = arr2[b] % (Convert .ToInt32 ( Math.Pow(10,9))+7);\n             b++;\n            }\n\n            for (int i = 0; i < q; i++)\n            {\n                Console.WriteLine(arr2[i]);\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,75,11416
1469293891076411392,bf6df3b9cbbdea83dfd8907f8148fa0771d4181713ddc8c59938afb16c8cbd5e,2021-12-10 21:12:16,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nnamespace ConsoleApplication4\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console .ReadLine ());\n            string S = Console.ReadLine();\n            string[] s = S.Split(' ');\n            double[] arr1 = new double[n];\n            for (int i = 0; i < n; i++)\n            {\n                arr1[i] = Math .Log ( Convert.ToInt32(s[i]));\n            }\n\n\n            int q = int.Parse(Console .ReadLine ());\n\n            double[] arr2 = new double[q];\n            for (int i = 0; i < q; i++)//共循环q行,先每个赋值为1\n\t\t\t{\n\t\t\t arr2[i]=Math .Log ( 1);\n\t\t\t}\n\n\n            int b=0;\n            for (int i = 0; i < q; i++)//共循环q行\n            {\n                string T = Console.ReadLine();\n             string[] t = T.Split(' ');\n             int l = int.Parse(t[0]);\n             int r = int.Parse(t[1]);\n             for (int j = l-1; j <=r-1; j++)//每行都求价格\n             {\n                 arr2[b] = arr2[b] +arr1[j];\n                 \n             }\n             arr2[b] = Convert.ToInt32(Math .Pow (Math .E ,arr2[b]))  ;\n             arr2[b] = arr2[b] % (Convert .ToInt32 ( Math.Pow(10,9))+7);\n             b++;\n            }\n\n            for (int i = 0; i < q; i++)\n            {\n                Console.WriteLine(arr2[i]);\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,82,11600
1469298630711300096,bf6df3b9cbbdea83dfd8907f8148fa0771d4181713ddc8c59938afb16c8cbd5e,2021-12-10 21:31:06,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Collections;\n\nnamespace ConsoleApplication4\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console .ReadLine ());\n            string S = Console.ReadLine();\n            string[] s = S.Split(' ');\n            double[] arr1 = new double[n];\n            for (int i = 0; i < n; i++)\n            {\n                arr1[i] = Math .Log ( Convert.ToInt32(s[i]));\n            }\n\n\n            int q = int.Parse(Console .ReadLine ());\n\n            double[] arr2 = new double[q];\n            for (int i = 0; i < q; i++)//共循环q行,先每个赋值为1\n\t\t\t{\n\t\t\t arr2[i]=Math .Log ( 1);\n\t\t\t}\n\n            ArrayList arr3 = new ArrayList();//留作arr2的后路\n\n            int b=0;\n            for (int i = 0; i < q; i++)//共循环q行\n            {\n                string T = Console.ReadLine();\n             string[] t = T.Split(' ');\n             int l = int.Parse(t[0]);\n             int r = int.Parse(t[1]);\n             for (int j = l-1; j <=r-1; j++)//每行都求价格\n             {\n                 arr2[b] = arr2[b] +arr1[j];\n                 \n             }\n             double may=arr2[b];//万一除巨大数除不开\n           double c=Math .Log ( Convert .ToInt32 ( Math.Pow(10,9))+7);//巨大数用对数形式表示\n           arr2[b] = arr2[b] - c;\n           if (arr2[b]<0)\n           {\n               arr2[b] = Convert.ToInt32( Math .Pow (Math .E ,may));\n           }\n           else\n           {\n               int zhengshu = Convert.ToInt32(Math.Pow(Math.E, arr2[b]));\n               arr2[b] = Math.Pow(Math.E, arr2[b]) - zhengshu * (Convert.ToInt32(Math.Pow(10, 9)) + 7);\n           }\n             b++;\n            }\n\n            for (int i = 0; i < q; i++)\n            {\n                Console.WriteLine(arr2[i]);\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,85,11224
1469299089756893184,bf6df3b9cbbdea83dfd8907f8148fa0771d4181713ddc8c59938afb16c8cbd5e,2021-12-10 21:32:55,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Collections;\n\nnamespace ConsoleApplication4\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console .ReadLine ());\n            string S = Console.ReadLine();\n            string[] s = S.Split(' ');\n            double[] arr1 = new double[n];\n            for (int i = 0; i < n; i++)\n            {\n                arr1[i] = Math .Log ( Convert.ToInt32(s[i]));\n            }\n\n\n            int q = int.Parse(Console .ReadLine ());\n\n            double[] arr2 = new double[q];\n            for (int i = 0; i < q; i++)//共循环q行,先每个赋值为1\n\t\t\t{\n\t\t\t arr2[i]=Math .Log ( 1);\n\t\t\t}\n\n            ArrayList arr3 = new ArrayList();//留作arr2的后路\n\n            int b=0;\n            for (int i = 0; i < q; i++)//共循环q行\n            {\n                string T = Console.ReadLine();\n             string[] t = T.Split(' ');\n             int l = int.Parse(t[0]);\n             int r = int.Parse(t[1]);\n             for (int j = l-1; j <=r-1; j++)//每行都求价格\n             {\n                 arr2[b] = arr2[b] +arr1[j];\n                 \n             }\n             double may=arr2[b];//万一除巨大数除不开\n           double c=Math .Log ( Convert .ToInt32 ( Math.Pow(10,9))+7);//巨大数用对数形式表示\n           arr2[b] = arr2[b] - c;\n           if (arr2[b]<0)\n           {\n               arr2[b] = Convert.ToInt32( Math .Pow (Math .E ,may));\n           }\n           else\n           {\n               int zhengshu = Convert.ToInt32(Math.Pow(Math.E, arr2[b]));\n               arr2[b] =Convert .ToInt32 ( Math.Pow(Math.E, arr2[b]) - zhengshu * (Convert.ToInt32(Math.Pow(10, 9)) + 7));\n           }\n             b++;\n            }\n\n            for (int i = 0; i < q; i++)\n            {\n                Console.WriteLine(arr2[i]);\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,77,11296
1469337940286365696,bf6df3b9cbbdea83dfd8907f8148fa0771d4181713ddc8c59938afb16c8cbd5e,2021-12-11 00:07:18,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Collections;\n\nnamespace ConsoleApplication4\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console .ReadLine ());\n            string S = Console.ReadLine();\n            string[] s = S.Split(' ');\n            double[] arr1 = new double[n];\n            for (int i = 0; i < n; i++)\n            {\n                arr1[i] = Math .Log ( Convert.ToInt32(s[i]));\n            }\n\n\n            int q = int.Parse(Console .ReadLine ());\n\n            double[] arr2 = new double[q];\n            for (int i = 0; i < q; i++)//共循环q行,先每个赋值为1\n\t\t\t{\n\t\t\t arr2[i]=Math .Log ( 1);\n\t\t\t}\n\n            ArrayList arr3 = new ArrayList();//留作arr2的后路\n\n            int b=0;\n            for (int i = 0; i < q; i++)//共循环q行\n            {\n                string T = Console.ReadLine();\n             string[] t = T.Split(' ');\n             int l = int.Parse(t[0]);\n             int r = int.Parse(t[1]);\n             for (int j = l-1; j <=r-1; j++)//每行都求价格\n             {\n                 arr2[b] = arr2[b] +arr1[j];\n                 \n             }\n             double may=arr2[b];//万一除巨大数除不开\n           double c=Math .Log ( Convert .ToInt32 ( Math.Pow(10,9))+7);//巨大数用对数形式表示\n           arr2[b] = arr2[b] - c;\n           if (arr2[b]<0)\n           {\n               arr2[b] = Convert.ToInt32( Math .Pow (Math .E ,may));\n           }\n           else\n           {\n               arr2[b] = Convert.ToInt32(Math.Pow(Math.E, may %c));\n           }\n             b++;\n            }\n\n            for (int i = 0; i < q; i++)\n            {\n                Console.WriteLine(arr2[i]);\n            }\n        }\n    }\n}\n",PARTIAL_ACCEPTED,21,3624
1469460684017487872,f681fb56800625452e852b74b1575730462f15f99840b5cb014e484778a825f9,2021-12-11 08:15:02,C,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<math.h>\n\ntypedef unsigned long long\tll;\n\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *s=(int *)malloc(sizeof(int)*n); \n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n\t\n\t\n\tint q,a,b;\n\n\n\tscanf(\""%d\"",&q);\n\t\n\tll *sum=(ll*)malloc(sizeof(ll)*q);\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tsum[i]=1;\n\t}\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tscanf(\""%d%d\"",&a,&b);\n\t\ta--;\n\t\tb--;\n\t\t\n\t\tfor(;a<=b;a++)\n\t\t{\n\t\t\tsum[i] *=s[a];\n\t\t}\n\t\t\n\t}\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tif(i==q-1)\n\t\t{\n\t\t\tprintf(\""%d\"",sum[i]);\n\t\t\tbreak;\n\t\t}\n\t\tprintf(\""%d\\n\"",sum[i]);\n\t}\n\t\n\t\n\t\n\t\n\t\n\t\n\treturn 0;\n\t\n}",PARTIAL_ACCEPTED,2,316
1469460731589218304,f681fb56800625452e852b74b1575730462f15f99840b5cb014e484778a825f9,2021-12-11 08:15:14,C,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<math.h>\n\ntypedef unsigned long long\tll;\n\nint main()\n{\n\tint n;\n\tscanf(\""%d\"",&n);\n\tint *s=(int *)malloc(sizeof(int)*n); \n\tfor(int i=0;i<n;i++)\n\t{\n\t\tscanf(\""%d\"",&s[i]);\n\t}\n\t\n\t\n\tint q,a,b;\n\n\n\tscanf(\""%d\"",&q);\n\t\n\tll *sum=(ll*)malloc(sizeof(ll)*q);\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tsum[i]=1;\n\t}\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tscanf(\""%d%d\"",&a,&b);\n\t\ta--;\n\t\tb--;\n\t\t\n\t\tfor(;a<=b;a++)\n\t\t{\n\t\t\tsum[i] *=s[a];\n\t\t}\n\t\t\n\t}\n\tfor(int i=0;i<q;i++)\n\t{\n\t\tif(i==q-1)\n\t\t{\n\t\t\tprintf(\""%d\"",sum[i]);\n\t\t\tbreak;\n\t\t}\n\t\tprintf(\""%d\\n\"",sum[i]);\n\t}\n\t\n\t\n\t\n\t\n\t\n\t\n\treturn 0;\n\t\n}",PARTIAL_ACCEPTED,2,196
1469511938949230592,1f23353996f2b06ea03e536a9b064c0bf1685dc174b482a280cda71279ee3bd4,2021-12-11 11:38:43,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\nclass Program\n{\n    static void Main(string[] args)\n    {\n        ulong n = Convert.ToUInt64(Console.ReadLine());\n        string s = Console.ReadLine();\n        ulong[] a = new ulong[n+1];\n        string[] str = s.Split(' ');\n        for(ulong i=0;i<=n-1;i++)\n        {\n            a[i] = Convert.ToUInt64(str[i]);\n        }\n        ulong Q = Convert.ToUInt64(Console.ReadLine());\n        ulong L=0, R=0;\n        for (ulong j=0;j<=Q-1;j++)\n        {\n            string s2 = Console.ReadLine();\n            string[] str2 = s2.Split(' ');\n\n            L = Convert.ToUInt64(str2[0]);\n            R = Convert.ToUInt64(str2[1]);\n            //Console.WriteLine((a[L]*a[R])%(Math.Pow(10,9)+7));\n            ulong money = 1;\n            for (ulong k = L-1; k <= R-1; k++)\n            {\n                money = money * a[k];\n            }\n            Console.WriteLine(money % (Math.Pow(10, 9) + 7));\n        }\n\n        \n        Console.ReadLine();\n    }\n}",PARTIAL_ACCEPTED,21,3868
1469560197935915008,b061bdf2814d7e6fe0e069841195ffba3ad1fcc81e5f85166a4ba653b537100f,2021-12-11 14:50:28,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\n\nnamespace Rurirat给fffteam买橘子\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int n = int.Parse(Console.ReadLine());\n            int[] arr = new int[n];\n            string[] str = Console.ReadLine().Split(' ');\n            for (int i = 0; i < n; i++)\n            {\n                arr[i] = int.Parse(str[i]);\n            }\n            int q = int.Parse(Console.ReadLine());\n            int[] l = new int[q]; int[] r = new int[q];\n            for (int i = 0; i < q; i++)\n            {\n                string[]str1=Console.ReadLine().Split(' ');\n                l[i] = int.Parse(str1[0]); r[i] = int.Parse(str1[1]);\n                if (i==q-1)\n                {\n                    for (int j = 0; j < q; j++)\n                    {\n                        Int64 o = 1;\n                        for (int z = l[j]-1; z <= r[j]-1; z++)\n                        {\n                            o *= arr[z];\n                        }\n                        Console.WriteLine(o);\n                        \n                    }\n                }\n                \n            }\n        }\n    }\n},PARTIAL_ACCEPTED,21,3600
1469591817560502272,be901ae6667a27a7e41ec4d8b4c987c749e49a12c0f3c134f32c83b44149183e,2021-12-11 16:56:07,C,0.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace 求满足条件的数的个数\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int ks = int.Parse(Console.ReadLine ());\n            string[] t = (Console.ReadLine()).Split(' ');\n            int[] sl=new int [ks];\n            UInt64 r = 1;\n            for (int i = 0; i < ks; i++)\n            {\n                sl[i] = int.Parse(t[i]);\n            }\n            int mf = int.Parse(Console.ReadLine ());\n            for (int i = 0; i < mf; i++)\n            {\n                string[] m = (Console.ReadLine()).Split(' ');\n                int a = int.Parse(m[0]);\n                int b = int.Parse(m[1]);\n                for (int j = a-1; j < b; j++)\n                {\n                    r *=Convert .ToUInt64 ( sl[j]);\n                }\n                r = r % (1000000000 + 7);\n                Console.WriteLine(r);\n                Console.ReadLine();\n            }\n        }\n    }\n},COMPILE_ERROR,0,0
1469591842684325888,be901ae6667a27a7e41ec4d8b4c987c749e49a12c0f3c134f32c83b44149183e,2021-12-11 16:56:13,C#,0.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace 求满足条件的数的个数\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int ks = int.Parse(Console.ReadLine ());\n            string[] t = (Console.ReadLine()).Split(' ');\n            int[] sl=new int [ks];\n            UInt64 r = 1;\n            for (int i = 0; i < ks; i++)\n            {\n                sl[i] = int.Parse(t[i]);\n            }\n            int mf = int.Parse(Console.ReadLine ());\n            for (int i = 0; i < mf; i++)\n            {\n                string[] m = (Console.ReadLine()).Split(' ');\n                int a = int.Parse(m[0]);\n                int b = int.Parse(m[1]);\n                for (int j = a-1; j < b; j++)\n                {\n                    r *=Convert .ToUInt64 ( sl[j]);\n                }\n                r = r % (1000000000 + 7);\n                Console.WriteLine(r);\n                Console.ReadLine();\n            }\n        }\n    }\n},MULTIPLE_ERROR,21,2956
1469592043029516288,be901ae6667a27a7e41ec4d8b4c987c749e49a12c0f3c134f32c83b44149183e,2021-12-11 16:57:01,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\n\nnamespace 求满足条件的数的个数\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            int ks = int.Parse(Console.ReadLine ());\n            string[] t = (Console.ReadLine()).Split(' ');\n            int[] sl=new int [ks];\n            \n            for (int i = 0; i < ks; i++)\n            {\n                sl[i] = int.Parse(t[i]);\n            }\n            int mf = int.Parse(Console.ReadLine ());\n            for (int i = 0; i < mf; i++)\n            {\n                UInt64 r = 1;\n                string[] m = (Console.ReadLine()).Split(' ');\n                int a = int.Parse(m[0]);\n                int b = int.Parse(m[1]);\n                for (int j = a-1; j < b; j++)\n                {\n                    r *=Convert .ToUInt64 ( sl[j]);\n                }\n                r = r % (1000000000 + 7);\n                Console.WriteLine(r);\n                \n            }\n            Console.ReadLine();\n        }\n    }\n},PARTIAL_ACCEPTED,21,3728
1469894115444633600,8bcba3e263aa63bddc2e1986d63ac205a11839e5f3b5713287027691458de15b,2021-12-12 12:57:21,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\n\nnamespace lanQiaoBei\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            //第三题\n            //int n = int.Parse(Console.ReadLine());\n            //if (n == 1)\n            //{\n            //    Console.WriteLine(0);\n            //}\n            //else if(n<18000000)\n            //{\n            //    int m = 0;\n            //    int x = 1; \n            //    while (m < n)\n            //    {\n            //        m = (int)(x * Math.Log(x, 10)) + 1;\n            //        x++;\n            //    }\n            //    Console.WriteLine(x - 1);\n            //}\n            //else\n            //{\n            //    int m = 0;\n            //    int x = 238723448;\n            //    do\n            //    {\n            //        m = (int)(x * Math.Log(x, 10)) + 1;\n            //        x--;\n            //    } while (m > n);\n            //    Console.WriteLine(x+2);\n            //}\n\n            //第四题\n            int n = int.Parse(Console.ReadLine());\n            int[] a = new int[n];\n            string s = Console.ReadLine();\n            string[] vs = s.Split(' ');\n            for (int i = 0; i < vs.Length; i++)\n            {\n                a[i] = int.Parse(vs[i]);\n            }\n            int m = int.Parse(Console.ReadLine());\n            for (int i = 0; i < m; i++)\n            {\n                string str = Console.ReadLine();\n                string[] tmp = str.Split(' ');\n                int[] b = new int[2];\n                b[0] = int.Parse(tmp[0]);\n                b[1] = int.Parse(tmp[1]);\n                int sum = a[b[0] - 1];\n                for (int j = b[0] - 1; j < b[1] - 1; j++)\n                {\n                    sum = sum % 1000000007 * a[j + 1] % 1000000007;\n                }\n                Console.WriteLine(sum% 1000000007);\n            }\n            //第五题\n            //int n = int.Parse(Console.ReadLine());\n            //int[,] num = new int[n, 2];\n            //for (int i = 0; i < n; i++)\n            //{\n            //    string s = Console.ReadLine();\n            //    string[] tmp = s.Split(' ');\n            //    for (int j = 0; j < 2; j++)\n            //    {\n            //        num[i, j] = int.Parse(tmp[j]);\n            //    }\n            //}\n            //int[] cnt1 = new int[n];\n            //int cnt = 0;\n            //for (int i = 0; i < n; i++)\n            //{\n            //    for (int j = 1; j < n; j++)\n            //    {\n            //        if (num[i, 0] == num[j, 0])\n            //        {\n            //            if (num[i, 1] - num[j, 1] > 60)\n            //            {\n            //                cnt++;\n            //            }\n            //        }\n            //    }\n            //}\n            //Console.WriteLine(cnt);\n\n            //第六题\n            //string s1 = Console.ReadLine();\n            //string s2 = Console.ReadLine();\n            //char[] c1 = s1.ToCharArray();\n            //char[] c2 = s2.ToCharArray();\n            //string sc1 = \""\"";\n            //string sc2 = \""\"";\n            //string sc3 = \""\"";\n            //string sc4 = \""\"";\n            //bool flag1 = true;\n            //bool flag2 = true;\n            //bool flag3 = true;\n            //bool flag4 = true;\n            //int l1 = 0;\n            //for (int i = 0; i < c1.Length; i++)\n            //{\n            //    if (flag1 && c1[i] == '0')\n            //    {\n            //    }\n            //    else\n            //    {\n            //        flag1 = false;\n            //        sc1 += c1[i];\n            //    }\n            //    if (c1[i] == '.')\n            //    {\n            //        l1 = i;\n            //    }\n            //}\n            //for (int i = c1.Length - 1; i >= l1; i--)\n            //{\n            //    if (flag3 && c1[i] == '0')\n            //    {\n            //    }\n            //    else\n            //    {\n            //        flag3 = false;\n            //        sc3 += c1[i];\n            //    }\n            //}\n            //string sc3r = \""\"";\n            //char[] a = new char[sc3.Length];\n            //for (int i = sc3.Length - 1; i >= 0; i--)\n            //{\n            //    sc3r += a[i];\n            //}\n            //double n = double.Parse(sc1 + sc3r);\n\n            //int l2 = 0;\n            //for (int i = 0; i < c2.Length; i++)\n            //{\n            //    if (flag2 && c2[i] == '0')\n            //    {\n            //    }\n            //    else\n            //    {\n            //        flag2 = false;\n            //        sc2 += c2[i];\n            //    }\n            //    if (c2[i] == '.')\n            //    {\n            //        l2 = i;\n            //    }\n            //}\n\n            //for (int i = c2.Length - 1; i >= l2; i--)\n            //{\n            //    if (flag4 && c1[i] == '0')\n            //    {\n            //    }\n            //    else\n            //    {\n            //        flag4 = false;\n            //        sc4 += c2[i];\n            //    }\n            //}\n            //char[] a2 = new char[sc4.Length];\n            //string sc4r = \""\"";\n            //for (int i = sc4.Length - 1; i >= 0; i--)\n            //{\n            //    sc4r += a2[i];\n            //}\n            //double m = double.Parse(sc2 + sc4r);\n\n            //Console.WriteLine(m + n);\n\n            //第七题\n            //int n = int.Parse(Console.ReadLine());\n            //ulong[] a = new ulong[n];\n            //for (int i = 0; i < n; i++)\n            //{\n            //    a[i] = ulong.Parse(Console.ReadLine());\n            //}\n            //ulong[] b = new ulong[n];\n            //for (int i = 0; i < n; i++)\n            //{\n            //    b[i] = a[i] * a[i];\n            //}\n            //for (int i = 0; i < n; i++)\n            //{\n            //    if (b[i] % 4 == 1)\n            //    {\n            //        if (a[i] % 10 == 1)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 2)\n            //        {\n            //            Console.WriteLine(2);\n            //        }\n            //        else if (a[i] % 10 == 3)\n            //        {\n            //            Console.WriteLine(3);\n            //        }\n            //        else if (a[i] % 10 == 4)\n            //        {\n            //            Console.WriteLine(4);\n            //        }\n            //        else if (a[i] % 10 == 5)\n            //        {\n            //            Console.WriteLine(5);\n            //        }\n            //        else if (a[i] % 10 == 6)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 7)\n            //        {\n            //            Console.WriteLine(7);\n            //        }\n            //        else if (a[i] % 10 == 8)\n            //        {\n            //            Console.WriteLine(8);\n            //        }\n            //        else if (a[i] % 10 == 9)\n            //        {\n            //            Console.WriteLine(9);\n            //        }\n            //    }\n            //    else if (b[i] % 4 == 2)\n            //    {\n\n            //        if (a[i] % 10 == 1)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 2)\n            //        {\n            //            Console.WriteLine(4);\n            //        }\n            //        else if (a[i] % 10 == 3)\n            //        {\n            //            Console.WriteLine(9);\n            //        }\n            //        else if (a[i] % 10 == 4)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 5)\n            //        {\n            //            Console.WriteLine(5);\n            //        }\n            //        else if (a[i] % 10 == 6)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 7)\n            //        {\n            //            Console.WriteLine(9);\n            //        }\n            //        else if (a[i] % 10 == 8)\n            //        {\n            //            Console.WriteLine(4);\n            //        }\n            //        else if (a[i] % 10 == 9)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //    }\n            //    else if (b[i] % 4 == 3)\n            //    {\n            //        if (a[i] % 10 == 1)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 2)\n            //        {\n            //            Console.WriteLine(8);\n            //        }\n            //        else if (a[i] % 10 == 3)\n            //        {\n            //            Console.WriteLine(7);\n            //        }\n            //        else if (a[i] % 10 == 4)\n            //        {\n            //            Console.WriteLine(4);\n            //        }\n            //        else if (a[i] % 10 == 5)\n            //        {\n            //            Console.WriteLine(5);\n            //        }\n            //        else if (a[i] % 10 == 6)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 7)\n            //        {\n            //            Console.WriteLine(3);\n            //        }\n            //        else if (a[i] % 10 == 8)\n            //        {\n            //            Console.WriteLine(2);\n            //        }\n            //        else if (a[i] % 10 == 9)\n            //        {\n            //            Console.WriteLine(9);\n            //        }\n            //    }\n            //    else if (b[i] % 4 == 0)\n            //    {\n            //        if (a[i] % 10 == 1)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 2)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 3)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 4)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 5)\n            //        {\n            //            Console.WriteLine(5);\n            //        }\n            //        else if (a[i] % 10 == 6)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 7)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 8)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 9)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 0)\n            //        {\n            //            Console.WriteLine(0);\n            //        }\n            //    }\n            //}\n        }\n        }\n}\n",PARTIAL_ACCEPTED,19,3784
1469894218729369600,8bcba3e263aa63bddc2e1986d63ac205a11839e5f3b5713287027691458de15b,2021-12-12 12:57:45,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\n\nnamespace lanQiaoBei\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            //第三题\n            //int n = int.Parse(Console.ReadLine());\n            //if (n == 1)\n            //{\n            //    Console.WriteLine(0);\n            //}\n            //else if(n<18000000)\n            //{\n            //    int m = 0;\n            //    int x = 1; \n            //    while (m < n)\n            //    {\n            //        m = (int)(x * Math.Log(x, 10)) + 1;\n            //        x++;\n            //    }\n            //    Console.WriteLine(x - 1);\n            //}\n            //else\n            //{\n            //    int m = 0;\n            //    int x = 238723448;\n            //    do\n            //    {\n            //        m = (int)(x * Math.Log(x, 10)) + 1;\n            //        x--;\n            //    } while (m > n);\n            //    Console.WriteLine(x+2);\n            //}\n\n            //第四题\n            int n = int.Parse(Console.ReadLine());\n            int[] a = new int[n];\n            string s = Console.ReadLine();\n            string[] vs = s.Split(' ');\n            for (int i = 0; i < vs.Length; i++)\n            {\n                a[i] = int.Parse(vs[i]);\n            }\n            int m = int.Parse(Console.ReadLine());\n            for (int i = 0; i < m; i++)\n            {\n                string str = Console.ReadLine();\n                string[] tmp = str.Split(' ');\n                int[] b = new int[2];\n                b[0] = int.Parse(tmp[0]);\n                b[1] = int.Parse(tmp[1]);\n                int sum = a[b[0] - 1];\n                for (int j = b[0] - 1; j < b[1] - 1; j++)\n                {\n                    sum = sum % 1000000007 * a[j + 1] % 1000000007;\n                }\n                Console.WriteLine(sum% 1000000007);\n            }\n  \n        }\n        }\n}\n",PARTIAL_ACCEPTED,21,3620
1469895200045654016,8bcba3e263aa63bddc2e1986d63ac205a11839e5f3b5713287027691458de15b,2021-12-12 13:01:39,C#,150.0,1375730370158333955,1367128166761762816,1139562740855824384,"using System;\n\nnamespace lanQiaoBei\n{\n    class Program\n    {\n        static void Main(string[] args)\n        {\n            //第三题\n            //int n = int.Parse(Console.ReadLine());\n            //if (n == 1)\n            //{\n            //    Console.WriteLine(0);\n            //}\n            //else if(n<18000000)\n            //{\n            //    int m = 0;\n            //    int x = 1; \n            //    while (m < n)\n            //    {\n            //        m = (int)(x * Math.Log(x, 10)) + 1;\n            //        x++;\n            //    }\n            //    Console.WriteLine(x - 1);\n            //}\n            //else\n            //{\n            //    int m = 0;\n            //    int x = 238723448;\n            //    do\n            //    {\n            //        m = (int)(x * Math.Log(x, 10)) + 1;\n            //        x--;\n            //    } while (m > n);\n            //    Console.WriteLine(x+2);\n            //}\n\n            //第四题\n            int n = int.Parse(Console.ReadLine());\n            int[] a = new int[n];\n            string s = Console.ReadLine();\n            string[] vs = s.Split(' ');\n            for (int i = 0; i < vs.Length; i++)\n            {\n                a[i] = int.Parse(vs[i]);\n            }\n            int m = int.Parse(Console.ReadLine());\n            for (int i = 0; i < m; i++)\n            {\n                string str = Console.ReadLine();\n                string[] tmp = str.Split(' ');\n                int[] b = new int[2];\n                b[0] = int.Parse(tmp[0]);\n                b[1] = int.Parse(tmp[1]);\n                int sum = a[b[0] - 1];\n                for (int j = b[0] - 1; j < b[1] - 1; j++)\n                {\n                    sum *= a[j + 1] % 1000000007;\n                }\n                Console.WriteLine(sum% 1000000007);\n            }\n            //第五题\n            //int n = int.Parse(Console.ReadLine());\n            //int[,] num = new int[n, 2];\n            //for (int i = 0; i < n; i++)\n            //{\n            //    string s = Console.ReadLine();\n            //    string[] tmp = s.Split(' ');\n            //    for (int j = 0; j < 2; j++)\n            //    {\n            //        num[i, j] = int.Parse(tmp[j]);\n            //    }\n            //}\n            //int[] cnt1 = new int[n];\n            //int cnt = 0;\n            //for (int i = 0; i < n; i++)\n            //{\n            //    for (int j = 1; j < n; j++)\n            //    {\n            //        if (num[i, 0] == num[j, 0])\n            //        {\n            //            if (num[i, 1] - num[j, 1] > 60)\n            //            {\n            //                cnt++;\n            //            }\n            //        }\n            //    }\n            //}\n            //Console.WriteLine(cnt);\n\n            //第六题\n            //string s1 = Console.ReadLine();\n            //string s2 = Console.ReadLine();\n            //char[] c1 = s1.ToCharArray();\n            //char[] c2 = s2.ToCharArray();\n            //string sc1 = \""\"";\n            //string sc2 = \""\"";\n            //string sc3 = \""\"";\n            //string sc4 = \""\"";\n            //bool flag1 = true;\n            //bool flag2 = true;\n            //bool flag3 = true;\n            //bool flag4 = true;\n            //int l1 = 0;\n            //for (int i = 0; i < c1.Length; i++)\n            //{\n            //    if (flag1 && c1[i] == '0')\n            //    {\n            //    }\n            //    else\n            //    {\n            //        flag1 = false;\n            //        sc1 += c1[i];\n            //    }\n            //    if (c1[i] == '.')\n            //    {\n            //        l1 = i;\n            //    }\n            //}\n            //for (int i = c1.Length - 1; i >= l1; i--)\n            //{\n            //    if (flag3 && c1[i] == '0')\n            //    {\n            //    }\n            //    else\n            //    {\n            //        flag3 = false;\n            //        sc3 += c1[i];\n            //    }\n            //}\n            //string sc3r = \""\"";\n            //char[] a = new char[sc3.Length];\n            //for (int i = sc3.Length - 1; i >= 0; i--)\n            //{\n            //    sc3r += a[i];\n            //}\n            //double n = double.Parse(sc1 + sc3r);\n\n            //int l2 = 0;\n            //for (int i = 0; i < c2.Length; i++)\n            //{\n            //    if (flag2 && c2[i] == '0')\n            //    {\n            //    }\n            //    else\n            //    {\n            //        flag2 = false;\n            //        sc2 += c2[i];\n            //    }\n            //    if (c2[i] == '.')\n            //    {\n            //        l2 = i;\n            //    }\n            //}\n\n            //for (int i = c2.Length - 1; i >= l2; i--)\n            //{\n            //    if (flag4 && c1[i] == '0')\n            //    {\n            //    }\n            //    else\n            //    {\n            //        flag4 = false;\n            //        sc4 += c2[i];\n            //    }\n            //}\n            //char[] a2 = new char[sc4.Length];\n            //string sc4r = \""\"";\n            //for (int i = sc4.Length - 1; i >= 0; i--)\n            //{\n            //    sc4r += a2[i];\n            //}\n            //double m = double.Parse(sc2 + sc4r);\n\n            //Console.WriteLine(m + n);\n\n            //第七题\n            //int n = int.Parse(Console.ReadLine());\n            //ulong[] a = new ulong[n];\n            //for (int i = 0; i < n; i++)\n            //{\n            //    a[i] = ulong.Parse(Console.ReadLine());\n            //}\n            //ulong[] b = new ulong[n];\n            //for (int i = 0; i < n; i++)\n            //{\n            //    b[i] = a[i] * a[i];\n            //}\n            //for (int i = 0; i < n; i++)\n            //{\n            //    if (b[i] % 4 == 1)\n            //    {\n            //        if (a[i] % 10 == 1)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 2)\n            //        {\n            //            Console.WriteLine(2);\n            //        }\n            //        else if (a[i] % 10 == 3)\n            //        {\n            //            Console.WriteLine(3);\n            //        }\n            //        else if (a[i] % 10 == 4)\n            //        {\n            //            Console.WriteLine(4);\n            //        }\n            //        else if (a[i] % 10 == 5)\n            //        {\n            //            Console.WriteLine(5);\n            //        }\n            //        else if (a[i] % 10 == 6)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 7)\n            //        {\n            //            Console.WriteLine(7);\n            //        }\n            //        else if (a[i] % 10 == 8)\n            //        {\n            //            Console.WriteLine(8);\n            //        }\n            //        else if (a[i] % 10 == 9)\n            //        {\n            //            Console.WriteLine(9);\n            //        }\n            //    }\n            //    else if (b[i] % 4 == 2)\n            //    {\n\n            //        if (a[i] % 10 == 1)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 2)\n            //        {\n            //            Console.WriteLine(4);\n            //        }\n            //        else if (a[i] % 10 == 3)\n            //        {\n            //            Console.WriteLine(9);\n            //        }\n            //        else if (a[i] % 10 == 4)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 5)\n            //        {\n            //            Console.WriteLine(5);\n            //        }\n            //        else if (a[i] % 10 == 6)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 7)\n            //        {\n            //            Console.WriteLine(9);\n            //        }\n            //        else if (a[i] % 10 == 8)\n            //        {\n            //            Console.WriteLine(4);\n            //        }\n            //        else if (a[i] % 10 == 9)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //    }\n            //    else if (b[i] % 4 == 3)\n            //    {\n            //        if (a[i] % 10 == 1)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 2)\n            //        {\n            //            Console.WriteLine(8);\n            //        }\n            //        else if (a[i] % 10 == 3)\n            //        {\n            //            Console.WriteLine(7);\n            //        }\n            //        else if (a[i] % 10 == 4)\n            //        {\n            //            Console.WriteLine(4);\n            //        }\n            //        else if (a[i] % 10 == 5)\n            //        {\n            //            Console.WriteLine(5);\n            //        }\n            //        else if (a[i] % 10 == 6)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 7)\n            //        {\n            //            Console.WriteLine(3);\n            //        }\n            //        else if (a[i] % 10 == 8)\n            //        {\n            //            Console.WriteLine(2);\n            //        }\n            //        else if (a[i] % 10 == 9)\n            //        {\n            //            Console.WriteLine(9);\n            //        }\n            //    }\n            //    else if (b[i] % 4 == 0)\n            //    {\n            //        if (a[i] % 10 == 1)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 2)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 3)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 4)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 5)\n            //        {\n            //            Console.WriteLine(5);\n            //        }\n            //        else if (a[i] % 10 == 6)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 7)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 8)\n            //        {\n            //            Console.WriteLine(6);\n            //        }\n            //        else if (a[i] % 10 == 9)\n            //        {\n            //            Console.WriteLine(1);\n            //        }\n            //        else if (a[i] % 10 == 0)\n            //        {\n            //            Console.WriteLine(0);\n            //        }\n            //    }\n            //}\n        }\n        }\n}\n",PARTIAL_ACCEPTED,20,3744
1590384101939548160,d3a74c4dde2b192eb5ed8d3b10cfe3a667251e5c62a0a5b84fe2c3655ab0aa8e,2022-11-10 00:41:32,C,4.0,1590270099314044933,1588364344855920640,1139563010419548160,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int x,y;\n    float s1,s2;\n    float i,sum;\n    scanf(\""%f\"",&i);\n   // x/(x+y)=i;\n   // for(i=1;i<=n;i++)\n        s1=i*log(i)/log(2);\n    s2=i*log(1-i)/log(2);\n    \n    sum=-(s1+s2);\n    printf(\""%.2f\\n\"",sum);\n}",PARTIAL_ACCEPTED,9,432
1590390014326935552,d3a74c4dde2b192eb5ed8d3b10cfe3a667251e5c62a0a5b84fe2c3655ab0aa8e,2022-11-10 01:05:02,C,4.0,1590270099314044933,1588364344855920640,1139563010419548160,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n    int x,y;\n    float s1,s2;\n    float j,i,sum;\n    scanf(\""%f\"",&i);\n   // x/(x+y)=i;\n    for(j=i;j<=i;j++)\n    {  s1=j*log(j)/log(2);\n    s2=j*log(1-j)/log(2);\n    \n    sum=-(s1+s2);\n    }\n    printf(\""%.2f\\n\"",sum);\n    return 0;\n}",PARTIAL_ACCEPTED,9,432
1591752634808426496,cdbc02fe104af06c0d65bb732fa6045ff836befdadb5069cedf83f4baff5dbf5,2022-11-13 19:19:36,C,0.0,1590270099314044933,1588364344855920640,1139563010419548160,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tdouble p1,p2,s=0;\n\tscanf(\""%lf\"",&p1);\n\tp2=1-p1;\n\ts=-p1*(log10(p1)/log10(2))+p2*(log10(p2)/log10(2));\n\tprintf(\""%.2lf\\n\"",s);\n\treturn 0; \n } ",WRONG_ANSWER,19,376
1591752855428816896,cdbc02fe104af06c0d65bb732fa6045ff836befdadb5069cedf83f4baff5dbf5,2022-11-13 19:20:28,C,10.0,1590270099314044933,1588364344855920640,1139563010419548160,"#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tdouble p1,p2,s=0;\n\tscanf(\""%lf\"",&p1);\n\tp2=1-p1;\n\ts=-(p1*(log10(p1)/log10(2))+p2*(log10(p2)/log10(2)));\n\tprintf(\""%.2lf\\n\"",s);\n\treturn 0; \n } ",ACCEPTED,30,368
1590426410638966784,456a0427ee5d8925f5406ec97440d060b15b5e6be71ce5cb77fcdf5c16f21204,2022-11-10 03:29:39,C,0.0,1590271364530040851,1588364344855920640,1139563010419548160,−∑ \ni=0\nC−1\n​\n p \ni\n​\n ∗log \n2\n​\n p \ni\n​\n,COMPILE_ERROR,0,0
1590435749328130048,456a0427ee5d8925f5406ec97440d060b15b5e6be71ce5cb77fcdf5c16f21204,2022-11-10 04:06:46,C,0.0,1590271364530040851,1588364344855920640,1139563010419548160,"#include <stdio.h>\n#include <math.h>\n\nint main() {\n    double n;\n    scanf(\""%lf\"", &n);\n    printf(\""%.2f\"", (n * log2(n)));\n    return 0;\n}",WRONG_ANSWER,6,436
1590520222010900480,5383515f1bd5a1868869308e9d300270bae2b72a2c45a4d1e38316d54d4dc124,2022-11-10 09:42:26,C,10.0,1590271364530040851,1588364344855920640,1139563010419548160,"# include<stdio.h>\n# include<math.h>\nint main()\n{\n    double p,a,b,c;\n    scanf(\""%lf\"",&p);\n    a=log2(p);\n    b=log2(1-p);\n    c=-(p*a+(1-p)*b);\n         printf(\""%.2f\"",c);\n    \n}",ACCEPTED,12,428
1590521144841666560,456a0427ee5d8925f5406ec97440d060b15b5e6be71ce5cb77fcdf5c16f21204,2022-11-10 09:46:06,C,0.0,1590271364530040851,1588364344855920640,1139563010419548160,"#include <stdio.h>\n#include <math.h>\n\nint main() {\n    double n;\n    scanf(\""%lf\"", &n);\n    printf(\""%.2f\"", (n * log2(n)) + ((1 - n) * log2(1 - n)));\n    return 0;\n}",WRONG_ANSWER,13,464
1590521333782478848,456a0427ee5d8925f5406ec97440d060b15b5e6be71ce5cb77fcdf5c16f21204,2022-11-10 09:46:51,C,10.0,1590271364530040851,1588364344855920640,1139563010419548160,"#include <stdio.h>\n#include <math.h>\n\nint main() {\n    double n;\n    scanf(\""%lf\"", &n);\n    printf(\""%.2f\"", -((n * log2(n)) + ((1 - n) * log2(1 - n))));\n    return 0;\n}",ACCEPTED,13,508
1590673209475792896,2cb0ca42fb488afce14aa85dddea40ce5aee61a9ef0ff44c89a0cf3144fd6a9d,2022-11-10 19:50:21,C,4.0,1590271364530040851,1588364344855920640,1139563010419548160,"#include<stdio.h>\nint main(){\n    double p,x;\n    scanf(\""%lf\"",&p);\n    x = log(p)/log(2);\n    p = -2*p*x;\n    printf(\""%.2lf\"",p);\n    return 0;\n}",PARTIAL_ACCEPTED,14,508
1590680288303296512,2cb0ca42fb488afce14aa85dddea40ce5aee61a9ef0ff44c89a0cf3144fd6a9d,2022-11-10 20:18:28,C,10.0,1590271364530040851,1588364344855920640,1139563010419548160,"#include<stdio.h>\n#include<math.h>\nint main(){\n    double p,x,q,y;\n    scanf(\""%lf\"",&p);\n    x = log(p)/log(2);\n    q = 1-p;\n    y = log(q)/log(2);\n    p = 0-(p*x+q*y);\n    printf(\""%.2lf\\n\"",p);\n    return 0;\n}",ACCEPTED,10,476
1590706202240135168,dd84bce7b9ebc5a5b6acd28104b0867333acabca44df1eaebefccd3bfebd0f54,2022-11-10 22:01:27,C,10.0,1590271364530040851,1588364344855920640,1139563010419548160,"#include<stdio.h>\nint main()\n{\n    float x;\n    scanf(\""%f\"",&x);\n    printf(\""%.2f\"",-(x*log2(x)+((1-x)*log2(1-x))));\n    return 0;\n}",ACCEPTED,16,504
1591704387041636352,37fc6141609665711ea4ac437ffdc2dc83ebbbca9f4afeafb13072b1379bc3e7,2022-11-13 16:07:52,C++,4.0,1590271364530040851,1588364344855920640,1139563010419548160,"#include <bits/stdc++.h>\n#include <cmath>\nusing namespace std;\n\nconst double e = 1e-8;\n\nint main()\n{\n    double p;\n    cin>>p;\n    if(fabs(log2(p)-0.5)>=0)\n    {\n        printf(\""1.00\"");\n    }else{\n        printf(\""0.00\"");\n    }\n}",PARTIAL_ACCEPTED,28,600
1591747057042599936,7e833b8c77eada8e444ecdae039e1308190c2791ba9d2fc4c8963c2c00a97128,2022-11-13 18:57:26,C++,10.0,1590271364530040851,1588364344855920640,1139563010419548160,"#include <bits/stdc++.h>\nusing namespace std;\nint main (){\n    double a,b;\n   cin>>a; \n    b=1-a;\n   double c=-a*log10(a)/log10(2)-b*log10(b)/log10(2);\n   printf (\""%.2lf\"",c);\n    \n    \n    return 0;\n}\n",ACCEPTED,33,620