Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
nobita's candies problem
#include<bits/stdc++.h> using namespace std; int main() { int n; cin>>n; vector<int>a; for(int i=0;i<2*n;i++) { int x; cin>>x; a.push_back(x); } //int i=0; for(int i=0;i<2*n;) { cout<<a[i]%a[i+1]<<endl; i= 2+i; } return 0; }
run
|
edit
|
history
|
help
1
Binary Search
1234
LIS
half diamond or pyramid
Queue with Limited Size of Arrays
Best way for getting more precision no.
csv parser
merge without extra space Gap method ALgorithm
proga2
creating triangle using nested loop