Q1.

#include <iostream>
using namespace std;
int main() {
int v,a,t;
cin>>v>>a>>t;
int u=v-a*t;
cout<<u;
return 0;
}

Q2.
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N,K;
cin>>N>>K;
vector<long long> diff(N+2,0);
for(int i=0;i<K;i++){
int l,r,val;
cin>>l>>r>>val;
diff[l]+=val;
diff[r+1]-=val;
}
long long ans=0,cur=0;
for(int i=1;i<=N;i++){
cur+=diff[i];
if(cur>ans) ans=cur;
}
cout<<ans;
return 0;
}

Q3.
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main() {
int N;
cin>>N;
vector<int> arr(N);
for(int i=0;i<N;i++) cin>>arr[i];
set<int> s([Link](),[Link]());
cout<<[Link]();
return 0;
}

Q4.
#include <iostream>
using namespace std;
int main() {
int N;
cin>>N;
int x,minVal=100000;
for(int i=0;i<N;i++){
cin>>x;
if(x<minVal) minVal=x;
}
cout<<minVal;
return 0;
}

Q5.

#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin>>N;
vector<long long> A(N),B(N-1),C(N-2);
 long long sumA=0,sumB=0,sumC=0;
for(int i=0;i<N;i++){cin>>A[i];sumA+=A[i];}
for(int i=0;i<N-1;i++){cin>>B[i];sumB+=B[i];}
for(int i=0;i<N-2;i++){cin>>C[i];sumC+=C[i];}
cout<<sumA-sumB<<endl;
cout<<sumB-sumC;
return 0;
}

Q6.

#include <iostream>
using namespace std;
int main() {
char c;
cin>>c;
if(c>='a' && c<='z') cout<<char(c-'a'+'A');
else cout<<char(c-'A'+'a');
return 0;
}

Q7.
#include <iostream>
#include <string>
using namespace std;
bool isVowel(char c){
return c=='a'||c=='e'||c=='i'||c=='o'||c=='u'||
c=='A'||c=='E'||c=='I'||c=='O'||c=='U';
}
int main(){
long long n;
cin>>n;
string str;
cin>>str;
int count=0;
for(int i=[Link]()-1;i>=0;i--){
if(!isVowel(str[i])){
count++;
if(count==3){
cout<<str[i];
break;
}
}
}
return 0;
}

Q8.
#include <iostream>
#include <cmath>
using namespace std;
int main(){
long long n;
cin>>n;
long long sum=0;
for(long long i=1;i<=sqrt(n);i++){
if(n%i==0){
sum+=i;
if(i!=n/i) sum+=n/i;
}
}
cout<<sum;
return 0;
}

Q9.
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int N;
cin>>N;
while(N--){
long long A,B;
cin>>A>>B;
double h=sqrt((double)A*A+(double)B*B);
cout<<(long long)ceil(h)<<endl;
}
return 0;
}

Q10.
#include <iostream>
#include <string>
using namespace std;
bool isSpecial(const string &s){
int n=[Link]();
for(int i=1;i<n;i++){
string s1=[Link](0,i);
string s2=[Link](i);
bool ok1=true,ok2=true;
for(char c:s1) if(c!='a'){ok1=false;break;}
for(char c:s2) if(c!='b'){ok2=false;break;}
if(ok1 && ok2) return true;
}
return false;
}
int main(){
int T;
cin>>T;
int count=0;
while(T--){
string s;
cin>>s;
if(isSpecial(s)) count++;
}
cout<<count;
return 0;
}

Q11.
#include <iostream>
#include <sstream>
#include <string>
#include <unordered_map>
using namespace std;
int main(){
string line;
getline(cin,line);
unordered_map<string,char> mp={
{"zero",'0'},{"one",'1'},{"two",'2'},{"three",'3'},{"four",'4'},
{"five",'5'},{"six",'6'},{"seven",'7'},{"eight",'8'},{"nine",'9'}
};
stringstream ss(line);
string word,res;
while(ss>>word){
if(word=="double"){
string nxt; ss>>nxt;
res.push_back(mp[nxt]);
res.push_back(mp[nxt]);
}else if(word=="triple"){
string nxt; ss>>nxt;
res.push_back(mp[nxt]);
res.push_back(mp[nxt]);
res.push_back(mp[nxt]);
 }else{
res.push_back(mp[word]);
}
}
cout<<res;
return 0;
}

Q12.

#include <iostream>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
int sum=0;
if(a<0) sum+=a;
if(b<0) sum+=b;
 if(c<0) sum+=c;
if(d<0) sum+=d;
cout<<sum;
return 0;
}

Q13.

#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> arr(n),pos;
for(int i=0;i<n;i++){
cin>>arr[i];
if(arr[i]>=0) pos.push_back(arr[i]);
}
int mid=[Link]()/2;
if([Link]()%2==0) cout<<pos[mid-1];
else cout<<pos[mid];
return 0;
}

Q14.
#include <iostream>
using namespace std;
int main(){
long long A,B;
cin>>A>>B;
long long big=A*A*A;
long long small=B*B*B;
cout<<big/small;
return 0;
}

Q15.

#include <iostream>
using namespace std;

struct Node {
int data;
Node* next;
};

Node* createList(int n) {
Node* head = nullptr;
Node* tail = nullptr;
for(int i=0;i<n;i++){
int val; cin>>val;
Node* node = new Node();
node->data = val;
node->next = nullptr;
if(!head) head = tail = node;
else { tail->next = node; tail = node; }
}
return head;
}

Node* DeleteNodes(Node* head, int x) {

if(!head) return nullptr;
long long sum = 0;
Node* temp = head;
while(temp){ sum += temp->data; temp = temp->next; }
while(head && sum >= x){
sum -= head->data;
head = head->next;
}
return head;
}

int main(){
int x,n;
cin>>x>>n;
Node* head = createList(n);
head = DeleteNodes(head,x);
if(!head) return 0;
while(head){
cout<<head->data;
if(head->next) cout<<"->";
head = head->next;
}
return 0;
}